State feedback design for input-saturating quadratic systems

This paper proposes a method to design stabilizing state feedback control laws for nonlinear quadratic systems subject to input saturation. Based on a quadratic Lyapunov function, a modified sector condition and a particular representation for the quadratic terms, synthesis conditions in a “quasi”-LMI form are stated in a regional (local) context. An LMI-based optimization problem is then derived for computing the state feedback gains maximizing the estimate of the stability region of the closed-loop system.     

Variable neighborhood search for the dial-a-ride problem

In dial-a-ride problems passengers have to be transported between pre-specified pickup and delivery locations under user inconvenience considerations. The problem variant considered in this paper aims at minimizing total routing costs while respecting maximum route duration limits, time windows, and maximum user ride time limits. We propose a competitive variable neighborhood search-based heuristic, using three classes of neighborhoods. The first neighborhood class uses simple swap operations tailored to the dial-a-ride problem; the second neighborhood class is based on the ejection chain idea; and the third neighborhood class exploits the existence of arcs where the vehicle load is zero, giving rise to natural sequences of requests. We report new best results for 16 out of 20 benchmark instances.     

Combined planning and scheduling in a divergent production system with co-production: A case study in the lumber industry

Many research initiatives carried out in production management consider process planning and operations scheduling as two separate and sequential functions. However, in certain contexts, the two functions must be better integrated. This is the case in divergent production systems with co-production (i.e. production of different products at the same time from a single product input) when alternative production processes are available. This paper studies such a context and focuses on the case of drying and finishing operations in a softwood lumber facility. The situation is addressed using a single model that simultaneously performs process planning and scheduling. We evaluate two alternative formulations. The first one is based on mixed integer programming (MIP) and the second on constraint programming (CP). We also propose a search procedure to improve the performance of the CP approach. Both approaches are compared with respect to their capacity to generate good solutions in short computation time.     

Surface plasmon resonance imaging (SPRi) as an alternative technique for rapid and quantitative screening of small molecules, useful in drug discovery

Surface plasmon resonance imaging (SPRi) is a label free technology for biomolecular interaction, which gives access to binding kinetic parameters from real time acquisition. It offers the possibility to test in a single run a large number of interactions, allowing rapid identification of the most suitable compounds toward a given biological entity. Until now, this technique has proven to be relevant for interaction between relatively large molecules (protein, antibodies, DNA) but has not been challenged yet for the screening of small molecules that can be of interested in the field of drug discovery. As a proof a principle, we have used SPRi to screen for interaction of several small molecules, referred to as G4-ligands on G-quadruplex DNA. This technology allowed to easy discrimination of the binding properties of four G4-ligands on quadruplex DNA models.     

Anti-windup strategies for discrete-time switched systems subject to input saturation

This paper deals with the design of anti-windup compensator for discrete-time switched systems subject to input saturation. The cases of static and dynamic anti-windup controllers are addressed aiming at maximising the estimate of the basin of attraction of the origin for the closed-loop system. Two aspects of the switching law are taken into account during the design: either it is arbitrary or it is a part of the complete control law. Theoretical conditions allowing to synthesise the anti-windup compensator are mainly described through linear matrix inequalities. Computational oriented conditions are then provided to solve convex optimisation problems that are able to give a constructive solution.     

Gambling versus Designing: Organizing for the Design of the Probability Space in the Energy Sector

The objective of this paper is to elucidate an organizational process for the design of generic technologies (GTs). While recognizing the success of GTs, the literature on innovation management generally describes their design according to evolutionary strategies featuring multiple and uncertain trials, resulting in the discovery of common features among multiple applications. This random walk depends on multiple market and technological uncertainties that are considered exogenous: as smart as he can be, the ‘gambler’ must play in a given probability space. However, what happens when the innovator is not a gambler but a designer, i.e., when the actor is able to establish new links between previously independent emerging markets and technologies? Formally speaking, the actor designs a new probability space. Building on a case study of two technological development programmes at the French Center for Atomic Energy, we present cases of GTs that correspond to this logic of designing the probability space, i.e. the logic of intentionally designing common features that bridge the gap between a priori heterogeneous applications and technologies. This study provides another example showing that the usual trial‐and‐learning strategy is not the only strategy to design GTs and that these technologies can be designed by intentionally building new interdependences between markets and technologies. Our main result is that building these interdependences requires organizational patterns that correspond to a ‘design of exploration’ phase in which multiple technology suppliers and application providers are involved in designing both the probability space itself and the instruments to explore and benefit from this new space.     

