Ideal decompositions and computation of tensor normal forms.
Identifiability and estimation of pharmacokinetic parameters for the ligands of the macrophage mannose receptor
The aim of this paper is numerical estimation of pharmacokinetic parameters of the ligands of the macrophage mannose receptor, without knowing it a priori the values of these parameters. However, it first requires a model identifiability analysis, which is done by applying an algorithm implemented in a symbolic computation language. It is shown that this step can lead to a direct numerical estimation algorithm. In this way, a first estimate is computed from noisy simulated observations without it...
Implementation of adaptive generalized sidelobe cancellers using efficient complex valued arithmetic
Low complexity realizations of Least Mean Squared (LMS) error, Generalized Sidelobe Cancellers (GSCs) applied to adaptive beamforming are considered. The GSC method provides a simple way for implementing adaptive Linear Constraint Minimum Variance (LCMV) beamformers. Low complexity realizations of adaptive GSCs are of great importance for the design of high sampling rate, and/or small size and low power adaptive beamforming systems. The LMS algorithm and its Transform Domain (TD-LMS) counterpart...
Implementation of directed acyclic word graph
An effective implementation of a Directed Acyclic Word Graph (DAWG) automaton is shown. A DAWG for a text is a minimal automaton that accepts all substrings of a text , so it represents a complete index of the text. While all usual implementations of DAWG needed about 30 times larger storage space than was the size of the text, here we show an implementation that decreases this requirement down to four times the size of the text. The method uses a compression of DAWG elements, i. e. vertices,...
Implementing an interior point method for linear programs on a CPU-GPU system.
Implicitly Representing Arrangements of Lines or Segments.
Improvement to the cooperative rules methodology by using the ant colony system algorithm.
The cooperative rules (COR) methodology [2] is based on a combinatorial search of cooperative rules performed over a set of previously generated candidate rule consequents. It obtains accurate models preserving the highest interpretability of the linguistic fuzzy rule-based systems. Once the good behavior of the COR methodology has been proven in previous works, this contribution focuses on developing the process with a novel kind of metaheuristic algorithm: the ant colony system one. Thanks to...
In memoriam: Philippe Flajolet, the father of analytic combinatorics
In memoriam: Philippe Flajolet, the father of analytic combinatorics
Integral inequalities and computer algebra systems.
Integrated Design of an Active Flow Control System Using a Time-Dependent Adjoint Method
An exploratory study is performed to investigate the use of a time-dependent discrete adjoint methodology for design optimization of a high-lift wing configuration augmented with an active flow control system. The location and blowing parameters associated with a series of jet actuation orifices are used as design variables. In addition, a geometric parameterization scheme is developed to provide a compact set of design variables describing the wing...
Intégration algorithmique des fonctions élémentairement transcendantes sur une courbe algébrique
On considère le problème de déterminer les solutions d’une équation différentielle ordinaire, dite de Risch sur une courbe algébrique. En fait une généralisation assez évidente de la méthode de Risch suffit mais elle nous permet de généraliser son algorithme d’intégration à toute extension élémentairement transcendante d’une extension algébrique des fonctions rationnelles.
Introduction à l'algorithmique des objets partagés
Introduction to the Maple Power Tool Intpakx
The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006The Maple Power Tool intpakX [24] de nes Maple types for real intervals and complex disc intervals. On the level of basic operations, intpakX includes the four basic arithmetic operators, including extended interval division as an extra function. Furthermore, there are power, square, square root, logarithm and exponential functions, a set of standard functions, union,...
I/O-optimal algorithms for outerplanar graphs.
Irreducible cyclic presentations of the trivial group.