Search results for "lower bound"
showing 10 items of 269 documents
Abelian integrals and limit cycles
2006
Abstract The paper deals with generic perturbations from a Hamiltonian planar vector field and more precisely with the number and bifurcation pattern of the limit cycles. In this paper we show that near a 2-saddle cycle, the number of limit cycles produced in unfoldings with one unbroken connection, can exceed the number of zeros of the related Abelian integral, even if the latter represents a stable elementary catastrophe. We however also show that in general, finite codimension of the Abelian integral leads to a finite upper bound on the local cyclicity. In the treatment, we introduce the notion of simple asymptotic scale deformation.
Linear and cyclic radio k-labelings of trees
2007
International audience; Motivated by problems in radio channel assignments, we consider radio k-labelings of graphs. For a connected graph G and an integer k ≥ 1, a linear radio k-labeling of G is an assignment f of nonnegative integers to the vertices of G such that |f(x)−f(y)| ≥ k+1−dG(x,y), for any two distinct vertices x and y, where dG(x,y) is the distance between x and y in G. A cyclic k-labeling of G is defined analogously by using the cyclic metric on the labels. In both cases, we are interested in minimizing the span of the labeling. The linear (cyclic, respectively) radio k-labeling number of G is the minimum span of a linear (cyclic, respectively) radio k-labeling of G. In this p…
One-dimensional families of projections
2008
Let m and n be integers with 0 < m < n. We consider the question of how much the Hausdorff dimension of a measure may decrease under typical orthogonal projections from onto m-planes provided that the dimension of the parameter space is one. We verify the best possible lower bound for the dimension drop and illustrate the sharpness of our results by examples. The question stems naturally from the study of measures which are invariant under the geodesic flow.
Finite-Time Control for Attitude Tracking Maneuver of Rigid Satellite
2014
Published version of an article in the journal: Abstract and Applied Analysis. Also available from the publisher at: http://dx.doi.org/10.1155/2014/302982 Open Access The problem of finite-time control for attitude tracking maneuver of a rigid spacecraft is investigated. External disturbance, unknown inertia parameters are addressed. As stepping stone, a sliding mode controller is designed. It requires the upper bound of the lumped uncertainty including disturbance and inertia matrix. However, this upper bound may not be easily obtained. Therefore, an adaptive sliding mode control law is then proposed to release that drawback. Adaptive technique is applied to estimate that bound. It is prov…
Multi-Resource Management for Multi-Tier Space Information Networks: A Cooperative Game
2019
With the drastic increase of space information network (SIN) traffic and the diversity of network traffic types, the optimal allocation of the scarce network resources is of great significance for optimizing the SIN system capability. In this paper, we propose a multi-resource management method for multi-tier SIN using the cooperative Nash bargaining solution. Since the original problem is a non-convex problem, we firstly make logarithmic transition, and then find a tightest lower bound function to convert the initial problem into a convex one. In order to carry out the optimal bandwidth and power allocation in SIN, we construct a joint bandwidth and power allocation (JBPA) algorithm. Simul…
Efficient lower and upper bounds of the diagonal-flip distance between triangulations
2006
There remains today an open problem whether the rotation distance between binary trees or equivalently the diagonal-flip distance between triangulations can be computed in polynomial time. We present an efficient algorithm for computing lower and upper bounds of this distance between a pair of triangulations.
An efficient upper bound of the rotation distance of binary trees
2000
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons triangulations. Ordinal tools are used.
Long-range interactions in 1D heterogeneous solids with uncertainty
2013
Abstract In this paper, the authors aim to analyze the response of a one-dimensional non-local elastic solid with uncertain Young's modulus. The non-local effects are represented as long-range central body forces between non-adjacent volume elements. Following a non-probabilistic approach, the fluctuating elastic modulus of the material is modeled as an interval field. The analysis is conducted resorting to a novel formulation that confines the overestimation effect involved in interval models. Approximate closed-form expressions are derived for the bounds of the interval displacement field.
One-dimensional heterogeneous solids with uncertain elastic modulus in presence of long-range interactions: Interval versus stochastic analysis
2013
The analysis of one-dimensional non-local elastic solids with uncertain Young's modulus is addressed. Non-local effects are represented as long-range central body forces between non-adjacent volume elements. For comparison purpose, the fluctuating elastic modulus of the material is modeled following both a probabilistic and a non-probabilistic approach. To this aim, a novel definition of the interval field concept, able to limit the overestimation affecting ordinary interval analysis, is introduced. Approximate closed-form expressions are derived for the bounds of the interval displacement field as well as for the mean-value and variance of the stochastic response.
Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm
2019
Abstract In this paper, we deal with the Time-Dependent Asymmetric Traveling Salesman Problem with Time Windows. First, we prove that under special conditions the problem can be solved as an Asymmetric Traveling Salesman Problem with Time Windows, with suitable-defined time windows and (constant) travel times. Second, we show that, if the special conditions do not hold, the time-independent optimal solution provides both a lower bound and (eventually) an upper bound with a worst-case guarantee for the Time-Dependent Asymmetric Traveling Salesman Problem with Time Windows. Finally, a branch-and-bound algorithm is presented and tested on a set of 4800 instances. The results have been compared…