Time-convexity of the entropy in the multiphasic formulation of the incompressible Euler equation

We study the multiphasic formulation of the incompressible Euler equation introduced by Brenier: infinitely many phases evolve according to the compressible Euler equation and are coupled through a global incompressibility constraint. In a convex domain, we are able to prove that the entropy, when averaged over all phases, is a convex function of time, a result that was conjectured by Brenier. The novelty in our approach consists in introducing a time-discretization that allows us to import a flow interchange inequality previously used by Matthes, McCann and Savaré to study first order in time PDE, namely the JKO scheme associated with non-linear parabolic equations.     

From the neutrino to the edge of the universe

Two recent findings necessitate a closer look at the existing standard models of particle physics and cosmology. These are the discovery of neutrino oscillation, and hence a non-zero mass on the one hand and, on the other, observations of distant supernovae which indicate that contrary to popular belief, the universe would continue to expand for ever, possibly accelerating in the process. In this paper it is pointed out that relatively recent studies which indicate a stochastic, quantum vacuum underpinning and a fractal structure for space time, reconcile both of the recent observations, harmoniously.     

On the determination of the control parameters of the optimal can-order policy

This paper considers the well-known class of can-order policies. This type of coordinated replenishment policies accounts for a joint set-up cost structure, where a major set-up cost is incurred for any order and an individual minor set-up cost is charged for each item in the replenishment. Recent comparative studies have pointed out that the performance of the optimal can-order policy is poor, compared to other coordinated replenishment strategies, when the major set-up cost is high. This paper shows that it is the approximate decomposition method to calculate the optimal canorder parameters which performs bad in such situations and not the policy itself. Attention is focused to a subclass of can-order policies, which is close to the optimal can-order policy for high major set-up costs. A solution procedure is developed to calculate the optimal control parameters of this policy. It is shown that a properly chosen combination of the solution procedures to calculate can-order parameters leads to a can-order strategy which performs as well as other coordinated replenishment policies.     

On the Natanzon-Turaev compactification of the Hurwitz space

Natanzon and Turaev have constructed by topological methods a compactification of the Hurwitz space, that is, the space of simple branched covers of the two-sphere. Here we show that this compactification is homeomorphic to a compactification mentioned by Diaz and Edidin (in 1996) that was constructed by algebraic methods. Using this we are able to show by example that the Natanzon-Turaev compactification can be singular, that is, not a manifold.

     

On the Volume of the Union of Balls

We prove that if some balls in the Euclidean space move continuously in such a way that the distances between their centers decrease, then the volume of their union cannot increase. The proof is based on a formula expressing the derivative of the volume of the union as a linear combination of the derivatives of the distances between the centers with nonnegative coefficients. Received September 6, 1996, and in revised form March 26, 1997.     

On the joint characterization of the distributions of the true income and the proportion of the reported income to the true income through a model of under-reported incomes

In this note, we assume that the reported income is related to the true income by the so-called ‘error-in-variables’ model, a model which assumes that the observed incomes are under-reported. In the context of this model, the distribution of the reported income suitably truncated below coincides with that of the true income, and suitable truncated above with that of the random proportion of the reported income to the true income if, and only if, the distribution of the true income is Pareto and that of the proportion is of the power function form.     

On the complexity of the car sequencing problem

In this note we give an easier proof of the known result that the car sequencing problem is NP-hard, and point out that it is NP-hard in the strong sense. We show that a previous claim of NP-completeness is incorrect, and instead we give a sufficient condition of membership of NP. We also provide a pseudo-polynomial algorithm for a special case.     

Quantum walks and the size of the graph

A continuous-time quantum walk is modelled using a graph. In this short paper, we provide lower bounds on the size of a graph that would allow for some quantum phenomena to occur. Among other things, we show that, in the adjacency matrix quantum walk model, the number of edges is bounded below by a cubic function on the eccentricity of a periodic vertex. This gives some idea on the shape of a graph that would admit periodicity or perfect state transfer. We also raise some extremal type of questions in the end that could lead to future research.     

Control of the spectrum of irregular oscillations of linear systems with coinciding ranks of the matrix multiplying the control and the extended matrix

