Search results for "decomposition method"
showing 10 items of 29 documents
Une structure o-minimale sans décomposition cellulaire
2008
Resume Nous construisons une extension o-minimale du corps des nombres reels qui n'admet pas la propriete de decomposition cellulaire en classe C ∞ . Pour citer cet article : O. Le Gal, J.-P. Rolin, C. R. Acad. Sci. Paris, Ser. I 346 (2008).
A decomposition approach to dual shuttle automated storage and retrieval systems
2016
[EN] Automated Storage and Retrieval Systems (AS/RS) have become vital in today¿s distribution and production environments, however it remains necessary to equip them with more efficient operational control policies. Motivated by real situations encountered by companies employing AS/RS, the present paper studies a miniload AS/RS system, with a dual shuttle crane in which a set of storage and retrieval requests must be scheduled such that the prioritized waiting time is minimized. Dual shuttle cranes have received minimal academic attention and thus continue to pose new problems that must be solved. The miniload AS/RS problem is addressed by decomposing it into a location assignment and sequ…
Decomposition and Mean-Field Approach to Mixed Integer Optimal Compensation Problems
2016
Mixed integer optimal compensation deals with optimization problems with integer- and real-valued control variables to compensate disturbances in dynamic systems. The mixed integer nature of controls could lead to intractability in problems of large dimensions. To address this challenge, we introduce a decomposition method which turns the original n-dimensional optimization problem into n independent scalar problems of lot sizing form. Each of these problems can be viewed as a two-player zero-sum game, which introduces some element of conservatism. Each scalar problem is then reformulated as a shortest path one and solved through linear programming over a receding horizon, a step that mirro…
Evolving Notch polyQ tracts reveal possible solenoid interference elements.
2016
ABSTRACTPolyglutamine (polyQ) tracts in regulatory proteins are extremely polymorphic. As functional elements under selection for length, triplet repeats are prone to DNA replication slippage and indel mutations. Many polyQ tracts are also embedded within intrinsically disordered domains, which are less constrained, fast evolving, and difficult to characterize. To identify structural principles underlying polyQ tracts in disordered regulatory domains, here I analyze deep evolution of metazoan Notch polyQ tracts, which can generate alleles causing developmental and neurogenic defects. I show that Notch features polyQ tract turnover that is restricted to a discrete number of conserved “polyQ …
Domain decomposition in the symmetric boundary element analysis
2002
Recent developments in the symmetric boundary element method (SBEM) have shown a clear superiority of this formulation over the collocation method. Its competitiveness has been tested in comparison to the finite element method (FEM) and is manifested in several engineering problems in which internal boundaries are present, i.e. those in which the body shows a jump in the physical characteristics of the material and in which an appropriate study of the response must be used. When we work in the ambit of the SBE formulation, the body is subdivided into macroelements characterized by some relations which link the interface boundary unknowns to the external actions. These relations, valid for e…
Multidomain boundary integral formulation for piezoelectric materials fracture mechanics
2001
Abstract A boundary element method and its numerical implementation for the analysis of piezoelectric materials are presented with the aim to exploit their features in linear electroelastic fracture mechanics. The problem is formulated employing generalized displacements, that is displacements and electric potential, and generalized tractions, that is tractions and electric displacement. The generalized displacements boundary integral equation is obtained by using the closed form of the piezoelasticity fundamental solutions. These are derived through a displacement based modified Lekhnitskii’s functions approach. The multidomain boundary element technique is implemented to achieve the numer…
Numerical Algorithms Based on Characteristic Domain Decomposition for Obstacle Problems
1997
A new numerical solution algorithm for obstacle problems is proposed, where the characteristic domain decomposition into active and inactive subdomains separated by the free boundary is approximated by a Schwarz method. Such an approach gives an opportunity to apply fast linear system solvers to genuinely non-linear obstacle problems. Other solution algorithms, like projected relaxation methods and active set strategies, are compared to the new solution algorithm. Numerical experiments related to the elastoplastic torsion problem are included showing the efficiency of the new approach.
Boundary elements analysis of adhesively bonded piezoelectric active repair
2009
Abstract This paper presents the analysis of active piezoelectric patches for cracked structures by the boundary element method. A two-dimensional boundary integral formulation based on the multidomain technique is used to model cracks and to assemble the multi-layered piezoelectric patches to the host damaged structures. The fracture mechanics behavior of the repaired structures is analyzed for both perfect and imperfect interface between patches and host beams. The imperfect interface, representing the adhesive between two different layers, is modeled by using a “spring model” that involves linear relationships between the interface tractions, in normal and tangential directions, and the …
Exploiting seeding of random number generators for efficient domain decomposition parallelization of dissipative particle dynamics
2013
Abstract Dissipative particle dynamics (DPD) is a new promising method commonly used in coarse-grained simulations of soft matter and biomolecular systems at constant temperature. The DPD thermostat involves the evaluation of stochastic or random forces between pairs of neighboring particles in every time step. In a parallel computing environment, the transfer of these forces from node to node can be very time consuming. In this paper we describe the implementation of a seeded random number generator with three input seeds at each step which enables the complete generation of the pairwise stochastic forces in parallel DPD simulations with minimal communication between nodes.
A Feature Set Decomposition Method for the Construction of Multi-classifier Systems Trained with High-Dimensional Data
2013
Data mining for the discovery of novel, useful patterns, encounters obstacles when dealing with high-dimensional datasets, which have been documented as the "curse" of dimensionality. A strategy to deal with this issue is the decomposition of the input feature set to build a multi-classifier system. Standalone decomposition methods are rare and generally based on random selection. We propose a decomposition method which uses information theory tools to arrange input features into uncorrelated and relevant subsets. Experimental results show how this approach significantly outperforms three baseline decomposition methods, in terms of classification accuracy.