Kolmogorov complexity and combinatorial methods in communication complexity

We introduce a method based on Kolmogorov complexity to prove lower bounds on communication complexity. The intuition behind our technique is close to information theoretic methods.We use Kolmogorov complexity for three different things: first, to give a general lower bound in terms of Kolmogorov mutual information; second, to prove an alternative to Yao’s minmax principle based on Kolmogorov complexity; and finally, to identify hard inputs.We show that our method implies the rectangle and corruption bounds, known to be closely related to the subdistribution bound. We apply our method to the hidden matching problem, a relation introduced to prove an exponential gap between quantum and classical communication. We then show that our method generalizes the VC dimension and shatter coefficient lower bounds. Finally, we compare one-way communication and simultaneous communication in the case of distributional communication complexity and improve the previous known result.     

Structure cristalline et proprietes physiques de Cu0.75 VS2

A new compound with composition Cu_0.75 VS₂ has been prepared. Its preparation, X-Ray structure, electrical and magnetic properties are reported. The structure is related to the CdI₂-type, as in the case of the previously described Cu_xTiS₂ (1); in Cu_0.75 VS₂, Cu atoms are ordered in tetrahedral sites between the CdI₂-type subunits, whereas in Cu_xTiS₂ Cu atoms are disordered in two independent sites. The vanadium atoms are shifted with respect to the titanium sites which leads a monoclinic distortion of the hexagonal cell. The relation between the CdI₂ unit cell and the true monoclinic cell of Cu_0.75 VS₂ is:

$\text{a}{}_{\mathrm{<mtext>mono</mtext>}}\text{= 2}\text{a}{}_{\mathrm{<mtext>hex</mtext>}}\text{3}\text{;}\text{b}{}_{\mathrm{<mtext>mono</mtext>}}\text{=}\text{4}\text{3}\text{a}{}^2{}_{\mathrm{<mtext>hex</mtext>}}\text{+}\text{c}{}^2{}_{\mathrm{<mtext>hex</mtext>}}\text{9}\text{;}\text{c}{}_{\mathrm{<mtext>mono</mtext>}}\text{= 2}\text{a}{}_{\mathrm{<mtext>hex</mtext>}}$

In Cu_0.75 VS₂, vanadium atoms occupy two independent sites, three vanadium atoms forming a triangular cluster (V₂—V₃ distances are 2.91 Å and V₃—V₃ are 2.92 Å) while one vanadium atom is isolated ($\text{V}{}_1\text{?}\text{V}{}_2\text{= 3.36}\text{A}\text{?}$ and $\text{V}{}_1\text{?}\text{V}{}_3\text{= 3.37}\text{A}\text{?}$. The physical properties exhibit a transition at 50°K approximately, the magnetic susceptibility being temperature-independent above and temperature dependent below the transition (Curie-Weiss behavior). Resistivity and Hall measurements confirm the metallic nature of the compound and show the existence of the low temperature transition. The observed properties could be interpreted as a result of the low temperature localisation of the 3d electron of V₁.     

A finite element method for poro mechanical modelling of geotechnical problems using local second gradient models

In this paper, a new finite element method is described and applied. It is based on a theory developed to model poromechanical problems where the mechanical part is obeying a second gradient theory. The aim of such a work is to properly model the post localized behaviour of soils and rocks saturated with a pore fluid. Beside the development of this new coupled theory, a corresponding finite element method has been developed. The elements used are based on a weak form of the relation between the deformation gradient and the second gradient, using a field of Lagrange multipliers. The global problem is solved by a system of equations where the kinematic variables are fully coupled with the pore pressure. Some numerical experiments showing the effectiveness of the method ends the paper. Copyright © 2005 John Wiley & Sons, Ltd.