On one-dimensional continua uniformly approximating planar sets

Consider the class of closed connected sets satisfying length constraint with given l>0. The paper is concerned with the properties of minimizers of the uniform distance F _M of Σ to a given compact set ,

Transition wave in a supported heavy beam

We consider a heavy, uniform, elastic beam rested on periodically distributed supports as a simplified model of a bridge. The supports are subjected to a partial destruction propagating as a failure wave along the beam. Three related models are examined and compared: (a) a uniform elastic beam on a distributed elastic foundation, (b) an elastic beam in which the mass is concentrated at a discrete set of points corresponding to the discrete set of the elastic supports and (c) a uniform elastic beam on a set of discrete elastic supports. Stiffness of the support is assumed to drop when the stress reaches a critical value. In the formulation, it is also assumed that, at the moment of the support damage, the value of the ‘added mass’, which reflects the dynamic response of the support, is dropped too. Strong similarities in the behavior of the continuous and discrete-continuous models are detected. Three speed regimes, subsonic, intersonic and supersonic, where the failure wave is or is not accompanied by elastic waves excited by the moving jump in the support stiffness, are considered and related characteristic speeds are determined. With respect to these continuous and discrete-continuous models, the conditions are found for the failure wave to exist, to propagate uniformly or to accelerate. It is also found that such beam-related transition wave can propagate steadily only at the intersonic speeds. It is remarkable that the steady-state speed appears to decrease as the jump of the stiffness increases.     

Approximation of infinite-dimensional fleming-viot diffusions

The aim of this article is the approximation of a class of infinite-dimensional diffusions occurring in population genetics using a semigroup approach and a suitable sequence of Bernstein-Schnabl type operators which are associated with assigned sequences of positive real numbers.     

Natural Pseudo-Distance and Optimal Matching between Reduced Size Functions

This paper studies the properties of a new lower bound for the natural pseudo-distance. The natural pseudo-distance is a dissimilarity measure between shapes, where a shape is viewed as a topological space endowed with a real-valued continuous function. Measuring dissimilarity amounts to minimizing the change in the functions due to the application of homeomorphisms between topological spaces, with respect to the L _∞-norm. In order to obtain the lower bound, a suitable metric between size functions, called matching distance, is introduced. It compares size functions by solving an optimal matching problem between countable point sets. The matching distance is shown to be resistant to perturbations, implying that it is always smaller than the natural pseudo-distance. We also prove that the lower bound so obtained is sharp and cannot be improved by any other distance between size functions.     

Genetic algorithms for supply-chain scheduling: A case study in the distribution of ready-mixed concrete

The coordination of just-in-time production and transportation in a network of partially independent facilities to guarantee timely delivery to distributed customers is one of the most challenging aspect of supply chain management. From a theoretical perspective, the timely production/distribution can be viewed as a hybrid combination of planning, scheduling and routing problems, each notoriously affected by nearly prohibitive combinatorial complexity. From a practical viewpoint, the problem calls for a trade-off between risks and profits. This paper focuses on the ready-mixed concrete delivery: in addition to the mentioned complexity, strict time-constraints forbid both earliness and lateness of the supply. After developing a detailed model of the considered problem, we propose a novel meta-heuristic approach based on a hybrid genetic algorithm combined with constructive heuristics. A detailed case study derived from industrial data is used to illustrate the potential of the proposed approach.     

Generalized Cheeger-Gromoll metrics and the Hopf map

We show that there exists a family of Riemannian metrics on the tangent bundle of a two-sphere, which induces metrics of constant curvature on its unit tangent bundle. In other words, given such a metric on the tangent bundle of a two-sphere, the Hopf map is identified with a Riemannian submersion from the universal covering space of the unit tangent bundle, equipped with the induced metric, onto the two-sphere. A hyperbolic counterpart dealing with the tangent bundle of a hyperbolic plane is also presented.     

From 3-D Nonlinear Elasticity Theory to 1-D Bars with Nonconvex Energy

This paper represents a first attempt to derive one-dimensional models with non-convex strain energy starting from “genuine” three-dimensional, nonlinear, compressible, elasticity theory. Following the usual method of obtaining beam theories, we show here for a constrained kinematics appropriate for long cylinders governed by a polyconvex, objective, stored energy function, that the bar model originally proposed by Ericksen [3] is obtainable but enriched by an additional term in the strain gradient. This term, characteristic of nonsimple grade-2 materials, penalizes interfacial energies and makes single-interface two-phase solutions preferred. The resulting model has been proposed by a number of authors to describe the phenomenon of necking and cold drawing in polymeric fibers and, here, we discuss its suitability to interpret also the elastic-plastic behavior of metallic tensile bars under monotone loading.     

Packing T-joins

A consequence of Seymour's characterization of binary clutters with the Max Flow Min Cut property is that the minimum cardinality of a T-cut is equal to the largest number of edge-disjoint T-joins in every graph that cannot be T-contracted to an odd K_2,3. We give a simple “graphic” proof of this fact. © 1996 John Wiley & Sons, Inc.     

Diffusion Monte Carlo method with lattice regularization

We introduce an efficient lattice regularization scheme for quantum Monte Carlo calculations of realistic electronic systems. The kinetic term is discretized by a finite difference Laplacian with two mesh sizes, a and a', chosen so that the electrons can diffuse in a configuration space which is in practice indistinguishable from the continuum, and the different length scales in the system can be efficiently taken in account. The regularized Hamiltonian goes to the continuous limit for a --> 0 and allows the inclusion of nonlocal potentials in a consistent variational scheme, substantially improving the accuracy upon previous nonvariational approaches.