Orbits in max-min algebra

Properties of orbits in max-min algebra are described, mainly the properties of periodic orbits. An O(n³) algorithm computing the period of a periodic orbit is presented. As a consequence, an O(n³ log n) algorithm computing the period of arbitrary orbit is obtained, as the pre-periodic part of the orbit has length at most (n − 1)² + 1.     

The three-dimensional Poincaré continued fraction algorithm

It is proved here that for Lebesgue-almost every line in the three-dimensional Euclidean space, the Poincaré continued fraction algorithm fixes a vertex. Besides, the algorithm is nonergodic, although the Gauss map, defined by the algorithm, has an attractor and is ergodic. It is also shown that the Euclidean algorithm and the horocycle flow are orbit equivalent. Partially supported by CNPq(Brazil) grant no. 30.1456-80.     

A note on homoclinic or heteroclinic orbits for the generalized Hénon map

An important problem in a given dynamical system is to determine the existence of a homoclinic orbit. We improve the results of Qin and Xiao [Nonlinearity, 20 (2007), 2305–2317], who present some sufficient conditions for the existence of a homoclinic/heteroclinic orbit for the generalized H´enon map. Moreover, an algorithm is presented to locate these homoclinic orbits.     

Maximizing the value of an Earth observation satellite orbit

Earth observation satellites are platforms equipped with optical instruments that orbit the planet. During the course of an orbit, they take photographs of some regions of the Earth at the request of customers. Each photograph generates a profit but, due to the presence of several constraints, not all requests can be satisfied. The problem is to select a subset of requests of maximal profit for a given orbit. The problem is solved by means of a tabu search heuristic and computational results are reported. This work was initiated as part of a challenge organized by the French Operational Research Society. The algorithm won the second prize in the final round of the competition.     

Cataloging graphs by generating them uniformly at random

We describe an algorithm for cataloging graphs by generating them uniformly at random. The method used is based on a recent algorithm by Dixon and Wilf that generates orbit representatives uniformly at random. The approach is refined to graphs with prescribed numbers of edges and vertices, and then applied to obtain the complete list of graphs on 10 vertices.     

Information and dynamical systems: a concrete measurement on sporadic dynamics

We present a method for the study of dynamical systems based on the notion of quantity of information. Measuring the quantity of information of a string by using data compression algorithms, it is possible to give a notion of orbit complexity of dynamical systems. In compact ergodic dynamical systems, entropy is almost everywhere equal to orbit complexity. We have introduced a new compression algorithm called CASToRe which allows a direct estimation of the information content of the orbits in the 0-entropy case. The method is applied to a sporadic dynamical system (Manneville map).     

Algorithmic analysis of theMAP/PH/1 retrial queue

In this paper the distribution of the maximum number of customers in a retrial orbit for a single server queue with Markovian arrival process and phase type services is studied. Efficient algorithm for computing the probability distribution and some interesting numerical examples are presented.     

Chaotifying a continuous-time system near a stable limit cycle

This paper studies the chaotification problem of driving a continuous-time system chaotic near its stable limit cycle. The controller is designed to ensure the controlled orbit be bounded and, meanwhile, have positive Lyapunov exponents. A numerical example is given to illustrate the effectiveness of the proposed chaotification algorithm.     

军事行动避空侦察的时机和路线选择

介绍了军事行动中侦察卫星运动轨迹的预测方法,并规划了最优行军路线.首先根据雷达探测俯仰角与探测距离的几何关系,确定雷达探测经度范围,并对卫星周期及卫星被探测到的初始位置进行求解,从而建立卫星进出雷达探测范围时刻的预测模型,对几种卫星的过顶情况进行预测·最后,在此基础上建立简化的行军路线模型,选择最优行军路线,躲避卫星侦察.     

Identities and Invariant Operators on Homogeneous Spaces

We study identities (functional relations between the generators of the transformation group) and also algebras of invariant operators on homogeneous spaces using the method of orbits of the coadjoint representation (coadjoint orbits). This method permits establishing the relation between these two objects and elaborating an algorithm for their construction. A classification of homogeneous spaces is introduced based on the coadjoint orbit method.     

带性能约束布局问题的全局优化算法

以人造卫星仪器舱布局为例,应用图论,群对集合的作用,轨道与等价关系等刻划各种布局方案的同构,等价类等内在性质,从而首次给出带有性能约束二维布局问题的一个全局优化算法。     

DERIVATION AND ANALYSIS OF A NEW RECONSTRUCTION FORMULA FROM CONE-BEAM PROJECTIONS

