| An improved optimization algorithm for the time domain equalizer (TEQ) is developed in case of Frequency Division Multiplexing-based Asymmetric Digital Subscriber Line (FDM-ADSL). In contrast with existing algorithms, our algorithm explicitly disregards the unused tones in the optimization function as well as in the non-triviality constraint. Some simulation results are presented for the upst...

Constraint-based pattern discovery is at the core of numerous data mining tasks. Patterns are extracted with respect to a given set of constraints (frequency, closedness, size, etc). In practice, many constraints require threshold values whose choice is often arbitrary. This difficulty is even harder when several thresholds are required and have to be combined. Moreover, patterns barely missing...

We present a general approach for solving Constraint Optimization Problems. A Tabu Search is performed on a well-designed Consistent Neighbourhood built using Constraint Programming. After each variable assignment, the conflicting variables are deleted to maintain the consistency of the instantiated constraints. Hence, instead of allowing infeasible moves on complete configurations, it works on...

A = aerodynamic stiffness matrix C = speed of sound E = complex Fourier matrix f , F = physical and modal forces h = height of stream tube j = imaginary unit K, M = stiffness and mass matrices NB = number of blades P, Q = modal transformation matrices p = flow pressure Q = flow mass flux at the boundary q = generalized (modal) coordinate s = distance along the boundary T = period of flow unstea...

Synonymous sites are generally assumed to be subject to weak selective constraint. For this reason, they are often neglected as a possible source of important functional variation. We use site frequency spectra from deep population sequencing data to show that, contrary to this expectation, 22% of four-fold synonymous (4D) sites in Drosophila melanogaster evolve under very strong selective cons...

Abs t rac t . The goal of this paper is twofold. First, we introduce a class of local search procedures for solving optimization and constraint problems. These procedures are based on various heuristics for choosing variables and values in order to examine a general neighborhood. Second, four combinations of heuristics are empirically evaluated by using the graph-coloring problem and a real wor...

Constraint-based pattern discovery is at the core of numerous data mining tasks. Patterns are extracted with respect to a given set of constraints (frequency, closedness, size, etc). In the context of sequential pattern mining, a large number of devoted techniques have been developed for solving particular classes of constraints. The aim of this paper is to investigate the use of Constraint Pro...

| An improved optimization algorithm for the time domain equalizer (TEQ) is developed in case of Frequency Division Multiplexing-based Asymmetric Digital Subscriber Line (FDM-ADSL). In contrast with existing algorithms, our algorithm explicitly disregards the unused tones in the optimization function as well as in the non-triviality constraint. Some simulation results are presented for the upst...

A new method to reconstruct data acquired in a local tomography setup is proposed. This method uses an initial reconstruction and refines it by correcting the low-frequency artifacts, known as the cupping effect. A basis of Gaussian functions is used to correct the initial reconstruction. The coefficients of this basis are found by optimizing iteratively a fidelity term under the constraint of ...

Three-dimensional imaging provides profile information not available with conventional twodimensional imaging. Many three-dimensional objects of interest are opaque to the illuminating radiation, meaning that the object exhibits surface, as opposed to volume, scattering. We investigate the use of an opacity constraint to perform three-dimensional phase retrieval. The use of an opacity constrain...