Search results for "Clos"
showing 10 items of 1439 documents
Effect of mixing and spatial dimension on the glass transition
2009
We study the influence of composition changes on the glass transition of binary hard disc and hard sphere mixtures in the framework of mode coupling theory. We derive a general expression for the slope of a glass transition line. Applied to the binary mixture in the low concentration limits, this new method allows a fast prediction of some properties of the glass transition lines. The glass transition diagram we find for binary hard discs strongly resembles the random close packing diagram. Compared to 3D from previous studies, the extension of the glass regime due to mixing is much more pronounced in 2D where plasticization only sets in at larger size disparities. For small size disparitie…
Non Gaussian closure techniques for the analysis of R-FBI isolation system
1997
The Resilient-Friction Base Isolator (R-FBI) stochastic response under severe ground motion modelled as a stationary and non-stationary zero mean stochastic white noise processes is performed. The moment equation approach is applied and the non-normal response is obtained by means of a non-Gaussian closure technique, based on the Gram-Charlier asymptotic expansion of the response probability density function. Results are compared with the equivalent non linearization technique and with results obtained by means of Monte Carlo simulation.
On the Distance-Constrained Close Enough Arc Routing Problem
2021
[EN] Arc routing problems consist basically of finding one or several routes traversing a given set of arcs and/or edges that must be serviced. The Close-Enough Arc Routing Problem, or Generalized Directed Rural Postman Problem, does not assume that customers are located at specific arcs, but can be serviced by traversing any arc of a given subset. Real-life applications include routing for meter reading, in which a vehicle equipped with a receiver travels a street network. If the vehicle gets within a certain distance of a meter, the receiver collects its data. Therefore, only a few streets which are close enough to the meters need to be traversed. In this paper we study the generalization…
A Quick Simulation Technique for a Fluid Information Storage Problem
2001
Summary In this paper we present an application of Importance Sampling (IS) for quick simulation of buffer overflow probability in a statistical multiplexer loaded with a number of independent Markov modulated fluid sources. Runtime improvement is deducible from NMCσ2(p) and NISσ2(p*) that characterize the trade-offs between sample size and variance of the estimators of buffer overflow probability experienced in Monte Carlo (MC) and Importance Sampling simulations. By assuming that the same precision is achieved for the two kinds of simulations if σ2(p)=σ2(p*), an approximate closed form expression for the ratio NIS/NMC is derived, and it is minimized with respect to the load of the multipl…
Optimal Local Routing Strategies for Community Structured Time Varying Communication Networks
2017
International audience; In time varying data communication networks (TVCN), traffic congestion, system utility maximization and network performance enhancement are the prominent issues. All these issues can be resolved either by optimizing the network structure or by selecting efficient routing approaches. In this paper, we focus on the design of a time varying network model and propose an algorithm to find efficient user route in this network. Centrality plays a very important role in finding congestion free routes. Indeed, the more a node is central, the more it can be congested by the flow coming from or going to its neighborhood. For that reason, classically, routes are chosen such that…
A new definition of well-behaved discrimination functions
2009
Abstract A discrimination function shows the probability or degree with which stimuli are discriminated from each other when presented in pairs. In a previous publication [Kujala, J.V., & Dzhafarov, E.N. (2008). On minima of discrimination functions. Journal of Mathematical Psychology , 52 , 116–127] we introduced a condition under which the conformity of a discrimination function with the law of Regular Minimality (which says, essentially, that “being least discriminable from” is a symmetric relation) implies the constancy of the function’s minima (i.e., the same level of discriminability of every stimulus from the stimulus least discriminable from it). This condition, referred to as “well…
The geometry of canal surfaces and the length of curves in de Sitter space
2011
Abstract We find the minimal value of the length in de Sitter space of closed space-like curves with non-vanishing non-space-like geodesic curvature vector. These curves are in correspondence with closed almost-regular canal surfaces, and their length is a natural magnitude in conformal geometry. As an application, we get a lower bound for the total conformal torsion of closed space curves.
Prescribing the behaviour of geodesics in negative curvature
2010
Given a family of (almost) disjoint strictly convex subsets of a complete negatively curved Riemannian manifold M, such as balls, horoballs, tubular neighborhoods of totally geodesic submanifolds, etc, the aim of this paper is to construct geodesic rays or lines in M which have exactly once an exactly prescribed (big enough) penetration in one of them, and otherwise avoid (or do not enter too much in) them. Several applications are given, including a definite improvement of the unclouding problem of [PP1], the prescription of heights of geodesic lines in a finite volume such M, or of spiraling times around a closed geodesic in a closed such M. We also prove that the Hall ray phenomenon desc…
Feuilletages deCP(n) : de l’holonomie hyperbolique pour les minimaux exceptionnels
1992
Let ℱ be a holomorphic foliation ofCP(n). If ℱ has a leaf L, the closure L of which is disjoint from the singular set of the foliation, we prove that there exists a loop in a leaf contained in L with contracting hyperbolic holonomy.
Selected Topics on Banach Space Theory
2019
Basic topics on Banach space theory needed for the text are reviewed. Hahn-Banach theorem, Baire’s theorem, uniform boundedness principle, closed graph theorem, weak topologies, Banach-Alaoglu theorem, unconditional basis, Banach sequence spaces, summing operators, factorable operators, cotype, Kahane inequality.