A new method to compute the first derivative of 3-D Radon transform is given for cone-beam data taken from any orbit. Smith [Ⅰ1] and Grangeat [5] even derived cone-beam inversion formulas which are the basic work in fully 3-D image reconstruction algorithm and are used extensively now. In this paper we will give a new inversion formula and a simple necessary and sufficient condition which guarantees the complete reconstruction algorithm.     

Edge local complementation and equivalence of binary linear codes

Orbits of graphs under the operation edge local complementation (ELC) are defined. We show that the ELC orbit of a bipartite graph corresponds to the equivalence class of a binary linear code. The information sets and the minimum distance of a code can be derived from the corresponding ELC orbit. By extending earlier results on local complementation (LC) orbits, we classify the ELC orbits of all graphs on up to 12 vertices. We also give a new method for classifying binary linear codes, with running time comparable to the best known algorithm.     

复迭代映射z_(n 1)= c的 广义Mandelbrot集研究

研究了复迭代映射ｚ（ｎ＋１）＝／ｚｎｍ＋ｃ的广义Ｍａｎｄｅｌｂｒｏｔ集,指出其关于实轴是对称的,并且具有ｍ＋１次的旋转对称性,得出周期轨道的稳定性条件及一周期轨道的稳定区域的边界方程．利用逃逸时间算法和周期点查找的算法构造Ｍａｎｄｅｌｂｒｏｔ集,可以更清楚地了解Ｍａｎｄｅｌｂｒｏｔ集的结构．     

Reflections on the Hohmann Transfer

Walter Hohmann was a civil engineer who studied orbital maneuvers in his spare time. In 1925, he published an important book (Ref. 1) containing his main result, namely, that the most economical transfer from a circular orbit to another circular orbit is achieved via an elliptical trajectory bitangent to the terminal orbits. With the advent of the space program some three decades later, the Hohmann transfer maneuver became the most fundamental maneuver in space.In this work, we present a complete study of the Hohmann transfer maneuver. After revisiting its known properties, we present a number of supplementary properties which are essential to the qualitative understanding of the maneuver. Also, we present a simple analytical proof of the optimality of the Hohmann transfer and complement it with a numerical study via the sequential gradient-restoration algorithm. Finally, as an application, we present a numerical study of the transfer of a spacecraft from the Earth orbit around the Sun to another planetary orbit around the Sun for both the case of an ascending transfer (orbits of Mars, Jupiter, Saturn, Uranus, Neptune, and Pluto) and the case of a descending transfer (orbits of Mercury and Venus).     

Tracking control of chaotic spinning disks via nonlinear dynamic output feedback with input constraints

In many control engineering applications, it is impossible or expensive to measure all the states of the dynamical system and only the system output is available for controller design. In this study, a new dynamic output feedback control algorithm is proposed to stabilize the unstable periodic orbit of chaotic spinning disks with incomplete state information. The proposed control structure is based on the T‐S fuzzy systems. This investigation also introduces a new design procedure to satisfy a constraint on the T‐S fuzzy dynamic output feedback control signal. This procedure is independent of the exact value of initial states. Finally, computer simulations are accomplished to illustrate the performance of the proposed control algorithm. © 2015 Wiley Periodicals, Inc. Complexity 21: 148–159, 2016     

A method for analytically representing area-preserving mappings

An area-preserving mapping is considered. It is assumed that the mapping has a fixed point and is analytic in a small neighbourhood near it. A constructive algorithm for obtaining a representation of the mapping in the form of a composite of two area-preserving mappings, one of which is a nearly identity mapping, while the other corresponds to the real normal form of a linearized mapping, is described. The algorithm is used in the problem of the stability of the translational motion of a rigid body in a uniform gravitational field when it undergoes collisions with a fixed horizontal plane and in the problem of the stability of one type of resonant in-plane rotations of a satellite, i.e., a rigid body, in an elliptic orbit.     

CODIMENSION 3 BIFURCATIONS OFHOMOCLINIC ORBITS WITH ORBITFLIPS AND INCLINATION FLIPS

The homoclinic bifurcations in four dimensional vector fields are investigated by setting up a local coordinates near the homoclinic orbit. This homoclinic orbit is non-principal in the meanings that its positive semi-orbit takes orbit flip and its unstable foliation takes inclination flip. The existence, nonexistence, uniqueness and coexistence of the 1-homoclinic orbit and the 1-periodic orbit are studied. The existence of the twofold periodic orbit and three-fold periodic orbit are also obtained.     

Geometric orbit datum and orbit covers

Vogan conjectured that the parabolic induction of orbit data is independent of the choice of the parabolic subgroup. In this paper we first give the parabolic induction of orbit covers, whose relationship with geometric orbit datum is also induced. Hence we show a geometric interpretation of orbit data and finally prove the conjugation for geometric orbit datum using geometric method.