On the stability of resonant rotation of a symmetric satellite in an elliptical orbit

We deal with the stability problem of resonant rotation of a symmetric rigid body about its center of mass in an elliptical orbit. The resonant rotation is a planar motion such that the body completes one rotation in absolute space during two orbital revolutions of its center of mass. In [1–3] the stability analysis of the above resonant rotation with respect to planar perturbations has been performed in detail.In this paper we study the stability of the resonant rotation in an extended formulation taking into account both planar and spatial perturbations. By analyzing linearized equations of perturbed motion, we found eccentricity intervals, where the resonant rotation is unstable. Outside of these intervals a nonlinear stability study has been performed and subintervals of formal stability and stability for most initial data have been found. In addition, the instability of the resonant rotation was established at several eccentricity values corresponding to the third and fourth order resonances.Our study has also shown that in linear approximation the spatial perturbations have no effect on the stability of the resonant rotation, whereas in a nonlinear system they can lead to its instability at some resonant values of the eccentricity.     

Rotations of a near-symmetrical satellite in an elliptical orbit with Mercury-type resonance

The motion of a satellite, i.e., a rigid body, about to the centre of mass under the action of the gravitational moments of a central Newtonian gravitational field in an elliptical orbit of arbitrary eccentricity is investigated. It is assumed that the satellite is almost dynamically symmetrical. Plane periodic motions for which the ratio of the average value of the absolute angular velocity of the satellite to the average motion of its centre of mass is equal to 3/2 (Mercury-type resonance) are examined. An analytic solution of the non-linear problem of the existence of such motions and their stability to plane perturbations is given. In the special case in which the central ellipsoid of inertia of the satellite is almost spherical, the stability to spatial perturbations is also examined, but only in a linear approximation. ©2008.     

Identification and orbit determination of a tethered satellite system

