Search results for "lower bounds"

Failure of topological rigidity results for the measure contraction property

2014

We give two examples of metric measure spaces satisfying the measure contraction property MCP(K,N) but having different topological dimensions at different regions of the space. The first one satisfies MCP(0,3) and contains a subset isometric to $\mathbb{R}$, but does not topologically split. The second space satisfies MCP(2,3) and has diameter $\pi$, which is the maximal possible diameter for a space satisfying MCP(N-1,N), but is not a topological spherical suspension. The latter example gives an answer to a question by Ohta.

A matheuristic for the Team Orienteering Arc Routing Problem

2015

In the Team OrienteeringArc Routing Problem (TOARP) the potential customers are located on the arcs of a directed graph and are to be chosen on the basis of an associated profit. A limited fleet of vehicles is available to serve the chosen customers. Each vehicle has to satisfy a maximum route duration constraint. The goal is to maximize the profit of the served customers. We propose a matheuristic for the TOARP and test it on a set of benchmark instances for which the optimal solution or an upper bound is known. The matheuristic finds the optimal solutions on all, except one, instances of one of the four classes of tested instances (with up to 27 vertices and 296 arcs). The average error o…

Parameter optimization for amplify-and-forward relaying with imperfect channel estimation

2009

Cooperative diversity is a promising technology for future wireless networks. In this paper, we consider a cooperative communication system operating in an amplify-and-forward (AF) mode with an imperfectly-known relay fading channel. It is assumed that a pilot symbol assisted modulation (PSAM) scheme with linear minimum mean square estimator (LMMSE) is used for the channel estimation. A simple and easy-to-evaluate asymptotical upper bound (AUB) of the symbol-error-rate (SER) is derived for uncoded AF cooperative systems with quadrature amplitude modulation (QAM) constellations. Based on the AUB, we propose a criterion for the choice of parameters in the PSAM scheme, i.e., the pilot spacing …

Lower bounds for eigenvalues of a quadratic form relative to a positive quadratic form

1968

Abstract : A method is presented for the calculation of lower bounds to eigenvalues of operators that arise from variational problems for one quadratic form relative to a positive definite quadratic form. Eigenvalue problems of this kind occur, for example, in the theory of buckling of continuous linear elastic systems. The technique used is a modification of one introduced earlier, (1) sections II and IVB, for the determination of lower bounds to eigenvalues of semi-bounded self-adjoint operators. Other methods for the latter problem can be carried over without essential changes. The particular difficulty in the case we consider is that some operators which enter the calculation for the lo…

Dynamic shakedown by modal analysis

1984

Dynamic shakedown of discrete elastic-perfectly plastic structures under a specified load history is studied using the dynamic characteristics of the structure provided by modal analysis. Several statical and kinematical theorems are presented, including lower and upper bound theorems for the minimum adaptation time of the structure. In the formulation of the kinematical theorems a crucial role is played by the appropriate definition of ≪admissible plastic strain cycle≫.

2014

This paper deals with the problem of robust model predictive control (RMPC) for a class of linear time-varying systems with constraints and data losses. We take the polytopic uncertainties into account to describe the uncertain systems. First, we design a robust state observer by using the linear matrix inequality (LMI) constraints so that the original system state can be tracked. Second, the MPC gain is calculated by minimizing the upper bound of infinite horizon robust performance objective in terms of linear matrix inequality conditions. The method of robust MPC and state observer design is illustrated by a numerical example.

LCRT: A ToA Based Mobile Terminal Localization Algorithm in NLOS Environment

2009

©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Article also available from publisher: http://dx.doi.org/10.1109/VETECS.2009.5073644 Non line-of-sight (NLOS) propagation in range measurement is a key problem for mobile terminal localization. This paper proposes a low computational residual test (LCRT) algorithm that can identify the number of line-of-sight (LOS) transmissions and reduce the computational com…

A kriging interpolation strategy for the optimization of Acidithiobacillus ferrooxidans biomass production using fed-batch bioreactors

2008

In this work, a procedure for the optimization of Acidithiobacillus ferrooxidans biomass production in fed-batch reactors using a model based on optimal spatial interpolation of experimental data is proposed. The approach is useful in those cases where specific growth and substrate consumption rates are unknown. Based on interpolation, the optimal values of biomass and substrate concentrations set points are obtained at the minimum of 2-dimensional cost function. In the fed-batch reactor biomass and substrate concentrations are controlled at their set points by changing the input flow and its concentration. We propose a minimum variance control strategy which improves the classical proporti…

Large two-dimensional electronic systems: Self-consistent energies and densities at low cost

2013

We derive a self-consistent local variant of the Thomas-Fermi approximation for (quasi-) two-dimensional (2D) systems by localizing the Hartree term. The scheme results in an explicit orbital-free representation of the electron density and energy in terms of the external potential, the number of electrons, and the chemical potential determined upon normalization. We test the method over a variety 2D nanostructures by comparing to the Kohn-Sham 2D local-density approximation (LDA) calculations up to 600 electrons. Accurate results are obtained in view of the negligible computational cost. We also assess a local upper bound for the Hartree energy. Peer reviewed

Quantum algorithms for search with wildcards and combinatorial group testing

2012

We consider two combinatorial problems. The first we call "search with wildcards": given an unknown n-bit string x, and the ability to check whether any subset of the bits of x is equal to a provided query string, the goal is to output x. We give a nearly optimal O(sqrt(n) log n) quantum query algorithm for search with wildcards, beating the classical lower bound of Omega(n) queries. Rather than using amplitude amplification or a quantum walk, our algorithm is ultimately based on the solution to a state discrimination problem. The second problem we consider is combinatorial group testing, which is the task of identifying a subset of at most k special items out of a set of n items, given the…