We consider a linear periodic control system such that the ranks of the matrix multiplying the control and the extended matrix consisting of the averaged coefficient matrix and the matrix multiplying the control are the same. We assume that the control has the form of feedback linear in the state variables and is periodic with the same period as the system itself. We pose the problem of control of the frequency spectrum of strongly irregular periodic oscillations with an objective set, that is, the problem of finding a feedback coefficient such that the closed system has a strongly irregular periodic solution with the desired frequencies. We obtain necessary and sufficient conditions for the solvability of this problem.     

考虑废旧品质量的闭环供应链混合回收渠道选择研究

为确定最优的回收渠道,对由单个制造商、零售商和第三方组成的闭环供应链系统进行研究。在该系统中,可能存在制造商和零售商、制造商和第三方、零售商和第三方以及制造商、零售商和第三方同时回收的四种渠道,并根据质量差异对废旧品进行翻新或再制造。在分散决策下建立了四种回收渠道模型。比较发现:站在制造商和系统收益最大化及社会效益角度,三渠道是最佳选择,此时得到的废旧品最多;制造商不进行回收时获利最低,且不利于提高废旧品的获取量。最后,通过算例剖析了废旧品再制造率对四种混合回收渠道下成员及系统利润的影响。结果表明:制造商应尽量将废旧品用于再制造。     

Criteria for the stability of the finiteness property and for the uniqueness of Barabanov norms

A set of matrices is said to have the finiteness property if the maximal rate of exponential growth of long products of matrices drawn from that set is realised by a periodic product. The extent to which the finiteness property is prevalent among finite sets of matrices is the subject of ongoing research. In this article, we give a condition on a finite irreducible set of matrices which guarantees that the finiteness property holds not only for that set, but also for all sufficiently nearby sets of equal cardinality. We also prove a theorem giving conditions under which the Barabanov norm associated to a finite irreducible set of matrices is unique up to multiplication by a scalar, and show that in certain cases these conditions are also persistent under small perturbations.     

Analysis of the structure of the boundary layer in the problem of the torsion of a laminated spherical shell

The structures of the boundary layer in the problem of the torsion of a radially stratified spherical segment (shell) with an arbitrary number of alternating hard and soft layers are investigated. It is shown that weakly attenuating boundary-layer solutions exist. Despite the fact that a stress state, self-balanced in the section, corresponds to these elementary solutions, they may penetrate fairly deeply and considerably change the stress–strain state pattern far from the ends. Using an asymptotic analysis of the problem, an applied theory of torsion is proposed which takes into account weakly attenuating boundary-layer solutions.     

A note on the approximability of the toughness of graphs

We show that, if NP≠ZPP, for any >0, the toughness of a graph with n vertices is not approximable in polynomial time within a factor of . We give a 4-approximation for graphs with toughness bounded by and we show that this result cannot be generalized to graphs with a bounded toughness. More exactly we prove that there is no constant approximation for graphs with bounded toughness, unless P=NP.     

On the minimization of the product of the powers of several integrals

This paper considers the minimization of the product of the powers ofn integrals, each of which depends on a functiony(x) and its derivative . The necessary conditions for the extremum are derived within the frame of the Mayer-Bolza formulation of the calculus of variations, and it is shown that the extremal arc is governed by a second-order differential equation involvingn undetermined multipliers related to the unknown values of the integrals. After the general solution is combined with the definitions of the multipliers and the end conditions, a system ofn+2 algebraic equations is obtained; it involvesn+2 unknowns, that is, then undetermined multipliers and two integration constants.The procedure discussed here can be employed in the study of shapes which are aerodynamically optimum at supersonic, hypersonic, and free-molecular flow velocities, that is, wings and fuselages having the maximum lift-to-drag ratio or the minimum drag. The problem of a slender body of revolution having the minimum pressure drag in Newtonian hypersonic flow is developed as an example. First, a general solution is derived for any pair of conditions imposed on the length, the thickness, the wetted area, and the volume. Then, a particular case is treated, that in which the thickness and the wetted area are given, while the length and the volume are free; the shape minimizing the pressure drag is a cone.This research, supported by the Office of Scientific Research, Office of Aerospace Research, United States Air Force, Grant No. AF-AFOSR-828-67, is a condensed version of the investigation described in Ref. 1. The author is indebted to Messrs. H. Y. Huang, J. C. Heideman, and J. N. Damoulakis for analytical and numerical assistance.     

指数型一次Logistic迭代方程解的周期倍分岔现象