Orbital motion of a tethered satellite system, composed of two satellites and an inextensible tether, is considered by using a perturbed two-body model. This approach is adopted so that the determination of the orbit of one of the satellites can be attempted without using observations of the motion of the other satellite in the system. The identification of the tethered condition of the system using observations of only one of the satellites in the tethered satellite system is considered. The characteristics of the `tether perturbed' motion of the observed satellite are investigated. Estimation of the state of the system using near perfect data is also illustrated. Observations of one satellite provide the entire state of the system and a parameter involving the ratio of the masses of satellites and the tether length.     

Maximizing the net present value of a project under uncertainty

We address the maximization of a project’s expected net present value when the activity durations and cash flows are described by a discrete set of alternative scenarios with associated occurrence probabilities. In this setting, the choice of scenario-independent activity start times frequently leads to infeasible schedules or severe losses in revenues. We suggest to determine an optimal target processing time policy for the project activities instead. Such a policy prescribes an activity to be started as early as possible in the realized scenario, but never before its (scenario-independent) target processing time. We formulate the resulting model as a global optimization problem and present a branch-and-bound algorithm for its solution. Extensive numerical results illustrate the suitability of the proposed policy class and the runtime behavior of the algorithm.     

Maximizing the guarded boundary of an Art Gallery is APX-complete

In the Art Gallery problem, given is a polygonal gallery and the goal is to guard the gallery's interior or walls with a number of guards that must be placed strategically in the interior, on walls or on corners of the gallery. Here we consider a more realistic version: exhibits now have size and may have different costs. Moreover the meaning of guarding is relaxed: we use a new concept, that of watching an expensive art item, i.e. overseeing a part of the item. The main result of the paper is that the problem of maximizing the total value of a guarded weighted boundary is APX-complete. This is shown by an appropriate ‘gap-preserving’ reduction from the Max-5-occurrence-3-Sat problem. We also show that this technique can be applied to a number of maximization variations of the art gallery problem. In particular we consider the following problems: given a polygon with or without holes and k available guards, maximize a) the length of walls guarded and b) the total cost of paintings watched or overseen. We prove that all the above problems are APX-complete.     

Maximizing total job value on a single machine with job selection

This paper describes a single-machine scheduling problem of maximizing total job value with a machine availability constraint. The value of each job decreases over time in a stepwise fashion. Several solution properties of the problem are developed. Based on the properties, a branch-and-bound algorithm and a heuristic algorithm are derived. These algorithms are evaluated in the computational study, and the results show that the heuristic algorithm provides effective solutions within short computation times.     

The semigroup generated by a similarity orbit or a unitary orbit of an operator

Let be an invertible operator that is not a scalar modulo the ideal of compact operators. We show that the multiplicative semigroup generated by the similarity orbit of is the group of all invertible operators. If, in addition, is a unitary operator, then the multiplicative semigroup generated by the unitary orbit of is the group of all unitary operators.

     

Maximizing business value by optimal assignment of jobs to resources in grid computing

An important problem that arises in the area of grid computing is one of optimally assigning jobs to resources to achieve a business objective. In the grid computing area, however, such scheduling has mostly been done from the perspective of maximizing the utilization of resources. As this form of computing proliferates, the business aspects will become crucial for the overall success of the technology. Hence, we discuss the grid scheduling problem from a business perspective. We show that this problem is not only strongly NP-hard, but it is also non-approximable. Therefore, we propose heuristics for different variants of the problem and show that these heuristics provide near-optimal solution for a wide variety of problem instances. We show that the execution times of proposed heuristics are very low, and hence, they are suitable for solving problems in real-time. We also present several managerial implications and compare the performance of two widely used models in the real-time scheduling of grid computing.     

Constructing an automorphic form from the orbit of a transformation

We consider the Fuchsian groups of linear-fractional transformations. We propose a new method for presenting automorphic forms as gap series over an appropriate subset of transformations of the group which is not a subgroup. Comparative analysis of the Poincaré theta-series and gap series demonstrates that the use of gap series requires less transformations and parameters that the summands of series depend on.     

Invariant generalized functions supported on an orbit

We study the space of invariant generalized functions supported on an orbit of the action of a real algebraic group on a real algebraic manifold. This space is equipped with the Bruhat filtration. We study the generating function of the dimensions of the filtras, and give some methods to compute it. To illustrate our methods we compute those generating functions for the adjoint action of GL₃(C). Our main tool is the notion of generalized functions on a real algebraic stack, introduced recently in [Sak16].     

Maximizing the descent statistic

For a subsetS, let the descent statistic (S) be the number of permutations that have descent setS. We study inequalities between the descent statistics of subsets. Each subset (and its complement) is encoded by a list containing the lengths of the runs. We define two preorders that compare different lists based on the descent statistic. Using these preorders, we obtain a complete order on lists of the form (k ⁱ ,P,k ^n–i , whereP is a palindrome, whose first entry is larger thank. We prove a conjecture due to Gessel, which determines the list that maximizes the descent statistic, among lists of a given size and given length. We also have a generalization of the boustrophedon transform of Millar, Sloane and Young.     

Maximizing the expected number of components in an online search of a graph

The following optimal stopping problem is considered. The vertices of a graph G are revealed one by one, in a random order, to a selector. He aims to stop this process at a time t that maximizes the expected number of connected components in the graph ${\stackrel{?}{G}}_t$, induced by the currently revealed vertices. The selector knows G in advance, but different versions of the game are considered depending on the information that he gets about ${\stackrel{?}{G}}_t$. We show that when G has N vertices and maximum degree of order $o(\sqrt{N})$, then the number of components of ${\stackrel{?}{G}}_t$ is concentrated around its mean, which implies that playing the optimal strategy the selector does not benefit much by receiving more information about ${\stackrel{?}{G}}_t$. Results of similar nature were previously obtained by M. Lasoń for the case where G is a k-tree (for constant k). We also consider the particular cases where G is a square, triangular or hexagonal lattice, showing that an optimal selector gains cN components and we compute c with an error less than 0.005 in each case.     

Maximizing an interval order on compact subsets of its domain

Maximal elements of a binary relation on compact subsets of a metric space define a choice function. An infinite extension of transitivity is necessary and sufficient for such a choice function to be nonempty-valued and path independent (or satisfy the outcast axiom). An infinite extension of acyclicity is necessary and sufficient for the choice function to have nonempty values provided the underlying relation is an interval order.     

Maximizing the mean subtree order

This article focuses on properties and structures of trees with maximum mean subtree order in a given family; such trees are called optimal in the family. Our main goal is to describe the structure of optimal trees in and , the families of all trees and caterpillars, respectively, of order . We begin by establishing a powerful tool called the Gluing Lemma, which is used to prove several of our main results. In particular, we show that if is an optimal tree in or for , then every leaf of is adjacent to a vertex of degree at least . We also use the Gluing Lemma to answer an open question of Jamison and to provide a conceptually simple proof of Jamison's result that the path has minimum mean subtree order among all trees of order . We prove that if is optimal in , then the number of leaves in is and that if is optimal in , then the number of leaves in is . Along the way, we describe the asymptotic structure of optimal trees in several narrower families of trees.     

A heuristic for the multi-satellite,multi-orbit and multi-user management of Earth observation satellites

Earth observation satellites are platforms equipped with optical instruments that orbit the Earth in order to take photographs of specific areas at the request of users. This article is concerned with the management of several satellites performing multiple orbits over a given planning horizon. It describes a tabu search heuristic for the problem of selecting and scheduling the requests to be satisfied, under operational constraints. An upper bounding procedure based on column generation is used to evaluate the quality of the solutions. The results of extensive computational experiments performed on data provided by the French Centre National d’Études Spatiales are reported.     

Tube domain and an orbit of a complex triangular group

Let w be a complex symmetric matrix of order r, and Δ ₁(w), . . . , Δ _r (w) the principal minors of w. If w belongs to the Siegel right half-space, then it is known that Re (Δ _k (w)/Δ _k-1(w)) > 0 for k = 1, . . . , r. In this paper we study this property in three directions. First we show that this holds for general symmetric right half-spaces. Second we present a series of non-symmetric right half-spaces with this property. We note that case-by-case verifications up to dimension 10 tell us that there is only one such irreducible non-symmetric tube domain. The proof of the property reduces to two lemmas. One is entirely generalized to non-symmetric cases as we prove in this paper. This is the third direction. As a byproduct of our study, we show that the basic relative invariants associated to a homogeneous regular open convex cone Ω studied earlier by the first author are characterized as the irreducible factors of the determinant of right multiplication operators in the complexification of the clan associated to Ω.     

On the conditions under which a satellite orbit intersects the surface of a central body of finite radius in the restricted double-averaged three-body problem

This paper is concerned with the applied problem of choosing long-living orbits of artificial Earth satellites whose evolution under the influence of gravitational perturbation from the Moon and the Sun may result in the collision of the satellite with the central body, as was shown by M.L. Lidov for the well-known example of “Vertical Moon.” We use solutions of the completely integrable system of evolution equations obtained by Lidov in 1961 by averaging twice the spatial circular restricted three-body problem in the Hill approximation. In order to apply the integrability of this problem in practice, we study the foliation of the manifold of levels of first integrals and the change of motion under crossing the bifurcation manifolds separating the foliated cells. As a result, we describe the manifold of initial conditions under which the orbit evolution leads to an inevitable collision of the satellite with the central body. We also find a lower bound for the practical applicability of the results, which is determined by the presence of gravitational perturbations caused by a polar flattening of the central body. Original Russian Text ? V.I. Prokhorenko, 2007, published in Trudy Matematicheskogo Instituta imeni V.A. Steklova, 2007, Vol. 259, pp. 156–173.     

On the conditions under which a satellite orbit intersects the surface of a central body of finite radius in the restricted double-averaged three-body problem

This paper is concerned with the applied problem of choosing long-living orbits of artificial Earth satellites whose evolution under the influence of gravitational perturbation from the Moon and the Sun may result in the collision of the satellite with the central body, as was shown by M.L. Lidov for the well-known example of “Vertical Moon.” We use solutions of the completely integrable system of evolution equations obtained by Lidov in 1961 by averaging twice the spatial circular restricted three-body problem in the Hill approximation. In order to apply the integrability of this problem in practice, we study the foliation of the manifold of levels of first integrals and the change of motion under crossing the bifurcation manifolds separating the foliated cells. As a result, we describe the manifold of initial conditions under which the orbit evolution leads to an inevitable collision of the satellite with the central body. We also find a lower bound for the practical applicability of the results, which is determined by the presence of gravitational perturbations caused by a polar flattening of the central body.