Implicitly Representing Arrangements of Lines or Segments.
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...
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...
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.
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,...
In this paper, we consider a class of scheduling problems that are among the fundamental optimization problems in operations research. More specifically, we deal with a particular version called job shop scheduling with unit length tasks. Using the results of Hromkovič, Mömke, Steinhöfel, and Widmayer presented in their work Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms, we analyze the problem setting for 2 jobs with an unequal number of tasks. We contribute a deterministic algorithm...
In this paper, we consider a class of scheduling problems that are among the fundamental optimization problems in operations research. More specifically, we deal with a particular version called job shop scheduling with unit length tasks. Using the results of Hromkovič, Mömke, Steinhöfel, and Widmayer presented in their work Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms, we analyze the problem setting for 2 jobs with an unequal...
In this work, we present an introduction to automatic differentiation, its use in optimization software, and some new potential usages. We focus on the potential of this technique in optimization. We do not dive deeply in the intricacies of automatic differentiation, but put forward its key ideas. We sketch a survey, as of today, of automatic differentiation software, but warn the reader that the situation with respect to software evolves rapidly. In the last part of the paper, we present some...