Search results for "VERTEX"
showing 10 items of 225 documents
FIRST experiment: Fragmentation of Ions Relevant for Space and Therapy
2013
International audience; Nuclear fragmentation processes are relevant in different fields of basic research and applied physics and are of particular interest for tumor therapy and for space radiation protection applications. The FIRST (Fragmentation of Ions Relevant for Space and Therapy) experiment at SIS accelerator of GSI laboratory in Darmstadt, has been designed for the measurement of different ions fragmentation cross sections at different energies between 100 and 1000 MeV/nucleon. The experiment is performed by an international collaboration made of institutions from Germany, France, Italy and Spain. The experimental apparatus is partly based on an already existing setup made of the …
A framework for vertex reconstruction in the ATLAS experiment at LHC
2010
In anticipation of the first LHC data to come, a considerable effort has been devoted to ensure the efficient reconstruction of vertices in the ATLAS detector. This includes the reconstruction of photon conversions, long lived particles, secondary vertices in jets as well as finding and fitting of primary vertices. The implementation of the corresponding algorithms requires a modular design based on the use of abstract interfaces and a common Event Data Model. An enhanced software framework addressing various physics applications of vertex reconstruction has been developed in the ATLAS experiment. Presented in this paper are the general principles of this framework. A particular emphasis is…
Adaptive memory programming for the dynamic bipartite drawing problem
2020
Abstract The bipartite drawing problem is a well-known NP-hard combinatorial optimization problem with numerous applications. The aim is to minimize the number of edge crossings in a two-layer graph, in which the edges are drawn as straight lines. We consider the dynamic variant of this problem, called the dynamic bipartite drawing problem (DBDP), which consists of adding (resp. or removing) vertices and edges to (resp. or from) a given bipartite drawing, thereby obtaining a new drawing with a layout similar to that of the original drawing. To solve this problem, we propose a tabu search method that incorporates adaptive memory to search the solution space efficiently. In this study, we com…
Variable Neighborhood Search for the Vertex Separation Problem
2012
The vertex separation problem belongs to a family of optimization problems in which the objective is to nd the best separator of vertices or edges in a generic graph. This optimization problem is strongly related to other well-known graph problems; such as the Path-Width, the Node Search Number or the Interval Thickness, among others. All of these optimization problems are NP-hard and have practical applications in VLSI, computer language compiler design or graph drawing. Up to know, they have been generally tackled with exact approaches, presenting polynomial-time algorithms to obtain the optimal solution for speci c types of graphs. However, in spite of their practical applications, these…
The next-to-ladder approximation for linear Dyson–Schwinger equations
2007
We solve the linear Dyson Schwinger equation for a massless vertex in Yukawa theory, iterating the first two primitive graphs.
In vitro power profiles of daily disposable contact lenses
2012
Abstract Purpose To evaluate and compare the distribution of refractive power within the optic zone of different soft contact lenses and to investigate the effect of lens decentration on the power profiles. Methods The Nimo TR1504 instrument was used to measure the optical power across different aperture diameters (from 1.5 mm to 5.5 mm in steps of 0.5 mm) of four daily disposable contact lenses: DAILIES TOTAL1, Proclear 1-Day, SofLens daily disposable and 1-DAY ACUVUE MOIST. Measurements were performed using a wet cell. Power data were evaluated when contact lenses were in its centered position and after inducing different amounts of lens decentration (from 0.2 mm to 1.0 mm in steps of 0.2…
Heuristics for the bandwidth colouring problem
2010
The bandwidth colouring problem consists of assigning a colour to each vertex of a graph, so that the absolute value of the difference between the colours of adjacent vertices is at least the value of the weight of the associated edge. This problem generalises the classical vertex colouring problem and different heuristics have recently been proposed to obtain high quality solutions. In this paper we describe both memory-based and memory-less methods to solve the bandwidth colouring problem. In particular we propose new constructive and improvement methods based on tabu search and GRASP. Comparison of our results with previously reported instances and existing heuristics indicate that the m…
A matheuristic for the Team Orienteering Arc Routing Problem
2015
In the Team OrienteeringArc Routing Problem (TOARP) the potential customers are located on the arcs of a directed graph and are to be chosen on the basis of an associated profit. A limited fleet of vehicles is available to serve the chosen customers. Each vehicle has to satisfy a maximum route duration constraint. The goal is to maximize the profit of the served customers. We propose a matheuristic for the TOARP and test it on a set of benchmark instances for which the optimal solution or an upper bound is known. The matheuristic finds the optimal solutions on all, except one, instances of one of the four classes of tested instances (with up to 27 vertices and 296 arcs). The average error o…
Volume estimate for a cone with a submanifold as vertex
1992
We give some estimates for the volume of a cone with vertex a submanifold P of a Riemannian or Kaehler manifold M. The estimates are functions of bounds of the mean curvature of P and the sectional curvature of M. They are sharp on cones having a basis which is contained in a tubular hypersurface about P in a space form or in a complex space form.
Meson-retardation effects in deuteron photodisintegration below ?-threshold
1989
Mesor-retardation effects in photodisintegration of the deuteron below pion threshold are studied by constructing retarded one-boson-exchange potentials using time-dependent non-covariant perturbation theory. The corresponding retarded meson-exchange currents including retarded vertex currents are derived analogously by gauge-invariant minimal coupling. It is found that retardation effects in the wave functions and in the electromagnetic currents as well have a significant influence on total and differential cross sections.