A tabu search with an oscillation strategy for the discriminant analysis problem

This article proposes a tabu search approach to solve a mathematical programming formulation of the linear classification problem, which consists of determining an hyperplane that separates two groups of points as well as possible in ?^m. The tabu search approach proposed is based on a non-standard formulation using linear system infeasibility. The search space is the set of bases defined on the matrix that describes the linear system. The moves are performed by pivoting on a specified row and column. On real machine learning databases, our approach compares favorably with implementations based on parametric programming and irreducible infeasible constraint sets. Additional computational results for randomly generated instances confirm that our method provides a suitable alternative to the mixed integer programming formulation that is solved by a commercial code when the number of attributes m increases.     

A novel packaging approach for RF MEMS switching functions on alumina substrate

This paper reports the design of a hermetic-compatible wafer-scale package for RF MEMS based components. The presented packaging concept consists in encapsulating the whole RF device or subsystem instead of encapsulating each MEMS component separately, which will reduce the device size and cost. This approach is based on the MEMS fabrication technology on ceramic substrate and the use of laser drilled vias hole techniques to realize full metallized vias in alumina substrates. These vias holes will allow a low loss RF signal transmission inside the package without breaking its hermeticity. Hence, several packaged switching networks prototypes, based on ohmic contact MEMS switches, have been designed following this approach and the packaging electromagnetic impact on these components has been especially studied to result on good performance devices.     

Algorithm selection and instance space analysis for curriculum-based course timetabling

Journal of Scheduling - We propose an algorithm selection approach and an instance space analysis for the well-known curriculum-based course timetabling problem (CB-CTT), which is an important...     

Microscale and mesoscale discrete models for dynamic fracture of structures built of brittle material

In this work we present the discrete models for dynamic fracture of structures built of brittle materials. The models construction is based on Voronoi cell representation of the heterogeneous structure, with the beam lattice network used to model the cohesive and compressive forces between the neighboring cells. Each lattice component is a geometrically exact shear deformable beam which can describe large rigid body motion and the most salient fracture mechanisms. The latter can be represented through the corresponding form of the beam constitutive equations, which are derived either at microscale with random distribution of material properties or at a mesoscale with average deterministic values. The proposed models are also placed within the framework of dynamics, where special attention is paid to constructing the lattice network mass matrix as well as the corresponding time-stepping schemes. Numerical simulations of compression and bending tests is given to illustrate the models performance.     

Multi-heuristic scheduling: three approaches to tune compromises

Most of the available industrial schedulers are based on a simulation approach using dispatching rules. These rules are often dedicated to the satisfaction of a single performance criterion, and are used whatever the characteristics of the workshop or of the set of jobs. An approach which allows one to bring in compromises between rules is set out in this paper. These compromises can be parametered in accordance with the objectives of the workshop and the characteristics of the jobs in order to introduce some reactivity in the decision system. Three ways to set up the parameters are compared: experimental design, fuzzy expert system and neural network. The method allowing one to define compromises can be implemented on each scheduler that uses a simulation approach. Tests have been made with an industrial scheduler called SIPAPLUS, the results of which are developed in this paper.     

Linearly bounded infinite graphs

Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural class of infinite automata representing their observable computational behavior, called linearly bounded graphs. These automata naturally accept the same languages as the linearly bounded machines defining them. We present some of their structural properties as well as alternative characterizations in terms of rewriting systems and context-sensitive transductions. Finally, we compare these graphs to rational graphs, which are another class of automata accepting the context-sensitive languages, and prove that in the bounded-degree case, rational graphs are a strict sub-class of linearly bounded graphs.A preliminary version of this article appeared in MFCS 2005.     

A practical approach for robust control of flexible structures

This paper deals with the robust control of linear single-input, single-output (SISO) systems. First, general concepts of the frequency-domain approach are presented. We then focus on the particular problem of flexible structure and control. A new method is proposed which combines the advantages of hyperstability and small gain approaches. Finally, an application of an industrial sight system prototype is detailed.     

Supporting multiple perspectives in feature-based configuration

Feature diagrams have become commonplace in software product line engineering as a means to document variability early in the life cycle. Over the years, their application has also been extended to assist stakeholders in the configuration of software products. However, existing feature-based configuration techniques offer little support for tailoring configuration views to the profiles of the various stakeholders. In this paper, we propose a lightweight, yet formal and flexible, mechanism to leverage multidimensional separation of concerns in feature-based configuration. We propose a technique to specify concerns in feature diagrams and to generate automatically concern-specific configuration views. Three alternative visualisations are proposed. Our contributions are motivated and illustrated through excerpts from a real web-based meeting management application which was also used for a preliminary evaluation. We also report on the progress made in the development of a tool supporting multi-view feature-based configuration.