本文讨论了指数型一次Ｌｏｇｉｓｔｉｃ迭代方程解的周期倍分岔现象的存在性,给出了周期倍分合时的临界点参数应满足的方程,并证明了周期倍分岔的临界点参数序列的极限是存在的,进而证明了当参数越过这个极限时,指数型一次 Ｌｏｇｉｓｔｉｃ迭代方程存在混沌解．     

A note on the interpretation of the Bahadur bound and the rate of convergence of the maximum likelihood estimator

Some interpretation of the Bahadur bound and the rate of convergence of the maximum likelihood estimator is provided using a theorem of Fu (1982) and the geometrical methods discussed in Kass (1984). We focus on replicated nonlinear regression and show that, in the sense of rate of convergence of the least-squares estimator in a small neighborhood of the true model, the most important characteristic that distinguishes one family of models from another is its statistical curvature (which is a multiple of the ‘intrinsic curvature’ of Bates and Watts, 1980).     

Criterions for detecting the existence of the exponential dichotomies in the asymptotic behavior of the solutions of variational equations

We prove that the admissibility of any pair of vector-valued Schäffer function spaces (satisfying a very general technical condition) implies the existence of a “no past” exponential dichotomy for an exponentially bounded, strongly continuous cocycle (over a semiflow). Roughly speaking the class of Schäffer function spaces consists in all function spaces which are invariant under the right-shift and therefore our approach addresses most of the possible pairs of admissible spaces. Complete characterizations for the exponential dichotomy of cocycles are also obtained. Moreover, we involve a concept of a “no past” exponential dichotomy for cocycles weaker than the classical concept defined by Sacker and Sell (1994) in [23]. Our definition of exponential dichotomy follows partially the definition given by Chow and Leiva (1996) in [4] in the sense that we allow the unstable subspace to have infinite dimension. The main difference is that we do not assume a priori that the cocycle is invertible on the unstable space (actually we do not even assume that the unstable space is invariant under the cocycle). Thus we generalize some known results due to O. Perron (1930) [14], J. Daleckij and M. Krein (1974) [7], J.L. Massera and J.J. Schäffer (1966) [11], N. van Minh, F. Räbiger and R. Schnaubelt (1998) [26].     

Optimal design of the damping set for the stabilization of the wave equation

We consider the problem of optimizing the shape and position of the damping set for the internal stabilization of the linear wave equation in RN, N=1,2. In a first theoretical part, we reformulate the problem into an equivalent non-convex vector variational one using a characterization of divergence-free vector fields. Then, by means of gradient Young measures, we obtain a relaxed formulation of the problem in which the original cost density is replaced by its constrained quasi-convexification. This implies that the new relaxed problem is well-posed in the sense that there exists a minimizer and, in addition, the infimum of the original problem coincides with the minimum of the relaxed one. In a second numerical part, we address the resolution of the relaxed problem using a first-order gradient descent method. We present some numerical experiments which highlight the influence of the over-damping phenomena and show that for large values of the damping potential the original problem has no minimizer. We then propose a penalization technique to recover the minimizing sequences of the original problem from the optimal solution of the relaxed one.     

Nonsymmetric variants of the prekernel and the prenucleolus

A solution on a class of TU games that satisfies the axioms of the pre-nucleolus or -kernel except the equal treatment property and is single valued for two-person games, is a nonsymmetric pre-nucleolus (NSPN) or -kernel (NSPK). We investigate the NSPKs and NSPNs and their relations to the positive prekernel and to the positive core. It turns out that any NSPK is a subsolution of the positive prekernel. Moreover, we show that an arbitrary NSPK, when applied to a TU game, intersects the set of preimputations whose dissatisfactions coincide with the dissatisfactions of an arbitrary element of any other NSPK applied to this game. This result also provides a new proof of sufficiency of the characterizing conditions for NSPKs introduced by Orshan (Non-symmetric prekernels, discussion paper 60. Center for Rationality, The Hebrew University of Jerusalem, 1994). Any NSPN belongs to ??its?? NSPK. Several classes of NSPNs are presented, all of them being subsolutions of the positive core. We show that any NSPN is a subsolution of the positive core provided that it satisfies the equal treatment property on an infinite subset of the universe of potential players. Moreover, we prove that, for any game whose prenucleolus is in its anticore, any NSPN coincides with the prenucleolus.