Search results for "optimization"
showing 10 items of 2824 documents
MAC Design for WiFi Infrastructure Networks: A Game-Theoretic Approach
2011
In WiFi networks, mobile nodes compete for accessing a shared channel by means of a random access protocol called Distributed Coordination Function (DCF). Although this protocol is in principle fair, since all the stations have the same probability to transmit on the channel, it has been shown that unfair behaviors may emerge in actual networking scenarios because of non-standard configurations of the nodes. Due to the proliferation of open source drivers and programmable cards, enabling an easy customization of the channel access policies, we propose a game-theoretic analysis of random access schemes. Assuming that each node is rational and implements a best response strategy, we show that…
The temporal analogue of diffractive couplers
2020
International audience; Based on the space-time duality of light, we numerically demonstrate that temporal dispersion grating couplers can generate from a single pulse an array of replicas of equal amplitude. The phase-only profile of the temporal grating is optimized by a genetic algorithm that takes into account the optoelectronic bandwidth limitations of the setup.
Small-time bilinear control of Schrödinger equations with application to rotating linear molecules
2023
In [14] Duca and Nersesyan proved a small-time controllability property of nonlinear Schrödinger equations on a d-dimensional torus $\mathbb{T}^d$. In this paper we study a similar property, in the linear setting, starting from a closed Riemannian manifold. We then focus on the 2-dimensional sphere $S^2$, which models the bilinear control of a rotating linear top: as a corollary, we obtain the approximate controllability in arbitrarily small times among particular eigenfunctions of the Laplacian of $S^2$.
The General Routing Problem polyhedron: Facets from the RPP and GTSP polyhedra
1998
[EN] In this paper we study the polyhedron associated with the General Routing Problem (GRP). This problem, first introduced by Orloff in 1974, is a generalization of both the Rural Postman Problem (RPP) and the Graphical Traveling Salesman Problem (GTSP) and, thus, is NP -hard. We describe a formulation of the problem such that from every non-trivial facet-inducing inequality for the RPP and GTSP polyhedra, we obtain facet-inducing inequalities for the GRP polyhedron, We describe a new family of facet-inducing inequalities for the GRP, the honeycomb constraints, which seem to be very useful for solving GRP and RPP instances. Finally, new classes of facets obtained by composition of facet-i…
Hierarchical fast BEM for anisotropic time-harmonic 3-D elastodynamics
2012
The paper presents a fast boundary element method for anisotropic time-harmonic 3-D elastodynamic problems. The approach uses the hierarchical matrices format and the ACA algorithm for the collocation matrix setup and a preconditioned GMRES solver for the solution. The development of this approach for the anisotropic case presents peculiar aspects which deserve investigation and are studied in the paper leading to the employed computational strategy and its effective tuning. Numerical experiments are presented to assess the method accuracy, performances and numerical complexity. The method ensures adequate accuracy allowing remarkable reductions in computation time and memory storage.
Feedback Classification and Optimal Control with Applications to the Controlled Lotka-Volterra Model
2023
Let M be a σ-compact C^∞ manifold of dimension n ≥ 2 and consider a single-input control system: ẋ(t) = X (x(t)) + u(t) Y (x(t)), where X , Y are C^∞ vector fields on M. We prove that there exist an open set of pairs (X , Y ) for the C^∞ –Whitney topology such that they admit singular abnormal rays so that the spectrum of the projective singular Hamiltonian dynamics is feedback invariant. It is applied to controlled Lotka–Volterra dynamics where such rays are related to shifted equilibria of the free dynamics.
Avoiding strange attractors in efficient parametric families of iterative methods for solving nonlinear problems
2019
[EN] Searching zeros of nonlinear functions often employs iterative procedures. In this paper, we construct several families of iterative methods with memory from one without memory, that is, we have increased the order of convergence without adding new functional evaluations. The main aim of this manuscript yields in the advantage that the use of real multidimensional dynamics gives us to decide among the different classes designed and, afterwards, to select its most stable members. Moreover, we have found some elements of the family whose behavior includes strange attractors of different kinds that must be avoided in practice. In this sense, Feigenbaum diagrams have resulted an extremely …
On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
1990
This paper deals with multiobjective programming in which the objective functions are nonsymmetric distances (derived from different gauges) to the points of a fixed finite subset of ℝn. It emphasizes the case in which the gauges are polyhedral. In this framework the following result is known: if the gauges are polyhedral, then each Pareto optimum is the solution to a Fermat—Weber problem with strictly positive coefficients. We give a new proof of this result, and we show that it is useful in finding the whole set of efficient points of a location problem with polyhedral gauges. Also, we characterize polyhedral gauges in terms of a property of their subdifferential.
Full- and reduced-order filter design for discrete-time T-S fuzzy systems with time-varying delay
2012
This paper is focused on the problem of ℋ ∞ filtering for a class of discrete-time T-S fuzzy time-varying delay systems. Our interest is how to design full- and reduced-order filters that guarantee the filtering error system to be asymptotically stable with a prescribed ℋ ∞ performance. Sufficient conditions for the obtained filtering error system are proposed by applying an input-output approach and a two-term approximation method, which is employed to approximate the time-varying delay. The corresponding full and reduced-order filter design is cast into a convex optimization problem, which can be efficiently solved by standard numerical algorithms.
Robust H;<inf>&#x221E;</inf> filtering for 2-D FM systems: A finite frequency approach
2012
This paper investigates the problem of robust H; ∞ filtering for uncertain two-dimensional (2-D) discrete systems in the Fornasini-Marchesini local state-space (FM LSS) model with polytopic uncertain parameters. The goal of the paper is to design filters such that the finite frequency (FF) H; ∞ norm of the filtering error system has a specified upper bound for all uncertainties. A generalized bounded real lemma (BRL) is first derived for FF H; ∞ performance analysis of nominal 2-D FM LSS systems, and then a method, in terms of solving optimization problems with LMI constraints, is presented for robust FF H; ∞ filter analysis and design. An illustrative example is given to show the improveme…