Large-Eddy Simulation closures of passive scalar turbulence: a systematic approach

The issue of the parameterization of small scale (``subgrid'') turbulence is addressed in the context of passive scalar transport. We focus on the Kraichnan advection model which lends itself to the analytical investigation of the closure problem. We derive systematically the dynamical equations which rule the evolution of the coarse-grained scalar field. At the lowest-order approximation in $l/r$, $l$ being the characteristic scale of the filter defining the coarse-grained scalar field and $r$ the inertial range separation, we recover the classical eddy-diffusivity parameterization of small scales. At the next-leading order a dynamical closure is obtained. The latter outperforms the classical model and is therefore a natural candidate for subgrid modelling of scalar transport in generic turbulent flows.Comment: 10 LaTex pages, 1 PS figure. Changes: comments added below previous (3.10); Previous (3.16) has been corrected; Minor changes in the conclusion

A nonmonotone GRASP

A greedy randomized adaptive search procedure (GRASP) is an itera- tive multistart metaheuristic for difficult combinatorial optimization problems. Each GRASP iteration consists of two phases: a construction phase, in which a feasible solution is produced, and a local search phase, in which a local optimum in the neighborhood of the constructed solution is sought. Repeated applications of the con- struction procedure yields different starting solutions for the local search and the best overall solution is kept as the result. The GRASP local search applies iterative improvement until a locally optimal solution is found. During this phase, starting from the current solution an improving neighbor solution is accepted and considered as the new current solution. In this paper, we propose a variant of the GRASP framework that uses a new “nonmonotone” strategy to explore the neighborhood of the current solu- tion. We formally state the convergence of the nonmonotone local search to a locally optimal solution and illustrate the effectiveness of the resulting Nonmonotone GRASP on three classical hard combinatorial optimization problems: the maximum cut prob- lem (MAX-CUT), the weighted maximum satisfiability problem (MAX-SAT), and the quadratic assignment problem (QAP)

Gender assessment through three-dimensional analysis of maxillary sinuses by means of Cone Beam Computed Tomography

OBJECTIVE: The availability of a low dose radiation technology such as Cone Beam Computed Tomography (CBCT) in dental practice has increased the number of scans available for forensic purposes. Moreover, specific software allows for three-dimensional (3D) characterization of the maxillary sinuses. This study was performed to determine whether sinus maxillary volumes can be useful to identify gender after validating the use of the Dolphin software as a tool for volumetric estimation of maxillary sinus volumes. PATIENTS AND METHODS: The validation was performed by four different operators measuring the volume of six phantoms, where the real volume was already known. The maxillary sinus volumes of 52 patients (26 males and 26 females) mean age 24.3 were calculated and compared between genders and sagittal skeletal class subdivision. The measurements for patients and phantoms were based on CBCT scans (ILUMA™) processed by Dolphin 3D software. RESULTS: No statistical difference was observed between the real volume and the volume measurements performed by the operators. No statistical difference was found in patient's maxillary sinus volumes between gender. CONCLUSIONS: Based on our results, it is not possible to support the use of maxillary sinuses to discern sexual difference in corpse identification

An Efficient Coded Multicasting Scheme Preserving the Multiplicative Caching Gain

Coded multicasting has been shown to be a promis- ing approach to significantly improve the caching performance of content delivery networks with multiple caches downstream of a common multicast link. However, achievable schemes proposed to date have been shown to achieve the proved order-optimal performance only in the asymptotic regime in which the number of packets per requested item goes to infinity. In this paper, we first extend the asymptotic analysis of the achievable scheme in [1], [2] to the case of heterogeneous cache sizes and demand distributions, providing the best known upper bound on the fundamental limiting performance when the number of packets goes to infinity. We then show that the scheme achieving this upper bound quickly loses its multiplicative caching gain for finite content packetization. To overcome this limitation, we design a novel polynomial-time algorithm based on random greedy graph- coloring that, while keeping the same finite content packetization, recovers a significant part of the multiplicative caching gain. Our results show that the order-optimal coded multicasting schemes proposed to date, while useful in quantifying the fundamental limiting performance, must be properly designed for practical regimes of finite packetization.Comment: 6 pages, 7 figures, Published in Infocom CNTCV 201

Assessing senescence patterns in populations of large mammals

Theoretical models such as those of Gompertz and Weibull are commonly used to study senescence in survival for humans and laboratory or captive animals. For wild populations of vertebrates, senescence in survival has more commonly been assessed by fitting simple linear or quadratic relationships between survival and age. By using appropriate constraints on survival parameters in Capture-Mark-Recapture (CMR) models, we propose a first analysis of the suitability of the Gompertz and the two-parameter Weibull models for describing aging-related mortality in free-ranging populations of ungulates. We first show how to handle the Gompertz and the two-parameter Weibull models in the context of CMR analyses. Then we perform a comparative analysis of senescence patterns in both sexes of two ungulate species highly contrasted according to the intensity of sexual selection. Our analyses provide support to the Gompertz model for describing senescence patterns in ungulates. Evolutionary implications of our results are discusse

Driven classical diffusion with strong correlated disorder

We analyze one-dimensional motion of an overdamped classical particle in the presence of external disorder potential and an arbitrary driving force F. In thermodynamical limit the effective force-dependent mobility mu(F) is self-averaging, although the required system size may be exponentially large for strong disorder. We calculate the mobility mu(F) exactly, generalizing the known results in linear response (weak driving force) and the perturbation theory in powers of the disorder amplitude. For a strong disorder potential with power-law correlations we identify a non-linear regime with a prominent power-law dependence of the logarithm of mu(F) on the driving force.Comment: 4 pages, 2 figures include

Lorenz-like systems and classical dynamical equations with memory forcing: a new point of view for singling out the origin of chaos

A novel view for the emergence of chaos in Lorenz-like systems is presented. For such purpose, the Lorenz problem is reformulated in a classical mechanical form and it turns out to be equivalent to the problem of a damped and forced one dimensional motion of a particle in a two-well potential, with a forcing term depending on the ``memory'' of the particle past motion. The dynamics of the original Lorenz system in the new particle phase space can then be rewritten in terms of an one-dimensional first-exit-time problem. The emergence of chaos turns out to be due to the discontinuous solutions of the transcendental equation ruling the time for the particle to cross the intermediate potential wall. The whole problem is tackled analytically deriving a piecewise linearized Lorenz-like system which preserves all the essential properties of the original model.Comment: 48 pages, 25 figure

Multi-start heuristics for the Two-Echelon Vehicle Routing Problem

In this paper we address the Two-Echelon Vehicle Routing Problem (2E-VRP), an extension of the classical Capacitated VRP, where the delivery from a single depot to the customers is managed by routing and consolidating the freight through intermediate depots called satellites. We present a family of Multi-Start heuristics based on separating the depot-to-satellite transfer and the satellite-to-customer delivery by iteratively solving the two resulting routing subproblems, while adjusting the satellite workloads that link them. The common scheme on which all the heuristics are based consists in, after having found an initial solution, applying a local search phase, followed by a diversification; if the new obtained solutions are feasible, then local search is applied again, otherwise a feasibility search procedure is applied, and if it successful, the local search is applied on the newfound solution. Different diversification strategies and feasibility search rules are proposed. We present computational results on a wide set of instances up to 50 customers and 5 satellites and compare them with results from the literature, showing how the new methods outperform previous existent methods, both in efficiency and accurac