Search results for "bound"
showing 10 items of 2948 documents
Time-varying Sampled-data Observer with Asynchronous Measurements
2019
International audience; In this paper a time-varying observer for a linear continuous-time plant with asynchronous sampled measurements is proposed. The observer is contextualized in the hybrid systems framework providing an elegant setting for the proposed solution. In particular some theoretical tools are provided, in terms of LMIs, certifying asymptotic stability of a certain compact set where the estimation error is zero. We consider sampled asynchronous measurements that occur at arbitrary times in a certain window with an upper and lower bound. The design procedure, that we propose for the selection of the time-varying gain, is based on a constructive algorithm that is guaranteed to f…
Buckling and post-buckling analysis of cracked stiffened panels via an X-Ritz method
2019
Abstract A multi-domain eXtended Ritz formulation, called X-Ritz, for the analysis of buckling and post-buckling of stiffened panels with cracks is presented. The theoretical framework is based on the First-order Shear Deformation Theory and accounts for von Karman's geometric nonlinearities. The structure is modeled as assembly of plate elements. Penalty techniques are used to fulfill the continuity condition along the edges of contiguous elements and to satisfy essential boundary conditions requirements. The use of an extended set of approximating functions allows to model through-the-thickness cracks and to capture the crack opening and tip singular fields as well as the structural behav…
Darboux integrable system with a triple point and pseudo-abelian integrals
2016
We study pseudo-abelian integrals associated with polynomial perturbations of Dar-boux integrable system with a triple point. Under some assumptions we prove the local boundedness of the number of their zeros. Assuming that this is the only non-genericity, we prove that the number of zeros of the corresponding pseudo-abelian integrals is bounded uniformly for nearby Darboux integrable foliations.
A singular elliptic equation and a related functional
2021
We study a class of Dirichlet boundary value problems whose prototype is [see formula in PDF] where 0 < p < 1 and f belongs to a suitable Lebesgue space. The main features of this problem are the presence of a singular term |u|p−2u and a datum f which possibly changes its sign. We introduce a notion of solution in this singular setting and we prove an existence result for such a solution. The motivation of our notion of solution to problem above is due to a minimization problem for a non–differentiable functional on [see formula in PDF] whose formal Euler–Lagrange equation is an equation of that type. For nonnegative solutions a uniqueness result is obtained.
New results on stability analysis and stabilization of time-delay continuous Markovian jump systems with partially known rates matrix
2015
Summary In this note, the problems of stability analysis and controller synthesis of Markovian jump systems with time-varying delay and partially known transition rates are investigated via an input–output approach. First, the system under consideration is transformed into an interconnected system, and new results on stochastic scaled small-gain condition for stochastic interconnected systems are established, which are crucial for the problems considered in this paper. Based on the system transformation and the stochastic scaled small-gain theorem, stochastic stability of the original system is examined via the stochastic version of the bounded realness of the transformed forward system. Th…
New delay-dependent stability of Markovian jump neutral stochastic systems with general unknown transition rates
2015
This paper investigates the delay-dependent stability problem for neutral Markovian jump systems with generally unknown transition rates GUTRs. In this neutral GUTR model, each transition rate is completely unknown or only its estimate value is known. Based on the study of expectations of the stochastic cross-terms containing the integral, a new stability criterion is derived in terms of linear matrix inequalities. In the mathematical derivation process, bounding stochastic cross-terms, model transformation and free-weighting matrix are not employed for less conservatism. Finally, an example is provided to demonstrate the effectiveness of the proposed results.
Dissipativity-Based Small-Gain Theorems for Stochastic Network Systems
2016
In this paper, some small-gain theorems are proposed for stochastic network systems which describe large-scale systems with interconnections, uncertainties and random disturbances. By the aid of conditional dissipativity and showing times of stochastic interval, small-gain conditions proposed for the deterministic case are extended to the stochastic case. When some design parameters are tunable in practice, we invaginate a simpler method to verify small-gain condition by selecting one subsystem as a monitor. Compared with the existing results, the existence-and-uniqueness of solution and ultimate uniform boundedness of input are removed from requirements of input-to-state stability and smal…
Stabilized branch-and-price algorithms for vector packing problems
2018
Abstract This paper considers packing and cutting problems in which a packing/cutting pattern is constrained independently in two or more dimensions. Examples are restrictions with respect to weight, length, and value. We present branch-and-price algorithms to solve these vector packing problems (VPPs) exactly. The underlying column-generation procedure uses an extended master program that is stabilized by (deep) dual-optimal inequalities. While some inequalities are added to the master program right from the beginning (static version), other violated dual-optimal inequalities are added dynamically. The column-generation subproblem is a multidimensional knapsack problem, either binary, boun…
Gray code for derangements
2004
AbstractWe give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants.
Graph Rewriting Based Search for Molecular Structures: Definitions, Algorithms, Hardness
2018
We define a graph rewriting system that is easily understandable by humans, but rich enough to allow very general queries to molecule databases. It is based on the substitution of a single node in a node- and edge-labeled graph by an arbitrary graph, explicitly assigning new endpoints to the edges incident to the replaced node. For these graph rewriting systems, we are interested in the subgraph-matching problem. We show that the problem is NP-complete, even on graphs that are stars. As a positive result, we give an algorithm which is polynomial if both rules and query graph have bounded degree and bounded cut size. We demonstrate that molecular graphs of practically relevant molecules in d…