Search results for "Parallel"
showing 10 items of 667 documents
"Table 19" of "Measurement of event shape and inclusive distributions at s**(1/2) = 130-GeV and 136-GeV."
1997
2-jet rate for the Durham Algorithm.
"Table 27" of "Tuning and test of fragmentation models based on identified particles and precision event shape data."
1996
Differential 2-jet rate for the Durham Algorithm. Corrected to final state particles. YCUT is the jet finding cutt-off parameter.
Surrealism in the Service of the Fantastic : Jean Rollin, a «parallel» Director in Libertarian French Cinema
2014
International audience
On 2-(n^2,2n,2n-1) designs with three intersection numbers
2007
The simple incidence structure $${\mathcal{D}(\mathcal{A},2)}$$ , formed by the points and the unordered pairs of distinct parallel lines of a finite affine plane $${\mathcal{A}=(\mathcal{P}, \mathcal{L})}$$ of order n > 4, is a 2 --- (n 2,2n,2n---1) design with intersection numbers 0,4,n. In this paper, we show that the converse is true, when n ? 5 is an odd integer.
On the hyperbolic limit points of groups acting on hyperbolic spaces
1998
We study the hyperbolic limit points of a groupG acting on a hyperbolic metric space, and consider the question of whether any attractive limit point corresponds to a unique repulsive limit point. In the special case whereG is a (non-elementary) finitely generated hyperbolic group acting on its Cayley graph, the answer is affirmative, and the resulting mapg +↦g −, is discontinuous everywhere on the hyperbolic boundary. We also provide a direct, combinatorial proof in the special case whereG is a (non-abelian) free group of finite type, by characterizing algebraically the hyperbolic ends ofG.
Randomized renaming in shared memory systems.
2021
Abstract Renaming is a task in distributed computing where n processes are assigned new names from a name space of size m . The problem is called tight if m = n , and loose if m > n . In recent years renaming came to the fore again and new algorithms were developed. For tight renaming in asynchronous shared memory systems, Alistarh et al. describe a construction based on the AKS network that assigns all names within O ( log n ) steps per process. They also show that, depending on the size of the name space, loose renaming can be done considerably faster. For m = ( 1 + ϵ ) ⋅ n and constant ϵ , they achieve a step complexity of O ( log log n ) . In this paper we consider tight as well as loos…
Online Scheduling of Task Graphs on Heterogeneous Platforms
2020
Modern computing platforms commonly include accelerators. We target the problem of scheduling applications modeled as task graphs on hybrid platforms made of two types of resources, such as CPUs and GPUs. We consider that task graphs are uncovered dynamically, and that the scheduler has information only on the available tasks, i.e., tasks whose predecessors have all been completed. Each task can be processed by either a CPU or a GPU, and the corresponding processing times are known. Our study extends a previous $4\sqrt{m/k}$ 4 m / k -competitive online algorithm by Amaris et al. [1] , where $m$ m is the number of CPUs and $k$ k the number of GPUs ( $m\geq k$ m ≥ k ). We prove that no online…
Performance analysis of optical imaging systems based on the fractional fourier transform
1998
Some image quality parameters, such as the Strehl ratio and the optical transfer function, are analysed in the generalized phase-space, or x-p domain, of the fractional Fourier transform associated with a modified one-dimensional pupil function. Some experimental results together with computer simulations are performed which illustrate the tolerance to defocus of different apertures.
Contrôle quantique adiabatique : technique de passage adiabatique parallèle et systèmes dissipatifs
2011
The first part of this thesis is devoted to the theoretical analysis of adiabatic processes allowing the transfer of population from an initial state to a target state of a quantum system. The strategy of parallel adiabatic passage, in which the coupling parameters are specifically designed to optimize the adiabatic passage corresponding to parallel eigenvalues at all times, allows one to combine the energetically efficiency of pi-pulse and related strategies with the robustness of standard adiabaticpassage. The second part of this thesis concerns the effects of the dissipation in adiabatic passage. The non-adiabatic transition probability formula of a two state system with dissipation is e…