Search results for "Crete"
showing 10 items of 2495 documents
Neural Network Based Finite-Time Stabilization for Discrete-Time Markov Jump Nonlinear Systems with Time Delays
2013
Published version of an article in the journal: Abstract and Applied Analysis. Also available from the publisher at: http://dx.doi.org/10.1155/2013/359265 Open Access This paper deals with the finite-time stabilization problem for discrete-time Markov jump nonlinear systems with time delays and norm-bounded exogenous disturbance. The nonlinearities in different jump modes are parameterized by neural networks. Subsequently, a linear difference inclusion state space representation for a class of neural networks is established. Based on this, sufficient conditions are derived in terms of linear matrix inequalities to guarantee stochastic finite-time boundedness and stochastic finite-time stabi…
Distributed Consensus for Discrete-Time Directed Networks of Multiagents with Time-Delays and Random Communication Links
2013
Published version of an article in the journal: Abstract and Applied Analysis. Also available from the publisher at: http://dx.doi.org/10.1155/2013/158731 Open Access This paper is concerned with the leader-following consensus problem in mean-square for a class of discrete-time multiagent systems. The multiagent systems under consideration are the directed and contain arbitrary discrete time-delays. The communication links are assumed to be time-varying and stochastic. It is also assumed that some agents in the network are well informed and act as leaders, and the others are followers. By introducing novel Lyapunov functionals and employing some new analytical techniques, sufficient conditi…
Exponential stability analysis of Markovian jump nonlinear systems with mixed time delays and partially known transition probabilities
2013
In this paper, the problem of exponential stability is studied for a class of Markovian jump neutral nonlinear systems with mixed neutral and discrete time delays. By Lyapunov-Krasovskii function approach, a novel mean-square exponential stability criterion is derived for the situation that the system's transition rates are partially or completely accessible. Finally, some numerical examples are provided to illustrate the effectiveness of the proposed methods.
Discrete Tomography Reconstruction Through a New Memetic Algorithm
2008
Discrete tomography is a particular case of computerized tomography that deals with the reconstruction of objects made of just one homogeneous material, where it is sometimes possible to reduce the number of projections to no more than four. Most methods for standard computerized tomography cannot be applied in the former case and ad hoc techniques must be developed to handle so few projections.
On Słowikowski, Raíkov and De Wilde Closed Graph Theorems
1986
Publisher Summary This chapter focuses on the Slowikowski, Raikov and De Wilde closed graph theorems. The vector spaces used in the chapter, are defined over the field Ղ of real or complex numbers. The term, “space” means separated topological vector space, unless the contrary is specifically stated. If Ω is a non-empty open subset of the n -dimensional euclidean space, then the Schwartz space ҟ′(Ω) endowed with the strong topology belongs to this class. The chapter also studies the classes of spaces related with this conjecture. The class of Slowikowski spaces contains the F-spaces and it is stable with respect to the operations that include: countable topological direct sums, closed subsp…
Clarkson-McCarthy inequalities with unitary and isometry orbits
2020
Abstract A refinement of a trace inequality of McCarthy establishing the uniform convexity of the Schatten p-classes for p > 2 is proved: if A , B are two n-by-n matrices, then there exists some pair of n-by-n unitary matrices U , V such that U | A + B 2 | p U ⁎ + V | A − B 2 | p V ⁎ ≤ | A | p + | B | p 2 . A similar statement holds for compact Hilbert space operators. Another improvement of McCarthy's inequality is given via the new operator parallelogramm law, | A + B | 2 ⊕ | A − B | 2 = U 0 ( | A | 2 + | B | 2 ) U 0 ⁎ + V 0 ( | A | 2 + | B | 2 ) V 0 ⁎ for some pair of 2n-by-n isometry matrices U 0 , V 0 .
A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
2021
Abstract The multiple vehicle traveling purchaser problem (MVTPP) consists of simultaneously selecting suppliers and routing a fleet of homogeneous vehicles to purchase different products at the selected suppliers so that all product demands are fulfilled and traveling and purchasing costs are minimized. We consider variants of the MVTPP in which the capacity of the vehicles can become binding and the demand for each product is one unit. Corresponding solution algorithms from the literature are either branch-and-cut or branch-and-price algorithms, where in the latter case the route-generation subproblem is solved on an expanded graph by applying standard dynamic-programming techniques. Our …
An Investigation of the Robustness in the Travelling Salesman Problem Routes Using Special Structured Matrices
2020
In this study, the robustness of the Travelling Salesman Problem (TSP) routes is investigated by recognising the special combinatorial structures of Kalmanson matrices. A recognition algorithm encompassing three procedures based on combinatorial and linear programming (LP) is developed and executed on several randomly generated instances. These procedures produce three lower bounds which provide guarantees on the optimality of the solutions. Computational experiments show that the proposed LP-based procedure performs efficiently well across all problem dimensions and provides the best lower bounds to the TSP. This is supported by an average deviation of less than 7% between the TSP tour len…
Visualization of Large Terrain Using Non-restricted Quadtree Triangulations
2004
This paper presents a set of new techniques oriented towards the real-time visualization of large terrains. These techniques are mainly focused on semi-regular triangulations of non-restricted quadtree terrain representations. Despite the fact that the paper shows that triangulations based on non-restricted quadtrees are as simple and efficient as those based on restricted quadtrees, the new triangulations avoid discontinuity problems among the boundaries of different patches without the need for tree balancing and extra triangles addition. Another important feature of the proposed triangulation is that it incorporates an efficient method for building triangle strips and triangle fans for t…
S-4 as a natural flavor symmetry for lepton mixing
2008
Group theoretical arguments seem to indicate the discrete symmetry S4 as the minimal flavour symmetry compatible with tribimaximal neutrino mixing. We prove in a model independent way that indeed S4 can realize exact tribimaximal mixing through different symmetry breaking patterns. We present two models in which lepton tribimaximal mixing is realized in different ways and for each one we discuss the superpotential that leads to the correct breaking of the flavor symmetry.