On scheduling with the non-idling constraint

In this paper, we give an overview of the main results obtained on the complexity of scheduling under the non-idling constraint, i.e, when the jobs assigned to each machine must be processed with no intermediate delay. That constraint is met in practice when the cost of intermediate idle time is too high due to the idle time itself and/or the machine restarting. The non idling constraint is a strong constraint that often needs a new solving approach and most results about classical scheduling problems do not easily extend to the non-idling variant of the problem. In this survey, we mainly consider the non-idling variants of the basic scheduling problems. So, we first present basic properties, complexity results and some algorithms concerning the one-machine non-idling scheduling problem. Then we consider the $m$ -machine non idling scheduling problem. We show that a few basic problems may be solved by rather easy extensions of the algorithm solving their classical counterpart. However, the complexity status of the non idling version of quite easy polynomial basic problems remains an open question. We finally consider a more constrained version of non-idling, called the “homogeneously non idling” constraint, where for any subset of machines, the union of their busy intervals must make an interval and we present the structural property that leads to a polynomial algorithm for unit time jobs and a weak precedence. We conclude by giving some research directions that seem quite interesting to study both for theoretical and practical issues.     

A stochastic analysis of a network with two levels of service

Queueing Systems - In this paper, a stochastic model of a call center with a two-level architecture is analyzed. A first-level pool of operators answers calls, identifies, and handles non-urgent...     

Finite quotients of the automorphism group of a free group

The automorphism group AutF_n of a free group F_n of rank n acts on the product of n copies of a group G by substituting n elements of G into the words defining an automorphism of the free group. This gives rise to an antihomomorphism from AutF_nto a permutation group. We determine this antihomomorphic image of AutF_n when G is the semidirect product Z_p x Z_q     

Holonomy and contact geometry

On a Riemannian manifold, any parallel form is preserved by the flow of any Killing vector field with constant magnitude. As a consequence, on a 2n+1-dimensional K-contact manifold, there are no nontrivial parallel forms except of degrees 0 and 2n+1. Flat contact metrics on 3-manifolds are characterized by reducible holonomy.     

Numerically stable,scalable formulas for parallel and online computation of higher-order multivariate central moments with arbitrary weights

Formulas for incremental or parallel computation of second order central moments have long been known, and recent extensions of these formulas to univariate and multivariate moments of arbitrary order have been developed. Such formulas are of key importance in scenarios where incremental results are required and in parallel and distributed systems where communication costs are high. We survey these recent results, and improve them with arbitrary-order, numerically stable one-pass formulas which we further extend with weighted and compound variants. We also develop a generalized correction factor for standard two-pass algorithms that enables the maintenance of accuracy over nearly the full representable range of the input, avoiding the need for extended-precision arithmetic. We then empirically examine algorithm correctness for pairwise update formulas up to order four as well as condition number and relative error bounds for eight different central moment formulas, each up to degree six, to address the trade-offs between numerical accuracy and speed of the various algorithms. Finally, we demonstrate the use of the most elaborate among the above mentioned formulas, with the utilization of the compound moments for a practical large-scale scientific application.     

α-次积分半群的Trotter-kato定理

§１．　ＩｎｔｒｏｄｕｃｔｉｏｎＷｈｅｎｗｅｉｎｔｅｇｒａｔｅｄｉｆｆｅｒｅｎｔｉａｌｅｑｕａｔｉｏｎｓ,ｗｅｃａｎｆｏｒｍｕｌａｔｅｍａｎｙｏｆｔｈｅｍａｓａｎａｂｓｔｒａｃｔＣａｕｃｈｙｐｒｏｂｌｅｍ．ＡｎａｔｕｒａｌｑｕｅｓｔｉｏｎｉｎｔｈｅｔｈｅｏｒｙｉｓｔｏｆｉｎｄｓｕｉｔａｂｌｅｃｏｎｄｉｔｉｏｎｓｕｎｄｅｒｗｈｉｃｈａｓｅｑｕｅｎｃｅｏｆａａｂｓｔｒａｃｔＣａｕｃｈｙｐｒｏｂｌｅｍ．ｕ′ｎ＝Ａｎｕｎ（ｔ）,ｕｎ（０）＝ｘｎ,ｆｏｒｔ≥０,ｎ＝１,２,…ｉｎａｎａｒｂｔｉｒａｒｙＢａ…     

Un problème de confinement pour une coque membranaire linéairement élastique de type elliptique

We identify, and rigorously justify by an asymptotic analysis, the variational inequalities of the two-dimensional problem satisfied by the displacement field of a linearly elastic membrane shell of elliptic type subjected to a confinement condition inside a half-space. This type of condition substantially differs from the Signorini condition usually imposed on the “lower face” of the shell.