A fast algorithm for vertex-frequency representations of signals on graphs

PubMed Central

Jestrović, Iva; Coyle, James L.; Sejdić, Ervin

2016-01-01

The windowed Fourier transform (short time Fourier transform) and the S-transform are widely used signal processing tools for extracting frequency information from non-stationary signals. Previously, the windowed Fourier transform had been adopted for signals on graphs and has been shown to be very useful for extracting vertex-frequency information from graphs. However, high computational complexity makes these algorithms impractical. We sought to develop a fast windowed graph Fourier transform and a fast graph S-transform requiring significantly shorter computation time. The proposed schemes have been tested with synthetic test graph signals and real graph signals derived from electroencephalography recordings made during swallowing. The results showed that the proposed schemes provide significantly lower computation time in comparison with the standard windowed graph Fourier transform and the fast graph S-transform. Also, the results showed that noise has no effect on the results of the algorithm for the fast windowed graph Fourier transform or on the graph S-transform. Finally, we showed that graphs can be reconstructed from the vertex-frequency representations obtained with the proposed algorithms. PMID:28479645

Geometric interpretation of vertex operator algebras.

PubMed Central

Huang, Y Z

1991-01-01

In this paper, Vafa's approach to the formulation of conformal field theories is combined with the formal calculus developed in Frenkel, Lepowsky, and Meurman's work on the vertex operator construction of the Monster to give a geometric definition of vertex operator algebras. The main result announced is the equivalence between this definition and the algebraic one in the sense that the categories determined by these definitions are isomorphic. PMID:11607240

M2-brane surface operators and gauge theory dualities in Toda

NASA Astrophysics Data System (ADS)

Gomis, Jaume; Le Floch, Bruno

2016-04-01

We give a microscopic two dimensional {N} = (2, 2) gauge theory description of arbitrary M2-branes ending on N f M5-branes wrapping a punctured Riemann surface. These realize surface operators in four dimensional {N} = 2 field theories. We show that the expectation value of these surface operators on the sphere is captured by a Toda CFT correlation function in the presence of an additional degenerate vertex operator labelled by a representation {R} of SU( N f ), which also labels M2-branes ending on M5-branes. We prove that symmetries of Toda CFT correlators provide a geometric realization of dualities between two dimensional gauge theories, including {N} = (2, 2) analogues of Seiberg and Kutasov-Schwimmer dualities. As a bonus, we find new explicit conformal blocks, braiding matrices, and fusion rules in Toda CFT.

Thermal form factor approach to the ground-state correlation functions of the XXZ chain in the antiferromagnetic massive regime

NASA Astrophysics Data System (ADS)

Dugave, Maxime; Göhmann, Frank; Kozlowski, Karol K.; Suzuki, Junji

2016-09-01

We use the form factors of the quantum transfer matrix in the zero-temperature limit in order to study the two-point ground-state correlation functions of the XXZ chain in the antiferromagnetic massive regime. We obtain novel form factor series representations of the correlation functions which differ from those derived either from the q-vertex-operator approach or from the algebraic Bethe Ansatz approach to the usual transfer matrix. We advocate that our novel representations are numerically more efficient and allow for a straightforward calculation of the large-distance asymptotic behaviour of the two-point functions. Keeping control over the temperature corrections to the two-point functions we see that these are of order {T}∞ in the whole antiferromagnetic massive regime. The isotropic limit of our result yields a novel form factor series representation for the two-point correlation functions of the XXX chain at zero magnetic field. Dedicated to the memory of Petr Petrovich Kulish.

Plethystic vertex operators and boson-fermion correspondences

NASA Astrophysics Data System (ADS)

Fauser, Bertfried; Jarvis, Peter D.; King, Ronald C.

2016-10-01

We study the algebraic properties of plethystic vertex operators, introduced in (2010 J. Phys. A: Math. Theor. 43 405202), underlying the structure of symmetric functions associated with certain generalized universal character rings of subgroups of the general linear group, defined to stabilize tensors of Young symmetry type characterized by a partition of arbitrary shape π. Here we establish an extension of the well-known boson-fermion correspondence involving Schur functions and their associated (Bernstein) vertex operators: for each π, the modes generated by the plethystic vertex operators and their suitably constructed duals, satisfy the anticommutation relations of a complex Clifford algebra. The combinatorial manipulations underlying the results involve exchange identities exploiting the Hopf-algebraic structure of certain symmetric function series and their plethysms.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gao, Yun, E-mail: ygao@yorku.ca; Hu, Naihong, E-mail: nhhu@math.ecnu.edu.cn; Zhang, Honglian, E-mail: hlzhangmath@shu.edu.cn

In this paper, we define the two-parameter quantum affine algebra for type G{sub 2}{sup (1)} and give the (r, s)-Drinfeld realization of U{sub r,s}(G{sub 2}{sup (1)}), as well as establish and prove its Drinfeld isomorphism. We construct and verify explicitly the level-one vertex representation of two-parameter quantum affine algebra U{sub r,s}(G{sub 2}{sup (1)}), which also supports an evidence in nontwisted type G{sub 2}{sup (1)} for the uniform defining approach via the two-parameter τ-invariant generating functions proposed in Hu and Zhang [Generating functions with τ-invariance and vertex representations of two-parameter quantum affine algebras U{sub r,s}(g{sup ^}): Simply laced cases e-print http://arxiv.org/abs/1401.4925more » ].« less

N=2 Minimal Conformal Field Theories and Matrix Bifactorisations of x d

NASA Astrophysics Data System (ADS)

Davydov, Alexei; Camacho, Ana Ros; Runkel, Ingo

2018-01-01

We establish an action of the representations of N = 2-superconformal symmetry on the category of matrix factorisations of the potentials x d and x d - y d , for d odd. More precisely we prove a tensor equivalence between (a) the category of Neveu-Schwarz-type representations of the N = 2 minimal super vertex operator algebra at central charge 3-6/d, and (b) a full subcategory of graded matrix factorisations of the potential x d - y d . The subcategory in (b) is given by permutation-type matrix factorisations with consecutive index sets. The physical motivation for this result is the Landau-Ginzburg/conformal field theory correspondence, where it amounts to the equivalence of a subset of defects on both sides of the correspondence. Our work builds on results by Brunner and Roggenkamp [BR], where an isomorphism of fusion rules was established.

A braided monoidal category for free super-bosons

DOE Office of Scientific and Technical Information (OSTI.GOV)

Runkel, Ingo, E-mail: ingo.runkel@uni-hamburg.de

The chiral conformal field theory of free super-bosons is generated by weight one currents whose mode algebra is the affinisation of an abelian Lie super-algebra h with non-degenerate super-symmetric pairing. The mode algebras of a single free boson and of a single pair of symplectic fermions arise for even|odd dimension 1|0 and 0|2 of h, respectively. In this paper, the representations of the untwisted mode algebra of free super-bosons are equipped with a tensor product, a braiding, and an associator. In the symplectic fermion case, i.e., if h is purely odd, the braided monoidal structure is extended to representations ofmore » the Z/2Z-twisted mode algebra. The tensor product is obtained by computing spaces of vertex operators. The braiding and associator are determined by explicit calculations from three- and four-point conformal blocks.« less

Effective signaling of surface boundaries by L-vertices reflect the consistency of their contrast in natural images.

PubMed

Vessel, Edward A; Biederman, Irving; Subramaniam, Suresh; Greene, Michelle R

2016-07-01

An L-vertex, the point at which two contours coterminate, provides highly reliable evidence that a surface terminates at that vertex, thus providing the strongest constraint on the extraction of shape from images (Guzman, 1968). Such vertices are pervasive in our visual world but the importance of a statistical regularity about them has been underappreciated: The contours defining the vertex are (almost) always of the same direction of contrast with respect to the background (i.e., both darker or both lighter). Here we show that when the two contours are of different directions of contrast, the capacity of the L-vertex to signal the termination of a surface, as reflected in object recognition, is markedly reduced. Although image statistics have been implicated in determining the connectivity in the earliest cortical visual stage (V1) and in grouping during visual search, this finding provides evidence that such statistics are involved in later stages where object representations are derived from two-dimensional images.

Conserved currents in the six-vertex and trigonometric solid-on-solid models

NASA Astrophysics Data System (ADS)

Ikhlef, Yacine; Weston, Robert

2017-04-01

We construct quasi-local conserved currents in the six-vertex model with anisotropy parameter η by making use of the quantum-group approach of Bernard and Felder. From these currents, we construct parafermionic operators with spin 1+\\text{i}η /π that obey a discrete-integral condition around lattice plaquettes embedded into the complex plane. These operators are identified with primary fields in a c  =  1 compactified free Boson conformal field theory. We then consider a vertex-face correspondence that takes the six-vertex model to a trigonometric SOS model, and construct SOS operators that are the image of the six-vertex currents under this correspondence. We define corresponding SOS parafermionic operators with spins s  =  1 and s=1+2\\text{i}η /π that obey discrete integral conditions around SOS plaquettes embedded into the complex plane. We consider in detail the cyclic-SOS case corresponding to the choice η =\\text{i}π ≤ft( p-{{p}\\prime}\\right)/p , with {{p}\\prime} coprime. We identify our SOS parafermionic operators in terms of the screening operators and primary fields of the associated c=1-6≤ft( p-{{p}\\prime}\\right){{}2}/p{{p}\\prime} conformal field theory.

Hypotrochoids in conformal restriction systems and Virasoro descendants

NASA Astrophysics Data System (ADS)

Doyon, Benjamin

2013-09-01

A conformal restriction system is a commutative, associative, unital algebra equipped with a representation of the groupoid of univalent conformal maps on connected open sets of the Riemann sphere, along with a family of linear functionals on subalgebras, satisfying a set of properties including conformal invariance and a type of restriction. This embodies some expected properties of expectation values in conformal loop ensembles CLEκ (at least for 8/3 < κ ≤ 4). In the context of conformal restriction systems, we study certain algebra elements associated with hypotrochoid simple curves (a family of curves including the ellipse). These have the CLE interpretation of being ‘renormalized random variables’ that are nonzero only if there is at least one loop of hypotrochoid shape. Each curve has a center w, a scale ɛ and a rotation angle θ, and we analyze the renormalized random variable as a function of u = ɛeiθ and w. We find that it has an expansion in positive powers of u and \\bar {u}, and that the coefficients of pure u (\\bar {u}) powers are holomorphic in w (\\bar {w}). We identify these coefficients (the ‘hypotrochoid fields’) with certain Virasoro descendants of the identity field in conformal field theory, thereby showing that they form part of a vertex operator algebraic structure. This largely generalizes works by the author (in CLE), and the author with his collaborators Riva and Cardy (in SLE8/3 and other restriction measures), where the case of the ellipse, at the order u2, led to the stress-energy tensor of CFT. The derivation uses in an essential way the Virasoro vertex operator algebra structure of conformal derivatives established recently by the author. The results suggest in particular the exact evaluation of CLE expectations of products of hypotrochoid fields as well as nontrivial relations amongst them through the vertex operator algebra, and further shed light onto the relationship between CLE and CFT.

Using the concept of pseudo amino acid composition to predict resistance gene against Xanthomonas oryzae pv. oryzae in rice: an approach from chaos games representation.

PubMed

Jingbo, Xia; Silan, Zhang; Feng, Shi; Huijuan, Xiong; Xuehai, Hu; Xiaohui, Niu; Zhi, Li

2011-09-07

To evaluate the possibility of an unknown protein to be a resistant gene against Xanthomonas oryzae pv. oryzae, a different mode of pseudo amino acid composition (PseAAC) is proposed to formulate the protein samples by integrating the amino acid composition, as well as the Chaos games representation (CGR) method. Some numerical comparisons of triangle, quadrangle and 12-vertex polygon CGR are carried to evaluate the efficiency of using these fractal figures in classifiers. The numerical results show that among the three polygon methods, triangle method owns a good fractal visualization and performs the best in the classifier construction. By using triangle + 12-vertex polygon CGR as the mathematical feature, the classifier achieves 98.13% in Jackknife test and MCC achieves 0.8462. Copyright © 2011 Elsevier Ltd. All rights reserved.

Non-crystallographic nets: characterization and first steps towards a classification.

PubMed

Moreira de Oliveira, Montauban; Eon, Jean Guillaume

2014-05-01

Non-crystallographic (NC) nets are periodic nets characterized by the existence of non-trivial bounded automorphisms. Such automorphisms cannot be associated with any crystallographic symmetry in realizations of the net by crystal structures. It is shown that bounded automorphisms of finite order form a normal subgroup F(N) of the automorphism group of NC nets (N, T). As a consequence, NC nets are unstable nets (they display vertex collisions in any barycentric representation) and, conversely, stable nets are crystallographic nets. The labelled quotient graphs of NC nets are characterized by the existence of an equivoltage partition (a partition of the vertex set that preserves label vectors over edges between cells). A classification of NC nets is proposed on the basis of (i) their relationship to the crystallographic net with a homeomorphic barycentric representation and (ii) the structure of the subgroup F(N).

LBMD : a layer-based mesh data structure tailored for generic API infrastructures.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ebeida, Mohamed S.; Knupp, Patrick Michael

2010-11-01

A new mesh data structure is introduced for the purpose of mesh processing in Application Programming Interface (API) infrastructures. This data structure utilizes a reduced mesh representation to increase its ability to handle significantly larger meshes compared to full mesh representation. In spite of the reduced representation, each mesh entity (vertex, edge, face, and region) is represented using a unique handle, with no extra storage cost, which is a crucial requirement in most API libraries. The concept of mesh layers makes the data structure more flexible for mesh generation and mesh modification operations. This flexibility can have a favorable impactmore » in solver based queries of finite volume and multigrid methods. The capabilities of LBMD make it even more attractive for parallel implementations using Message Passing Interface (MPI) or Graphics Processing Units (GPUs). The data structure is associated with a new classification method to relate mesh entities to their corresponding geometrical entities. The classification technique stores the related information at the node level without introducing any ambiguities. Several examples are presented to illustrate the strength of this new data structure.« less

On the star partition dimension of comb product of cycle and path

NASA Astrophysics Data System (ADS)

Alfarisi, Ridho; Darmaji

2017-08-01

Let G = (V, E) be a connected graphs with vertex set V(G), edge set E(G) and S ⊆ V(G). Given an ordered partition Π = {S1, S2, S3, …, Sk} of the vertex set V of G, the representation of a vertex v ∈ V with respect to Π is the vector r(v|Π) = (d(v, S1), d(v, S2), …, d(v, Sk)), where d(v, Sk) represents the distance between the vertex v and the set Sk and d(v, Sk) = min{d(v, x)|x ∈ Sk }. A partition Π of V(G) is a resolving partition if different vertices of G have distinct representations, i.e., for every pair of vertices u, v ∈ V(G), r(u|Π) ≠ r(v|Π). The minimum k of Π resolving partition is a partition dimension of G, denoted by pd(G). The resolving partition Π = {S1, S2, S3, …, Sk } is called a star resolving partition for G if it is a resolving partition and each subgraph induced by Si, 1 ≤ i ≤ k, is a star. The minimum k for which there exists a star resolving partition of V(G) is the star partition dimension of G, denoted by spd(G). Finding the star partition dimension of G is classified to be a NP-Hard problem. In this paper, we will show that the partition dimension of comb product of cycle and path namely Cm⊳Pn and Pn⊳Cm for n ≥ 2 and m ≥ 3.

Three-dimensional contour edge detection algorithm

NASA Astrophysics Data System (ADS)

Wang, Yizhou; Ong, Sim Heng; Kassim, Ashraf A.; Foong, Kelvin W. C.

2000-06-01

This paper presents a novel algorithm for automatically extracting 3D contour edges, which are points of maximum surface curvature in a surface range image. The 3D image data are represented as a surface polygon mesh. The algorithm transforms the range data, obtained by scanning a dental plaster cast, into a 2D gray scale image by linearly converting the z-value of each vertex to a gray value. The Canny operator is applied to the median-filtered image to obtain the edge pixels and their orientations. A vertex in the 3D object corresponding to the detected edge pixel and its neighbors in the direction of the edge gradient are further analyzed with respect to their n-curvatures to extract the real 3D contour edges. This algorithm provides a fast method of reducing and sorting the unwieldy data inherent in the surface mesh representation. It employs powerful 2D algorithms to extract features from the transformed 3D models and refers to the 3D model for further analysis of selected data. This approach substantially reduces the computational burden without losing accuracy. It is also easily extended to detect 3D landmarks and other geometrical features, thus making it applicable to a wide range of applications.

Plane representations of graphs and visibility between parallel segments

NASA Astrophysics Data System (ADS)

Tamassia, R.; Tollis, I. G.

1985-04-01

Several layout compaction strategies for VLSI are based on the concept of visibility between parallel segments, where we say that two parallel segments of a given set are visible if they can be joined by a segment orthogonal to them, which does not intersect any other segment. This paper studies visibility representations of graphs, which are constructed by mapping vertices to horizontal segments, and edges to vertical segments drawn between visible vertex-segments. Clearly, every graph that admits such a representation must be a planar. The authors consider three types of visibility representations, and give complete characterizations of the classes of graphs that admit them. Furthermore, they present linear time algorithms for testing the existence of and constructing visibility representations of planar graphs.

N  =  2 and N  =  4 subalgebras of super vertex operator algebras

NASA Astrophysics Data System (ADS)

Mason, Geoffrey; Tuite, Michael; Yamskulna, Gaywalee

2018-02-01

We develop criteria to decide if an N  =  2 or N  =  4 superconformal algebra is a subalgebra of a super vertex operator algebra in general, and of a super lattice theory in particular. We give some specific examples.

Grouper: a compact, streamable triangle mesh data structure.

PubMed

Luffel, Mark; Gurung, Topraj; Lindstrom, Peter; Rossignac, Jarek

2014-01-01

We present Grouper: an all-in-one compact file format, random-access data structure, and streamable representation for large triangle meshes. Similarly to the recently published SQuad representation, Grouper represents the geometry and connectivity of a mesh by grouping vertices and triangles into fixed-size records, most of which store two adjacent triangles and a shared vertex. Unlike SQuad, however, Grouper interleaves geometry with connectivity and uses a new connectivity representation to ensure that vertices and triangles can be stored in a coherent order that enables memory-efficient sequential stream processing. We present a linear-time construction algorithm that allows streaming out Grouper meshes using a small memory footprint while preserving the initial ordering of vertices. As a part of this construction, we show how the problem of assigning vertices and triangles to groups reduces to a well-known NP-hard optimization problem, and present a simple yet effective heuristic solution that performs well in practice. Our array-based Grouper representation also doubles as a triangle mesh data structure that allows direct access to vertices and triangles. Storing only about two integer references per triangle--i.e., less than the three vertex references stored with each triangle in a conventional indexed mesh format--Grouper answers both incidence and adjacency queries in amortized constant time. Our compact representation enables data-parallel processing on multicore computers, instant partitioning and fast transmission for distributed processing, as well as efficient out-of-core access. We demonstrate the versatility and performance benefits of Grouper using a suite of example meshes and processing kernels.

Grouper: A Compact, Streamable Triangle Mesh Data Structure

DOE Office of Scientific and Technical Information (OSTI.GOV)

Luffel, Mark; Gurung, Topraj; Lindstrom, Peter

2014-01-01

Here, we present Grouper: an all-in-one compact file format, random-access data structure, and streamable representation for large triangle meshes. Similarly to the recently published SQuad representation, Grouper represents the geometry and connectivity of a mesh by grouping vertices and triangles into fixed-size records, most of which store two adjacent triangles and a shared vertex. Unlike SQuad, however, Grouper interleaves geometry with connectivity and uses a new connectivity representation to ensure that vertices and triangles can be stored in a coherent order that enables memory-efficient sequential stream processing. We also present a linear-time construction algorithm that allows streaming out Grouper meshesmore » using a small memory footprint while preserving the initial ordering of vertices. In this construction, we show how the problem of assigning vertices and triangles to groups reduces to a well-known NP-hard optimization problem, and present a simple yet effective heuristic solution that performs well in practice. Our array-based Grouper representation also doubles as a triangle mesh data structure that allows direct access to vertices and triangles. Storing only about two integer references per triangle-i.e., less than the three vertex references stored with each triangle in a conventional indexed mesh format-Grouper answers both incidence and adjacency queries in amortized constant time. Our compact representation enables data-parallel processing on multicore computers, instant partitioning and fast transmission for distributed processing, as well as efficient out-of-core access. We demonstrate the versatility and performance benefits of Grouper using a suite of example meshes and processing kernels.« less

Stepwise emergence of the face-sensitive N170 event-related potential component.

PubMed

Jemel, Boutheina; Schuller, Anne-Marie; Cheref-Khan, Yasémine; Goffaux, Valérie; Crommelinck, Marc; Bruyer, Raymond

2003-11-14

The present study used a parametric design to characterize early event-related potentials (ERP) to face stimuli embedded in gradually decreasing random noise levels. For both N170 and the vertex positive potential (VPP) there was a linear increase in amplitude and decrease in latency with decreasing levels of noise. In contrast, the earlier visual P1 component was stable across noise levels. The P1/N170 dissociation suggests not only a functional dissociation between low and high-level visual processing of faces but also that the N170 reflects the integration of sensorial information into a unitary representation. In addition, the N170/VPP association supports the view that they reflect the same processes operating when viewing faces.

Generalized -deformed correlation functions as spectral functions of hyperbolic geometry

NASA Astrophysics Data System (ADS)

Bonora, L.; Bytsenko, A. A.; Guimarães, M. E. X.

2014-08-01

We analyze the role of vertex operator algebra and 2d amplitudes from the point of view of the representation theory of infinite-dimensional Lie algebras, MacMahon and Ruelle functions. By definition p-dimensional MacMahon function, with , is the generating function of p-dimensional partitions of integers. These functions can be represented as amplitudes of a two-dimensional c = 1 CFT, and, as such, they can be generalized to . With some abuse of language we call the latter amplitudes generalized MacMahon functions. In this paper we show that generalized p-dimensional MacMahon functions can be rewritten in terms of Ruelle spectral functions, whose spectrum is encoded in the Patterson-Selberg function of three-dimensional hyperbolic geometry.

Overcomplete compact representation of two-particle Green's functions

NASA Astrophysics Data System (ADS)

Shinaoka, Hiroshi; Otsuki, Junya; Haule, Kristjan; Wallerberger, Markus; Gull, Emanuel; Yoshimi, Kazuyoshi; Ohzeki, Masayuki

2018-05-01

Two-particle Green's functions and the vertex functions play a critical role in theoretical frameworks for describing strongly correlated electron systems. However, numerical calculations at the two-particle level often suffer from large computation time and massive memory consumption. We derive a general expansion formula for the two-particle Green's functions in terms of an overcomplete representation based on the recently proposed "intermediate representation" basis. The expansion formula is obtained by decomposing the spectral representation of the two-particle Green's function. We demonstrate that the expansion coefficients decay exponentially, while all high-frequency and long-tail structures in the Matsubara-frequency domain are retained. This representation therefore enables efficient treatment of two-particle quantities and opens a route to the application of modern many-body theories to realistic strongly correlated electron systems.

Boolean Operations with Prism Algebraic Patches

PubMed Central

Bajaj, Chandrajit; Paoluzzi, Alberto; Portuesi, Simone; Lei, Na; Zhao, Wenqi

2009-01-01

In this paper we discuss a symbolic-numeric algorithm for Boolean operations, closed in the algebra of curved polyhedra whose boundary is triangulated with algebraic patches (A-patches). This approach uses a linear polyhedron as a first approximation of both the arguments and the result. On each triangle of a boundary representation of such linear approximation, a piecewise cubic algebraic interpolant is built, using a C1-continuous prism algebraic patch (prism A-patch) that interpolates the three triangle vertices, with given normal vectors. The boundary representation only stores the vertices of the initial triangulation and their external vertex normals. In order to represent also flat and/or sharp local features, the corresponding normal-per-face and/or normal-per-edge may be also given, respectively. The topology is described by storing, for each curved triangle, the two triples of pointers to incident vertices and to adjacent triangles. For each triangle, a scaffolding prism is built, produced by its extreme vertices and normals, which provides a containment volume for the curved interpolating A-patch. When looking for the result of a regularized Boolean operation, the 0-set of a tri-variate polynomial within each such prism is generated, and intersected with the analogous 0-sets of the other curved polyhedron, when two prisms have non-empty intersection. The intersection curves of the boundaries are traced and used to decompose each boundary into the 3 standard classes of subpatches, denoted in, out and on. While tracing the intersection curves, the locally refined triangulation of intersecting patches is produced, and added to the boundary representation. PMID:21516262

Intersecting surface defects and two-dimensional CFT

NASA Astrophysics Data System (ADS)

Gomis, Jaume; Le Floch, Bruno; Pan, Yiwen; Peelaers, Wolfger

2017-08-01

We initiate the study of intersecting surface operators/defects in 4D quantum field theories (QFTs). We characterize these defects by coupled 4D/2D/0D theories constructed by coupling the degrees of freedom localized at a point and on intersecting surfaces in spacetime to each other and to the 4D QFT. We construct supersymmetric intersecting surface defects preserving just two supercharges in N =2 gauge theories. These defects are amenable to exact analysis by localization of the partition function of the underlying 4D/2D/0D QFT. We identify the 4D/2D/0D QFTs that describe intersecting surface operators in N =2 gauge theories realized by intersecting M2 branes ending on N M5 branes wrapping a Riemann surface. We conjecture and provide evidence for an explicit equivalence between the squashed four-sphere partition function of these intersecting defects and correlation functions in Liouville/Toda CFT with the insertion of arbitrary degenerate vertex operators, which are labeled by two representations of S U (N ).

Vertex centrality as a measure of information flow in Italian Corporate Board Networks

NASA Astrophysics Data System (ADS)

Grassi, Rosanna

2010-06-01

The aim of this article is to investigate the governance models of companies listed on the Italian Stock Exchange by using a network approach, which describes the interlinks between boards of directors. Following mainstream literature, I construct a weighted graph representing the listed companies (vertices) and their relationships (weighted edges), the Corporate Board Network; I then apply three different vertex centrality measures: degree, betweenness and flow betweenness. What emerges from the network construction and by applying the degree centrality is a structure with a large number of connections but not particularly dense, where the presence of a small number of highly connected nodes (hubs) is evident. Then I focus on betweenness and flow betweenness; indeed I expect that these centrality measures may give a representation of the intensity of the relationship between companies, capturing the volume of information flowing from one vertex to another. Finally, I investigate the possible scale-free structure of the network.

Reduced multimodal integration of memory features following continuous theta burst stimulation of angular gyrus.

PubMed

Yazar, Yasemin; Bergström, Zara M; Simons, Jon S

Lesions of the angular gyrus (AnG) region of human parietal cortex do not cause amnesia, but appear to be associated with reduction in the ability to consciously experience the reliving of previous events. We used continuous theta burst stimulation to test the hypothesis that the cognitive mechanism implicated in this memory deficit might be the integration of retrieved sensory event features into a coherent multimodal memory representation. Healthy volunteers received stimulation to AnG or a vertex control site after studying stimuli that each comprised a visual object embedded in a scene, with the name of the object presented auditorily. Participants were then asked to make memory judgments about the studied stimuli that involved recollection of single event features (visual or auditory), or required integration of event features within the same modality, or across modalities. Participants' ability to retrieve context features from across multiple modalities was significantly reduced after AnG stimulation compared to stimulation of the vertex. This effect was observed only for the integration of cross-modal context features but not for integration of features within the same modality, and could not be accounted for by task difficulty as performance was matched across integration conditions following vertex stimulation. These results support the hypothesis that AnG is necessary for the multimodal integration of distributed cortical episodic features into a unified conscious representation that enables the experience of remembering. Copyright © 2017 The Authors. Published by Elsevier Inc. All rights reserved.

Spinfoam cosmology with the proper vertex amplitude

NASA Astrophysics Data System (ADS)

Vilensky, Ilya

2017-11-01

The proper vertex amplitude is derived from the Engle-Pereira-Rovelli-Livine vertex by restricting to a single gravitational sector in order to achieve the correct semi-classical behaviour. We apply the proper vertex to calculate a cosmological transition amplitude that can be viewed as the Hartle-Hawking wavefunction. To perform this calculation we deduce the integral form of the proper vertex and use extended stationary phase methods to estimate the large-volume limit. We show that the resulting amplitude satisfies an operator constraint whose classical analogue is the Hamiltonian constraint of the Friedmann-Robertson-Walker cosmology. We find that the constraint dynamically selects the relevant family of coherent states and demonstrate a similar dynamic selection in standard quantum mechanics. We investigate the effects of dynamical selection on long-range correlations.

Reflection K-matrices for a nineteen vertex model with Uq [ osp (2 | 2) (2) ] symmetry

NASA Astrophysics Data System (ADS)

Vieira, R. S.; Lima Santos, A.

2017-09-01

We derive the solutions of the boundary Yang-Baxter equation associated with a supersymmetric nineteen vertex model constructed from the three-dimensional representation of the twisted quantum affine Lie superalgebra Uq [ osp (2 | 2) (2) ]. We found three classes of solutions. The type I solution is characterized by three boundary free-parameters and all elements of the corresponding reflection K-matrix are different from zero. In the type II solution, the reflection K-matrix is even (every element of the K-matrix with an odd parity is null) and it has only one boundary free-parameter. Finally, the type III solution corresponds to a diagonal reflection K-matrix with two boundary free-parameters.

Approximations of quantum-graph vertex couplings by singularly scaled potentials

NASA Astrophysics Data System (ADS)

Exner, Pavel; Manko, Stepan S.

2013-08-01

We investigate the limit properties of a family of Schrödinger operators of the form H_\\varepsilon = -\\frac{{d}^2}{{d}x^2}+ \\frac{\\lambda (\\varepsilon )}{\\varepsilon ^2}Q \\big (\\frac{x}{\\varepsilon }\\big ) acting on n-edge star graphs with the Kirchhoff interface conditions at the vertex. Here the real-valued potential Q has compact support and λ( · ) is analytic around ε = 0 with λ(0) = 1. We show that if the operator has a zero-energy resonance of order m for ε = 1 and λ(1) = 1, in the limit ε → 0 one obtains the Laplacian with a vertex coupling depending on 1+\\frac{1}{2} m(2n-m+1) parameters. We prove the norm-resolvent convergence as well as the convergence of the corresponding on-shell scattering matrices. The obtained vertex couplings are of scale-invariant type provided λ‧(0) = 0; otherwise the scattering matrix depends on energy and the scaled potential becomes asymptotically opaque in the low-energy limit.

Lambda: A Mathematica package for operator product expansions in vertex algebras

NASA Astrophysics Data System (ADS)

Ekstrand, Joel

2011-02-01

We give an introduction to the Mathematica package Lambda, designed for calculating λ-brackets in both vertex algebras, and in SUSY vertex algebras. This is equivalent to calculating operator product expansions in two-dimensional conformal field theory. The syntax of λ-brackets is reviewed, and some simple examples are shown, both in component notation, and in N=1 superfield notation. Program summaryProgram title: Lambda Catalogue identifier: AEHF_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEHF_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: GNU General Public License No. of lines in distributed program, including test data, etc.: 18 087 No. of bytes in distributed program, including test data, etc.: 131 812 Distribution format: tar.gz Programming language: Mathematica Computer: See specifications for running Mathematica V7 or above. Operating system: See specifications for running Mathematica V7 or above. RAM: Varies greatly depending on calculation to be performed. Classification: 4.2, 5, 11.1. Nature of problem: Calculate operator product expansions (OPEs) of composite fields in 2d conformal field theory. Solution method: Implementation of the algebraic formulation of OPEs given by vertex algebras, and especially by λ-brackets. Running time: Varies greatly depending on calculation requested. The example notebook provided takes about 3 s to run.

Non-isolated Resolving Sets of certain Graphs Cartesian Product with a Path

NASA Astrophysics Data System (ADS)

Hasibuan, I. M.; Salman, A. N. M.; Saputro, S. W.

2018-04-01

Let G be a connected, simple, and finite graph. For an ordered subset W = {w 1 , w 2 , · · ·, wk } of vertices in a graph G and a vertex v of G, the metric representation of v with respect to W is the k-vector r(v|W ) = (d(v, w 1), d(v, w 2), · · ·, d(v, wk )). The set W is called a resolving set for G if every vertex of G has a distinct representation. The minimum cardinality of W is called the metric dimension of G, denoted by dim(G). If the induced subgraph < W> has no isolated vertices, then W is called a non-isolated resolving set. The minimum cardinality of non-isolated resolving set of G is called the non-isolated resolving number of G, denoted by nr(G). In this paper, we consider H\\square {P}n that is a graph obtained from Cartesian product between a connected graph H and a path Pn . We determine nr(H\\square {P}n), for some classes of H, including cycles, complete graphs, complete bipartite graphs, and friendship graphs.

Full dyon excitation spectrum in extended Levin-Wen models

NASA Astrophysics Data System (ADS)

Hu, Yuting; Geer, Nathan; Wu, Yong-Shi

2018-05-01

In Levin-Wen (LW) models, a wide class of exactly solvable discrete models, for two-dimensional topological phases, it is relatively easy to describe only single-fluxon excitations, but not the charge and dyonic as well as many-fluxon excitations. To incorporate charged and dyonic excitations in (doubled) topological phases, an extension of the LW models is proposed in this paper. We first enlarge the Hilbert space with adding a tail on one of the edges of each trivalent vertex to describe the internal charge degrees of freedom at the vertex. Then, we study the full dyon spectrum of the extended LW models, including both quantum numbers and wave functions for dyonic quasiparticle excitations. The local operators associated with the dyonic excitations are shown to form the so-called tube algebra, whose representations (modules) form the quantum double (categoric center) of the input data (unitary fusion category). In physically relevant cases, the input data are from a finite or quantum group (with braiding R matrices), and we find that the elementary excitations (or dyon species), as well as any localized/isolated excited states, are characterized by three quantum numbers: charge, fluxon type, and twist. They provide a "complete basis" for many-body states in the enlarged Hilbert space. Concrete examples are presented and the relevance of our results to the electric-magnetic duality existing in the models is addressed.

AGT, N-Burge partitions and {{W}}_N minimal models

NASA Astrophysics Data System (ADS)

Belavin, Vladimir; Foda, Omar; Santachiara, Raoul

2015-10-01

Let {B}_{N,n}^{p,p', H} be a conformal block, with n consecutive channels χ ι , ι = 1, ⋯ n, in the conformal field theory {M}_N^{p,p'× {M}^{H} , where {M}_N^{p,p' } is a {W}_N minimal model, generated by chiral spin-2, ⋯ spin- N currents, and labeled by two co-prime integers p and p', 1 < p < p', while {M}^{H} is a free boson conformal field theory. {B}_{N,n}^{p,p', H} is the expectation value of vertex operators between an initial and a final state. Each vertex operator is labelled by a charge vector that lives in the weight lattice of the Lie algebra A N - 1, spanned by weight vectors {overrightarrow{ω}}_1,\\cdots, {overrightarrow{ω}}_{N-1} . We restrict our attention to conformal blocks with vertex operators whose charge vectors point along {overrightarrow{ω}}_1 . The charge vectors that label the initial and final states can point in any direction.

Reflection states in Ding-Iohara-Miki algebra and brane-web for D-type quiver

NASA Astrophysics Data System (ADS)

Bourgine, J.-E.; Fukuda, M.; Matsuo, Y.; Zhu, R.-D.

2017-12-01

Reflection states are introduced in the vertical and horizontal modules of the Ding-Iohara-Miki (DIM) algebra (quantum toroidal gl_1 ). Webs of DIM representations are in correspondence with ( p, q)-web diagrams of type IIB string theory, under the identification of the algebraic intertwiner of Awata, Feigin and Shiraishi with the refined topological vertex. Extending the correspondence to the vertical reflection states, it is possible to engineer the N=1 quiver gauge theory of D-type (with unitary gauge groups). In this way, the Nekrasov instanton partition function is reproduced from the evaluation of expectation values of intertwiners. This computation leads to the identification of the vertical reflection state with the orientifold plane of string theory. We also provide a translation of this construction in the Iqbal-Kozcaz-Vafa refined topological vertex formalism.

Design and performance of the SLD vertex detector: a 307 Mpixel tracking system

NASA Astrophysics Data System (ADS)

Abe, K.; Arodzero, A.; Baltay, C.; Brau, J. E.; Breidenbach, M.; Burrows, P. N.; Chou, A. S.; Crawford, G.; Damerell, C. J. S.; Dervan, P. J.; Dong, D. N.; Emmet, W.; English, R. L.; Etzion, E.; Foss, M.; Frey, R.; Haller, G.; Hasuko, K.; Hertzbach, S. S.; Hoeflich, J.; Huffer, M. E.; Jackson, D. J.; Jaros, J. A.; Kelsey, J.; Lee, I.; Lia, V.; Lintern, A. L.; Liu, M. X.; Manly, S. L.; Masuda, H.; McKemey, A. K.; Moore, T. B.; Nichols, A.; Nagamine, T.; Oishi, N.; Osborne, L. S.; Russell, J. J.; Ross, D.; Serbo, V. V.; Sinev, N. B.; Sinnott, J.; Skarpaas, K. Viii; Smy, M. B.; Snyder, J. A.; Strauss, M. G.; Dong, S.; Suekane, F.; Taylor, F. E.; Trandafir, A. I.; Usher, T.; Verdier, R.; Watts, S. J.; Weiss, E. R.; Yashima, J.; Yuta, H.; Zapalac, G.

1997-02-01

This paper describes the design, construction, and initial operation of SLD's upgraded vertex detector which comprises 96 two-dimensional charge-coupled devices (CCDs) with a total of 307 Mpixel. Each pixel functions as an independent particle detecting element, providing space point measurements of charged particle tracks with a typical precision of 4 μm in each co-ordinate. The CCDs are arranged in three concentric cylinders just outside the beam-pipe which surrounds the e +e - collision point of the SLAC Linear Collider (SLC). The detector is a powerful tool for distinguishing displaced vertex tracks, produced by decay in flight of heavy flavour hadrons or tau leptons, from tracks produced at the primary event vertex. The requirements for this detector include a very low mass structure (to minimize multiple scattering) both for mechanical support and to provide signal paths for the CCDs; operation at low temperature with a high degree of mechanical stability; and high speed CCD readout, signal processing, and data sparsification. The lessons learned in achieving these goals should be useful for the construction of large arrays of CCDs or active pixel devices in the future in a number of areas of science and technology.

Chern-Simons Term: Theory and Applications.

NASA Astrophysics Data System (ADS)

Gupta, Kumar Sankar

1992-01-01

We investigate the quantization and applications of Chern-Simons theories to several systems of interest. Elementary canonical methods are employed for the quantization of abelian and nonabelian Chern-Simons actions using ideas from gauge theories and quantum gravity. When the spatial slice is a disc, it yields quantum states at the edge of the disc carrying a representation of the Kac-Moody algebra. We next include sources in this model and their quantum states are shown to be those of a conformal family. Vertex operators for both abelian and nonabelian sources are constructed. The regularized abelian Wilson line is proved to be a vertex operator. The spin-statistics theorem is established for Chern-Simons dynamics using purely geometrical techniques. Chern-Simons action is associated with exotic spin and statistics in 2 + 1 dimensions. We study several systems in which the Chern-Simons action affects the spin and statistics. The first class of systems we study consist of G/H models. The solitons of these models are shown to obey anyonic statistics in the presence of a Chern-Simons term. The second system deals with the effect of the Chern -Simons term in a model for high temperature superconductivity. The coefficient of the Chern-Simons term is shown to be quantized, one of its possible values giving fermionic statistics to the solitons of this model. Finally, we study a system of spinning particles interacting with 2 + 1 gravity, the latter being described by an ISO(2,1) Chern-Simons term. An effective action for the particles is obtained by integrating out the gauge fields. Next we construct operators which exchange the particles. They are shown to satisfy the braid relations. There are ambiguities in the quantization of this system which can be exploited to give anyonic statistics to the particles. We also point out that at the level of the first quantized theory, the usual spin-statistics relation need not apply to these particles.

Anomalous U(1) models in four and five dimensions and their anomaly poles

NASA Astrophysics Data System (ADS)

Armillis, Roberta; Corianò, Claudio; Delle Rose, Luigi; Guzzi, Marco

2009-12-01

We analyze the role played by anomaly poles in an anomalous gauge theory by discussing their signature in the corresponding off-shell effective action. The origin of these contributions, in the most general kinematical case, is elucidated by performing a complete analysis of the anomaly vertex at perturbative level. We use two independent (but equivalent) representations: the Rosenberg representation and the longitudinal/transverse (L/T) parameterization, used in recent studies of g-2 of the muon and in the proof of non-renormalization theorems of the anomaly vertex. The poles extracted from the L/T parameterization do not couple in the infrared for generic anomalous vertices, as in Rosenberg, but we show that they are responsible for the violations of unitarity in the UV region, using a class of pole-dominated amplitudes. We conclude that consistent formulations of anomalous models require necessarily the cancellation of these polar contributions. Establishing the UV significance of these terms provides a natural bridge between the anomalous effective action and its completion by a nonlocal theory. Some additional difficulties with unitarity of the mechanism of inflow in extra dimensional models with an anomalous theory on the brane, due to the presence of anomaly poles, are also pointed out.

Charge shielding in the In-situ Storage Image Sensor for a vertex detector at the ILC

NASA Astrophysics Data System (ADS)

Zhang, Z.; Stefanov, K. D.; Bailey, D.; Banda, Y.; Buttar, C.; Cheplakov, A.; Cussans, D.; Damerell, C.; Devetak, E.; Fopma, J.; Foster, B.; Gao, R.; Gillman, A.; Goldstein, J.; Greenshaw, T.; Grimes, M.; Halsall, R.; Harder, K.; Hawes, B.; Hayrapetyan, K.; Heath, H.; Hillert, S.; Jackson, D.; Pinto Jayawardena, T.; Jeffery, B.; John, J.; Johnson, E.; Kundu, N.; Laing, A.; Lastovicka, T.; Lau, W.; Li, Y.; Lintern, A.; Lynch, C.; Mandry, S.; Martin, V.; Murray, P.; Nichols, A.; Nomerotski, A.; Page, R.; Parkes, C.; Perry, C.; O'Shea, V.; Sopczak, A.; Tabassam, H.; Thomas, S.; Tikkanen, T.; Velthuis, J.; Walsh, R.; Woolliscroft, T.; Worm, S.

2009-08-01

The Linear Collider Flavour Identification (LCFI) collaboration has successfully developed the first prototype of a novel particle detector, the In-situ Storage Image Sensor (ISIS). This device ideally suits the challenging requirements for the vertex detector at the future International Linear Collider (ILC), combining the charge storing capabilities of the Charge-Coupled Devices (CCD) with readout commonly used in CMOS imagers. The ISIS avoids the need for high-speed readout and offers low power operation combined with low noise, high immunity to electromagnetic interference and increased radiation hardness compared to typical CCDs. The ISIS is one of the most promising detector technologies for vertexing at the ILC. In this paper we describe the measurements on the charge-shielding properties of the p-well, which is used to protect the storage register from parasitic charge collection and is at the core of device's operation. We show that the p-well can suppress the parasitic charge collection by almost two orders of magnitude, satisfying the requirements for the application.

Low-mass materials and vertex detector systems

DOE PAGES

Cooper, William E.

2014-01-01

Physics requirements set the material budget and the precision and stability necessary in low-mass vertex detector systems. Operational considerations, along with physics requirements, set the operating environment to be provided and determine the heat to be removed. Representative materials for fulfilling those requirements are described and properties of the materials are tabulated. A figure of merit is proposed to aid in material selection. Multi-layer structures are examined as a method to allow material to be used effectively, thereby reducing material contributions. Lastly, comments are made on future directions to be considered in using present materials effectively and in developing newmore » materials.« less

Multi-Scale Distributed Representation for Deep Learning and its Application to b-Jet Tagging

NASA Astrophysics Data System (ADS)

Lee, Jason Sang Hun; Park, Inkyu; Park, Sangnam

2018-06-01

Recently machine learning algorithms based on deep layered artificial neural networks (DNNs) have been applied to a wide variety of high energy physics problems such as jet tagging or event classification. We explore a simple but effective preprocessing step which transforms each realvalued observational quantity or input feature into a binary number with a fixed number of digits. Each binary digit represents the quantity or magnitude in different scales. We have shown that this approach improves the performance of DNNs significantly for some specific tasks without any further complication in feature engineering. We apply this multi-scale distributed binary representation to deep learning on b-jet tagging using daughter particles' momenta and vertex information.

Individual subject classification for Alzheimer's disease based on incremental learning using a spatial frequency representation of cortical thickness data.

PubMed

Cho, Youngsang; Seong, Joon-Kyung; Jeong, Yong; Shin, Sung Yong

2012-02-01

Patterns of brain atrophy measured by magnetic resonance structural imaging have been utilized as significant biomarkers for diagnosis of Alzheimer's disease (AD). However, brain atrophy is variable across patients and is non-specific for AD in general. Thus, automatic methods for AD classification require a large number of structural data due to complex and variable patterns of brain atrophy. In this paper, we propose an incremental method for AD classification using cortical thickness data. We represent the cortical thickness data of a subject in terms of their spatial frequency components, employing the manifold harmonic transform. The basis functions for this transform are obtained from the eigenfunctions of the Laplace-Beltrami operator, which are dependent only on the geometry of a cortical surface but not on the cortical thickness defined on it. This facilitates individual subject classification based on incremental learning. In general, methods based on region-wise features poorly reflect the detailed spatial variation of cortical thickness, and those based on vertex-wise features are sensitive to noise. Adopting a vertex-wise cortical thickness representation, our method can still achieve robustness to noise by filtering out high frequency components of the cortical thickness data while reflecting their spatial variation. This compromise leads to high accuracy in AD classification. We utilized MR volumes provided by Alzheimer's Disease Neuroimaging Initiative (ADNI) to validate the performance of the method. Our method discriminated AD patients from Healthy Control (HC) subjects with 82% sensitivity and 93% specificity. It also discriminated Mild Cognitive Impairment (MCI) patients, who converted to AD within 18 months, from non-converted MCI subjects with 63% sensitivity and 76% specificity. Moreover, it showed that the entorhinal cortex was the most discriminative region for classification, which is consistent with previous pathological findings. In comparison with other classification methods, our method demonstrated high classification performance in both categories, which supports the discriminative power of our method in both AD diagnosis and AD prediction. Copyright © 2011 Elsevier Inc. All rights reserved.

Progressive simplification and transmission of building polygons based on triangle meshes

NASA Astrophysics Data System (ADS)

Li, Hongsheng; Wang, Yingjie; Guo, Qingsheng; Han, Jiafu

2010-11-01

Digital earth is a virtual representation of our planet and a data integration platform which aims at harnessing multisource, multi-resolution, multi-format spatial data. This paper introduces a research framework integrating progressive cartographic generalization and transmission of vector data. The progressive cartographic generalization provides multiple resolution data from coarse to fine as key scales and increments between them which is not available in traditional generalization framework. Based on the progressive simplification algorithm, the building polygons are triangulated into meshes and encoded according to the simplification sequence of two basic operations, edge collapse and vertex split. The map data at key scales and encoded increments between them are stored in a multi-resolution file. As the client submits requests to the server, the coarsest map is transmitted first and then the increments. After data decoding and mesh refinement the building polygons with more details will be visualized. Progressive generalization and transmission of building polygons is demonstrated in the paper.

A solution to coupled Dyson-Schwinger equations for gluons and ghosts in Landau gauge.

DOE Office of Scientific and Technical Information (OSTI.GOV)

von Smekal, L.; Alkofer, R.; Hauck, A.

1998-07-20

A truncation scheme for the Dyson-Schwinger equations of QCD in Landau gauge is presented which implements the Slavnov-Taylor identities for the 3-point vertex functions. Neglecting contributions from 4-point correlations such as the 4-gluon vertex function and irreducible scattering kernels, a closed system of equations for the propagators is obtained. For the pure gauge theory without quarks this system of equations for the propagators of gluons and ghosts is solved in an approximation which allows for an analytic discussion of its solutions in the infrared: The gluon propagator is shown to vanish for small spacelike momenta whereas the ghost propagator ismore » found to be infrared enhanced. The running coupling of the non-perturbative subtraction scheme approaches an infrared stable fixed point at a critical value of the coupling alpha c of approx. 9.5. The gluon propagator is shown to have no Lehmann representation. The results for the propagators obtained here compare favorably with recent lattice calculations.« less

Representations of the quantum doubles of finite group algebras and spectral parameter dependent solutions of the Yang-Baxter equation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dancer, K. A.; Isac, P. S.; Links, J.

2006-10-15

Quantum doubles of finite group algebras form a class of quasitriangular Hopf algebras that algebraically solve the Yang-Baxter equation. Each representation of the quantum double then gives a matrix solution of the Yang-Baxter equation. Such solutions do not depend on a spectral parameter, and to date there has been little investigation into extending these solutions such that they do depend on a spectral parameter. Here we first explicitly construct the matrix elements of the generators for all irreducible representations of quantum doubles of the dihedral groups D{sub n}. These results may be used to determine constant solutions of the Yang-Baxtermore » equation. We then discuss Baxterization ansaetze to obtain solutions of the Yang-Baxter equation with a spectral parameter and give several examples, including a new 21-vertex model. We also describe this approach in terms of minimal-dimensional representations of the quantum doubles of the alternating group A{sub 4} and the symmetric group S{sub 4}.« less

Comparative analysis of hierarchical triangulated irregular networks to represent 3D elevation in terrain databases

NASA Astrophysics Data System (ADS)

Abdelguerfi, Mahdi; Wynne, Chris; Cooper, Edgar; Ladner, Roy V.; Shaw, Kevin B.

1997-08-01

Three-dimensional terrain representation plays an important role in a number of terrain database applications. Hierarchical triangulated irregular networks (TINs) provide a variable-resolution terrain representation that is based on a nested triangulation of the terrain. This paper compares and analyzes existing hierarchical triangulation techniques. The comparative analysis takes into account how aesthetically appealing and accurate the resulting terrain representation is. Parameters, such as adjacency, slivers, and streaks, are used to provide a measure on how aesthetically appealing the terrain representation is. Slivers occur when the triangulation produces thin and slivery triangles. Streaks appear when there are too many triangulations done at a given vertex. Simple mathematical expressions are derived for these parameters, thereby providing a fairer and a more easily duplicated comparison. In addition to meeting the adjacency requirement, an aesthetically pleasant hierarchical TINs generation algorithm is expected to reduce both slivers and streaks while maintaining accuracy. A comparative analysis of a number of existing approaches shows that a variant of a method originally proposed by Scarlatos exhibits better overall performance.

Boundary perimeter Bethe ansatz

NASA Astrophysics Data System (ADS)

Frassek, Rouven

2017-06-01

We study the partition function of the six-vertex model in the rational limit on arbitrary Baxter lattices with reflecting boundary. Every such lattice is interpreted as an invariant of the twisted Yangian. This identification allows us to relate the partition function of the vertex model to the Bethe wave function of an open spin chain. We obtain the partition function in terms of creation operators on a reference state from the algebraic Bethe ansatz and as a sum of permutations and reflections from the coordinate Bethe ansatz.

A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation.

PubMed

Wang, Zhaocai; Huang, Dongmei; Meng, Huajun; Tang, Chengpei

2013-10-01

The minimum spanning tree (MST) problem is to find minimum edge connected subsets containing all the vertex of a given undirected graph. It is a vitally important NP-complete problem in graph theory and applied mathematics, having numerous real life applications. Moreover in previous studies, DNA molecular operations usually were used to solve NP-complete head-to-tail path search problems, rarely for NP-hard problems with multi-lateral path solutions result, such as the minimum spanning tree problem. In this paper, we present a new fast DNA algorithm for solving the MST problem using DNA molecular operations. For an undirected graph with n vertex and m edges, we reasonably design flexible length DNA strands representing the vertex and edges, take appropriate steps and get the solutions of the MST problem in proper length range and O(3m+n) time complexity. We extend the application of DNA molecular operations and simultaneity simplify the complexity of the computation. Results of computer simulative experiments show that the proposed method updates some of the best known values with very short time and that the proposed method provides a better performance with solution accuracy over existing algorithms. Copyright © 2013 The Authors. Published by Elsevier Ireland Ltd.. All rights reserved.

On the star partition dimension of comb product of cycle and complete graph

NASA Astrophysics Data System (ADS)

Alfarisi, Ridho; Darmaji; Dafik

2017-06-01

Let G = (V, E) be a connected graphs with vertex set V (G), edge set E(G) and S ⊆ V (G). For an ordered partition Π = {S 1, S 2, S 3, …, Sk } of V (G), the representation of a vertex v ∈ V (G) with respect to Π is the k-vectors r(v|Π) = (d(v, S 1), d(v, S 2), …, d(v, Sk )), where d(v, Sk ) represents the distance between the vertex v and the set Sk , defined by d(v, Sk ) = min{d(v, x)|x ∈ Sk}. The partition Π of V (G) is a resolving partition if the k-vektors r(v|Π), v ∈ V (G) are distinct. The minimum resolving partition Π is a partition dimension of G, denoted by pd(G). The resolving partition Π = {S 1, S 2, S 3, …, Sk} is called a star resolving partition for G if it is a resolving partition and each subgraph induced by Si , 1 ≤ i ≤ k, is a star. The minimum k for which there exists a star resolving partition of V (G) is the star partition dimension of G, denoted by spd(G). Finding a star partition dimension of G is classified to be a NP-Hard problem. Furthermore, the comb product between G and H, denoted by G ⊲ H, is a graph obtained by taking one copy of G and |V (G)| copies of H and grafting the i-th copy of H at the vertex o to the i-th vertex of G. By definition of comb product, we can say that V (G ⊲ H) = {(a, u)|a ∈ V (G), u ∈ V (H)} and (a, u)(b, v) ∈ E(G ⊲ H) whenever a = b and uv ∈ E(H), or ab ∈ E(G) and u = v = o. In this paper, we will study the star partition dimension of comb product of cycle and complete graph, namely Cn ⊲ Km and Km ⊲ Cn for n ≥ 3 and m ≥ 3.

The WZNW model on PSU(1,1|2)

NASA Astrophysics Data System (ADS)

Götz, Gerhard; Quella, Thomas; Schomerus, Volker

2007-03-01

According to the work of Berkovits, Vafa and Witten, the non-linear sigma model on the supergroup PSU(1,1|2) is the essential building block for string theory on AdS3 × S3 × T4. Models associated with a non-vanishing value of the RR flux can be obtained through a psu(1,1|2) invariant marginal deformation of the WZNW model on PSU(1,1|2). We take this as a motivation to present a manifestly psu(1,1|2) covariant construction of the model at the Wess-Zumino point, corresponding to a purely NSNS background 3-form flux. At this point the model possesses an enhanced psu with wide hat(1,1|2) current algebra symmetry whose representation theory, including explicit character formulas, is developed systematically in the first part of the paper. The space of vertex operators and a free fermion representation for their correlation functions is our main subject in the second part. Contrary to a widespread claim, bosonic and fermionic fields are necessarily coupled to each other. The interaction changes the supersymmetry transformations, with drastic consequences for the multiplets of localized normalizable states in the model. It is only this fact which allows us to decompose the full state space into multiplets of the global supersymmetry. We analyze these decompositions systematically as a preparation for a forthcoming study of the RR deformation.

An admissible level \\widehat{osp} ( 1 \\big \\vert 2 ) -model: modular transformations and the Verlinde formula

NASA Astrophysics Data System (ADS)

Snadden, John; Ridout, David; Wood, Simon

2018-05-01

The modular properties of the simple vertex operator superalgebra associated with the affine Kac-Moody superalgebra \\widehat{{osp}} (1|2) at level -5/4 are investigated. After classifying the relaxed highest-weight modules over this vertex operator superalgebra, the characters and supercharacters of the simple weight modules are computed and their modular transforms are determined. This leads to a complete list of the Grothendieck fusion rules by way of a continuous superalgebraic analog of the Verlinde formula. All Grothendieck fusion coefficients are observed to be non-negative integers. These results indicate that the extension to general admissible levels will follow using the same methodology once the classification of relaxed highest-weight modules is completed.

Amplitudes on plane waves from ambitwistor strings

NASA Astrophysics Data System (ADS)

Adamo, Tim; Casali, Eduardo; Mason, Lionel; Nekovar, Stefan

2017-11-01

In marked contrast to conventional string theory, ambitwistor strings remain solvable worldsheet theories when coupled to curved background fields. We use this fact to consider the quantization of ambitwistor strings on plane wave metric and plane wave gauge field backgrounds. In each case, the worldsheet model is anomaly free as a consequence of the background satisfying the field equations. We derive vertex operators (in both fixed and descended picture numbers) for gravitons and gluons on these backgrounds from the worldsheet CFT, and study the 3-point functions of these vertex operators on the Riemann sphere. These worldsheet correlation functions reproduce the known results for 3-point scattering amplitudes of gravitons and gluons in gravitational and gauge theoretic plane wave backgrounds, respectively.

The SLD VXD3 detector and its initial performance

NASA Astrophysics Data System (ADS)

Abe, K.; Arodzero, A.; Baltay, C.; Brau, J.; Breidenbach, M.; Burrows, P. N.; Chou, A.; Crawford, G.; Damerell, C.; Dervan, P.; Dong, D.; Emmet, W.; English, R.; Etzion, E.; Foss, M.; Frey, R.; Haller, G.; Hasuko, K.; Hertzbach, S.; Hoeflich, J.; Huber, J.; Huffer, M.; Jackson, D.; Jaros, J.; Kelsy, J.; Kendall, H.; Lee, I.; Lia, V.; Lintern, L.; Liu, M.; Manly, S.; Masuda, H.; Moore, T.; Nagamine, T.; Ohishi, N.; Osborne, L.; Ross, D.; Russell, J.; Serbo, V.; Sinev, N.; Sinnott, J.; Skarpaas, K. Viii; Smy, M.; Snyder, J.; Strauss, M.; Dong, S.; Suekane, F.; Taylor, F.; Trandafir, A.; Usher, T.; Verdier, R.; Watts, S.; Weiss, E.; Yashima, J.; Yuta, H.; Zapalac, G.

1997-02-01

The SLD collaboration completed construction of a new CCD vertex detector (VXD3) in January 1996 and started data taking in April 1996 with the new system. VXD3 is an upgrade of the original CCD vertex detector, VXD2, which had successfully operated in SLD for three years. VXD3 consists of 96 large area CCDs, each having 3.2 million 20 μm × 20 μm pixels. By reducing the detector material and lengthening the lever arm, VXD3 is expected to improve secondary vertex resolution by about a factor of two compared with VXD2. The new three-layered structure enables stand-alone tracking without any ambiguity and its extended size along the beam direction improves the polar-angle coverage to |cos θ| < 0.85. An overview of this detector system and its initial performance are described.

Lattice Virasoro algebra and corner transfer matrices in the Baxter eight-vertex model

DOE Office of Scientific and Technical Information (OSTI.GOV)

Itoyama, H.; Thacker, H.B.

1987-04-06

A lattice Virasoro algebra is constructed for the Baxter eight-vertex model. The operator L/sub 0/ is obtained from the logarithm of the corner transfer matrix and is given by the first moment of the XYZ spin-chain Hamiltonian. The algebra is valid even when the Hamiltonian includes a mass term, in which case it represents lattice coordinate transformations which distinguish between even and odd sublattices. We apply the quantum inverse scattering method to demonstrate that the Virasoro algebra follows from the Yang-Baxter relations.

The Thinnest Path Problem

DTIC Science & Technology

2013-10-01

of vertices located within the d-dimensional sphere centered at vi 1In [3], it is referred to as the forward hyperarcs. 3 replacements Fig. 1: (a...kr ← kr + 1 · Set the parent of vkr+1 to v ∗ While v can reach vkl−1 · Enqueue vkl−1 and kl ← kl − 1 · Set the parent of vkl−1 to v 3. If the Queue... parent of this vertex on this path. This allows us to take the set union operation when we update the neighbors of this vertex. Given below is the

Intrinsic non-commutativity of closed string theory

DOE PAGES

Freidel, Laurent; Leigh, Robert G.; Minic, Djordje

2017-09-14

We show that the proper interpretation of the cocycle operators appearing in the physical vertex operators of compactified strings is that the closed string target is noncommutative. We track down the appearance of this non-commutativity to the Polyakov action of the at closed string in the presence of translational monodromies (i.e., windings). Here, in view of the unexpected nature of this result, we present detailed calculations from a variety of points of view, including a careful understanding of the consequences of mutual locality in the vertex operator algebra, as well as a detailed analysis of the symplectic structure of themore » Polyakov string. Finally, we also underscore why this non-commutativity was not emphasized previously in the existing literature. This non-commutativity can be thought of as a central extension of the zero-mode operator algebra, an effect set by the string length scale $-$ it is present even in trivial backgrounds. Clearly, this result indicates that the α'→0 limit is more subtle than usually assumed.« less

Intrinsic non-commutativity of closed string theory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Freidel, Laurent; Leigh, Robert G.; Minic, Djordje

We show that the proper interpretation of the cocycle operators appearing in the physical vertex operators of compactified strings is that the closed string target is noncommutative. We track down the appearance of this non-commutativity to the Polyakov action of the at closed string in the presence of translational monodromies (i.e., windings). Here, in view of the unexpected nature of this result, we present detailed calculations from a variety of points of view, including a careful understanding of the consequences of mutual locality in the vertex operator algebra, as well as a detailed analysis of the symplectic structure of themore » Polyakov string. Finally, we also underscore why this non-commutativity was not emphasized previously in the existing literature. This non-commutativity can be thought of as a central extension of the zero-mode operator algebra, an effect set by the string length scale $-$ it is present even in trivial backgrounds. Clearly, this result indicates that the α'→0 limit is more subtle than usually assumed.« less

Quantum Markov chains

NASA Astrophysics Data System (ADS)

Gudder, Stanley

2008-07-01

A new approach to quantum Markov chains is presented. We first define a transition operation matrix (TOM) as a matrix whose entries are completely positive maps whose column sums form a quantum operation. A quantum Markov chain is defined to be a pair (G,E) where G is a directed graph and E =[Eij] is a TOM whose entry Eij labels the edge from vertex j to vertex i. We think of the vertices of G as sites that a quantum system can occupy and Eij is the transition operation from site j to site i in one time step. The discrete dynamics of the system is obtained by iterating the TOM E. We next consider a special type of TOM called a transition effect matrix. In this case, there are two types of dynamics, a state dynamics and an operator dynamics. Although these two types are not identical, they are statistically equivalent. We next give examples that illustrate various properties of quantum Markov chains. We conclude by showing that our formalism generalizes the usual framework for quantum random walks.

Grouper: A Compact, Streamable Triangle Mesh Data Structure.

PubMed

Luffel, Mark; Gurung, Topraj; Lindstrom, Peter; Rossignac, Jarek

2013-05-08

We present Grouper: an all-in-one compact file format, random-access data structure, and streamable representation for large triangle meshes. Similarly to the recently published SQuad representation, Grouper represents the geometry and connectivity of a mesh by grouping vertices and triangles into fixed-size records, most of which store two adjacent triangles and a shared vertex. Unlike SQuad, however, Grouper interleaves geometry with connectivity and uses a new connectivity representation to ensure that vertices and triangles can be stored in a coherent order that enables memory-efficient sequential stream processing. We present a linear-time construction algorithm that allows streaming out Grouper meshes using a small memory footprint while preserving the initial ordering of vertices. As part of this construction, we show how the problem of assigning vertices and triangles to groups reduces to a well-known NP-hard optimization problem, and present a simple yet effective heuristic solution that performs well in practice. Our array-based Grouper representation also doubles as a triangle mesh data structure that allows direct access to vertices and triangles. Storing only about two integer references per triangle, Grouper answers both incidence and adjacency queries in amortized constant time. Our compact representation enables data-parallel processing on multicore computers, instant partitioning and fast transmission for distributed processing, as well as efficient out-of-core access.

A variable resolution right TIN approach for gridded oceanographic data

NASA Astrophysics Data System (ADS)

Marks, David; Elmore, Paul; Blain, Cheryl Ann; Bourgeois, Brian; Petry, Frederick; Ferrini, Vicki

2017-12-01

Many oceanographic applications require multi resolution representation of gridded data such as for bathymetric data. Although triangular irregular networks (TINs) allow for variable resolution, they do not provide a gridded structure. Right TINs (RTINs) are compatible with a gridded structure. We explored the use of two approaches for RTINs termed top-down and bottom-up implementations. We illustrate why the latter is most appropriate for gridded data and describe for this technique how the data can be thinned. While both the top-down and bottom-up approaches accurately preserve the surface morphology of any given region, the top-down method of vertex placement can fail to match the actual vertex locations of the underlying grid in many instances, resulting in obscured topology/bathymetry. Finally we describe the use of the bottom-up approach and data thinning in two applications. The first is to provide thinned, variable resolution bathymetry data for tests of storm surge and inundation modeling, in particular hurricane Katrina. Secondly we consider the use of the approach for an application to an oceanographic data grid of 3-D ocean temperature.

A solution to coupled Dyson{endash}Schwinger equations for gluons and ghosts in Landau gauge

DOE Office of Scientific and Technical Information (OSTI.GOV)

von Smekal, L.; Hauck, A.; Alkofer, R.

1998-07-01

A truncation scheme for the Dyson{endash}Schwinger equations of QCD in Landau gauge is presented which implements the Slavnov{endash}Taylor identities for the 3-point vertex functions. Neglecting contributions from 4-point correlations such as the 4-gluon vertex function and irreducible scattering kernels, a closed system of equations for the propagators is obtained. For the pure gauge theory without quarks this system of equations for the propagators of gluons and ghosts is solved in an approximation which allows for an analytic discussion of its solutions in the infrared: The gluon propagator is shown to vanish for small spacelike momenta whereas the ghost propagator ismore » found to be infrared enhanced. The running coupling of the non-perturbative subtraction scheme approaches an infrared stable fixed point at a critical value of the coupling, {alpha}{sub c}{approx_equal}9.5. The gluon propagator is shown to have no Lehmann representation. The results for the propagators obtained here compare favorably with recent lattice calculations. {copyright} 1998 Academic Press, Inc.« less

The 't Hooft vertex for staggered fermions and flavor-singlet mesons

DOE Office of Scientific and Technical Information (OSTI.GOV)

Donald, Gordon C.; Davies, Christine T.H.; Follana, Eduardo

2011-01-01

We derive the ’t Hooft vertex for staggered fermions and examine its symmetries for nonzero lattice spacing. We also derive a set of structural properties for the eigenvectors of the staggered Dirac operator, which should emerge in the continuum limit, if staggered fermions yield four species. This property also is needed for flavor-taste-singlet correlators to behave correctly. We then test numerically whether the needed structure arises: it does. This structure and symmetry of (unrooted) staggered fermions also imply that Creutz’s (latest) objections to the rooted determinant are without foundation.

Some trees with partition dimension three

NASA Astrophysics Data System (ADS)

Fredlina, Ketut Queena; Baskoro, Edy Tri

2016-02-01

The concept of partition dimension of a graph was introduced by Chartrand, E. Salehi and P. Zhang (1998) [2]. Let G(V, E) be a connected graph. For S ⊆ V (G) and v ∈ V (G), define the distance d(v, S) from v to S is min{d(v, x)|x ∈ S}. Let Π be an ordered partition of V (G) and Π = {S1, S2, ..., Sk }. The representation r(v|Π) of vertex v with respect to Π is (d(v, S1), d(v, S2), ..., d(v, Sk)). If the representations of all vertices are distinct, then the partition Π is called a resolving partition of G. The partition dimension of G is the minimum k such that G has a resolving partition with k partition classes. In this paper, we characterize some classes of trees with partition dimension three, namely olive trees, weeds, and centipedes.

Quantum Vertex Model for Reversible Classical Computing

NASA Astrophysics Data System (ADS)

Chamon, Claudio; Mucciolo, Eduardo; Ruckenstein, Andrei; Yang, Zhicheng

We present a planar vertex model that encodes the result of a universal reversible classical computation in its ground state. The approach involves Boolean variables (spins) placed on links of a two-dimensional lattice, with vertices representing logic gates. Large short-ranged interactions between at most two spins implement the operation of each gate. The lattice is anisotropic with one direction corresponding to computational time, and with transverse boundaries storing the computation's input and output. The model displays no finite temperature phase transitions, including no glass transitions, independent of circuit. The computational complexity is encoded in the scaling of the relaxation rate into the ground state with the system size. We use thermal annealing and a novel and more efficient heuristic \\x9Dannealing with learning to study various computational problems. To explore faster relaxation routes, we construct an explicit mapping of the vertex model into the Chimera architecture of the D-Wave machine, initiating a novel approach to reversible classical computation based on quantum annealing.

DEPFET detectors for future electron-positron colliders

NASA Astrophysics Data System (ADS)

Marinas, C.

2015-11-01

The DEPFET Collaboration develops highly granular, ultra-thin pixel detectors for outstanding vertex reconstruction at future electron-positron collider experiments. A DEPFET sensor, by the integration of a field effect transistor on a fully depleted silicon bulk, provides simultaneous position sensitive detector capabilities and in pixel amplification. The characterization of the latest DEPFET prototypes has proven that a adequate signal-to-noise ratio and excellent single point resolution can be achieved for a sensor thickness of 50 micrometers. The close to final auxiliary ASICs have been produced and found to operate a DEPFET pixel detector of the latest generation with the required read-out speed. A complete detector concept is being developed for the Belle II experiment at the new Japanese super flavor factory. DEPFET is not only the technology of choice for the Belle II vertex detector, but also a prime candidate for the ILC. Therefore, in this contribution, the status of DEPFET R&D project is reviewed in the light of the requirements of the vertex detector at a future electron-positron collider.

A note on closed-string interactions a la witten

NASA Astrophysics Data System (ADS)

Romans, L. J.

1987-08-01

We consider the problem of formulating a field theory of interacting closed strings analogous to Witten's open-string field theory. Two natural candidates have been suggested for an off-shell three-string interaction vertex: one scheme involves a cyclic geometric overlap in spacetime, while the other is obtained by ``stuttering'' the Fock-space realization of the open-string vertex. We demonstrate that these two approaches are in fact equivalent, utilizing the operator formalism as developed to describe Witten's theory. Implications of this result for the construction of closed-string theories are briefly discussed. Address after August 1, 1987: Department of Physics, University of Southern California, Los Angeles, CA 90089, USA.

Tree-level disk amplitude of three closed strings

NASA Astrophysics Data System (ADS)

Mousavi, Sepideh; Velni, Komeil Babaei

2018-05-01

It has been shown that the disk-level S-matrix elements of one Ramond-Ramond (RR) and two Neveu-Schwarz-Neveu-Schwarz (NSNS) states could be found by applying the Ward identity associated with the string duality and the gauge symmetry on a given component of the S matrix. These amplitudes have appeared as the components of six different T-dual multiplets. It is predicted in the literature that there are some nonzero disk-level scattering amplitudes, such as one RR (p -1 ) form with zero transverse index and two N S N S states, could not be captured by the T-dual Ward identity. We explicitly find this amplitude in terms of a minimal context of the integral functions by the insertion of one closed string RR vertex operator and two NSNS vertex operators. From the amplitude invariance under the Ward identity associated with the NSNS gauge transformations and T-duality, we also find some integral identities.

Ventral-stream-like shape representation: from pixel intensity values to trainable object-selective COSFIRE models

PubMed Central

Azzopardi, George; Petkov, Nicolai

2014-01-01

The remarkable abilities of the primate visual system have inspired the construction of computational models of some visual neurons. We propose a trainable hierarchical object recognition model, which we call S-COSFIRE (S stands for Shape and COSFIRE stands for Combination Of Shifted FIlter REsponses) and use it to localize and recognize objects of interests embedded in complex scenes. It is inspired by the visual processing in the ventral stream (V1/V2 → V4 → TEO). Recognition and localization of objects embedded in complex scenes is important for many computer vision applications. Most existing methods require prior segmentation of the objects from the background which on its turn requires recognition. An S-COSFIRE filter is automatically configured to be selective for an arrangement of contour-based features that belong to a prototype shape specified by an example. The configuration comprises selecting relevant vertex detectors and determining certain blur and shift parameters. The response is computed as the weighted geometric mean of the blurred and shifted responses of the selected vertex detectors. S-COSFIRE filters share similar properties with some neurons in inferotemporal cortex, which provided inspiration for this work. We demonstrate the effectiveness of S-COSFIRE filters in two applications: letter and keyword spotting in handwritten manuscripts and object spotting in complex scenes for the computer vision system of a domestic robot. S-COSFIRE filters are effective to recognize and localize (deformable) objects in images of complex scenes without requiring prior segmentation. They are versatile trainable shape detectors, conceptually simple and easy to implement. The presented hierarchical shape representation contributes to a better understanding of the brain and to more robust computer vision algorithms. PMID:25126068

Directionality of real world networks as predicted by path length in directed and undirected graphs

NASA Astrophysics Data System (ADS)

Rosen, Yonatan; Louzoun, Yoram

2014-05-01

Many real world networks either support ordered processes, or are actually representations of such processes. However, the same networks contain large strong connectivity components and long circles, which hide a possible inherent order, since each vertex can be reached from each vertex in a directed path. Thus, the presence of an inherent directionality in networks may be hidden. We here discuss a possible definition of such a directionality and propose a method to detect it. Several common algorithms, such as the betweenness centrality or the degree, measure various aspects of centrality in networks. However, they do not address directly the issue of inherent directionality. The goal of the algorithm discussed here is the detection of global directionality in directed networks. Such an algorithm is essential to detangle complex networks into ordered process. We show that indeed the vast majority of measured real world networks have a clear directionality. Moreover, this directionality can be used to classify vertices in these networks from sources to sinks. Such an algorithm can be highly useful in order to extract a meaning from large interaction networks assembled in many domains.

Local metric dimension of circulant graph c i r c (n :1 ,2 ,…,n/+1 2 )

NASA Astrophysics Data System (ADS)

Rimadhany, Ruzika; Darmaji

2017-08-01

Let G be a connected graph with two vertices u and v. The distance between u and v, denoted by d(u, v), is defined as length of the shortest path from u to v in G. For an ordered set W = {w1, w2, w3, … , wk} of k distinct vertices in a nontrivial connected graph G, the representation of a vertex v of V(G) respect to W is r(v|W) = (d(v, w1), d(v, w2), … , d(v, wk)). The set W is a resolving set of G if r(v|W) for each vertex v ∈ V(G) is distinct. A resolving set of minimum cardinality is a metric dimension and denoted by dim(G). The set W is a local resolving set of G if r(v|W) for every two adjacent vertices of V(G) is distinct. The minimum cardinality of local resolving set of G is a local metric dimension and denoted by ldim(G). In this research, we determine local metric dimension of circulant graph c i r c (n :1 ,2 ,3 ,…,n/+1 2 ) .

Planning the mode of delivery for twin pregnancies: A web-based questionnaire.

PubMed

Goossens, S M T A; Roumen, F J M E; Derks, J B; Kessels, F G; Dirksen, C D; Nijhuis, J G

2016-01-01

Using orthogonal design, we created a questionnaire containing 16 cases of twin pregnancies. For each case, respondents indicated whether they would plan a vaginal delivery (VD) or a caesarean section (CS). We assessed the association between each variable (maternal age, parity, mode of conception, gestational age, chorionicity, body mass index, foetal growth, foetal presentation and wish for additional children) and the planned mode of delivery. A VD was planned mostly for vertex presentation of twin A (vertex-vertex vs. non-vertex-vertex, odds ratio [OR]: 0.002, 95% confidence interval [CI]: 0.001-0.003, p < 0.001). For vertex- non-vertex (vs. vertex-vertex) presentation, chances on planning a VD decreased threefold (OR: 0.29, 95% CI: 0.018-0.46, p < 0.001), although the majority of respondents would still plan a VD. In multiparous (vs. nulliparous) women, VD was chosen more often (OR: 3.24, 95% CI: 2.50-4.18, p < 0.001).Vertex presentation of twin A and multiparity were the main reasons for planning a VD.

Silicon pixel-detector R&D for CLIC

NASA Astrophysics Data System (ADS)

Nürnberg, A.

2016-11-01

The physics aims at the future CLIC high-energy linear e+e- collider set very high precision requirements on the performance of the vertex and tracking detectors. Moreover, these detectors have to be well adapted to the experimental conditions, such as the time structure of the collisions and the presence of beam-induced backgrounds. The principal challenges are: a point resolution of a few μm, ultra-low mass (~ 0.2%X0 per layer for the vertex region and ~ 1%X0 per layer for the outer tracker), very low power dissipation (compatible with air-flow cooling in the inner vertex region) and pulsed power operation, complemented with ~ 10 ns time stamping capabilities. A highly granular all-silicon vertex and tracking detector system is under development, following an integrated approach addressing simultaneously the physics requirements and engineering constraints. For the vertex-detector region, hybrid pixel detectors with small pitch (25 μm) and analog readout are explored. For the outer tracking region, both hybrid concepts and fully integrated CMOS sensors are under consideration. The feasibility of ultra-thin sensor layers is validated with Timepix3 readout ASICs bump bonded to active edge planar sensors with 50 μm to 150 μm thickness. Prototypes of CLICpix readout ASICs implemented in 6525 nm CMOS technology with 25 μm pixel pitch have been produced. Hybridisation concepts have been developed for interconnecting these chips either through capacitive coupling to active HV-CMOS sensors or through bump-bonding to planar sensors. Recent R&D achievements include results from beam tests with all types of hybrid assemblies. Simulations based on Geant4 and TCAD are used to validate the experimental results and to assess and optimise the performance of various detector designs.

A z-Vertex Trigger for Belle II

NASA Astrophysics Data System (ADS)

Skambraks, S.; Abudinén, F.; Chen, Y.; Feindt, M.; Frühwirth, R.; Heck, M.; Kiesling, C.; Knoll, A.; Neuhaus, S.; Paul, S.; Schieck, J.

2015-08-01

The Belle II experiment will go into operation at the upgraded SuperKEKB collider in 2016. SuperKEKB is designed to deliver an instantaneous luminosity L = 8 ×1035 cm - 2 s - 1. The experiment will therefore have to cope with a much larger machine background than its predecessor Belle, in particular from events outside of the interaction region. We present the concept of a track trigger, based on a neural network approach, that is able to suppress a large fraction of this background by reconstructing the z (longitudinal) position of the event vertex within the latency of the first level trigger. The trigger uses the hit information from the Central Drift Chamber (CDC) of Belle II within narrow cones in polar and azimuthal angle as well as in transverse momentum (“sectors”), and estimates the z-vertex without explicit track reconstruction. The preprocessing for the track trigger is based on the track information provided by the standard CDC trigger. It takes input from the 2D track finder, adds information from the stereo wires of the CDC, and finds the appropriate sectors in the CDC for each track. Within the sector, the z-vertex is estimated by a specialized neural network, with the drift times from the CDC as input and a continuous output corresponding to the scaled z-vertex. The neural algorithm will be implemented in programmable hardware. To this end a Virtex 7 FPGA board will be used, which provides at present the most promising solution for a fully parallelized implementation of neural networks or alternative multivariate methods. A high speed interface for external memory will be integrated into the platform, to be able to store the O(109) parameters required. The contribution presents the results of our feasibility studies and discusses the details of the envisaged hardware solution.

Improved quantum backtracking algorithms using effective resistance estimates

NASA Astrophysics Data System (ADS)

Jarret, Michael; Wan, Kianna

2018-02-01

We investigate quantum backtracking algorithms of the type introduced by Montanaro (Montanaro, arXiv:1509.02374). These algorithms explore trees of unknown structure and in certain settings exponentially outperform their classical counterparts. Some of the previous work focused on obtaining a quantum advantage for trees in which a unique marked vertex is promised to exist. We remove this restriction by recharacterizing the problem in terms of the effective resistance of the search space. In this paper, we present a generalization of one of Montanaro's algorithms to trees containing k marked vertices, where k is not necessarily known a priori. Our approach involves using amplitude estimation to determine a near-optimal weighting of a diffusion operator, which can then be applied to prepare a superposition state with support only on marked vertices and ancestors thereof. By repeatedly sampling this state and updating the input vertex, a marked vertex is reached in a logarithmic number of steps. The algorithm thereby achieves the conjectured bound of O ˜(√{T Rmax }) for finding a single marked vertex and O ˜(k √{T Rmax }) for finding all k marked vertices, where T is an upper bound on the tree size and Rmax is the maximum effective resistance encountered by the algorithm. This constitutes a speedup over Montanaro's original procedure in both the case of finding one and the case of finding multiple marked vertices in an arbitrary tree.

Exact solutions to the fermion propagator Schwinger-Dyson equation in Minkowski space with on-shell renormalization for quenched QED

DOE PAGES

Jia, Shaoyang; Pennington, M. R.

2017-08-01

With the introduction of a spectral representation, the Schwinger-Dyson equation (SDE) for the fermion propagator is formulated in Minkowski space in QED. After imposing the on-shell renormalization conditions, analytic solutions for the fermion propagator spectral functions are obtained in four dimensions with a renormalizable version of the Gauge Technique anzatz for the fermion-photon vertex in the quenched approximation in the Landau gauge. Despite the limitations of this model, having an explicit solution provides a guiding example of the fermion propagator with the correct analytic structure. The Padé approximation for the spectral functions is also investigated.

Exact solutions to the fermion propagator Schwinger-Dyson equation in Minkowski space with on-shell renormalization for quenched QED

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jia, Shaoyang; Pennington, M. R.

With the introduction of a spectral representation, the Schwinger-Dyson equation (SDE) for the fermion propagator is formulated in Minkowski space in QED. After imposing the on-shell renormalization conditions, analytic solutions for the fermion propagator spectral functions are obtained in four dimensions with a renormalizable version of the Gauge Technique anzatz for the fermion-photon vertex in the quenched approximation in the Landau gauge. Despite the limitations of this model, having an explicit solution provides a guiding example of the fermion propagator with the correct analytic structure. The Padé approximation for the spectral functions is also investigated.

Gender differences in the neural underpinning of perceiving and appreciating the beauty of the body.

PubMed

Cazzato, Valentina; Mele, Sonia; Urgesi, Cosimo

2014-05-01

Although previous studies have suggested a certain degree of right hemisphere dominance for the response of extrastriate body area (EBA) during body perception, recent evidence suggests that this functional lateralization may differ between men and women. It is unknown, however, whether and how gender differences in body perception affect appreciating the beauty of the body of conspecifics. Here, we applied five 10-Hz repetitive transcranial magnetic stimulation (rTMS) pulses over left and right EBA and over the vertex to investigate the contribution of visual body representations in the two hemispheres on esthetic body perception. Female and male healthy volunteers were requested to judge how much they liked opposite- and same-gender virtual model bodies or to judge their weight, thus allowing us to compare the effects of right- and left-EBA rTMS on esthetic (liking) and perceptual (weight) judgments of human bodies. The analysis of the esthetic judgments provided by women revealed that right-EBA rTMS increased the liking judgments of opposite- but not same-gender models, as compared to both vertex and left EBA stimulation. Conversely, in men the liking judgments of opposite-gender models decreased after virtual disruption of both right and left EBA as compared to vertex stimulation. Crucially, no significant effect was found for the perceptual task, showing that left- and right-EBA rTMS did not affect weight perception. Our results provide evidence of gender difference in the hemispheric asymmetry of EBA in the esthetic processing of human bodies, with women showing stronger right hemisphere dominance in comparison with men. Copyright © 2014 Elsevier B.V. All rights reserved.

An ultra-low power self-timed column-level ADC for a CMOS pixel sensor based vertex detector

NASA Astrophysics Data System (ADS)

Zhang, L.; Wang, M.

2014-11-01

The International Large Detector (ILD) is a detector concept for the future linear collider experiment. The vertex detector is the key tool to achieve high precision measurements for flavor tagging, which puts stringent requirements on the CMOS pixel sensors. Due to the cooling systems which deteriorate the material budget and increase the multiple scattering, it is important to reduce the power consumption. This paper presents an ultra-low power self-timed column-level ADC for the CMOS pixel sensors, aiming to equip the outer layers of the vertex detector. The ADC was designed to operate in two modes (active and idle) adapted to the low hit density in the outer layers. The architecture employs an enhanced sample-and-hold circuit and a self-timed technique. The total power consumption with a 3-V supply is 225μW during idle mode, which is the most frequent situation. This value rises to 425μW in the case of the active mode. It occupies an area of 35 × 590μm2.

DEPFET pixel detector for future e-e+ experiments

NASA Astrophysics Data System (ADS)

Boronat, M.; DEPFET Collaboration

2016-04-01

The DEPFET Collaboration develops highly granular, ultra-thin pixel detectors for outstanding vertex reconstruction at future e+e- collider experiments. A DEPFET sensor provides, simultaneously, position sensitive detector capabilities and in-pixel amplification by the integration of a field effect transistor on a fully depleted silicon bulk. The characterization of the latest DEPFET prototypes has proven that a comfortable signal to noise ratio and excellent single point resolution can be achieved for a sensor thickness of 50 μm. A complete detector concept is being developed for the Belle II experiment at the new Japanese super flavor factory. The close to Belle related final auxiliary ASICs have been produced and found to operate a DEPFET pixel detector of the latest generation with the Belle II required read-out speed. DEPFET is not only the technology of choice for the Belle II vertex detector, but also a solid candidate for the International Linear Collider (ILC). Therefore, in this paper, the status of DEPFET R&D project is reviewed in the light of the requirements of the vertex detector at a future e+e- collider.

On the local vertex antimagic total coloring of some families tree

NASA Astrophysics Data System (ADS)

Febriani Putri, Desi; Dafik; Hesti Agustin, Ika; Alfarisi, Ridho

2018-04-01

Let G(V, E) be a graph of vertex set V and edge set E. Local vertex antimagic total coloring developed from local edge and local vertex antimagic coloring of graph. Local vertex antimagic total coloring is defined f:V(G)\\cup E(G)\\to \\{1,2,3,\\ldots,|V(G)|+|E(G)|\\} if for any two adjacent vertices v 1 and v 2, w({v}1)\

Trace for Differential Pencils on a Star-Type Graph

NASA Astrophysics Data System (ADS)

Yang, Chuan-Fu

2013-07-01

In this work, we consider the spectral problem for differential pencils on a star-type graph with a Kirchhoff-type condition in the internal vertex. The regularized trace formula of this operator is established with the contour integration method in complex analysis.

Novel Spectral Representations and Sparsity-Driven Algorithms for Shape Modeling and Analysis

NASA Astrophysics Data System (ADS)

Zhong, Ming

In this dissertation, we focus on extending classical spectral shape analysis by incorporating spectral graph wavelets and sparsity-seeking algorithms. Defined with the graph Laplacian eigenbasis, the spectral graph wavelets are localized both in the vertex domain and graph spectral domain, and thus are very effective in describing local geometry. With a rich dictionary of elementary vectors and forcing certain sparsity constraints, a real life signal can often be well approximated by a very sparse coefficient representation. The many successful applications of sparse signal representation in computer vision and image processing inspire us to explore the idea of employing sparse modeling techniques with dictionary of spectral basis to solve various shape modeling problems. Conventional spectral mesh compression uses the eigenfunctions of mesh Laplacian as shape bases, which are highly inefficient in representing local geometry. To ameliorate, we advocate an innovative approach to 3D mesh compression using spectral graph wavelets as dictionary to encode mesh geometry. The spectral graph wavelets are locally defined at individual vertices and can better capture local shape information than Laplacian eigenbasis. The multi-scale SGWs form a redundant dictionary as shape basis, so we formulate the compression of 3D shape as a sparse approximation problem that can be readily handled by greedy pursuit algorithms. Surface inpainting refers to the completion or recovery of missing shape geometry based on the shape information that is currently available. We devise a new surface inpainting algorithm founded upon the theory and techniques of sparse signal recovery. Instead of estimating the missing geometry directly, our novel method is to find this low-dimensional representation which describes the entire original shape. More specifically, we find that, for many shapes, the vertex coordinate function can be well approximated by a very sparse coefficient representation with respect to the dictionary comprising its Laplacian eigenbasis, and it is then possible to recover this sparse representation from partial measurements of the original shape. Taking advantage of the sparsity cue, we advocate a novel variational approach for surface inpainting, integrating data fidelity constraints on the shape domain with coefficient sparsity constraints on the transformed domain. Because of the powerful properties of Laplacian eigenbasis, the inpainting results of our method tend to be globally coherent with the remaining shape. Informative and discriminative feature descriptors are vital in qualitative and quantitative shape analysis for a large variety of graphics applications. We advocate novel strategies to define generalized, user-specified features on shapes. Our new region descriptors are primarily built upon the coefficients of spectral graph wavelets that are both multi-scale and multi-level in nature, consisting of both local and global information. Based on our novel spectral feature descriptor, we developed a user-specified feature detection framework and a tensor-based shape matching algorithm. Through various experiments, we demonstrate the competitive performance of our proposed methods and the great potential of spectral basis and sparsity-driven methods for shape modeling.

Algorithm for Search and Recovery of the Vertex of Decay in the Hypernuclear Experiment NIS-GIBS at Dubna Nuclotron

DOE Office of Scientific and Technical Information (OSTI.GOV)

Korotkova, Anna M.; Lukstins, Juris

2010-01-05

Search of the decay vertex is an important part of the hypernuclear experiment, carried out of the Dubna nuclotron accelerator. The decay vertex is reconstructed from data from two sets of proportional chambers. The distribution of the vertex of decay of the hypernucleus allows to measure the lifetime of the hypernuclei. Algorithm for searches and automatically calculates the decay vertex has been written.

On the existence of point spectrum for branching strips quantum graph

DOE Office of Scientific and Technical Information (OSTI.GOV)

Popov, I. Yu., E-mail: popov1955@gmail.com; Skorynina, A. N.; Blinova, I. V., E-mail: irin-a@yandex.ru

2014-03-15

The quantum graph having the form of branching strips with hexagonal (honeycomb) structure is considered. The Hamiltonian is determined as free 1D Schrödinger operator on each edge and some “boundary” conditions at each vertex. We obtain the conditions ensuring the point spectrum's existence for the Schrödinger operator of the system and relations that give us the eigenvalues.

On Making a Distinguished Vertex Minimum Degree by Vertex Deletion

NASA Astrophysics Data System (ADS)

Betzler, Nadja; Bredereck, Robert; Niedermeier, Rolf; Uhlmann, Johannes

For directed and undirected graphs, we study the problem to make a distinguished vertex the unique minimum-(in)degree vertex through deletion of a minimum number of vertices. The corresponding NP-hard optimization problems are motivated by applications concerning control in elections and social network analysis. Continuing previous work for the directed case, we show that the problem is W[2]-hard when parameterized by the graph's feedback arc set number, whereas it becomes fixed-parameter tractable when combining the parameters "feedback vertex set number" and "number of vertices to delete". For the so far unstudied undirected case, we show that the problem is NP-hard and W[1]-hard when parameterized by the "number of vertices to delete". On the positive side, we show fixed-parameter tractability for several parameterizations measuring tree-likeness, including a vertex-linear problem kernel with respect to the parameter "feedback edge set number". On the contrary, we show a non-existence result concerning polynomial-size problem kernels for the combined parameter "vertex cover number and number of vertices to delete", implying corresponding nonexistence results when replacing vertex cover number by treewidth or feedback vertex set number.

Law of large numbers for the SIR model with random vertex weights on Erdős-Rényi graph

NASA Astrophysics Data System (ADS)

Xue, Xiaofeng

2017-11-01

In this paper we are concerned with the SIR model with random vertex weights on Erdős-Rényi graph G(n , p) . The Erdős-Rényi graph G(n , p) is generated from the complete graph Cn with n vertices through independently deleting each edge with probability (1 - p) . We assign i. i. d. copies of a positive r. v. ρ on each vertex as the vertex weights. For the SIR model, each vertex is in one of the three states 'susceptible', 'infective' and 'removed'. An infective vertex infects a given susceptible neighbor at rate proportional to the production of the weights of these two vertices. An infective vertex becomes removed at a constant rate. A removed vertex will never be infected again. We assume that at t = 0 there is no removed vertex and the number of infective vertices follows a Bernoulli distribution B(n , θ) . Our main result is a law of large numbers of the model. We give two deterministic functions HS(ψt) ,HV(ψt) for t ≥ 0 and show that for any t ≥ 0, HS(ψt) is the limit proportion of susceptible vertices and HV(ψt) is the limit of the mean capability of an infective vertex to infect a given susceptible neighbor at moment t as n grows to infinity.

Optimized scalar promotion with load and splat SIMD instructions

DOEpatents

Eichenberger, Alexander E; Gschwind, Michael K; Gunnels, John A

2013-10-29

Mechanisms for optimizing scalar code executed on a single instruction multiple data (SIMD) engine are provided. Placement of vector operation-splat operations may be determined based on an identification of scalar and SIMD operations in an original code representation. The original code representation may be modified to insert the vector operation-splat operations based on the determined placement of vector operation-splat operations to generate a first modified code representation. Placement of separate splat operations may be determined based on identification of scalar and SIMD operations in the first modified code representation. The first modified code representation may be modified to insert or delete separate splat operations based on the determined placement of the separate splat operations to generate a second modified code representation. SIMD code may be output based on the second modified code representation for execution by the SIMD engine.

Optimized scalar promotion with load and splat SIMD instructions

DOEpatents

Eichenberger, Alexandre E [Chappaqua, NY; Gschwind, Michael K [Chappaqua, NY; Gunnels, John A [Yorktown Heights, NY

2012-08-28

Mechanisms for optimizing scalar code executed on a single instruction multiple data (SIMD) engine are provided. Placement of vector operation-splat operations may be determined based on an identification of scalar and SIMD operations in an original code representation. The original code representation may be modified to insert the vector operation-splat operations based on the determined placement of vector operation-splat operations to generate a first modified code representation. Placement of separate splat operations may be determined based on identification of scalar and SIMD operations in the first modified code representation. The first modified code representation may be modified to insert or delete separate splat operations based on the determined placement of the separate splat operations to generate a second modified code representation. SIMD code may be output based on the second modified code representation for execution by the SIMD engine.

The performance of diphoton primary vertex reconstruction methods in H → γγ+Met channel of ATLAS experiment

NASA Astrophysics Data System (ADS)

Tomiwa, K. G.

2017-09-01

The search for new physics in the H → γγ+met relies on how well the missing transverse energy is reconstructed. The Met algorithm used by the ATLAS experiment in turns uses input variables like photon and jets which depend on the reconstruction of the primary vertex. This document presents the performance of di-photon vertex reconstruction algorithms (hardest vertex method and Neural Network method). Comparing the performance of these algorithms for the nominal Standard Model sample and the Beyond Standard Model sample, we see the overall performance of the Neural Network method of primary vertex selection performed better than the Hardest vertex method.

Classification of three-state Hamiltonians solvable by the coordinate Bethe ansatz

NASA Astrophysics Data System (ADS)

Crampé, N.; Frappat, L.; Ragoucy, E.

2013-10-01

We classify ‘all’ Hamiltonians with rank 1 symmetry and nearest-neighbour interactions, acting on a periodic three-state spin chain, and solvable through (generalization of) the coordinate Bethe ansatz (CBA). In this way we obtain four multi-parametric extensions of the known 19-vertex Hamiltonians (such as Zamolodchikov-Fateev, Izergin-Korepin and Bariev Hamiltonians). Apart from the 19-vertex Hamiltonians, there exist 17-vertex and 14-vertex Hamiltonians that cannot be viewed as subcases of the 19-vertex ones. In the case of 17-vertex Hamiltonians, we get a generalization of the genus 5 special branch found by Martins, plus three new ones. We also get two 14-vertex Hamiltonians. We solve all these Hamiltonians using CBA, and provide their spectrum, eigenfunctions and Bethe equations. Special attention is given to provide the specifications of our multi-parametric Hamiltonians that give back known Hamiltonians.

Vertex Stimulation as a Control Site for Transcranial Magnetic Stimulation: A Concurrent TMS/fMRI Study.

PubMed

Jung, JeYoung; Bungert, Andreas; Bowtell, Richard; Jackson, Stephen R

2016-01-01

A common control condition for transcranial magnetic stimulation (TMS) studies is to apply stimulation at the vertex. An assumption of vertex stimulation is that it has relatively little influence over on-going brain processes involved in most experimental tasks, however there has been little attempt to measure neural changes linked to vertex TMS. Here we directly test this assumption by using a concurrent TMS/fMRI paradigm in which we investigate fMRI blood-oxygenation-level-dependent (BOLD) signal changes across the whole brain linked to vertex stimulation. Thirty-two healthy participants to part in this study. Twenty-one were stimulated at the vertex, at 120% of resting motor threshold (RMT), with short bursts of 1 Hz TMS, while functional magnetic resonance imaging (fMRI) BOLD images were acquired. As a control condition, we delivered TMS pulses over the left primary motor cortex using identical parameters to 11 other participants. Vertex stimulation did not evoke increased BOLD activation at the stimulated site. By contrast we observed widespread BOLD deactivations across the brain, including regions within the default mode network (DMN). To examine the effects of vertex stimulation a functional connectivity analysis was conducted. The results demonstrated that stimulating the vertex with suprathreshold TMS reduced neural activity in brain regions related to the DMN but did not influence the functional connectivity of this network. Our findings provide brain imaging evidence in support of the use of vertex simulation as a control condition in TMS but confirm that vertex TMS induces regional widespread decreases in BOLD activation. Copyright © 2015 The Authors. Published by Elsevier Inc. All rights reserved.

Representing k-graphs as Matrix Algebras

NASA Astrophysics Data System (ADS)

Rosjanuardi, R.

2018-05-01

For any commutative unital ring R and finitely aligned k-graph Λ with |Λ| < ∞ without cycles, we can realise Kumjian-Pask algebra KP R (Λ) as a direct sum of of matrix algebra over some vertices v with properties ν = νΛ, i.e: ⊕ νΛ=ν M |Λv|(R). When there is only a single vertex ν ∈ Λ° such that ν = νΛ, we can realise the Kumjian-Pask algebra as the matrix algebra M |ΛV|(R). Hence the matrix algebra M |vΛ|(R) can be regarded as a representation of the k-graph Λ. In this talk we will figure out the relation between finitely aligned k-graph and matrix algebra.

A drag measurement technique for free piston shock tunnels

NASA Technical Reports Server (NTRS)

Sanderson, S. R.; Simmons, J. M.; Tuttle, S. L.

1991-01-01

A new technique is described for measuring drag with 100-microsecond rise time on a nonlifting model in a free piston shock tunnel. The technique involves interpretation of the stress waves propagating within the model and its support. A finite element representation and spectral methods are used to obtain a mean square optimal estimate of the time history of the aerodynamic loading. Thus, drag is measured instantaneously and the previous restriction caused by the mechanical time constant of balances is overcome. The effectiveness of the balance is demonstrated by measuring the drag on cones with 5 and 15 deg semi-vertex angles in nominally Mach 5.6 flow with stagnation enthalpies from 2.6 to 33 MJ/kg.

5-brane webs for 5d N = 1 G 2 gauge theories

NASA Astrophysics Data System (ADS)

Hayashi, Hirotaka; Kim, Sung-Soo; Lee, Kimyeong; Yagi, Futoshi

2018-03-01

We propose 5-brane webs for 5d N = 1 G 2 gauge theories. From a Higgsing of the SO(7) gauge theory with a hypermultiplet in the spinor representation, we construct two types of 5-brane web configurations for the pure G 2 gauge theory using an O5-plane or an \\tilde{O5} -plane. Adding flavors to the 5-brane web for the pure G 2 gauge theory is also discussed. Based on the obtained 5-brane webs, we compute the partition functions for the 5d G 2 gauge theories using the recently suggested topological vertex formulation with an O5-plane, and we find agreement with known results.

Effects of Vertex Activity and Self-organized Criticality Behavior on a Weighted Evolving Network

NASA Astrophysics Data System (ADS)

Zhang, Gui-Qing; Yang, Qiu-Ying; Chen, Tian-Lun

2008-08-01

Effects of vertex activity have been analyzed on a weighted evolving network. The network is characterized by the probability distribution of vertex strength, each edge weight and evolution of the strength of vertices with different vertex activities. The model exhibits self-organized criticality behavior. The probability distribution of avalanche size for different network sizes is also shown. In addition, there is a power law relation between the size and the duration of an avalanche and the average of avalanche size has been studied for different vertex activities.

Towards apparent convergence in asymptotically safe quantum gravity

NASA Astrophysics Data System (ADS)

Denz, T.; Pawlowski, J. M.; Reichert, M.

2018-04-01

The asymptotic safety scenario in gravity is accessed within the systematic vertex expansion scheme for functional renormalisation group flows put forward in Christiansen et al. (Phys Lett B 728:114, 2014), Christiansen et al. (Phy Rev D 93:044036, 2016), and implemented in Christiansen et al. (Phys Rev D 92:121501, 2015) for propagators and three-point functions. In the present work this expansion scheme is extended to the dynamical graviton four-point function. For the first time, this provides us with a closed flow equation for the graviton propagator: all vertices and propagators involved are computed from their own flows. In terms of a covariant operator expansion the current approximation gives access to Λ , R, R^2 as well as R_{μ ν }^2 and higher derivative operators. We find a UV fixed point with three attractive and two repulsive directions, thus confirming previous studies on the relevance of the first three operators. In the infrared we find trajectories that correspond to classical general relativity and further show non-classical behaviour in some fluctuation couplings. We also find signatures for the apparent convergence of the systematic vertex expansion. This opens a promising path towards establishing asymptotically safe gravity in terms of apparent convergence.

A new scanning system for alpha decay events as calibration sources for range-energy relation in nuclear emulsion

NASA Astrophysics Data System (ADS)

Yoshida, J.; Kinbara, S.; Mishina, A.; Nakazawa, K.; Soe, M. K.; Theint, A. M. M.; Tint, K. T.

2017-03-01

A new scanning system named "Vertex picker" has been developed to rapid collect alpha decay events, which are calibration sources for the range-energy relation in nuclear emulsion. A computer-controlled optical microscope scans emulsion layers exhaustively, and a high-speed and high-resolution camera takes their micrographs. A dedicated image processing picks out vertex-like shapes. Practical operations of alpha decay search were demonstrated by emulsion sheets of the KEK-PS E373 experiment. Alpha decays of nearly 28 events were detected in eye-check work on a PC monitor per hour. This yield is nearly 20 times more effective than that by the conventional eye-scan method. The speed and quality is acceptable for the coming new experiment, J-PARC E07.

Locking mechanisms in degree-4 vertex origami structures

NASA Astrophysics Data System (ADS)

Fang, Hongbin; Li, Suyi; Xu, Jian; Wang, K. W.

2016-04-01

Origami has emerged as a potential tool for the design of mechanical metamaterials and metastructures whose novel properties originate from their crease patterns. Most of the attention in origami engineering has focused on the wellknown Miura-Ori, a folded tessellation that is flat-foldable for folded sheet and stacked blocks. This study advances the state of the art and expands the research field to investigate generic degree-4 vertex (4-vertex) origami, with a focus on facet-binding. In order to understand how facet-binding attributes to the mechanical properties of 4-vertex origami structures, geometries of the 4-vertex origami cells are analyzed and analytically expressed. Through repeating and stacking 4-vertex cells, origami sheets and stacked origami blocks can be constructed. Geometry analyses discover four mechanisms that will lead to the self-locking of 4-vertex origami cells, sheets, and stacked blocks: in-cell facet-binding, inlayer facet-binding, inter-layer facet binding, and in-layer and inter-layer facet-bindings. These mechanisms and the predicted self-locking phenomena are verified through 3D simulations and prototype experiments. Finally, this paper briefly introduces the unusual mechanical properties caused by the locking of 4-vertex origami structures. The research reported in this paper could foster a new breed of self-locking structures with various engineering applications.

Algebraic Bethe ansatz for U(1) invariant integrable models: Compact and non-compact applications

NASA Astrophysics Data System (ADS)

Martins, M. J.; Melo, C. S.

2009-10-01

We apply the algebraic Bethe ansatz developed in our previous paper [C.S. Melo, M.J. Martins, Nucl. Phys. B 806 (2009) 567] to three different families of U(1) integrable vertex models with arbitrary N bond states. These statistical mechanics systems are based on the higher spin representations of the quantum group U[SU(2)] for both generic and non-generic values of q as well as on the non-compact discrete representation of the SL(2,R) algebra. We present for all these models the explicit expressions for both the on-shell and the off-shell properties associated to the respective transfer matrices eigenvalue problems. The amplitudes governing the vectors not parallel to the Bethe states are shown to factorize in terms of elementary building blocks functions. The results for the non-compact SL(2,R) model are argued to be derived from those obtained for the compact systems by taking suitable N→∞ limits. This permits us to study the properties of the non-compact SL(2,R) model starting from systems with finite degrees of freedom.

Study of motion of optimal bodies in the soil of grid method

NASA Astrophysics Data System (ADS)

Kotov, V. L.; Linnik, E. Yu

2016-11-01

The paper presents a method of calculating the optimum forms in axisymmetric numerical method based on the Godunov and models elastoplastic soil vedium Grigoryan. Solved two problems in a certain definition of generetrix rotation of the body of a given length and radius of the base, having a minimum impedance and maximum penetration depth. Numerical calculations are carried out by a modified method of local variations, which allows to significantly reduce the number of operations at different representations of generetrix. Significantly simplify the process of searching for optimal body allows the use of a quadratic model of local interaction for preliminary assessments. It is noted the qualitative similarity of the process of convergence of numerical calculations for solving the optimization problem based on local interaction model and within the of continuum mechanics. A comparison of the optimal bodies with absolutely optimal bodies possessing the minimum resistance of penetration below which is impossible to achieve under given constraints on the geometry. It is shown that the conical striker with a variable vertex angle, which equal to the angle of the solution is absolutely optimal body of minimum resistance of penetration for each value of the velocity of implementation will have a final depth of penetration is only 12% more than the traditional body absolutely optimal maximum depth penetration.

Hierarchical graphs for rule-based modeling of biochemical systems

PubMed Central

2011-01-01

Background In rule-based modeling, graphs are used to represent molecules: a colored vertex represents a component of a molecule, a vertex attribute represents the internal state of a component, and an edge represents a bond between components. Components of a molecule share the same color. Furthermore, graph-rewriting rules are used to represent molecular interactions. A rule that specifies addition (removal) of an edge represents a class of association (dissociation) reactions, and a rule that specifies a change of a vertex attribute represents a class of reactions that affect the internal state of a molecular component. A set of rules comprises an executable model that can be used to determine, through various means, the system-level dynamics of molecular interactions in a biochemical system. Results For purposes of model annotation, we propose the use of hierarchical graphs to represent structural relationships among components and subcomponents of molecules. We illustrate how hierarchical graphs can be used to naturally document the structural organization of the functional components and subcomponents of two proteins: the protein tyrosine kinase Lck and the T cell receptor (TCR) complex. We also show that computational methods developed for regular graphs can be applied to hierarchical graphs. In particular, we describe a generalization of Nauty, a graph isomorphism and canonical labeling algorithm. The generalized version of the Nauty procedure, which we call HNauty, can be used to assign canonical labels to hierarchical graphs or more generally to graphs with multiple edge types. The difference between the Nauty and HNauty procedures is minor, but for completeness, we provide an explanation of the entire HNauty algorithm. Conclusions Hierarchical graphs provide more intuitive formal representations of proteins and other structured molecules with multiple functional components than do the regular graphs of current languages for specifying rule-based models, such as the BioNetGen language (BNGL). Thus, the proposed use of hierarchical graphs should promote clarity and better understanding of rule-based models. PMID:21288338

Aspects of Complexity in Sleep Analysis

NASA Astrophysics Data System (ADS)

Leitão, José M. N.; Da Rosa, Agostinho C.

The paper presents a selection of sleep analysis problems where some aspects and concepts of complexity come about. Emphasis is given to the electroencephalogram (EEG) as the most important sleep related variable. The conception of the EEG as a message to be deciphered stresses the importance of the communication and information theories in this field. An optimal detector of K complexes and vertex sharp waves based on a stochastic model of sleep EEG is considered. Besides detecting, the algorithm is also able to follow the evolution of the basic ongoing activity. It is shown that both the ostructure and microstructure of sleep can be described in terms of symbols and interpreted as sentences of a language. Syntactic models and Markov chain representations play in this context an important role.

Graphs and Enhancing Maple Multiplication.

ERIC Educational Resources Information Center

Cecil, David R.; Wang, Rongdong

2002-01-01

Description of a technique in Maple programming language that automatically prints all paths of any desired length along with the name of each vertex, proceeding in order from the beginning vertex to the ending vertex for a given graph. (Author/MM)

Symmetry preserving truncations of the gap and Bethe-Salpeter equations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Binosi, Daniele; Chang, Lei; Papavassiliou, Joannis

2016-05-01

Ward-Green-Takahashi (WGT) identities play a crucial role in hadron physics, e.g. imposing stringent relationships between the kernels of the one-and two-body problems, which must be preserved in any veracious treatment of mesons as bound states. In this connection, one may view the dressed gluon-quark vertex, Gamma(alpha)(mu), as fundamental. We use a novel representation of Gamma(alpha)(mu), in terms of the gluon-quark scattering matrix, to develop a method capable of elucidating the unique quark-antiquark Bethe-Salpeter kernel, K, that is symmetry consistent with a given quark gap equation. A strength of the scheme is its ability to expose and capitalize on graphic symmetriesmore » within the kernels. This is displayed in an analysis that reveals the origin of H-diagrams in K, which are two-particle-irreducible contributions, generated as two-loop diagrams involving the three-gluon vertex, that cannot be absorbed as a dressing of Gamma(alpha)(mu) in a Bethe-Salpeter kernel nor expressed as a member of the class of crossed-box diagrams. Thus, there are no general circumstances under which the WGT identities essential for a valid description of mesons can be preserved by a Bethe-Salpeter kernel obtained simply by dressing both gluon-quark vertices in a ladderlike truncation; and, moreover, adding any number of similarly dressed crossed-box diagrams cannot improve the situation.« less

Transforming graph states using single-qubit operations.

PubMed

Dahlberg, Axel; Wehner, Stephanie

2018-07-13

Stabilizer states form an important class of states in quantum information, and are of central importance in quantum error correction. Here, we provide an algorithm for deciding whether one stabilizer (target) state can be obtained from another stabilizer (source) state by single-qubit Clifford operations (LC), single-qubit Pauli measurements (LPM) and classical communication (CC) between sites holding the individual qubits. What is more, we provide a recipe to obtain the sequence of LC+LPM+CC operations which prepare the desired target state from the source state, and show how these operations can be applied in parallel to reach the target state in constant time. Our algorithm has applications in quantum networks, quantum computing, and can also serve as a design tool-for example, to find transformations between quantum error correcting codes. We provide a software implementation of our algorithm that makes this tool easier to apply. A key insight leading to our algorithm is to show that the problem is equivalent to one in graph theory, which is to decide whether some graph G ' is a vertex-minor of another graph G The vertex-minor problem is, in general, [Formula: see text]-Complete, but can be solved efficiently on graphs which are not too complex. A measure of the complexity of a graph is the rank-width which equals the Schmidt-rank width of a subclass of stabilizer states called graph states, and thus intuitively is a measure of entanglement. Here, we show that the vertex-minor problem can be solved in time O (| G | 3 ), where | G | is the size of the graph G , whenever the rank-width of G and the size of G ' are bounded. Our algorithm is based on techniques by Courcelle for solving fixed parameter tractable problems, where here the relevant fixed parameter is the rank width. The second half of this paper serves as an accessible but far from exhausting introduction to these concepts, that could be useful for many other problems in quantum information.This article is part of a discussion meeting issue 'Foundations of quantum mechanics and their impact on contemporary society'. © 2018 The Author(s).

The growth rate of vertex-transitive planar graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Babai, L.

1997-06-01

A graph is vertex-transitive if all of its vertices axe equivalent under automorphisms. Confirming a conjecture of Jon Kleinberg and Eva Tardos, we prove the following trichotomy theorem concerning locally finite vertex-transitive planar graphs: the rate of growth of a graph with these properties is either linear or quadratic or exponential. The same result holds more generally for locally finite, almost vertex-transitive planar graphs (the automorphism group has a finite number of orbits). The proof uses the elements of hyperbolic plane geometry.

Locating domination number of m-shadowing of graphs

NASA Astrophysics Data System (ADS)

Dafik; Hesti Agustin, Ika; Rizki Albirri, Ermita; Alfarisi, Ridho; Prihandini, R. M.

2018-04-01

Let G = (V, E) be a connected, undirected and simple graph. We define a set D as a dominating set if for every vertex u\\in V-D is adjacent to some vertex v\\in D. The domination number γ (G) is the minimum cardinality of dominating set. A vertex set D in graph G = (V, E) is called locating dominating set if for every pair of different vertex u and v in V(G) ‑ D which occupies \\rlap{/}{0}\

Localization on Quantum Graphs with Random Vertex Couplings

NASA Astrophysics Data System (ADS)

Klopp, Frédéric; Pankrashkin, Konstantin

2008-05-01

We consider Schrödinger operators on a class of periodic quantum graphs with randomly distributed Kirchhoff coupling constants at all vertices. We obtain necessary conditions for localization on quantum graphs in terms of finite volume criteria for some energy-dependent discrete Hamiltonians. These conditions hold in the strong disorder limit and at the spectral edges.

A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters

NASA Astrophysics Data System (ADS)

Ma, Fei; Su, Jing; Hao, Yongxing; Yao, Bing; Yan, Guanghui

2018-02-01

The problem of uncovering the internal operating function of network models is intriguing, demanded and attractive in researches of complex networks. Notice that, in the past two decades, a great number of artificial models are built to try to answer the above mentioned task. Based on the different growth ways, these previous models can be divided into two categories, one type, possessing the preferential attachment, follows a power-law P(k) ∼k-γ, 2 < γ < 3. The other has exponential-scaling feature, P(k) ∼α-k. However, there are no models containing above two kinds of growth ways to be presented, even the study of interconnection between these two growth manners in the same model is lacking. Hence, in this paper, we construct a class of planar and self-similar graphs motivated from a new attachment way, vertex-edge-growth network-operation, more precisely, the couple of both them. We report that this model is sparse, small world and hierarchical. And then, not only is scale-free feature in our model, but also lies the degree parameter γ(≈ 3 . 242) out the typical range. Note that, we suggest that the coexistence of multiple vertex growth ways will have a prominent effect on the power-law parameter γ, and the preferential attachment plays a dominate role on the development of networks over time. At the end of this paper, we obtain an exact analytical expression for the total number of spanning trees of models and also capture spanning trees entropy which we have compared with those of their corresponding component elements.

Fuzzy simulation in concurrent engineering

NASA Technical Reports Server (NTRS)

Kraslawski, A.; Nystrom, L.

1992-01-01

Concurrent engineering is becoming a very important practice in manufacturing. A problem in concurrent engineering is the uncertainty associated with the values of the input variables and operating conditions. The problem discussed in this paper concerns the simulation of processes where the raw materials and the operational parameters possess fuzzy characteristics. The processing of fuzzy input information is performed by the vertex method and the commercial simulation packages POLYMATH and GEMS. The examples are presented to illustrate the usefulness of the method in the simulation of chemical engineering processes.

Learning Inverse Rig Mappings by Nonlinear Regression.

PubMed

Holden, Daniel; Saito, Jun; Komura, Taku

2017-03-01

We present a framework to design inverse rig-functions-functions that map low level representations of a character's pose such as joint positions or surface geometry to the representation used by animators called the animation rig. Animators design scenes using an animation rig, a framework widely adopted in animation production which allows animators to design character poses and geometry via intuitive parameters and interfaces. Yet most state-of-the-art computer animation techniques control characters through raw, low level representations such as joint angles, joint positions, or vertex coordinates. This difference often stops the adoption of state-of-the-art techniques in animation production. Our framework solves this issue by learning a mapping between the low level representations of the pose and the animation rig. We use nonlinear regression techniques, learning from example animation sequences designed by the animators. When new motions are provided in the skeleton space, the learned mapping is used to estimate the rig controls that reproduce such a motion. We introduce two nonlinear functions for producing such a mapping: Gaussian process regression and feedforward neural networks. The appropriate solution depends on the nature of the rig and the amount of data available for training. We show our framework applied to various examples including articulated biped characters, quadruped characters, facial animation rigs, and deformable characters. With our system, animators have the freedom to apply any motion synthesis algorithm to arbitrary rigging and animation pipelines for immediate editing. This greatly improves the productivity of 3D animation, while retaining the flexibility and creativity of artistic input.

PatterNet: a system to learn compact physical design pattern representations for pattern-based analytics

NASA Astrophysics Data System (ADS)

Lutich, Andrey

2017-07-01

This research considers the problem of generating compact vector representations of physical design patterns for analytics purposes in semiconductor patterning domain. PatterNet uses a deep artificial neural network to learn mapping of physical design patterns to a compact Euclidean hyperspace. Distances among mapped patterns in this space correspond to dissimilarities among patterns defined at the time of the network training. Once the mapping network has been trained, PatterNet embeddings can be used as feature vectors with standard machine learning algorithms, and pattern search, comparison, and clustering become trivial problems. PatterNet is inspired by the concepts developed within the framework of generative adversarial networks as well as the FaceNet. Our method facilitates a deep neural network (DNN) to learn directly the compact representation by supplying it with pairs of design patterns and dissimilarity among these patterns defined by a user. In the simplest case, the dissimilarity is represented by an area of the XOR of two patterns. Important to realize that our PatterNet approach is very different to the methods developed for deep learning on image data. In contrast to "conventional" pictures, the patterns in the CAD world are the lists of polygon vertex coordinates. The method solely relies on the promise of deep learning to discover internal structure of the incoming data and learn its hierarchical representations. Artificial intelligence arising from the combination of PatterNet and clustering analysis very precisely follows intuition of patterning/optical proximity correction experts paving the way toward human-like and human-friendly engineering tools.

Belle II SVD ladder assembly procedure and electrical qualification

NASA Astrophysics Data System (ADS)

Adamczyk, K.; Aihara, H.; Angelini, C.; Aziz, T.; Babu, Varghese; Bacher, S.; Bahinipati, S.; Barberio, E.; Baroncelli, T.; Basith, A. K.; Batignani, G.; Bauer, A.; Behera, P. K.; Bergauer, T.; Bettarini, S.; Bhuyan, B.; Bilka, T.; Bosi, F.; Bosisio, L.; Bozek, A.; Buchsteiner, F.; Casarosa, G.; Ceccanti, M.; Červenkov, D.; Chendvankar, S. R.; Dash, N.; Divekar, S. T.; Doležal, Z.; Dutta, D.; Forti, F.; Friedl, M.; Hara, K.; Higuchi, T.; Horiguchi, T.; Irmler, C.; Ishikawa, A.; Jeon, H. B.; Joo, C.; Kandra, J.; Kang, K. H.; Kato, E.; Kawasaki, T.; Kodyš, P.; Kohriki, T.; Koike, S.; Kolwalkar, M. M.; Kvasnička, P.; Lanceri, L.; Lettenbicher, J.; Mammini, P.; Mayekar, S. N.; Mohanty, G. B.; Mohanty, S.; Morii, T.; Nakamura, K. R.; Natkaniec, Z.; Negishi, K.; Nisar, N. K.; Onuki, Y.; Ostrowicz, W.; Paladino, A.; Paoloni, E.; Park, H.; Pilo, F.; Profeti, A.; Rao, K. K.; Rashevskaya, I.; Rizzo, G.; Rozanska, M.; Sandilya, S.; Sasaki, J.; Sato, N.; Schultschik, S.; Schwanda, C.; Seino, Y.; Shimizu, N.; Stypula, J.; Tanaka, S.; Tanida, K.; Taylor, G. N.; Thalmeier, R.; Thomas, R.; Tsuboyama, T.; Uozumi, S.; Urquijo, P.; Vitale, L.; Volpi, M.; Watanuki, S.; Watson, I. J.; Webb, J.; Wiechczynski, J.; Williams, S.; Würkner, B.; Yamamoto, H.; Yin, H.; Yoshinobu, T.; Belle II SVD Collaboration

2016-07-01

The Belle II experiment at the SuperKEKB asymmetric e+e- collider in Japan will operate at a luminosity approximately 50 times larger than its predecessor (Belle). At its heart lies a six-layer vertex detector comprising two layers of pixelated silicon detectors (PXD) and four layers of double-sided silicon microstrip detectors (SVD). One of the key measurements for Belle II is time-dependent CP violation asymmetry, which hinges on a precise charged-track vertex determination. Towards this goal, a proper assembly of the SVD components with precise alignment ought to be performed and the geometrical tolerances should be checked to fall within the design limits. We present an overview of the assembly procedure that is being followed, which includes the precision gluing of the SVD module components, wire-bonding of the various electrical components, and precision three dimensional coordinate measurements of the jigs used in assembly as well as of the final SVD modules.

How gauge covariance of the fermion and boson propagators in QED constrain the effective fermion-boson vertex

DOE PAGES

Jia, Shaoyang; Pennington, M. R.

2016-12-12

In this paper, we derive the gauge covariance requirement imposed on the QED fermion-photon three-point function within the framework of a spectral representation for fermion propagators. When satisfied, such requirement ensures solutions to the fermion propagator Schwinger-Dyson equation (SDE) in any covariant gauge with arbitrary numbers of spacetime dimensions to be consistent with the Landau-Khalatnikov-Fradkin transformation (LKFT). The general result has been verified by the special cases of three and four dimensions. Additionally, we present the condition that ensures the vacuum polarization is independent of the gauge parameter. Finally, as an illustration, we show how the gauge technique dimensionally regularizedmore » in four dimensions does not satisfy the covariance requirement.« less

Many-core graph analytics using accelerated sparse linear algebra routines

NASA Astrophysics Data System (ADS)

Kozacik, Stephen; Paolini, Aaron L.; Fox, Paul; Kelmelis, Eric

2016-05-01

Graph analytics is a key component in identifying emerging trends and threats in many real-world applications. Largescale graph analytics frameworks provide a convenient and highly-scalable platform for developing algorithms to analyze large datasets. Although conceptually scalable, these techniques exhibit poor performance on modern computational hardware. Another model of graph computation has emerged that promises improved performance and scalability by using abstract linear algebra operations as the basis for graph analysis as laid out by the GraphBLAS standard. By using sparse linear algebra as the basis, existing highly efficient algorithms can be adapted to perform computations on the graph. This approach, however, is often less intuitive to graph analytics experts, who are accustomed to vertex-centric APIs such as Giraph, GraphX, and Tinkerpop. We are developing an implementation of the high-level operations supported by these APIs in terms of linear algebra operations. This implementation is be backed by many-core implementations of the fundamental GraphBLAS operations required, and offers the advantages of both the intuitive programming model of a vertex-centric API and the performance of a sparse linear algebra implementation. This technology can reduce the number of nodes required, as well as the run-time for a graph analysis problem, enabling customers to perform more complex analysis with less hardware at lower cost. All of this can be accomplished without the requirement for the customer to make any changes to their analytics code, thanks to the compatibility with existing graph APIs.

Layer-by-layer growth of vertex graph of Penrose tiling

NASA Astrophysics Data System (ADS)

Shutov, A. V.; Maleev, A. V.

2017-09-01

The growth form for the vertex graph of Penrose tiling is found to be a regular decagon. The lower and upper bounds for this form, coinciding with it, are strictly proven. A fractal character of layer-by-layer growth is revealed for some subgraphs of the vertex graph of Penrose tiling.

Vertex functions at finite momentum: Application to antiferromagnetic quantum criticality

NASA Astrophysics Data System (ADS)

Wölfle, Peter; Abrahams, Elihu

2016-02-01

We analyze the three-point vertex function that describes the coupling of fermionic particle-hole pairs in a metal to spin or charge fluctuations at nonzero momentum. We consider Ward identities, which connect two-particle vertex functions to the self-energy, in the framework of a Hubbard model. These are derived using conservation laws following from local symmetries. The generators considered are the spin density and particle density. It is shown that at certain antiferromagnetic critical points, where the quasiparticle effective mass is diverging, the vertex function describing the coupling of particle-hole pairs to the spin density Fourier component at the antiferromagnetic wave vector is also divergent. Then we give an explicit calculation of the irreducible vertex function for the case of three-dimensional antiferromagnetic fluctuations, and show that it is proportional to the diverging quasiparticle effective mass.

Eigenvalues of the Laplacian of a graph

NASA Technical Reports Server (NTRS)

Anderson, W. N., Jr.; Morley, T. D.

1971-01-01

Let G be a finite undirected graph with no loops or multiple edges. The Laplacian matrix of G, Delta(G), is defined by Delta sub ii = degree of vertex i and Delta sub ij = -1 if there is an edge between vertex i and vertex j. The structure of the graph G is related to the eigenvalues of Delta(G); in particular, it is proved that all the eigenvalues of Delta(G) are nonnegative, less than or equal to the number of vertices, and less than or equal to twice the maximum vertex degree. Precise conditions for equality are given.

RAVE—a Detector-independent vertex reconstruction toolkit

NASA Astrophysics Data System (ADS)

Waltenberger, Wolfgang; Mitaroff, Winfried; Moser, Fabian

2007-10-01

A detector-independent toolkit for vertex reconstruction (RAVE ) is being developed, along with a standalone framework (VERTIGO ) for testing, analyzing and debugging. The core algorithms represent state of the art for geometric vertex finding and fitting by both linear (Kalman filter) and robust estimation methods. Main design goals are ease of use, flexibility for embedding into existing software frameworks, extensibility, and openness. The implementation is based on modern object-oriented techniques, is coded in C++ with interfaces for Java and Python, and follows an open-source approach. A beta release is available. VERTIGO = "vertex reconstruction toolkit and interface to generic objects".

A Single-Centre, Randomized, Double-Blind, Placebo-Controlled Clinical Trial to Investigate the Efficacy and Safety of Minoxidil Topical Foam in Frontotemporal and Vertex Androgenetic Alopecia in Men.

PubMed

Hillmann, Kathrin; Garcia Bartels, Natalie; Kottner, Jan; Stroux, Andrea; Canfield, Douglas; Blume-Peytavi, Ulrike

2015-01-01

5% minoxidil formulations twice daily are effective in treating vertex male androgenetic alopecia (AGA); however, efficacy and safety data in frontotemporal regions are lacking. To assess the efficacy of 5% minoxidil topical foam (5% MTF) in the frontotemporal region of male AGA patients after 24 weeks of treatment compared to placebo treatment and to the vertex region. Seventy males with moderate AGA applied 5% MTF or placebo foam (plaTF) twice daily for 24 weeks in frontotemporal and vertex regions. Target area non-vellus hair count (TAHC) was the primary end point. Frontotemporal and vertex TAHC and target area cumulative non-vellus hair width (TAHW) showed similar responses to 5% MTF with significant increases up to week 16 compared to baseline (p < 0.001). After 24 weeks of treatment, frontotemporal TAHW increased significantly in the 5% MTF group compared to the plaTF group (p = 0.017), while TAHC showed a similar non-significant increase from baseline in both regions. At 24 weeks, 5% MTF users rated a significant improvement in scalp coverage for the frontotemporal (p = 0.016) and vertex areas (p = 0.027). 5% MTF twice a day promotes hair density and width in both frontotemporal and vertex regions in men with moderate stages of AGA. © 2015 S. Karger AG, Basel.

Logarithmic conformal field theory

NASA Astrophysics Data System (ADS)

Gainutdinov, Azat; Ridout, David; Runkel, Ingo

2013-12-01

Conformal field theory (CFT) has proven to be one of the richest and deepest subjects of modern theoretical and mathematical physics research, especially as regards statistical mechanics and string theory. It has also stimulated an enormous amount of activity in mathematics, shaping and building bridges between seemingly disparate fields through the study of vertex operator algebras, a (partial) axiomatisation of a chiral CFT. One can add to this that the successes of CFT, particularly when applied to statistical lattice models, have also served as an inspiration for mathematicians to develop entirely new fields: the Schramm-Loewner evolution and Smirnov's discrete complex analysis being notable examples. When the energy operator fails to be diagonalisable on the quantum state space, the CFT is said to be logarithmic. Consequently, a logarithmic CFT is one whose quantum space of states is constructed from a collection of representations which includes reducible but indecomposable ones. This qualifier arises because of the consequence that certain correlation functions will possess logarithmic singularities, something that contrasts with the familiar case of power law singularities. While such logarithmic singularities and reducible representations were noted by Rozansky and Saleur in their study of the U (1|1) Wess-Zumino-Witten model in 1992, the link between the non-diagonalisability of the energy operator and logarithmic singularities in correlators is usually ascribed to Gurarie's 1993 article (his paper also contains the first usage of the term 'logarithmic conformal field theory'). The class of CFTs that were under control at this time was quite small. In particular, an enormous amount of work from the statistical mechanics and string theory communities had produced a fairly detailed understanding of the (so-called) rational CFTs. However, physicists from both camps were well aware that applications from many diverse fields required significantly more complicated non-rational theories. Examples include critical percolation, supersymmetric string backgrounds, disordered electronic systems, sandpile models describing avalanche processes, and so on. In each case, the non-rationality and non-unitarity of the CFT suggested that a more general theoretical framework was needed. Driven by the desire to better understand these applications, the mid-1990s saw significant theoretical advances aiming to generalise the constructs of rational CFT to a more general class. In 1994, Nahm introduced an algorithm for computing the fusion product of representations which was significantly generalised two years later by Gaberdiel and Kausch who applied it to explicitly construct (chiral) representations upon which the energy operator acts non-diagonalisably. Their work made it clear that underlying the physically relevant correlation functions are classes of reducible but indecomposable representations that can be investigated mathematically to the benefit of applications. In another direction, Flohr had meanwhile initiated the study of modular properties of the characters of logarithmic CFTs, a topic which had already evoked much mathematical interest in the rational case. Since these seminal theoretical papers appeared, the field has undergone rapid development, both theoretically and with regard to applications. Logarithmic CFTs are now known to describe non-local observables in the scaling limit of critical lattice models, for example percolation and polymers, and are an integral part of our understanding of quantum strings propagating on supermanifolds. They are also believed to arise as duals of three-dimensional chiral gravity models, fill out hidden sectors in non-rational theories with non-compact target spaces, and describe certain transitions in various incarnations of the quantum Hall effect. Other physical applications range from two-dimensional turbulence and non-equilibrium systems to aspects of the AdS/CFT correspondence and describing supersymmetric sigma models beyond the topological sector. We refer the reader to the reviews in this collection for further applications and details. More recently, our understanding of logarithmic CFT has improved dramatically thanks largely to a better understanding of the underlying mathematical structures. This includes those associated to the vertex operator algebras themselves (representations, characters, modular transformations, fusion, braiding) as well as structures associated with applications to two-dimensional statistical models (diagram algebras, eg. Temperley-Lieb quantum groups). Not only are we getting to the point where we understand how these structures differ from standard (rational) theories, but we are starting to tackle applications both in the boundary and bulk settings. It is now clear that the logarithmic case is generic, so it is this case that one should expect to encounter in applications. We therefore feel that it is timely to review what has been accomplished in order to disseminate this improved understanding and motivate further applications. We now give a quick overview of the articles that constitute this special issue. Adamović and Milas provide a detailed summary of their rigorous results pertaining to logarithmic vertex operator (super)algebras constructed from lattices. This survey discusses the C2-cofiniteness of the (p, p') triplet models (this is the generalisation of rationality to the logarithmic setting), describes Zhu's algebra for (some of) these theories and outlines the difficulties involved in explicitly constructing the modules responsible for their logarithmic nature. Cardy gives an account of a popular approach to logarithmic theories that regards them, heuristically at least, as limits of ordinary (but non-rational) CFTs. More precisely, it seems that any given correlator may be computed as a limit of standard (non-logarithmic) correlators, any logarithmic singularities that arise do so because of a degeneration when taking the limit. He then illustrates this phenomenon in several theories describing statistical lattice models including the n → 0 limit of the O(n ) model and the Q → 1 limit of the Q-state Potts model. Creutzig and Ridout review the continuum approach to logarithmic CFT, using the percolation (boundary) CFT to detail the connection between module structure and logarithmic singularities in correlators before describing their proposed solution to the thorny issue of generalising modular data and Verlinde formulae to the logarithmic setting. They illustrate this proposal using the three best-understood examples of logarithmic CFTs: the (1, 2) models, related to symplectic fermions; the fractional level WZW model on , related to the beta gamma ghosts; and the WZW model on GL(1|1). The analysis in each case requires that the spectrum be continuous; C2-cofinite models are only recovered as orbifolds. Flohr and Koehn consider the characters of the irreducible modules in the spectrum of a CFT and discuss why these only span a proper subspace of the space of torus vacuum amplitudes in the logarithmic case. This is illustrated explicitly for the (1, 2) triplet model and conclusions are drawn for the action of the modular group. They then note that the irreducible characters of this model also admit fermionic sum forms which seem to fit well into Nahmrsquo;s well-known conjecture for rational theories. Quasi-particle interpretations are also introduced, leading to the conclusion that logarithmic C2-cofinite theories are not so terribly different to rational theories, at least in some respects. Fuchs, Schweigert and Stigner address the problem of constructing local logarithmic CFTs starting from the chiral theory. They first review the construction of the local theory in the non-logarithmic setting from an angle that will then generalise to logarithmic theories. In particular, they observe that the bulk space can be understood as a certain coend. The authors then show how to carry out the construction of the bulk space in the category of modules over a factorisable ribbon Hopf algebra, which shares many properties with the braided categories arising from logarithmic chiral theories. The authors proceed to construct the analogue of all-genus correlators in their setting and establish invariance under the mapping class group, i.e. locality of the correlators. Gainutdinov, Jacobsen, Read, Saleur and Vasseur review their approach based on the assumption that certain classes of logarithmic CFTs admit lattice regularisations with local degrees of freedom, for example quantum spin chains (with local interactions). They therefore study the finite-dimensional algebras generated by the hamiltonian densities (typically the Temperley-Lieb algebras and their extensions) that describe the dynamics of these lattice models. The authors then argue that the lattice algebras exhibit, in finite size, mathematical properties that are in correspondence with those of their continuum limits, allowing one to predict continuum structures directly from the lattice. Moreover, the lattice models considered admit quantum group symmetries that play a central role in the algebraic analysis (representation structure and fusion). Grumiller, Riedler, Rosseel and Zojer review the role that logarithmic CFTs may play in certain versions of the AdS/CFT correspondence, particularly for what is known as topologically massive gravity (TMG). This has been a very active subject over the last five years and the article takes great care to disentangle the contributions from the many groups that have participated. They begin with some general remarks on logarithmic behaviour, much in the spirit of Cardyrsquo;s review, before detailing the distinction between the chiral (no logs) and logarithmic proposals for critical TMG. The latter is then subjected to various consistency checks before discussing evidence for logarithmic behaviour in more general classes of gravity theories including those with boundaries, supersymmetry and galilean relativity. Gurarie has written an historical overview of his seminal contributions to this field, putting his results (and those of his collaborators) in the context of understanding applications to condensed matter physics. This includes the link between the non-diagonalisability of L0 and logarithmic singularities, a study of the c → 0 catastrophe, and a proposed resolution involving supersymmetric partners for the stress-energy tensor and its logarithmic partner field. Henkel and Rouhani describe a direction in which logarithmic singularities are observed in correlators of non-relativistic field theories. Their review covers the appropriate modifications of conformal invariance that are appropriate to non-equilibrium statistical mechanics, strongly anisotropic critical points and certain variants of TMG. The main variation away from the standard relativistic idea of conformal invariance is that time is explicitly distinguished from space when considering dilations and this leads to a variety of algebraic structures to explore. In this review, the link between non-diagonalisable representations and logarithmic singularities in correlators is generalised to these algebras, before two applications of the theory are discussed. Huang and Lepowsky give a non-technical overview of their work on braided tensor structures on suitable categories of representations of vertex operator algebras. They also place their work in historic context and compare it to related approaches. The authors sketch their construction of the so-called P(z)-tensor product of modules of a vertex operator algebra, and the construction of the associativity isomorphisms for this tensor product. They proceed to give a guide to their works leading to the first authorrsquo;s proof of modularity for a class of vertex operator algebras, and to their works, joint with Zhang, on logarithmic intertwining operators and the resulting tensor product theory. Morin-Duchesne and Saint-Aubin have contributed a research article describing their recent characterisation of when the transfer matrix of a periodic loop model fails to be diagonalisable. This generalises their recent result for non-periodic loop models and provides rigorous methods to justify what has often been assumed in the lattice approach to logarithmic CFT. The philosophy here is one of analysing lattice models with finite size, aiming to demonstrate that non-diagonalisability survives the scaling limit. This is extremely difficult in general (see also the review by Gainutdinov et al ), so it is remarkable that it is even possible to demonstrate this at any level of generality. Quella and Schomerus have prepared an extensive review covering their longstanding collaboration on the logarithmic nature of conformal sigma models on Lie supergroups and their cosets with applications to string theory and AdS/CFT. Beginning with a very welcome overview of Lie superalgebras and their representations, harmonic analysis and cohomological reduction, they then apply these mathematical tools to WZW models on type I Lie supergroups and their homogeneous subspaces. Along the way, deformations are discussed and potential dualities in the corresponding string theories are described. Ruelle provides an exhaustive account of his substantial contributions to the study of the abelian sandpile model. This is a statistical model which has the surprising feature that many correlation functions can be computed exactly, in the bulk and on the boundary, even though the spectrum of conformal weights is largely unknown. Nevertheless, there is much evidence suggesting that its scaling limit is described by an, as yet unknown, c = -2 logarithmic CFT. Semikhatov and Tipunin present their very recent results regarding the construction of logarithmic chiral W-algebra extensions of a fractional level algebra. The idea is that these algebras are the centralisers of a rank-two Nichols algebra which possesses at least one fermionic generator. In turn, these Nichols algebra generators are represented by screening operators which naturally appear in CFT bosonisation. The major advantage of using these generators is that they give strong hints about the representation theory and fusion rules of the chiral algebra. Simmons has contributed an article describing the calculation of various correlation functions in the logarithmic CFT that describes critical percolation. These calculations are interpreted geometrically in a manner that should be familiar to mathematicians studying Schramm-Loewner evolutions and point towards a (largely unexplored) bridge connecting logarithmic CFT with this branch of mathematics. Of course, the field of logarithmic CFT has benefited greatly from the work of many of researchers who are not represented in this special issue. The interested reader will find many links to their work in the bibliographies of the special issue articles and reviews. In summary, logarithmic CFT describes an extension of the incredibly successful methods of rational CFT to a more general setting. This extension is necessary to properly describe many different fundamental phenomena of physical interest. The formalism is moreover highly non-trivial from a mathematical point of view and so logarithmic theories are of significant interest to both physicists and mathematicians. We hope that the collection of articles that follows will serve as an inspiration, and a valuable resource, for both of these communities.

Calculus students' understanding of the vertex of the quadratic function in relation to the concept of derivative

NASA Astrophysics Data System (ADS)

Burns-Childers, Annie; Vidakovic, Draga

2018-07-01

The purpose of this study was to gain insight into 30, first year calculus students' understanding of the relationship between the concept of vertex of a quadratic function and the concept of the derivative. APOS (action-process-object-schema) theory was applied as a guiding framework of analysis on student written work, think-aloud and follow up group interviews. Students' personal meanings of the vertex, including misconceptions, were explored, along with students' understanding to solve problems pertaining to the derivative of a quadratic function. Results give evidence of students' weak schema of the vertex, lack of connection between different problem types and the importance of linguistics in relation to levels of APOS theory. A preliminary genetic decomposition was developed based on the results. Future research is suggested as a continuation to improve student understanding of the relationship between the vertex of quadratic functions and the derivative.

Fetal presentation and successful twin vaginal delivery.

PubMed

Easter, Sarah Rae; Lieberman, Ellice; Carusi, Daniela

2016-01-01

Despite the demonstrated safety of a trial of labor for pregnancies with a vertex-presenting twin and clinical guidelines in support of this plan, the rate of planned cesarean delivery for twin pregnancies remains high. This high rate, as well as variation in cesarean rates for twin pregnancies across providers, may be influenced strongly by concern about delivery of the second twin, particularly when it is in a nonvertex presentation. There are limited data in the literature that has examined the impact of the position of the nonpresenting twin on successful vaginal delivery or maternal/neonatal morbidity. We hypothesized that nonvertex presentation of the second twin would be associated with lower rates of successful vaginal birth for those patients attempting labor. This institutional review board-approved, retrospective cohort study of women who labored with twin pregnancies in a single urban hospital from 2007-2011. We included women with vertex-presenting first twins at >32 weeks gestation without a contraindication to labor and excluded those with uterine scar or lethal fetal anomaly. Vaginal delivery rates were evaluated according to vertex or nonvertex presentation of the second twin at admission and again at delivery. Maternal and neonatal morbidities were evaluated separately. Logistic regression was used to control for multiple confounders. Seven hundred sixteen patients met the inclusion criteria; 349 patients (49%) underwent a trial of labor. This included 73% (296/406) of eligible vertex/vertex twins and 17% (53/310) eligible vertex/nonvertex twins (P < .01). When compared with laboring patients with vertex/vertex-presenting twins, those with vertex/nonvertex twins were younger (median age, 32 vs 33 years; P = .05), were more often multiparous (60% vs 43%; P = .02), and were less likely to have hypertension (13% vs 27%; P = .03). Eighty-five percent of patients with nonvertex second twins at admission delivered vaginally, compared with 70% of patients with vertex second twins (P = .02). After we controlled for confounders, the difference was not statistically significant (adjusted odds ratio, 2.10; 95% confidence interval, 0.93-4.73). In the subset of patients with nonvertex second twins at delivery, those who initiated labor had an 89% vaginal delivery rate, compared with a 56% rate for those who changed from vertex to nonvertex presentation during labor (adjusted odds ratio, 19.90; 95% confidence interval, 3.86-102.78). Labor induction and increasing provider years in practice were also significant positive predictors of vaginal birth when the second twin was nonvertex at delivery. Maternal and neonatal morbidity was low and similar between groups, although 8% of women with nonvertex second twins experienced cervical lacerations, compared with 1% with vertex second twins (P = .01). Patients with nonvertex second twins had comparable, if not higher, rates of vaginal delivery than their vertex-presenting counterparts. The higher rate of vaginal delivery with stable nonvertex lie and the association with labor induction and the physician's years in practice all suggest a role for provider selection and delivery planning. These findings and the observed 11% rate of intrapartum presentation change support vaginal delivery of the nonvertex second twin. Copyright © 2016 Elsevier Inc. All rights reserved.

Genus Ranges of 4-Regular Rigid Vertex Graphs

PubMed Central

Buck, Dorothy; Dolzhenko, Egor; Jonoska, Nataša; Saito, Masahico; Valencia, Karin

2016-01-01

A rigid vertex of a graph is one that has a prescribed cyclic order of its incident edges. We study orientable genus ranges of 4-regular rigid vertex graphs. The (orientable) genus range is a set of genera values over all orientable surfaces into which a graph is embedded cellularly, and the embeddings of rigid vertex graphs are required to preserve the prescribed cyclic order of incident edges at every vertex. The genus ranges of 4-regular rigid vertex graphs are sets of consecutive integers, and we address two questions: which intervals of integers appear as genus ranges of such graphs, and what types of graphs realize a given genus range. For graphs with 2n vertices (n > 1), we prove that all intervals [a, b] for all a < b ≤ n, and singletons [h, h] for some h ≤ n, are realized as genus ranges. For graphs with 2n − 1 vertices (n ≥ 1), we prove that all intervals [a, b] for all a < b ≤ n except [0, n], and [h, h] for some h ≤ n, are realized as genus ranges. We also provide constructions of graphs that realize these ranges. PMID:27807395

DOE Office of Scientific and Technical Information (OSTI.GOV)

Uemura, Sho

The Heavy Photon Search (HPS) is a new experiment at Jefferson Lab that searches for a massive U(1) vector boson (known as a heavy photon or A′) in the MeV-GeV mass range and coupling weakly to ordinary matter through a kinetic mixing interaction. The HPS experiment seeks to produce heavy photons by electron bremsstrahlung on a fixed target, is sensitive to heavy photon decays to e+e-, and targets the range in heavy photon mass m_A' ~ 20 - 600 MeV, and kinetic mixing strength epsilon^2 ~ 10^-5 - 10^−10. HPS searches for heavy photons using two signatures: a narrow massmore » resonance and displaced vertices. This dissertation presents the theoretical and experimental motivations for a heavy photon, the design and operation of the HPS experiment, and the displaced vertex search. The data used in this dissertation is the unblinded fraction of the 2015 HPS run, for the period of operation where the HPS silicon vertex tracker (SVT) was operated at its nominal position. This data was recorded from May 13 to May 18, 2015, at a beam energy of 1.056 GeV and a nominal beam current of 50 nA. The integrated luminosity is 119 nb^-1, which is equivalent to 0.172 days of ideal running at the nominal beam current. This dissertation presents results (signal significance and upper limits) from the displaced vertex search in the mass range m_A' ~ 20 - 60 MeV, and kinetic mixing strength epsilon^2 ~ 2 × 10^-8 - 10^-10. This search does not have sufficient sensitivity to exclude a canonical heavy photon at any combination of m_A' and epsilon^2. The strictest limit achieved in this analysis on the production of a particle that decays like a heavy photon is 115 times the expected production cross-section for a heavy photon. Factors limiting the sensitivity of this analysis are discussed. Projections of HPSperformance with the full 2015 data set, and with planned improvements to theanalysis, are presented. Comparisons are also made to earlier reach estimates.« less

Matrix Representation of Symmetry Operators in Elementary Crystallography

ERIC Educational Resources Information Center

Cody, R. D.

1972-01-01

Presents the derivation of rotation and reflection matrix representation of symmetry operators as used in the initial discussion of crystal symmetry in elementary mineralogy at Iowa State University. Includes references and an appended list of matrix representations of the important crystallographic symmetry operators, excluding the trigonal and…

Association between vaginal birth after cesarean delivery and primary cesarean delivery rates.

PubMed

Rosenstein, Melissa G; Kuppermann, Miriam; Gregorich, Steven E; Cottrell, Erika K; Caughey, Aaron B; Cheng, Yvonne W

2013-11-01

To estimate the association between vaginal birth after cesarean delivery (VBAC) rates and primary cesarean delivery rates in California hospitals. Hospital VBAC rates were calculated using birth certificate and discharge data from 2009, and hospitals were categorized by quartile of VBAC rate. Multivariable logistic regression analysis was performed to estimate the odds of cesarean delivery among low-risk nulliparous women with singleton pregnancies at term in vertex presentation (nulliparous term singleton vertex) by hospital VBAC quartile while controlling for many patient-level and hospital-level confounders. There were 468,789 term singleton births in California in 2009 at 255 hospitals, 125,471 of which were low-risk nulliparous term singleton vertex. Vaginal birth after cesarean delivery rates varied between hospitals, with a range of 0-44.6%. Rates of cesarean delivery among low-risk nulliparous term singleton vertex women declined significantly with increasing VBAC rate. When adjusted for maternal and hospital characteristics, low-risk nulliparous term singleton vertex women who gave birth in hospitals in the highest VBAC quartile had an odds ratio of 0.55 (95% confidence interval 0.46-0.66) of cesarean delivery compared with women at hospitals with the lowest VBAC rates. Each percentage point increase in a hospital's VBAC rate was associated with a 0.65% decrease in the low-risk nulliparous term singleton vertex cesarean delivery rate. Hospitals with higher rates of VBAC have lower rates of primary cesarean delivery among low-risk nulliparous women with singleton pregnancies at term in vertex presentation. II.

Formulation of spin 7/2 and 9/2 nucleon resonance amplitudes for kaon photoproduction off a proton

DOE Office of Scientific and Technical Information (OSTI.GOV)

Clymton, S., E-mail: samsonclymton@gmail.com; Mart, T.

2016-04-19

We have constructed the formulation of scattering amplitude for kaon photoproduction off a proton that includes nucleon resonances with spins 7/2 and 9/2. To this end we start with the formalism of projection operator for higher spins and derive the spins 7/2 and 9/2 projection operators. The corresponding Feynman propagators are obtained from these projection operators. To calculate the scattering amplitude we use the vertex factor proposed by Pascalutsa. The scattering amplitudes are then decomposed into six Lorentz- and gauge-invariant amplitudes, from which the cross section and polarization observables can be calculated.

Linearized self-consistent quasiparticle GW method: Application to semiconductors and simple metals

NASA Astrophysics Data System (ADS)

Kutepov, A. L.; Oudovenko, V. S.; Kotliar, G.

2017-10-01

We present a code implementing the linearized quasiparticle self-consistent GW method (LQSGW) in the LAPW basis. Our approach is based on the linearization of the self-energy around zero frequency which differs it from the existing implementations of the QSGW method. The linearization allows us to use Matsubara frequencies instead of working on the real axis. This results in efficiency gains by switching to the imaginary time representation in the same way as in the space time method. The all electron LAPW basis set eliminates the need for pseudopotentials. We discuss the advantages of our approach, such as its N3 scaling with the system size N, as well as its shortcomings. We apply our approach to study the electronic properties of selected semiconductors, insulators, and simple metals and show that our code produces the results very close to the previously published QSGW data. Our implementation is a good platform for further many body diagrammatic resummations such as the vertex-corrected GW approach and the GW+DMFT method. Program Files doi:http://dx.doi.org/10.17632/cpchkfty4w.1 Licensing provisions: GNU General Public License Programming language: Fortran 90 External routines/libraries: BLAS, LAPACK, MPI (optional) Nature of problem: Direct implementation of the GW method scales as N4 with the system size, which quickly becomes prohibitively time consuming even in the modern computers. Solution method: We implemented the GW approach using a method that switches between real space and momentum space representations. Some operations are faster in real space, whereas others are more computationally efficient in the reciprocal space. This makes our approach scale as N3. Restrictions: The limiting factor is usually the memory available in a computer. Using 10 GB/core of memory allows us to study the systems up to 15 atoms per unit cell.

Involvement of the larynx motor area in singing-voice perception: a TMS study†

PubMed Central

Lévêque, Yohana; Muggleton, Neil; Stewart, Lauren; Schön, Daniele

2013-01-01

Recent evidence has reported that the motor system has a role in speech or emotional vocalization discrimination. In the present study we investigated the involvement of the larynx motor representation in singing perception. Twenty-one non-musicians listened to short tones sung by a human voice or played by a machine and performed a categorization task. Thereafter continuous theta-burst transcranial magnetic stimulation was applied over the right larynx premotor area or on the vertex and the test administered again. Overall, reaction times (RTs) were shorter after stimulation over both sites. Nonetheless and most importantly, RTs became longer for sung than for “machine” sounds after stimulation on the larynx area. This effect suggests that the right premotor region is functionally involved in singing perception and that sound humanness modulates motor resonance. PMID:23874314

Track reconstruction in the inhomogeneous magnetic field for Vertex Detector of NA61/SHINE experiment at CERN SPS

NASA Astrophysics Data System (ADS)

Merzlaya, Anastasia; NA61/SHINE Collaboration

2017-01-01

The heavy-ion programme of the NA61/SHINE experiment at CERN SPS is expanding to allow precise measurements of exotic particles with lifetime few hundred microns. A Vertex Detector for open charm measurements at the SPS is being constructed by the NA61/SHINE Collaboration to meet the challenges of high spatial resolution of secondary vertices and efficiency of track registration. This task is solved by the application of the coordinate sensitive CMOS Monolithic Active Pixel Sensors with extremely low material budget in the new Vertex Detector. A small-acceptance version of the Vertex Detector is being tested this year, later it will be expanded to a large-acceptance version. Simulation studies will be presented. A method of track reconstruction in the inhomogeneous magnetic field for the Vertex Detector was developed and implemented. Numerical calculations show the possibility of high precision measurements in heavy ion collisions of strange and multi strange particles, as well as heavy flavours, like charmed particles.

Coevolution of Vertex Weights Resolves Social Dilemma in Spatial Networks.

PubMed

Shen, Chen; Chu, Chen; Guo, Hao; Shi, Lei; Duan, Jiangyan

2017-11-09

In realistic social system, the role or influence of each individual varies and adaptively changes in time in the population. Inspired by this fact, we thus consider a new coevolution setup of game strategy and vertex weight on a square lattice. In detail, we model the structured population on a square lattice, on which the role or influence of each individual is depicted by vertex weight, and the prisoner's dilemma game has been applied to describe the social dilemma of pairwise interactions of players. Through numerical simulation, we conclude that our coevolution setup can promote the evolution of cooperation effectively. Especially, there exists a moderate value of δ for each ε that can warrant an optimal resolution of social dilemma. For a further understanding of these results, we find that intermediate value of δ enables the strongest heterogeneous distribution of vertex weight. We hope our coevolution setup of vertex weight will provide new insight for the future research.

NPSNET: Dynamic Terrain and Cultured Feature Depiction

DTIC Science & Technology

1992-09-01

defaults. bridge(terrain *ptr, vertex pos, bridge mattype bmat ); This constructor takes only the pointer to the underlying terrain, a placement, and a...material to use for construction. bridge(terrain *ptr, vertex pos, bridge-mattype bmat , float dir); This constructor takes a terrain pointer, a...placement position, a material to use, and a direction to run. bridge(terrain *ptr, vertex pos, bridge-mattype bmat , float dir, float width, float height

The unique and shared contributions of arithmetic operation understanding and numerical magnitude representation to children's mathematics achievement.

PubMed

Wong, Terry Tin-Yau

2017-12-01

The current study examined the unique and shared contributions of arithmetic operation understanding and numerical magnitude representation to children's mathematics achievement. A sample of 124 fourth graders was tested on their arithmetic operation understanding (as reflected by their understanding of arithmetic principles and the knowledge about the application of arithmetic operations) and their precision of rational number magnitude representation. They were also tested on their mathematics achievement and arithmetic computation performance as well as the potential confounding factors. The findings suggested that both arithmetic operation understanding and numerical magnitude representation uniquely predicted children's mathematics achievement. The findings highlight the significance of arithmetic operation understanding in mathematics learning. Copyright © 2017 Elsevier Inc. All rights reserved.

Vertex operator algebras of Argyres-Douglas theories from M5-branes

NASA Astrophysics Data System (ADS)

Song, Jaewon; Xie, Dan; Yan, Wenbin

2017-12-01

We study aspects of the vertex operator algebra (VOA) corresponding to Argyres-Douglas (AD) theories engineered using the 6d N=(2, 0) theory of type J on a punctured sphere. We denote the AD theories as ( J b [ k], Y), where J b [ k] and Y represent an irregular and a regular singularity respectively. We restrict to the `minimal' case where J b [ k] has no associated mass parameters, and the theory does not admit any exactly marginal deformations. The VOA corresponding to the AD theory is conjectured to be the W-algebra W^{k_{2d}}(J, Y ) , where {k}_{2d}=-h+b/b+k with h being the dual Coxeter number of J. We verify this conjecture by showing that the Schur index of the AD theory is identical to the vacuum character of the corresponding VOA, and the Hall-Littlewood index computes the Hilbert series of the Higgs branch. We also find that the Schur and Hall-Littlewood index for the AD theory can be written in a simple closed form for b = h. We also test the conjecture that the associated variety of such VOA is identical to the Higgs branch. The M5-brane construction of these theories and the corresponding TQFT structure of the index play a crucial role in our computations.

Incremental k-core decomposition: Algorithms and evaluation

DOE PAGES

Sariyuce, Ahmet Erdem; Gedik, Bugra; Jacques-SIlva, Gabriela; ...

2016-02-01

A k-core of a graph is a maximal connected subgraph in which every vertex is connected to at least k vertices in the subgraph. k-core decomposition is often used in large-scale network analysis, such as community detection, protein function prediction, visualization, and solving NP-hard problems on real networks efficiently, like maximal clique finding. In many real-world applications, networks change over time. As a result, it is essential to develop efficient incremental algorithms for dynamic graph data. In this paper, we propose a suite of incremental k-core decomposition algorithms for dynamic graph data. These algorithms locate a small subgraph that ismore » guaranteed to contain the list of vertices whose maximum k-core values have changed and efficiently process this subgraph to update the k-core decomposition. We present incremental algorithms for both insertion and deletion operations, and propose auxiliary vertex state maintenance techniques that can further accelerate these operations. Our results show a significant reduction in runtime compared to non-incremental alternatives. We illustrate the efficiency of our algorithms on different types of real and synthetic graphs, at varying scales. Furthermore, for a graph of 16 million vertices, we observe relative throughputs reaching a million times, relative to the non-incremental algorithms.« less

Oriented matroids—combinatorial structures underlying loop quantum gravity

NASA Astrophysics Data System (ADS)

Brunnemann, Johannes; Rideout, David

2010-10-01

We analyze combinatorial structures which play a central role in determining spectral properties of the volume operator (Ashtekar A and Lewandowski J 1998 Adv. Theor. Math. Phys. 1 388) in loop quantum gravity (LQG). These structures encode geometrical information of the embedding of arbitrary valence vertices of a graph in three-dimensional Riemannian space and can be represented by sign strings containing relative orientations of embedded edges. We demonstrate that these signature factors are a special representation of the general mathematical concept of an oriented matroid (Ziegler G M 1998 Electron. J. Comb.; Björner A et al 1999 Oriented Matroids (Cambridge: Cambridge University Press)). Moreover, we show that oriented matroids can also be used to describe the topology (connectedness) of directed graphs. Hence, the mathematical methods developed for oriented matroids can be applied to the difficult combinatorics of embedded graphs underlying the construction of LQG. As a first application we revisit the analysis of Brunnemann and Rideout (2008 Class. Quantum Grav. 25 065001 and 065002), and find that enumeration of all possible sign configurations used there is equivalent to enumerating all realizable oriented matroids of rank 3 (Ziegler G M 1998 Electron. J. Comb.; Björner A et al 1999 Oriented Matroids (Cambridge: Cambridge University Press)), and thus can be greatly simplified. We find that for 7-valent vertices having no coplanar triples of edge tangents, the smallest non-zero eigenvalue of the volume spectrum does not grow as one increases the maximum spin jmax at the vertex, for any orientation of the edge tangents. This indicates that, in contrast to the area operator, considering large jmax does not necessarily imply large volume eigenvalues. In addition we give an outlook to possible starting points for rewriting the combinatorics of LQG in terms of oriented matroids.

Representations and evolutionary operators for the scheduling of pump operations in water distribution networks.

PubMed

López-Ibáñez, Manuel; Prasad, T Devi; Paechter, Ben

2011-01-01

Reducing the energy consumption of water distribution networks has never had more significance. The greatest energy savings can be obtained by carefully scheduling the operations of pumps. Schedules can be defined either implicitly, in terms of other elements of the network such as tank levels; or explicitly, by specifying the time during which each pump is on/off. The traditional representation of explicit schedules is a string of binary values with each bit representing pump on/off status during a particular time interval. In this paper, we formally define and analyze two new explicit representations based on time-controlled triggers, where the maximum number of pump switches is established beforehand and the schedule may contain fewer than the maximum number of switches. In these representations, a pump schedule is divided into a series of integers with each integer representing the number of hours for which a pump is active/inactive. This reduces the number of potential schedules compared to the binary representation, and allows the algorithm to operate on the feasible region of the search space. We propose evolutionary operators for these two new representations. The new representations and their corresponding operations are compared with the two most-used representations in pump scheduling, namely, binary representation and level-controlled triggers. A detailed statistical analysis of the results indicates which parameters have the greatest effect on the performance of evolutionary algorithms. The empirical results show that an evolutionary algorithm using the proposed representations is an improvement over the results obtained by a recent state of the art hybrid genetic algorithm for pump scheduling using level-controlled triggers.

The relations between network-operation and topological-property in a scale-free and small-world network with community structure

NASA Astrophysics Data System (ADS)

Ma, Fei; Yao, Bing

2017-10-01

It is always an open, demanding and difficult task for generating available model to simulate dynamical functions and reveal inner principles from complex systems and networks. In this article, due to lots of real-life and artificial networks are built from series of simple and small groups (components), we discuss some interesting and helpful network-operation to generate more realistic network models. In view of community structure (modular topology), we present a class of sparse network models N(t , m) . At the moment, we capture the fact the N(t , 4) has not only scale-free feature, which means that the probability that a randomly selected vertex with degree k decays as a power-law, following P(k) ∼k-γ, where γ is the degree exponent, but also small-world property, which indicates that the typical distance between two uniform randomly chosen vertices grows proportionally to logarithm of the order of N(t , 4) , namely, relatively shorter diameter and lower average path length, simultaneously displays higher clustering coefficient. Next, as a new topological parameter correlating to reliability, synchronization capability and diffusion properties of networks, the number of spanning trees over a network is studied in more detail, an exact analytical solution for the number of spanning trees of the N(t , 4) is obtained. Based on the network-operation, part hub-vertex linking with each other will be helpful for structuring various network models and investigating the rules related with real-life networks.

Long-lived particle searches in R-parity violating MSSM

NASA Astrophysics Data System (ADS)

Zwane, Nosiphiwo

2017-10-01

In this paper we study the constraints on MSSM R-Parity violating decays when the lightest superpartner (LSP) is moderately long lived. In this scenario the LSP vertex displacement may be observed at the LHC. We compute limits on the RPV Yukawa couplings for which the vertex displacement signature maybe used. We then use ATLAS and CMS displaced vertex, meta-stable and prompt decay searches to rule out a region of sparticle masses.

The Vertex Version of Weighted Wiener Number for Bicyclic Molecular Structures

PubMed Central

Gao, Wei

2015-01-01

Graphs are used to model chemical compounds and drugs. In the graphs, each vertex represents an atom of molecule and edges between the corresponding vertices are used to represent covalent bounds between atoms. We call such a graph, which is derived from a chemical compound, a molecular graph. Evidence shows that the vertex-weighted Wiener number, which is defined over this molecular graph, is strongly correlated to both the melting point and boiling point of the compounds. In this paper, we report the extremal vertex-weighted Wiener number of bicyclic molecular graph in terms of molecular structural analysis and graph transformations. The promising prospects of the application for the chemical and pharmacy engineering are illustrated by theoretical results achieved in this paper. PMID:26640513

Detecting Corresponding Vertex Pairs between Planar Tessellation Datasets with Agglomerative Hierarchical Cell-Set Matching.

PubMed

Huh, Yong; Yu, Kiyun; Park, Woojin

2016-01-01

This paper proposes a method to detect corresponding vertex pairs between planar tessellation datasets. Applying an agglomerative hierarchical co-clustering, the method finds geometrically corresponding cell-set pairs from which corresponding vertex pairs are detected. Then, the map transformation is performed with the vertex pairs. Since these pairs are independently detected for each corresponding cell-set pairs, the method presents improved matching performance regardless of locally uneven positional discrepancies between dataset. The proposed method was applied to complicated synthetic cell datasets assumed as a cadastral map and a topographical map, and showed an improved result with the F-measures of 0.84 comparing to a previous matching method with the F-measure of 0.48.

Hamiltonian Cycle Enumeration via Fermion-Zeon Convolution

NASA Astrophysics Data System (ADS)

Staples, G. Stacey

2017-12-01

Beginning with a simple graph having finite vertex set V, operators are induced on fermion and zeon algebras by the action of the graph's adjacency matrix and combinatorial Laplacian on the vector space spanned by the graph's vertices. When the graph is simple (undirected with no loops or multiple edges), the matrices are symmetric and the induced operators are self-adjoint. The goal of the current paper is to recover a number of known graph-theoretic results from quantum observables constructed as linear operators on fermion and zeon Fock spaces. By considering an "indeterminate" fermion/zeon Fock space, a fermion-zeon convolution operator is defined whose trace recovers the number of Hamiltonian cycles in the graph. This convolution operator is a quantum observable whose expectation reveals the number of Hamiltonian cycles in the graph.

Intensity modulated operating mode of the rotating gamma system.

PubMed

Sengupta, Bishwambhar; Gulyas, Laszlo; Medlin, Donald; Koroknai, Tibor; Takacs, David; Filep, Gyorgy; Panko, Peter; Godo, Bence; Hollo, Tamas; Zheng, Xiao Ran; Fedorcsak, Imre; Dobai, Jozsef; Bognar, Laszlo; Takacs, Endre

2018-05-01

The purpose of this work was to explore two novel operation modalities of the rotating gamma systems (RGS) that could expand its clinical application to lesions in close proximity to critical organs at risk (OAR). The approach taken in this study consists of two components. First, a Geant4-based Monte Carlo (MC) simulation toolkit is used to model the dosimetric properties of the RGS Vertex 360™ for the normal, intensity modulated radiosurgery (IMRS), and speed modulated radiosurgery (SMRS) operation modalities. Second, the RGS Vertex 360™ at the Rotating Gamma Institute in Debrecen, Hungary is used to collect experimental data for the normal and IMRS operation modes. An ion chamber is used to record measurements of the absolute dose. The dose profiles are measured using Gafchromic EBT3 films positioned within a spherical water equivalent phantom. A strong dosimetric agreement between the measured and simulated dose profiles and penumbra was found for both the normal and IMRS operation modes for all collimator sizes (4, 8, 14, and 18 mm diameter). The simulated falloff and maximum dose regions agree better with the experimental results for the 4 and 8 mm diameter collimators. Although the falloff regions align well in the 14 and 18 mm collimators, the maximum dose regions have a larger difference. For the IMRS operation mode, the simulated and experimental dose distributions are ellipsoidal, where the short axis aligns with the blocked angles. Similarly, the simulated dose distributions for the SMRS operation mode also adopt an ellipsoidal shape, where the short axis aligns with the angles where the orbital speed is highest. For both modalities, the dose distribution is highly constrained with a sharper penumbra along the short axes. Dose modulation of the RGS can be achieved with the IMRS and SMRS modes. By providing a highly constrained dose distribution with a sharp penumbra, both modes could be clinically applicable for the treatment of lesions in close proximity to critical OARs. © 2018 American Association of Physicists in Medicine.

Properties of heuristic search strategies

NASA Technical Reports Server (NTRS)

Vanderbrug, G. J.

1973-01-01

A directed graph is used to model the search space of a state space representation with single input operators, an AND/OR is used for problem reduction representations, and a theorem proving graph is used for state space representations with multiple input operators. These three graph models and heuristic strategies for searching them are surveyed. The completeness, admissibility, and optimality properties of search strategies which use the evaluation function f = (1 - omega)g = omega(h) are presented and interpreted using a representation of the search process in the plane. The use of multiple output operators to imply dependent successors, and thus obtain a formalism which includes all three types of representations, is discussed.

Migdal's theorem and electron-phonon vertex corrections in Dirac materials

NASA Astrophysics Data System (ADS)

Roy, Bitan; Sau, Jay D.; Das Sarma, S.

2014-04-01

Migdal's theorem plays a central role in the physics of electron-phonon interactions in metals and semiconductors, and has been extensively studied theoretically for parabolic band electronic systems in three-, two-, and one-dimensional systems over the last fifty years. In the current work, we theoretically study the relevance of Migdal's theorem in graphene and Weyl semimetals which are examples of 2D and 3D Dirac materials, respectively, with linear and chiral band dispersion. Our work also applies to 2D and 3D topological insulator systems. In Fermi liquids, the renormalization of the electron-phonon vertex scales as the ratio of sound (vs) to Fermi (vF) velocity, which is typically a small quantity. In two- and three-dimensional quasirelativistic systems, such as undoped graphene and Weyl semimetals, the one loop electron-phonon vertex renormalization, which also scales as η =vs/vF as η →0, is, however, enhanced by an ultraviolet logarithmic divergent correction, arising from the linear, chiral Dirac band dispersion. Such enhancement of the electron-phonon vertex can be significantly softened due to the logarithmic increment of the Fermi velocity, arising from the long range Coulomb interaction, and therefore, the electron-phonon vertex correction does not have a logarithmic divergence at low energy. Otherwise, the Coulomb interaction does not lead to any additional renormalization of the electron-phonon vertex. Therefore, electron-phonon vertex corrections in two- and three-dimensional Dirac fermionic systems scale as vs/vF0, where vF0 is the bare Fermi velocity, and small when vs≪vF0. These results, although explicitly derived for the intrinsic undoped systems, should hold even when the chemical potential is tuned away from the Dirac points.

Hubble Space Telescope secondary mirror vertex radius/conic constant test

NASA Technical Reports Server (NTRS)

Parks, Robert

1991-01-01

The Hubble Space Telescope backup secondary mirror was tested to determine the vertex radius and conic constant. Three completely independent tests (to the same procedure) were performed. Similar measurements in the three tests were highly consistent. The values obtained for the vertex radius and conic constant were the nominal design values within the error bars associated with the tests. Visual examination of the interferometric data did not show any measurable zonal figure error in the secondary mirror.

Characteristic angles in the wetting of an angular region: deposit growth.

PubMed

Popov, Yuri O; Witten, Thomas A

2003-09-01

Solids dispersed in a drying drop migrate to the (pinned) contact line. This migration is caused by outward flows driven by the loss of the solvent due to evaporation and by geometrical constraint that the drop maintains an equilibrium surface shape with a fixed boundary. Here, in continuation of our earlier paper, we theoretically investigate the evaporation rate, the flow field, and the rate of growth of the deposit patterns in a drop over an angular sector on a plane substrate. Asymptotic power laws near the vertex (as distance to the vertex goes to zero) are obtained. A hydrodynamic model of fluid flow near the singularity of the vertex is developed and the velocity field is obtained. The rate of the deposit growth near the contact line is found in two time regimes. The deposited mass falls off as a weak power gamma of distance close to the vertex and as a stronger power beta of distance further from the vertex. The power gamma depends only slightly on the opening angle alpha and stays roughly between -1/3 and 0. The power beta varies from -1 to 0 as the opening angle increases from 0 degrees to 180 degrees. At a given distance from the vertex, the deposited mass grows faster and faster with time, with the greatest increase in the growth rate occurring at the early stages of the drying process.

Increasing Stability and Activity of Core-Shell Catalysts by Preferential Segregation of Oxide on Edges and Vertexes: Oxygen Reduction on Ti-Au@Pt/C

DOE PAGES

Hu, J.; Wu, L.; Kuttiyiel, K.; ...

2016-06-30

We describe a new class of core-shell nanoparticle catalysts having edges and vertexes covered by refractory metal oxide that preferentially segregates onto these catalyst sites. The monolayer shell is deposited on the oxidefree core atoms. The oxide on edges and vertexes induces high catalyst’s stability and activity. The catalyst and synthesis are exemplified by fabrication of Au nanoparticles doped by Ti atoms that segregate as oxide onto low–coordination sites of edges and vertexes. Pt monolayer shell deposited on Au sites has the mass and specific activities for the oxygen reduction reaction about 13 and 5 times higher than those ofmore » commercial Pt/C catalysts. The durability tests show no activity loss after 10000 potential cycles from 0.6 to 1.0V. The superior activity and durability of the Ti-Au@Pt catalyst originate from protective Ti oxide located at the most dissolution-prone edge and vertex sites, and Au-supported active and stable Pt shell.« less

Vertex Models of Epithelial Morphogenesis

PubMed Central

Fletcher, Alexander G.; Osterfield, Miriam; Baker, Ruth E.; Shvartsman, Stanislav Y.

2014-01-01

The dynamic behavior of epithelial cell sheets plays a central role during numerous developmental processes. Genetic and imaging studies of epithelial morphogenesis in a wide range of organisms have led to increasingly detailed mechanisms of cell sheet dynamics. Computational models offer a useful means by which to investigate and test these mechanisms, and have played a key role in the study of cell-cell interactions. A variety of modeling approaches can be used to simulate the balance of forces within an epithelial sheet. Vertex models are a class of such models that consider cells as individual objects, approximated by two-dimensional polygons representing cellular interfaces, in which each vertex moves in response to forces due to growth, interfacial tension, and pressure within each cell. Vertex models are used to study cellular processes within epithelia, including cell motility, adhesion, mitosis, and delamination. This review summarizes how vertex models have been used to provide insight into developmental processes and highlights current challenges in this area, including progressing these models from two to three dimensions and developing new tools for model validation. PMID:24896108

Pose-oblivious shape signature.

PubMed

Gal, Ran; Shamir, Ariel; Cohen-Or, Daniel

2007-01-01

A 3D shape signature is a compact representation for some essence of a shape. Shape signatures are commonly utilized as a fast indexing mechanism for shape retrieval. Effective shape signatures capture some global geometric properties which are scale, translation, and rotation invariant. In this paper, we introduce an effective shape signature which is also pose-oblivious. This means that the signature is also insensitive to transformations which change the pose of a 3D shape such as skeletal articulations. Although some topology-based matching methods can be considered pose-oblivious as well, our new signature retains the simplicity and speed of signature indexing. Moreover, contrary to topology-based methods, the new signature is also insensitive to the topology change of the shape, allowing us to match similar shapes with different genus. Our shape signature is a 2D histogram which is a combination of the distribution of two scalar functions defined on the boundary surface of the 3D shape. The first is a definition of a novel function called the local-diameter function. This function measures the diameter of the 3D shape in the neighborhood of each vertex. The histogram of this function is an informative measure of the shape which is insensitive to pose changes. The second is the centricity function that measures the average geodesic distance from one vertex to all other vertices on the mesh. We evaluate and compare a number of methods for measuring the similarity between two signatures, and demonstrate the effectiveness of our pose-oblivious shape signature within a 3D search engine application for different databases containing hundreds of models.

Attribute-based Decision Graphs: A framework for multiclass data classification.

PubMed

Bertini, João Roberto; Nicoletti, Maria do Carmo; Zhao, Liang

2017-01-01

Graph-based algorithms have been successfully applied in machine learning and data mining tasks. A simple but, widely used, approach to build graphs from vector-based data is to consider each data instance as a vertex and connecting pairs of it using a similarity measure. Although this abstraction presents some advantages, such as arbitrary shape representation of the original data, it is still tied to some drawbacks, for example, it is dependent on the choice of a pre-defined distance metric and is biased by the local information among data instances. Aiming at exploring alternative ways to build graphs from data, this paper proposes an algorithm for constructing a new type of graph, called Attribute-based Decision Graph-AbDG. Given a vector-based data set, an AbDG is built by partitioning each data attribute range into disjoint intervals and representing each interval as a vertex. The edges are then established between vertices from different attributes according to a pre-defined pattern. Classification is performed through a matching process among the attribute values of the new instance and AbDG. Moreover, AbDG provides an inner mechanism to handle missing attribute values, which contributes for expanding its applicability. Results of classification tasks have shown that AbDG is a competitive approach when compared to well-known multiclass algorithms. The main contribution of the proposed framework is the combination of the advantages of attribute-based and graph-based techniques to perform robust pattern matching data classification, while permitting the analysis the input data considering only a subset of its attributes. Copyright © 2016 Elsevier Ltd. All rights reserved.

Topics in Covariant Closed String Field Theory and Two-Dimensional Quantum Gravity

NASA Astrophysics Data System (ADS)

Saadi, Maha

1991-01-01

The closed string field theory based on the Witten vertex is found to be nonpolynomial in order to reproduce all tree amplitudes correctly. The interactions have a geometrical pattern of overlaps, which can be thought as the edges of a spherical polyhedron with face-perimeters equal to 2pi. At each vertex of the polyhedron there are three faces, thus all elementary interactions are cubic in the sense that at most three strings can coincide at a point. The quantum action is constructed by substracting counterterms which cancel the overcounting of moduli space, and by adding loop vertices in such a way no possible surfaces are missed. A counterterm that gives the correct one-string one-loop amplitude is formulated. The lowest order loop vertices are analyzed in the cases of genus one and two. Also, a one-loop two -string counterterm that restores BRST invariance to the respective scattering amplitude is constructed. An attempt to understand the formulation of two -dimensional pure gravity from the discrete representation of a two-dimensional surface is made. This is considered as a toy model of string theory. A well-defined mathematical model is used. Its continuum limit cannot be naively interpreted as pure gravity because each term of the sum over surfaces is not positive definite. The model, however, could be considered as an analytic continuation of the standard matrix model formulation of gravity. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.).

Community Detection Algorithm Combining Stochastic Block Model and Attribute Data Clustering

NASA Astrophysics Data System (ADS)

Kataoka, Shun; Kobayashi, Takuto; Yasuda, Muneki; Tanaka, Kazuyuki

2016-11-01

We propose a new algorithm to detect the community structure in a network that utilizes both the network structure and vertex attribute data. Suppose we have the network structure together with the vertex attribute data, that is, the information assigned to each vertex associated with the community to which it belongs. The problem addressed this paper is the detection of the community structure from the information of both the network structure and the vertex attribute data. Our approach is based on the Bayesian approach that models the posterior probability distribution of the community labels. The detection of the community structure in our method is achieved by using belief propagation and an EM algorithm. We numerically verified the performance of our method using computer-generated networks and real-world networks.

Application of laser differential confocal technique in back vertex power measurement for phoropters

NASA Astrophysics Data System (ADS)

Li, Fei; Li, Lin; Ding, Xiang; Liu, Wenli

2012-10-01

A phoropter is one of the most popular ophthalmic instruments used in optometry and the back vertex power (BVP) is one of the most important parameters to evaluate the refraction characteristics of a phoropter. In this paper, a new laser differential confocal vertex-power measurement method which takes advantage of outstanding focusing ability of laser differential confocal (LDC) system is proposed for measuring the BVP of phoropters. A vertex power measurement system is built up. Experimental results are presented and some influence factor is analyzed. It is demonstrated that the method based on LDC technique has higher measurement precision and stronger environmental anti-interference capability compared to existing methods. Theoretical analysis and experimental results indicate that the measurement error of the method is about 0.02m-1.

Graph characterization via Ihara coefficients.

PubMed

Ren, Peng; Wilson, Richard C; Hancock, Edwin R

2011-02-01

The novel contributions of this paper are twofold. First, we demonstrate how to characterize unweighted graphs in a permutation-invariant manner using the polynomial coefficients from the Ihara zeta function, i.e., the Ihara coefficients. Second, we generalize the definition of the Ihara coefficients to edge-weighted graphs. For an unweighted graph, the Ihara zeta function is the reciprocal of a quasi characteristic polynomial of the adjacency matrix of the associated oriented line graph. Since the Ihara zeta function has poles that give rise to infinities, the most convenient numerically stable representation is to work with the coefficients of the quasi characteristic polynomial. Moreover, the polynomial coefficients are invariant to vertex order permutations and also convey information concerning the cycle structure of the graph. To generalize the representation to edge-weighted graphs, we make use of the reduced Bartholdi zeta function. We prove that the computation of the Ihara coefficients for unweighted graphs is a special case of our proposed method for unit edge weights. We also present a spectral analysis of the Ihara coefficients and indicate their advantages over other graph spectral methods. We apply the proposed graph characterization method to capturing graph-class structure and clustering graphs. Experimental results reveal that the Ihara coefficients are more effective than methods based on Laplacian spectra.

Regge vertex for quark production in the central rapidity region in the next-to-leading order

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kozlov, M. G., E-mail: M.G.Kozlov@inp.nsk.su; Reznichenko, A. V., E-mail: A.V.Reznichenko@inp.nsk.su

2016-03-15

The effective vertex for quark production in the interaction of a Reggeized quark and a Reggeized gluon is calculated in the next-to-leading order (NLO). The resulting vertex is the missing component of the NLO multi-Regge amplitude featuring quark and gluon exchanges in the t channels. This calculation will make it possible to develop in future the bootstrap approach to proving quark Reggeization in the next-to-leading logarithmic approximation.

NLO vertex for a forward jet plus a rapidity gap at high energies

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hentschinski, Martin; Madrigal Martínez, José Daniel; Murdaca, Beatrice

Here we present the calculation of the forward jet vertex associated to a rapidity gap (coupling of a hard pomeron to the jet) in the BFKL formalism at next-to-leading order (NLO). Real emission contributions are computed via Lipatov’s effective action. The NLO jet vertex turns out to be finite within collinear factorization and allows, together with the NLO non-forward gluon Green’s function, to perform NLO studies of jet production in diffractive events (e.g. Mueller-Tang dijets).

NLO vertex for a forward jet plus a rapidity gap at high energies

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hentschinski, Martin; Madrigal Martínez, José Daniel; Murdaca, Beatrice

We present the calculation of the forward jet vertex associated to a rapidity gap (coupling of a hard pomeron to the jet) in the BFKL formalism at next-to-leading order (NLO). Real emission contributions are computed via Lipatov’s effective action. The NLO jet vertex turns out to be finite within collinear factorization and allows, together with the NLO non-forward gluon Green’s function, to perform NLO studies of jet production in diffractive events (e.g. Mueller-Tang dijets)

To problem of the definition of the boundary surface of confidence regions in non-linear case. (Russian Title: К задаче определения граничной поверхности доверительной области в нелинейном случае)

NASA Astrophysics Data System (ADS)

Syusina, O. M.; Chernitsov, A. M.; Tamarov, V. A.

2011-07-01

The method for construction of the confidence region of the motion of the small bodies of Solar system by force of defini-tion region their boundary surface in nonlinear case is proposed. In this method representation on to boundary surface of the re-gion, which obtained of nonlinear method of multiple solution of least squares problem, is realized by values of target function in vertex of confidence ellipsoid with eliminating of anomalous ones.

Decomposition of the polynomial kernel of arbitrary higher spin Dirac operators

DOE Office of Scientific and Technical Information (OSTI.GOV)

Eelbode, D., E-mail: David.Eelbode@ua.ac.be; Raeymaekers, T., E-mail: Tim.Raeymaekers@UGent.be; Van der Jeugt, J., E-mail: Joris.VanderJeugt@UGent.be

2015-10-15

In a series of recent papers, we have introduced higher spin Dirac operators, which are generalisations of the classical Dirac operator. Whereas the latter acts on spinor-valued functions, the former acts on functions taking values in arbitrary irreducible half-integer highest weight representations for the spin group. In this paper, we describe how the polynomial kernel spaces of such operators decompose in irreducible representations of the spin group. We will hereby make use of results from representation theory.

Yangians and Yang-Baxter R-operators for ortho-symplectic superalgebras

NASA Astrophysics Data System (ADS)

Fuksa, J.; Isaev, A. P.; Karakhanyan, D.; Kirschner, R.

2017-04-01

Yang-Baxter relations symmetric with respect to the ortho-symplectic superalgebras are studied. We start with the formulation of graded algebras and the linear superspace carrying the vector (fundamental) representation of the ortho-symplectic supergroup. On this basis we study the analogy of the Yang-Baxter operators considered earlier for the cases of orthogonal and symplectic symmetries: the vector (fundamental) R-matrix, the L-operator defining the Yangian algebra and its first and second order evaluations. We investigate the condition for L (u) in the case of the truncated expansion in inverse powers of u and give examples of Lie algebra representations obeying these conditions. We construct the R-operator intertwining two superspinor representations and study the fusion of L-operators involving the tensor product of such representations.

On the transfer matrix of the supersymmetric eight-vertex model. I. Periodic boundary conditions

NASA Astrophysics Data System (ADS)

Hagendorf, Christian; Liénardy, Jean

2018-03-01

The square-lattice eight-vertex model with vertex weights a, b, c, d obeying the relation (a^2+ab)(b^2+ab) = (c^2+ab)(d^2+ab) and periodic boundary conditions is considered. It is shown that the transfer matrix of the model for L  =  2n  +  1 vertical lines and periodic boundary conditions along the horizontal direction possesses the doubly degenerate eigenvalue \\Thetan = (a+b){\\hspace{0pt}}2n+1 . This proves a conjecture by Stroganov from 2001. The proof uses the supersymmetry of a related XYZ spin-chain Hamiltonian. The eigenstates of the transfer matrix corresponding to \\Thetan are shown to be the ground states of the spin-chain Hamiltonian. Moreover, for positive vertex weights \\Thetan is the largest eigenvalue of the transfer matrix.

Towards ab initio Calculations with the Dynamical Vertex Approximation

NASA Astrophysics Data System (ADS)

Galler, Anna; Kaufmann, Josef; Gunacker, Patrik; Pickem, Matthias; Thunström, Patrik; Tomczak, Jan M.; Held, Karsten

2018-04-01

While key effects of the many-body problem — such as Kondo and Mott physics — can be understood in terms of on-site correlations, non-local fluctuations of charge, spin, and pairing amplitudes are at the heart of the most fascinating and unresolved phenomena in condensed matter physics. Here, we review recent progress in diagrammatic extensions to dynamical mean-field theory for ab initio materials calculations. We first recapitulate the quantum field theoretical background behind the two-particle vertex. Next we discuss latest algorithmic advances in quantum Monte Carlo simulations for calculating such two-particle quantities using worm sampling and vertex asymptotics, before giving an introduction to the ab initio dynamical vertex approximation (AbinitioDΓA). Finally, we highlight the potential of AbinitioDΓA by detailing results for the prototypical correlated metal SrVO3.

Vertex evoked potentials in a rating-scale detection task: Relation to signal probability

NASA Technical Reports Server (NTRS)

Squires, K. C.; Squires, N. K.; Hillyard, S. A.

1974-01-01

Vertex evoked potentials were recorded from human subjects performing in an auditory detection task with rating scale responses. Three values of a priori probability of signal presentation were tested. The amplitudes of the N1 and P3 components of the vertex potential associated with correct detections of the signal were found to be systematically related to the strictness of the response criterion and independent of variations in a priori signal probability. No similar evoked potential components were found associated with signal absent judgements (misses and correct rejections) regardless of the confidence level of the judgement or signal probability. These results strongly support the contention that the form of the vertex evoked response is closely correlated with the subject's psychophysical decision regarding the presence or absence of a threshold level signal.

High Performance Automatic Character Skinning Based on Projection Distance

NASA Astrophysics Data System (ADS)

Li, Jun; Lin, Feng; Liu, Xiuling; Wang, Hongrui

2018-03-01

Skeleton-driven-deformation methods have been commonly used in the character deformations. The process of painting skin weights for character deformation is a long-winded task requiring manual tweaking. We present a novel method to calculate skinning weights automatically from 3D human geometric model and corresponding skeleton. The method first, groups each mesh vertex of 3D human model to a skeleton bone by the minimum distance from a mesh vertex to each bone. Secondly, calculates each vertex's weights to the adjacent bones by the vertex's projection point distance to the bone joints. Our method's output can not only be applied to any kind of skeleton-driven deformation, but also to motion capture driven (mocap-driven) deformation. Experiments results show that our method not only has strong generality and robustness, but also has high performance.

Modeling & Informatics at Vertex Pharmaceuticals Incorporated: our philosophy for sustained impact

NASA Astrophysics Data System (ADS)

McGaughey, Georgia; Patrick Walters, W.

2017-03-01

Molecular modelers and informaticians have the unique opportunity to integrate cross-functional data using a myriad of tools, methods and visuals to generate information. Using their drug discovery expertise, information is transformed to knowledge that impacts drug discovery. These insights are often times formulated locally and then applied more broadly, which influence the discovery of new medicines. This is particularly true in an organization where the members are exposed to projects throughout an organization, such as in the case of the global Modeling & Informatics group at Vertex Pharmaceuticals. From its inception, Vertex has been a leader in the development and use of computational methods for drug discovery. In this paper, we describe the Modeling & Informatics group at Vertex and the underlying philosophy, which has driven this team to sustain impact on the discovery of first-in-class transformative medicines.

[Umbilical blood-gas status at cesarean section for breech presentation: a comparison with vertex presentation].

PubMed

Haruta, M; Saeki, N; Naka, Y; Funato, T; Ohtsuki, Y

1989-10-01

Umbilical blood-gas status at elective cesarean section with oxygen inhalation for breech presentation (25 cases) was compared with that for vertex presentation (25 cases), so as to confirm the security of full-term breech fetuses delivered by cesarean section under spinal anesthesia. Umbilical arterial oxygen levels were significantly lower in the breech group (Mean PO2:18.9 mmHg; SO2:37.3%; Oxygen content:7.6 ml/dl). The number of hypoxemic fetuses was significantly higher in the breech group (the breech: 7; the vertex; 0). The other umbilical blood-gas values revealed no significant differences between the breech and vertex groups, and were within normal limits in both groups. Oxygen extraction in the breech (Mean: 49.0%) was higher than that in the vertex (32.9%). Therefore decreased umbilical blood flow in the breech was suggested. The incidence of depression at 1 minute after delivery in the breech infants (24%) was significantly higher than that in the vertex infants (0%). It became obvious in the breech that as the interval between the uterine incision and delivery increased, umbilical arterial blood tended to acidosis and the 1 minute Apgar score decreased. Cesarean section for breech presentation requires sufficient and optimal incisions of the abdominal wall and uterus as well as a skillful manual delivery technique, because the fetus or neonate should be protected against asphyxia resulting from umbilical compression and prolonged delivery interval.

Is it possible to detect malposition of the vertex at an early stage in labour? A case-control study.

PubMed

Mathisen, Marit; Olsen, Rudi Valde; Andreasen, Stine; Nielsen, Erik Waage

2014-12-01

The aim of this study was to investigate if there are clinical signs which allow detection of malposition of the vertex on admission to the delivery unit, or when crossing the action line on the partogram. Case-control study from 2007 to 2010 conducted on the delivery unit of Nordland Hospital, Bodø. Labours with malposition of the vertex (n = 171) were compared with a group with normal vertex presentation (n = 165). The positive predictive value was estimated for each sign using Bayes' rule. Magnitude of positive predictive value for each clinical sign. The positive predictive values for malposition were 9% if the foetus were in a right position, 11% if the labour was induced, 5% if the foetus was above the ischial spines, 4% if the reason for admission was contractions and 6% if cervix was <3 cm. The ability of clinical assessment to predict malposition, either on admission or when crossing the action line on the partogram, was poor. Diagnosing malposition of the vertex requires other methods with a higher predictive value. Copyright © 2014 Elsevier B.V. All rights reserved.

Vertex stability and topological transitions in vertex models of foams and epithelia

NASA Astrophysics Data System (ADS)

Spencer, Meryl; Jabeen, Zahera; Lubensky, David

Vertex models are widely used to computationally simulate dry foams and epithelial tissues. This class of models describes the shape and motion of cells as a function of the forces on vertices where 3 or more cells meet. Despite the widespread use of these models, relatively little is known about their basic theoretical properties. One outstanding issue is the stability of fourfold vertices. In real foams, fourfold vertices are always unstable, but it has been unclear whether vertex models necessarily reflect this behavior. In biological tissues, fourfold vertices arise as an intermediate in T1 transitions, which are one of the fundamental processes by which tissues change topology, and stable fourfold vertices have recently been observed in several different epithelia. We show that, when all edges have the same tension, stationary fourfold vertices in vertex models must always break up. However, when tensions depend on edge orientation, as they might in a planar-polarized tissue, fourfold vertices can become stable. These findings pave the way for studies of more biologically realistic models that couple topological transitions to the dynamics of regulatory proteins. NSF Grant No. DMR-1056456 and NSF-GRFP Grant No. DGE-1256260.

A neural network z-vertex trigger for Belle II

NASA Astrophysics Data System (ADS)

Neuhaus, S.; Skambraks, S.; Abudinen, F.; Chen, Y.; Feindt, M.; Frühwirth, R.; Heck, M.; Kiesling, C.; Knoll, A.; Paul, S.; Schieck, J.

2015-05-01

We present the concept of a track trigger for the Belle II experiment, based on a neural network approach, that is able to reconstruct the z (longitudinal) position of the event vertex within the latency of the first level trigger. The trigger will thus be able to suppress a large fraction of the dominating background from events outside of the interaction region. The trigger uses the drift time information of the hits from the Central Drift Chamber (CDC) of Belle II within narrow cones in polar and azimuthal angle as well as in transverse momentum (sectors), and estimates the z-vertex without explicit track reconstruction. The preprocessing for the track trigger is based on the track information provided by the standard CDC trigger. It takes input from the 2D (r — φ) track finder, adds information from the stereo wires of the CDC, and finds the appropriate sectors in the CDC for each track in a given event. Within each sector, the z-vertex of the associated track is estimated by a specialized neural network, with a continuous output corresponding to the scaled z-vertex. The input values for the neural network are calculated from the wire hits of the CDC.

Rumor Processes in Random Environment on and on Galton-Watson Trees

NASA Astrophysics Data System (ADS)

Bertacchi, Daniela; Zucca, Fabio

2013-11-01

The aim of this paper is to study rumor processes in random environment. In a rumor process a signal starts from the stations of a fixed vertex (the root) and travels on a graph from vertex to vertex. We consider two rumor processes. In the firework process each station, when reached by the signal, transmits it up to a random distance. In the reverse firework process, on the other hand, stations do not send any signal but they “listen” for it up to a random distance. The first random environment that we consider is the deterministic 1-dimensional tree with a random number of stations on each vertex; in this case the root is the origin of . We give conditions for the survival/extinction on almost every realization of the sequence of stations. Later on, we study the processes on Galton-Watson trees with random number of stations on each vertex. We show that if the probability of survival is positive, then there is survival on almost every realization of the infinite tree such that there is at least one station at the root. We characterize the survival of the process in some cases and we give sufficient conditions for survival/extinction.

Simple vertex correction improves G W band energies of bulk and two-dimensional crystals

NASA Astrophysics Data System (ADS)

Schmidt, Per S.; Patrick, Christopher E.; Thygesen, Kristian S.

2017-11-01

The G W self-energy method has long been recognized as the gold standard for quasiparticle (QP) calculations of solids in spite of the fact that the neglect of vertex corrections and the use of a density-functional theory starting point lack rigorous justification. In this work we remedy this situation by including a simple vertex correction that is consistent with a local-density approximation starting point. We analyze the effect of the self-energy by splitting it into short-range and long-range terms which are shown to govern, respectively, the center and size of the band gap. The vertex mainly improves the short-range correlations and therefore has a small effect on the band gap, while it shifts the band gap center up in energy by around 0.5 eV, in good agreement with experiments. Our analysis also explains how the relative importance of short- and long-range interactions in structures of different dimensionality is reflected in their QP energies. Inclusion of the vertex comes at practically no extra computational cost and even improves the basis set convergence compared to G W . Taken together, the method provides an efficient and rigorous improvement over the G W approximation.

Resumming the large-N approximation for time evolving quantum systems

NASA Astrophysics Data System (ADS)

Mihaila, Bogdan; Dawson, John F.; Cooper, Fred

2001-05-01

In this paper we discuss two methods of resumming the leading and next to leading order in 1/N diagrams for the quartic O(N) model. These two approaches have the property that they preserve both boundedness and positivity for expectation values of operators in our numerical simulations. These approximations can be understood either in terms of a truncation to the infinitely coupled Schwinger-Dyson hierarchy of equations, or by choosing a particular two-particle irreducible vacuum energy graph in the effective action of the Cornwall-Jackiw-Tomboulis formalism. We confine our discussion to the case of quantum mechanics where the Lagrangian is L(x,ẋ)=(12)∑Ni=1x˙2i-(g/8N)[∑Ni=1x2i- r20]2. The key to these approximations is to treat both the x propagator and the x2 propagator on similar footing which leads to a theory whose graphs have the same topology as QED with the x2 propagator playing the role of the photon. The bare vertex approximation is obtained by replacing the exact vertex function by the bare one in the exact Schwinger-Dyson equations for the one and two point functions. The second approximation, which we call the dynamic Debye screening approximation, makes the further approximation of replacing the exact x2 propagator by its value at leading order in the 1/N expansion. These two approximations are compared with exact numerical simulations for the quantum roll problem. The bare vertex approximation captures the physics at large and modest N better than the dynamic Debye screening approximation.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cirac, J. Ignacio; Sierra, German; Instituto de Fisica Teorica, UAM-CSIC, Madrid

We generalize the matrix product states method using the chiral vertex operators of conformal field theory and apply it to study the ground states of the XXZ spin chain, the J{sub 1}-J{sub 2} model and random Heisenberg models. We compute the overlap with the exact wave functions, spin-spin correlators, and the Renyi entropy, showing that critical systems can be described by this method. For rotational invariant ansatzs we construct an inhomogenous extension of the Haldane-Shastry model with long-range exchange interactions.

Diagonalization of transfer matrix of supersymmetry U{sub q}(sl-caret(M+1|N+1)) chain with a boundary

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kojima, Takeo

2013-04-15

We study the supersymmetry U{sub q}(sl-caret(M+1|N+1)) analogue of the supersymmetric t-J model with a boundary. Our approach is based on the algebraic analysis method of solvable lattice models. We diagonalize the commuting transfer matrix by using the bosonizations of the vertex operators associated with the quantum affine supersymmetry U{sub q}(sl-caret(M+1|N+1)).

Results from the First Beam-Induced Reconstructed Tracks in the LHCb Vertex Locator

NASA Astrophysics Data System (ADS)

Rodrigues, E.

2010-04-01

LHCb is a dedicated experiment at the LHC to study CP violation and rare b decays. The vertex locator (VELO) is a silicon strip detector designed to measure precisely the production and decay vertices of B-mesons. The detector is positioned at 8 mm of the LHC beams and will operate in an extremely harsh radiation environment. The VELO consists of two retractable detector halves with 21 silicon micro-strip tracking modules each. A module is composed of two n+-on-n 300 μm thick half disc sensors with R and Φ micro-strip geometry. The detectors are operated in vacuum and a bi-phase CO2 cooling system is used. The full system has been operated since June 2008 and its commissioning experience will be reported. During the LHC synchronization tests in August and September 2008, and June 2009 the LHCb detectors measured secondary particles produced by the interaction of the LHC primary beam on a beam dump. About 50,000 tracks were reconstructed in the VELO and they were used to derive the relative timing alignment between the sensors and for the first evaluation of the spatial alignment. Using this track sample the VELO has been aligned to an accuracy of 5 μm. A single hit resolution of 10 μm was obtained at the smallest pitch for tracks of perpendicular incidence. The design and the main components of the detector system are introduced. The commissioning of the detector is reported and the talk will focus on the results obtained using the first beam-induced reconstructed tracks.

Length-Two Representations of Quantum Affine Superalgebras and Baxter Operators

NASA Astrophysics Data System (ADS)

Zhang, Huafeng

2018-03-01

Associated to quantum affine general linear Lie superalgebras are two families of short exact sequences of representations whose first and third terms are irreducible: the Baxter TQ relations involving infinite-dimensional representations; the extended T-systems of Kirillov-Reshetikhin modules. We make use of these representations over the full quantum affine superalgebra to define Baxter operators as transfer matrices for the quantum integrable model and to deduce Bethe Ansatz Equations, under genericity conditions.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Stewart, H.B.; Ueda, Y.; Grebogi, C.

A crisis is a sudden discontinuous change in a chaotic attractor as a system parameter is varied. We investigate phenomena observed when two parameters of a dissipative system are varied simultaneously, following a crisis along a curve in the parameter plane. Two such curves intersect at a point we call a double crisis vertex. The phenomena we study include the double crisis vertex at which an interior and a boundary crisis coincide, and related forms of double crisis. We show how an experimenter can infer a crisis from observations of other related crises at a vertex.

Connectivity algorithm with depth first search (DFS) on simple graphs

NASA Astrophysics Data System (ADS)

Riansanti, O.; Ihsan, M.; Suhaimi, D.

2018-01-01

This paper discusses an algorithm to detect connectivity of a simple graph using Depth First Search (DFS). The DFS implementation in this paper differs than other research, that is, on counting the number of visited vertices. The algorithm obtains s from the number of vertices and visits source vertex, following by its adjacent vertices until the last vertex adjacent to the previous source vertex. Any simple graph is connected if s equals 0 and disconnected if s is greater than 0. The complexity of the algorithm is O(n2).

The RAVE/VERTIGO vertex reconstruction toolkit and framework

NASA Astrophysics Data System (ADS)

Waltenberger, W.; Mitaroff, W.; Moser, F.; Pflugfelder, B.; Riedel, H. V.

2008-07-01

A detector-independent toolkit for vertex reconstruction (RAVE1) is being developed, along with a standalone framework (VERTIGO2) for testing, analyzing and debugging. The core algorithms represent state-of-the-art for geometric vertex finding and fitting by both linear (Kalman filter) and robust estimation methods. Main design goals are ease of use, flexibility for embedding into existing software frameworks, extensibility, and openness. The implementation is based on modern object-oriented techniques, is coded in C++ with interfaces for Java and Python, and follows an open-source approach. A beta release is available.

Gluing operation and form factors of local operators in N = 4 Super Yang-Mills theory

NASA Astrophysics Data System (ADS)

Bolshov, A. E.

2018-04-01

The gluing operation is an effective way to get form factors of both local and non-local operators starting from different representations of on-shell scattering amplitudes. In this paper it is shown how it works on the example of form factors of operators from stress-tensor operator supermultiplet in Grassmannian and spinor helicity representations.

Report to Congress on Sustainable Ranges, 2011

DTIC Science & Technology

2011-07-01

Interoperation of live participants and their operational systems. `` Realistic LVC representations of non-participant friendly warfighting capabilities...across the full range of military operations (ROMO). `` Realistic LVC representations of opposing forces (OPFOR), neutral, and factional entities that...entities. `` Suitable representations of the real world environment where the warfighting capabilities exist. Table 2-2 Live, Virtual, and

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mozrzymas, Marek; Horodecki, Michał; Studziński, Michał

We consider the structure of algebra of operators, acting in n-fold tensor product space, which are partially transposed on the last term. Using purely algebraical methods we show that this algebra is semi-simple and then, considering its regular representation, we derive basic properties of the algebra. In particular, we describe all irreducible representations of the algebra of partially transposed operators and derive expressions for matrix elements of the representations. It appears that there are two kinds of irreducible representations of the algebra. The first one is strictly connected with the representations of the group S(n − 1) induced by irreduciblemore » representations of the group S(n − 2). The second kind is structurally connected with irreducible representations of the group S(n − 1)« less

Higher-order Fermi-liquid corrections for an Anderson impurity away from half filling : Equilibrium properties

NASA Astrophysics Data System (ADS)

Oguri, Akira; Hewson, A. C.

2018-01-01

We study the low-energy behavior of the vertex function of a single Anderson impurity away from half filling for finite magnetic fields, using the Ward identities with careful consideration of the antisymmetry and analytic properties. The asymptotic form of the vertex function Γσσ';σ'σ(i ω ,i ω';i ω',i ω ) is determined up to terms of linear order with respect to the two frequencies ω and ω', as well as the ω2 contribution for antiparallel spins σ'≠σ at ω'=0 . From these results, we also obtain a series of the Fermi-liquid relations beyond those of Yamada-Yosida [Prog. Theor. Phys. 54, 316 (1975), 10.1143/PTP.54.316]. The ω2 real part of the self-energy Σσ(i ω ) is shown to be expressed in terms of the double derivative ∂2Σσ(0 ) /∂ ɛdσ 2 with respect to the impurity energy level ɛdσ, and agrees with the formula obtained recently by Filippone, Moca, von Delft, and Mora (FMvDM) in the Nozières phenomenological Fermi-liquid theory [Phys. Rev. B 95, 165404 (2017), 10.1103/PhysRevB.95.165404]. We also calculate the T2 correction of the self-energy and find that the real part can be expressed in terms of the three-body correlation function ∂ χ↑↓/∂ ɛd,-σ , where χ↑↓ is the static susceptibility between antiparallel spins. We also provide an alternative derivation of the asymptotic form of the vertex function. Specifically, we calculate the skeleton diagrams for the vertex function Γσσ ;σ σ(i ω ,0 ;0 ,i ω ) for parallel spins up to order U4 in the Coulomb repulsion U . It directly clarifies the fact that the analytic components of order ω vanish as a result of the cancellation of four related Feynman diagrams, which are related to each other through the antisymmetry operation.

Dynamical mass generation in unquenched QED using the Dyson-Schwinger equations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kızılersü, Ayse; Sizer, Tom; Pennington, Michael R.

We present a comprehensive numerical study of dynamical mass generation for unquenched QED in four dimensions, in the absence of four-fermion interactions, using the Dyson-Schwinger approach. We begin with an overview of previous investigations of criticality in the quenched approximation. To this we add an analysis using a new fermion-antifermion-boson interaction ansatz, the Kizilersu-Pennington (KP) vertex, developed for an unquenched treatment. After surveying criticality in previous unquenched studies, we investigate the performance of the KP vertex in dynamical mass generation using a renormalized fully unquenched system of equations. This we compare with the results for two hybrid vertices incorporating themore » Curtis-Pennington vertex in the fermion equation. We conclude that the KP vertex is as yet incomplete, and its relative gauge-variance is due to its lack of massive transverse components in its design.« less

Stress singularities at the vertex of a cylindrically anisotropic wedge

NASA Technical Reports Server (NTRS)

Delale, F.; Erdogan, F.; Boduroglu, H.

1980-01-01

The plane elasticity problem for a cylindrically anisotropic solid is formulated. The form of the solution for an infinite wedge shaped domain with various homogeneous boundary conditions is derived and the nature of the stress singularity at the vertex of the wedge is studied. The characteristic equations giving the stress singularity and the angular distribution of the stresses around the vertex of the wedge are obtained for three standard homogeneous boundary conditions. The numerical examples show that the singular behavior of the stresses around the vertex of an anisotropic wedge may be significantly different from that of the isotropic material. Some of the results which may be of practical importance are that for a half plane the stress state at r = 0 may be singular and for a crack the power of stress singularity may be greater or less than 1/2.

Spin wave Feynman diagram vertex computation package

NASA Astrophysics Data System (ADS)

Price, Alexander; Javernick, Philip; Datta, Trinanjan

Spin wave theory is a well-established theoretical technique that can correctly predict the physical behavior of ordered magnetic states. However, computing the effects of an interacting spin wave theory incorporating magnons involve a laborious by hand derivation of Feynman diagram vertices. The process is tedious and time consuming. Hence, to improve productivity and have another means to check the analytical calculations, we have devised a Feynman Diagram Vertex Computation package. In this talk, we will describe our research group's effort to implement a Mathematica based symbolic Feynman diagram vertex computation package that computes spin wave vertices. Utilizing the non-commutative algebra package NCAlgebra as an add-on to Mathematica, symbolic expressions for the Feynman diagram vertices of a Heisenberg quantum antiferromagnet are obtained. Our existing code reproduces the well-known expressions of a nearest neighbor square lattice Heisenberg model. We also discuss the case of a triangular lattice Heisenberg model where non collinear terms contribute to the vertex interactions.

Quantum vertex model for reversible classical computing.

PubMed

Chamon, C; Mucciolo, E R; Ruckenstein, A E; Yang, Z-C

2017-05-12

Mappings of classical computation onto statistical mechanics models have led to remarkable successes in addressing some complex computational problems. However, such mappings display thermodynamic phase transitions that may prevent reaching solution even for easy problems known to be solvable in polynomial time. Here we map universal reversible classical computations onto a planar vertex model that exhibits no bulk classical thermodynamic phase transition, independent of the computational circuit. Within our approach the solution of the computation is encoded in the ground state of the vertex model and its complexity is reflected in the dynamics of the relaxation of the system to its ground state. We use thermal annealing with and without 'learning' to explore typical computational problems. We also construct a mapping of the vertex model into the Chimera architecture of the D-Wave machine, initiating an approach to reversible classical computation based on state-of-the-art implementations of quantum annealing.

Dynamical mass generation in unquenched QED using the Dyson-Schwinger equations

DOE PAGES

Kızılersü, Ayse; Sizer, Tom; Pennington, Michael R.; ...

2015-03-13

We present a comprehensive numerical study of dynamical mass generation for unquenched QED in four dimensions, in the absence of four-fermion interactions, using the Dyson-Schwinger approach. We begin with an overview of previous investigations of criticality in the quenched approximation. To this we add an analysis using a new fermion-antifermion-boson interaction ansatz, the Kizilersu-Pennington (KP) vertex, developed for an unquenched treatment. After surveying criticality in previous unquenched studies, we investigate the performance of the KP vertex in dynamical mass generation using a renormalized fully unquenched system of equations. This we compare with the results for two hybrid vertices incorporating themore » Curtis-Pennington vertex in the fermion equation. We conclude that the KP vertex is as yet incomplete, and its relative gauge-variance is due to its lack of massive transverse components in its design.« less

Uncovering the deformation mechanisms of origami metamaterials by introducing generic degree-four vertices.

PubMed

Fang, Hongbin; Li, Suyi; Ji, Huimin; Wang, K W

2016-10-01

Origami-based design holds promise for developing new mechanical metamaterials whose overall kinematic and mechanical properties can be programmed using purely geometric criteria. In this article, we demonstrate that the deformation of a generic degree-four vertex (4-vertex) origami cell is a combination of contracting, shearing, bending, and facet-binding. The last three deformation mechanisms are missing in the current rigid-origami metamaterial investigations, which focus mainly on conventional Miura-ori patterns. We show that these mechanisms provide the 4-vertex origami sheets and blocks with new deformation patterns as well as extraordinary kinematical and mechanical properties, including self-locking, tridirectional negative Poisson's ratios, flipping of stiffness profiles, and emerging shearing stiffness. This study reveals that the 4-vertex cells offer a better platform and greater design space for developing origami-based mechanical metamaterials than the conventional Miura-ori cell.

Uncovering the deformation mechanisms of origami metamaterials by introducing generic degree-four vertices

NASA Astrophysics Data System (ADS)

Fang, Hongbin; Li, Suyi; Ji, Huimin; Wang, K. W.

2016-10-01

Origami-based design holds promise for developing new mechanical metamaterials whose overall kinematic and mechanical properties can be programmed using purely geometric criteria. In this article, we demonstrate that the deformation of a generic degree-four vertex (4-vertex) origami cell is a combination of contracting, shearing, bending, and facet-binding. The last three deformation mechanisms are missing in the current rigid-origami metamaterial investigations, which focus mainly on conventional Miura-ori patterns. We show that these mechanisms provide the 4-vertex origami sheets and blocks with new deformation patterns as well as extraordinary kinematical and mechanical properties, including self-locking, tridirectional negative Poisson's ratios, flipping of stiffness profiles, and emerging shearing stiffness. This study reveals that the 4-vertex cells offer a better platform and greater design space for developing origami-based mechanical metamaterials than the conventional Miura-ori cell.

Track vertex reconstruction with neural networks at the first level trigger of Belle II

NASA Astrophysics Data System (ADS)

Neuhaus, Sara; Skambraks, Sebastian; Kiesling, Christian

2017-08-01

The track trigger is one of the main components of the Belle II first level trigger, taking input from the Central Drift Chamber (CDC). It consists of several stages, first combining hits to track segments, followed by a 2D track finding in the transverse plane and finally a 3D track reconstruction. The results of the track trigger are the track multiplicity, the momentum vector of each track and the longitudinal displacement of the origin or production vertex of each track ("z-vertex"). The latter allows to reject background tracks from outside of the interaction region and thus to suppress a large fraction of the machine background. This contribution focuses on the track finding stage using Hough transforms and on the z-vertex reconstruction with neural networks. We describe the algorithms and show performance studies on simulated events.

Quantum vertex model for reversible classical computing

NASA Astrophysics Data System (ADS)

Chamon, C.; Mucciolo, E. R.; Ruckenstein, A. E.; Yang, Z.-C.

2017-05-01

Mappings of classical computation onto statistical mechanics models have led to remarkable successes in addressing some complex computational problems. However, such mappings display thermodynamic phase transitions that may prevent reaching solution even for easy problems known to be solvable in polynomial time. Here we map universal reversible classical computations onto a planar vertex model that exhibits no bulk classical thermodynamic phase transition, independent of the computational circuit. Within our approach the solution of the computation is encoded in the ground state of the vertex model and its complexity is reflected in the dynamics of the relaxation of the system to its ground state. We use thermal annealing with and without `learning' to explore typical computational problems. We also construct a mapping of the vertex model into the Chimera architecture of the D-Wave machine, initiating an approach to reversible classical computation based on state-of-the-art implementations of quantum annealing.

Inferring patterns in mitochondrial DNA sequences through hypercube independent spanning trees.

PubMed

Silva, Eduardo Sant Ana da; Pedrini, Helio

2016-03-01

Given a graph G, a set of spanning trees rooted at a vertex r of G is said vertex/edge independent if, for each vertex v of G, v≠r, the paths of r to v in any pair of trees are vertex/edge disjoint. Independent spanning trees (ISTs) provide a number of advantages in data broadcasting due to their fault tolerant properties. For this reason, some studies have addressed the issue by providing mechanisms for constructing independent spanning trees efficiently. In this work, we investigate how to construct independent spanning trees on hypercubes, which are generated based upon spanning binomial trees, and how to use them to predict mitochondrial DNA sequence parts through paths on the hypercube. The prediction works both for inferring mitochondrial DNA sequences comprised of six bases as well as infer anomalies that probably should not belong to the mitochondrial DNA standard. Copyright © 2016 Elsevier Ltd. All rights reserved.

A CMOS pixel sensor prototype for the outer layers of linear collider vertex detector

NASA Astrophysics Data System (ADS)

Zhang, L.; Morel, F.; Hu-Guo, C.; Himmi, A.; Dorokhov, A.; Hu, Y.

2015-01-01

The International Linear Collider (ILC) expresses a stringent requirement for high precision vertex detectors (VXD). CMOS pixel sensors (CPS) have been considered as an option for the VXD of the International Large Detector (ILD), one of the detector concepts proposed for the ILC. MIMOSA-31 developed at IPHC-Strasbourg is the first CPS integrated with 4-bit column-level ADC for the outer layers of the VXD, adapted to an original concept minimizing the power consumption. It is composed of a matrix of 64 rows and 48 columns. The pixel concept combines in-pixel amplification with a correlated double sampling (CDS) operation in order to reduce the temporal noise and fixed pattern noise (FPN). At the bottom of the pixel array, each column is terminated with a self-triggered analog-to-digital converter (ADC). The ADC design was optimized for power saving at a sampling frequency of 6.25 MS/s. The prototype chip is fabricated in a 0.35 μm CMOS technology. This paper presents the details of the prototype chip and its test results.

The Construction of {P}_{2}\\vartriangleright H-antimagic graph using smaller edge-antimagic vertex labeling

NASA Astrophysics Data System (ADS)

Prihandini, Rafiantika M.; Agustin, I. H.; Dafik

2018-04-01

In this paper we use simple and non trivial graph. If there exist a bijective function g:V(G) \\cup E(G)\\to \\{1,2,\\ldots,|V(G)|+|E(G)|\\}, such that for all subgraphs {P}2\\vartriangleright H of G isomorphic to H, then graph G is called an (a, b)-{P}2\\vartriangleright H-antimagic total graph. Furthermore, we can consider the total {P}2\\vartriangleright H-weights W({P}2\\vartriangleright H)={\\sum }v\\in V({P2\\vartriangleright H)}f(v)+{\\sum }e\\in E({P2\\vartriangleright H)}f(e) which should form an arithmetic sequence {a, a + d, a + 2d, …, a + (n ‑ 1)d}, where a and d are positive integers and n is the number of all subgraphs isomorphic to H. Our paper describes the existence of super (a, b)-{P}2\\vartriangleright H antimagic total labeling for graph operation of comb product namely of G=L\\vartriangleright H, where L is a (b, d*)-edge antimagic vertex labeling graph and H is a connected graph.

Measuring Charge Collection Efficiency in Diamond Vertex Detectors

NASA Astrophysics Data System (ADS)

Josey, Brian; Seidel, Sally; Hoeferkamp, Martin

2011-10-01

As currently used at the Large Hadron Collider, vertex detectors are composed primarily of silicon sensors that image particle tracks by detecting the creation of electron-hole pairs caused by the excitation of the silicon atoms. We are investigating replacing these silicon detectors with detectors made out of diamond. Diamond is advantageous due to its radiation hardness. We are measuring the charge collection efficiency of diamond as a function of fluence. We are building a characterization station. Diamond samples will be placed into the characterization station and exposed to a strontium-90 beta source, before and after I irradiate them with 800 MeV protons at LANL. The radiation from the Sr-90 source will create electron-hole pairs. These will be read out by applying an electric field across the sample. The system is triggered by a scintillator-photomultiplier tube assembly. The goal of this measurement is to record collected charge as a function of bias voltage. The diamond charge collection data will be compared to silicon and predictions about detector operation at the LHC will be made.

Advanced testing of the DEPFET minimatrix particle detector

NASA Astrophysics Data System (ADS)

Andricek, L.; Kodyš, P.; Koffmane, C.; Ninkovic, J.; Oswald, C.; Richter, R.; Ritter, A.; Rummel, S.; Scheirich, J.; Wassatsch, A.

2012-01-01

The DEPFET (DEPleted Field Effect Transistor) is an active pixel particle detector with a MOSFET (Metal-Oxide-Semiconductor Field-Effect Transistor) integrated in each pixel, providing first amplification stage of readout electronics. Excellent signal over noise performance is gained this way. The DEPFET sensor will be used as a vertex detector in the Belle II experiment at SuperKEKB, electron-positron collider in Japan. The vertex detector will be composed of two layers of pixel detectors (DEPFET) and four layers of strip detectors. The DEPFET sensor requires switching and current readout circuits for its operation. These circuits have been designed as ASICs (Application Specific Integrated Circuits) in several different versions, but they provide insufficient flexibility for precise detector testing. Therefore, a test system with a flexible control cycle range and minimal noise has been designed for testing and characterizing of small detector prototypes (Minimatrices). Sensors with different design layouts and thicknesses are produced in order to evaluate and select the one with the best performance for the Belle II application. Description of the test system as well as measurement results are presented.

Effect of contact angle on the orientation, stability, and assembly of dense floating cubes.

PubMed

Daniello, Robert; Khan, Kashan; Donnell, Michael; Rothstein, Jonathan P

2014-02-01

In this paper, the effect of contact angle, density, and size on the orientation, stability, and assembly of floating cubes was investigated. All the cubes tested were more dense than water. Floatation occurred as a result of capillary stresses induced by deformation of the air-water interface. The advancing contact angle of the bare acrylic cubes was measured to be 85°. The contact angle of the cubes was increased by painting the cubes with a commercially available superhydrophobic paint to reach an advancing contact angle of 150°. Depending on their size, density, and contact angle, the cubes were observed to float in one of three primary orientations: edge up, vertex up, and face up. An experimental apparatus was built such that the sum of the gravitational force, buoyancy force, and capillary forces could be measured using a force transducer as a function of cube position as it was lowered through the air-water interface. Measurements showed that the maximum capillary forces were always experienced for the face up orientation. However, when floatation was possible in the vertex up orientation, it was found to be the most stable cube orientation because it had the lowest center of gravity. A series of theoretical predictions were performed for the cubes floating in each of the three primary orientations to calculate the net force on the cube. The theoretical predictions were found to match the experimental measurements well. A cube stability diagram of cube orientation as a function of cube contact angle and size was prepared from the predictions of theory and found to match the experimental observations quite well. The assembly of cubes floating face up and vertex up were also studied for assemblies of two, three, and many cubes. Cubes floating face up were found to assemble face-to-face and form regular square lattice patterns with no free interface between cubes. Cubes floating vertex up were found to assemble in a variety of different arrangements including edge-to-edge, vertex-to-vertex, face-to-face, and vertex-to-face with the most probably assembly being edge-to-edge. Large numbers of vertex up cubes were found to pack with a distribution of orientations and alignments.

Data Representations for Geographic Information Systems.

ERIC Educational Resources Information Center

Shaffer, Clifford A.

1992-01-01

Surveys the field and literature of geographic information systems (GIS) and spatial data representation as it relates to GIS. Highlights include GIS terms, data types, and operations; vector representations and raster, or grid, representations; spatial indexing; elevation data representations; large spatial databases; and problem areas and future…

Interface of the general fitting tool GENFIT2 in PandaRoot

NASA Astrophysics Data System (ADS)

Prencipe, Elisabetta; Spataro, Stefano; Stockmanns, Tobias; PANDA Collaboration

2017-10-01

\\bar{{{P}}}ANDA is a planned experiment at FAIR (Darmstadt) with a cooled antiproton beam in a range [1.5; 15] GeV/c, allowing a wide physics program in nuclear and particle physics. It is the only experiment worldwide, which combines a solenoid field (B=2T) and a dipole field (B=2Tm) in a spectrometer with a fixed target topology, in that energy regime. The tracking system of \\bar{{{P}}}ANDA involves the presence of a high performance silicon vertex detector, a GEM detector, a straw-tubes central tracker, a forward tracking system, and a luminosity monitor. The offline tracking algorithm is developed within the PandaRoot framework, which is a part of the FairRoot project. The tool here presented is based on algorithms containing the Kalman Filter equations and a deterministic annealing filter. This general fitting tool (GENFIT2) offers to users also a Runge-Kutta track representation, and interfaces with Millepede II (useful for alignment) and RAVE (vertex finder). It is independent on the detector geometry and the magnetic field map, and written in C++ object-oriented modular code. Several fitting algorithms are available with GENFIT2, with user-adjustable parameters; therefore the tool is of friendly usage. A check on the fit convergence is done by GENFIT2 as well. The Kalman-Filter-based algorithms have a wide range of applications; among those in particle physics they can perform extrapolations of track parameters and covariance matrices. The adoptions of the PandaRoot framework to connect to Genfit2 are described, and the impact of GENFIT2 on the physics simulations of \\bar{{{P}}}ANDA are shown: significant improvement is reported for those channels where a good low momentum tracking is required (pT < 400 MeV/c).

A high-order vertex-based central ENO finite-volume scheme for three-dimensional compressible flows

DOE PAGES

Charest, Marc R.J.; Canfield, Thomas R.; Morgan, Nathaniel R.; ...

2015-03-11

High-order discretization methods offer the potential to reduce the computational cost associated with modeling compressible flows. However, it is difficult to obtain accurate high-order discretizations of conservation laws that do not produce spurious oscillations near discontinuities, especially on multi-dimensional unstructured meshes. A novel, high-order, central essentially non-oscillatory (CENO) finite-volume method that does not have these difficulties is proposed for tetrahedral meshes. The proposed unstructured method is vertex-based, which differs from existing cell-based CENO formulations, and uses a hybrid reconstruction procedure that switches between two different solution representations. It applies a high-order k-exact reconstruction in smooth regions and a limited linearmore » reconstruction when discontinuities are encountered. Both reconstructions use a single, central stencil for all variables, making the application of CENO to arbitrary unstructured meshes relatively straightforward. The new approach was applied to the conservation equations governing compressible flows and assessed in terms of accuracy and computational cost. For all problems considered, which included various function reconstructions and idealized flows, CENO demonstrated excellent reliability and robustness. Up to fifth-order accuracy was achieved in smooth regions and essentially non-oscillatory solutions were obtained near discontinuities. The high-order schemes were also more computationally efficient for high-accuracy solutions, i.e., they took less wall time than the lower-order schemes to achieve a desired level of error. In one particular case, it took a factor of 24 less wall-time to obtain a given level of error with the fourth-order CENO scheme than to obtain the same error with the second-order scheme.« less

A 32 vertex polyhedron via supramolecular assembly of silanedithiolate silanolate units.

PubMed

Spirk, Stefan; Belaj, Ferdinand; Hurkes, Natascha; Pietschnig, Rudolf

2012-08-28

A high yield synthesis of the first silanedithiolate silanolate is reported which spontaneously assembles forming an inorganic rugby ball shaped 32 vertex polyhedral cluster stabilized by sterically demanding 2,6-dimesitylphenyl substituents and two LiCl units.

FAST TRACK COMMUNICATION Quantum entanglement: the unitary 8-vertex braid matrix with imaginary rapidity

NASA Astrophysics Data System (ADS)

Chakrabarti, Amitabha; Chakraborti, Anirban; Jedidi, Aymen

2010-12-01

We study quantum entanglements induced on product states by the action of 8-vertex braid matrices, rendered unitary with purely imaginary spectral parameters (rapidity). The unitarity is displayed via the 'canonical factorization' of the coefficients of the projectors spanning the basis. This adds one more new facet to the famous and fascinating features of the 8-vertex model. The double periodicity and the analytic properties of the elliptic functions involved lead to a rich structure of the 3-tangle quantifying the entanglement. We thus explore the complex relationship between topological and quantum entanglement.

Uncovering the overlapping community structure of complex networks by maximal cliques

NASA Astrophysics Data System (ADS)

Li, Junqiu; Wang, Xingyuan; Cui, Yaozu

2014-12-01

In this paper, a unique algorithm is proposed to detect overlapping communities in the un-weighted and weighted networks with considerable accuracy. The maximal cliques, overlapping vertex, bridge vertex and isolated vertex are introduced. First, all the maximal cliques are extracted by the algorithm based on the deep and bread searching. Then two maximal cliques can be merged into a larger sub-graph by some given rules. In addition, the proposed algorithm successfully finds overlapping vertices and bridge vertices between communities. Experimental results using some real-world networks data show that the performance of the proposed algorithm is satisfactory.

Z H η vertex in the simplest little Higgs model

NASA Astrophysics Data System (ADS)

He, Shi-Ping; Mao, Ying-nan; Zhang, Chen; Zhu, Shou-hua

2018-04-01

The issue of deriving Z H η vertex in the simplest little Higgs (SLH) model is revisited. Special attention is paid to the treatment of noncanonically-normalized scalar kinetic matrix and vector-scalar two-point transitions. We elucidate a general procedure to diagonalize a general vector-scalar system in gauge theories and apply it to the case of SLH. The resultant Z H η vertex is found to be different from those which have already existed in the literature for a long time. We also present an understanding of this issue from an effective field theory viewpoint.

Original electric-vertex formulation of the symmetric eight-vertex model on the square lattice is fully nonuniversal

NASA Astrophysics Data System (ADS)

Krčmár, Roman; Šamaj, Ladislav

2018-01-01

The partition function of the symmetric (zero electric field) eight-vertex model on a square lattice can be formulated either in the original "electric" vertex format or in an equivalent "magnetic" Ising-spin format. In this paper, both electric and magnetic versions of the model are studied numerically by using the corner transfer matrix renormalization-group method which provides reliable data. The emphasis is put on the calculation of four specific critical exponents, related by two scaling relations, and of the central charge. The numerical method is first tested in the magnetic format, the obtained dependencies of critical exponents on the model's parameters agree with Baxter's exact solution, and weak universality is confirmed within the accuracy of the method due to the finite size of the system. In particular, the critical exponents η and δ are constant as required by weak universality. On the other hand, in the electric format, analytic formulas based on the scaling relations are derived for the critical exponents ηe and δe which agree with our numerical data. These exponents depend on the model's parameters which is evidence for the full nonuniversality of the symmetric eight-vertex model in the original electric formulation.

Full self-consistency versus quasiparticle self-consistency in diagrammatic approaches: Exactly solvable two-site Hubbard model

DOE PAGES

Kutepov, A. L.

2015-07-22

Self-consistent solutions of Hedin's equations (HE) for the two-site Hubbard model (HM) have been studied. They have been found for three-point vertices of increasing complexity (Γ = 1 (GW approximation), Γ₁ from the first-order perturbation theory, and the exact vertex Γ E). Comparison is made between the cases when an additional quasiparticle (QP) approximation for Green's functions is applied during the self-consistent iterative solving of HE and when QP approximation is not applied. Results obtained with the exact vertex are directly related to the present open question—which approximation is more advantageous for future implementations, GW + DMFT or QPGW +more » DMFT. It is shown that in a regime of strong correlations only the originally proposed GW + DMFT scheme is able to provide reliable results. Vertex corrections based on Perturbation Theory systematically improve the GW results when full self-consistency is applied. The application of QP self-consistency combined with PT vertex corrections shows similar problems to the case when the exact vertex is applied combined with QP sc. An analysis of Ward Identity violation is performed for all studied in this work's approximations and its relation to the general accuracy of the schemes used is provided.« less

Penguin-like diagrams from the standard model

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ping, Chia Swee

2015-04-24

The Standard Model is highly successful in describing the interactions of leptons and quarks. There are, however, rare processes that involve higher order effects in electroweak interactions. One specific class of processes is the penguin-like diagram. Such class of diagrams involves the neutral change of quark flavours accompanied by the emission of a gluon (gluon penguin), a photon (photon penguin), a gluon and a photon (gluon-photon penguin), a Z-boson (Z penguin), or a Higgs-boson (Higgs penguin). Such diagrams do not arise at the tree level in the Standard Model. They are, however, induced by one-loop effects. In this paper, wemore » present an exact calculation of the penguin diagram vertices in the ‘tHooft-Feynman gauge. Renormalization of the vertex is effected by a prescription by Chia and Chong which gives an expression for the counter term identical to that obtained by employing Ward-Takahashi identity. The on-shell vertex functions for the penguin diagram vertices are obtained. The various penguin diagram vertex functions are related to one another via Ward-Takahashi identity. From these, a set of relations is obtained connecting the vertex form factors of various penguin diagrams. Explicit expressions for the gluon-photon penguin vertex form factors are obtained, and their contributions to the flavor changing processes estimated.« less

Full self-consistency versus quasiparticle self-consistency in diagrammatic approaches: exactly solvable two-site Hubbard model.

PubMed

Kutepov, A L

2015-08-12

Self-consistent solutions of Hedin's equations (HE) for the two-site Hubbard model (HM) have been studied. They have been found for three-point vertices of increasing complexity (Γ = 1 (GW approximation), Γ1 from the first-order perturbation theory, and the exact vertex Γ(E)). Comparison is made between the cases when an additional quasiparticle (QP) approximation for Green's functions is applied during the self-consistent iterative solving of HE and when QP approximation is not applied. The results obtained with the exact vertex are directly related to the present open question-which approximation is more advantageous for future implementations, GW + DMFT or QPGW + DMFT. It is shown that in a regime of strong correlations only the originally proposed GW + DMFT scheme is able to provide reliable results. Vertex corrections based on perturbation theory (PT) systematically improve the GW results when full self-consistency is applied. The application of QP self-consistency combined with PT vertex corrections shows similar problems to the case when the exact vertex is applied combined with QP sc. An analysis of Ward Identity violation is performed for all studied in this work's approximations and its relation to the general accuracy of the schemes used is provided.

Supplantation of Mental Operations on Graphs

ERIC Educational Resources Information Center

Vogel, Markus; Girwidz, Raimund; Engel, Joachim

2007-01-01

Research findings show the difficulties younger students have in working with graphs. Higher mental operations are necessary for a skilled interpretation of abstract representations. We suggest connecting a concrete representation of the modeled problem with the related graph. The idea is to illustrate essential mental operations externally. This…

On Bipartite Graphs Trees and Their Partial Vertex Covers.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Caskurlu, Bugra; Mkrtchyan, Vahan; Parekh, Ojas D.

2015-03-01

Graphs can be used to model risk management in various systems. Particularly, Caskurlu et al. in [7] have considered a system, which has threats, vulnerabilities and assets, and which essentially represents a tripartite graph. The goal in this model is to reduce the risk in the system below a predefined risk threshold level. One can either restricting the permissions of the users, or encapsulating the system assets. The pointed out two strategies correspond to deleting minimum number of elements corresponding to vulnerabilities and assets, such that the flow between threats and assets is reduced below the predefined threshold level. Itmore » can be shown that the main goal in this risk management system can be formulated as a Partial Vertex Cover problem on bipartite graphs. It is well-known that the Vertex Cover problem is in P on bipartite graphs, however; the computational complexity of the Partial Vertex Cover problem on bipartite graphs has remained open. In this paper, we establish that the Partial Vertex Cover problem is NP-hard on bipartite graphs, which was also recently independently demonstrated [N. Apollonio and B. Simeone, Discrete Appl. Math., 165 (2014), pp. 37–48; G. Joret and A. Vetta, preprint, arXiv:1211.4853v1 [cs.DS], 2012]. We then identify interesting special cases of bipartite graphs, for which the Partial Vertex Cover problem, the closely related Budgeted Maximum Coverage problem, and their weighted extensions can be solved in polynomial time. We also present an 8/9-approximation algorithm for the Budgeted Maximum Coverage problem in the class of bipartite graphs. We show that this matches and resolves the integrality gap of the natural LP relaxation of the problem and improves upon a recent 4/5-approximation.« less

The partition dimension of cycle books graph

NASA Astrophysics Data System (ADS)

Santoso, Jaya; Darmaji

2018-03-01

Let G be a nontrivial and connected graph with vertex set V(G), edge set E(G) and S ⊆ V(G) with v ∈ V(G), the distance between v and S is d(v,S) = min{d(v,x)|x ∈ S}. For an ordered partition ∏ = {S 1, S 2, S 3,…, Sk } of V(G), the representation of v with respect to ∏ is defined by r(v|∏) = (d(v, S 1), d(v, S 2),…, d(v, Sk )). The partition ∏ is called a resolving partition of G if all representations of vertices are distinct. The partition dimension pd(G) is the smallest integer k such that G has a resolving partition set with k members. In this research, we will determine the partition dimension of Cycle Books {B}{Cr,m}. Cycle books graph {B}{Cr,m} is a graph consisting of m copies cycle Cr with the common path P 2. It is shown that the partition dimension of cycle books graph, pd({B}{C3,m}) is 3 for m = 2, 3, and m for m ≥ 4. pd({B}{C4,m}) is 3 + 2k for m = 3k + 2, 4 + 2(k ‑ 1) for m = 3k + 1, and 3 + 2(k ‑ 1) for m = 3k. pd({B}{C5,m}) is m + 1.

Thermal mock-up studies of the Belle II vertex detector

NASA Astrophysics Data System (ADS)

Ye, H.; Niebuhr, C.; Stever, R.; Gadow, K.; Camien, C.

2018-07-01

The ongoing upgrade of the asymmetric electron-positron collider SuperKEKB at the KEK laboratory, Japan aims at a 40-fold increase of the peak luminosity to 8 × 1035 cm-2s-1. At the same time the complex Belle II detector is being significantly upgraded to be able to cope with the higher background level and trigger rates and to improve overall performance. The goal of the experiment is to explore physics beyond the standard model with a target integrated luminosity of 50 ab-1 in the next decade. The new vertex detector (VXD), comprising two layers of DEPFET pixel detectors (PXD) surrounded by 4 layers of double sided silicon strip detectors (SVD), is indispensable for vertex determination as well as for reconstruction of low momentum tracks that do not reach the central drift chamber (CDC). Within the confined VXD volume the front-end electronics of the two detectors will dissipate about 1 kW of heat. The VXD cooling system has been designed to remove this heat with the constraint to minimize extra dead material in the physics acceptance region. Taking into account additional heat intake from the environment the cooling system must have a cooling capacity of 2-3 kW. To achieve this goal evaporative two-phase CO2 cooling in combination with forced N2 flow is used in the VXD cooling system. In order to verify and optimize the cooling concept and to demonstrate that acceptable operation conditions for the VXD system as well as the surrounding CDC can be obtained, a full size VXD thermal mock-up has been built at DESY. Various thermal and mechanical tests carried out with this mock-up are reported.

Extremal values on Zagreb indices of trees with given distance k-domination number.

PubMed

Pei, Lidan; Pan, Xiangfeng

2018-01-01

Let [Formula: see text] be a graph. A set [Formula: see text] is a distance k -dominating set of G if for every vertex [Formula: see text], [Formula: see text] for some vertex [Formula: see text], where k is a positive integer. The distance k -domination number [Formula: see text] of G is the minimum cardinality among all distance k -dominating sets of G . The first Zagreb index of G is defined as [Formula: see text] and the second Zagreb index of G is [Formula: see text]. In this paper, we obtain the upper bounds for the Zagreb indices of n -vertex trees with given distance k -domination number and characterize the extremal trees, which generalize the results of Borovićanin and Furtula (Appl. Math. Comput. 276:208-218, 2016). What is worth mentioning, for an n -vertex tree T , is that a sharp upper bound on the distance k -domination number [Formula: see text] is determined.

Automatically Generated Algorithms for the Vertex Coloring Problem

PubMed Central

Contreras Bolton, Carlos; Gatica, Gustavo; Parada, Víctor

2013-01-01

The vertex coloring problem is a classical problem in combinatorial optimization that consists of assigning a color to each vertex of a graph such that no adjacent vertices share the same color, minimizing the number of colors used. Despite the various practical applications that exist for this problem, its NP-hardness still represents a computational challenge. Some of the best computational results obtained for this problem are consequences of hybridizing the various known heuristics. Automatically revising the space constituted by combining these techniques to find the most adequate combination has received less attention. In this paper, we propose exploring the heuristics space for the vertex coloring problem using evolutionary algorithms. We automatically generate three new algorithms by combining elementary heuristics. To evaluate the new algorithms, a computational experiment was performed that allowed comparing them numerically with existing heuristics. The obtained algorithms present an average 29.97% relative error, while four other heuristics selected from the literature present a 59.73% error, considering 29 of the more difficult instances in the DIMACS benchmark. PMID:23516506

An efficicient data structure for three-dimensional vertex based finite volume method

NASA Astrophysics Data System (ADS)

Akkurt, Semih; Sahin, Mehmet

2017-11-01

A vertex based three-dimensional finite volume algorithm has been developed using an edge based data structure.The mesh data structure of the given algorithm is similar to ones that exist in the literature. However, the data structures are redesigned and simplied in order to fit requirements of the vertex based finite volume method. In order to increase the cache efficiency, the data access patterns for the vertex based finite volume method are investigated and these datas are packed/allocated in a way that they are close to each other in the memory. The present data structure is not limited with tetrahedrons, arbitrary polyhedrons are also supported in the mesh without putting any additional effort. Furthermore, the present data structure also supports adaptive refinement and coarsening. For the implicit and parallel implementation of the FVM algorithm, PETSc and MPI libraries are employed. The performance and accuracy of the present algorithm are tested for the classical benchmark problems by comparing the CPU time for the open source algorithms.

Vertex Algebras W(p)Am and W(p)Dm and Constant Term Identities

NASA Astrophysics Data System (ADS)

Adamović, Dražen; Lin, Xianzu; Milas, Antun

2015-03-01

We consider AD-type orbifolds of the triplet vertex algebras W(p) extending the well-known c=1 orbifolds of lattice vertex algebras. We study the structure of Zhu's algebras A(W(p)^{A_m}) and A(W(p)^{D_m}), where A_m and D_m are cyclic and dihedral groups, respectively. A combinatorial algorithm for classification of irreducible W(p)^Γ-modules is developed, which relies on a family of constant term identities and properties of certain polynomials based on constant terms. All these properties can be checked for small values of m and p with a computer software. As a result, we argue that if certain constant term properties hold, the irreducible modules constructed in [Commun. Contemp. Math. 15 (2013), 1350028, 30 pages; Internat. J. Math. 25 (2014), 1450001, 34 pages] provide a complete list of irreducible W(p)^{A_m} and W(p)^{D_m}-modules. This paper is a continuation of our previous work on the ADE subalgebras of the triplet vertex algebra W(p).

Towards an ab-initio treatment of nonlocal electronic correlations with dynamical vertex approximation

NASA Astrophysics Data System (ADS)

Galler, Anna; Gunacker, Patrik; Tomczak, Jan; Thunström, Patrik; Held, Karsten

Recently, approaches such as the dynamical vertex approximation (D ΓA) or the dual-fermion method have been developed. These diagrammatic approaches are going beyond dynamical mean field theory (DMFT) by including nonlocal electronic correlations on all length scales as well as the local DMFT correlations. Here we present our efforts to extend the D ΓA methodology to ab-initio materials calculations (ab-initio D ΓA). Our approach is a unifying framework which includes both GW and DMFT-type of diagrams, but also important nonlocal correlations beyond, e.g. nonlocal spin fluctuations. In our multi-band implementation we are using a worm sampling technique within continuous-time quantum Monte Carlo in the hybridization expansion to obtain the DMFT vertex, from which we construct the reducible vertex function using the two particle-hole ladders. As a first application we show results for transition metal oxides. Support by the ERC project AbinitioDGA (306447) is acknowledged.

On non-primitively divergent vertices of Yang-Mills theory

NASA Astrophysics Data System (ADS)

Huber, Markus Q.

2017-11-01

Two correlation functions of Yang-Mills beyond the primitively divergent ones, the two-ghost-two-gluon and the four-ghost vertices, are calculated and their influence on lower vertices is examined. Their full (transverse) tensor structure is taken into account. As input, a solution of the full two-point equations - including two-loop terms - is used that respects the resummed perturbative ultraviolet behavior. A clear hierarchy is found with regard to the color structure that reduces the number of relevant dressing functions. The impact of the two-ghost-two-gluon vertex on the three-gluon vertex is negligible, which is explained by the fact that all non-small dressing functions drop out due to their color factors. Only in the ghost-gluon vertex a small net effect below 2% is seen. The four-ghost vertex is found to be extremely small in general. Since these two four-point functions do not enter into the propagator equations, these findings establish their small overall effect on lower correlation functions.

Two-dimensional particle-in-cell plasma source ion implantation of a prolate spheroid target

NASA Astrophysics Data System (ADS)

Liu, Cheng-Sen; Han, Hong-Ying; Peng, Xiao-Qing; Chang, Ye; Wang, De-Zhen

2010-03-01

A two-dimensional particle-in-cell simulation is used to study the time-dependent evolution of the sheath surrounding a prolate spheroid target during a high voltage pulse in plasma source ion implantation. Our study shows that the potential contour lines pack more closely in the plasma sheath near the vertex of the major axis, i.e. where a thinner sheath is formed, and a non-uniform total ion dose distribution is incident along the surface of the prolate spheroid target due to the focusing of ions by the potential structure. Ion focusing takes place not only at the vertex of the major axis, where dense potential contour lines exist, but also at the vertex of the minor axis, where sparse contour lines exist. This results in two peaks of the received ion dose, locating at the vertices of the major and minor axes of the prolate spheroid target, and an ion dose valley, staying always between the vertices, rather than at the vertex of the minor axis.

Auditory cortical responses in patients with cochlear implants

PubMed Central

Burdo, S; Razza, S; Di Berardino, F; Tognola, G

2006-01-01

Summary Currently, the most commonly used electrophysiological tests for cochlear implant evaluation are Averaged Electrical Voltages (AEV), Electrical Advisory Brainstem Responses (EABR) and Neural Response Telemetry (NRT). The present paper focuses on the study of acoustic auditory cortical responses, or slow vertex responses, which are not widely used due to the difficulty in recording, especially in young children. Aims of this study were validation of slow vertex responses and their possible applications in monitoring postimplant results, particularly restoration of hearing and auditory maturation. In practice, the use of tone-bursts, also through hearing aids or cochlear implants, as in slow vertex responses, allows many more frequencies to be investigated and louder intensities to be reached than with other tests based on a click as stimulus. Study design focused on latencies of N1 and P2 slow vertex response peaks in cochlear implants. The study population comprised 45 implant recipients (aged 2 to 70 years), divided into 5 different homogeneous groups according to chronological age, age at onset of deafness, and age at implantation. For each subject, slow vertex responses and free-field auditory responses (PTAS) were recorded for tone-bursts at 500 and 2000 Hz before cochlear implant surgery (using hearing aid amplification) and during scheduled sessions at 3rd and 12th month after implant activation. Results showed that N1 and P2 latencies decreased in all groups starting from 3rd through 12th month after activation. Subjects implanted before school age or at least before age 8 yrs showed the widest latency changes. All subjects showed a reduction in the gap between subjective thresholds (obtained with free field auditory responses) and objective thresholds (obtained with slow vertex responses), obtained in presurgery stage and after cochlear implant. In conclusion, a natural evolution of neurophysiological cortical activities of the auditory pathway, over time, was found especially in young children with prelingual deafness and implanted in preschool age. Cochlear implantation appears to provide hearing restoration, demonstrated by the sharp reduction of the gap between subjective free field auditory responses and slow vertex responses threshold obtained with hearing aids vs. cochlear implant. PMID:16886849

GraphReduce: Processing Large-Scale Graphs on Accelerator-Based Systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sengupta, Dipanjan; Song, Shuaiwen; Agarwal, Kapil

2015-11-15

Recent work on real-world graph analytics has sought to leverage the massive amount of parallelism offered by GPU devices, but challenges remain due to the inherent irregularity of graph algorithms and limitations in GPU-resident memory for storing large graphs. We present GraphReduce, a highly efficient and scalable GPU-based framework that operates on graphs that exceed the device’s internal memory capacity. GraphReduce adopts a combination of edge- and vertex-centric implementations of the Gather-Apply-Scatter programming model and operates on multiple asynchronous GPU streams to fully exploit the high degrees of parallelism in GPUs with efficient graph data movement between the host andmore » device.« less

Radiative nonrecoil nuclear finite size corrections of order α(Zα)5 to the Lamb shift in light muonic atoms

NASA Astrophysics Data System (ADS)

Faustov, R. N.; Martynenko, A. P.; Martynenko, F. A.; Sorokin, V. V.

2017-12-01

On the basis of quasipotential method in quantum electrodynamics we calculate nuclear finite size radiative corrections of order α(Zα) 5 to the Lamb shift in muonic hydrogen and helium. To construct the interaction potential of particles, which gives the necessary contributions to the energy spectrum, we use the method of projection operators to states with a definite spin. Separate analytic expressions for the contributions of the muon self-energy, the muon vertex operator and the amplitude with spanning photon are obtained. We present also numerical results for these contributions using modern experimental data on the electromagnetic form factors of light nuclei.

Classical field configurations and infrared slavery

NASA Astrophysics Data System (ADS)

Swanson, Mark S.

1987-09-01

The problem of determining the energy of two spinor particles interacting through massless-particle exchange is analyzed using the path-integral method. A form for the long-range interaction energy is obtained by analyzing an abridged vertex derived from the parent theory. This abridged vertex describes the radiation of zero-momentum particles by pointlike sources. A path-integral formalism for calculating the energy of the radiation field associated with this abridged vertex is developed and applications are made to determine the energy necessary for adiabatic separation of two sources in quantum electrodynamics and for an SU(2) Yang-Mills theory. The latter theory is shown to be consistent with confinement via infrared slavery.

Six-vertex model and Schramm-Loewner evolution.

PubMed

Kenyon, Richard; Miller, Jason; Sheffield, Scott; Wilson, David B

2017-05-01

Square ice is a statistical mechanics model for two-dimensional ice, widely believed to have a conformally invariant scaling limit. We associate a Peano (space-filling) curve to a square ice configuration, and more generally to a so-called six-vertex model configuration, and argue that its scaling limit is a space-filling version of the random fractal curve SLE_{κ}, Schramm-Loewner evolution with parameter κ, where 4<κ≤12+8sqrt[2]. For square ice, κ=12. At the "free-fermion point" of the six-vertex model, κ=8+4sqrt[3]. These unusual values lie outside the classical interval 2≤κ≤8.

Belle II silicon vertex detector

NASA Astrophysics Data System (ADS)

Adamczyk, K.; Aihara, H.; Angelini, C.; Aziz, T.; Babu, V.; Bacher, S.; Bahinipati, S.; Barberio, E.; Baroncelli, Ti.; Baroncelli, To.; Basith, A. K.; Batignani, G.; Bauer, A.; Behera, P. K.; Bergauer, T.; Bettarini, S.; Bhuyan, B.; Bilka, T.; Bosi, F.; Bosisio, L.; Bozek, A.; Buchsteiner, F.; Casarosa, G.; Ceccanti, M.; Červenkov, D.; Chendvankar, S. R.; Dash, N.; Divekar, S. T.; Doležal, Z.; Dutta, D.; Enami, K.; Forti, F.; Friedl, M.; Hara, K.; Higuchi, T.; Horiguchi, T.; Irmler, C.; Ishikawa, A.; Jeon, H. B.; Joo, C. W.; Kandra, J.; Kang, K. H.; Kato, E.; Kawasaki, T.; Kodyš, P.; Kohriki, T.; Koike, S.; Kolwalkar, M. M.; Kvasnička, P.; Lanceri, L.; Lettenbicher, J.; Maki, M.; Mammini, P.; Mayekar, S. N.; Mohanty, G. B.; Mohanty, S.; Morii, T.; Nakamura, K. R.; Natkaniec, Z.; Negishi, K.; Nisar, N. K.; Onuki, Y.; Ostrowicz, W.; Paladino, A.; Paoloni, E.; Park, H.; Pilo, F.; Profeti, A.; Rashevskaya, I.; Rao, K. K.; Rizzo, G.; Rozanska, M.; Sandilya, S.; Sasaki, J.; Sato, N.; Schultschik, S.; Schwanda, C.; Seino, Y.; Shimizu, N.; Stypula, J.; Suzuki, J.; Tanaka, S.; Tanida, K.; Taylor, G. N.; Thalmeier, R.; Thomas, R.; Tsuboyama, T.; Uozumi, S.; Urquijo, P.; Vitale, L.; Volpi, M.; Watanuki, S.; Watson, I. J.; Webb, J.; Wiechczynski, J.; Williams, S.; Würkner, B.; Yamamoto, H.; Yin, H.; Yoshinobu, T.; Belle II SVD Collaboration

2016-09-01

The Belle II experiment at the SuperKEKB collider in Japan is designed to indirectly probe new physics using approximately 50 times the data recorded by its predecessor. An accurate determination of the decay-point position of subatomic particles such as beauty and charm hadrons as well as a precise measurement of low-momentum charged particles will play a key role in this pursuit. These will be accomplished by an inner tracking device comprising two layers of pixelated silicon detector and four layers of silicon vertex detector based on double-sided microstrip sensors. We describe herein the design, prototyping and construction efforts of the Belle-II silicon vertex detector.

Electron-Rich Carboranes. Studies of a Stereochemically Novel System, (CH3)4C4B7H9, and 11-Vertex Arachno Cluster.

DTIC Science & Technology

1981-01-01

FINSTER , R N GRIMES NOGOIR-75C-0305 UNCLASSIFIED TR-37 NL EOMEEEhE OFFICE OF NAVAL RESEARCH CONTRACT NO. i14.-7-C-31 q,4 TECHNICAL REPORT NO. 37L" 0...Electron-Rich Carboranes. Studies of a Stereochemically Novel System, (CH") 4C4 BH 9 , an 11-Vertex Arachno Cluster. .) David C./ Finster aad Russell N...System, (CH3 )4C4B7H9 , an l-Vertex Arachno Cluster 1 David C. Finster and Russell N. Grimes* Contribution from the Department of Chemistry University of

Domain-wall trapping in a ferromagnetic nanowire network

NASA Astrophysics Data System (ADS)

Saitoh, E.; Tanaka, M.; Miyajima, H.; Yamaoka, T.

2003-05-01

The magnetic domain configuration in a submicron Ni81Fe19 wire network has been investigated by magnetic force microscopy. To improve the responsivity of the magnetic force microscope, an active quality factor autocontrol method was adopted. In the remanent state, domain walls were observed trapped firmly at the vertexes of the network. The magnetic domain configurations appear to minimize the exchange energy at the vertexes. These results indicate that the magnetic property of the ferromagnetic network can be described in terms of the uniform magnetic moments of the wires and interwire magnetic interactions at the vertexes. The observed structure of the domain walls is well reproduced by micromagnetic simulations.

The role of physical digit representation and numerical magnitude representation in children's multiplication fact retrieval.

PubMed

De Visscher, Alice; Noël, Marie-Pascale; De Smedt, Bert

2016-12-01

Arithmetic facts, in particular multiplication tables, are thought to be stored in long-term memory and to be interference prone. At least two representations underpinning these arithmetic facts have been suggested: a physical representation of the digits and a numerical magnitude representation. We hypothesized that both representations are possible sources of interference that could explain individual differences in multiplication fact performance and/or in strategy use. We investigated the specificity of these interferences on arithmetic fact retrieval and explored the relation between interference and performance on the different arithmetic operations and on general mathematics achievement. Participants were 79 fourth-grade children (M age =9.6 years) who completed a products comparison and a multiplication production task with verbal strategy reports. Performances on a speeded calculation test including the four operations and on a general mathematics achievement test were also collected. Only the interference coming from physical representations was a significant predictor of the performance across multiplications. However, both the magnitude and physical representations were unique predictors of individual differences in multiplication. The frequency of the retrieval strategy across multiplication problems and across individuals was determined only by the physical representation, which therefore is suggested as being responsible for memory storage issues. Interestingly, this impact of physical representation was not observed when predicting performance on subtraction or on general mathematical achievement. In contrast, the impact of the numerical magnitude representation was more general in that it was observed across all arithmetic operations and in general mathematics achievement. Copyright © 2016 Elsevier Inc. All rights reserved.

Silicon Drift Detectors - A Novel Technology for Vertex Detectors

NASA Astrophysics Data System (ADS)

Lynn, D.

1996-10-01

Silicon Drift Detectors (SDD) are novel position sensing silicon detectors which operate in a manner analogous to gas drift detectors. Single SDD's were shown in the CERN NA45 experiment to permit excellent spatial resolution (< 10 μm), to handle large particle occupancy, and to require a small fraction of the number of electronic channels of an equivalent pixel detector. The Silicon Vertex Tracker (SVT) for the STAR experiment at RHIC is based on this new technology. The SVT will consist of 216 SDD's, each 6.3 cm by 6.3 cm, arranged in a three layer barrel design, covering 2 π in azimuth and ±1 in pseudo-rapidity. Over the last three years we undertook a concentrated R+D effort to optimize the performance of the detector by minimizing the inactive area, the operating voltage and the data volume. We will present test results from several wafer prototypes. The charge produced by the passage of ionizing particles through the bulk of the detectors is collected on segmented anodes, with a pitch of 250 μm, on the far edges of the detector. The anodes are wire-bonded to a thick film multi-chip module which contains preamplifier/shaper chips and CMOS based switched capacitor arrays used as an analog memory pipeline. The ADC is located off-detector. The complete readout chain from the wafer to the DAQ will be presented. Finally we will show physics performance simulations based on the resolution achieved by the SVT prototypes.

Gapless bosonic excitation without symmetry breaking: An algebraic spin liquid with soft gravitons

NASA Astrophysics Data System (ADS)

Xu, Cenke

2006-12-01

A quantum ground state of matter is realized in a bosonic model on a three-dimensional fcc lattice with emergent low energy excitations. The phase obtained is a stable gapless boson liquid phase, with algebraic boson density correlations. The stability of this phase is protected against the instanton effect and superfluidity by self-duality and large gauge symmetries on both sides of the duality. The gapless collective excitations of this phase closely resemble the graviton, although they have a soft ω˜k2 dispersion relation. There are three branches of gapless excitations in this phase, one of which is gapless scalar trace mode, the other two have the same polarization and gauge symmetries as the gravitons. The dynamics of this phase is described by a set of Maxwell’s equations. The defects carrying gauge charges can drive the system into the superfluid order when the defects are condensed; also the topological defects are coupled to the dual gauge field in the same manner as the charge defects couple to the original gauge field, after the condensation of the topological defects, the system is driven into the Mott insulator phase. In the two-dimensional case, the gapless soft graviton as well as the algebraic liquid phase are destroyed by the vertex operators in the dual theory, and the stripe order is most likely to take place close to the two-dimensional quantum critical point at which the vertex operators are tuned to zero.

Self-locking degree-4 vertex origami structures

PubMed Central

Li, Suyi; Wang, K. W.

2016-01-01

A generic degree-4 vertex (4-vertex) origami possesses one continuous degree-of-freedom for rigid folding, and this folding process can be stopped when two of its facets bind together. Such facet-binding will induce self-locking so that the overall structure stays at a pre-specified configuration without additional locking elements or actuators. Self-locking offers many promising properties, such as programmable deformation ranges and piecewise stiffness jumps, that could significantly advance many adaptive structural systems. However, despite its excellent potential, the origami self-locking features have not been well studied, understood, and used. To advance the state of the art, this research conducts a comprehensive investigation on the principles of achieving and harnessing self-locking in 4-vertex origami structures. Especially, for the first time, this study expands the 4-vertex structure construction from single-component to dual-component designs and investigates their self-locking behaviours. By exploiting various tessellation designs, this research discovers that the dual-component designs offer the origami structures with extraordinary attributes that the single-component structures do not have, which include the existence of flat-folded locking planes, programmable locking points and deformability. Finally, proof-of-concept experiments investigate how self-locking can effectively induce piecewise stiffness jumps. The results of this research provide new scientific knowledge and a systematic framework for the design, analysis and utilization of self-locking origami structures for many potential engineering applications. PMID:27956889

Self-locking degree-4 vertex origami structures.

PubMed

Fang, Hongbin; Li, Suyi; Wang, K W

2016-11-01

A generic degree-4 vertex (4-vertex) origami possesses one continuous degree-of-freedom for rigid folding, and this folding process can be stopped when two of its facets bind together. Such facet-binding will induce self-locking so that the overall structure stays at a pre-specified configuration without additional locking elements or actuators. Self-locking offers many promising properties, such as programmable deformation ranges and piecewise stiffness jumps, that could significantly advance many adaptive structural systems. However, despite its excellent potential, the origami self-locking features have not been well studied, understood, and used. To advance the state of the art, this research conducts a comprehensive investigation on the principles of achieving and harnessing self-locking in 4-vertex origami structures. Especially, for the first time, this study expands the 4-vertex structure construction from single-component to dual-component designs and investigates their self-locking behaviours. By exploiting various tessellation designs, this research discovers that the dual-component designs offer the origami structures with extraordinary attributes that the single-component structures do not have, which include the existence of flat-folded locking planes, programmable locking points and deformability. Finally, proof-of-concept experiments investigate how self-locking can effectively induce piecewise stiffness jumps. The results of this research provide new scientific knowledge and a systematic framework for the design, analysis and utilization of self-locking origami structures for many potential engineering applications.

GoFFish: A Sub-Graph Centric Framework for Large-Scale Graph Analytics1

DOE Office of Scientific and Technical Information (OSTI.GOV)

Simmhan, Yogesh; Kumbhare, Alok; Wickramaarachchi, Charith

2014-08-25

Large scale graph processing is a major research area for Big Data exploration. Vertex centric programming models like Pregel are gaining traction due to their simple abstraction that allows for scalable execution on distributed systems naturally. However, there are limitations to this approach which cause vertex centric algorithms to under-perform due to poor compute to communication overhead ratio and slow convergence of iterative superstep. In this paper we introduce GoFFish a scalable sub-graph centric framework co-designed with a distributed persistent graph storage for large scale graph analytics on commodity clusters. We introduce a sub-graph centric programming abstraction that combines themore » scalability of a vertex centric approach with the flexibility of shared memory sub-graph computation. We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility. Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading open source vertex centric implementation. We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility. Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading open source vertex centric implementation.« less

[Surface characteristics of the acrylic resins according to the polishing methods].

PubMed

Vitalariu, Anca Mihaela; Lazăr, Lenuţa; Buruiană, Tinca; Diaconu, Diana; Tatarciuc, Monica Silvia

2011-01-01

The objective of this study was to evaluate the effect of the polishing technique and glazing on the porosity of the dental resins. The studied resins were: Castapress/Vertex, Prothyl Hot/Zermack, Rapid Simplified/Vertex, Duracryl Plus/Spofa Dental, Vertex-Soft/Vertex, Superacryl Plus/Spofa Dental. Thirty specimens, five for every resin, of 50/25/2 cm in size were done. One surface of each sample was polished with extrahard tungsten carbide burs, the other surface being polished with extrahard extrafine and diamond burs. The final polishing was done using a conventional method: pumice, water and lathe bristle brush for 90 seconds, 1500 rpm and soft leather polishing wheel for 90 seconds, 3000 rpm. Twenty surfaces were glazed after polishing with Glaze/Bosworth. Vertex Soft specimens were not polished because this is a resilient material. Surface porosity of the acrylic resin specimens was measured by optical microscopy. The lowest porosity was obtained by conventional polishing combined with glazing techniques. No differences between glazed and non/glazed self-curing resin specimens were noticed, but there were differences between self-curing and heat-curing resins. Conventional lathe polishing method is an effective and reliable technique for polishing dental resins. Specimens of self-curing resin had a higher porosity than heat curing resin following the same surface treatment. Higher surface smoothness was obtained by conventional lathe polishing completed by glazing.

Ocular vestibular evoked myogenic potentials to vertex low frequency vibration as a diagnostic test for superior canal dehiscence.

PubMed

Verrecchia, Luca; Westin, Magnus; Duan, Maoli; Brantberg, Krister

2016-04-01

To explore ocular vestibular evoked myogenic potentials (oVEMP) to low-frequency vertex vibration (125 Hz) as a diagnostic test for superior canal dehiscence (SCD) syndrome. The oVEMP using 125 Hz single cycle bone-conducted vertex vibration were tested in 15 patients with unilateral superior canal dehiscence (SCD) syndrome, 15 healthy controls and in 20 patients with unilateral vestibular loss due to vestibular neuritis. Amplitude, amplitude asymmetry ratio, latency and interaural latency difference were parameters of interest. The oVEMP amplitude was significantly larger in SCD patients when affected sides (53 μVolts) were compared to non-affected (17.2 μVolts) or compared to healthy controls (13.6 μVolts). Amplitude larger than 33.8 μVolts separates effectively the SCD ears from the healthy ones with sensitivity of 87% and specificity of 93%. The other three parameters showed an overlap between affected SCD ears and non-affected as well as between SCD ears and those in the two control groups. oVEMP amplitude distinguishes SCD ears from healthy ones using low-frequency vibration stimuli at vertex. Amplitude analysis of oVEMP evoked by low-frequency vertex bone vibration stimulation is an additional indicator of SCD syndrome and might serve for diagnosing SCD patients with coexistent conductive middle ear problems. Copyright © 2016 International Federation of Clinical Neurophysiology. Published by Elsevier Ireland Ltd. All rights reserved.

Operator algebra as an application of logarithmic representation of infinitesimal generators

NASA Astrophysics Data System (ADS)

Iwata, Yoritaka

2018-02-01

The operator algebra is introduced based on the framework of logarithmic representation of infinitesimal generators. In conclusion a set of generally-unbounded infinitesimal generators is characterized as a module over the Banach algebra.

Operator assistant systems - An experimental approach using a telerobotics application

NASA Technical Reports Server (NTRS)

Boy, Guy A.; Mathe, Nathalie

1993-01-01

This article presents a knowledge-based system methodology for developing operator assistant (OA) systems in dynamic and interactive environments. This is a problem both of training and design, which is the subject of this article. Design includes both design of the system to be controlled and design of procedures for operating this system. A specific knowledge representation is proposed for representing the corresponding system and operational knowledge. This representation is based on the situation recognition and analytical reasoning paradigm. It tries to make explicit common factors involved in both human and machine intelligence, including perception and reasoning. An OA system based on this representation has been developed for space telerobotics. Simulations have been carried out with astronauts and the resulting protocols have been analyzed. Results show the relevance of the approach and have been used for improving the knowledge representation and the OA architecture.

Knowledge representation in space flight operations

NASA Technical Reports Server (NTRS)

Busse, Carl

1989-01-01

In space flight operations rapid understanding of the state of the space vehicle is essential. Representation of knowledge depicting space vehicle status in a dynamic environment presents a difficult challenge. The NASA Jet Propulsion Laboratory has pursued areas of technology associated with the advancement of spacecraft operations environment. This has led to the development of several advanced mission systems which incorporate enhanced graphics capabilities. These systems include: (1) Spacecraft Health Automated Reasoning Prototype (SHARP); (2) Spacecraft Monitoring Environment (SME); (3) Electrical Power Data Monitor (EPDM); (4) Generic Payload Operations Control Center (GPOCC); and (5) Telemetry System Monitor Prototype (TSM). Knowledge representation in these systems provides a direct representation of the intrinsic images associated with the instrument and satellite telemetry and telecommunications systems. The man-machine interface includes easily interpreted contextual graphic displays. These interactive video displays contain multiple display screens with pop-up windows and intelligent, high resolution graphics linked through context and mouse-sensitive icons and text.

Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator

PubMed Central

Mohamd Shoukry, Alaa; Gani, Showkat

2017-01-01

Genetic algorithms are evolutionary techniques used for optimization purposes according to survival of the fittest idea. These methods do not ensure optimal solutions; however, they give good approximation usually in time. The genetic algorithms are useful for NP-hard problems, especially the traveling salesman problem. The genetic algorithm depends on selection criteria, crossover, and mutation operators. To tackle the traveling salesman problem using genetic algorithms, there are various representations such as binary, path, adjacency, ordinal, and matrix representations. In this article, we propose a new crossover operator for traveling salesman problem to minimize the total distance. This approach has been linked with path representation, which is the most natural way to represent a legal tour. Computational results are also reported with some traditional path representation methods like partially mapped and order crossovers along with new cycle crossover operator for some benchmark TSPLIB instances and found improvements. PMID:29209364

Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator.

PubMed

Hussain, Abid; Muhammad, Yousaf Shad; Nauman Sajid, M; Hussain, Ijaz; Mohamd Shoukry, Alaa; Gani, Showkat

2017-01-01

Genetic algorithms are evolutionary techniques used for optimization purposes according to survival of the fittest idea. These methods do not ensure optimal solutions; however, they give good approximation usually in time. The genetic algorithms are useful for NP-hard problems, especially the traveling salesman problem. The genetic algorithm depends on selection criteria, crossover, and mutation operators. To tackle the traveling salesman problem using genetic algorithms, there are various representations such as binary, path, adjacency, ordinal, and matrix representations. In this article, we propose a new crossover operator for traveling salesman problem to minimize the total distance. This approach has been linked with path representation, which is the most natural way to represent a legal tour. Computational results are also reported with some traditional path representation methods like partially mapped and order crossovers along with new cycle crossover operator for some benchmark TSPLIB instances and found improvements.

Lattices, vertex algebras, and modular categories

NASA Astrophysics Data System (ADS)

van Ekeren, Jethro

2018-03-01

In this note we give an account of recent progress on the construction of holomorphic vertex algebras as cyclic orbifolds as well as related topics in lattices and modular categories. We present a novel computation of the Schur indicator of a lattice involution orbifold using finite Heisenberg groups and discriminant forms.

The vertex and large angle detectors of a spectrometer system for high energy muon physics

NASA Astrophysics Data System (ADS)

Albanese, J. P.; Allkofer, O. C.; Arneodo, M.; Aubert, J. J.; Becks, K. H.; Bee, C.; Benchouk, C.; Bernaudin, B.; Bertsch, Y.; Bianchi, F.; Bibby, J.; Bird, I.; Blum, D.; Böhm, E.; Botterill, D.; De Bouard, X.; Brasse, F. W.; Braun, H.; Broll, C.; Brown, S.; Brück, H.; Callebaut, D.; Carr, J.; Clifft, R.; Cobb, J. H.; Coignet, G.; Combley, F.; Cornelssen, M.; Costa, F.; Coughlan, J.; Court, G. R.; D'Agostini, G.; Dau, W. D.; Davies, J. K.; Davis, A.; Dengler, F.; Derado, I.; Dobinson, R. W.; Dosselli, U.; Drees, J.; Dumont, J. J.; Eckardt, V.; Edwards, A.; Edwards, M.; Falley, G.; Favier, J.; Ferrero, M. I.; Figiel, J.; Flauger, W.; Gabathuler, E.; Gamet, R.; Gayler, J.; Gebauer, H. J.; Gössling, C.; Haas, J.; Hasert, F. J.; Hayman, P.; Heusse, P.; Jaffré, M.; Janata, F.; Jancso, G.; Johnson, A. S.; Kabuss, E. M.; Kahl, T.; Kellner, G.; Koll, J.; Korbel, V.; Krüger, J.; Landgraf, U.; Lanske, D.; Lebeau, M.; Loken, J.; Maire, M.; Manz, A.; Mermet-Guyennet, M.; Minssieux, H.; Mohr, W.; Montanet, F.; Montgomery, H. E.; Moser, K.; Mount, R. P.; Moynot, M.; Müller, H.; Nagy, E.; Nassalski, J.; Noppe, J. M.; Norton, P. R.; Osborne, A. M.; Pascaud, C.; Paul, L.; Payre, P.; Peroni, C.; Perrot, G.; Pessard, H.; Pettingale, J.; Pötsch, M.; Preissner, H.; Renton, P.; Ribarics, P.; Rith, K.; Röhner, F.; Rondio, E.; Rousseau, M. D.; Schlagböhmer, A.; Schmitz, N.; Scaramelli, A.; Schneegans, M.; Schultze, K.; Scory, M.; Shiers, J.; Singer, G.; Sloan, T.; Smith, R.; Sproston, M.; Stier, H. E.; Stockhausen, W.; Studt, M.; Thénard, J. M.; Thiele, K.; Thompson, J. C.; De La Torre, A.; Wahlen, H.; Wallucks, W.; Watson, E.; Whalley, M.; Williams, D. A.; Williams, W. S. C.; Wimpenny, S.; Windmolders, R.; Winklmüller, G.; Wolf, G.; Zank, P.; European Muon Collaboration

1983-07-01

A description is given of the detector system which forms the large angle spectrometer and vertex detector of the EMC spectrometer. The apparatus is used in the NA9 experiment which studies the complete hadronic final state from the interaction of high energy muons.

Baxter operators and Hamiltonians for "nearly all" integrable closed gl(n) spin chains

NASA Astrophysics Data System (ADS)

Frassek, Rouven; Łukowski, Tomasz; Meneghelli, Carlo; Staudacher, Matthias

2013-09-01

We continue our systematic construction of Baxter Q-operators for spin chains, which is based on certain degenerate solutions of the Yang-Baxter equation. Here we generalize our approach from the fundamental representation of gl(n) to generic finite-dimensional representations in quantum space. The results equally apply to non-compact representations of highest or lowest weight type. We furthermore fill an apparent gap in the literature, and provide the nearest-neighbor Hamiltonians of the spin chains in question for all cases where the gl(n) representations are described by rectangular Young diagrams, as well as for their infinite-dimensional generalizations. They take the form of digamma functions depending on operator-valued shifted weights. We believe that this condition follows from [R0,I,Jba]=0, [R0,I,Jb˙a˙]=0, [R0,I,Jbc˙Jc˙a]=0, which are specializations, respectively, of the last equation in (2.14), (2.16) and (2.19) in the case of minimal representations. Clearly R0,I can be considered as a function of the Casimir operators of gl(n) as well. These are just constants in a given irreducible representation and will not enter the discussion regarding the determination of R0,I.

Chemical graphs, molecular matrices and topological indices in chemoinformatics and quantitative structure-activity relationships.

PubMed

Ivanciuc, Ovidiu

2013-06-01

Chemical and molecular graphs have fundamental applications in chemoinformatics, quantitative structureproperty relationships (QSPR), quantitative structure-activity relationships (QSAR), virtual screening of chemical libraries, and computational drug design. Chemoinformatics applications of graphs include chemical structure representation and coding, database search and retrieval, and physicochemical property prediction. QSPR, QSAR and virtual screening are based on the structure-property principle, which states that the physicochemical and biological properties of chemical compounds can be predicted from their chemical structure. Such structure-property correlations are usually developed from topological indices and fingerprints computed from the molecular graph and from molecular descriptors computed from the three-dimensional chemical structure. We present here a selection of the most important graph descriptors and topological indices, including molecular matrices, graph spectra, spectral moments, graph polynomials, and vertex topological indices. These graph descriptors are used to define several topological indices based on molecular connectivity, graph distance, reciprocal distance, distance-degree, distance-valency, spectra, polynomials, and information theory concepts. The molecular descriptors and topological indices can be developed with a more general approach, based on molecular graph operators, which define a family of graph indices related by a common formula. Graph descriptors and topological indices for molecules containing heteroatoms and multiple bonds are computed with weighting schemes based on atomic properties, such as the atomic number, covalent radius, or electronegativity. The correlation in QSPR and QSAR models can be improved by optimizing some parameters in the formula of topological indices, as demonstrated for structural descriptors based on atomic connectivity and graph distance.

Hypergraph topological quantities for tagged social networks.

PubMed

Zlatić, Vinko; Ghoshal, Gourab; Caldarelli, Guido

2009-09-01

Recent years have witnessed the emergence of a new class of social networks, which require us to move beyond previously employed representations of complex graph structures. A notable example is that of the folksonomy, an online process where users collaboratively employ tags to resources to impart structure to an otherwise undifferentiated database. In a recent paper, we proposed a mathematical model that represents these structures as tripartite hypergraphs and defined basic topological quantities of interest. In this paper, we extend our model by defining additional quantities such as edge distributions, vertex similarity and correlations as well as clustering. We then empirically measure these quantities on two real life folksonomies, the popular online photo sharing site Flickr and the bookmarking site CiteULike. We find that these systems share similar qualitative features with the majority of complex networks that have been previously studied. We propose that the quantities and methodology described here can be used as a standard tool in measuring the structure of tagged networks.

Hypergraph topological quantities for tagged social networks

NASA Astrophysics Data System (ADS)

Zlatić, Vinko; Ghoshal, Gourab; Caldarelli, Guido

2009-09-01

Recent years have witnessed the emergence of a new class of social networks, which require us to move beyond previously employed representations of complex graph structures. A notable example is that of the folksonomy, an online process where users collaboratively employ tags to resources to impart structure to an otherwise undifferentiated database. In a recent paper, we proposed a mathematical model that represents these structures as tripartite hypergraphs and defined basic topological quantities of interest. In this paper, we extend our model by defining additional quantities such as edge distributions, vertex similarity and correlations as well as clustering. We then empirically measure these quantities on two real life folksonomies, the popular online photo sharing site Flickr and the bookmarking site CiteULike. We find that these systems share similar qualitative features with the majority of complex networks that have been previously studied. We propose that the quantities and methodology described here can be used as a standard tool in measuring the structure of tagged networks.

Non-Abelian Stokes theorem for the Wilson loop operator in an arbitrary representation and its implication to quark confinement

NASA Astrophysics Data System (ADS)

Matsudo, Ryutaro; Kondo, Kei-Ichi

2015-12-01

We give a gauge-independent definition of magnetic monopoles in the S U (N ) Yang-Mills theory through the Wilson loop operator. For this purpose, we give an explicit proof of the Diakonov-Petrov version of the non-Abelian Stokes theorem for the Wilson loop operator in an arbitrary representation of the S U (N ) gauge group to derive a new form for the non-Abelian Stokes theorem. The new form is used to extract the magnetic-monopole contribution to the Wilson loop operator in a gauge-invariant way, which enables us to discuss confinement of quarks in any representation from the viewpoint of the dual superconductor vacuum.

Picometer Level Modeling of a Shared Vertex Double Corner Cube in the Space Interferometry Mission Kite Testbed

NASA Technical Reports Server (NTRS)

Kuan, Gary M.; Dekens, Frank G.

2006-01-01

The Space Interferometry Mission (SIM) is a microarcsecond interferometric space telescope that requires picometer level precision measurements of its truss and interferometer baselines. Single-gauge metrology errors due to non-ideal physical characteristics of corner cubes reduce the angular measurement capability of the science instrument. Specifically, the non-common vertex error (NCVE) of a shared vertex, double corner cube introduces micrometer level single-gauge errors in addition to errors due to dihedral angles and reflection phase shifts. A modified SIM Kite Testbed containing an articulating double corner cube is modeled and the results are compared to the experimental testbed data. The results confirm modeling capability and viability of calibration techniques.

Bubbly vertex dynamics: A dynamical and geometrical model for epithelial tissues with curved cell shapes

NASA Astrophysics Data System (ADS)

Ishimoto, Yukitaka; Morishita, Yoshihiro

2014-11-01

In order to describe two-dimensionally packed cells in epithelial tissues both mathematically and physically, there have been developed several sorts of geometrical models, such as the vertex model, the finite element model, the cell-centered model, and the cellular Potts model. So far, in any case, pressures have not neatly been dealt with and the curvatures of the cell boundaries have been even omitted through their approximations. We focus on these quantities and formulate them in the vertex model. Thus, a model with the curvatures is constructed, and its algorithm for simulation is provided. The possible extensions and applications of this model are also discussed.

Pileup Mitigation with Machine Learning (PUMML)

NASA Astrophysics Data System (ADS)

Komiske, Patrick T.; Metodiev, Eric M.; Nachman, Benjamin; Schwartz, Matthew D.

2017-12-01

Pileup involves the contamination of the energy distribution arising from the primary collision of interest (leading vertex) by radiation from soft collisions (pileup). We develop a new technique for removing this contamination using machine learning and convolutional neural networks. The network takes as input the energy distribution of charged leading vertex particles, charged pileup particles, and all neutral particles and outputs the energy distribution of particles coming from leading vertex alone. The PUMML algorithm performs remarkably well at eliminating pileup distortion on a wide range of simple and complex jet observables. We test the robustness of the algorithm in a number of ways and discuss how the network can be trained directly on data.

Vertex Movement for Mission Status Graphics: A Polar-Star Display

NASA Technical Reports Server (NTRS)

Trujillo, Anna

2002-01-01

Humans are traditionally bad monitors, especially over long periods of time on reliable systems, and they are being called upon to do this more and more as systems become further automated. Because of this, there is a need to find a way to display the monitoring information to the human operator in such a way that he can notice pertinent deviations in a timely manner. One possible solution is to use polar-star displays that will show deviations from normal in a more salient manner. A polar-star display uses a polygon's vertices to report values. An important question arises, though, of how the vertices should move. This experiment investigated two particular issues of how the vertices should move: (1) whether the movement of the vertices should be continuous or discrete and (2) whether the parameters that made up each vertex should always move in one direction regardless of parameter sign or move in both directions indicating parameter sign. The results indicate that relative movement direction is best. Subjects performed better with this movement type and they subjectively preferred it to the absolute movement direction. As for movement type, no strong preferences were shown.

A measurement of material in the ATLAS tracker using secondary hadronic interactions in 7 TeV pp collisions

DOE PAGES

Aaboud, M.; Aad, G.; Abbott, B.; ...

2016-11-30

Knowledge of the material in the ATLAS inner tracking detector is crucial in understanding the reconstruction of charged-particle tracks, the performance of algorithms that identify jets containing b-hadrons and is also essential to reduce background in searches for exotic particles that can decay within the inner detector volume. Interactions of primary hadrons produced in pp collisions with the material in the inner detector are used to map the location and amount of this material. The hadronic interactions of primary particles may result in secondary vertices, which in this analysis are reconstructed by an inclusive vertex-finding algorithm. Data were collected usingmore » minimum-bias triggers by the ATLAS detector operating at the LHC during 2010 at centre-of-mass energy √s = 7 TeV, and correspond to an integrated luminosity of 19 nb -1. Kinematic properties of these secondary vertices are used to study the validity of the modelling of hadronic interactions in simulation. Finally, secondary-vertex yields are compared between data and simulation over a volume of about 0.7 m 3 around the interaction point, and agreement is found within overall uncertainties.« less

A measurement of material in the ATLAS tracker using secondary hadronic interactions in 7 TeV pp collisions

NASA Astrophysics Data System (ADS)

Aaboud, M.; Aad, G.; Abbott, B.; Abdallah, J.; Abdinov, O.; Abeloos, B.; Aben, R.; AbouZeid, O. S.; Abraham, N. L.; Abramowicz, H.; Abreu, H.; Abreu, R.; Abulaiti, Y.; Acharya, B. S.; Adamczyk, L.; Adams, D. L.; Adelman, J.; Adomeit, S.; Adye, T.; Affolder, A. A.; Agatonovic-Jovin, T.; Agricola, J.; Aguilar-Saavedra, J. A.; Ahlen, S. P.; Ahmadov, F.; Aielli, G.; Akerstedt, H.; Åkesson, T. P. A.; Akimov, A. V.; Alberghi, G. L.; Albert, J.; Albrand, S.; Alconada Verzini, M. J.; Aleksa, M.; Aleksandrov, I. N.; Alexa, C.; Alexander, G.; Alexopoulos, T.; Alhroob, M.; Ali, B.; Aliev, M.; Alimonti, G.; Alison, J.; Alkire, S. P.; Allbrooke, B. M. M.; Allen, B. W.; Allport, P. P.; Aloisio, A.; Alonso, A.; Alonso, F.; Alpigiani, C.; Alstaty, M.; Alvarez Gonzalez, B.; Álvarez Piqueras, D.; Alviggi, M. G.; Amadio, B. T.; Amako, K.; Amaral Coutinho, Y.; Amelung, C.; Amidei, D.; Amor Dos Santos, S. P.; Amorim, A.; Amoroso, S.; Amundsen, G.; Anastopoulos, C.; Ancu, L. S.; Andari, N.; Andeen, T.; Anders, C. F.; Anders, G.; Anders, J. K.; Anderson, K. J.; Andreazza, A.; Andrei, V.; Angelidakis, S.; Angelozzi, I.; Anger, P.; Angerami, A.; Anghinolfi, F.; Anisenkov, A. V.; Anjos, N.; Annovi, A.; Antel, C.; Antonelli, M.; Antonov, A.; Anulli, F.; Aoki, M.; Aperio Bella, L.; Arabidze, G.; Arai, Y.; Araque, J. P.; Arce, A. T. H.; Arduh, F. A.; Arguin, J.-F.; Argyropoulos, S.; Arik, M.; Armbruster, A. J.; Armitage, L. J.; Arnaez, O.; Arnold, H.; Arratia, M.; Arslan, O.; Artamonov, A.; Artoni, G.; Artz, S.; Asai, S.; Asbah, N.; Ashkenazi, A.; Åsman, B.; Asquith, L.; Assamagan, K.; Astalos, R.; Atkinson, M.; Atlay, N. B.; Augsten, K.; Avolio, G.; Axen, B.; Ayoub, M. K.; Azuelos, G.; Baak, M. A.; Baas, A. E.; Baca, M. J.; Bachacou, H.; Bachas, K.; Backes, M.; Backhaus, M.; Bagiacchi, P.; Bagnaia, P.; Bai, Y.; Baines, J. T.; Baker, O. K.; Baldin, E. M.; Balek, P.; Balestri, T.; Balli, F.; Balunas, W. K.; Banas, E.; Banerjee, Sw.; Bannoura, A. A. E.; Barak, L.; Barberio, E. L.; Barberis, D.; Barbero, M.; Barillari, T.; Barisits, M.-S.; Barklow, T.; Barlow, N.; Barnes, S. L.; Barnett, B. M.; Barnett, R. M.; Barnovska, Z.; Baroncelli, A.; Barone, G.; Barr, A. J.; Barranco Navarro, L.; Barreiro, F.; Barreiro Guimarães da Costa, J.; Bartoldus, R.; Barton, A. E.; Bartos, P.; Basalaev, A.; Bassalat, A.; Bates, R. L.; Batista, S. J.; Batley, J. R.; Battaglia, M.; Bauce, M.; Bauer, F.; Bawa, H. S.; Beacham, J. B.; Beattie, M. D.; Beau, T.; Beauchemin, P. H.; Bechtle, P.; Beck, H. P.; Becker, K.; Becker, M.; Beckingham, M.; Becot, C.; Beddall, A. J.; Beddall, A.; Bednyakov, V. A.; Bedognetti, M.; Bee, C. P.; Beemster, L. J.; Beermann, T. A.; Begel, M.; Behr, J. K.; Belanger-Champagne, C.; Bell, A. S.; Bella, G.; Bellagamba, L.; Bellerive, A.; Bellomo, M.; Belotskiy, K.; Beltramello, O.; Belyaev, N. L.; Benary, O.; Benchekroun, D.; Bender, M.; Bendtz, K.; Benekos, N.; Benhammou, Y.; Benhar Noccioli, E.; Benitez, J.; Benjamin, D. P.; Bensinger, J. R.; Bentvelsen, S.; Beresford, L.; Beretta, M.; Berge, D.; Bergeaas Kuutmann, E.; Berger, N.; Beringer, J.; Berlendis, S.; Bernard, N. R.; Bernius, C.; Bernlochner, F. U.; Berry, T.; Berta, P.; Bertella, C.; Bertoli, G.; Bertolucci, F.; Bertram, I. A.; Bertsche, C.; Bertsche, D.; Besjes, G. J.; Bessidskaia Bylund, O.; Bessner, M.; Besson, N.; Betancourt, C.; Bethani, A.; Bethke, S.; Bevan, A. J.; Bianchi, R. M.; Bianchini, L.; Bianco, M.; Biebel, O.; Biedermann, D.; Bielski, R.; Biesuz, N. V.; Biglietti, M.; Bilbao De Mendizabal, J.; Billoud, T. R. V.; Bilokon, H.; Bindi, M.; Binet, S.; Bingul, A.; Bini, C.; Biondi, S.; Bisanz, T.; Bjergaard, D. M.; Black, C. W.; Black, J. E.; Black, K. M.; Blackburn, D.; Blair, R. E.; Blanchard, J.-B.; Blazek, T.; Bloch, I.; Blocker, C.; Blum, W.; Blumenschein, U.; Blunier, S.; Bobbink, G. J.; Bobrovnikov, V. S.; Bocchetta, S. S.; Bocci, A.; Bock, C.; Boehler, M.; Boerner, D.; Bogaerts, J. A.; Bogavac, D.; Bogdanchikov, A. G.; Bohm, C.; Boisvert, V.; Bokan, P.; Bold, T.; Boldyrev, A. S.; Bomben, M.; Bona, M.; Boonekamp, M.; Borisov, A.; Borissov, G.; Bortfeldt, J.; Bortoletto, D.; Bortolotto, V.; Bos, K.; Boscherini, D.; Bosman, M.; Bossio Sola, J. D.; Boudreau, J.; Bouffard, J.; Bouhova-Thacker, E. V.; Boumediene, D.; Bourdarios, C.; Boutle, S. K.; Boveia, A.; Boyd, J.; Boyko, I. R.; Bracinik, J.; Brandt, A.; Brandt, G.; Brandt, O.; Bratzler, U.; Brau, B.; Brau, J. E.; Braun, H. M.; Breaden Madden, W. D.; Brendlinger, K.; Brennan, A. J.; Brenner, L.; Brenner, R.; Bressler, S.; Bristow, T. M.; Britton, D.; Britzger, D.; Brochu, F. M.; Brock, I.; Brock, R.; Brooijmans, G.; Brooks, T.; Brooks, W. K.; Brosamer, J.; Brost, E.; Broughton, J. H.; Bruckman de Renstrom, P. A.; Bruncko, D.; Bruneliere, R.; Bruni, A.; Bruni, G.; Bruni, L. S.; Brunt, BH; Bruschi, M.; Bruscino, N.; Bryant, P.; Bryngemark, L.; Buanes, T.; Buat, Q.; Buchholz, P.; Buckley, A. G.; Budagov, I. A.; Buehrer, F.; Bugge, M. K.; Bulekov, O.; Bullock, D.; Burckhart, H.; Burdin, S.; Burgard, C. D.; Burghgrave, B.; Burka, K.; Burke, S.; Burmeister, I.; Burr, J. T. P.; Busato, E.; Büscher, D.; Büscher, V.; Bussey, P.; Butler, J. M.; Buttar, C. M.; Butterworth, J. M.; Butti, P.; Buttinger, W.; Buzatu, A.; Buzykaev, A. R.; Cabrera Urbán, S.; Caforio, D.; Cairo, V. M.; Cakir, O.; Calace, N.; Calafiura, P.; Calandri, A.; Calderini, G.; Calfayan, P.; Callea, G.; Caloba, L. P.; Calvente Lopez, S.; Calvet, D.; Calvet, S.; Calvet, T. P.; Camacho Toro, R.; Camarda, S.; Camarri, P.; Cameron, D.; Caminal Armadans, R.; Camincher, C.; Campana, S.; Campanelli, M.; Camplani, A.; Campoverde, A.; Canale, V.; Canepa, A.; Cano Bret, M.; Cantero, J.; Cantrill, R.; Cao, T.; Capeans Garrido, M. D. M.; Caprini, I.; Caprini, M.; Capua, M.; Caputo, R.; Carbone, R. M.; Cardarelli, R.; Cardillo, F.; Carli, I.; Carli, T.; Carlino, G.; Carminati, L.; Caron, S.; Carquin, E.; Carrillo-Montoya, G. D.; Carter, J. R.; Carvalho, J.; Casadei, D.; Casado, M. P.; Casolino, M.; Casper, D. W.; Castaneda-Miranda, E.; Castelijn, R.; Castelli, A.; Castillo Gimenez, V.; Castro, N. F.; Catinaccio, A.; Catmore, J. R.; Cattai, A.; Caudron, J.; Cavaliere, V.; Cavallaro, E.; Cavalli, D.; Cavalli-Sforza, M.; Cavasinni, V.; Ceradini, F.; Cerda Alberich, L.; Cerio, B. C.; Cerqueira, A. S.; Cerri, A.; Cerrito, L.; Cerutti, F.; Cerv, M.; Cervelli, A.; Cetin, S. A.; Chafaq, A.; Chakraborty, D.; Chan, S. K.; Chan, Y. L.; Chang, P.; Chapman, J. D.; Charlton, D. G.; Chatterjee, A.; Chau, C. C.; Chavez Barajas, C. A.; Che, S.; Cheatham, S.; Chegwidden, A.; Chekanov, S.; Chekulaev, S. V.; Chelkov, G. A.; Chelstowska, M. A.; Chen, C.; Chen, H.; Chen, K.; Chen, S.; Chen, S.; Chen, X.; Chen, Y.; Cheng, H. C.; Cheng, H. J.; Cheng, Y.; Cheplakov, A.; Cheremushkina, E.; Cherkaoui El Moursli, R.; Chernyatin, V.; Cheu, E.; Chevalier, L.; Chiarella, V.; Chiarelli, G.; Chiodini, G.; Chisholm, A. S.; Chitan, A.; Chizhov, M. V.; Choi, K.; Chomont, A. R.; Chouridou, S.; Chow, B. K. B.; Christodoulou, V.; Chromek-Burckhart, D.; Chudoba, J.; Chuinard, A. J.; Chwastowski, J. J.; Chytka, L.; Ciapetti, G.; Ciftci, A. K.; Cinca, D.; Cindro, V.; Cioara, I. A.; Ciocca, C.; Ciocio, A.; Cirotto, F.; Citron, Z. H.; Citterio, M.; Ciubancan, M.; Clark, A.; Clark, B. L.; Clark, M. R.; Clark, P. J.; Clarke, R. N.; Clement, C.; Coadou, Y.; Cobal, M.; Coccaro, A.; Cochran, J.; Colasurdo, L.; Cole, B.; Colijn, A. P.; Collot, J.; Colombo, T.; Compostella, G.; Conde Muiño, P.; Coniavitis, E.; Connell, S. H.; Connelly, I. A.; Consorti, V.; Constantinescu, S.; Conti, G.; Conventi, F.; Cooke, M.; Cooper, B. D.; Cooper-Sarkar, A. M.; Cormier, K. J. R.; Cornelissen, T.; Corradi, M.; Corriveau, F.; Corso-Radu, A.; Cortes-Gonzalez, A.; Cortiana, G.; Costa, G.; Costa, M. J.; Costanzo, D.; Cottin, G.; Cowan, G.; Cox, B. E.; Cranmer, K.; Crawley, S. J.; Cree, G.; Crépé-Renaudin, S.; Crescioli, F.; Cribbs, W. A.; Crispin Ortuzar, M.; Cristinziani, M.; Croft, V.; Crosetti, G.; Cueto, A.; Cuhadar Donszelmann, T.; Cummings, J.; Curatolo, M.; Cúth, J.; Czirr, H.; Czodrowski, P.; D'amen, G.; D'Auria, S.; D'Onofrio, M.; Da Cunha Sargedas De Sousa, M. J.; Da Via, C.; Dabrowski, W.; Dado, T.; Dai, T.; Dale, O.; Dallaire, F.; Dallapiccola, C.; Dam, M.; Dandoy, J. R.; Dang, N. P.; Daniells, A. C.; Dann, N. S.; Danninger, M.; Dano Hoffmann, M.; Dao, V.; Darbo, G.; Darmora, S.; Dassoulas, J.; Dattagupta, A.; Davey, W.; David, C.; Davidek, T.; Davies, M.; Davison, P.; Dawe, E.; Dawson, I.; Daya-Ishmukhametova, R. K.; De, K.; de Asmundis, R.; De Benedetti, A.; De Castro, S.; De Cecco, S.; De Groot, N.; de Jong, P.; De la Torre, H.; De Lorenzi, F.; De Maria, A.; De Pedis, D.; De Salvo, A.; De Sanctis, U.; De Santo, A.; De Vivie De Regie, J. B.; Dearnaley, W. J.; Debbe, R.; Debenedetti, C.; Dedovich, D. V.; Dehghanian, N.; Deigaard, I.; Del Gaudio, M.; Del Peso, J.; Del Prete, T.; Delgove, D.; Deliot, F.; Delitzsch, C. M.; Dell'Acqua, A.; Dell'Asta, L.; Dell'Orso, M.; Della Pietra, M.; della Volpe, D.; Delmastro, M.; Delsart, P. A.; DeMarco, D. A.; Demers, S.; Demichev, M.; Demilly, A.; Denisov, S. P.; Denysiuk, D.; Derendarz, D.; Derkaoui, J. E.; Derue, F.; Dervan, P.; Desch, K.; Deterre, C.; Dette, K.; Deviveiros, P. O.; Dewhurst, A.; Dhaliwal, S.; Di Ciaccio, A.; Di Ciaccio, L.; Di Clemente, W. K.; Di Donato, C.; Di Girolamo, A.; Di Girolamo, B.; Di Micco, B.; Di Nardo, R.; Di Simone, A.; Di Sipio, R.; Di Valentino, D.; Diaconu, C.; Diamond, M.; Dias, F. A.; Diaz, M. A.; Diehl, E. B.; Dietrich, J.; Diglio, S.; Dimitrievska, A.; Dingfelder, J.; Dita, P.; Dita, S.; Dittus, F.; Djama, F.; Djobava, T.; Djuvsland, J. I.; do Vale, M. A. B.; Dobos, D.; Dobre, M.; Doglioni, C.; Dolejsi, J.; Dolezal, Z.; Donadelli, M.; Donati, S.; Dondero, P.; Donini, J.; Dopke, J.; Doria, A.; Dova, M. T.; Doyle, A. T.; Drechsler, E.; Dris, M.; Du, Y.; Duarte-Campderros, J.; Duchovni, E.; Duckeck, G.; Ducu, O. A.; Duda, D.; Dudarev, A.; Dudder, A. Chr.; Duffield, E. M.; Duflot, L.; Dührssen, M.; Dumancic, M.; Dunford, M.; Duran Yildiz, H.; Düren, M.; Durglishvili, A.; Duschinger, D.; Dutta, B.; Dyndal, M.; Eckardt, C.; Ecker, K. M.; Edgar, R. C.; Edwards, N. C.; Eifert, T.; Eigen, G.; Einsweiler, K.; Ekelof, T.; El Kacimi, M.; Ellajosyula, V.; Ellert, M.; Elles, S.; Ellinghaus, F.; Elliot, A. A.; Ellis, N.; Elmsheuser, J.; Elsing, M.; Emeliyanov, D.; Enari, Y.; Endner, O. C.; Ennis, J. S.; Erdmann, J.; Ereditato, A.; Ernis, G.; Ernst, J.; Ernst, M.; Errede, S.; Ertel, E.; Escalier, M.; Esch, H.; Escobar, C.; Esposito, B.; Etienvre, A. I.; Etzion, E.; Evans, H.; Ezhilov, A.; Fabbri, F.; Fabbri, L.; Facini, G.; Fakhrutdinov, R. M.; Falciano, S.; Falla, R. J.; Faltova, J.; Fang, Y.; Fanti, M.; Farbin, A.; Farilla, A.; Farina, C.; Farina, E. M.; Farooque, T.; Farrell, S.; Farrington, S. M.; Farthouat, P.; Fassi, F.; Fassnacht, P.; Fassouliotis, D.; Faucci Giannelli, M.; Favareto, A.; Fawcett, W. J.; Fayard, L.; Fedin, O. L.; Fedorko, W.; Feigl, S.; Feligioni, L.; Feng, C.; Feng, E. J.; Feng, H.; Fenyuk, A. B.; Feremenga, L.; Fernandez Martinez, P.; Fernandez Perez, S.; Ferrando, J.; Ferrari, A.; Ferrari, P.; Ferrari, R.; Ferreira de Lima, D. E.; Ferrer, A.; Ferrere, D.; Ferretti, C.; Ferretto Parodi, A.; Fiedler, F.; Filipčič, A.; Filipuzzi, M.; Filthaut, F.; Fincke-Keeler, M.; Finelli, K. D.; Fiolhais, M. C. N.; Fiorini, L.; Firan, A.; Fischer, A.; Fischer, C.; Fischer, J.; Fisher, W. C.; Flaschel, N.; Fleck, I.; Fleischmann, P.; Fletcher, G. T.; Fletcher, R. R. M.; Flick, T.; Floderus, A.; Flores Castillo, L. R.; Flowerdew, M. J.; Forcolin, G. T.; Formica, A.; Forti, A.; Foster, A. G.; Fournier, D.; Fox, H.; Fracchia, S.; Francavilla, P.; Franchini, M.; Francis, D.; Franconi, L.; Franklin, M.; Frate, M.; Fraternali, M.; Freeborn, D.; Fressard-Batraneanu, S. M.; Friedrich, F.; Froidevaux, D.; Frost, J. A.; Fukunaga, C.; Fullana Torregrosa, E.; Fusayasu, T.; Fuster, J.; Gabaldon, C.; Gabizon, O.; Gabrielli, A.; Gabrielli, A.; Gach, G. P.; Gadatsch, S.; Gadomski, S.; Gagliardi, G.; Gagnon, L. G.; Gagnon, P.; Galea, C.; Galhardo, B.; Gallas, E. J.; Gallop, B. J.; Gallus, P.; Galster, G.; Gan, K. K.; Gao, J.; Gao, Y.; Gao, Y. S.; Garay Walls, F. M.; García, C.; García Navarro, J. E.; Garcia-Sciveres, M.; Gardner, R. W.; Garelli, N.; Garonne, V.; Gascon Bravo, A.; Gasnikova, K.; Gatti, C.; Gaudiello, A.; Gaudio, G.; Gauthier, L.; Gavrilenko, I. L.; Gay, C.; Gaycken, G.; Gazis, E. N.; Gecse, Z.; Gee, C. N. P.; Geich-Gimbel, Ch.; Geisen, M.; Geisler, M. P.; Gemme, C.; Genest, M. H.; Geng, C.; Gentile, S.; Gentsos, C.; George, S.; Gerbaudo, D.; Gershon, A.; Ghasemi, S.; Ghazlane, H.; Ghneimat, M.; Giacobbe, B.; Giagu, S.; Giannetti, P.; Gibbard, B.; Gibson, S. M.; Gignac, M.; Gilchriese, M.; Gillam, T. P. S.; Gillberg, D.; Gilles, G.; Gingrich, D. M.; Giokaris, N.; Giordani, M. P.; Giorgi, F. M.; Giorgi, F. M.; Giraud, P. F.; Giromini, P.; Giugni, D.; Giuli, F.; Giuliani, C.; Giulini, M.; Gjelsten, B. K.; Gkaitatzis, S.; Gkialas, I.; Gkougkousis, E. L.; Gladilin, L. K.; Glasman, C.; Glatzer, J.; Glaysher, P. C. F.; Glazov, A.; Goblirsch-Kolb, M.; Godlewski, J.; Goldfarb, S.; Golling, T.; Golubkov, D.; Gomes, A.; Gonçalo, R.; Goncalves Pinto Firmino Da Costa, J.; Gonella, G.; Gonella, L.; Gongadze, A.; González de la Hoz, S.; Gonzalez Parra, G.; Gonzalez-Sevilla, S.; Goossens, L.; Gorbounov, P. A.; Gordon, H. A.; Gorelov, I.; Gorini, B.; Gorini, E.; Gorišek, A.; Gornicki, E.; Goshaw, A. T.; Gössling, C.; Gostkin, M. I.; Goudet, C. R.; Goujdami, D.; Goussiou, A. G.; Govender, N.; Gozani, E.; Graber, L.; Grabowska-Bold, I.; Gradin, P. O. J.; Grafström, P.; Gramling, J.; Gramstad, E.; Grancagnolo, S.; Gratchev, V.; Gravila, P. M.; Gray, H. M.; Graziani, E.; Greenwood, Z. D.; Grefe, C.; Gregersen, K.; Gregor, I. M.; Grenier, P.; Grevtsov, K.; Griffiths, J.; Grillo, A. A.; Grimm, K.; Grinstein, S.; Gris, Ph.; Grivaz, J.-F.; Groh, S.; Grohs, J. P.; Gross, E.; Grosse-Knetter, J.; Grossi, G. C.; Grout, Z. J.; Guan, L.; Guan, W.; Guenther, J.; Guescini, F.; Guest, D.; Gueta, O.; Guido, E.; Guillemin, T.; Guindon, S.; Gul, U.; Gumpert, C.; Guo, J.; Guo, Y.; Gupta, R.; Gupta, S.; Gustavino, G.; Gutierrez, P.; Gutierrez Ortiz, N. G.; Gutschow, C.; Guyot, C.; Gwenlan, C.; Gwilliam, C. B.; Haas, A.; Haber, C.; Hadavand, H. K.; Haddad, N.; Hadef, A.; Hageböck, S.; Hajduk, Z.; Hakobyan, H.; Haleem, M.; Haley, J.; Halladjian, G.; Hallewell, G. D.; Hamacher, K.; Hamal, P.; Hamano, K.; Hamilton, A.; Hamity, G. N.; Hamnett, P. G.; Han, L.; Hanagaki, K.; Hanawa, K.; Hance, M.; Haney, B.; Hanisch, S.; Hanke, P.; Hanna, R.; Hansen, J. B.; Hansen, J. D.; Hansen, M. C.; Hansen, P. H.; Hara, K.; Hard, A. S.; Harenberg, T.; Hariri, F.; Harkusha, S.; Harrington, R. D.; Harrison, P. F.; Hartjes, F.; Hartmann, N. M.; Hasegawa, M.; Hasegawa, Y.; Hasib, A.; Hassani, S.; Haug, S.; Hauser, R.; Hauswald, L.; Havranek, M.; Hawkes, C. M.; Hawkings, R. J.; Hayakawa, D.; Hayden, D.; Hays, C. P.; Hays, J. M.; Hayward, H. S.; Haywood, S. J.; Head, S. J.; Heck, T.; Hedberg, V.; Heelan, L.; Heim, S.; Heim, T.; Heinemann, B.; Heinrich, J. J.; Heinrich, L.; Heinz, C.; Hejbal, J.; Helary, L.; Hellman, S.; Helsens, C.; Henderson, J.; Henderson, R. C. W.; Heng, Y.; Henkelmann, S.; Henriques Correia, A. M.; Henrot-Versille, S.; Herbert, G. H.; Herget, V.; Hernández Jiménez, Y.; Herten, G.; Hertenberger, R.; Hervas, L.; Hesketh, G. G.; Hessey, N. P.; Hetherly, J. W.; Hickling, R.; Higón-Rodriguez, E.; Hill, E.; Hill, J. C.; Hiller, K. H.; Hillier, S. J.; Hinchliffe, I.; Hines, E.; Hinman, R. R.; Hirose, M.; Hirschbuehl, D.; Hobbs, J.; Hod, N.; Hodgkinson, M. C.; Hodgson, P.; Hoecker, A.; Hoeferkamp, M. R.; Hoenig, F.; Hohn, D.; Holmes, T. R.; Homann, M.; Hong, T. M.; Hooberman, B. H.; Hopkins, W. H.; Horii, Y.; Horton, A. J.; Hostachy, J.-Y.; Hou, S.; Hoummada, A.; Howarth, J.; Hrabovsky, M.; Hristova, I.; Hrivnac, J.; Hryn'ova, T.; Hrynevich, A.; Hsu, C.; Hsu, P. J.; Hsu, S.-C.; Hu, D.; Hu, Q.; Hu, S.; Huang, Y.; Hubacek, Z.; Hubaut, F.; Huegging, F.; Huffman, T. B.; Hughes, E. W.; Hughes, G.; Huhtinen, M.; Huo, P.; Huseynov, N.; Huston, J.; Huth, J.; Iacobucci, G.; Iakovidis, G.; Ibragimov, I.; Iconomidou-Fayard, L.; Ideal, E.; Idrissi, Z.; Iengo, P.; Igonkina, O.; Iizawa, T.; Ikegami, Y.; Ikeno, M.; Ilchenko, Y.; Iliadis, D.; Ilic, N.; Ince, T.; Introzzi, G.; Ioannou, P.; Iodice, M.; Iordanidou, K.; Ippolito, V.; Ishijima, N.; Ishino, M.; Ishitsuka, M.; Ishmukhametov, R.; Issever, C.; Istin, S.; Ito, F.; Ponce, J. M. Iturbe; Iuppa, R.; Iwanski, W.; Iwasaki, H.; Izen, J. M.; Izzo, V.; Jabbar, S.; Jackson, B.; Jackson, P.; Jain, V.; Jakobi, K. B.; Jakobs, K.; Jakobsen, S.; Jakoubek, T.; Jamin, D. O.; Jana, D. K.; Jansen, E.; Jansky, R.; Janssen, J.; Janus, M.; Jarlskog, G.; Javadov, N.; Javůrek, T.; Jeanneau, F.; Jeanty, L.; Jejelava, J.; Jeng, G.-Y.; Jennens, D.; Jenni, P.; Jeske, C.; Jézéquel, S.; Ji, H.; Jia, J.; Jiang, H.; Jiang, Y.; Jiggins, S.; Jimenez Pena, J.; Jin, S.; Jinaru, A.; Jinnouchi, O.; Jivan, H.; Johansson, P.; Johns, K. A.; Johnson, W. J.; Jon-And, K.; Jones, G.; Jones, R. W. L.; Jones, S.; Jones, T. J.; Jongmanns, J.; Jorge, P. M.; Jovicevic, J.; Ju, X.; Juste Rozas, A.; Köhler, M. K.; Kaczmarska, A.; Kado, M.; Kagan, H.; Kagan, M.; Kahn, S. J.; Kaji, T.; Kajomovitz, E.; Kalderon, C. W.; Kaluza, A.; Kama, S.; Kamenshchikov, A.; Kanaya, N.; Kaneti, S.; Kanjir, L.; Kantserov, V. A.; Kanzaki, J.; Kaplan, B.; Kaplan, L. S.; Kapliy, A.; Kar, D.; Karakostas, K.; Karamaoun, A.; Karastathis, N.; Kareem, M. J.; Karentzos, E.; Karnevskiy, M.; Karpov, S. N.; Karpova, Z. M.; Karthik, K.; Kartvelishvili, V.; Karyukhin, A. N.; Kasahara, K.; Kashif, L.; Kass, R. D.; Kastanas, A.; Kataoka, Y.; Kato, C.; Katre, A.; Katzy, J.; Kawagoe, K.; Kawamoto, T.; Kawamura, G.; Kazanin, V. F.; Keeler, R.; Kehoe, R.; Keller, J. S.; Kempster, J. J.; Kawade, K.; Keoshkerian, H.; Kepka, O.; Kerševan, B. P.; Kersten, S.; Keyes, R. A.; Khader, M.; Khalil-zada, F.; Khanov, A.; Kharlamov, A. G.; Khoo, T. J.; Khovanskiy, V.; Khramov, E.; Khubua, J.; Kido, S.; Kilby, C. R.; Kim, H. Y.; Kim, S. H.; Kim, Y. K.; Kimura, N.; Kind, O. M.; King, B. T.; King, M.; King, S. B.; Kirk, J.; Kiryunin, A. E.; Kishimoto, T.; Kisielewska, D.; Kiss, F.; Kiuchi, K.; Kivernyk, O.; Kladiva, E.; Klein, M. H.; Klein, M.; Klein, U.; Kleinknecht, K.; Klimek, P.; Klimentov, A.; Klingenberg, R.; Klinger, J. A.; Klioutchnikova, T.; Kluge, E.-E.; Kluit, P.; Kluth, S.; Knapik, J.; Kneringer, E.; Knoops, E. B. F. G.; Knue, A.; Kobayashi, A.; Kobayashi, D.; Kobayashi, T.; Kobel, M.; Kocian, M.; Kodys, P.; Koehler, N. M.; Koffas, T.; Koffeman, E.; Koi, T.; Kolanoski, H.; Kolb, M.; Koletsou, I.; Komar, A. A.; Komori, Y.; Kondo, T.; Kondrashova, N.; Köneke, K.; König, A. C.; Kono, T.; Konoplich, R.; Konstantinidis, N.; Kopeliansky, R.; Koperny, S.; Köpke, L.; Kopp, A. K.; Korcyl, K.; Kordas, K.; Korn, A.; Korol, A. A.; Korolkov, I.; Korolkova, E. V.; Kortner, O.; Kortner, S.; Kosek, T.; Kostyukhin, V. V.; Kotwal, A.; Kourkoumeli-Charalampidi, A.; Kourkoumelis, C.; Kouskoura, V.; Kowalewska, A. B.; Kowalewski, R.; Kowalski, T. Z.; Kozakai, C.; Kozanecki, W.; Kozhin, A. S.; Kramarenko, V. A.; Kramberger, G.; Krasnopevtsev, D.; Krasny, M. W.; Krasznahorkay, A.; Kravchenko, A.; Kretz, M.; Kretzschmar, J.; Kreutzfeldt, K.; Krieger, P.; Krizka, K.; Kroeninger, K.; Kroha, H.; Kroll, J.; Kroseberg, J.; Krstic, J.; Kruchonak, U.; Krüger, H.; Krumnack, N.; Kruse, A.; Kruse, M. C.; Kruskal, M.; Kubota, T.; Kucuk, H.; Kuday, S.; Kuechler, J. T.; Kuehn, S.; Kugel, A.; Kuger, F.; Kuhl, A.; Kuhl, T.; Kukhtin, V.; Kukla, R.; Kulchitsky, Y.; Kuleshov, S.; Kuna, M.; Kunigo, T.; Kupco, A.; Kurashige, H.; Kurochkin, Y. A.; Kus, V.; Kuwertz, E. S.; Kuze, M.; Kvita, J.; Kwan, T.; Kyriazopoulos, D.; La Rosa, A.; La Rosa Navarro, J. L.; La Rotonda, L.; Lacasta, C.; Lacava, F.; Lacey, J.; Lacker, H.; Lacour, D.; Lacuesta, V. R.; Ladygin, E.; Lafaye, R.; Laforge, B.; Lagouri, T.; Lai, S.; Lammers, S.; Lampl, W.; Lançon, E.; Landgraf, U.; Landon, M. P. J.; Lanfermann, M. C.; Lang, V. S.; Lange, J. C.; Lankford, A. J.; Lanni, F.; Lantzsch, K.; Lanza, A.; Laplace, S.; Lapoire, C.; Laporte, J. F.; Lari, T.; Lasagni Manghi, F.; Lassnig, M.; Laurelli, P.; Lavrijsen, W.; Law, A. T.; Laycock, P.; Lazovich, T.; Lazzaroni, M.; Le, B.; Le Dortz, O.; Le Guirriec, E.; Le Quilleuc, E. P.; LeBlanc, M.; LeCompte, T.; Ledroit-Guillon, F.; Lee, C. A.; Lee, S. C.; Lee, L.; Lefebvre, B.; Lefebvre, G.; Lefebvre, M.; Legger, F.; Leggett, C.; Lehan, A.; Lehmann Miotto, G.; Lei, X.; Leight, W. A.; Leisos, A.; Leister, A. G.; Leite, M. A. L.; Leitner, R.; Lellouch, D.; Lemmer, B.; Leney, K. J. C.; Lenz, T.; Lenzi, B.; Leone, R.; Leone, S.; Leonidopoulos, C.; Leontsinis, S.; Lerner, G.; Leroy, C.; Lesage, A. A. J.; Lester, C. G.; Levchenko, M.; Levêque, J.; Levin, D.; Levinson, L. J.; Levy, M.; Lewis, D.; Leyko, A. M.; Leyton, M.; Li, B.; Li, C.; Li, H.; Li, H. L.; Li, L.; Li, L.; Li, Q.; Li, S.; Li, X.; Li, Y.; Liang, Z.; Liberti, B.; Liblong, A.; Lichard, P.; Lie, K.; Liebal, J.; Liebig, W.; Limosani, A.; Lin, S. C.; Lin, T. H.; Lindquist, B. E.; Lionti, A. E.; Lipeles, E.; Lipniacka, A.; Lisovyi, M.; Liss, T. M.; Lister, A.; Litke, A. M.; Liu, B.; Liu, D.; Liu, H.; Liu, H.; Liu, J.; Liu, J. B.; Liu, K.; Liu, L.; Liu, M.; Liu, M.; Liu, Y. L.; Liu, Y.; Livan, M.; Lleres, A.; Llorente Merino, J.; Lloyd, S. L.; Lo Sterzo, F.; Lobodzinska, E.; Loch, P.; Lockman, W. S.; Loebinger, F. K.; Loevschall-Jensen, A. E.; Loew, K. M.; Loginov, A.; Lohse, T.; Lohwasser, K.; Lokajicek, M.; Long, B. A.; Long, J. D.; Long, R. E.; Longo, L.; Looper, K. A.; Lopes, L.; Lopez Mateos, D.; Lopez Paredes, B.; Lopez Paz, I.; Lopez Solis, A.; Lorenz, J.; Martinez, N. Lorenzo; Losada, M.; Lösel, P. J.; Lou, X.; Lounis, A.; Love, J.; Love, P. A.; Lu, H.; Lu, N.; Lubatti, H. J.; Luci, C.; Lucotte, A.; Luedtke, C.; Luehring, F.; Lukas, W.; Luminari, L.; Lundberg, O.; Lund-Jensen, B.; Luzi, P. M.; Lynn, D.; Lysak, R.; Lytken, E.; Lyubushkin, V.; Ma, H.; Ma, L. L.; Ma, Y.; Maccarrone, G.; Macchiolo, A.; Macdonald, C. M.; Maček, B.; Machado Miguens, J.; Madaffari, D.; Madar, R.; Maddocks, H. J.; Mader, W. F.; Madsen, A.; Maeda, J.; Maeland, S.; Maeno, T.; Maevskiy, A.; Magradze, E.; Mahlstedt, J.; Maiani, C.; Maidantchik, C.; Maier, A. A.; Maier, T.; Maio, A.; Majewski, S.; Makida, Y.; Makovec, N.; Malaescu, B.; Malecki, Pa.; Maleev, V. P.; Malek, F.; Mallik, U.; Malon, D.; Malone, C.; Maltezos, S.; Malyukov, S.; Mamuzic, J.; Mancini, G.; Mandelli, B.; Mandelli, L.; Mandić, I.; Maneira, J.; Filho, L. Manhaes de Andrade; Manjarres Ramos, J.; Mann, A.; Manousos, A.; Mansoulie, B.; Mansour, J. D.; Mantifel, R.; Mantoani, M.; Manzoni, S.; Mapelli, L.; Marceca, G.; March, L.; Marchiori, G.; Marcisovsky, M.; Marjanovic, M.; Marley, D. E.; Marroquim, F.; Marsden, S. P.; Marshall, Z.; Marti-Garcia, S.; Martin, B.; Martin, T. A.; Martin, V. J.; dit Latour, B. Martin; Martinez, M.; Martinez Outschoorn, V. I.; Martin-Haugh, S.; Martoiu, V. S.; Martyniuk, A. C.; Marx, M.; Marzin, A.; Masetti, L.; Mashimo, T.; Mashinistov, R.; Masik, J.; Maslennikov, A. L.; Massa, I.; Massa, L.; Mastrandrea, P.; Mastroberardino, A.; Masubuchi, T.; Mättig, P.; Mattmann, J.; Maurer, J.; Maxfield, S. J.; Maximov, D. A.; Mazini, R.; Mazza, S. M.; McFadden, N. C.; McGoldrick, G.; McKee, S. P.; McCarn, A.; McCarthy, R. L.; McCarthy, T. G.; McClymont, L. I.; McDonald, E. F.; Mcfayden, J. A.; Mchedlidze, G.; McMahon, S. J.; McPherson, R. A.; Medinnis, M.; Meehan, S.; Mehlhase, S.; Mehta, A.; Meier, K.; Meineck, C.; Meirose, B.; Melini, D.; Mellado Garcia, B. R.; Melo, M.; Meloni, F.; Mengarelli, A.; Menke, S.; Meoni, E.; Mergelmeyer, S.; Mermod, P.; Merola, L.; Meroni, C.; Merritt, F. S.; Messina, A.; Metcalfe, J.; Mete, A. S.; Meyer, C.; Meyer, C.; Meyer, J.-P.; Meyer, J.; Theenhausen, H. Meyer Zu; Miano, F.; Middleton, R. P.; Miglioranzi, S.; Mijović, L.; Mikenberg, G.; Mikestikova, M.; Mikuž, M.; Milesi, M.; Milic, A.; Miller, D. W.; Mills, C.; Milov, A.; Milstead, D. A.; Minaenko, A. A.; Minami, Y.; Minashvili, I. A.; Mincer, A. I.; Mindur, B.; Mineev, M.; Ming, Y.; Mir, L. M.; Mistry, K. P.; Mitani, T.; Mitrevski, J.; Mitsou, V. A.; Miucci, A.; Miyagawa, P. S.; Mjörnmark, J. U.; Moa, T.; Mochizuki, K.; Mohapatra, S.; Molander, S.; Moles-Valls, R.; Monden, R.; Mondragon, M. C.; Mönig, K.; Monk, J.; Monnier, E.; Montalbano, A.; Montejo Berlingen, J.; Monticelli, F.; Monzani, S.; Moore, R. W.; Morange, N.; Moreno, D.; Moreno Llácer, M.; Morettini, P.; Mori, D.; Mori, T.; Morii, M.; Morinaga, M.; Morisbak, V.; Moritz, S.; Morley, A. K.; Mornacchi, G.; Morris, J. D.; Mortensen, S. S.; Morvaj, L.; Mosidze, M.; Moss, J.; Motohashi, K.; Mount, R.; Mountricha, E.; Mouraviev, S. V.; Moyse, E. J. W.; Muanza, S.; Mudd, R. D.; Mueller, F.; Mueller, J.; Mueller, R. S. P.; Mueller, T.; Muenstermann, D.; Mullen, P.; Mullier, G. A.; Munoz Sanchez, F. J.; Murillo Quijada, J. A.; Murray, W. J.; Musheghyan, H.; Muškinja, M.; Myagkov, A. G.; Myska, M.; Nachman, B. P.; Nackenhorst, O.; Nagai, K.; Nagai, R.; Nagano, K.; Nagasaka, Y.; Nagata, K.; Nagel, M.; Nagy, E.; Nairz, A. M.; Nakahama, Y.; Nakamura, K.; Nakamura, T.; Nakano, I.; Namasivayam, H.; Naranjo Garcia, R. F.; Narayan, R.; Narrias Villar, D. I.; Naryshkin, I.; Naumann, T.; Navarro, G.; Nayyar, R.; Neal, H. A.; Nechaeva, P. Yu.; Neep, T. J.; Negri, A.; Negrini, M.; Nektarijevic, S.; Nellist, C.; Nelson, A.; Nemecek, S.; Nemethy, P.; Nepomuceno, A. A.; Nessi, M.; Neubauer, M. S.; Neumann, M.; Neves, R. M.; Nevski, P.; Newman, P. R.; Nguyen, D. H.; Nguyen Manh, T.; Nickerson, R. B.; Nicolaidou, R.; Nielsen, J.; Nikiforov, A.; Nikolaenko, V.; Nikolic-Audit, I.; Nikolopoulos, K.; Nilsen, J. K.; Nilsson, P.; Ninomiya, Y.; Nisati, A.; Nisius, R.; Nobe, T.; Nomachi, M.; Nomidis, I.; Nooney, T.; Norberg, S.; Nordberg, M.; Norjoharuddeen, N.; Novgorodova, O.; Nowak, S.; Nozaki, M.; Nozka, L.; Ntekas, K.; Nurse, E.; Nuti, F.; O'grady, F.; O'Neil, D. C.; O'Rourke, A. A.; O'Shea, V.; Oakham, F. G.; Oberlack, H.; Obermann, T.; Ocariz, J.; Ochi, A.; Ochoa, I.; Ochoa-Ricoux, J. P.; Oda, S.; Odaka, S.; Ogren, H.; Oh, A.; Oh, S. H.; Ohm, C. C.; Ohman, H.; Oide, H.; Okawa, H.; Okumura, Y.; Okuyama, T.; Olariu, A.; Oleiro Seabra, L. F.; Olivares Pino, S. A.; Oliveira Damazio, D.; Olszewski, A.; Olszowska, J.; Onofre, A.; Onogi, K.; Onyisi, P. U. E.; Oreglia, M. J.; Oren, Y.; Orestano, D.; Orlando, N.; Orr, R. S.; Osculati, B.; Ospanov, R.; Garzon, G. Otero y.; Otono, H.; Ouchrif, M.; Ould-Saada, F.; Ouraou, A.; Oussoren, K. P.; Ouyang, Q.; Owen, M.; Owen, R. E.; Ozcan, V. E.; Ozturk, N.; Pachal, K.; Pacheco Pages, A.; Pacheco Rodriguez, L.; Padilla Aranda, C.; Pagáčová, M.; Pagan Griso, S.; Paige, F.; Pais, P.; Pajchel, K.; Palacino, G.; Palazzo, S.; Palestini, S.; Palka, M.; Pallin, D.; Panagiotopoulou, E. St.; Pandini, C. E.; Panduro Vazquez, J. G.; Pani, P.; Panitkin, S.; Pantea, D.; Paolozzi, L.; Papadopoulou, Th. D.; Papageorgiou, K.; Paramonov, A.; Paredes Hernandez, D.; Parker, A. J.; Parker, M. A.; Parker, K. A.; Parodi, F.; Parsons, J. A.; Parzefall, U.; Pascuzzi, V. R.; Pasqualucci, E.; Passaggio, S.; Pastore, Fr.; Pásztor, G.; Pataraia, S.; Pater, J. R.; Pauly, T.; Pearce, J.; Pearson, B.; Pedersen, L. E.; Pedersen, M.; Pedraza Lopez, S.; Pedro, R.; Peleganchuk, S. V.; Penc, O.; Peng, C.; Peng, H.; Penwell, J.; Peralva, B. S.; Perego, M. M.; Perepelitsa, D. V.; Perez Codina, E.; Perini, L.; Pernegger, H.; Perrella, S.; Peschke, R.; Peshekhonov, V. D.; Peters, K.; Peters, R. F. Y.; Petersen, B. A.; Petersen, T. C.; Petit, E.; Petridis, A.; Petridou, C.; Petroff, P.; Petrolo, E.; Petrov, M.; Petrucci, F.; Pettersson, N. E.; Peyaud, A.; Pezoa, R.; Phillips, P. W.; Piacquadio, G.; Pianori, E.; Picazio, A.; Piccaro, E.; Piccinini, M.; Pickering, M. A.; Piegaia, R.; Pilcher, J. E.; Pilkington, A. D.; Pin, A. W. J.; Pinamonti, M.; Pinfold, J. L.; Pingel, A.; Pires, S.; Pirumov, H.; Pitt, M.; Plazak, L.; Pleier, M.-A.; Pleskot, V.; Plotnikova, E.; Plucinski, P.; Pluth, D.; Poettgen, R.; Poggioli, L.; Pohl, D.; Polesello, G.; Poley, A.; Policicchio, A.; Polifka, R.; Polini, A.; Pollard, C. S.; Polychronakos, V.; Pommès, K.; Pontecorvo, L.; Pope, B. G.; Popeneciu, G. A.; Poppleton, A.; Pospisil, S.; Potamianos, K.; Potrap, I. N.; Potter, C. J.; Potter, C. T.; Poulard, G.; Poveda, J.; Pozdnyakov, V.; Pozo Astigarraga, M. E.; Pralavorio, P.; Pranko, A.; Prell, S.; Price, D.; Price, L. E.; Primavera, M.; Prince, S.; Prokofiev, K.; Prokoshin, F.; Protopopescu, S.; Proudfoot, J.; Przybycien, M.; Puddu, D.; Purohit, M.; Puzo, P.; Qian, J.; Qin, G.; Qin, Y.; Quadt, A.; Quayle, W. B.; Queitsch-Maitland, M.; Quilty, D.; Raddum, S.; Radeka, V.; Radescu, V.; Radhakrishnan, S. K.; Radloff, P.; Rados, P.; Ragusa, F.; Rahal, G.; Raine, J. A.; Rajagopalan, S.; Rammensee, M.; Rangel-Smith, C.; Ratti, M. G.; Rauscher, F.; Rave, S.; Ravenscroft, T.; Ravinovich, I.; Raymond, M.; Read, A. L.; Readioff, N. P.; Reale, M.; Rebuzzi, D. M.; Redelbach, A.; Redlinger, G.; Reece, R.; Reeves, K.; Rehnisch, L.; Reichert, J.; Reisin, H.; Rembser, C.; Ren, H.; Rescigno, M.; Resconi, S.; Rezanova, O. L.; Reznicek, P.; Rezvani, R.; Richter, R.; Richter, S.; Richter-Was, E.; Ricken, O.; Ridel, M.; Rieck, P.; Riegel, C. J.; Rieger, J.; Rifki, O.; Rijssenbeek, M.; Rimoldi, A.; Rimoldi, M.; Rinaldi, L.; Ristić, B.; Ritsch, E.; Riu, I.; Rizatdinova, F.; Rizvi, E.; Rizzi, C.; Robertson, S. H.; Robichaud-Veronneau, A.; Robinson, D.; Robinson, J. E. M.; Robson, A.; Roda, C.; Rodina, Y.; Rodriguez Perez, A.; Rodriguez Rodriguez, D.; Roe, S.; Rogan, C. S.; RØhne, O.; Romaniouk, A.; Romano, M.; Romano Saez, S. M.; Romero Adam, E.; Rompotis, N.; Ronzani, M.; Roos, L.; Ros, E.; Rosati, S.; Rosbach, K.; Rose, P.; Rosenthal, O.; Rosien, N.-A.; Rossetti, V.; Rossi, E.; Rossi, L. P.; Rosten, J. H. N.; Rosten, R.; Rotaru, M.; Roth, I.; Rothberg, J.; Rousseau, D.; Royon, C. R.; Rozanov, A.; Rozen, Y.; Ruan, X.; Rubbo, F.; Rudolph, M. S.; Rühr, F.; Ruiz-Martinez, A.; Rurikova, Z.; Rusakovich, N. A.; Ruschke, A.; Russell, H. L.; Rutherfoord, J. P.; Ruthmann, N.; Ryabov, Y. F.; Rybar, M.; Rybkin, G.; Ryu, S.; Ryzhov, A.; Rzehorz, G. F.; Saavedra, A. F.; Sabato, G.; Sacerdoti, S.; Sadrozinski, H. F.-W.; Sadykov, R.; Safai Tehrani, F.; Saha, P.; Sahinsoy, M.; Saimpert, M.; Saito, T.; Sakamoto, H.; Sakurai, Y.; Salamanna, G.; Salamon, A.; Salazar Loyola, J. E.; Salek, D.; Sales De Bruin, P. H.; Salihagic, D.; Salnikov, A.; Salt, J.; Salvatore, D.; Salvatore, F.; Salvucci, A.; Salzburger, A.; Sammel, D.; Sampsonidis, D.; Sanchez, A.; Sánchez, J.; Sanchez Martinez, V.; Sandaker, H.; Sandbach, R. L.; Sander, H. G.; Sandhoff, M.; Sandoval, C.; Sandstroem, R.; Sankey, D. P. C.; Sannino, M.; Sansoni, A.; Santoni, C.; Santonico, R.; Santos, H.; Santoyo Castillo, I.; Sapp, K.; Sapronov, A.; Saraiva, J. G.; Sarrazin, B.; Sasaki, O.; Sasaki, Y.; Sato, K.; Sauvage, G.; Sauvan, E.; Savage, G.; Savard, P.; Savic, N.; Sawyer, C.; Sawyer, L.; Saxon, J.; Sbarra, C.; Sbrizzi, A.; Scanlon, T.; Scannicchio, D. A.; Scarcella, M.; Scarfone, V.; Schaarschmidt, J.; Schacht, P.; Schachtner, B. M.; Schaefer, D.; Schaefer, L.; Schaefer, R.; Schaeffer, J.; Schaepe, S.; Schaetzel, S.; Schäfer, U.; Schaffer, A. C.; Schaile, D.; Schamberger, R. D.; Scharf, V.; Schegelsky, V. A.; Scheirich, D.; Schernau, M.; Schiavi, C.; Schier, S.; Schillo, C.; Schioppa, M.; Schlenker, S.; Schmidt-Sommerfeld, K. R.; Schmieden, K.; Schmitt, C.; Schmitt, S.; Schmitz, S.; Schneider, B.; Schnoor, U.; Schoeffel, L.; Schoening, A.; Schoenrock, B. D.; Schopf, E.; Schott, M.; Schovancova, J.; Schramm, S.; Schreyer, M.; Schuh, N.; Schulte, A.; Schultens, M. J.; Schultz-Coulon, H.-C.; Schulz, H.; Schumacher, M.; Schumm, B. A.; Schune, Ph.; Schwartzman, A.; Schwarz, T. A.; Schweiger, H.; Schwemling, Ph.; Schwienhorst, R.; Schwindling, J.; Schwindt, T.; Sciolla, G.; Scuri, F.; Scutti, F.; Searcy, J.; Seema, P.; Seidel, S. C.; Seiden, A.; Seifert, F.; Seixas, J. M.; Sekhniaidze, G.; Sekhon, K.; Sekula, S. J.; Seliverstov, D. M.; Semprini-Cesari, N.; Serfon, C.; Serin, L.; Serkin, L.; Sessa, M.; Seuster, R.; Severini, H.; Sfiligoj, T.; Sforza, F.; Sfyrla, A.; Shabalina, E.; Shaikh, N. W.; Shan, L. Y.; Shang, R.; Shank, J. T.; Shapiro, M.; Shatalov, P. B.; Shaw, K.; Shaw, S. M.; Shcherbakova, A.; Shehu, C. Y.; Sherwood, P.; Shi, L.; Shimizu, S.; Shimmin, C. O.; Shimojima, M.; Shiyakova, M.; Shmeleva, A.; Shoaleh Saadi, D.; Shochet, M. J.; Shojaii, S.; Shrestha, S.; Shulga, E.; Shupe, M. A.; Sicho, P.; Sickles, A. M.; Sidebo, P. E.; Sidiropoulou, O.; Sidorov, D.; Sidoti, A.; Siegert, F.; Sijacki, Dj.; Silva, J.; Silverstein, S. B.; Simak, V.; Simic, Lj.; Simion, S.; Simioni, E.; Simmons, B.; Simon, D.; Simon, M.; Sinervo, P.; Sinev, N. B.; Sioli, M.; Siragusa, G.; Sivoklokov, S. Yu.; Sjölin, J.; Skinner, M. B.; Skottowe, H. P.; Skubic, P.; Slater, M.; Slavicek, T.; Slawinska, M.; Sliwa, K.; Slovak, R.; Smakhtin, V.; Smart, B. H.; Smestad, L.; Smiesko, J.; Smirnov, S. Yu.; Smirnov, Y.; Smirnova, L. N.; Smirnova, O.; Smith, M. N. K.; Smith, R. W.; Smizanska, M.; Smolek, K.; Snesarev, A. A.; Snyder, S.; Sobie, R.; Socher, F.; Soffer, A.; Soh, D. A.; Sokhrannyi, G.; Solans Sanchez, C. A.; Solar, M.; Soldatov, E. Yu.; Soldevila, U.; Solodkov, A. A.; Soloshenko, A.; Solovyanov, O. V.; Solovyev, V.; Sommer, P.; Son, H.; Song, H. Y.; Sood, A.; Sopczak, A.; Sopko, V.; Sorin, V.; Sosa, D.; Sotiropoulou, C. L.; Soualah, R.; Soukharev, A. M.; South, D.; Sowden, B. C.; Spagnolo, S.; Spalla, M.; Spangenberg, M.; Spanò, F.; Sperlich, D.; Spettel, F.; Spighi, R.; Spigo, G.; Spiller, L. A.; Spousta, M.; St. Denis, R. D.; Stabile, A.; Stamen, R.; Stamm, S.; Stanecka, E.; Stanek, R. W.; Stanescu, C.; Stanescu-Bellu, M.; Stanitzki, M. M.; Stapnes, S.; Starchenko, E. A.; Stark, G. H.; Stark, J.; Staroba, P.; Starovoitov, P.; Stärz, S.; Staszewski, R.; Steinberg, P.; Stelzer, B.; Stelzer, H. J.; Stelzer-Chilton, O.; Stenzel, H.; Stewart, G. A.; Stillings, J. A.; Stockton, M. C.; Stoebe, M.; Stoicea, G.; Stolte, P.; Stonjek, S.; Stradling, A. R.; Straessner, A.; Stramaglia, M. E.; Strandberg, J.; Strandberg, S.; Strandlie, A.; Strauss, M.; Strizenec, P.; Ströhmer, R.; Strom, D. M.; Stroynowski, R.; Strubig, A.; Stucci, S. A.; Stugu, B.; Styles, N. A.; Su, D.; Su, J.; Suchek, S.; Sugaya, Y.; Suk, M.; Sulin, V. V.; Sultansoy, S.; Sumida, T.; Sun, S.; Sun, X.; Sundermann, J. E.; Suruliz, K.; Susinno, G.; Sutton, M. R.; Suzuki, S.; Svatos, M.; Swiatlowski, M.; Sykora, I.; Sykora, T.; Ta, D.; Taccini, C.; Tackmann, K.; Taenzer, J.; Taffard, A.; Tafirout, R.; Taiblum, N.; Takai, H.; Takashima, R.; Takeshita, T.; Takubo, Y.; Talby, M.; Talyshev, A. A.; Tan, K. G.; Tanaka, J.; Tanaka, M.; Tanaka, R.; Tanaka, S.; Tannenwald, B. B.; Tapia Araya, S.; Tapprogge, S.; Tarem, S.; Tartarelli, G. F.; Tas, P.; Tasevsky, M.; Tashiro, T.; Tassi, E.; Tavares Delgado, A.; Tayalati, Y.; Taylor, A. C.; Taylor, G. N.; Taylor, P. T. E.; Taylor, W.; Teischinger, F. A.; Teixeira-Dias, P.; Temming, K. K.; Temple, D.; Ten Kate, H.; Teng, P. K.; Teoh, J. J.; Tepel, F.; Terada, S.; Terashi, K.; Terron, J.; Terzo, S.; Testa, M.; Teuscher, R. J.; Theveneaux-Pelzer, T.; Thomas, J. P.; Thomas-Wilsker, J.; Thompson, E. N.; Thompson, P. D.; Thompson, A. S.; Thomsen, L. A.; Thomson, E.; Thomson, M.; Tibbetts, M. J.; Ticse Torres, R. E.; Tikhomirov, V. O.; Tikhonov, Yu. A.; Timoshenko, S.; Tipton, P.; Tisserant, S.; Todome, K.; Todorov, T.; Todorova-Nova, S.; Tojo, J.; Tokár, S.; Tokushuku, K.; Tolley, E.; Tomlinson, L.; Tomoto, M.; Tompkins, L.; Toms, K.; Tong, B.; Torrence, E.; Torres, H.; Torró Pastor, E.; Toth, J.; Touchard, F.; Tovey, D. R.; Trefzger, T.; Tricoli, A.; Trigger, I. M.; Trincaz-Duvoid, S.; Tripiana, M. F.; Trischuk, W.; Trocmé, B.; Trofymov, A.; Troncon, C.; Trottier-McDonald, M.; Trovatelli, M.; Truong, L.; Trzebinski, M.; Trzupek, A.; Tseng, J. C.-L.; Tsiareshka, P. V.; Tsipolitis, G.; Tsirintanis, N.; Tsiskaridze, S.; Tsiskaridze, V.; Tskhadadze, E. G.; Tsui, K. M.; Tsukerman, I. I.; Tsulaia, V.; Tsuno, S.; Tsybychev, D.; Tu, Y.; Tudorache, A.; Tudorache, V.; Tuna, A. N.; Tupputi, S. A.; Turchikhin, S.; Turecek, D.; Turgeman, D.; Turra, R.; Turvey, A. J.; Tuts, P. M.; Tyndel, M.; Ucchielli, G.; Ueda, I.; Ughetto, M.; Ukegawa, F.; Unal, G.; Undrus, A.; Unel, G.; Ungaro, F. C.; Unno, Y.; Unverdorben, C.; Urban, J.; Urquijo, P.; Urrejola, P.; Usai, G.; Usanova, A.; Vacavant, L.; Vacek, V.; Vachon, B.; Valderanis, C.; Valdes Santurio, E.; Valencic, N.; Valentinetti, S.; Valero, A.; Valery, L.; Valkar, S.; Valls Ferrer, J. A.; Van Den Wollenberg, W.; Van Der Deijl, P. C.; van der Graaf, H.; van Eldik, N.; van Gemmeren, P.; Van Nieuwkoop, J.; van Vulpen, I.; van Woerden, M. C.; Vanadia, M.; Vandelli, W.; Vanguri, R.; Vaniachine, A.; Vankov, P.; Vardanyan, G.; Vari, R.; Varnes, E. W.; Varol, T.; Varouchas, D.; Vartapetian, A.; Varvell, K. E.; Vasquez, J. G.; Vazeille, F.; Vazquez Schroeder, T.; Veatch, J.; Veeraraghavan, V.; Veloce, L. M.; Veloso, F.; Veneziano, S.; Ventura, A.; Venturi, M.; Venturi, N.; Venturini, A.; Vercesi, V.; Verducci, M.; Verkerke, W.; Vermeulen, J. C.; Vest, A.; Vetterli, M. C.; Viazlo, O.; Vichou, I.; Vickey, T.; Boeriu, O. E. Vickey; Viehhauser, G. H. A.; Viel, S.; Vigani, L.; Villa, M.; Villaplana Perez, M.; Vilucchi, E.; Vincter, M. G.; Vinogradov, V. B.; Vittori, C.; Vivarelli, I.; Vlachos, S.; Vlasak, M.; Vogel, M.; Vokac, P.; Volpi, G.; Volpi, M.; von der Schmitt, H.; von Toerne, E.; Vorobel, V.; Vorobev, K.; Vos, M.; Voss, R.; Vossebeld, J. H.; Vranjes, N.; Vranjes Milosavljevic, M.; Vrba, V.; Vreeswijk, M.; Vuillermet, R.; Vukotic, I.; Vykydal, Z.; Wagner, P.; Wagner, W.; Wahlberg, H.; Wahrmund, S.; Wakabayashi, J.; Walder, J.; Walker, R.; Walkowiak, W.; Wallangen, V.; Wang, C.; Wang, C.; Wang, F.; Wang, H.; Wang, H.; Wang, J.; Wang, J.; Wang, K.; Wang, R.; Wang, S. M.; Wang, T.; Wang, T.; Wang, W.; Wang, X.; Wanotayaroj, C.; Warburton, A.; Ward, C. P.; Wardrope, D. R.; Washbrook, A.; Watkins, P. M.; Watson, A. T.; Watson, M. F.; Watts, G.; Watts, S.; Waugh, B. M.; Webb, S.; Weber, M. S.; Weber, S. W.; Webster, J. S.; Weidberg, A. R.; Weinert, B.; Weingarten, J.; Weiser, C.; Weits, H.; Wells, P. S.; Wenaus, T.; Wengler, T.; Wenig, S.; Wermes, N.; Werner, M.; Werner, M. D.; Werner, P.; Wessels, M.; Wetter, J.; Whalen, K.; Whallon, N. L.; Wharton, A. M.; White, A.; White, M. J.; White, R.; Whiteson, D.; Wickens, F. J.; Wiedenmann, W.; Wielers, M.; Wienemann, P.; Wiglesworth, C.; Wiik-Fuchs, L. A. M.; Wildauer, A.; Wilk, F.; Wilkens, H. G.; Williams, H. H.; Williams, S.; Willis, C.; Willocq, S.; Wilson, J. A.; Wingerter-Seez, I.; Winklmeier, F.; Winston, O. J.; Winter, B. T.; Wittgen, M.; Wittkowski, J.; Wolf, T. M. H.; Wolter, M. W.; Wolters, H.; Worm, S. D.; Wosiek, B. K.; Wotschack, J.; Woudstra, M. J.; Wozniak, K. W.; Wu, M.; Wu, M.; Wu, S. L.; Wu, X.; Wu, Y.; Wyatt, T. R.; Wynne, B. M.; Xella, S.; Xu, D.; Xu, L.; Yabsley, B.; Yacoob, S.; Yamaguchi, D.; Yamaguchi, Y.; Yamamoto, A.; Yamamoto, S.; Yamanaka, T.; Yamauchi, K.; Yamazaki, Y.; Yan, Z.; Yang, H.; Yang, H.; Yang, Y.; Yang, Z.; Yao, W.-M.; Yap, Y. C.; Yasu, Y.; Yatsenko, E.; Yau Wong, K. H.; Ye, J.; Ye, S.; Yeletskikh, I.; Yen, A. L.; Yildirim, E.; Yorita, K.; Yoshida, R.; Yoshihara, K.; Young, C.; Young, C. J. S.; Youssef, S.; Yu, D. R.; Yu, J.; Yu, J. M.; Yu, J.; Yuan, L.; Yuen, S. P. Y.; Yusuff, I.; Zabinski, B.; Zaidan, R.; Zaitsev, A. M.; Zakharchuk, N.; Zalieckas, J.; Zaman, A.; Zambito, S.; Zanello, L.; Zanzi, D.; Zeitnitz, C.; Zeman, M.; Zemla, A.; Zeng, J. C.; Zeng, Q.; Zengel, K.; Zenin, O.; Ženiš, T.; Zerwas, D.; Zhang, D.; Zhang, F.; Zhang, G.; Zhang, H.; Zhang, J.; Zhang, L.; Zhang, R.; Zhang, R.; Zhang, X.; Zhang, Z.; Zhao, X.; Zhao, Y.; Zhao, Z.; Zhemchugov, A.; Zhong, J.; Zhou, B.; Zhou, C.; Zhou, L.; Zhou, L.; Zhou, M.; Zhou, N.; Zhu, C. G.; Zhu, H.; Zhu, J.; Zhu, Y.; Zhuang, X.; Zhukov, K.; Zibell, A.; Zieminska, D.; Zimine, N. I.; Zimmermann, C.; Zimmermann, S.; Zinonos, Z.; Zinser, M.; Ziolkowski, M.; Živković, L.; Zobernig, G.; Zoccoli, A.; zur Nedden, M.; Zwalinski, L.

2016-11-01

Knowledge of the material in the ATLAS inner tracking detector is crucial in understanding the reconstruction of charged-particle tracks, the performance of algorithms that identify jets containing b-hadrons and is also essential to reduce background in searches for exotic particles that can decay within the inner detector volume. Interactions of primary hadrons produced in pp collisions with the material in the inner detector are used to map the location and amount of this material. The hadronic interactions of primary particles may result in secondary vertices, which in this analysis are reconstructed by an inclusive vertex-finding algorithm. Data were collected using minimum-bias triggers by the ATLAS detector operating at the LHC during 2010 at centre-of-mass energy √s = 7 TeV, and correspond to an integrated luminosity of 19 nb-1. Kinematic properties of these secondary vertices are used to study the validity of the modelling of hadronic interactions in simulation. Secondary-vertex yields are compared between data and simulation over a volume of about 0.7 m3 around the interaction point, and agreement is found within overall uncertainties.

Readout Electronics for the Forward Vertex Detector at PHENIX

NASA Astrophysics Data System (ADS)

Phillips, Michael

2010-11-01

The PHENIX experiment at RHIC at Brookhaven National Laboratory has been providing high quality physics data for over 10 years. The current PHENIX physics program will be significantly enhanced by addition of the Forward Silicon Vertex upgrade detector (FVTX) in the acceptance of existing muon arm detectors. The proposed tracker is planned to be put into operation in 2012. Each arm of the FVTX detector consist of 4 discs of silicon strip sensors combined with FPHX readout chips, designed at FNAL. The full detector consists of over 1 million active mini-strip channels with instantaneous bandwidth topping 3.4 Tb/s. The FPHX chip utilizes data push architecture with 2 serial output streams at 200 MHz. The readout electronics design consists of Read-Out Cards (ROC) located in the vicinity of the detector and Front End Modules (FEM) located in the Counting House. ROC boards combine the data from several chips, synchronizes data streams and send them to FEM over a Fiber Optics Link. The data are buffered in the FEM and then sent to a standard PHENIX DAQ interface upon Level-1 trigger request. We will present the current status of the readout electronics development and testing, including tests with data from production wedges.

On boundary fusion and functional relations in the Baxterized affine Hecke algebra

DOE Office of Scientific and Technical Information (OSTI.GOV)

Babichenko, A., E-mail: babichen@weizmann.ac.il; Regelskis, V., E-mail: v.regelskis@surrey.ac.uk

2014-04-15

We construct boundary type operators satisfying fused reflection equation for arbitrary representations of the Baxterized affine Hecke algebra. These operators are analogues of the fused reflection matrices in solvable half-line spin chain models. We show that these operators lead to a family of commuting transfer matrices of Sklyanin type. We derive fusion type functional relations for these operators for two families of representations.

Making Connections: Elementary Teachers' Construction of Division Word Problems and Representations

ERIC Educational Resources Information Center

Timmerman, Maria A.

2014-01-01

If teachers make few connections among multiple representations of division, supporting students in using representations to develop operation sense demanded by national standards will not occur. Studies have investigated how prospective and practicing teachers use representations to develop knowledge of fraction division. However, few studies…

Human Performance on Hard Non-Euclidean Graph Problems: Vertex Cover

ERIC Educational Resources Information Center

Carruthers, Sarah; Masson, Michael E. J.; Stege, Ulrike

2012-01-01

Recent studies on a computationally hard visual optimization problem, the Traveling Salesperson Problem (TSP), indicate that humans are capable of finding close to optimal solutions in near-linear time. The current study is a preliminary step in investigating human performance on another hard problem, the Minimum Vertex Cover Problem, in which…

Selective attention and the auditory vertex potential. 1: Effects of stimulus delivery rate

NASA Technical Reports Server (NTRS)

Schwent, V. L.; Hillyard, S. A.; Galambos, R.

1975-01-01

Enhancement of the auditory vertex potentials with selective attention to dichotically presented tone pips was found to be critically sensitive to the range of inter-stimulus intervals in use. Only at the shortest intervals was a clear-cut enhancement of the latency component to stimuli observed for the attended ear.

Z3 -vertex magic total labeling and Z3 -edge magic total labelingfor the extended duplicate graph of quadrilateral snake

NASA Astrophysics Data System (ADS)

Indira, P.; Selvam, B.; Thirusangu, K.

2018-04-01

Based on the works of Kotzig, Rosa and MacDougall et.al., we present algorithms and prove the existence of Z3-vertex magic total labeling and Z3-edge magic total labeling for the extended duplicate graph of quadrilateral snake.

Predictive modeling of neuroanatomic structures for brain atrophy detection

NASA Astrophysics Data System (ADS)

Hu, Xintao; Guo, Lei; Nie, Jingxin; Li, Kaiming; Liu, Tianming

2010-03-01

In this paper, we present an approach of predictive modeling of neuroanatomic structures for the detection of brain atrophy based on cross-sectional MRI image. The underlying premise of applying predictive modeling for atrophy detection is that brain atrophy is defined as significant deviation of part of the anatomy from what the remaining normal anatomy predicts for that part. The steps of predictive modeling are as follows. The central cortical surface under consideration is reconstructed from brain tissue map and Regions of Interests (ROI) on it are predicted from other reliable anatomies. The vertex pair-wise distance between the predicted vertex and the true one within the abnormal region is expected to be larger than that of the vertex in normal brain region. Change of white matter/gray matter ratio within a spherical region is used to identify the direction of vertex displacement. In this way, the severity of brain atrophy can be defined quantitatively by the displacements of those vertices. The proposed predictive modeling method has been evaluated by using both simulated atrophies and MRI images of Alzheimer's disease.

A Linear Kernel for Co-Path/Cycle Packing

NASA Astrophysics Data System (ADS)

Chen, Zhi-Zhong; Fellows, Michael; Fu, Bin; Jiang, Haitao; Liu, Yang; Wang, Lusheng; Zhu, Binhai

Bounded-Degree Vertex Deletion is a fundamental problem in graph theory that has new applications in computational biology. In this paper, we address a special case of Bounded-Degree Vertex Deletion, the Co-Path/Cycle Packing problem, which asks to delete as few vertices as possible such that the graph of the remaining (residual) vertices is composed of disjoint paths and simple cycles. The problem falls into the well-known class of 'node-deletion problems with hereditary properties', is hence NP-complete and unlikely to admit a polynomial time approximation algorithm with approximation factor smaller than 2. In the framework of parameterized complexity, we present a kernelization algorithm that produces a kernel with at most 37k vertices, improving on the super-linear kernel of Fellows et al.'s general theorem for Bounded-Degree Vertex Deletion. Using this kernel,and the method of bounded search trees, we devise an FPT algorithm that runs in time O *(3.24 k ). On the negative side, we show that the problem is APX-hard and unlikely to have a kernel smaller than 2k by a reduction from Vertex Cover.

Track and vertex reconstruction: From classical to adaptive methods

NASA Astrophysics Data System (ADS)

Strandlie, Are; Frühwirth, Rudolf

2010-04-01

This paper reviews classical and adaptive methods of track and vertex reconstruction in particle physics experiments. Adaptive methods have been developed to meet the experimental challenges at high-energy colliders, in particular, the CERN Large Hadron Collider. They can be characterized by the obliteration of the traditional boundaries between pattern recognition and statistical estimation, by the competition between different hypotheses about what constitutes a track or a vertex, and by a high level of flexibility and robustness achieved with a minimum of assumptions about the data. The theoretical background of some of the adaptive methods is described, and it is shown that there is a close connection between the two main branches of adaptive methods: neural networks and deformable templates, on the one hand, and robust stochastic filters with annealing, on the other hand. As both classical and adaptive methods of track and vertex reconstruction presuppose precise knowledge of the positions of the sensitive detector elements, the paper includes an overview of detector alignment methods and a survey of the alignment strategies employed by past and current experiments.

On the total irregularity strength of caterpillar with each internal vertex has degree three

NASA Astrophysics Data System (ADS)

Indriati, Diari; Rosyida, Isnaini; Widodo

2018-04-01

Let G be a simple, connected and undirected graph with vertex set V and edge set E. A total k-labeling f:V \\cup E\\to \\{1,2,\\ldots,k\\} is defined as totally irregular total k-labeling if the weights of any two different both vertices and edges are distinct. The weight of vertex x is defined as wt(x)=f(x)+{\\sum }xy\\in Ef(xy), while the weight of edge xy is wt(xy)=f(x)+f(xy)+f(y). A minimum k for which G has totally irregular total k-labeling is mentioned as total irregularity strength of G and denoted by ts(G). This paper contains investigation of totally irregular total k-labeling and determination of their total irregularity strengths for caterpillar graphs with each internal vertex between two stars has degree three. The results are ts({S}n,3,n)=\\lceil \\frac{2n}{2}\\rceil, ts({S}n,3,3,n)=\\lceil \\frac{2n+1}{2}\\rceil and ts({S}n,3,3,3,n)=\\lceil \\frac{2n+2}{2}\\rceil for n > 4:

DOE Office of Scientific and Technical Information (OSTI.GOV)

Aaboud, M.; Aad, G.; Abbott, B.

This paper presents the method and performance of primary vertex reconstruction in proton–proton collision data recorded by the ATLAS experiment during Run 1 of the LHC. The studies presented focus on data taken during 2012 at a centre-of-mass energy of √s = 8 TeV. The performance has been measured as a function of the number of interactions per bunch crossing over a wide range, from one to seventy. The measurement of the position and size of the luminous region and its use as a constraint to improve the primary vertex resolution are discussed. A longitudinal vertex position resolution of aboutmore » 30 μm is achieved for events with high multiplicity of reconstructed tracks. The transverse position resolution is better than 20 μm and is dominated by the precision on the size of the luminous region. An analytical model is proposed to describe the primary vertex reconstruction efficiency as a function of the number of interactions per bunch crossing and of the longitudinal size of the luminous region. Agreement between the data and the predictions of this model is better than 3% up to seventy interactions per bunch crossing.« less

Complex growing networks with intrinsic vertex fitness

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bedogne, C.; Rodgers, G. J.

2006-10-15

One of the major questions in complex network research is to identify the range of mechanisms by which a complex network can self organize into a scale-free state. In this paper we investigate the interplay between a fitness linking mechanism and both random and preferential attachment. In our models, each vertex is assigned a fitness x, drawn from a probability distribution {rho}(x). In Model A, at each time step a vertex is added and joined to an existing vertex, selected at random, with probability p and an edge is introduced between vertices with fitnesses x and y, with a ratemore » f(x,y), with probability 1-p. Model B differs from Model A in that, with probability p, edges are added with preferential attachment rather than randomly. The analysis of Model A shows that, for every fixed fitness x, the network's degree distribution decays exponentially. In Model B we recover instead a power-law degree distribution whose exponent depends only on p, and we show how this result can be generalized. The properties of a number of particular networks are examined.« less

Study of run time errors of the ATLAS pixel detector in the 2012 data taking period

NASA Astrophysics Data System (ADS)

Gandrajula, Reddy Pratap

The high resolution silicon Pixel detector is critical in event vertex reconstruction and in particle track reconstruction in the ATLAS detector. During the pixel data taking operation, some modules (Silicon Pixel sensor +Front End Chip+ Module Control Chip (MCC)) go to an auto-disable state, where the Modules don't send the data for storage. Modules become operational again after reconfiguration. The source of the problem is not fully understood. One possible source of the problem is traced to the occurrence of single event upset (SEU) in the MCC. Such a module goes to either a Timeout or Busy state. This report is the study of different types and rates of errors occurring in the Pixel data taking operation. Also, the study includes the error rate dependency on Pixel detector geometry.

Yang-Baxter and other relations for free-fermion and Ising models

DOE Office of Scientific and Technical Information (OSTI.GOV)

Davies, B.

1987-02-01

Eight-vertex, free fermion, and Ising models are formulated using a convention that emphasizes the algebra of the local transition operators that arise in the quantum inverse method. Equivalent classes of models, are investigated, with particular emphasis on the role of the star-triangle relations. Using these results, a natural and symmetrical parametrization is introduced and Yang-Baxter relations are constructed in an elementary way. The paper concludes with a consideration of duality, which links the present work to a recent paper of Baxter on the free fermion model.

Electronic thermal transport in strongly correlated multilayered nanostructures

NASA Astrophysics Data System (ADS)

Freericks, J. K.; Zlatić, V.; Shvaika, A. M.

2007-01-01

The formalism for a linear-response many-body treatment of the electronic contributions to thermal transport is developed for multilayered nanostructures. By properly determining the local heat-current operator, it is possible to show that the Jonson-Mahan theorem for the bulk can be extended to inhomogeneous problems, so the various thermal-transport coefficient integrands are related by powers of frequency (including all effects of vertex corrections when appropriate). We illustrate how to use this formalism by showing how it applies to measurements of the Peltier effect, the Seebeck effect, and the thermal conductance.

Proving relations between modular graph functions

NASA Astrophysics Data System (ADS)

Basu, Anirban

2016-12-01

We consider modular graph functions that arise in the low energy expansion of the four graviton amplitude in type II string theory. The vertices of these graphs are the positions of insertions of vertex operators on the toroidal worldsheet, while the links are the scalar Green functions connecting the vertices. Graphs with four and five links satisfy several non-trivial relations, which have been proved recently. We prove these relations by using elementary properties of Green functions and the details of the graphs. We also prove a relation between modular graph functions with six links.

A Subdivision-Based Representation for Vector Image Editing.

PubMed

Liao, Zicheng; Hoppe, Hugues; Forsyth, David; Yu, Yizhou

2012-11-01

Vector graphics has been employed in a wide variety of applications due to its scalability and editability. Editability is a high priority for artists and designers who wish to produce vector-based graphical content with user interaction. In this paper, we introduce a new vector image representation based on piecewise smooth subdivision surfaces, which is a simple, unified and flexible framework that supports a variety of operations, including shape editing, color editing, image stylization, and vector image processing. These operations effectively create novel vector graphics by reusing and altering existing image vectorization results. Because image vectorization yields an abstraction of the original raster image, controlling the level of detail of this abstraction is highly desirable. To this end, we design a feature-oriented vector image pyramid that offers multiple levels of abstraction simultaneously. Our new vector image representation can be rasterized efficiently using GPU-accelerated subdivision. Experiments indicate that our vector image representation achieves high visual quality and better supports editing operations than existing representations.

Similar Response Patterns to 5%Topical Minoxidil Foam in Frontal and Vertex Scalp of Men with Androgenetic Alopecia: A Microarray Analysis

PubMed Central

Mirmirani, P.; Consolo, M.; Oyetakin-White, P.; Baron, E.; Leahy, P.; Karnik, P.

2014-01-01

Summary Background There are regional variations in scalp hair miniaturization seen in androgenetic alopecia (AGA). Use of topical minoxidil can lead to reversal of miniaturization in the vertex scalp. However, its effects on other scalp regions are less well studied. Methods A placebo controlled double-blinded prospective pilot study of minoxidil topical foam 5% (MTF) vs placebo was conducted in sixteen healthy men ages 18-49 with Hamilton-Norwood type IV-V thinning. The subjects were asked to apply the treatment (active drug or placebo) to the scalp twice daily for eight weeks. Stereotactic scalp photographs were taken at the baseline and final visits to monitor global hair growth. Scalp biopsies were done at the leading edge of hair loss from the frontal and vertex scalp before and after treatment with MTF and placebo and microarray analysis was done using the Affymetrix GeneChip HG U133 Plus 2.0. Results Global stereotactic photographs showed that MTF induced hair growth in both the frontal and vertex scalp of AGA patients. Regional differences in gene expression profiles were observed before treatment. However, MTF treatment induced the expression of hair keratin associated genes and decreased the expression of epidermal differentiation complex (EDC) and inflammatory genes in both scalp regions. Conclusions These data suggest that MTF is effective in the treatment of both the frontal and vertex scalp of AGA patients. PMID:25204361

Conservation laws, vertex corrections, and screening in Raman spectroscopy

NASA Astrophysics Data System (ADS)

Maiti, Saurabh; Chubukov, Andrey V.; Hirschfeld, P. J.

2017-07-01

We present a microscopic theory for the Raman response of a clean multiband superconductor, with emphasis on the effects of vertex corrections and long-range Coulomb interaction. The measured Raman intensity, R (Ω ) , is proportional to the imaginary part of the fully renormalized particle-hole correlator with Raman form factors γ (k ⃗) . In a BCS superconductor, a bare Raman bubble is nonzero for any γ (k ⃗) and diverges at Ω =2 Δmax , where Δmax is the largest gap along the Fermi surface. However, for γ (k ⃗) = constant, the full R (Ω ) is expected to vanish due to particle number conservation. It was sometimes stated that this vanishing is due to the singular screening by long-range Coulomb interaction. In our general approach, we show diagrammatically that this vanishing actually holds due to vertex corrections from the same short-range interaction that gives rise to superconductivity. We further argue that long-range Coulomb interaction does not affect the Raman signal for any γ (k ⃗) . We argue that vertex corrections eliminate the divergence at 2 Δmax . We also argue that vertex corrections give rise to sharp peaks in R (Ω ) at Ω <2 Δmin (the minimum gap along the Fermi surface), when Ω coincides with the frequency of one of the collective modes in a superconductor, e.g., Leggett and Bardasis-Schrieffer modes in the particle-particle channel, and an excitonic mode in the particle-hole channel.

Clipping polygon faces through a polyhedron of vision

NASA Technical Reports Server (NTRS)

Florence, Judit K. (Inventor); Rohner, Michel A. (Inventor)

1980-01-01

A flight simulator combines flight data and polygon face terrain data to provide a CRT display at each window of the simulated aircraft. The data base specifies the relative position of each vertex of each polygon face therein. Only those terrain faces currently appearing within the pyramid of vision defined by the pilots eye and the edges of the pilots window need be displayed at any given time. As the orientation of the pyramid of vision changes in response to flight data, the displayed faces are correspondingly displaced, eventually moving out of the pyramid of vision. Faces which are currently not visible (outside the pyramid of vision) are clipped from the data flow. In addition, faces which are only partially outside of pyramid of vision are reconstructed to eliminate the outside portion. Window coordinates are generated defining the distance between each vertex and each of the boundary planes forming the pyramid of vision. The sign bit of each window coordinate indicates whether the vertex is on the pyramid of vision side of the associated boundary panel (positive), or on the other side thereof (negative). The set of sign bits accompanying each vertex constitute the outcode of that vertex. The outcodes (O.C.) are systematically processed and examined to determine which faces are completely inside the pyramid of vision (Case A--all signs positive), which faces are completely outside (Case C--All signs negative) and which faces must be reconstructed (Case B--both positive and negative signs).

The breech presentation and the vertex presentation following an external version represent risk factors for neonatal hip instability.

PubMed

Andersson, J E; Odén, A

2001-08-01

The aim of this study was to evaluate the frequency and type of hip-joint instability and the frequency of hip dislocation requiring treatment in neonates who had been lying in the breech presentation and were delivered vaginally after an external version or by caesarean section, and to compare them with neonates who were naturally in the vertex presentation. Breech presentations without ongoing labour were subjected to an attempted external version and, in cases where this proved unsuccessful or where labour had started, to deliver by caesarean section. None of the breech presentations was vaginally delivered. The anterior-dynamic ultrasound method was used to assess the hip-joint status of the neonates. Out of 6,571 foetuses, 257 were in breech presentation after 36 wk of pregnancy. Sixty-two were vaginally delivered following an external version to vertex presentation and 195 were delivered by caesarean section, 75 of these following unsuccessful attempts to perform a version. Treatment for congenital hip-joint dislocation was performed on 0.2%. Out of the breech presentations, 1.0% of those delivered by caesarean section were treated, while in those with vaginal delivery following an external version the treatment frequency was 3.2%. No case of late diagnosed hip dislocation was recorded. Significant differences in frequency of hip-joint instability and treatment were found between (i) neonates delivered in breech presentation and those delivered with vertex presentation, (ii) infants delivered in vertex presentation, naturally or after successful version, and (iii) those delivered by caesarean section with or without attempted external version and those delivered with vortex presentation. Breech presentation predisposes to increased hip instability. The instability is present prior to delivery and is certainly not a primary result of delivery forces. Both breech and vertex presentations following an external or spontaneous version should be considered as risk factors for neonatal hip instability.

GraphReduce: Large-Scale Graph Analytics on Accelerator-Based HPC Systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sengupta, Dipanjan; Agarwal, Kapil; Song, Shuaiwen

2015-09-30

Recent work on real-world graph analytics has sought to leverage the massive amount of parallelism offered by GPU devices, but challenges remain due to the inherent irregularity of graph algorithms and limitations in GPU-resident memory for storing large graphs. We present GraphReduce, a highly efficient and scalable GPU-based framework that operates on graphs that exceed the device’s internal memory capacity. GraphReduce adopts a combination of both edge- and vertex-centric implementations of the Gather-Apply-Scatter programming model and operates on multiple asynchronous GPU streams to fully exploit the high degrees of parallelism in GPUs with efficient graph data movement between the hostmore » and the device.« less

Quantum mechanics in noninertial reference frames: Relativistic accelerations and fictitious forces

NASA Astrophysics Data System (ADS)

Klink, W. H.; Wickramasekara, S.

2016-06-01

One-particle systems in relativistically accelerating reference frames can be associated with a class of unitary representations of the group of arbitrary coordinate transformations, an extension of the Wigner-Bargmann definition of particles as the physical realization of unitary irreducible representations of the Poincaré group. Representations of the group of arbitrary coordinate transformations become necessary to define unitary operators implementing relativistic acceleration transformations in quantum theory because, unlike in the Galilean case, the relativistic acceleration transformations do not themselves form a group. The momentum operators that follow from these representations show how the fictitious forces in noninertial reference frames are generated in quantum theory.

Galilean invariance and vertex renormalization in turbulence theory.

PubMed

McComb, W D

2005-03-01

The Navier-Stokes equation is invariant under Galilean transformation of the instantaneous velocity field. However, the total velocity transformation is effected by transformation of the mean velocity alone. For a constant mean velocity, the equation of motion for the fluctuating velocity is automatically Galilean invariant in the comoving frame, and vertex renormalization is not constrained by this symmetry.

On the locating domination number of P n [trianglerightequal] H graph

NASA Astrophysics Data System (ADS)

Agustin Retno Wardani, Dwi; Hesti Agustin, Ika; Dafik; Alfarisi, Ridho

2018-04-01

A subset D of V(G) is called a vertex dominating set of G if every vertex not in D is adjacent to some vertices in D. A graph G = (V, E) is called a locating dominating set if for every two vertices u,v\\in V(G)-D, N(v)\\cap D\

Optimized Vertex Method and Hybrid Reliability

NASA Technical Reports Server (NTRS)

Smith, Steven A.; Krishnamurthy, T.; Mason, B. H.

2002-01-01

A method of calculating the fuzzy response of a system is presented. This method, called the Optimized Vertex Method (OVM), is based upon the vertex method but requires considerably fewer function evaluations. The method is demonstrated by calculating the response membership function of strain-energy release rate for a bonded joint with a crack. The possibility of failure of the bonded joint was determined over a range of loads. After completing the possibilistic analysis, the possibilistic (fuzzy) membership functions were transformed to probability density functions and the probability of failure of the bonded joint was calculated. This approach is called a possibility-based hybrid reliability assessment. The possibility and probability of failure are presented and compared to a Monte Carlo Simulation (MCS) of the bonded joint.

Continuous-time quantum Monte Carlo calculation of multiorbital vertex asymptotics

NASA Astrophysics Data System (ADS)

Kaufmann, Josef; Gunacker, Patrik; Held, Karsten

2017-07-01

We derive the equations for calculating the high-frequency asymptotics of the local two-particle vertex function for a multiorbital impurity model. These relate the asymptotics for a general local interaction to equal-time two-particle Green's functions, which we sample using continuous-time quantum Monte Carlo simulations with a worm algorithm. As specific examples we study the single-orbital Hubbard model and the three t2 g orbitals of SrVO3 within dynamical mean-field theory (DMFT). We demonstrate how the knowledge of the high-frequency asymptotics reduces the statistical uncertainties of the vertex and further eliminates finite-box-size effects. The proposed method benefits the calculation of nonlocal susceptibilities in DMFT and diagrammatic extensions of DMFT.

Anomalous glassy dynamics in simple models of dense biological tissue

NASA Astrophysics Data System (ADS)

Sussman, Daniel M.; Paoluzzi, M.; Marchetti, M. Cristina; Manning, M. Lisa

2018-02-01

In order to understand the mechanisms for glassy dynamics in biological tissues and shed light on those in non-biological materials, we study the low-temperature disordered phase of 2D vertex-like models. Recently it has been noted that vertex models have quite unusual behavior in the zero-temperature limit, with rigidity transitions that are controlled by residual stresses and therefore exhibit very different scaling and phenomenology compared to particulate systems. Here we investigate the finite-temperature phase of two-dimensional Voronoi and Vertex models, and show that they have highly unusual, sub-Arrhenius scaling of dynamics with temperature. We connect the anomalous glassy dynamics to features of the potential energy landscape associated with zero-temperature inherent states.

JavaGenes: Evolving Graphs with Crossover

NASA Technical Reports Server (NTRS)

Globus, Al; Atsatt, Sean; Lawton, John; Wipke, Todd

2000-01-01

Genetic algorithms usually use string or tree representations. We have developed a novel crossover operator for a directed and undirected graph representation, and used this operator to evolve molecules and circuits. Unlike strings or trees, a single point in the representation cannot divide every possible graph into two parts, because graphs may contain cycles. Thus, the crossover operator is non-trivial. A steady-state, tournament selection genetic algorithm code (JavaGenes) was written to implement and test the graph crossover operator. All runs were executed by cycle-scavagging on networked workstations using the Condor batch processing system. The JavaGenes code has evolved pharmaceutical drug molecules and simple digital circuits. Results to date suggest that JavaGenes can evolve moderate sized drug molecules and very small circuits in reasonable time. The algorithm has greater difficulty with somewhat larger circuits, suggesting that directed graphs (circuits) are more difficult to evolve than undirected graphs (molecules), although necessary differences in the crossover operator may also explain the results. In principle, JavaGenes should be able to evolve other graph-representable systems, such as transportation networks, metabolic pathways, and computer networks. However, large graphs evolve significantly slower than smaller graphs, presumably because the space-of-all-graphs explodes combinatorially with graph size. Since the representation strongly affects genetic algorithm performance, adding graphs to the evolutionary programmer's bag-of-tricks should be beneficial. Also, since graph evolution operates directly on the phenotype, the genotype-phenotype translation step, common in genetic algorithm work, is eliminated.

Computational Models of Human Performance: Validation of Memory and Procedural Representation in Advanced Air/Ground Simulation

NASA Technical Reports Server (NTRS)

Corker, Kevin M.; Labacqz, J. Victor (Technical Monitor)

1997-01-01

The Man-Machine Interaction Design and Analysis System (MIDAS) under joint U.S. Army and NASA cooperative is intended to assist designers of complex human/automation systems in successfully incorporating human performance capabilities and limitations into decision and action support systems. MIDAS is a computational representation of multiple human operators, selected perceptual, cognitive, and physical functions of those operators, and the physical/functional representation of the equipment with which they operate. MIDAS has been used as an integrated predictive framework for the investigation of human/machine systems, particularly in situations with high demands on the operators. We have extended the human performance models to include representation of both human operators and intelligent aiding systems in flight management, and air traffic service. The focus of this development is to predict human performance in response to aiding system developed to identify aircraft conflict and to assist in the shared authority for resolution. The demands of this application requires representation of many intelligent agents sharing world-models, coordinating action/intention, and cooperative scheduling of goals and action in an somewhat unpredictable world of operations. In recent applications to airborne systems development, MIDAS has demonstrated an ability to predict flight crew decision-making and procedural behavior when interacting with automated flight management systems and Air Traffic Control. In this paper, we describe two enhancements to MIDAS. The first involves the addition of working memory in the form of an articulatory buffer for verbal communication protocols and a visuo-spatial buffer for communications via digital datalink. The second enhancement is a representation of multiple operators working as a team. This enhanced model was used to predict the performance of human flight crews and their level of compliance with commercial aviation communication procedures. We show how the data produced by MIDAS compares with flight crew performance data from full mission simulations. Finally, we discuss the use of these features to study communication issues connected with aircraft-based separation assurance.

GRAPHICAL REPRESENTATIONS OF 1991 STEAM-ELECTRIC POWER PLANT OPERATION AND AIR EMISSIONS DATA

EPA Science Inventory

The report provides graphical representations of data derived from the U.S. Department of Energy's (DOE's) Energy Information Administration, s Form EIA-767 (Steam Electric Plant Operation and Design Report). or more than 10 years, EIA has collected monthly boiler level data from...

Nonperturbative study of the four gluon vertex

NASA Astrophysics Data System (ADS)

Binosi, D.; Ibañez, D.; Papavassiliou, J.

2014-09-01

In this paper we study the nonperturbative structure of the SU(3) four-gluon vertex in the Landau gauge, concentrating on contributions quadratic in the metric. We employ an approximation scheme where "one-loop" diagrams are computed using fully dressed gluon and ghost propagators, and tree-level vertices. When a suitable kinematical configuration depending on a single momentum scale p is chosen, only two structures emerge: the tree-level four-gluon vertex, and a tensor orthogonal to it. A detailed numerical analysis reveals that the form factor associated with this latter tensor displays a change of sign (zero-crossing) in the deep infrared, and finally diverges logarithmically. The origin of this characteristic behavior is proven to be entirely due to the masslessness of the ghost propagators forming the corresponding ghost-loop diagram, in close analogy to a similar effect established for the three-gluon vertex. However, in the case at hand, and under the approximations employed, this particular divergence does not affect the form factor proportional to the tree-level tensor, which remains finite in the entire range of momenta, and deviates moderately from its naive tree-level value. It turns out that the kinematic configuration chosen is ideal for carrying out lattice simulations, because it eliminates from the connected Green's function all one-particle reducible contributions, projecting out the genuine one-particle irreducible vertex. Motivated by this possibility, we discuss in detail how a hypothetical lattice measurement of this quantity would compare to the results presented here, and the potential interference from an additional tensorial structure, allowed by Bose symmetry, but not encountered within our scheme.

The role of geometry in 4-vertex origami mechanics

NASA Astrophysics Data System (ADS)

Waitukaitis, Scott; Dieleman, Peter; van Hecke, Martin

Origami offers an interesting design platform metamaterials because it strongly couples mechanics with geometry. Even so, most research carried out so far has been limited to one or two particular patterns. I will discuss the full geometrical space of the most common origami building block, the 4-vertex, and show how exotic geometries can have dramatic effects on the mechanics.

Reconstruction of primary vertices at the ATLAS experiment in Run 1 proton-proton collisions at the LHC.

PubMed

Aaboud, M; Aad, G; Abbott, B; Abdallah, J; Abdinov, O; Abeloos, B; Aben, R; AbouZeid, O S; Abraham, N L; Abramowicz, H; Abreu, H; Abreu, R; Abulaiti, Y; Acharya, B S; Adamczyk, L; Adams, D L; Adelman, J; Adomeit, S; Adye, T; Affolder, A A; Agatonovic-Jovin, T; Agricola, J; Aguilar-Saavedra, J A; Ahlen, S P; Ahmadov, F; Aielli, G; Akerstedt, H; Åkesson, T P A; Akimov, A V; Alberghi, G L; Albert, J; Albrand, S; Verzini, M J Alconada; Aleksa, M; Aleksandrov, I N; Alexa, C; Alexander, G; Alexopoulos, T; Alhroob, M; Ali, B; Aliev, M; Alimonti, G; Alison, J; Alkire, S P; Allbrooke, B M M; Allen, B W; Allport, P P; Aloisio, A; Alonso, A; Alonso, F; Alpigiani, C; Alstaty, M; Gonzalez, B Alvarez; Piqueras, D Álvarez; Alviggi, M G; Amadio, B T; Amako, K; Coutinho, Y Amaral; Amelung, C; Amidei, D; Santos, S P Amor Dos; Amorim, A; Amoroso, S; Amundsen, G; Anastopoulos, C; Ancu, L S; Andari, N; Andeen, T; Anders, C F; Anders, G; Anders, J K; Anderson, K J; Andreazza, A; Andrei, V; Angelidakis, S; Angelozzi, I; Anger, P; Angerami, A; Anghinolfi, F; Anisenkov, A V; Anjos, N; Annovi, A; Antel, C; Antonelli, M; Antonov, A; Anulli, F; Aoki, M; Bella, L Aperio; Arabidze, G; Arai, Y; Araque, J P; Arce, A T H; Arduh, F A; Arguin, J-F; Argyropoulos, S; Arik, M; Armbruster, A J; Armitage, L J; Arnaez, O; Arnold, H; Arratia, M; Arslan, O; Artamonov, A; Artoni, G; Artz, S; Asai, S; Asbah, N; Ashkenazi, A; Åsman, B; Asquith, L; Assamagan, K; Astalos, R; Atkinson, M; Atlay, N B; Augsten, K; Avolio, G; Axen, B; Ayoub, M K; Azuelos, G; Baak, M A; Baas, A E; Baca, M J; Bachacou, H; Bachas, K; Backes, M; Backhaus, M; Bagiacchi, P; Bagnaia, P; Bai, Y; Baines, J T; Baker, O K; Baldin, E M; Balek, P; Balestri, T; Balli, F; Balunas, W K; Banas, E; Banerjee, Sw; Bannoura, A A E; Barak, L; Barberio, E L; Barberis, D; Barbero, M; Barillari, T; Barisits, M-S; Barklow, T; Barlow, N; Barnes, S L; Barnett, B M; Barnett, R M; Barnovska-Blenessy, Z; Baroncelli, A; Barone, G; Barr, A J; Navarro, L Barranco; Barreiro, F; da Costa, J Barreiro Guimarães; Bartoldus, R; Barton, A E; Bartos, P; Basalaev, A; Bassalat, A; Bates, R L; Batista, S J; Batley, J R; Battaglia, M; Bauce, M; Bauer, F; Bawa, H S; Beacham, J B; Beattie, M D; Beau, T; Beauchemin, P H; Bechtle, P; Beck, H P; Becker, K; Becker, M; Beckingham, M; Becot, C; Beddall, A J; Beddall, A; Bednyakov, V A; Bedognetti, M; Bee, C P; Beemster, L J; Beermann, T A; Begel, M; Behr, J K; Belanger-Champagne, C; Bell, A S; Bella, G; Bellagamba, L; Bellerive, A; Bellomo, M; Belotskiy, K; Beltramello, O; Belyaev, N L; Benary, O; Benchekroun, D; Bender, M; Bendtz, K; Benekos, N; Benhammou, Y; Noccioli, E Benhar; Benitez, J; Benjamin, D P; Bensinger, J R; Bentvelsen, S; Beresford, L; Beretta, M; Berge, D; Kuutmann, E Bergeaas; Berger, N; Beringer, J; Berlendis, S; Bernard, N R; Bernius, C; Bernlochner, F U; Berry, T; Berta, P; Bertella, C; Bertoli, G; Bertolucci, F; Bertram, I A; Bertsche, C; Bertsche, D; Besjes, G J; Bylund, O Bessidskaia; Bessner, M; Besson, N; Betancourt, C; Bethke, S; Bevan, A J; Bhimji, W; Bianchi, R M; Bianchini, L; Bianco, M; Biebel, O; Biedermann, D; Bielski, R; Biesuz, N V; Biglietti, M; De Mendizabal, J Bilbao; Bilokon, H; Bindi, M; Binet, S; Bingul, A; Bini, C; Biondi, S; Bjergaard, D M; Black, C W; Black, J E; Black, K M; Blackburn, D; Blair, R E; Blanchard, J-B; Blanco, J E; Blazek, T; Bloch, I; Blocker, C; Blum, W; Blumenschein, U; Blunier, S; Bobbink, G J; Bobrovnikov, V S; Bocchetta, S S; Bocci, A; Bock, C; Boehler, M; Boerner, D; Bogaerts, J A; Bogavac, D; Bogdanchikov, A G; Bohm, C; Boisvert, V; Bokan, P; Bold, T; Boldyrev, A S; Bomben, M; Bona, M; Boonekamp, M; Borisov, A; Borissov, G; Bortfeldt, J; Bortoletto, D; Bortolotto, V; Boscherini, D; Bosman, M; Sola, J D Bossio; Boudreau, J; Bouffard, J; Bouhova-Thacker, E V; Boumediene, D; Bourdarios, C; Boutle, S K; Boveia, A; Boyd, J; Boyko, I R; Bracinik, J; Brandt, A; Brandt, G; Brandt, O; Bratzler, U; Brau, B; Brau, J E; Braun, H M; Madden, W D Breaden; Brendlinger, K; Brennan, A J; Brenner, L; Brenner, R; Bressler, S; Bristow, T M; Britton, D; Britzger, D; Brochu, F M; Brock, I; Brock, R; Brooijmans, G; Brooks, T; Brooks, W K; Brosamer, J; Brost, E; Broughton, J H; de Renstrom, P A Bruckman; Bruncko, D; Bruneliere, R; Bruni, A; Bruni, G; Bruni, L S; Brunt, B H; Bruschi, M; Bruscino, N; Bryant, P; Bryngemark, L; Buanes, T; Buat, Q; Buchholz, P; Buckley, A G; Budagov, I A; Buehrer, F; Bugge, M K; Bulekov, O; Bullock, D; Burckhart, H; Burdin, S; Burgard, C D; Burghgrave, B; Burka, K; Burke, S; Burmeister, I; Burr, J T P; Busato, E; Büscher, D; Büscher, V; Bussey, P; Butler, J M; Buttar, C M; Butterworth, J M; Butti, P; Buttinger, W; Buzatu, A; Buzykaev, A R; Urbán, S Cabrera; Caforio, D; Cairo, V M; Cakir, O; Calace, N; Calafiura, P; Calandri, A; Calderini, G; Calfayan, P; Callea, G; Caloba, L P; Lopez, S Calvente; Calvet, D; Calvet, S; Calvet, T P; Toro, R Camacho; Camarda, S; Camarri, P; Cameron, D; Armadans, R Caminal; Camincher, C; Campana, S; Campanelli, M; Camplani, A; Campoverde, A; Canale, V; Canepa, A; Bret, M Cano; Cantero, J; Cantrill, R; Cao, T; Garrido, M D M Capeans; Caprini, I; Caprini, M; Capua, M; Caputo, R; Carbone, R M; Cardarelli, R; Cardillo, F; Carli, I; Carli, T; Carlino, G; Carminati, L; Caron, S; Carquin, E; Carrillo-Montoya, G D; Carter, J R; Carvalho, J; Casadei, D; Casado, M P; Casolino, M; Casper, D W; Castaneda-Miranda, E; Castelijn, R; Castelli, A; Gimenez, V Castillo; Castro, N F; Catinaccio, A; Catmore, J R; Cattai, A; Caudron, J; Cavaliere, V; Cavallaro, E; Cavalli, D; Cavalli-Sforza, M; Cavasinni, V; Ceradini, F; Alberich, L Cerda; Cerio, B C; Cerqueira, A S; Cerri, A; Cerrito, L; Cerutti, F; Cerv, M; Cervelli, A; Cetin, S A; Chafaq, A; Chakraborty, D; Chan, S K; Chan, Y L; Chang, P; Chapman, J D; Charlton, D G; Chatterjee, A; Chau, C C; Barajas, C A Chavez; Che, S; Cheatham, S; Chegwidden, A; Chekanov, S; Chekulaev, S V; Chelkov, G A; Chelstowska, M A; Chen, C; Chen, H; Chen, K; Chen, S; Chen, S; Chen, X; Chen, Y; Cheng, H C; Cheng, H J; Cheng, Y; Cheplakov, A; Cheremushkina, E; Moursli, R Cherkaoui El; Chernyatin, V; Cheu, E; Chevalier, L; Chiarella, V; Chiarelli, G; Chiodini, G; Chisholm, A S; Chitan, A; Chizhov, M V; Choi, K; Chomont, A R; Chouridou, S; Chow, B K B; Christodoulou, V; Chromek-Burckhart, D; Chudoba, J; Chuinard, A J; Chwastowski, J J; Chytka, L; Ciapetti, G; Ciftci, A K; Cinca, D; Cindro, V; Cioara, I A; Ciocca, C; Ciocio, A; Cirotto, F; Citron, Z H; Citterio, M; Ciubancan, M; Clark, A; Clark, B L; Clark, M R; Clark, P J; Clarke, R N; Clement, C; Coadou, Y; Cobal, M; Coccaro, A; Cochran, J; Coffey, L; Colasurdo, L; Cole, B; Colijn, A P; Collot, J; Colombo, T; Compostella, G; Muiño, P Conde; Coniavitis, E; Connell, S H; Connelly, I A; Consorti, V; Constantinescu, S; Conti, G; Conventi, F; Cooke, M; Cooper, B D; Cooper-Sarkar, A M; Cormier, K J R; Cornelissen, T; Corradi, M; Corriveau, F; Corso-Radu, A; Cortes-Gonzalez, A; Cortiana, G; Costa, G; Costa, M J; Costanzo, D; Cottin, G; Cowan, G; Cox, B E; Cranmer, K; Crawley, S J; Cree, G; Crépé-Renaudin, S; Crescioli, F; Cribbs, W A; Ortuzar, M Crispin; Cristinziani, M; Croft, V; Crosetti, G; Donszelmann, T Cuhadar; Cummings, J; Curatolo, M; Cúth, J; Cuthbert, C; Czirr, H; Czodrowski, P; D'amen, G; D'Auria, S; D'Onofrio, M; De Sousa, M J Da Cunha Sargedas; Via, C Da; Dabrowski, W; Dado, T; Dai, T; Dale, O; Dallaire, F; Dallapiccola, C; Dam, M; Dandoy, J R; Dang, N P; Daniells, A C; Dann, N S; Danninger, M; Hoffmann, M Dano; Dao, V; Darbo, G; Darmora, S; Dassoulas, J; Dattagupta, A; Davey, W; David, C; Davidek, T; Davies, M; Davison, P; Dawe, E; Dawson, I; Daya-Ishmukhametova, R K; De, K; de Asmundis, R; De Benedetti, A; De Castro, S; De Cecco, S; De Groot, N; de Jong, P; De la Torre, H; De Lorenzi, F; De Maria, A; De Pedis, D; De Salvo, A; De Sanctis, U; De Santo, A; De Regie, J B De Vivie; Dearnaley, W J; Debbe, R; Debenedetti, C; Dedovich, D V; Dehghanian, N; Deigaard, I; Del Gaudio, M; Del Peso, J; Del Prete, T; Delgove, D; Deliot, F; Delitzsch, C M; Deliyergiyev, M; Dell'Acqua, A; Dell'Asta, L; Dell'Orso, M; Della Pietra, M; Della Volpe, D; Delmastro, M; Delsart, P A; DeMarco, D A; Demers, S; Demichev, M; Demilly, A; Denisov, S P; Denysiuk, D; Derendarz, D; Derkaoui, J E; Derue, F; Dervan, P; Desch, K; Deterre, C; Dette, K; Deviveiros, P O; Dewhurst, A; Dhaliwal, S; Di Ciaccio, A; Di Ciaccio, L; Di Clemente, W K; Di Donato, C; Di Girolamo, A; Di Girolamo, B; Di Micco, B; Di Nardo, R; Di Simone, A; Di Sipio, R; Di Valentino, D; Diaconu, C; Diamond, M; Dias, F A; Diaz, M A; Diehl, E B; Dietrich, J; Diglio, S; Dimitrievska, A; Dingfelder, J; Dita, P; Dita, S; Dittus, F; Djama, F; Djobava, T; Djuvsland, J I; do Vale, M A B; Dobos, D; Dobre, M; Doglioni, C; Dohmae, T; Dolejsi, J; Dolezal, Z; Dolgoshein, B A; Donadelli, M; Donati, S; Dondero, P; Donini, J; Dopke, J; Doria, A; Dova, M T; Doyle, A T; Drechsler, E; Dris, M; Du, Y; Duarte-Campderros, J; Duchovni, E; Duckeck, G; Ducu, O A; Duda, D; Dudarev, A; Duffield, E M; Duflot, L; Duguid, L; Dührssen, M; Dumancic, M; Dunford, M; Yildiz, H Duran; Düren, M; Durglishvili, A; Duschinger, D; Dutta, B; Dyndal, M; Eckardt, C; Ecker, K M; Edgar, R C; Edwards, N C; Eifert, T; Eigen, G; Einsweiler, K; Ekelof, T; Kacimi, M El; Ellajosyula, V; Ellert, M; Elles, S; Ellinghaus, F; Elliot, A A; Ellis, N; Elmsheuser, J; Elsing, M; Emeliyanov, D; Enari, Y; Endner, O C; Endo, M; Ennis, J S; Erdmann, J; Ereditato, A; Ernis, G; Ernst, J; Ernst, M; Errede, S; Ertel, E; Escalier, M; Esch, H; Escobar, C; Esposito, B; Etienvre, A I; Etzion, E; Evans, H; Ezhilov, A; Fabbri, F; Fabbri, L; Facini, G; Fakhrutdinov, R M; Falciano, S; Falla, R J; Faltova, J; Fang, Y; Fanti, M; Farbin, A; Farilla, A; Farina, C; Farina, E M; Farooque, T; Farrell, S; Farrington, S M; Farthouat, P; Fassi, F; Fassnacht, P; Fassouliotis, D; Giannelli, M Faucci; Favareto, A; Fawcett, W J; Fayard, L; Fedin, O L; Fedorko, W; Feigl, S; Feligioni, L; Feng, C; Feng, E J; Feng, H; Fenyuk, A B; Feremenga, L; Martinez, P Fernandez; Perez, S Fernandez; Ferrando, J; Ferrari, A; Ferrari, P; Ferrari, R; de Lima, D E Ferreira; Ferrer, A; Ferrere, D; Ferretti, C; Parodi, A Ferretto; Fiedler, F; Filipčič, A; Filipuzzi, M; Filthaut, F; Fincke-Keeler, M; Finelli, K D; Fiolhais, M C N; Fiorini, L; Firan, A; Fischer, A; Fischer, C; Fischer, J; Fisher, W C; Flaschel, N; Fleck, I; Fleischmann, P; Fletcher, G T; Fletcher, R R M; Flick, T; Floderus, A; Castillo, L R Flores; Flowerdew, M J; Forcolin, G T; Formica, A; Forti, A; Foster, A G; Fournier, D; Fox, H; Fracchia, S; Francavilla, P; Franchini, M; Francis, D; Franconi, L; Franklin, M; Frate, M; Fraternali, M; Freeborn, D; Fressard-Batraneanu, S M; Friedrich, F; Froidevaux, D; Frost, J A; Fukunaga, C; Fusayasu, T; Fuster, J; Gabaldon, C; Gabizon, O; Gabrielli, A; Gabrielli, A; Gach, G P; Gadatsch, S; Gadomski, S; Gagliardi, G; Gagnon, L G; Gagnon, P; Galea, C; Galhardo, B; Gallas, E J; Gallop, B J; Gallus, P; Galster, G; Gan, K K; Gao, J; Gao, Y; Gao, Y S; Walls, F M Garay; García, C; Navarro, J E García; Garcia-Sciveres, M; Gardner, R W; Garelli, N; Garonne, V; Bravo, A Gascon; Gatti, C; Gaudiello, A; Gaudio, G; Gaur, B; Gauthier, L; Gavrilenko, I L; Gay, C; Gaycken, G; Gazis, E N; Gecse, Z; Gee, C N P; Geich-Gimbel, Ch; Geisen, M; Geisler, M P; Gemme, C; Genest, M H; Geng, C; Gentile, S; Gentsos, C; George, S; Gerbaudo, D; Gershon, A; Ghasemi, S; Ghazlane, H; Ghneimat, M; Giacobbe, B; Giagu, S; Giannetti, P; Gibbard, B; Gibson, S M; Gignac, M; Gilchriese, M; Gillam, T P S; Gillberg, D; Gilles, G; Gingrich, D M; Giokaris, N; Giordani, M P; Giorgi, F M; Giorgi, F M; Giraud, P F; Giromini, P; Giugni, D; Giuli, F; Giuliani, C; Giulini, M; Gjelsten, B K; Gkaitatzis, S; Gkialas, I; Gkougkousis, E L; Gladilin, L K; Glasman, C; Glatzer, J; Glaysher, P C F; Glazov, A; Goblirsch-Kolb, M; Godlewski, J; Goldfarb, S; Golling, T; Golubkov, D; Gomes, A; Gonçalo, R; Costa, J Goncalves Pinto Firmino Da; Gonella, G; Gonella, L; Gongadze, A; de la Hoz, S González; Parra, G Gonzalez; Gonzalez-Sevilla, S; Goossens, L; Gorbounov, P A; Gordon, H A; Gorelov, I; Gorini, B; Gorini, E; Gorišek, A; Gornicki, E; Goshaw, A T; Gössling, C; Gostkin, M I; Goudet, C R; Goujdami, D; Goussiou, A G; Govender, N; Gozani, E; Graber, L; Grabowska-Bold, I; Gradin, P O J; Grafström, P; Gramling, J; Gramstad, E; Grancagnolo, S; Gratchev, V; Gravila, P M; Gray, H M; Graziani, E; Greenwood, Z D; Grefe, C; Gregersen, K; Gregor, I M; Grenier, P; Grevtsov, K; Griffiths, J; Grillo, A A; Grimm, K; Grinstein, S; Gris, Ph; Grivaz, J-F; Groh, S; Grohs, J P; Gross, E; Grosse-Knetter, J; Grossi, G C; Grout, Z J; Guan, L; Guan, W; Guenther, J; Guescini, F; Guest, D; Gueta, O; Guido, E; Guillemin, T; Guindon, S; Gul, U; Gumpert, C; Guo, J; Guo, Y; Gupta, R; Gupta, S; Gustavino, G; Gutierrez, P; Ortiz, N G Gutierrez; Gutschow, C; Guyot, C; Gwenlan, C; Gwilliam, C B; Haas, A; Haber, C; Hadavand, H K; Hadef, A; Haefner, P; Hageböck, S; Hajduk, Z; Hakobyan, H; Haleem, M; Haley, J; Halladjian, G; Hallewell, G D; Hamacher, K; Hamal, P; Hamano, K; Hamilton, A; Hamity, G N; Hamnett, P G; Han, L; Hanagaki, K; Hanawa, K; Hance, M; Haney, B; Hanke, P; Hanna, R; Hansen, J B; Hansen, J D; Hansen, M C; Hansen, P H; Hara, K; Hard, A S; Harenberg, T; Hariri, F; Harkusha, S; Harrington, R D; Harrison, P F; Hartmann, N M; Hasegawa, M; Hasegawa, Y; Hasib, A; Hassani, S; Haug, S; Hauser, R; Hauswald, L; Havranek, M; Hawkes, C M; Hawkings, R J; Hayden, D; Hays, C P; Hays, J M; Hayward, H S; Haywood, S J; Head, S J; Heck, T; Hedberg, V; Heelan, L; Heidegger, K K; Heim, S; Heim, T; Heinemann, B; Heinrich, J J; Heinrich, L; Heinz, C; Hejbal, J; Helary, L; Hellman, S; Helsens, C; Henderson, J; Henderson, R C W; Heng, Y; Henkelmann, S; Correia, A M Henriques; Henrot-Versille, S; Herbert, G H; Jiménez, Y Hernández; Herten, G; Hertenberger, R; Hervas, L; Hesketh, G G; Hessey, N P; Hetherly, J W; Hickling, R; Higón-Rodriguez, E; Hill, E; Hill, J C; Hiller, K H; Hillier, S J; Hinchliffe, I; Hines, E; Hinman, R R; Hirose, M; Hirschbuehl, D; Hobbs, J; Hod, N; Hodgkinson, M C; Hodgson, P; Hoecker, A; Hoeferkamp, M R; Hoenig, F; Hohn, D; Holmes, T R; Homann, M; Hong, T M; Hooberman, B H; Hopkins, W H; Horii, Y; Horton, A J; Hostachy, J-Y; Hou, S; Hoummada, A; Howarth, J; Hrabovsky, M; Hristova, I; Hrivnac, J; Hryn'ova, T; Hrynevich, A; Hsu, C; Hsu, P J; Hsu, S-C; Hu, D; Hu, Q; Huang, Y; Hubacek, Z; Hubaut, F; Huegging, F; Huffman, T B; Hughes, E W; Hughes, G; Huhtinen, M; Huo, P; Huseynov, N; Huston, J; Huth, J; Iacobucci, G; Iakovidis, G; Ibragimov, I; Iconomidou-Fayard, L; Ideal, E; Iengo, P; Igonkina, O; Iizawa, T; Ikegami, Y; Ikeno, M; Ilchenko, Y; Iliadis, D; Ilic, N; Ince, T; Introzzi, G; Ioannou, P; Iodice, M; Iordanidou, K; Ippolito, V; Ishijima, N; Ishino, M; Ishitsuka, M; Ishmukhametov, R; Issever, C; Istin, S; Ito, F; Ponce, J M Iturbe; Iuppa, R; Iwanski, W; Iwasaki, H; Izen, J M; Izzo, V; Jabbar, S; Jackson, B; Jackson, M; Jackson, P; Jain, V; Jakobi, K B; Jakobs, K; Jakobsen, S; Jakoubek, T; Jamin, D O; Jana, D K; Jansen, E; Jansky, R; Janssen, J; Janus, M; Jarlskog, G; Javadov, N; Javůrek, T; Javurkova, M; Jeanneau, F; Jeanty, L; Jeng, G-Y; Jennens, D; Jenni, P; Jentzsch, J; Jeske, C; Jézéquel, S; Ji, H; Jia, J; Jiang, H; Jiang, Y; Jiggins, S; Pena, J Jimenez; Jin, S; Jinaru, A; Jinnouchi, O; Johansson, P; Johns, K A; Johnson, W J; Jon-And, K; Jones, G; Jones, R W L; Jones, S; Jones, T J; Jongmanns, J; Jorge, P M; Jovicevic, J; Ju, X; Rozas, A Juste; Köhler, M K; Kaczmarska, A; Kado, M; Kagan, H; Kagan, M; Kahn, S J; Kajomovitz, E; Kalderon, C W; Kaluza, A; Kama, S; Kamenshchikov, A; Kanaya, N; Kaneti, S; Kanjir, L; Kantserov, V A; Kanzaki, J; Kaplan, B; Kaplan, L S; Kapliy, A; Kar, D; Karakostas, K; Karamaoun, A; Karastathis, N; Kareem, M J; Karentzos, E; Karnevskiy, M; Karpov, S N; Karpova, Z M; Karthik, K; Kartvelishvili, V; Karyukhin, A N; Kasahara, K; Kashif, L; Kass, R D; Kastanas, A; Kataoka, Y; Kato, C; Katre, A; Katzy, J; Kawade, K; Kawagoe, K; Kawamoto, T; Kawamura, G; Kazama, S; Kazanin, V F; Keeler, R; Kehoe, R; Keller, J S; Kempster, J J; Keoshkerian, H; Kepka, O; Kerševan, B P; Kersten, S; Keyes, R A; Khader, M; Khalil-Zada, F; Khanov, A; Kharlamov, A G; Khoo, T J; Khovanskiy, V; Khramov, E; Khubua, J; Kido, S; Kim, H Y; Kim, S H; Kim, Y K; Kimura, N; Kind, O M; King, B T; King, M; King, S B; Kirk, J; Kiryunin, A E; Kishimoto, T; Kisielewska, D; Kiss, F; Kiuchi, K; Kivernyk, O; Kladiva, E; Klein, M H; Klein, M; Klein, U; Kleinknecht, K; Klimek, P; Klimentov, A; Klingenberg, R; Klinger, J A; Klioutchnikova, T; Kluge, E-E; Kluit, P; Kluth, S; Knapik, J; Kneringer, E; Knoops, E B F G; Knue, A; Kobayashi, A; Kobayashi, D; Kobayashi, T; Kobel, M; Kocian, M; Kodys, P; Koffas, T; Koffeman, E; Koi, T; Kolanoski, H; Kolb, M; Koletsou, I; Komar, A A; Komori, Y; Kondo, T; Kondrashova, N; Köneke, K; König, A C; Kono, T; Konoplich, R; Konstantinidis, N; Kopeliansky, R; Koperny, S; Köpke, L; Kopp, A K; Korcyl, K; Kordas, K; Korn, A; Korol, A A; Korolkov, I; Korolkova, E V; Kortner, O; Kortner, S; Kosek, T; Kostyukhin, V V; Kotwal, A; Kourkoumeli-Charalampidi, A; Kourkoumelis, C; Kouskoura, V; Kowalewska, A B; Kowalewski, R; Kowalski, T Z; Kozakai, C; Kozanecki, W; Kozhin, A S; Kramarenko, V A; Kramberger, G; Krasnopevtsev, D; Krasny, M W; Krasznahorkay, A; Kraus, J K; Kravchenko, A; Kretz, M; Kretzschmar, J; Kreutzfeldt, K; Krieger, P; Krizka, K; Kroeninger, K; Kroha, H; Kroll, J; Kroseberg, J; Krstic, J; Kruchonak, U; Krüger, H; Krumnack, N; Kruse, A; Kruse, M C; Kruskal, M; Kubota, T; Kucuk, H; Kuday, S; Kuechler, J T; Kuehn, S; Kugel, A; Kuger, F; Kuhl, A; Kuhl, T; Kukhtin, V; Kukla, R; Kulchitsky, Y; Kuleshov, S; Kuna, M; Kunigo, T; Kupco, A; Kurashige, H; Kurochkin, Y A; Kus, V; Kuwertz, E S; Kuze, M; Kvita, J; Kwan, T; Kyriazopoulos, D; Rosa, A La; Navarro, J L La Rosa; Rotonda, L La; Lacasta, C; Lacava, F; Lacey, J; Lacker, H; Lacour, D; Lacuesta, V R; Ladygin, E; Lafaye, R; Laforge, B; Lagouri, T; Lai, S; Lammers, S; Lampl, W; Lançon, E; Landgraf, U; Landon, M P J; Lanfermann, M C; Lang, V S; Lange, J C; Lankford, A J; Lanni, F; Lantzsch, K; Lanza, A; Laplace, S; Lapoire, C; Laporte, J F; Lari, T; Manghi, F Lasagni; Lassnig, M; Laurelli, P; Lavrijsen, W; Law, A T; Laycock, P; Lazovich, T; Lazzaroni, M; Le, B; Dortz, O Le; Guirriec, E Le; Quilleuc, E P Le; LeBlanc, M; LeCompte, T; Ledroit-Guillon, F; Lee, C A; Lee, S C; Lee, L; Lefebvre, G; Lefebvre, M; Legger, F; Leggett, C; Lehan, A; Miotto, G Lehmann; Lei, X; Leight, W A; Leister, A G; Leite, M A L; Leitner, R; Lellouch, D; Lemmer, B; Leney, K J C; Lenz, T; Lenzi, B; Leone, R; Leone, S; Leonidopoulos, C; Leontsinis, S; Lerner, G; Leroy, C; Lesage, A A J; Lester, C G; Levchenko, M; Levêque, J; Levin, D; Levinson, L J; Levy, M; Lewis, D; Leyko, A M; Li, B; Li, H; Li, H L; Li, L; Li, L; Li, Q; Li, S; Li, X; Li, Y; Liang, Z; Liberti, B; Liblong, A; Lichard, P; Lie, K; Liebal, J; Liebig, W; Limosani, A; Lin, S C; Lin, T H; Lindquist, B E; Lionti, A E; Lipeles, E; Lipniacka, A; Lisovyi, M; Liss, T M; Lister, A; Litke, A M; Liu, B; Liu, D; Liu, H; Liu, H; Liu, J; Liu, J B; Liu, K; Liu, L; Liu, M; Liu, M; Liu, Y L; Liu, Y; Livan, M; Lleres, A; Merino, J Llorente; Lloyd, S L; Sterzo, F Lo; Lobodzinska, E M; Loch, P; Lockman, W S; Loebinger, F K; Loevschall-Jensen, A E; Loew, K M; Loginov, A; Lohse, T; Lohwasser, K; Lokajicek, M; Long, B A; Long, J D; Long, R E; Longo, L; Looper, K A; Lopes, L; Mateos, D Lopez; Paredes, B Lopez; Paz, I Lopez; Solis, A Lopez; Lorenz, J; Martinez, N Lorenzo; Losada, M; Lösel, P J; Lou, X; Lounis, A; Love, J; Love, P A; Lu, H; Lu, N; Lubatti, H J; Luci, C; Lucotte, A; Luedtke, C; Luehring, F; Lukas, W; Luminari, L; Lundberg, O; Lund-Jensen, B; Luzi, P M; Lynn, D; Lysak, R; Lytken, E; Lyubushkin, V; Ma, H; Ma, L L; Ma, Y; Maccarrone, G; Macchiolo, A; Macdonald, C M; Maček, B; Miguens, J Machado; Madaffari, D; Madar, R; Maddocks, H J; Mader, W F; Madsen, A; Maeda, J; Maeland, S; Maeno, T; Maevskiy, A S; Magradze, E; Mahlstedt, J; Maiani, C; Maidantchik, C; Maier, A A; Maier, T; Maio, A; Majewski, S; Makida, Y; Makovec, N; Malaescu, B; Malecki, Pa; Maleev, V P; Malek, F; Mallik, U; Malon, D; Malone, C; Maltezos, S; Malyukov, S; Mamuzic, J; Mancini, G; Mandelli, B; Mandelli, L; Mandić, I; Maneira, J; Filho, L Manhaes de Andrade; Ramos, J Manjarres; Mann, A; Manousos, A; Mansoulie, B; Mansour, J D; Mantifel, R; Mantoani, M; Manzoni, S; Mapelli, L; Marceca, G; March, L; Marchiori, G; Marcisovsky, M; Marjanovic, M; Marley, D E; Marroquim, F; Marsden, S P; Marshall, Z; Marti-Garcia, S; Martin, B; Martin, T A; Martin, V J; Latour, B Martin Dit; Martinez, M; Outschoorn, V I Martinez; Martin-Haugh, S; Martoiu, V S; Martyniuk, A C; Marx, M; Marzin, A; Masetti, L; Mashimo, T; Mashinistov, R; Masik, J; Maslennikov, A L; Massa, I; Massa, L; Mastrandrea, P; Mastroberardino, A; Masubuchi, T; Mättig, P; Mattmann, J; Maurer, J; Maxfield, S J; Maximov, D A; Mazini, R; Mazza, S M; Fadden, N C Mc; Goldrick, G Mc; Kee, S P Mc; McCarn, A; McCarthy, R L; McCarthy, T G; McClymont, L I; McDonald, E F; Mcfayden, J A; Mchedlidze, G; McMahon, S J; McPherson, R A; Medinnis, M; Meehan, S; Mehlhase, S; Mehta, A; Meier, K; Meineck, C; Meirose, B; Melini, D; Garcia, B R Mellado; Melo, M; Meloni, F; Mengarelli, A; Menke, S; Meoni, E; Mergelmeyer, S; Mermod, P; Merola, L; Meroni, C; Merritt, F S; Messina, A; Metcalfe, J; Mete, A S; Meyer, C; Meyer, C; Meyer, J-P; Meyer, J; Theenhausen, H Meyer Zu; Miano, F; Middleton, R P; Miglioranzi, S; Mijović, L; Mikenberg, G; Mikestikova, M; Mikuž, M; Milesi, M; Milic, A; Miller, D W; Mills, C; Milov, A; Milstead, D A; Minaenko, A A; Minami, Y; Minashvili, I A; Mincer, A I; Mindur, B; Mineev, M; Ming, Y; Mir, L M; Mistry, K P; Mitani, T; Mitrevski, J; Mitsou, V A; Miucci, A; Miyagawa, P S; Mjörnmark, J U; Moa, T; Mochizuki, K; Mohapatra, S; Molander, S; Moles-Valls, R; Monden, R; Mondragon, M C; Mönig, K; Monk, J; Monnier, E; Montalbano, A; Berlingen, J Montejo; Monticelli, F; Monzani, S; Moore, R W; Morange, N; Moreno, D; Llácer, M Moreno; Morettini, P; Morgenstern, S; Mori, D; Mori, T; Morii, M; Morinaga, M; Morisbak, V; Moritz, S; Morley, A K; Mornacchi, G; Morris, J D; Morvaj, L; Mosidze, M; Moss, J; Motohashi, K; Mount, R; Mountricha, E; Mouraviev, S V; Moyse, E J W; Muanza, S; Mudd, R D; Mueller, F; Mueller, J; Mueller, R S P; Mueller, T; Muenstermann, D; Mullen, P; Mullier, G A; Sanchez, F J Munoz; Quijada, J A Murillo; Murray, W J; Musheghyan, H; Muškinja, M; Myagkov, A G; Myska, M; Nachman, B P; Nackenhorst, O; Nagai, K; Nagai, R; Nagano, K; Nagasaka, Y; Nagata, K; Nagel, M; Nagy, E; Nairz, A M; Nakahama, Y; Nakamura, K; Nakamura, T; Nakano, I; Namasivayam, H; Garcia, R F Naranjo; Narayan, R; Villar, D I Narrias; Naryshkin, I; Naumann, T; Navarro, G; Nayyar, R; Neal, H A; Nechaeva, P Yu; Neep, T J; Nef, P D; Negri, A; Negrini, M; Nektarijevic, S; Nellist, C; Nelson, A; Nemecek, S; Nemethy, P; Nepomuceno, A A; Nessi, M; Neubauer, M S; Neumann, M; Neves, R M; Nevski, P; Newman, P R; Nguyen, D H; Manh, T Nguyen; Nickerson, R B; Nicolaidou, R; Nielsen, J; Nikiforov, A; Nikolaenko, V; Nikolic-Audit, I; Nikolopoulos, K; Nilsen, J K; Nilsson, P; Ninomiya, Y; Nisati, A; Nisius, R; Nobe, T; Nomachi, M; Nomidis, I; Nooney, T; Norberg, S; Nordberg, M; Norjoharuddeen, N; Novgorodova, O; Nowak, S; Nozaki, M; Nozka, L; Ntekas, K; Nurse, E; Nuti, F; O'grady, F; O'Neil, D C; O'Rourke, A A; O'Shea, V; Oakham, F G; Oberlack, H; Obermann, T; Ocariz, J; Ochi, A; Ochoa, I; Ochoa-Ricoux, J P; Oda, S; Odaka, S; Ogren, H; Oh, A; Oh, S H; Ohm, C C; Ohman, H; Oide, H; Okawa, H; Okumura, Y; Okuyama, T; Olariu, A; Seabra, L F Oleiro; Pino, S A Olivares; Damazio, D Oliveira; Olszewski, A; Olszowska, J; Onofre, A; Onogi, K; Onyisi, P U E; Oreglia, M J; Oren, Y; Orestano, D; Orlando, N; Orr, R S; Osculati, B; Ospanov, R; Garzon, G Otero Y; Otono, H; Ouchrif, M; Ould-Saada, F; Ouraou, A; Oussoren, K P; Ouyang, Q; Owen, M; Owen, R E; Ozcan, V E; Ozturk, N; Pachal, K; Pages, A Pacheco; Rodriguez, L Pacheco; Aranda, C Padilla; Griso, S Pagan; Paige, F; Pais, P; Pajchel, K; Palacino, G; Palazzo, S; Palestini, S; Palka, M; Pallin, D; Palma, A; Panagiotopoulou, E St; Pandini, C E; Vazquez, J G Panduro; Pani, P; Panitkin, S; Pantea, D; Paolozzi, L; Papadopoulou, Th D; Papageorgiou, K; Paramonov, A; Hernandez, D Paredes; Parker, A J; Parker, M A; Parker, K A; Parodi, F; Parsons, J A; Parzefall, U; Pascuzzi, V R; Pasqualucci, E; Passaggio, S; Pastore, Fr; Pásztor, G; Pataraia, S; Pater, J R; Pauly, T; Pearce, J; Pearson, B; Pedersen, L E; Lopez, S Pedraza; Pedro, R; Peleganchuk, S V; Pelikan, D; Penc, O; Peng, C; Peng, H; Penwell, J; Peralva, B S; Perego, M M; Perepelitsa, D V; Codina, E Perez; Perini, L; Pernegger, H; Perrella, S; Peschke, R; Peshekhonov, V D; Peters, K; Peters, R F Y; Petersen, B A; Petersen, T C; Petit, E; Petridis, A; Petridou, C; Petroff, P; Petrolo, E; Petrov, M; Petrucci, F; Pettersson, N E; Peyaud, A; Pezoa, R; Phillips, P W; Piacquadio, G; Pianori, E; Picazio, A; Piccaro, E; Piccinini, M; Pickering, M A; Piegaia, R; Pilcher, J E; Pilkington, A D; Pin, A W J; Pinamonti, M; Pinfold, J L; Pingel, A; Pires, S; Pirumov, H; Pitt, M; Plazak, L; Pleier, M-A; Pleskot, V; Plotnikova, E; Plucinski, P; Pluth, D; Poettgen, R; Poggioli, L; Pohl, D; Polesello, G; Poley, A; Policicchio, A; Polifka, R; Polini, A; Pollard, C S; Polychronakos, V; Pommès, K; Pontecorvo, L; Pope, B G; Popeneciu, G A; Popovic, D S; Poppleton, A; Pospisil, S; Potamianos, K; Potrap, I N; Potter, C J; Potter, C T; Poulard, G; Poveda, J; Pozdnyakov, V; Astigarraga, M E Pozo; Pralavorio, P; Pranko, A; Prell, S; Price, D; Price, L E; Primavera, M; Prince, S; Proissl, M; Prokofiev, K; Prokoshin, F; Protopopescu, S; Proudfoot, J; Przybycien, M; Puddu, D; Purohit, M; Puzo, P; Qian, J; Qin, G; Qin, Y; Quadt, A; Quayle, W B; Queitsch-Maitland, M; Quilty, D; Raddum, S; Radeka, V; Radescu, V; Radhakrishnan, S K; Radloff, P; Rados, P; Ragusa, F; Rahal, G; Raine, J A; Rajagopalan, S; Rammensee, M; Rangel-Smith, C; Ratti, M G; Rauscher, F; Rave, S; Ravenscroft, T; Ravinovich, I; Raymond, M; Read, A L; Readioff, N P; Reale, M; Rebuzzi, D M; Redelbach, A; Redlinger, G; Reece, R; Reeves, K; Rehnisch, L; Reichert, J; Reisin, H; Rembser, C; Ren, H; Rescigno, M; Resconi, S; Rezanova, O L; Reznicek, P; Rezvani, R; Richter, R; Richter, S; Richter-Was, E; Ricken, O; Ridel, M; Rieck, P; Riegel, C J; Rieger, J; Rifki, O; Rijssenbeek, M; Rimoldi, A; Rimoldi, M; Rinaldi, L; Ristić, B; Ritsch, E; Riu, I; Rizatdinova, F; Rizvi, E; Rizzi, C; Robertson, S H; Robichaud-Veronneau, A; Robinson, D; Robinson, J E M; Robson, A; Roda, C; Rodina, Y; Perez, A Rodriguez; Rodriguez, D Rodriguez; Roe, S; Rogan, C S; Røhne, O; Romaniouk, A; Romano, M; Saez, S M Romano; Adam, E Romero; Rompotis, N; Ronzani, M; Roos, L; Ros, E; Rosati, S; Rosbach, K; Rose, P; Rosenthal, O; Rosien, N-A; Rossetti, V; Rossi, E; Rossi, L P; Rosten, J H N; Rosten, R; Rotaru, M; Roth, I; Rothberg, J; Rousseau, D; Royon, C R; Rozanov, A; Rozen, Y; Ruan, X; Rubbo, F; Rudolph, M S; Rühr, F; Ruiz-Martinez, A; Rurikova, Z; Rusakovich, N A; Ruschke, A; Russell, H L; Rutherfoord, J P; Ruthmann, N; Ryabov, Y F; Rybar, M; Rybkin, G; Ryu, S; Ryzhov, A; Rzehorz, G F; Saavedra, A F; Sabato, G; Sacerdoti, S; Sadrozinski, H F-W; Sadykov, R; Tehrani, F Safai; Saha, P; Sahinsoy, M; Saimpert, M; Saito, T; Sakamoto, H; Sakurai, Y; Salamanna, G; Salamon, A; Loyola, J E Salazar; Salek, D; De Bruin, P H Sales; Salihagic, D; Salnikov, A; Salt, J; Salvatore, D; Salvatore, F; Salvucci, A; Salzburger, A; Sammel, D; Sampsonidis, D; Sánchez, J; Martinez, V Sanchez; Pineda, A Sanchez; Sandaker, H; Sandbach, R L; Sander, H G; Sandhoff, M; Sandoval, C; Sandstroem, R; Sankey, D P C; Sannino, M; Sansoni, A; Santoni, C; Santonico, R; Santos, H; Castillo, I Santoyo; Sapp, K; Sapronov, A; Saraiva, J G; Sarrazin, B; Sasaki, O; Sasaki, Y; Sato, K; Sauvage, G; Sauvan, E; Savage, G; Savard, P; Sawyer, C; Sawyer, L; Saxon, J; Sbarra, C; Sbrizzi, A; Scanlon, T; Scannicchio, D A; Scarcella, M; Scarfone, V; Schaarschmidt, J; Schacht, P; Schachtner, B M; Schaefer, D; Schaefer, R; Schaeffer, J; Schaepe, S; Schaetzel, S; Schäfer, U; Schaffer, A C; Schaile, D; Schamberger, R D; Scharf, V; Schegelsky, V A; Scheirich, D; Schernau, M; Schiavi, C; Schier, S; Schillo, C; Schioppa, M; Schlenker, S; Schmidt-Sommerfeld, K R; Schmieden, K; Schmitt, C; Schmitt, S; Schmitz, S; Schneider, B; Schnoor, U; Schoeffel, L; Schoening, A; Schoenrock, B D; Schopf, E; Schott, M; Schovancova, J; Schramm, S; Schreyer, M; Schuh, N; Schulte, A; Schultens, M J; Schultz-Coulon, H-C; Schulz, H; Schumacher, M; Schumm, B A; Schune, Ph; Schwartzman, A; Schwarz, T A; Schwegler, Ph; Schweiger, H; Schwemling, Ph; Schwienhorst, R; Schwindling, J; Schwindt, T; Sciolla, G; Scuri, F; Scutti, F; Searcy, J; Seema, P; Seidel, S C; Seiden, A; Seifert, F; Seixas, J M; Sekhniaidze, G; Sekhon, K; Sekula, S J; Seliverstov, D M; Semprini-Cesari, N; Serfon, C; Serin, L; Serkin, L; Sessa, M; Seuster, R; Severini, H; Sfiligoj, T; Sforza, F; Sfyrla, A; Shabalina, E; Shaikh, N W; Shan, L Y; Shang, R; Shank, J T; Shapiro, M; Shatalov, P B; Shaw, K; Shaw, S M; Shcherbakova, A; Shehu, C Y; Sherwood, P; Shi, L; Shimizu, S; Shimmin, C O; Shimojima, M; Shiyakova, M; Shmeleva, A; Saadi, D Shoaleh; Shochet, M J; Shojaii, S; Shrestha, S; Shulga, E; Shupe, M A; Sicho, P; Sickles, A M; Sidebo, P E; Sidiropoulou, O; Sidorov, D; Sidoti, A; Siegert, F; Sijacki, Dj; Silva, J; Silverstein, S B; Simak, V; Simard, O; Simic, Lj; Simion, S; Simioni, E; Simmons, B; Simon, D; Simon, M; Sinervo, P; Sinev, N B; Sioli, M; Siragusa, G; Sivoklokov, S Yu; Sjölin, J; Skinner, M B; Skottowe, H P; Skubic, P; Slater, M; Slavicek, T; Slawinska, M; Sliwa, K; Slovak, R; Smakhtin, V; Smart, B H; Smestad, L; Smiesko, J; Smirnov, S Yu; Smirnov, Y; Smirnova, L N; Smirnova, O; Smith, M N K; Smith, R W; Smizanska, M; Smolek, K; Snesarev, A A; Snyder, S; Sobie, R; Socher, F; Soffer, A; Soh, D A; Sokhrannyi, G; Sanchez, C A Solans; Solar, M; Soldatov, E Yu; Soldevila, U; Solodkov, A A; Soloshenko, A; Solovyanov, O V; Solovyev, V; Sommer, P; Son, H; Song, H Y; Sood, A; Sopczak, A; Sopko, V; Sorin, V; Sosa, D; Sotiropoulou, C L; Soualah, R; Soukharev, A M; South, D; Sowden, B C; Spagnolo, S; Spalla, M; Spangenberg, M; Spanò, F; Sperlich, D; Spettel, F; Spighi, R; Spigo, G; Spiller, L A; Spousta, M; Denis, R D St; Stabile, A; Stamen, R; Stamm, S; Stanecka, E; Stanek, R W; Stanescu, C; Stanescu-Bellu, M; Stanitzki, M M; Stapnes, S; Starchenko, E A; Stark, G H; Stark, J; Stark, S H; Staroba, P; Starovoitov, P; Stärz, S; Staszewski, R; Steinberg, P; Stelzer, B; Stelzer, H J; Stelzer-Chilton, O; Stenzel, H; Stewart, G A; Stillings, J A; Stockton, M C; Stoebe, M; Stoicea, G; Stolte, P; Stonjek, S; Stradling, A R; Straessner, A; Stramaglia, M E; Strandberg, J; Strandberg, S; Strandlie, A; Strauss, M; Strizenec, P; Ströhmer, R; Strom, D M; Stroynowski, R; Strubig, A; Stucci, S A; Stugu, B; Styles, N A; Su, D; Su, J; Suchek, S; Sugaya, Y; Suk, M; Sulin, V V; Sultansoy, S; Sumida, T; Sun, S; Sun, X; Sundermann, J E; Suruliz, K; Susinno, G; Sutton, M R; Suzuki, S; Svatos, M; Swiatlowski, M; Sykora, I; Sykora, T; Ta, D; Taccini, C; Tackmann, K; Taenzer, J; Taffard, A; Tafirout, R; Taiblum, N; Takai, H; Takashima, R; Takeshita, T; Takubo, Y; Talby, M; Talyshev, A A; Tan, K G; Tanaka, J; Tanaka, R; Tanaka, S; Tannenwald, B B; Araya, S Tapia; Tapprogge, S; Tarem, S; Tartarelli, G F; Tas, P; Tasevsky, M; Tashiro, T; Tassi, E; Delgado, A Tavares; Tayalati, Y; Taylor, A C; Taylor, G N; Taylor, P T E; Taylor, W; Teischinger, F A; Teixeira-Dias, P; Temple, D; Kate, H Ten; Teng, P K; Teoh, J J; Tepel, F; Terada, S; Terashi, K; Terron, J; Terzo, S; Testa, M; Teuscher, R J; Theveneaux-Pelzer, T; Thomas, J P; Thomas-Wilsker, J; Thompson, E N; Thompson, P D; Thompson, A S; Thomsen, L A; Thomson, E; Thomson, M; Tibbetts, M J; Torres, R E Ticse; Tikhomirov, V O; Tikhonov, Yu A; Timoshenko, S; Tipton, P; Tisserant, S; Todome, K; Todorov, T; Todorova-Nova, S; Tojo, J; Tokár, S; Tokushuku, K; Tolley, E; Tomlinson, L; Tomoto, M; Tompkins, L; Toms, K; Tong, B; Torrence, E; Torres, H; Pastor, E Torró; Toth, J; Touchard, F; Tovey, D R; Trefzger, T; Tricoli, A; Trigger, I M; Trincaz-Duvoid, S; Tripiana, M F; Trischuk, W; Trocmé, B; Trofymov, A; Troncon, C; Trottier-McDonald, M; Trovatelli, M; Truong, L; Trzebinski, M; Trzupek, A; Tseng, J C-L; Tsiareshka, P V; Tsipolitis, G; Tsirintanis, N; Tsiskaridze, S; Tsiskaridze, V; Tskhadadze, E G; Tsui, K M; Tsukerman, I I; Tsulaia, V; Tsuno, S; Tsybychev, D; Tudorache, A; Tudorache, V; Tuna, A N; Tupputi, S A; Turchikhin, S; Turecek, D; Turgeman, D; Turra, R; Turvey, A J; Tuts, P M; Tyndel, M; Ucchielli, G; Ueda, I; Ughetto, M; Ukegawa, F; Unal, G; Undrus, A; Unel, G; Ungaro, F C; Unno, Y; Unverdorben, C; Urban, J; Urquijo, P; Urrejola, P; Usai, G; Usanova, A; Vacavant, L; Vacek, V; Vachon, B; Valderanis, C; Santurio, E Valdes; Valencic, N; Valentinetti, S; Valero, A; Valéry, L; Valkar, S; Vallecorsa, S; Ferrer, J A Valls; Van Den Wollenberg, W; Van Der Deijl, P C; van der Geer, R; van der Graaf, H; van Eldik, N; van Gemmeren, P; Van Nieuwkoop, J; van Vulpen, I; van Woerden, M C; Vanadia, M; Vandelli, W; Vanguri, R; Vaniachine, A; Vankov, P; Vardanyan, G; Vari, R; Varnes, E W; Varol, T; Varouchas, D; Vartapetian, A; Varvell, K E; Vasquez, J G; Vazeille, F; Schroeder, T Vazquez; Veatch, J; Veloce, L M; Veloso, F; Veneziano, S; Ventura, A; Venturi, M; Venturi, N; Venturini, A; Vercesi, V; Verducci, M; Verkerke, W; Vermeulen, J C; Vest, A; Vetterli, M C; Viazlo, O; Vichou, I; Vickey, T; Boeriu, O E Vickey; Viehhauser, G H A; Viel, S; Vigani, L; Vigne, R; Villa, M; Perez, M Villaplana; Vilucchi, E; Vincter, M G; Vinogradov, V B; Vittori, C; Vivarelli, I; Vlachos, S; Vlasak, M; Vogel, M; Vokac, P; Volpi, G; Volpi, M; von der Schmitt, H; von Toerne, E; Vorobel, V; Vorobev, K; Vos, M; Voss, R; Vossebeld, J H; Vranjes, N; Milosavljevic, M Vranjes; Vrba, V; Vreeswijk, M; Vuillermet, R; Vukotic, I; Vykydal, Z; Wagner, P; Wagner, W; Wahlberg, H; Wahrmund, S; Wakabayashi, J; Walder, J; Walker, R; Walkowiak, W; Wallangen, V; Wang, C; Wang, C; Wang, F; Wang, H; Wang, H; Wang, J; Wang, J; Wang, K; Wang, R; Wang, S M; Wang, T; Wang, T; Wang, W; Wang, X; Wanotayaroj, C; Warburton, A; Ward, C P; Wardrope, D R; Washbrook, A; Watkins, P M; Watson, A T; Watson, M F; Watts, G; Watts, S; Waugh, B M; Webb, S; Weber, M S; Weber, S W; Webster, J S; Weidberg, A R; Weinert, B; Weingarten, J; Weiser, C; Weits, H; Wells, P S; Wenaus, T; Wengler, T; Wenig, S; Wermes, N; Werner, M; Werner, M D; Werner, P; Wessels, M; Wetter, J; Whalen, K; Whallon, N L; Wharton, A M; White, A; White, M J; White, R; Whiteson, D; Wickens, F J; Wiedenmann, W; Wielers, M; Wienemann, P; Wiglesworth, C; Wiik-Fuchs, L A M; Wildauer, A; Wilk, F; Wilkens, H G; Williams, H H; Williams, S; Willis, C; Willocq, S; Wilson, J A; Wingerter-Seez, I; Winklmeier, F; Winston, O J; Winter, B T; Wittgen, M; Wittkowski, J; Wolter, M W; Wolters, H; Worm, S D; Wosiek, B K; Wotschack, J; Woudstra, M J; Wozniak, K W; Wu, M; Wu, M; Wu, S L; Wu, X; Wu, Y; Wyatt, T R; Wynne, B M; Xella, S; Xu, D; Xu, L; Yabsley, B; Yacoob, S; Yakabe, R; Yamaguchi, D; Yamaguchi, Y; Yamamoto, A; Yamamoto, S; Yamanaka, T; Yamauchi, K; Yamazaki, Y; Yan, Z; Yang, H; Yang, H; Yang, Y; Yang, Z; Yao, W-M; Yap, Y C; Yasu, Y; Yatsenko, E; Wong, K H Yau; Ye, J; Ye, S; Yeletskikh, I; Yen, A L; Yildirim, E; Yorita, K; Yoshida, R; Yoshihara, K; Young, C; Young, C J S; Youssef, S; Yu, D R; Yu, J; Yu, J M; Yu, J; Yuan, L; Yuen, S P Y; Yusuff, I; Zabinski, B; Zaidan, R; Zaitsev, A M; Zakharchuk, N; Zalieckas, J; Zaman, A; Zambito, S; Zanello, L; Zanzi, D; Zeitnitz, C; Zeman, M; Zemla, A; Zeng, J C; Zeng, Q; Zengel, K; Zenin, O; Ženiš, T; Zerwas, D; Zhang, D; Zhang, F; Zhang, G; Zhang, H; Zhang, J; Zhang, L; Zhang, R; Zhang, R; Zhang, X; Zhang, Z; Zhao, X; Zhao, Y; Zhao, Z; Zhemchugov, A; Zhong, J; Zhou, B; Zhou, C; Zhou, L; Zhou, L; Zhou, M; Zhou, N; Zhu, C G; Zhu, H; Zhu, J; Zhu, Y; Zhuang, X; Zhukov, K; Zibell, A; Zieminska, D; Zimine, N I; Zimmermann, C; Zimmermann, S; Zinonos, Z; Zinser, M; Ziolkowski, M; Živković, L; Zobernig, G; Zoccoli, A; Nedden, M Zur; Zwalinski, L

2017-01-01

This paper presents the method and performance of primary vertex reconstruction in proton-proton collision data recorded by the ATLAS experiment during Run 1 of the LHC. The studies presented focus on data taken during 2012 at a centre-of-mass energy of [Formula: see text] TeV. The performance has been measured as a function of the number of interactions per bunch crossing over a wide range, from one to seventy. The measurement of the position and size of the luminous region and its use as a constraint to improve the primary vertex resolution are discussed. A longitudinal vertex position resolution of about [Formula: see text] is achieved for events with high multiplicity of reconstructed tracks. The transverse position resolution is better than [Formula: see text] and is dominated by the precision on the size of the luminous region. An analytical model is proposed to describe the primary vertex reconstruction efficiency as a function of the number of interactions per bunch crossing and of the longitudinal size of the luminous region. Agreement between the data and the predictions of this model is better than 3% up to seventy interactions per bunch crossing.

Reconstruction of primary vertices at the ATLAS experiment in Run 1 proton-proton collisions at the LHC

NASA Astrophysics Data System (ADS)

Aaboud, M.; Aad, G.; Abbott, B.; Abdallah, J.; Abdinov, O.; Abeloos, B.; Aben, R.; AbouZeid, O. S.; Abraham, N. L.; Abramowicz, H.; Abreu, H.; Abreu, R.; Abulaiti, Y.; Acharya, B. S.; Adamczyk, L.; Adams, D. L.; Adelman, J.; Adomeit, S.; Adye, T.; Affolder, A. A.; Agatonovic-Jovin, T.; Agricola, J.; Aguilar-Saavedra, J. A.; Ahlen, S. P.; Ahmadov, F.; Aielli, G.; Akerstedt, H.; Åkesson, T. P. A.; Akimov, A. V.; Alberghi, G. L.; Albert, J.; Albrand, S.; Verzini, M. J. Alconada; Aleksa, M.; Aleksandrov, I. N.; Alexa, C.; Alexander, G.; Alexopoulos, T.; Alhroob, M.; Ali, B.; Aliev, M.; Alimonti, G.; Alison, J.; Alkire, S. P.; Allbrooke, B. M. M.; Allen, B. W.; Allport, P. P.; Aloisio, A.; Alonso, A.; Alonso, F.; Alpigiani, C.; Alstaty, M.; Gonzalez, B. Alvarez; Piqueras, D. Álvarez; Alviggi, M. G.; Amadio, B. T.; Amako, K.; Coutinho, Y. Amaral; Amelung, C.; Amidei, D.; Santos, S. P. Amor Dos; Amorim, A.; Amoroso, S.; Amundsen, G.; Anastopoulos, C.; Ancu, L. S.; Andari, N.; Andeen, T.; Anders, C. F.; Anders, G.; Anders, J. K.; Anderson, K. J.; Andreazza, A.; Andrei, V.; Angelidakis, S.; Angelozzi, I.; Anger, P.; Angerami, A.; Anghinolfi, F.; Anisenkov, A. V.; Anjos, N.; Annovi, A.; Antel, C.; Antonelli, M.; Antonov, A.; Anulli, F.; Aoki, M.; Bella, L. Aperio; Arabidze, G.; Arai, Y.; Araque, J. P.; Arce, A. T. H.; Arduh, F. A.; Arguin, J.-F.; Argyropoulos, S.; Arik, M.; Armbruster, A. J.; Armitage, L. J.; Arnaez, O.; Arnold, H.; Arratia, M.; Arslan, O.; Artamonov, A.; Artoni, G.; Artz, S.; Asai, S.; Asbah, N.; Ashkenazi, A.; Åsman, B.; Asquith, L.; Assamagan, K.; Astalos, R.; Atkinson, M.; Atlay, N. B.; Augsten, K.; Avolio, G.; Axen, B.; Ayoub, M. K.; Azuelos, G.; Baak, M. A.; Baas, A. E.; Baca, M. J.; Bachacou, H.; Bachas, K.; Backes, M.; Backhaus, M.; Bagiacchi, P.; Bagnaia, P.; Bai, Y.; Baines, J. T.; Baker, O. K.; Baldin, E. M.; Balek, P.; Balestri, T.; Balli, F.; Balunas, W. K.; Banas, E.; Banerjee, Sw.; Bannoura, A. A. E.; Barak, L.; Barberio, E. L.; Barberis, D.; Barbero, M.; Barillari, T.; Barisits, M.-S.; Barklow, T.; Barlow, N.; Barnes, S. L.; Barnett, B. M.; Barnett, R. M.; Barnovska-Blenessy, Z.; Baroncelli, A.; Barone, G.; Barr, A. J.; Navarro, L. Barranco; Barreiro, F.; da Costa, J. Barreiro Guimarães; Bartoldus, R.; Barton, A. E.; Bartos, P.; Basalaev, A.; Bassalat, A.; Bates, R. L.; Batista, S. J.; Batley, J. R.; Battaglia, M.; Bauce, M.; Bauer, F.; Bawa, H. S.; Beacham, J. B.; Beattie, M. D.; Beau, T.; Beauchemin, P. H.; Bechtle, P.; Beck, H. P.; Becker, K.; Becker, M.; Beckingham, M.; Becot, C.; Beddall, A. J.; Beddall, A.; Bednyakov, V. A.; Bedognetti, M.; Bee, C. P.; Beemster, L. J.; Beermann, T. A.; Begel, M.; Behr, J. K.; Belanger-Champagne, C.; Bell, A. S.; Bella, G.; Bellagamba, L.; Bellerive, A.; Bellomo, M.; Belotskiy, K.; Beltramello, O.; Belyaev, N. L.; Benary, O.; Benchekroun, D.; Bender, M.; Bendtz, K.; Benekos, N.; Benhammou, Y.; Noccioli, E. Benhar; Benitez, J.; Benjamin, D. P.; Bensinger, J. R.; Bentvelsen, S.; Beresford, L.; Beretta, M.; Berge, D.; Kuutmann, E. Bergeaas; Berger, N.; Beringer, J.; Berlendis, S.; Bernard, N. R.; Bernius, C.; Bernlochner, F. U.; Berry, T.; Berta, P.; Bertella, C.; Bertoli, G.; Bertolucci, F.; Bertram, I. A.; Bertsche, C.; Bertsche, D.; Besjes, G. J.; Bylund, O. Bessidskaia; Bessner, M.; Besson, N.; Betancourt, C.; Bethke, S.; Bevan, A. J.; Bhimji, W.; Bianchi, R. M.; Bianchini, L.; Bianco, M.; Biebel, O.; Biedermann, D.; Bielski, R.; Biesuz, N. V.; Biglietti, M.; De Mendizabal, J. Bilbao; Bilokon, H.; Bindi, M.; Binet, S.; Bingul, A.; Bini, C.; Biondi, S.; Bjergaard, D. M.; Black, C. W.; Black, J. E.; Black, K. M.; Blackburn, D.; Blair, R. E.; Blanchard, J.-B.; Blanco, J. E.; Blazek, T.; Bloch, I.; Blocker, C.; Blum, W.; Blumenschein, U.; Blunier, S.; Bobbink, G. J.; Bobrovnikov, V. S.; Bocchetta, S. S.; Bocci, A.; Bock, C.; Boehler, M.; Boerner, D.; Bogaerts, J. A.; Bogavac, D.; Bogdanchikov, A. G.; Bohm, C.; Boisvert, V.; Bokan, P.; Bold, T.; Boldyrev, A. S.; Bomben, M.; Bona, M.; Boonekamp, M.; Borisov, A.; Borissov, G.; Bortfeldt, J.; Bortoletto, D.; Bortolotto, V.; Boscherini, D.; Bosman, M.; Sola, J. D. Bossio; Boudreau, J.; Bouffard, J.; Bouhova-Thacker, E. V.; Boumediene, D.; Bourdarios, C.; Boutle, S. K.; Boveia, A.; Boyd, J.; Boyko, I. R.; Bracinik, J.; Brandt, A.; Brandt, G.; Brandt, O.; Bratzler, U.; Brau, B.; Brau, J. E.; Braun, H. M.; Madden, W. D. Breaden; Brendlinger, K.; Brennan, A. J.; Brenner, L.; Brenner, R.; Bressler, S.; Bristow, T. M.; Britton, D.; Britzger, D.; Brochu, F. M.; Brock, I.; Brock, R.; Brooijmans, G.; Brooks, T.; Brooks, W. K.; Brosamer, J.; Brost, E.; Broughton, J. H.; de Renstrom, P. A. Bruckman; Bruncko, D.; Bruneliere, R.; Bruni, A.; Bruni, G.; Bruni, L. S.; Brunt, BH; Bruschi, M.; Bruscino, N.; Bryant, P.; Bryngemark, L.; Buanes, T.; Buat, Q.; Buchholz, P.; Buckley, A. G.; Budagov, I. A.; Buehrer, F.; Bugge, M. K.; Bulekov, O.; Bullock, D.; Burckhart, H.; Burdin, S.; Burgard, C. D.; Burghgrave, B.; Burka, K.; Burke, S.; Burmeister, I.; Burr, J. T. P.; Busato, E.; Büscher, D.; Büscher, V.; Bussey, P.; Butler, J. M.; Buttar, C. M.; Butterworth, J. M.; Butti, P.; Buttinger, W.; Buzatu, A.; Buzykaev, A. R.; Urbán, S. Cabrera; Caforio, D.; Cairo, V. M.; Cakir, O.; Calace, N.; Calafiura, P.; Calandri, A.; Calderini, G.; Calfayan, P.; Callea, G.; Caloba, L. P.; Lopez, S. Calvente; Calvet, D.; Calvet, S.; Calvet, T. P.; Toro, R. Camacho; Camarda, S.; Camarri, P.; Cameron, D.; Armadans, R. Caminal; Camincher, C.; Campana, S.; Campanelli, M.; Camplani, A.; Campoverde, A.; Canale, V.; Canepa, A.; Bret, M. Cano; Cantero, J.; Cantrill, R.; Cao, T.; Garrido, M. D. M. Capeans; Caprini, I.; Caprini, M.; Capua, M.; Caputo, R.; Carbone, R. M.; Cardarelli, R.; Cardillo, F.; Carli, I.; Carli, T.; Carlino, G.; Carminati, L.; Caron, S.; Carquin, E.; Carrillo-Montoya, G. D.; Carter, J. R.; Carvalho, J.; Casadei, D.; Casado, M. P.; Casolino, M.; Casper, D. W.; Castaneda-Miranda, E.; Castelijn, R.; Castelli, A.; Gimenez, V. Castillo; Castro, N. F.; Catinaccio, A.; Catmore, J. R.; Cattai, A.; Caudron, J.; Cavaliere, V.; Cavallaro, E.; Cavalli, D.; Cavalli-Sforza, M.; Cavasinni, V.; Ceradini, F.; Alberich, L. Cerda; Cerio, B. C.; Cerqueira, A. S.; Cerri, A.; Cerrito, L.; Cerutti, F.; Cerv, M.; Cervelli, A.; Cetin, S. A.; Chafaq, A.; Chakraborty, D.; Chan, S. K.; Chan, Y. L.; Chang, P.; Chapman, J. D.; Charlton, D. G.; Chatterjee, A.; Chau, C. C.; Barajas, C. A. Chavez; Che, S.; Cheatham, S.; Chegwidden, A.; Chekanov, S.; Chekulaev, S. V.; Chelkov, G. A.; Chelstowska, M. A.; Chen, C.; Chen, H.; Chen, K.; Chen, S.; Chen, S.; Chen, X.; Chen, Y.; Cheng, H. C.; Cheng, H. J.; Cheng, Y.; Cheplakov, A.; Cheremushkina, E.; Moursli, R. Cherkaoui El; Chernyatin, V.; Cheu, E.; Chevalier, L.; Chiarella, V.; Chiarelli, G.; Chiodini, G.; Chisholm, A. S.; Chitan, A.; Chizhov, M. V.; Choi, K.; Chomont, A. R.; Chouridou, S.; Chow, B. K. B.; Christodoulou, V.; Chromek-Burckhart, D.; Chudoba, J.; Chuinard, A. J.; Chwastowski, J. J.; Chytka, L.; Ciapetti, G.; Ciftci, A. K.; Cinca, D.; Cindro, V.; Cioara, I. A.; Ciocca, C.; Ciocio, A.; Cirotto, F.; Citron, Z. H.; Citterio, M.; Ciubancan, M.; Clark, A.; Clark, B. L.; Clark, M. R.; Clark, P. J.; Clarke, R. N.; Clement, C.; Coadou, Y.; Cobal, M.; Coccaro, A.; Cochran, J.; Coffey, L.; Colasurdo, L.; Cole, B.; Colijn, A. P.; Collot, J.; Colombo, T.; Compostella, G.; Muiño, P. Conde; Coniavitis, E.; Connell, S. H.; Connelly, I. A.; Consorti, V.; Constantinescu, S.; Conti, G.; Conventi, F.; Cooke, M.; Cooper, B. D.; Cooper-Sarkar, A. M.; Cormier, K. J. R.; Cornelissen, T.; Corradi, M.; Corriveau, F.; Corso-Radu, A.; Cortes-Gonzalez, A.; Cortiana, G.; Costa, G.; Costa, M. J.; Costanzo, D.; Cottin, G.; Cowan, G.; Cox, B. E.; Cranmer, K.; Crawley, S. J.; Cree, G.; Crépé-Renaudin, S.; Crescioli, F.; Cribbs, W. A.; Ortuzar, M. Crispin; Cristinziani, M.; Croft, V.; Crosetti, G.; Donszelmann, T. Cuhadar; Cummings, J.; Curatolo, M.; Cúth, J.; Cuthbert, C.; Czirr, H.; Czodrowski, P.; D'amen, G.; D'Auria, S.; D'Onofrio, M.; De Sousa, M. J. Da Cunha Sargedas; Via, C. Da; Dabrowski, W.; Dado, T.; Dai, T.; Dale, O.; Dallaire, F.; Dallapiccola, C.; Dam, M.; Dandoy, J. R.; Dang, N. P.; Daniells, A. C.; Dann, N. S.; Danninger, M.; Hoffmann, M. Dano; Dao, V.; Darbo, G.; Darmora, S.; Dassoulas, J.; Dattagupta, A.; Davey, W.; David, C.; Davidek, T.; Davies, M.; Davison, P.; Dawe, E.; Dawson, I.; Daya-Ishmukhametova, R. K.; De, K.; de Asmundis, R.; De Benedetti, A.; De Castro, S.; De Cecco, S.; De Groot, N.; de Jong, P.; De la Torre, H.; De Lorenzi, F.; De Maria, A.; De Pedis, D.; De Salvo, A.; De Sanctis, U.; De Santo, A.; De Regie, J. B. De Vivie; Dearnaley, W. J.; Debbe, R.; Debenedetti, C.; Dedovich, D. V.; Dehghanian, N.; Deigaard, I.; Del Gaudio, M.; Del Peso, J.; Del Prete, T.; Delgove, D.; Deliot, F.; Delitzsch, C. M.; Deliyergiyev, M.; Dell'Acqua, A.; Dell'Asta, L.; Dell'Orso, M.; Della Pietra, M.; della Volpe, D.; Delmastro, M.; Delsart, P. A.; DeMarco, D. A.; Demers, S.; Demichev, M.; Demilly, A.; Denisov, S. P.; Denysiuk, D.; Derendarz, D.; Derkaoui, J. E.; Derue, F.; Dervan, P.; Desch, K.; Deterre, C.; Dette, K.; Deviveiros, P. O.; Dewhurst, A.; Dhaliwal, S.; Di Ciaccio, A.; Di Ciaccio, L.; Di Clemente, W. K.; Di Donato, C.; Di Girolamo, A.; Di Girolamo, B.; Di Micco, B.; Di Nardo, R.; Di Simone, A.; Di Sipio, R.; Di Valentino, D.; Diaconu, C.; Diamond, M.; Dias, F. A.; Diaz, M. A.; Diehl, E. B.; Dietrich, J.; Diglio, S.; Dimitrievska, A.; Dingfelder, J.; Dita, P.; Dita, S.; Dittus, F.; Djama, F.; Djobava, T.; Djuvsland, J. I.; do Vale, M. A. B.; Dobos, D.; Dobre, M.; Doglioni, C.; Dohmae, T.; Dolejsi, J.; Dolezal, Z.; Dolgoshein, B. A.; Donadelli, M.; Donati, S.; Dondero, P.; Donini, J.; Dopke, J.; Doria, A.; Dova, M. T.; Doyle, A. T.; Drechsler, E.; Dris, M.; Du, Y.; Duarte-Campderros, J.; Duchovni, E.; Duckeck, G.; Ducu, O. A.; Duda, D.; Dudarev, A.; Duffield, E. M.; Duflot, L.; Duguid, L.; Dührssen, M.; Dumancic, M.; Dunford, M.; Yildiz, H. Duran; Düren, M.; Durglishvili, A.; Duschinger, D.; Dutta, B.; Dyndal, M.; Eckardt, C.; Ecker, K. M.; Edgar, R. C.; Edwards, N. C.; Eifert, T.; Eigen, G.; Einsweiler, K.; Ekelof, T.; Kacimi, M. El; Ellajosyula, V.; Ellert, M.; Elles, S.; Ellinghaus, F.; Elliot, A. A.; Ellis, N.; Elmsheuser, J.; Elsing, M.; Emeliyanov, D.; Enari, Y.; Endner, O. C.; Endo, M.; Ennis, J. S.; Erdmann, J.; Ereditato, A.; Ernis, G.; Ernst, J.; Ernst, M.; Errede, S.; Ertel, E.; Escalier, M.; Esch, H.; Escobar, C.; Esposito, B.; Etienvre, A. I.; Etzion, E.; Evans, H.; Ezhilov, A.; Fabbri, F.; Fabbri, L.; Facini, G.; Fakhrutdinov, R. M.; Falciano, S.; Falla, R. J.; Faltova, J.; Fang, Y.; Fanti, M.; Farbin, A.; Farilla, A.; Farina, C.; Farina, E. M.; Farooque, T.; Farrell, S.; Farrington, S. M.; Farthouat, P.; Fassi, F.; Fassnacht, P.; Fassouliotis, D.; Giannelli, M. Faucci; Favareto, A.; Fawcett, W. J.; Fayard, L.; Fedin, O. L.; Fedorko, W.; Feigl, S.; Feligioni, L.; Feng, C.; Feng, E. J.; Feng, H.; Fenyuk, A. B.; Feremenga, L.; Martinez, P. Fernandez; Perez, S. Fernandez; Ferrando, J.; Ferrari, A.; Ferrari, P.; Ferrari, R.; de Lima, D. E. Ferreira; Ferrer, A.; Ferrere, D.; Ferretti, C.; Parodi, A. Ferretto; Fiedler, F.; Filipčič, A.; Filipuzzi, M.; Filthaut, F.; Fincke-Keeler, M.; Finelli, K. D.; Fiolhais, M. C. N.; Fiorini, L.; Firan, A.; Fischer, A.; Fischer, C.; Fischer, J.; Fisher, W. C.; Flaschel, N.; Fleck, I.; Fleischmann, P.; Fletcher, G. T.; Fletcher, R. R. M.; Flick, T.; Floderus, A.; Castillo, L. R. Flores; Flowerdew, M. J.; Forcolin, G. T.; Formica, A.; Forti, A.; Foster, A. G.; Fournier, D.; Fox, H.; Fracchia, S.; Francavilla, P.; Franchini, M.; Francis, D.; Franconi, L.; Franklin, M.; Frate, M.; Fraternali, M.; Freeborn, D.; Fressard-Batraneanu, S. M.; Friedrich, F.; Froidevaux, D.; Frost, J. A.; Fukunaga, C.; Fusayasu, T.; Fuster, J.; Gabaldon, C.; Gabizon, O.; Gabrielli, A.; Gabrielli, A.; Gach, G. P.; Gadatsch, S.; Gadomski, S.; Gagliardi, G.; Gagnon, L. G.; Gagnon, P.; Galea, C.; Galhardo, B.; Gallas, E. J.; Gallop, B. J.; Gallus, P.; Galster, G.; Gan, K. K.; Gao, J.; Gao, Y.; Gao, Y. S.; Walls, F. M. Garay; García, C.; Navarro, J. E. García; Garcia-Sciveres, M.; Gardner, R. W.; Garelli, N.; Garonne, V.; Bravo, A. Gascon; Gatti, C.; Gaudiello, A.; Gaudio, G.; Gaur, B.; Gauthier, L.; Gavrilenko, I. L.; Gay, C.; Gaycken, G.; Gazis, E. N.; Gecse, Z.; Gee, C. N. P.; Geich-Gimbel, Ch.; Geisen, M.; Geisler, M. P.; Gemme, C.; Genest, M. H.; Geng, C.; Gentile, S.; Gentsos, C.; George, S.; Gerbaudo, D.; Gershon, A.; Ghasemi, S.; Ghazlane, H.; Ghneimat, M.; Giacobbe, B.; Giagu, S.; Giannetti, P.; Gibbard, B.; Gibson, S. M.; Gignac, M.; Gilchriese, M.; Gillam, T. P. S.; Gillberg, D.; Gilles, G.; Gingrich, D. M.; Giokaris, N.; Giordani, M. P.; Giorgi, F. M.; Giorgi, F. M.; Giraud, P. F.; Giromini, P.; Giugni, D.; Giuli, F.; Giuliani, C.; Giulini, M.; Gjelsten, B. K.; Gkaitatzis, S.; Gkialas, I.; Gkougkousis, E. L.; Gladilin, L. K.; Glasman, C.; Glatzer, J.; Glaysher, P. C. F.; Glazov, A.; Goblirsch-Kolb, M.; Godlewski, J.; Goldfarb, S.; Golling, T.; Golubkov, D.; Gomes, A.; Gonçalo, R.; Costa, J. Goncalves Pinto Firmino Da; Gonella, G.; Gonella, L.; Gongadze, A.; de la Hoz, S. González; Parra, G. Gonzalez; Gonzalez-Sevilla, S.; Goossens, L.; Gorbounov, P. A.; Gordon, H. A.; Gorelov, I.; Gorini, B.; Gorini, E.; Gorišek, A.; Gornicki, E.; Goshaw, A. T.; Gössling, C.; Gostkin, M. I.; Goudet, C. R.; Goujdami, D.; Goussiou, A. G.; Govender, N.; Gozani, E.; Graber, L.; Grabowska-Bold, I.; Gradin, P. O. J.; Grafström, P.; Gramling, J.; Gramstad, E.; Grancagnolo, S.; Gratchev, V.; Gravila, P. M.; Gray, H. M.; Graziani, E.; Greenwood, Z. D.; Grefe, C.; Gregersen, K.; Gregor, I. M.; Grenier, P.; Grevtsov, K.; Griffiths, J.; Grillo, A. A.; Grimm, K.; Grinstein, S.; Gris, Ph.; Grivaz, J.-F.; Groh, S.; Grohs, J. P.; Gross, E.; Grosse-Knetter, J.; Grossi, G. C.; Grout, Z. J.; Guan, L.; Guan, W.; Guenther, J.; Guescini, F.; Guest, D.; Gueta, O.; Guido, E.; Guillemin, T.; Guindon, S.; Gul, U.; Gumpert, C.; Guo, J.; Guo, Y.; Gupta, R.; Gupta, S.; Gustavino, G.; Gutierrez, P.; Ortiz, N. G. Gutierrez; Gutschow, C.; Guyot, C.; Gwenlan, C.; Gwilliam, C. B.; Haas, A.; Haber, C.; Hadavand, H. K.; Hadef, A.; Haefner, P.; Hageböck, S.; Hajduk, Z.; Hakobyan, H.; Haleem, M.; Haley, J.; Halladjian, G.; Hallewell, G. D.; Hamacher, K.; Hamal, P.; Hamano, K.; Hamilton, A.; Hamity, G. N.; Hamnett, P. G.; Han, L.; Hanagaki, K.; Hanawa, K.; Hance, M.; Haney, B.; Hanke, P.; Hanna, R.; Hansen, J. B.; Hansen, J. D.; Hansen, M. C.; Hansen, P. H.; Hara, K.; Hard, A. S.; Harenberg, T.; Hariri, F.; Harkusha, S.; Harrington, R. D.; Harrison, P. F.; Hartmann, N. M.; Hasegawa, M.; Hasegawa, Y.; Hasib, A.; Hassani, S.; Haug, S.; Hauser, R.; Hauswald, L.; Havranek, M.; Hawkes, C. M.; Hawkings, R. J.; Hayden, D.; Hays, C. P.; Hays, J. M.; Hayward, H. S.; Haywood, S. J.; Head, S. J.; Heck, T.; Hedberg, V.; Heelan, L.; Heidegger, K. K.; Heim, S.; Heim, T.; Heinemann, B.; Heinrich, J. J.; Heinrich, L.; Heinz, C.; Hejbal, J.; Helary, L.; Hellman, S.; Helsens, C.; Henderson, J.; Henderson, R. C. W.; Heng, Y.; Henkelmann, S.; Correia, A. M. Henriques; Henrot-Versille, S.; Herbert, G. H.; Jiménez, Y. Hernández; Herten, G.; Hertenberger, R.; Hervas, L.; Hesketh, G. G.; Hessey, N. P.; Hetherly, J. W.; Hickling, R.; Higón-Rodriguez, E.; Hill, E.; Hill, J. C.; Hiller, K. H.; Hillier, S. J.; Hinchliffe, I.; Hines, E.; Hinman, R. R.; Hirose, M.; Hirschbuehl, D.; Hobbs, J.; Hod, N.; Hodgkinson, M. C.; Hodgson, P.; Hoecker, A.; Hoeferkamp, M. R.; Hoenig, F.; Hohn, D.; Holmes, T. R.; Homann, M.; Hong, T. M.; Hooberman, B. H.; Hopkins, W. H.; Horii, Y.; Horton, A. J.; Hostachy, J.-Y.; Hou, S.; Hoummada, A.; Howarth, J.; Hrabovsky, M.; Hristova, I.; Hrivnac, J.; Hryn'ova, T.; Hrynevich, A.; Hsu, C.; Hsu, P. J.; Hsu, S.-C.; Hu, D.; Hu, Q.; Huang, Y.; Hubacek, Z.; Hubaut, F.; Huegging, F.; Huffman, T. B.; Hughes, E. W.; Hughes, G.; Huhtinen, M.; Huo, P.; Huseynov, N.; Huston, J.; Huth, J.; Iacobucci, G.; Iakovidis, G.; Ibragimov, I.; Iconomidou-Fayard, L.; Ideal, E.; Iengo, P.; Igonkina, O.; Iizawa, T.; Ikegami, Y.; Ikeno, M.; Ilchenko, Y.; Iliadis, D.; Ilic, N.; Ince, T.; Introzzi, G.; Ioannou, P.; Iodice, M.; Iordanidou, K.; Ippolito, V.; Ishijima, N.; Ishino, M.; Ishitsuka, M.; Ishmukhametov, R.; Issever, C.; Istin, S.; Ito, F.; Ponce, J. M. Iturbe; Iuppa, R.; Iwanski, W.; Iwasaki, H.; Izen, J. M.; Izzo, V.; Jabbar, S.; Jackson, B.; Jackson, M.; Jackson, P.; Jain, V.; Jakobi, K. B.; Jakobs, K.; Jakobsen, S.; Jakoubek, T.; Jamin, D. O.; Jana, D. K.; Jansen, E.; Jansky, R.; Janssen, J.; Janus, M.; Jarlskog, G.; Javadov, N.; Javůrek, T.; Javurkova, M.; Jeanneau, F.; Jeanty, L.; Jeng, G.-Y.; Jennens, D.; Jenni, P.; Jentzsch, J.; Jeske, C.; Jézéquel, S.; Ji, H.; Jia, J.; Jiang, H.; Jiang, Y.; Jiggins, S.; Pena, J. Jimenez; Jin, S.; Jinaru, A.; Jinnouchi, O.; Johansson, P.; Johns, K. A.; Johnson, W. J.; Jon-And, K.; Jones, G.; Jones, R. W. L.; Jones, S.; Jones, T. J.; Jongmanns, J.; Jorge, P. M.; Jovicevic, J.; Ju, X.; Rozas, A. Juste; Köhler, M. K.; Kaczmarska, A.; Kado, M.; Kagan, H.; Kagan, M.; Kahn, S. J.; Kajomovitz, E.; Kalderon, C. W.; Kaluza, A.; Kama, S.; Kamenshchikov, A.; Kanaya, N.; Kaneti, S.; Kanjir, L.; Kantserov, V. A.; Kanzaki, J.; Kaplan, B.; Kaplan, L. S.; Kapliy, A.; Kar, D.; Karakostas, K.; Karamaoun, A.; Karastathis, N.; Kareem, M. J.; Karentzos, E.; Karnevskiy, M.; Karpov, S. N.; Karpova, Z. M.; Karthik, K.; Kartvelishvili, V.; Karyukhin, A. N.; Kasahara, K.; Kashif, L.; Kass, R. D.; Kastanas, A.; Kataoka, Y.; Kato, C.; Katre, A.; Katzy, J.; Kawade, K.; Kawagoe, K.; Kawamoto, T.; Kawamura, G.; Kazama, S.; Kazanin, V. F.; Keeler, R.; Kehoe, R.; Keller, J. S.; Kempster, J. J.; Keoshkerian, H.; Kepka, O.; Kerševan, B. P.; Kersten, S.; Keyes, R. A.; Khader, M.; Khalil-zada, F.; Khanov, A.; Kharlamov, A. G.; Khoo, T. J.; Khovanskiy, V.; Khramov, E.; Khubua, J.; Kido, S.; Kim, H. Y.; Kim, S. H.; Kim, Y. K.; Kimura, N.; Kind, O. M.; King, B. T.; King, M.; King, S. B.; Kirk, J.; Kiryunin, A. E.; Kishimoto, T.; Kisielewska, D.; Kiss, F.; Kiuchi, K.; Kivernyk, O.; Kladiva, E.; Klein, M. H.; Klein, M.; Klein, U.; Kleinknecht, K.; Klimek, P.; Klimentov, A.; Klingenberg, R.; Klinger, J. A.; Klioutchnikova, T.; Kluge, E.-E.; Kluit, P.; Kluth, S.; Knapik, J.; Kneringer, E.; Knoops, E. B. F. G.; Knue, A.; Kobayashi, A.; Kobayashi, D.; Kobayashi, T.; Kobel, M.; Kocian, M.; Kodys, P.; Koffas, T.; Koffeman, E.; Koi, T.; Kolanoski, H.; Kolb, M.; Koletsou, I.; Komar, A. A.; Komori, Y.; Kondo, T.; Kondrashova, N.; Köneke, K.; König, A. C.; Kono, T.; Konoplich, R.; Konstantinidis, N.; Kopeliansky, R.; Koperny, S.; Köpke, L.; Kopp, A. K.; Korcyl, K.; Kordas, K.; Korn, A.; Korol, A. A.; Korolkov, I.; Korolkova, E. V.; Kortner, O.; Kortner, S.; Kosek, T.; Kostyukhin, V. V.; Kotwal, A.; Kourkoumeli-Charalampidi, A.; Kourkoumelis, C.; Kouskoura, V.; Kowalewska, A. B.; Kowalewski, R.; Kowalski, T. Z.; Kozakai, C.; Kozanecki, W.; Kozhin, A. S.; Kramarenko, V. A.; Kramberger, G.; Krasnopevtsev, D.; Krasny, M. W.; Krasznahorkay, A.; Kraus, J. K.; Kravchenko, A.; Kretz, M.; Kretzschmar, J.; Kreutzfeldt, K.; Krieger, P.; Krizka, K.; Kroeninger, K.; Kroha, H.; Kroll, J.; Kroseberg, J.; Krstic, J.; Kruchonak, U.; Krüger, H.; Krumnack, N.; Kruse, A.; Kruse, M. C.; Kruskal, M.; Kubota, T.; Kucuk, H.; Kuday, S.; Kuechler, J. T.; Kuehn, S.; Kugel, A.; Kuger, F.; Kuhl, A.; Kuhl, T.; Kukhtin, V.; Kukla, R.; Kulchitsky, Y.; Kuleshov, S.; Kuna, M.; Kunigo, T.; Kupco, A.; Kurashige, H.; Kurochkin, Y. A.; Kus, V.; Kuwertz, E. S.; Kuze, M.; Kvita, J.; Kwan, T.; Kyriazopoulos, D.; Rosa, A. La; Navarro, J. L. La Rosa; Rotonda, L. La; Lacasta, C.; Lacava, F.; Lacey, J.; Lacker, H.; Lacour, D.; Lacuesta, V. R.; Ladygin, E.; Lafaye, R.; Laforge, B.; Lagouri, T.; Lai, S.; Lammers, S.; Lampl, W.; Lançon, E.; Landgraf, U.; Landon, M. P. J.; Lanfermann, M. C.; Lang, V. S.; Lange, J. C.; Lankford, A. J.; Lanni, F.; Lantzsch, K.; Lanza, A.; Laplace, S.; Lapoire, C.; Laporte, J. F.; Lari, T.; Manghi, F. Lasagni; Lassnig, M.; Laurelli, P.; Lavrijsen, W.; Law, A. T.; Laycock, P.; Lazovich, T.; Lazzaroni, M.; Le, B.; Dortz, O. Le; Guirriec, E. Le; Quilleuc, E. P. Le; LeBlanc, M.; LeCompte, T.; Ledroit-Guillon, F.; Lee, C. A.; Lee, S. C.; Lee, L.; Lefebvre, G.; Lefebvre, M.; Legger, F.; Leggett, C.; Lehan, A.; Miotto, G. Lehmann; Lei, X.; Leight, W. A.; Leister, A. G.; Leite, M. A. L.; Leitner, R.; Lellouch, D.; Lemmer, B.; Leney, K. J. C.; Lenz, T.; Lenzi, B.; Leone, R.; Leone, S.; Leonidopoulos, C.; Leontsinis, S.; Lerner, G.; Leroy, C.; Lesage, A. A. J.; Lester, C. G.; Levchenko, M.; Levêque, J.; Levin, D.; Levinson, L. J.; Levy, M.; Lewis, D.; Leyko, A. M.; Li, B.; Li, H.; Li, H. L.; Li, L.; Li, L.; Li, Q.; Li, S.; Li, X.; Li, Y.; Liang, Z.; Liberti, B.; Liblong, A.; Lichard, P.; Lie, K.; Liebal, J.; Liebig, W.; Limosani, A.; Lin, S. C.; Lin, T. H.; Lindquist, B. E.; Lionti, A. E.; Lipeles, E.; Lipniacka, A.; Lisovyi, M.; Liss, T. M.; Lister, A.; Litke, A. M.; Liu, B.; Liu, D.; Liu, H.; Liu, H.; Liu, J.; Liu, J. B.; Liu, K.; Liu, L.; Liu, M.; Liu, M.; Liu, Y. L.; Liu, Y.; Livan, M.; Lleres, A.; Merino, J. Llorente; Lloyd, S. L.; Sterzo, F. Lo; Lobodzinska, E. M.; Loch, P.; Lockman, W. S.; Loebinger, F. K.; Loevschall-Jensen, A. E.; Loew, K. M.; Loginov, A.; Lohse, T.; Lohwasser, K.; Lokajicek, M.; Long, B. A.; Long, J. D.; Long, R. E.; Longo, L.; Looper, K. A.; Lopes, L.; Mateos, D. Lopez; Paredes, B. Lopez; Paz, I. Lopez; Solis, A. Lopez; Lorenz, J.; Martinez, N. Lorenzo; Losada, M.; Lösel, P. J.; Lou, X.; Lounis, A.; Love, J.; Love, P. A.; Lu, H.; Lu, N.; Lubatti, H. J.; Luci, C.; Lucotte, A.; Luedtke, C.; Luehring, F.; Lukas, W.; Luminari, L.; Lundberg, O.; Lund-Jensen, B.; Luzi, P. M.; Lynn, D.; Lysak, R.; Lytken, E.; Lyubushkin, V.; Ma, H.; Ma, L. L.; Ma, Y.; Maccarrone, G.; Macchiolo, A.; Macdonald, C. M.; Maček, B.; Miguens, J. Machado; Madaffari, D.; Madar, R.; Maddocks, H. J.; Mader, W. F.; Madsen, A.; Maeda, J.; Maeland, S.; Maeno, T.; Maevskiy, A. S.; Magradze, E.; Mahlstedt, J.; Maiani, C.; Maidantchik, C.; Maier, A. A.; Maier, T.; Maio, A.; Majewski, S.; Makida, Y.; Makovec, N.; Malaescu, B.; Malecki, Pa.; Maleev, V. P.; Malek, F.; Mallik, U.; Malon, D.; Malone, C.; Maltezos, S.; Malyukov, S.; Mamuzic, J.; Mancini, G.; Mandelli, B.; Mandelli, L.; Mandić, I.; Maneira, J.; Filho, L. Manhaes de Andrade; Ramos, J. Manjarres; Mann, A.; Manousos, A.; Mansoulie, B.; Mansour, J. D.; Mantifel, R.; Mantoani, M.; Manzoni, S.; Mapelli, L.; Marceca, G.; March, L.; Marchiori, G.; Marcisovsky, M.; Marjanovic, M.; Marley, D. E.; Marroquim, F.; Marsden, S. P.; Marshall, Z.; Marti-Garcia, S.; Martin, B.; Martin, T. A.; Martin, V. J.; Latour, B. Martin dit; Martinez, M.; Outschoorn, V. I. Martinez; Martin-Haugh, S.; Martoiu, V. S.; Martyniuk, A. C.; Marx, M.; Marzin, A.; Masetti, L.; Mashimo, T.; Mashinistov, R.; Masik, J.; Maslennikov, A. L.; Massa, I.; Massa, L.; Mastrandrea, P.; Mastroberardino, A.; Masubuchi, T.; Mättig, P.; Mattmann, J.; Maurer, J.; Maxfield, S. J.; Maximov, D. A.; Mazini, R.; Mazza, S. M.; Fadden, N. C. Mc; Goldrick, G. Mc; Kee, S. P. Mc; McCarn, A.; McCarthy, R. L.; McCarthy, T. G.; McClymont, L. I.; McDonald, E. F.; Mcfayden, J. A.; Mchedlidze, G.; McMahon, S. J.; McPherson, R. A.; Medinnis, M.; Meehan, S.; Mehlhase, S.; Mehta, A.; Meier, K.; Meineck, C.; Meirose, B.; Melini, D.; Garcia, B. R. Mellado; Melo, M.; Meloni, F.; Mengarelli, A.; Menke, S.; Meoni, E.; Mergelmeyer, S.; Mermod, P.; Merola, L.; Meroni, C.; Merritt, F. S.; Messina, A.; Metcalfe, J.; Mete, A. S.; Meyer, C.; Meyer, C.; Meyer, J.-P.; Meyer, J.; Theenhausen, H. Meyer Zu; Miano, F.; Middleton, R. P.; Miglioranzi, S.; Mijović, L.; Mikenberg, G.; Mikestikova, M.; Mikuž, M.; Milesi, M.; Milic, A.; Miller, D. W.; Mills, C.; Milov, A.; Milstead, D. A.; Minaenko, A. A.; Minami, Y.; Minashvili, I. A.; Mincer, A. I.; Mindur, B.; Mineev, M.; Ming, Y.; Mir, L. M.; Mistry, K. P.; Mitani, T.; Mitrevski, J.; Mitsou, V. A.; Miucci, A.; Miyagawa, P. S.; Mjörnmark, J. U.; Moa, T.; Mochizuki, K.; Mohapatra, S.; Molander, S.; Moles-Valls, R.; Monden, R.; Mondragon, M. C.; Mönig, K.; Monk, J.; Monnier, E.; Montalbano, A.; Berlingen, J. Montejo; Monticelli, F.; Monzani, S.; Moore, R. W.; Morange, N.; Moreno, D.; Llácer, M. Moreno; Morettini, P.; Morgenstern, S.; Mori, D.; Mori, T.; Morii, M.; Morinaga, M.; Morisbak, V.; Moritz, S.; Morley, A. K.; Mornacchi, G.; Morris, J. D.; Morvaj, L.; Mosidze, M.; Moss, J.; Motohashi, K.; Mount, R.; Mountricha, E.; Mouraviev, S. V.; Moyse, E. J. W.; Muanza, S.; Mudd, R. D.; Mueller, F.; Mueller, J.; Mueller, R. S. P.; Mueller, T.; Muenstermann, D.; Mullen, P.; Mullier, G. A.; Sanchez, F. J. Munoz; Quijada, J. A. Murillo; Murray, W. J.; Musheghyan, H.; Muškinja, M.; Myagkov, A. G.; Myska, M.; Nachman, B. P.; Nackenhorst, O.; Nagai, K.; Nagai, R.; Nagano, K.; Nagasaka, Y.; Nagata, K.; Nagel, M.; Nagy, E.; Nairz, A. M.; Nakahama, Y.; Nakamura, K.; Nakamura, T.; Nakano, I.; Namasivayam, H.; Garcia, R. F. Naranjo; Narayan, R.; Villar, D. I. Narrias; Naryshkin, I.; Naumann, T.; Navarro, G.; Nayyar, R.; Neal, H. A.; Nechaeva, P. Yu.; Neep, T. J.; Nef, P. D.; Negri, A.; Negrini, M.; Nektarijevic, S.; Nellist, C.; Nelson, A.; Nemecek, S.; Nemethy, P.; Nepomuceno, A. A.; Nessi, M.; Neubauer, M. S.; Neumann, M.; Neves, R. M.; Nevski, P.; Newman, P. R.; Nguyen, D. H.; Manh, T. Nguyen; Nickerson, R. B.; Nicolaidou, R.; Nielsen, J.; Nikiforov, A.; Nikolaenko, V.; Nikolic-Audit, I.; Nikolopoulos, K.; Nilsen, J. K.; Nilsson, P.; Ninomiya, Y.; Nisati, A.; Nisius, R.; Nobe, T.; Nomachi, M.; Nomidis, I.; Nooney, T.; Norberg, S.; Nordberg, M.; Norjoharuddeen, N.; Novgorodova, O.; Nowak, S.; Nozaki, M.; Nozka, L.; Ntekas, K.; Nurse, E.; Nuti, F.; O'grady, F.; O'Neil, D. C.; O'Rourke, A. A.; O'Shea, V.; Oakham, F. G.; Oberlack, H.; Obermann, T.; Ocariz, J.; Ochi, A.; Ochoa, I.; Ochoa-Ricoux, J. P.; Oda, S.; Odaka, S.; Ogren, H.; Oh, A.; Oh, S. H.; Ohm, C. C.; Ohman, H.; Oide, H.; Okawa, H.; Okumura, Y.; Okuyama, T.; Olariu, A.; Seabra, L. F. Oleiro; Pino, S. A. Olivares; Damazio, D. Oliveira; Olszewski, A.; Olszowska, J.; Onofre, A.; Onogi, K.; Onyisi, P. U. E.; Oreglia, M. J.; Oren, Y.; Orestano, D.; Orlando, N.; Orr, R. S.; Osculati, B.; Ospanov, R.; Garzon, G. Otero y.; Otono, H.; Ouchrif, M.; Ould-Saada, F.; Ouraou, A.; Oussoren, K. P.; Ouyang, Q.; Owen, M.; Owen, R. E.; Ozcan, V. E.; Ozturk, N.; Pachal, K.; Pages, A. Pacheco; Rodriguez, L. Pacheco; Aranda, C. Padilla; Griso, S. Pagan; Paige, F.; Pais, P.; Pajchel, K.; Palacino, G.; Palazzo, S.; Palestini, S.; Palka, M.; Pallin, D.; Palma, A.; Panagiotopoulou, E. St.; Pandini, C. E.; Vazquez, J. G. Panduro; Pani, P.; Panitkin, S.; Pantea, D.; Paolozzi, L.; Papadopoulou, Th. D.; Papageorgiou, K.; Paramonov, A.; Hernandez, D. Paredes; Parker, A. J.; Parker, M. A.; Parker, K. A.; Parodi, F.; Parsons, J. A.; Parzefall, U.; Pascuzzi, V. R.; Pasqualucci, E.; Passaggio, S.; Pastore, Fr.; Pásztor, G.; Pataraia, S.; Pater, J. R.; Pauly, T.; Pearce, J.; Pearson, B.; Pedersen, L. E.; Lopez, S. Pedraza; Pedro, R.; Peleganchuk, S. V.; Pelikan, D.; Penc, O.; Peng, C.; Peng, H.; Penwell, J.; Peralva, B. S.; Perego, M. M.; Perepelitsa, D. V.; Codina, E. Perez; Perini, L.; Pernegger, H.; Perrella, S.; Peschke, R.; Peshekhonov, V. D.; Peters, K.; Peters, R. F. Y.; Petersen, B. A.; Petersen, T. C.; Petit, E.; Petridis, A.; Petridou, C.; Petroff, P.; Petrolo, E.; Petrov, M.; Petrucci, F.; Pettersson, N. E.; Peyaud, A.; Pezoa, R.; Phillips, P. W.; Piacquadio, G.; Pianori, E.; Picazio, A.; Piccaro, E.; Piccinini, M.; Pickering, M. A.; Piegaia, R.; Pilcher, J. E.; Pilkington, A. D.; Pin, A. W. J.; Pinamonti, M.; Pinfold, J. L.; Pingel, A.; Pires, S.; Pirumov, H.; Pitt, M.; Plazak, L.; Pleier, M.-A.; Pleskot, V.; Plotnikova, E.; Plucinski, P.; Pluth, D.; Poettgen, R.; Poggioli, L.; Pohl, D.; Polesello, G.; Poley, A.; Policicchio, A.; Polifka, R.; Polini, A.; Pollard, C. S.; Polychronakos, V.; Pommès, K.; Pontecorvo, L.; Pope, B. G.; Popeneciu, G. A.; Popovic, D. S.; Poppleton, A.; Pospisil, S.; Potamianos, K.; Potrap, I. N.; Potter, C. J.; Potter, C. T.; Poulard, G.; Poveda, J.; Pozdnyakov, V.; Astigarraga, M. E. Pozo; Pralavorio, P.; Pranko, A.; Prell, S.; Price, D.; Price, L. E.; Primavera, M.; Prince, S.; Proissl, M.; Prokofiev, K.; Prokoshin, F.; Protopopescu, S.; Proudfoot, J.; Przybycien, M.; Puddu, D.; Purohit, M.; Puzo, P.; Qian, J.; Qin, G.; Qin, Y.; Quadt, A.; Quayle, W. B.; Queitsch-Maitland, M.; Quilty, D.; Raddum, S.; Radeka, V.; Radescu, V.; Radhakrishnan, S. K.; Radloff, P.; Rados, P.; Ragusa, F.; Rahal, G.; Raine, J. A.; Rajagopalan, S.; Rammensee, M.; Rangel-Smith, C.; Ratti, M. G.; Rauscher, F.; Rave, S.; Ravenscroft, T.; Ravinovich, I.; Raymond, M.; Read, A. L.; Readioff, N. P.; Reale, M.; Rebuzzi, D. M.; Redelbach, A.; Redlinger, G.; Reece, R.; Reeves, K.; Rehnisch, L.; Reichert, J.; Reisin, H.; Rembser, C.; Ren, H.; Rescigno, M.; Resconi, S.; Rezanova, O. L.; Reznicek, P.; Rezvani, R.; Richter, R.; Richter, S.; Richter-Was, E.; Ricken, O.; Ridel, M.; Rieck, P.; Riegel, C. J.; Rieger, J.; Rifki, O.; Rijssenbeek, M.; Rimoldi, A.; Rimoldi, M.; Rinaldi, L.; Ristić, B.; Ritsch, E.; Riu, I.; Rizatdinova, F.; Rizvi, E.; Rizzi, C.; Robertson, S. H.; Robichaud-Veronneau, A.; Robinson, D.; Robinson, J. E. M.; Robson, A.; Roda, C.; Rodina, Y.; Perez, A. Rodriguez; Rodriguez, D. Rodriguez; Roe, S.; Rogan, C. S.; Røhne, O.; Romaniouk, A.; Romano, M.; Saez, S. M. Romano; Adam, E. Romero; Rompotis, N.; Ronzani, M.; Roos, L.; Ros, E.; Rosati, S.; Rosbach, K.; Rose, P.; Rosenthal, O.; Rosien, N.-A.; Rossetti, V.; Rossi, E.; Rossi, L. P.; Rosten, J. H. N.; Rosten, R.; Rotaru, M.; Roth, I.; Rothberg, J.; Rousseau, D.; Royon, C. R.; Rozanov, A.; Rozen, Y.; Ruan, X.; Rubbo, F.; Rudolph, M. S.; Rühr, F.; Ruiz-Martinez, A.; Rurikova, Z.; Rusakovich, N. A.; Ruschke, A.; Russell, H. L.; Rutherfoord, J. P.; Ruthmann, N.; Ryabov, Y. F.; Rybar, M.; Rybkin, G.; Ryu, S.; Ryzhov, A.; Rzehorz, G. F.; Saavedra, A. F.; Sabato, G.; Sacerdoti, S.; Sadrozinski, H. F.-W.; Sadykov, R.; Tehrani, F. Safai; Saha, P.; Sahinsoy, M.; Saimpert, M.; Saito, T.; Sakamoto, H.; Sakurai, Y.; Salamanna, G.; Salamon, A.; Loyola, J. E. Salazar; Salek, D.; De Bruin, P. H. Sales; Salihagic, D.; Salnikov, A.; Salt, J.; Salvatore, D.; Salvatore, F.; Salvucci, A.; Salzburger, A.; Sammel, D.; Sampsonidis, D.; Sánchez, J.; Martinez, V. Sanchez; Pineda, A. Sanchez; Sandaker, H.; Sandbach, R. L.; Sander, H. G.; Sandhoff, M.; Sandoval, C.; Sandstroem, R.; Sankey, D. P. C.; Sannino, M.; Sansoni, A.; Santoni, C.; Santonico, R.; Santos, H.; Castillo, I. Santoyo; Sapp, K.; Sapronov, A.; Saraiva, J. G.; Sarrazin, B.; Sasaki, O.; Sasaki, Y.; Sato, K.; Sauvage, G.; Sauvan, E.; Savage, G.; Savard, P.; Sawyer, C.; Sawyer, L.; Saxon, J.; Sbarra, C.; Sbrizzi, A.; Scanlon, T.; Scannicchio, D. A.; Scarcella, M.; Scarfone, V.; Schaarschmidt, J.; Schacht, P.; Schachtner, B. M.; Schaefer, D.; Schaefer, R.; Schaeffer, J.; Schaepe, S.; Schaetzel, S.; Schäfer, U.; Schaffer, A. C.; Schaile, D.; Schamberger, R. D.; Scharf, V.; Schegelsky, V. A.; Scheirich, D.; Schernau, M.; Schiavi, C.; Schier, S.; Schillo, C.; Schioppa, M.; Schlenker, S.; Schmidt-Sommerfeld, K. R.; Schmieden, K.; Schmitt, C.; Schmitt, S.; Schmitz, S.; Schneider, B.; Schnoor, U.; Schoeffel, L.; Schoening, A.; Schoenrock, B. D.; Schopf, E.; Schott, M.; Schovancova, J.; Schramm, S.; Schreyer, M.; Schuh, N.; Schulte, A.; Schultens, M. J.; Schultz-Coulon, H.-C.; Schulz, H.; Schumacher, M.; Schumm, B. A.; Schune, Ph.; Schwartzman, A.; Schwarz, T. A.; Schwegler, Ph.; Schweiger, H.; Schwemling, Ph.; Schwienhorst, R.; Schwindling, J.; Schwindt, T.; Sciolla, G.; Scuri, F.; Scutti, F.; Searcy, J.; Seema, P.; Seidel, S. C.; Seiden, A.; Seifert, F.; Seixas, J. M.; Sekhniaidze, G.; Sekhon, K.; Sekula, S. J.; Seliverstov, D. M.; Semprini-Cesari, N.; Serfon, C.; Serin, L.; Serkin, L.; Sessa, M.; Seuster, R.; Severini, H.; Sfiligoj, T.; Sforza, F.; Sfyrla, A.; Shabalina, E.; Shaikh, N. W.; Shan, L. Y.; Shang, R.; Shank, J. T.; Shapiro, M.; Shatalov, P. B.; Shaw, K.; Shaw, S. M.; Shcherbakova, A.; Shehu, C. Y.; Sherwood, P.; Shi, L.; Shimizu, S.; Shimmin, C. O.; Shimojima, M.; Shiyakova, M.; Shmeleva, A.; Saadi, D. Shoaleh; Shochet, M. J.; Shojaii, S.; Shrestha, S.; Shulga, E.; Shupe, M. A.; Sicho, P.; Sickles, A. M.; Sidebo, P. E.; Sidiropoulou, O.; Sidorov, D.; Sidoti, A.; Siegert, F.; Sijacki, Dj.; Silva, J.; Silverstein, S. B.; Simak, V.; Simard, O.; Simic, Lj.; Simion, S.; Simioni, E.; Simmons, B.; Simon, D.; Simon, M.; Sinervo, P.; Sinev, N. B.; Sioli, M.; Siragusa, G.; Sivoklokov, S. Yu.; Sjölin, J.; Skinner, M. B.; Skottowe, H. P.; Skubic, P.; Slater, M.; Slavicek, T.; Slawinska, M.; Sliwa, K.; Slovak, R.; Smakhtin, V.; Smart, B. H.; Smestad, L.; Smiesko, J.; Smirnov, S. Yu.; Smirnov, Y.; Smirnova, L. N.; Smirnova, O.; Smith, M. N. K.; Smith, R. W.; Smizanska, M.; Smolek, K.; Snesarev, A. A.; Snyder, S.; Sobie, R.; Socher, F.; Soffer, A.; Soh, D. A.; Sokhrannyi, G.; Sanchez, C. A. Solans; Solar, M.; Soldatov, E. Yu.; Soldevila, U.; Solodkov, A. A.; Soloshenko, A.; Solovyanov, O. V.; Solovyev, V.; Sommer, P.; Son, H.; Song, H. Y.; Sood, A.; Sopczak, A.; Sopko, V.; Sorin, V.; Sosa, D.; Sotiropoulou, C. L.; Soualah, R.; Soukharev, A. M.; South, D.; Sowden, B. C.; Spagnolo, S.; Spalla, M.; Spangenberg, M.; Spanò, F.; Sperlich, D.; Spettel, F.; Spighi, R.; Spigo, G.; Spiller, L. A.; Spousta, M.; Denis, R. D. St.; Stabile, A.; Stamen, R.; Stamm, S.; Stanecka, E.; Stanek, R. W.; Stanescu, C.; Stanescu-Bellu, M.; Stanitzki, M. M.; Stapnes, S.; Starchenko, E. A.; Stark, G. H.; Stark, J.; Stark, S. H.; Staroba, P.; Starovoitov, P.; Stärz, S.; Staszewski, R.; Steinberg, P.; Stelzer, B.; Stelzer, H. J.; Stelzer-Chilton, O.; Stenzel, H.; Stewart, G. A.; Stillings, J. A.; Stockton, M. C.; Stoebe, M.; Stoicea, G.; Stolte, P.; Stonjek, S.; Stradling, A. R.; Straessner, A.; Stramaglia, M. E.; Strandberg, J.; Strandberg, S.; Strandlie, A.; Strauss, M.; Strizenec, P.; Ströhmer, R.; Strom, D. M.; Stroynowski, R.; Strubig, A.; Stucci, S. A.; Stugu, B.; Styles, N. A.; Su, D.; Su, J.; Suchek, S.; Sugaya, Y.; Suk, M.; Sulin, V. V.; Sultansoy, S.; Sumida, T.; Sun, S.; Sun, X.; Sundermann, J. E.; Suruliz, K.; Susinno, G.; Sutton, M. R.; Suzuki, S.; Svatos, M.; Swiatlowski, M.; Sykora, I.; Sykora, T.; Ta, D.; Taccini, C.; Tackmann, K.; Taenzer, J.; Taffard, A.; Tafirout, R.; Taiblum, N.; Takai, H.; Takashima, R.; Takeshita, T.; Takubo, Y.; Talby, M.; Talyshev, A. A.; Tan, K. G.; Tanaka, J.; Tanaka, R.; Tanaka, S.; Tannenwald, B. B.; Araya, S. Tapia; Tapprogge, S.; Tarem, S.; Tartarelli, G. F.; Tas, P.; Tasevsky, M.; Tashiro, T.; Tassi, E.; Delgado, A. Tavares; Tayalati, Y.; Taylor, A. C.; Taylor, G. N.; Taylor, P. T. E.; Taylor, W.; Teischinger, F. A.; Teixeira-Dias, P.; Temple, D.; Kate, H. Ten; Teng, P. K.; Teoh, J. J.; Tepel, F.; Terada, S.; Terashi, K.; Terron, J.; Terzo, S.; Testa, M.; Teuscher, R. J.; Theveneaux-Pelzer, T.; Thomas, J. P.; Thomas-Wilsker, J.; Thompson, E. N.; Thompson, P. D.; Thompson, A. S.; Thomsen, L. A.; Thomson, E.; Thomson, M.; Tibbetts, M. J.; Torres, R. E. Ticse; Tikhomirov, V. O.; Tikhonov, Yu. A.; Timoshenko, S.; Tipton, P.; Tisserant, S.; Todome, K.; Todorov, T.; Todorova-Nova, S.; Tojo, J.; Tokár, S.; Tokushuku, K.; Tolley, E.; Tomlinson, L.; Tomoto, M.; Tompkins, L.; Toms, K.; Tong, B.; Torrence, E.; Torres, H.; Pastor, E. Torró; Toth, J.; Touchard, F.; Tovey, D. R.; Trefzger, T.; Tricoli, A.; Trigger, I. M.; Trincaz-Duvoid, S.; Tripiana, M. F.; Trischuk, W.; Trocmé, B.; Trofymov, A.; Troncon, C.; Trottier-McDonald, M.; Trovatelli, M.; Truong, L.; Trzebinski, M.; Trzupek, A.; Tseng, J. C.-L.; Tsiareshka, P. V.; Tsipolitis, G.; Tsirintanis, N.; Tsiskaridze, S.; Tsiskaridze, V.; Tskhadadze, E. G.; Tsui, K. M.; Tsukerman, I. I.; Tsulaia, V.; Tsuno, S.; Tsybychev, D.; Tudorache, A.; Tudorache, V.; Tuna, A. N.; Tupputi, S. A.; Turchikhin, S.; Turecek, D.; Turgeman, D.; Turra, R.; Turvey, A. J.; Tuts, P. M.; Tyndel, M.; Ucchielli, G.; Ueda, I.; Ughetto, M.; Ukegawa, F.; Unal, G.; Undrus, A.; Unel, G.; Ungaro, F. C.; Unno, Y.; Unverdorben, C.; Urban, J.; Urquijo, P.; Urrejola, P.; Usai, G.; Usanova, A.; Vacavant, L.; Vacek, V.; Vachon, B.; Valderanis, C.; Santurio, E. Valdes; Valencic, N.; Valentinetti, S.; Valero, A.; Valéry, L.; Valkar, S.; Vallecorsa, S.; Ferrer, J. A. Valls; Van Den Wollenberg, W.; Van Der Deijl, P. C.; van der Geer, R.; van der Graaf, H.; van Eldik, N.; van Gemmeren, P.; Van Nieuwkoop, J.; van Vulpen, I.; van Woerden, M. C.; Vanadia, M.; Vandelli, W.; Vanguri, R.; Vaniachine, A.; Vankov, P.; Vardanyan, G.; Vari, R.; Varnes, E. W.; Varol, T.; Varouchas, D.; Vartapetian, A.; Varvell, K. E.; Vasquez, J. G.; Vazeille, F.; Schroeder, T. Vazquez; Veatch, J.; Veloce, L. M.; Veloso, F.; Veneziano, S.; Ventura, A.; Venturi, M.; Venturi, N.; Venturini, A.; Vercesi, V.; Verducci, M.; Verkerke, W.; Vermeulen, J. C.; Vest, A.; Vetterli, M. C.; Viazlo, O.; Vichou, I.; Vickey, T.; Boeriu, O. E. Vickey; Viehhauser, G. H. A.; Viel, S.; Vigani, L.; Vigne, R.; Villa, M.; Perez, M. Villaplana; Vilucchi, E.; Vincter, M. G.; Vinogradov, V. B.; Vittori, C.; Vivarelli, I.; Vlachos, S.; Vlasak, M.; Vogel, M.; Vokac, P.; Volpi, G.; Volpi, M.; von der Schmitt, H.; von Toerne, E.; Vorobel, V.; Vorobev, K.; Vos, M.; Voss, R.; Vossebeld, J. H.; Vranjes, N.; Milosavljevic, M. Vranjes; Vrba, V.; Vreeswijk, M.; Vuillermet, R.; Vukotic, I.; Vykydal, Z.; Wagner, P.; Wagner, W.; Wahlberg, H.; Wahrmund, S.; Wakabayashi, J.; Walder, J.; Walker, R.; Walkowiak, W.; Wallangen, V.; Wang, C.; Wang, C.; Wang, F.; Wang, H.; Wang, H.; Wang, J.; Wang, J.; Wang, K.; Wang, R.; Wang, S. M.; Wang, T.; Wang, T.; Wang, W.; Wang, X.; Wanotayaroj, C.; Warburton, A.; Ward, C. P.; Wardrope, D. R.; Washbrook, A.; Watkins, P. M.; Watson, A. T.; Watson, M. F.; Watts, G.; Watts, S.; Waugh, B. M.; Webb, S.; Weber, M. S.; Weber, S. W.; Webster, J. S.; Weidberg, A. R.; Weinert, B.; Weingarten, J.; Weiser, C.; Weits, H.; Wells, P. S.; Wenaus, T.; Wengler, T.; Wenig, S.; Wermes, N.; Werner, M.; Werner, M. D.; Werner, P.; Wessels, M.; Wetter, J.; Whalen, K.; Whallon, N. L.; Wharton, A. M.; White, A.; White, M. J.; White, R.; Whiteson, D.; Wickens, F. J.; Wiedenmann, W.; Wielers, M.; Wienemann, P.; Wiglesworth, C.; Wiik-Fuchs, L. A. M.; Wildauer, A.; Wilk, F.; Wilkens, H. G.; Williams, H. H.; Williams, S.; Willis, C.; Willocq, S.; Wilson, J. A.; Wingerter-Seez, I.; Winklmeier, F.; Winston, O. J.; Winter, B. T.; Wittgen, M.; Wittkowski, J.; Wolter, M. W.; Wolters, H.; Worm, S. D.; Wosiek, B. K.; Wotschack, J.; Woudstra, M. J.; Wozniak, K. W.; Wu, M.; Wu, M.; Wu, S. L.; Wu, X.; Wu, Y.; Wyatt, T. R.; Wynne, B. M.; Xella, S.; Xu, D.; Xu, L.; Yabsley, B.; Yacoob, S.; Yakabe, R.; Yamaguchi, D.; Yamaguchi, Y.; Yamamoto, A.; Yamamoto, S.; Yamanaka, T.; Yamauchi, K.; Yamazaki, Y.; Yan, Z.; Yang, H.; Yang, H.; Yang, Y.; Yang, Z.; Yao, W.-M.; Yap, Y. C.; Yasu, Y.; Yatsenko, E.; Wong, K. H. Yau; Ye, J.; Ye, S.; Yeletskikh, I.; Yen, A. L.; Yildirim, E.; Yorita, K.; Yoshida, R.; Yoshihara, K.; Young, C.; Young, C. J. S.; Youssef, S.; Yu, D. R.; Yu, J.; Yu, J. M.; Yu, J.; Yuan, L.; Yuen, S. P. Y.; Yusuff, I.; Zabinski, B.; Zaidan, R.; Zaitsev, A. M.; Zakharchuk, N.; Zalieckas, J.; Zaman, A.; Zambito, S.; Zanello, L.; Zanzi, D.; Zeitnitz, C.; Zeman, M.; Zemla, A.; Zeng, J. C.; Zeng, Q.; Zengel, K.; Zenin, O.; Ženiš, T.; Zerwas, D.; Zhang, D.; Zhang, F.; Zhang, G.; Zhang, H.; Zhang, J.; Zhang, L.; Zhang, R.; Zhang, R.; Zhang, X.; Zhang, Z.; Zhao, X.; Zhao, Y.; Zhao, Z.; Zhemchugov, A.; Zhong, J.; Zhou, B.; Zhou, C.; Zhou, L.; Zhou, L.; Zhou, M.; Zhou, N.; Zhu, C. G.; Zhu, H.; Zhu, J.; Zhu, Y.; Zhuang, X.; Zhukov, K.; Zibell, A.; Zieminska, D.; Zimine, N. I.; Zimmermann, C.; Zimmermann, S.; Zinonos, Z.; Zinser, M.; Ziolkowski, M.; Živković, L.; Zobernig, G.; Zoccoli, A.; Nedden, M. zur; Zwalinski, L.

2017-05-01

This paper presents the method and performance of primary vertex reconstruction in proton-proton collision data recorded by the ATLAS experiment during Run 1 of the LHC. The studies presented focus on data taken during 2012 at a centre-of-mass energy of √{s} = 8 TeV. The performance has been measured as a function of the number of interactions per bunch crossing over a wide range, from one to seventy. The measurement of the position and size of the luminous region and its use as a constraint to improve the primary vertex resolution are discussed. A longitudinal vertex position resolution of about 30μm is achieved for events with high multiplicity of reconstructed tracks. The transverse position resolution is better than 20μm and is dominated by the precision on the size of the luminous region. An analytical model is proposed to describe the primary vertex reconstruction efficiency as a function of the number of interactions per bunch crossing and of the longitudinal size of the luminous region. Agreement between the data and the predictions of this model is better than 3% up to seventy interactions per bunch crossing.

LOD-based clustering techniques for efficient large-scale terrain storage and visualization

NASA Astrophysics Data System (ADS)

Bao, Xiaohong; Pajarola, Renato

2003-05-01

Large multi-resolution terrain data sets are usually stored out-of-core. To visualize terrain data at interactive frame rates, the data needs to be organized on disk, loaded into main memory part by part, then rendered efficiently. Many main-memory algorithms have been proposed for efficient vertex selection and mesh construction. Organization of terrain data on disk is quite difficult because the error, the triangulation dependency and the spatial location of each vertex all need to be considered. Previous terrain clustering algorithms did not consider the per-vertex approximation error of individual terrain data sets. Therefore, the vertex sequences on disk are exactly the same for any terrain. In this paper, we propose a novel clustering algorithm which introduces the level-of-detail (LOD) information to terrain data organization to map multi-resolution terrain data to external memory. In our approach the LOD parameters of the terrain elevation points are reflected during clustering. The experiments show that dynamic loading and paging of terrain data at varying LOD is very efficient and minimizes page faults. Additionally, the preprocessing of this algorithm is very fast and works from out-of-core.

A systematic approach to sketch Bethe-Salpeter equation

NASA Astrophysics Data System (ADS)

Qin, Si-xue

2016-03-01

To study meson properties, one needs to solve the gap equation for the quark propagator and the Bethe-Salpeter (BS) equation for the meson wavefunction, self-consistently. The gluon propagator, the quark-gluon vertex, and the quark-anti-quark scattering kernel are key pieces to solve those equations. Predicted by lattice-QCD and Dyson-Schwinger analyses of QCD's gauge sector, gluons are non-perturbatively massive. In the matter sector, the modeled gluon propagator which can produce a veracious description of meson properties needs to possess a mass scale, accordingly. Solving the well-known longitudinal Ward-Green-Takahashi identities (WGTIs) and the less-known transverse counterparts together, one obtains a nontrivial solution which can shed light on the structure of the quark-gluon vertex. It is highlighted that the phenomenologically proposed anomalous chromomagnetic moment (ACM) vertex originates from the QCD Lagrangian symmetries and its strength is proportional to the magnitude of dynamical chiral symmetry breaking (DCSB). The color-singlet vector and axial-vector WGTIs can relate the BS kernel and the dressed quark-gluon vertex to each other. Using the relation, one can truncate the gap equation and the BS equation, systematically, without violating crucial symmetries, e.g., gauge symmetry and chiral symmetry.

Optical conductivity calculation of a k.p model semiconductor GaAs incorporating first-order electron-hole vertex correction

NASA Astrophysics Data System (ADS)

Nurhuda, Maryam; Aziz Majidi, Muhammad

2018-04-01

The role of excitons in semiconducting materials carries potential applications. Experimental results show that excitonic signals also appear in optical absorption spectra of semiconductor system with narrow gap, such as Gallium Arsenide (GaAs). While on the theoretical side, calculation of optical spectra based purely on Density Functional Theory (DFT) without taking electron-hole (e-h) interactions into account does not lead to the appearance of any excitonic signal. Meanwhile, existing DFT-based algorithms that include a full vertex correction through Bethe-Salpeter equation may reveal an excitonic signal, but the algorithm has not provided a way to analyze the excitonic signal further. Motivated to provide a way to isolate the excitonic effect in the optical response theoretically, we develop a method of calculation for the optical conductivity of a narrow band-gap semiconductor GaAs within the 8-band k.p model that includes electron-hole interactions through first-order electron-hole vertex correction. Our calculation confirms that the first-order e-h vertex correction reveals excitonic signal around 1.5 eV (the band gap edge), consistent with the experimental data.

Distinct DNA exit and packaging portals in the virus Acanthamoeba polyphaga mimivirus.

PubMed

Zauberman, Nathan; Mutsafi, Yael; Halevy, Daniel Ben; Shimoni, Eyal; Klein, Eugenia; Xiao, Chuan; Sun, Siyang; Minsky, Abraham

2008-05-13

Icosahedral double-stranded DNA viruses use a single portal for genome delivery and packaging. The extensive structural similarity revealed by such portals in diverse viruses, as well as their invariable positioning at a unique icosahedral vertex, led to the consensus that a particular, highly conserved vertex-portal architecture is essential for viral DNA translocations. Here we present an exception to this paradigm by demonstrating that genome delivery and packaging in the virus Acanthamoeba polyphaga mimivirus occur through two distinct portals. By using high-resolution techniques, including electron tomography and cryo-scanning electron microscopy, we show that Mimivirus genome delivery entails a large-scale conformational change of the capsid, whereby five icosahedral faces open up. This opening, which occurs at a unique vertex of the capsid that we coined the "stargate", allows for the formation of a massive membrane conduit through which the viral DNA is released. A transient aperture centered at an icosahedral face distal to the DNA delivery site acts as a non-vertex DNA packaging portal. In conjunction with comparative genomic studies, our observations imply a viral packaging pathway akin to bacterial DNA segregation, which might be shared by diverse internal membrane-containing viruses.

Distinct DNA Exit and Packaging Portals in the Virus Acanthamoeba polyphaga mimivirus

PubMed Central

Zauberman, Nathan; Mutsafi, Yael; Halevy, Daniel Ben; Shimoni, Eyal; Klein, Eugenia; Xiao, Chuan; Sun, Siyang; Minsky, Abraham

2008-01-01

Icosahedral double-stranded DNA viruses use a single portal for genome delivery and packaging. The extensive structural similarity revealed by such portals in diverse viruses, as well as their invariable positioning at a unique icosahedral vertex, led to the consensus that a particular, highly conserved vertex-portal architecture is essential for viral DNA translocations. Here we present an exception to this paradigm by demonstrating that genome delivery and packaging in the virus Acanthamoeba polyphaga mimivirus occur through two distinct portals. By using high-resolution techniques, including electron tomography and cryo-scanning electron microscopy, we show that Mimivirus genome delivery entails a large-scale conformational change of the capsid, whereby five icosahedral faces open up. This opening, which occurs at a unique vertex of the capsid that we coined the “stargate”, allows for the formation of a massive membrane conduit through which the viral DNA is released. A transient aperture centered at an icosahedral face distal to the DNA delivery site acts as a non-vertex DNA packaging portal. In conjunction with comparative genomic studies, our observations imply a viral packaging pathway akin to bacterial DNA segregation, which might be shared by diverse internal membrane–containing viruses. PMID:18479185

[The influence of polymerization time on physicochemical properties of the acrylic resin Vertex RS].

PubMed

Fraczak, Bogumiła; Sobolewska, Ewa; Ey-Chmielewska, Halina; Skowronek, Maria; Błazewicz, Stanisław

2009-01-01

A good denture can only be produced through proper actions during the clinical and laboratory stages of the production process. The aim of this study was to determine if a change in polymerization time affects the physicochemical properties of polymethacrylate material used for dentures. We examined the acrylic resin Vertex R.S. polymerized for 15, 25, 40, or 60 minutes. Palapress Vario was taken as reference material. Static bending, microhardness, surface wettability, and susceptibility to abrasion were determined. The microhardness test showed that most of the samples had similar Vickers hardness (VS) values, except for the sample polymerized for 25 min. which demonstrated a significantly higher value. Grindability was affected by a change in polymerization time. Mass loss was greatest for samples polymerized for 15, 25, and 60 min. and smallest for Vertex 40 and Palapress Vario. We also observed differences in the wetting angle. Vertex 40 and 60 had a relatively low wetting angle signifying that longer polymerization time results in lower hydrophobicity of the material. The present study has demonstrated that polymerization time has a significant effect on the hardness and some mechanical properties of the acrylic resin.

Reconstruction of primary vertices at the ATLAS experiment in Run 1 proton–proton collisions at the LHC

DOE PAGES

Aaboud, M.; Aad, G.; Abbott, B.; ...

2017-05-19

This paper presents the method and performance of primary vertex reconstruction in proton–proton collision data recorded by the ATLAS experiment during Run 1 of the LHC. The studies presented focus on data taken during 2012 at a centre-of-mass energy of √s = 8 TeV. The performance has been measured as a function of the number of interactions per bunch crossing over a wide range, from one to seventy. The measurement of the position and size of the luminous region and its use as a constraint to improve the primary vertex resolution are discussed. A longitudinal vertex position resolution of aboutmore » 30 μm is achieved for events with high multiplicity of reconstructed tracks. The transverse position resolution is better than 20 μm and is dominated by the precision on the size of the luminous region. An analytical model is proposed to describe the primary vertex reconstruction efficiency as a function of the number of interactions per bunch crossing and of the longitudinal size of the luminous region. Agreement between the data and the predictions of this model is better than 3% up to seventy interactions per bunch crossing.« less

A group matrix representation relevant to scales of measurement of clinical disease states via stratified vectors.

PubMed

Sawamura, Jitsuki; Morishita, Shigeru; Ishigooka, Jun

2016-02-09

Previously, we applied basic group theory and related concepts to scales of measurement of clinical disease states and clinical findings (including laboratory data). To gain a more concrete comprehension, we here apply the concept of matrix representation, which was not explicitly exploited in our previous work. Starting with a set of orthonormal vectors, called the basis, an operator Rj (an N-tuple patient disease state at the j-th session) was expressed as a set of stratified vectors representing plural operations on individual components, so as to satisfy the group matrix representation. The stratified vectors containing individual unit operations were combined into one-dimensional square matrices [Rj]s. The [Rj]s meet the matrix representation of a group (ring) as a K-algebra. Using the same-sized matrix of stratified vectors, we can also express changes in the plural set of [Rj]s. The method is demonstrated on simple examples. Despite the incompleteness of our model, the group matrix representation of stratified vectors offers a formal mathematical approach to clinical medicine, aligning it with other branches of natural science.

Dynamics for a 2-vertex quantum gravity model

NASA Astrophysics Data System (ADS)

Borja, Enrique F.; Díaz-Polo, Jacobo; Garay, Iñaki; Livine, Etera R.

2010-12-01

We use the recently introduced U(N) framework for loop quantum gravity to study the dynamics of spin network states on the simplest class of graphs: two vertices linked with an arbitrary number N of edges. Such graphs represent two regions, in and out, separated by a boundary surface. We study the algebraic structure of the Hilbert space of spin networks from the U(N) perspective. In particular, we describe the algebra of operators acting on that space and discuss their relation to the standard holonomy operator of loop quantum gravity. Furthermore, we show that it is possible to make the restriction to the isotropic/homogeneous sector of the model by imposing the invariance under a global U(N) symmetry. We then propose a U(N)-invariant Hamiltonian operator and study the induced dynamics. Finally, we explore the analogies between this model and loop quantum cosmology and sketch some possible generalizations of it.

Mode coupling in hybrid square-rectangular lasers for single mode operation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ma, Xiu-Wen; Huang, Yong-Zhen, E-mail: yzhuang@semi.ac.cn; Yang, Yue-De

Mode coupling between a square microcavity and a Fabry-Pérot (FP) cavity is proposed and demonstrated for realizing single mode lasers. The modulations of the mode Q factor as simulation results are observed and single mode operation is obtained with a side mode suppression ratio of 46 dB and a single mode fiber coupling loss of 3.2 dB for an AlGaInAs/InP hybrid laser as a 300-μm-length and 1.5-μm-wide FP cavity connected to a vertex of a 10-μm-side square microcavity. Furthermore, tunable single mode operation is demonstrated with a continuous wavelength tuning range over 10 nm. The simple hybrid structure may shed light on practicalmore » applications of whispering-gallery mode microcavities in large-scale photonic integrated circuits and optical communication and interconnection.« less

Symmetric quadratic Hamiltonians with pseudo-Hermitian matrix representation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Fernández, Francisco M., E-mail: fernande@quimica.unlp.edu.ar

2016-06-15

We prove that any symmetric Hamiltonian that is a quadratic function of the coordinates and momenta has a pseudo-Hermitian adjoint or regular matrix representation. The eigenvalues of the latter matrix are the natural frequencies of the Hamiltonian operator. When all the eigenvalues of the matrix are real, then the spectrum of the symmetric Hamiltonian is real and the operator is Hermitian. As illustrative examples we choose the quadratic Hamiltonians that model a pair of coupled resonators with balanced gain and loss, the electromagnetic self-force on an oscillating charged particle and an active LRC circuit. -- Highlights: •Symmetric quadratic operators aremore » useful models for many physical applications. •Any such operator exhibits a pseudo-Hermitian matrix representation. •Its eigenvalues are the natural frequencies of the Hamiltonian operator. •The eigenvalues may be real or complex and describe a phase transition.« less

Quantum mechanics in noninertial reference frames: Relativistic accelerations and fictitious forces

DOE Office of Scientific and Technical Information (OSTI.GOV)

Klink, W.H., E-mail: william-klink@uiowa.edu; Wickramasekara, S., E-mail: wickrama@grinnell.edu

2016-06-15

One-particle systems in relativistically accelerating reference frames can be associated with a class of unitary representations of the group of arbitrary coordinate transformations, an extension of the Wigner–Bargmann definition of particles as the physical realization of unitary irreducible representations of the Poincaré group. Representations of the group of arbitrary coordinate transformations become necessary to define unitary operators implementing relativistic acceleration transformations in quantum theory because, unlike in the Galilean case, the relativistic acceleration transformations do not themselves form a group. The momentum operators that follow from these representations show how the fictitious forces in noninertial reference frames are generated inmore » quantum theory.« less

Coined quantum walks on weighted graphs

NASA Astrophysics Data System (ADS)

Wong, Thomas G.

2017-11-01

We define a discrete-time, coined quantum walk on weighted graphs that is inspired by Szegedy’s quantum walk. Using this, we prove that many lackadaisical quantum walks, where each vertex has l integer self-loops, can be generalized to a quantum walk where each vertex has a single self-loop of real-valued weight l. We apply this real-valued lackadaisical quantum walk to two problems. First, we analyze it on the line or one-dimensional lattice, showing that it is exactly equivalent to a continuous deformation of the three-state Grover walk with faster ballistic dispersion. Second, we generalize Grover’s algorithm, or search on the complete graph, to have a weighted self-loop at each vertex, yielding an improved success probability when l < 3 + 2\\sqrt{2} ≈ 5.828 .

Numerical operator calculus in higher dimensions.

PubMed

Beylkin, Gregory; Mohlenkamp, Martin J

2002-08-06

When an algorithm in dimension one is extended to dimension d, in nearly every case its computational cost is taken to the power d. This fundamental difficulty is the single greatest impediment to solving many important problems and has been dubbed the curse of dimensionality. For numerical analysis in dimension d, we propose to use a representation for vectors and matrices that generalizes separation of variables while allowing controlled accuracy. Basic linear algebra operations can be performed in this representation using one-dimensional operations, thus bypassing the exponential scaling with respect to the dimension. Although not all operators and algorithms may be compatible with this representation, we believe that many of the most important ones are. We prove that the multiparticle Schrödinger operator, as well as the inverse Laplacian, can be represented very efficiently in this form. We give numerical evidence to support the conjecture that eigenfunctions inherit this property by computing the ground-state eigenfunction for a simplified Schrödinger operator with 30 particles. We conjecture and provide numerical evidence that functions of operators inherit this property, in which case numerical operator calculus in higher dimensions becomes feasible.

A simplified formalism of the algebra of partially transposed permutation operators with applications

NASA Astrophysics Data System (ADS)

Mozrzymas, Marek; Studziński, Michał; Horodecki, Michał

2018-03-01

Herein we continue the study of the representation theory of the algebra of permutation operators acting on the n -fold tensor product space, partially transposed on the last subsystem. We develop the concept of partially reduced irreducible representations, which allows us to significantly simplify previously proved theorems and, most importantly, derive new results for irreducible representations of the mentioned algebra. In our analysis we are able to reduce the complexity of the central expressions by getting rid of sums over all permutations from the symmetric group, obtaining equations which are much more handy in practical applications. We also find relatively simple matrix representations for the generators of the underlying algebra. The obtained simplifications and developments are applied to derive the characteristics of a deterministic port-based teleportation scheme written purely in terms of irreducible representations of the studied algebra. We solve an eigenproblem for the generators of the algebra, which is the first step towards a hybrid port-based teleportation scheme and gives us new proofs of the asymptotic behaviour of teleportation fidelity. We also show a connection between the density operator characterising port-based teleportation and a particular matrix composed of an irreducible representation of the symmetric group, which encodes properties of the investigated algebra.

New Three-Mode Squeezing Operators Gained via Tripartite Entangled State Representation

NASA Astrophysics Data System (ADS)

Jiang, Nian-Quan; Fan, Hong-Yi

2008-01-01

We show that the Agarwal Simon representation of single-mode squeezed states can be generalized to find new form of three-mode squeezed states. We use the tripartite entangled state representations |p,y,z> and |x,u,v> to realize this goal.

Three-Point Functions in c≤1 Liouville Theory and Conformal Loop Ensembles.

PubMed

Ikhlef, Yacine; Jacobsen, Jesper Lykke; Saleur, Hubert

2016-04-01

The possibility of extending the Liouville conformal field theory from values of the central charge c≥25 to c≤1 has been debated for many years in condensed matter physics as well as in string theory. It was only recently proven that such an extension-involving a real spectrum of critical exponents as well as an analytic continuation of the Dorn-Otto-Zamolodchikov-Zamolodchikov formula for three-point couplings-does give rise to a consistent theory. We show in this Letter that this theory can be interpreted in terms of microscopic loop models. We introduce in particular a family of geometrical operators, and, using an efficient algorithm to compute three-point functions from the lattice, we show that their operator algebra corresponds exactly to that of vertex operators V_{α[over ^]} in c≤1 Liouville theory. We interpret geometrically the limit α[over ^]→0 of V_{α[over ^]} and explain why it is not the identity operator (despite having conformal weight Δ=0).

Effective temperature in an interacting vertex system: theory and experiment on artificial spin ice.

PubMed

Nisoli, Cristiano; Li, Jie; Ke, Xianglin; Garand, D; Schiffer, Peter; Crespi, Vincent H

2010-07-23

Frustrated arrays of interacting single-domain nanomagnets provide important model systems for statistical mechanics, as they map closely onto well-studied vertex models and are amenable to direct imaging and custom engineering. Although these systems are manifestly athermal, we demonstrate that an effective temperature, controlled by an external magnetic drive, describes their microstates and therefore their full statistical properties.

Action Verbs and the Primary Motor Cortex: A Comparative TMS Study of Silent Reading, Frequency Judgments, and Motor Imagery

ERIC Educational Resources Information Center

Tomasino, Barbara; Fink, Gereon R.; Sparing, Roland; Dafotakis, Manuel; Weiss, Peter H.

2008-01-01

Single pulse transcranial magnetic stimulation (TMS) was applied to the hand area of the left primary motor cortex or, as a control, to the vertex (STIMULATION: TMS[subscript M1] vs. TMS[subscript vertex]) while right-handed volunteers silently read verbs related to hand actions. We examined three different tasks and time points for stimulation…

Calculus Students' Understanding of the Vertex of the Quadratic Function in Relation to the Concept of Derivative

ERIC Educational Resources Information Center

Burns-Childers, Annie; Vidakovic, Draga

2018-01-01

The purpose of this study was to gain insight into 30, first year calculus students' understanding of the relationship between the concept of vertex of a quadratic function and the concept of the derivative. APOS (action-process-object-schema) theory was applied as a guiding framework of analysis on student written work, think-aloud and follow up…

Vertex-Group Effects in Entangled Polystyrene-Polyhedral Oligosilsesquioxane (POSS) Copolymers (Preprint)

DTIC Science & Technology

2008-11-17

Storrs, CT 06269 2Current Address: Syracuse Biomaterials Institute and Biomedical and Chemical Engineering Department, Syracuse University...dimension in the range 1-100 nm – in order to realize materials that combine the processibility and property-tuning of polymers with outstanding stiffness...polymers with a variety of vertex-groups: isobutyl (iBu), cyclopentyl (Cp) and cyclohexyl (Cy). EXPERIMENTAL SECTION Materials . In order to

3D Facial Pattern Analysis for Autism

DTIC Science & Technology

2010-07-01

each individual’s data were scaled by the geometric mean of all possible linear distances between landmarks, following. The first two principal...over traditional template matching in that it can represent geometrical and non- geometrical changes of an object in the parametric template space...set of vertex templates can be generated from the root template by geometric or non- geometric transformation. Let Mtt ,...1 be M normalized vertex

Androgenetic alopecia in men aged 40-69 years: prevalence and risk factors.

PubMed

Severi, G; Sinclair, R; Hopper, J L; English, D R; McCredie, M R E; Boyle, P; Giles, G G

2003-12-01

The epidemiology of androgenetic alopecia (AGA) is not fully understood. Although a strong genetic basis has long been identified, little is known of its non-genetic causes. To estimate the prevalence of and to determine risk factors for AGA in men aged 40-69 years in Australia. Men (n = 1390) were recruited at random from the electoral rolls to serve as controls in a population-based case-control study of prostate cancer. All were interviewed in person and direct observations of AGA were made. Men were grouped into the following categories; no AGA, frontal AGA, vertex AGA and full AGA (frontal and vertex AGA). Epidemiological data collected from these men were used for an analysis of risk factors for each AGA category using unconditional logistic regression with AGA category as the response variable adjusting for age, education and country of birth. The prevalence of vertex and full AGA increased with age from 31% (age 40-55 years) to 53% (age 65-69 years). Conversely, the proportion of men with only frontal AGA was very similar across all age groups (31-33%). No associations were found between pubertal growth spurt or acne, reports of adult body size at time of interview, urinary symptom score, marital status, or current smoking status or duration of smoking and the risk of any form of AGA. The consumption of alcohol was associated with a significant increase in risk of frontal and vertex AGA but not full AGA. Men with vertex AGA had fewer female sexual partners but average ejaculatory frequency did not differ between men in different AGA categories. Reported weight and lean body mass at reaching maturity at about 21 years of age were negatively associated with vertex balding (P for trend < 0.05) but not with frontal AGA or full AGA. Evidence for environmental influences on AGA remains very slight. Our study failed to confirm previously reported or hypothesized associations with smoking and benign prostatic hypertrophy. The associations that we found with alcohol consumption and with lean body mass at age 21 years would be worthy of further research if they were able to be replicated in other studies.

Design and implementation of a 3D-MR/CT geometric image distortion phantom/analysis system for stereotactic radiosurgery.

PubMed

Damyanovich, A Z; Rieker, M; Zhang, B; Bissonnette, J-P; Jaffray, D A

2018-03-27

The design, construction and application of a multimodality, 3D magnetic resonance/computed tomography (MR/CT) image distortion phantom and analysis system for stereotactic radiosurgery (SRS) is presented. The phantom is characterized by (1) a 1 × 1 × 1 (cm) 3 MRI/CT-visible 3D-Cartesian grid; (2) 2002 grid vertices that are 3D-intersections of MR-/CT-visible 'lines' in all three orthogonal planes; (3) a 3D-grid that is MR-signal positive/CT-signal negative; (4) a vertex distribution sufficiently 'dense' to characterize geometrical parameters properly, and (5) a grid/vertex resolution consistent with SRS localization accuracy. When positioned correctly, successive 3D-vertex planes along any orthogonal axis of the phantom appear as 1 × 1 (cm) 2 -2D grids, whereas between vertex planes, images are defined by 1 × 1 (cm) 2 -2D arrays of signal points. Image distortion is evaluated using a centroid algorithm that automatically identifies the center of each 3D-intersection and then calculates the deviations dx, dy, dz and dr for each vertex point; the results are presented as a color-coded 2D or 3D distribution of deviations. The phantom components and 3D-grid are machined to sub-millimeter accuracy, making the device uniquely suited to SRS applications; as such, we present it here in a form adapted for use with a Leksell stereotactic frame. Imaging reproducibility was assessed via repeated phantom imaging across ten back-to-back scans; 80%-90% of the differences in vertex deviations dx, dy, dz and dr between successive 3 T MRI scans were found to be  ⩽0.05 mm for both axial and coronal acquisitions, and over  >95% of the differences were observed to be  ⩽0.05 mm for repeated CT scans, clearly demonstrating excellent reproducibility. Applications of the 3D-phantom/analysis system are presented, using a 32-month time-course assessment of image distortion/gradient stability and statistical control chart for 1.5 T and 3 T GE TwinSpeed MRI systems.

Design and implementation of a 3D-MR/CT geometric image distortion phantom/analysis system for stereotactic radiosurgery

NASA Astrophysics Data System (ADS)

Damyanovich, A. Z.; Rieker, M.; Zhang, B.; Bissonnette, J.-P.; Jaffray, D. A.

2018-04-01

The design, construction and application of a multimodality, 3D magnetic resonance/computed tomography (MR/CT) image distortion phantom and analysis system for stereotactic radiosurgery (SRS) is presented. The phantom is characterized by (1) a 1 × 1 × 1 (cm)3 MRI/CT-visible 3D-Cartesian grid; (2) 2002 grid vertices that are 3D-intersections of MR-/CT-visible ‘lines’ in all three orthogonal planes; (3) a 3D-grid that is MR-signal positive/CT-signal negative; (4) a vertex distribution sufficiently ‘dense’ to characterize geometrical parameters properly, and (5) a grid/vertex resolution consistent with SRS localization accuracy. When positioned correctly, successive 3D-vertex planes along any orthogonal axis of the phantom appear as 1 × 1 (cm)2-2D grids, whereas between vertex planes, images are defined by 1 × 1 (cm)2-2D arrays of signal points. Image distortion is evaluated using a centroid algorithm that automatically identifies the center of each 3D-intersection and then calculates the deviations dx, dy, dz and dr for each vertex point; the results are presented as a color-coded 2D or 3D distribution of deviations. The phantom components and 3D-grid are machined to sub-millimeter accuracy, making the device uniquely suited to SRS applications; as such, we present it here in a form adapted for use with a Leksell stereotactic frame. Imaging reproducibility was assessed via repeated phantom imaging across ten back-to-back scans; 80%–90% of the differences in vertex deviations dx, dy, dz and dr between successive 3 T MRI scans were found to be  ⩽0.05 mm for both axial and coronal acquisitions, and over  >95% of the differences were observed to be  ⩽0.05 mm for repeated CT scans, clearly demonstrating excellent reproducibility. Applications of the 3D-phantom/analysis system are presented, using a 32-month time-course assessment of image distortion/gradient stability and statistical control chart for 1.5 T and 3 T GE TwinSpeed MRI systems.

DCA_Tools

DOE Office of Scientific and Technical Information (OSTI.GOV)

Summers, Michael S

2017-11-08

HPC software for ab-initio, condensed-matter physics, quantum mechanics calculations needs to be built on top of well tested libraries some of which address requirements unique to the programming domain. During the development of the DCA++ code, that we use in our research, we have developed a collection of libraries that may be of use to other computational scientists working in the same or similar domains. The libraries include: a) a pythonic input-language system, b) tensors whose shape is constructed from generalized dimension objects such at time domains. frequency domains, momentum domains, vertex domains et. al. and c) linear algebra operationsmore » that resolve to BLA/LAPACK operations when possible. This supports the implementation of Greens functions and operations on them such as are used in condensed matter physics.« less

From integrability to conformal symmetry: Bosonic superconformal Toda theories

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bo-Yu Hou; Liu Chao

In this paper the authors study the conformal integrable models obtained from conformal reductions of WZNW theory associated with second order constraints. These models are called bosonic superconformal Toda models due to their conformal spectra and their resemblance to the usual Toda theories. From the reduction procedure they get the equations of motion and the linearized Lax equations in a generic Z gradation of the underlying Lie algebra. Then, in the special case of principal gradation, they derive the classical r matrix, fundamental Poisson relation, exchange algebra of chiral operators and find out the classical vertex operators. The result showsmore » that their model is very similar to the ordinary Toda theories in that one can obtain various conformal properties of the model from its integrability.« less

Auxiliary-fermion approach to critical fluctuations in the two-dimensional quantum antiferromagnetic Heisenberg model

DOE Office of Scientific and Technical Information (OSTI.GOV)

Brinckmann, Jan; Woelfle, Peter

2004-11-01

The nearest-neighbor quantum antiferromagnetic (AF) Heisenberg model for spin-1/2 on a two-dimensional square lattice is studied in the auxiliary-fermion representation. Expressing spin operators by canonical fermionic particles requires a constraint on the fermion charge Q{sub i}=1 on each lattice site i, which is imposed approximately through the thermal average. The resulting interacting fermion system is first treated in mean-field theory (MFT), which yields an AF ordered ground state and spin waves in quantitative agreement with conventional spin-wave theory. At finite temperature a self-consistent approximation beyond mean field is required in order to fulfill the Mermin-Wagner theorem. We first discuss amore » fully self-consistent approximation, where fermions are renormalized due to fluctuations of their spin density, in close analogy to FLEX. While static properties like the correlation length, {xi}(T){proportional_to}exp(aJ/T), come out correctly, the dynamical response lacks the magnon-like peaks which would reflect the appearance of short-range order at low T. This drawback, which is caused by overdamping, is overcome in a 'minimal self-consistent approximation' (MSCA), which we derive from the equations of motion. The MSCA features dynamical scaling at small energy and temperature and is qualitatively correct both in the regime of order-parameter relaxation at long wavelengths {lambda}>{xi} and in the short-range-order regime at {lambda}<{xi}. We also discuss the impact of vertex corrections and the problem of pseudo-gap formation in the single-particle density of states due to long-range fluctuations. Finally we show that the (short-range) magnetic order in MFT and MSCA helps to fulfill the constraint on the local fermion occupancy.« less

Novel Real-time Alignment and Calibration of the LHCb detector in Run2

NASA Astrophysics Data System (ADS)

Martinelli, Maurizio; LHCb Collaboration

2017-10-01

LHCb has introduced a novel real-time detector alignment and calibration strategy for LHC Run2. Data collected at the start of the fill are processed in a few minutes and used to update the alignment parameters, while the calibration constants are evaluated for each run. This procedure improves the quality of the online reconstruction. For example, the vertex locator is retracted and reinserted for stable beam conditions in each fill to be centred on the primary vertex position in the transverse plane. Consequently its position changes on a fill-by-fill basis. Critically, this new real-time alignment and calibration procedure allows identical constants to be used in the online and offline reconstruction, thus improving the correlation between triggered and offline-selected events. This offers the opportunity to optimise the event selection in the trigger by applying stronger constraints. The required computing time constraints are met thanks to a new dedicated framework using the multi-core farm infrastructure for the trigger. The motivation for a real-time alignment and calibration of the LHCb detector is discussed from both the operational and physics performance points of view. Specific challenges of this novel configuration are discussed, as well as the working procedures of the framework and its performance.

13 CFR 107.502 - Representations to the public.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 13 Business Credit and Assistance 1 2010-01-01 2010-01-01 false Representations to the public. 107.502 Section 107.502 Business Credit and Assistance SMALL BUSINESS ADMINISTRATION SMALL BUSINESS INVESTMENT COMPANIES Managing the Operations of a Licensee General Requirements § 107.502 Representations to...

Searching for Heavy Photons with Detached Verices in the Heavy Photon Search Experiment

DOE Office of Scientific and Technical Information (OSTI.GOV)

Szumila-Vance, Holly

The Jefferson Lab Heavy Photon Search (HPS) experiment is searching for a hypothetical massive particle called the heavy photon which could mediate a dark electromagnetic-type force. If heavy photons kinetically mix with Standard Model photons, they may be radiated by electrons scattering from a heavy nucleus and then decay to e+e- pairs. HPS uniquely searches for heavy photons that either decay at the target or a measurable distance after. The experiment utilizes a silicon vertex tracker (SVT) for momentum and vertex reconstruction, together with an electromagnetic calorimeter for measuring particle energies and triggering events. The HPS experiment took its firstmore » data during the spring 2015 engineering run using a 1 GeV electron beam incident on a tungsten target and its second data in the spring of 2016 at a beam energy of 2.3 GeV. The 2015 run obtained two days of production data that was used for the first physics results. The analysis of the data was conducted as a blinded analysis by tuning cuts on 10% of the data. This dissertation discusses the displaced vertex search for heavy photons in the 2015 engineering run. It describes the theoretical motivation for looking for heavy photons and provides an overview of the HPS experimental design and performance. The performance details of the experiment are primarily derived from the 2015 engineering run with some discussion from the higher energy running in 2016. This dissertation further discusses the cuts used to optimize the displaced vertex search and the results of the search. The displaced vertex search did not set a limit on the heavy photon but did validate the methodology for conducting the search. Finally, we used the full data set to make projections and guide future analyses.« less

Similar response patterns to topical minoxidil foam 5% in frontal and vertex scalp of men with androgenetic alopecia: a microarray analysis.

PubMed

Mirmirani, P; Consolo, M; Oyetakin-White, P; Baron, E; Leahy, P; Karnik, P

2015-06-01

There are regional variations in the scalp hair miniaturization seen in androgenetic alopecia (AGA). Use of topical minoxidil can lead to reversal of miniaturization in the vertex scalp. However, its effects on other scalp regions have been less well studied. To determine whether scalp biopsies from men with AGA show variable gene expression before and after 8 weeks of treatment with minoxidil topical foam 5% (MTF) vs. placebo. A placebo-controlled double-blinded prospective pilot study of MTF vs. placebo was conducted in 16 healthy men aged 18-49 years with Hamilton-Norwood type IV-V thinning. The subjects were asked to apply the treatment (active drug or placebo) to the scalp twice daily for 8 weeks. Stereotactic scalp photographs were taken at the baseline and final visits, to monitor global hair growth. Scalp biopsies were taken at the leading edge of hair loss from the frontal and vertex scalp before and after treatment with MTF and placebo, and microarray analysis was performed using the Affymetrix GeneChip HG U133 Plus 2.0. Global stereotactic photographs showed that MTF induced hair growth in both the frontal and vertex scalp of patients with AGA. Regional differences in gene expression profiles were observed before treatment. However, MTF treatment induced the expression of hair keratin-associated genes and decreased the expression of epidermal differentiation complex and inflammatory genes in both scalp regions. These data suggest that MTF is effective in the treatment of both the frontal and vertex scalp of patients with AGA. © 2014 British Association of Dermatologists.

Effect of minoxidil topical foam on frontotemporal and vertex androgenetic alopecia in men: a 104-week open-label clinical trial.

PubMed

Kanti, V; Hillmann, K; Kottner, J; Stroux, A; Canfield, D; Blume-Peytavi, U

2016-07-01

Topical minoxidil formulations have been shown to be effective in treating androgenetic alopecia (AGA) for 12 months. Efficacy and safety in both frontotemporal and vertex regions over longer application periods have not been studied so far. To evaluate the effect of 5% minoxidil topical foam (5% MTF) in the frontotemporal and vertex areas in patients with moderate AGA over 104 weeks. An 80-week, open-label extension phase was performed, following a 24-week randomized, double-blind, placebo-controlled study in men with AGA grade IIIvertex to VI. Group 1 (n = 22) received ongoing 5% MTF for 104 weeks, Group 2 (n = 23) received placebo topical foam (plaTF) until week 24, followed by 5% MTF until week 104 during the extension phase. Frontotemporal and vertex target area non-vellus hair counts (f-TAHC, v-TAHC) and cumulative hair width (f-TAHW, v-TAHW) were assessed at baseline and at weeks 24, 52, 76 and 104. In Group 1, f-TAHW and f-TAHC showed a statistically significant increase from baseline to week 52 and week 76, respectively, returning to values comparable to baseline at week 104. No significant differences were found between baseline and week 104 in v-TAHC in Group 1 as well as f-TAHC, v-TAHC, f-TAHW and v-TAHW values in Group 2. 5% MTF is effective in stabilizing hair density, hair width and scalp coverage in both frontotemporal and vertex areas over an application period of 104 weeks, while showing a good safety and tolerability profile with a low rate of irritant contact dermatitis. © 2015 European Academy of Dermatology and Venereology.

A vertex detector for SLD

NASA Astrophysics Data System (ADS)

Damerell, C. J. S.; English, R. L.; Gillman, A. R.; Lintern, A. L.; Phillips, D.; Rong, G.; Sutton, C.; Wickens, F. J.; Agnew, G.; Clarke, P.; Hedges, S.; Watts, S. J.

1989-03-01

The SLAC Linear Collider is currently being commissioned. A second-generation detector for SLC, known as SLD, is now under construction. In the centre of this 4000 ton detector there will be a vertex detector (VXD) consisting of 4 barrels of 2-dimensional CCDs, approximately 250 CCDs in total. This detector will be used as a tracking microscope, able to pinpoint the outgoing tracks with a precision of about 5 μm, and thus to distinguish between particles produced at the primary vertex and those which result from the decay of heavy-flavour quarks (charm, bottom and possibly others) or from the decay of heavy leptons. This paper describes the present state of the VXD project, with particular emphasis on the signal processing procedures which will reduce the 60 million measurements of pixel contents for each event to a manageable level (some tens of kilobytes).

Fast determination of structurally cohesive subgroups in large networks

PubMed Central

Sinkovits, Robert S.; Moody, James; Oztan, B. Tolga; White, Douglas R.

2016-01-01

Structurally cohesive subgroups are a powerful and mathematically rigorous way to characterize network robustness. Their strength lies in the ability to detect strong connections among vertices that not only have no neighbors in common, but that may be distantly separated in the graph. Unfortunately, identifying cohesive subgroups is a computationally intensive problem, which has limited empirical assessments of cohesion to relatively small graphs of at most a few thousand vertices. We describe here an approach that exploits the properties of cliques, k-cores and vertex separators to iteratively reduce the complexity of the graph to the point where standard algorithms can be used to complete the analysis. As a proof of principle, we apply our method to the cohesion analysis of a 29,462-vertex biconnected component extracted from a 128,151-vertex co-authorship data set. PMID:28503215

Distance Domination Number of Graphs Resulting from Edge Comb Product

NASA Astrophysics Data System (ADS)

Slamin; Dafik; Angger Waspodo, Gembong

2018-05-01

Let G be a simple, finite and connected graph with a vertex-set V (G) and an edge-set E(G). For an integer 1 ≤ k ≤ diam (G), a distance k-dominating set of a connected graph G is a set S of vertices of G such that every vertex of V (G)\\S is at distance at most k from some vertex of S. The k-domination number of G, denoted by γk (G), is the minimum cardinality of a k-dominating set of G. In this paper, we determine the exact value of k-domination number of graphs resulting from an edge comb product of two graphs G 1 and G 2, where G 1 is a wheel, a friendship graph, or a triangular book and G 2 is a cycle.

Vertex detectors: The state of the art and future prospects

DOE Office of Scientific and Technical Information (OSTI.GOV)

Damerell, C.J.S.

1997-01-01

We review the current status of vertex detectors (tracking microscopes for the recognition of charm and bottom particle decays). The reasons why silicon has become the dominant detector medium are explained. Energy loss mechanisms are reviewed, as well as the physics and technology of semiconductor devices, emphasizing the areas of most relevance for detectors. The main design options (microstrips and pixel devices, both CCD`s and APS`s) are discussed, as well as the issue of radiation damage, which probably implies the need to change to detector media beyond silicon for some vertexing applications. Finally, the evolution of key performance parameters overmore » the past 15 years is reviewed, and an attempt is made to extrapolate to the likely performance of detectors working at the energy frontier ten years from now.« less

Berry phase in Heisenberg representation

NASA Technical Reports Server (NTRS)

Andreev, V. A.; Klimov, Andrei B.; Lerner, Peter B.

1994-01-01

We define the Berry phase for the Heisenberg operators. This definition is motivated by the calculation of the phase shifts by different techniques. These techniques are: the solution of the Heisenberg equations of motion, the solution of the Schrodinger equation in coherent-state representation, and the direct computation of the evolution operator. Our definition of the Berry phase in the Heisenberg representation is consistent with the underlying supersymmetry of the model in the following sense. The structural blocks of the Hamiltonians of supersymmetrical quantum mechanics ('superpairs') are connected by transformations which conserve the similarity in structure of the energy levels of superpairs. These transformations include transformation of phase of the creation-annihilation operators, which are generated by adiabatic cyclic evolution of the parameters of the system.

Increasing situation awareness of the CBRNE robot operators

NASA Astrophysics Data System (ADS)

Jasiobedzki, Piotr; Ng, Ho-Kong; Bondy, Michel; McDiarmid, Carl H.

2010-04-01

Situational awareness of CBRN robot operators is quite limited, as they rely on images and measurements from on-board detectors. This paper describes a novel framework that enables a uniform and intuitive access to live and recent data via 2D and 3D representations of visited sites. These representations are created automatically and augmented with images, models and CBRNE measurements. This framework has been developed for CBRNE Crime Scene Modeler (C2SM), a mobile CBRNE mapping system. The system creates representations (2D floor plans and 3D photorealistic models) of the visited sites, which are then automatically augmented with CBRNE detector measurements. The data stored in a database is accessed using a variety of user interfaces providing different perspectives and increasing operators' situational awareness.

Natural language generation of surgical procedures.

PubMed

Wagner, J C; Rogers, J E; Baud, R H; Scherrer, J R

1999-01-01

A number of compositional Medical Concept Representation systems are being developed. Although these provide for a detailed conceptual representation of the underlying information, they have to be translated back to natural language for used by end-users and applications. The GALEN programme has been developing one such representation and we report here on a tool developed to generate natural language phrases from the GALEN conceptual representations. This tool can be adapted to different source modelling schemes and to different destination languages or sublanguages of a domain. It is based on a multilingual approach to natural language generation, realised through a clean separation of the domain model from the linguistic model and their link by well defined structures. Specific knowledge structures and operations have been developed for bridging between the modelling 'style' of the conceptual representation and natural language. Using the example of the scheme developed for modelling surgical operative procedures within the GALEN-IN-USE project, we show how the generator is adapted to such a scheme. The basic characteristics of the surgical procedures scheme are presented together with the basic principles of the generation tool. Using worked examples, we discuss the transformation operations which change the initial source representation into a form which can more directly be translated to a given natural language. In particular, the linguistic knowledge which has to be introduced--such as definitions of concepts and relationships is described. We explain the overall generator strategy and how particular transformation operations are triggered by language-dependent and conceptual parameters. Results are shown for generated French phrases corresponding to surgical procedures from the urology domain.

Representation Elements of Spatial Thinking

NASA Astrophysics Data System (ADS)

Fiantika, F. R.

2017-04-01

This paper aims to add a reference in revealing spatial thinking. There several definitions of spatial thinking but it is not easy to defining it. We can start to discuss the concept, its basic a forming representation. Initially, the five sense catch the natural phenomenon and forward it to memory for processing. Abstraction plays a role in processing information into a concept. There are two types of representation, namely internal representation and external representation. The internal representation is also known as mental representation; this representation is in the human mind. The external representation may include images, auditory and kinesthetic which can be used to describe, explain and communicate the structure, operation, the function of the object as well as relationships. There are two main elements, representations properties and object relationships. These elements play a role in forming a representation.

40 CFR 98.4 - Authorization and responsibilities of the designated representative.

Code of Federal Regulations, 2014 CFR

2014-07-01

... Administrator of a complete certificate of representation under this section for a facility or supplier, the designated representative identified in such certificate of representation shall represent and, by his or her representations, actions, inactions, or submissions, legally bind each owner and operator of such facility or...

Edge union of networks on the same vertex set

NASA Astrophysics Data System (ADS)

Loe, Chuan Wen; Jeldtoft Jensen, Henrik

2013-06-01

Random network generators such as Erdős-Rényi, Watts-Strogatz and Barabási-Albert models are used as models to study real-world networks. Let G1(V, E1) and G2(V, E2) be two such networks on the same vertex set V. This paper studies the degree distribution and clustering coefficient of the resultant networks, G(V, E1∪E2).

On the total rainbow connection of the wheel related graphs

NASA Astrophysics Data System (ADS)

Hasan, M. S.; Slamin; Dafik; Agustin, I. H.; Alfarisi, R.

2018-04-01

Let G = (V(G), E(G)) be a nontrivial connected graph with an edge coloring c : E(G) → {1, 2, …, l}, l ɛ N, with the condition that the adjacent edges may be colored by the same colors. A path P in G is called rainbow path if no two edges of P are colored the same. The smallest number of colors that are needed to make G rainbow edge-connected is called the rainbow edge-connection of G, denoted by rc(G). A vertex-colored graph is rainbow vertex-connected if any two vertices are connected by a path whose internal vertices have distinct colors. The smallest number of colors that are needed to make G rainbow vertex-connected is called the rainbow vertex-connection of G, denoted by rvc(G). A total-colored path is total-rainbow if edges and internal vertices have distinct colours. The minimum number of colour required to color the edges and vertices of G is called the total rainbow connection number of G, denoted by trc(G). In this paper, we determine the total rainbow connection number of some wheel related graphs such as gear graph, antiweb-gear graph, infinite class of convex polytopes, sunflower graph, and closed-sunflower graph.

Evidence of ghost suppression in gluon mass scale dynamics

NASA Astrophysics Data System (ADS)

Aguilar, A. C.; Binosi, D.; Figueiredo, C. T.; Papavassiliou, J.

2018-03-01

In this work we study the impact that the ghost sector of pure Yang-Mills theories may have on the generation of a dynamical gauge boson mass scale, which hinges on the appearance of massless poles in the fundamental vertices of the theory, and the subsequent realization of the well-known Schwinger mechanism. The process responsible for the formation of such structures is itself dynamical in nature, and is governed by a set of Bethe-Salpeter type of integral equations. While in previous studies the presence of massless poles was assumed to be exclusively associated with the background-gauge three-gluon vertex, in the present analysis we allow them to appear also in the corresponding ghost-gluon vertex. The full analysis of the resulting Bethe-Salpeter system reveals that the contribution of the poles associated with the ghost-gluon vertex are particularly suppressed, their sole discernible effect being a slight modification in the running of the gluon mass scale, for momenta larger than a few GeV. In addition, we examine the behavior of the (background-gauge) ghost-gluon vertex in the limit of vanishing ghost momentum, and derive the corresponding version of Taylor's theorem. These considerations, together with a suitable Ansatz, permit us the full reconstruction of the pole sector of the two vertices involved.

Possible influence of Asian polar vertex contraction on rainfall deficits in China in autumn

NASA Astrophysics Data System (ADS)

Zhu, Xian; Wei, Zhigang; Dong, Wenjie; Li, Zhenchao; Zheng, Zhiyuan; Chen, Chen; Chen, Guangyu; Liu, Yajing

2018-06-01

The mechanisms governing variations in autumn precipitation are complicated and influenced by a number factors. This paper analyses the characteristics of autumn precipitation in China and investigates the influence of Asian polar vertex contraction on rainfall deficits in China and relevant mechanisms. Autumn precipitation decreased significantly from 1961 to 2012 in mid- and southern China, and the area of the Asia polar vortex (AAV) has decreased significantly since 1988. Asian polar vertex contraction is found to be an important factor in these autumn rainfall deficits in China through the following mechanism. Asian polar vertex contraction causes anomalously high geopotential heights in East Asia (from 25°N to 55°N) and low heights north of 65°N in the upper and lower troposphere, weakening meridional gradients in geopotential height. In the upper troposphere, the westerly and northerly winds are strengthened over high latitudes and westerly winds and the subtropical westerly jet are weakened over the East Asian mid-latitudes. In the lower troposphere, westerly winds are strengthened over high latitudes, westerly winds are weakened in East Asia and along the southern periphery of the Tibetan Plateau, and northerly winds in mid- and southern China are clearly strengthened. Hence, autumn rainfall decreases in mid- and southern China.

Partitioning sparse matrices with eigenvectors of graphs

NASA Technical Reports Server (NTRS)

Pothen, Alex; Simon, Horst D.; Liou, Kang-Pu

1990-01-01

The problem of computing a small vertex separator in a graph arises in the context of computing a good ordering for the parallel factorization of sparse, symmetric matrices. An algebraic approach for computing vertex separators is considered in this paper. It is shown that lower bounds on separator sizes can be obtained in terms of the eigenvalues of the Laplacian matrix associated with a graph. The Laplacian eigenvectors of grid graphs can be computed from Kronecker products involving the eigenvectors of path graphs, and these eigenvectors can be used to compute good separators in grid graphs. A heuristic algorithm is designed to compute a vertex separator in a general graph by first computing an edge separator in the graph from an eigenvector of the Laplacian matrix, and then using a maximum matching in a subgraph to compute the vertex separator. Results on the quality of the separators computed by the spectral algorithm are presented, and these are compared with separators obtained from other algorithms for computing separators. Finally, the time required to compute the Laplacian eigenvector is reported, and the accuracy with which the eigenvector must be computed to obtain good separators is considered. The spectral algorithm has the advantage that it can be implemented on a medium-size multiprocessor in a straightforward manner.

An asynchronous data-driven readout prototype for CEPC vertex detector

NASA Astrophysics Data System (ADS)

Yang, Ping; Sun, Xiangming; Huang, Guangming; Xiao, Le; Gao, Chaosong; Huang, Xing; Zhou, Wei; Ren, Weiping; Li, Yashu; Liu, Jianchao; You, Bihui; Zhang, Li

2017-12-01

The Circular Electron Positron Collider (CEPC) is proposed as a Higgs boson and/or Z boson factory for high-precision measurements on the Higgs boson. The precision of secondary vertex impact parameter plays an important role in such measurements which typically rely on flavor-tagging. Thus silicon CMOS Pixel Sensors (CPS) are the most promising technology candidate for a CEPC vertex detector, which can most likely feature a high position resolution, a low power consumption and a fast readout simultaneously. For the R&D of the CEPC vertex detector, we have developed a prototype MIC4 in the Towerjazz 180 nm CMOS Image Sensor (CIS) process. We have proposed and implemented a new architecture of asynchronous zero-suppression data-driven readout inside the matrix combined with a binary front-end inside the pixel. The matrix contains 128 rows and 64 columns with a small pixel pitch of 25 μm. The readout architecture has implemented the traditional OR-gate chain inside a super pixel combined with a priority arbiter tree between the super pixels, only reading out relevant pixels. The MIC4 architecture will be introduced in more detail in this paper. It will be taped out in May and will be characterized when the chip comes back.

Coverage centralities for temporal networks*

NASA Astrophysics Data System (ADS)

Takaguchi, Taro; Yano, Yosuke; Yoshida, Yuichi

2016-02-01

Structure of real networked systems, such as social relationship, can be modeled as temporal networks in which each edge appears only at the prescribed time. Understanding the structure of temporal networks requires quantifying the importance of a temporal vertex, which is a pair of vertex index and time. In this paper, we define two centrality measures of a temporal vertex based on the fastest temporal paths which use the temporal vertex. The definition is free from parameters and robust against the change in time scale on which we focus. In addition, we can efficiently compute these centrality values for all temporal vertices. Using the two centrality measures, we reveal that distributions of these centrality values of real-world temporal networks are heterogeneous. For various datasets, we also demonstrate that a majority of the highly central temporal vertices are located within a narrow time window around a particular time. In other words, there is a bottleneck time at which most information sent in the temporal network passes through a small number of temporal vertices, which suggests an important role of these temporal vertices in spreading phenomena. Contribution to the Topical Issue "Temporal Network Theory and Applications", edited by Petter Holme.Supplementary material in the form of one pdf file available from the Journal web page at http://dx.doi.org/10.1140/epjb/e2016-60498-7

Theoretical foundations of spatially-variant mathematical morphology part ii: gray-level images.

PubMed

Bouaynaya, Nidhal; Schonfeld, Dan

2008-05-01

In this paper, we develop a spatially-variant (SV) mathematical morphology theory for gray-level signals and images in the Euclidean space. The proposed theory preserves the geometrical concept of the structuring function, which provides the foundation of classical morphology and is essential in signal and image processing applications. We define the basic SV gray-level morphological operators (i.e., SV gray-level erosion, dilation, opening, and closing) and investigate their properties. We demonstrate the ubiquity of SV gray-level morphological systems by deriving a kernel representation for a large class of systems, called V-systems, in terms of the basic SV graylevel morphological operators. A V-system is defined to be a gray-level operator, which is invariant under gray-level (vertical) translations. Particular attention is focused on the class of SV flat gray-level operators. The kernel representation for increasing V-systems is a generalization of Maragos' kernel representation for increasing and translation-invariant function-processing systems. A representation of V-systems in terms of their kernel elements is established for increasing and upper-semi-continuous V-systems. This representation unifies a large class of spatially-variant linear and non-linear systems under the same mathematical framework. Finally, simulation results show the potential power of the general theory of gray-level spatially-variant mathematical morphology in several image analysis and computer vision applications.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nekrasov, Nikita; ITEP, Moscow; Shatashvili, Samson

Supersymmetric vacua of two dimensional N = 4 gauge theories with matter, softly broken by the twisted masses down to N = 2, are shown to be in one-to-one correspondence with the eigenstates of integrable spin chain Hamiltonians. Examples include: the Heisenberg SU(2)XXX spin chain which is mapped to the two dimensional U(N) theory with fundamental hypermultiplets, the XXZ spin chain which is mapped to the analogous three dimensional super-Yang-Mills theory compactified on a circle, the XYZ spin chain and eight-vertex model which are related to the four dimensional theory compactified on T{sup 2}. A consequence of our correspondence ismore » the isomorphism of the quantum cohomology ring of various quiver varieties, such as cotangent bundles to (partial) flag varieties and the ring of quantum integrals of motion of various spin chains. The correspondence extends to any spin group, representations, boundary conditions, and inhomogeneity, it includes Sinh-Gordon and non-linear Schroedinger models as well as the dynamical spin chains like Hubbard model. Compactifications of four dimensional N = 2 theories on a two-sphere lead to the instanton-corrected Bethe equations.« less

Metal cluster chemistry: Structure and stereochemistry in the polynuclear rhodium hydrides HnRhn[P(OR)3]2n

PubMed Central

Brown, R. K.; Williams, J. M.; Fredrich, M. F.; Day, V. W.; Sivak, A. J.; Muetterties, E. L.

1979-01-01

Crystallographic analyses of x-ray and neutron diffraction data have provided a definitive structural representation of {HRh[P(O-i-C3H7)3]2}2 and {HRh[P(OCH3)3]2}3. These polynuclear hydrides are generated from square planar H2Rh[P(OR)3]2 units by edge (hydrogen atom) sharing and by vertex (hydrogen atom) sharing to form the dimeric and trimeric structures, respectively. The square-planar units are held together through four-center and three-center two-electron Rh—H—Rh bonds in the dimer and trimer, respectively. The dimer and trimer molecules each add one molecule of hydrogen to form H[(i-C3H7O)3P]2RhH3Rh [P(O-i-C3H7)3]2 and H5Rh3[P(OCH3)3]6, respectively. NMR spectral information has served to define the stereochemical features of these polyhydrides. The significance of this chemistry in the metal cluster-metal surface analogy is described. PMID:16592645

Linearized self-consistent quasiparticle GW method: Application to semiconductors and simple metals

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kutepov, A. L.; Oudovenko, V. S.; Kotliar, G.

We present a code implementing the linearized self-consistent quasiparticle GW method (QSGW) in the LAPW basis. Our approach is based on the linearization of the self-energy around zero frequency which differs it from the existing implementations of the QSGW method. The linearization allows us to use Matsubara frequencies instead of working on the real axis. This results in efficiency gains by switching to the imaginary time representation in the same way as in the space time method. The all electron LAPW basis set eliminates the need for pseudopotentials. We discuss the advantages of our approach, such as its N 3more » scaling with the system size N, as well as its shortcomings. We apply our approach to study the electronic properties of selected semiconductors, insulators, and simple metals and show that our code produces the results very close to the previously published QSGW data. Our implementation is a good platform for further many body diagrammatic resummations such as the vertex-corrected GW approach and the GW+DMFT method.« less

Linearized self-consistent quasiparticle GW method: Application to semiconductors and simple metals

DOE PAGES

Kutepov, A. L.; Oudovenko, V. S.; Kotliar, G.

2017-06-23

We present a code implementing the linearized self-consistent quasiparticle GW method (QSGW) in the LAPW basis. Our approach is based on the linearization of the self-energy around zero frequency which differs it from the existing implementations of the QSGW method. The linearization allows us to use Matsubara frequencies instead of working on the real axis. This results in efficiency gains by switching to the imaginary time representation in the same way as in the space time method. The all electron LAPW basis set eliminates the need for pseudopotentials. We discuss the advantages of our approach, such as its N 3more » scaling with the system size N, as well as its shortcomings. We apply our approach to study the electronic properties of selected semiconductors, insulators, and simple metals and show that our code produces the results very close to the previously published QSGW data. Our implementation is a good platform for further many body diagrammatic resummations such as the vertex-corrected GW approach and the GW+DMFT method.« less

Betatron motion with coupling of horizontal and vertical degrees of freedom

DOE PAGES

Lebedev, V. A.; Bogacz, S. A.

2010-10-21

Presently, there are two most frequently used parameterezations of linear x-y coupled motion used in the accelerator physics. They are the Edwards-Teng and Mais-Ripken parameterizations. The article is devoted to an analysis of close relationship between the two representations, thus adding a clarity to their physical meaning. It also discusses the relationship between the eigen-vectors, the beta-functions, second order moments and the bilinear form representing the particle ellipsoid in the 4D phase space. Then, it consideres a further development of Mais-Ripken parameteresation where the particle motion is descrabed by 10 parameters: four beta-functions, four alpha-functions and two betatron phase advances.more » In comparison with Edwards-Teng parameterization the chosen parametrization has an advantage that it works equally well for analysis of coupled betatron motion in circular accelerators and in transfer lines. In addition, considered relationship between second order moments, eigen-vectors and beta-functions can be useful in interpreting tracking results and experimental data. As an example, the developed formalizm is applied to the FNAL electron cooler and Derbenev’s vertex-to-plane adapter.« less

Betatron motion with coupling of horizontal and vertical degrees of freedom

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lebedev, V. A.; Bogacz, S. A.

Presently, there are two most frequently used parameterezations of linear x-y coupled motion used in the accelerator physics. They are the Edwards-Teng and Mais-Ripken parameterizations. The article is devoted to an analysis of close relationship between the two representations, thus adding a clarity to their physical meaning. It also discusses the relationship between the eigen-vectors, the beta-functions, second order moments and the bilinear form representing the particle ellipsoid in the 4D phase space. Then, it consideres a further development of Mais-Ripken parameteresation where the particle motion is descrabed by 10 parameters: four beta-functions, four alpha-functions and two betatron phase advances.more » In comparison with Edwards-Teng parameterization the chosen parametrization has an advantage that it works equally well for analysis of coupled betatron motion in circular accelerators and in transfer lines. In addition, considered relationship between second order moments, eigen-vectors and beta-functions can be useful in interpreting tracking results and experimental data. As an example, the developed formalizm is applied to the FNAL electron cooler and Derbenev’s vertex-to-plane adapter.« less

Betatron motion with coupling of horizontal and vertical degrees of freedom

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lebedev, V.A.; /Fermilab; Bogacz, S.A.

Presently, there are two most frequently used parameterizations of linear x-y coupled motion used in the accelerator physics. They are the Edwards-Teng and Mais-Ripken parameterizations. The article is devoted to an analysis of close relationship between the two representations, thus adding a clarity to their physical meaning. It also discusses the relationship between the eigen-vectors, the beta-functions, second order moments and the bilinear form representing the particle ellipsoid in the 4D phase space. Then, it consideres a further development of Mais-Ripken parameteresation where the particle motion is described by 10 parameters: four beta-functions, four alpha-functions and two betatron phase advances.more » In comparison with Edwards-Teng parameterization the chosen parametrization has an advantage that it works equally well for analysis of coupled betatron motion in circular accelerators and in transfer lines. Considered relationship between second order moments, eigen-vectors and beta-functions can be useful in interpreting tracking results and experimental data. As an example, the developed formalizm is applied to the FNAL electron cooler and Derbenev's vertex-to-plane adapter.« less

Experience from the construction and operation of the STAR PXL detector

NASA Astrophysics Data System (ADS)

Greiner, L.; Anderssen, E. C.; Contin, G.; Schambach, J.; Silber, J.; Stezelberger, T.; Sun, X.; Szelezniak, M.; Vu, C.; Wieman, H. H.; Woodmansee, S.

2015-04-01

A new silicon based vertex detector called the Heavy Flavor Tracker (HFT) was installed at the Soleniodal Tracker At RHIC (STAR) experiment for the Relativistic Heavy Ion Collider (RHIC) 2014 heavy ion run to improve the vertex resolution and extend the measurement capabilities of STAR in the heavy flavor domain. The HFT consists of four concentric cylinders around the STAR interaction point composed of three different silicon detector technologies based on strips, pads and for the first time in an accelerator experiment CMOS monolithic active pixels (MAPS) . The two innermost layers at a radius of 2.8 cm and 8 cm from the beam line are constructed with 400 high resolution MAPS sensors arranged in 10-sensor ladders mounted on 10 thin carbon fiber sectors giving a total silicon area of 0.16 m2. Each sensor consists of a pixel array of nearly 1 million pixels with a pitch of 20.7 μm with column-level discriminators, zero-suppression circuitry and output buffer memory integrated into one silicon die with a sensitive area of ~ 3.8 cm2. The pixel (PXL) detector has a low power dissipation of 170 mW/cm2, which allows air cooling. This results in a global material budget of 0.5% radiation length per layer for detector used in this run. A novel mechanical approach to detector insertion allows for the installation and integration of the pixel sub detector within a 12 hour period during an on-going STAR run. The detector specifications, experience from the construction and operation, lessons learned and initial measurements of the PXL performance in the 200 GeV Au-Au run will be presented.

Unitary Transformations in the Quantum Model for Conceptual Conjunctions and Its Application to Data Representation

PubMed Central

Veloz, Tomas; Desjardins, Sylvie

2015-01-01

Quantum models of concept combinations have been successful in representing various experimental situations that cannot be accommodated by traditional models based on classical probability or fuzzy set theory. In many cases, the focus has been on producing a representation that fits experimental results to validate quantum models. However, these representations are not always consistent with the cognitive modeling principles. Moreover, some important issues related to the representation of concepts such as the dimensionality of the realization space, the uniqueness of solutions, and the compatibility of measurements, have been overlooked. In this paper, we provide a dimensional analysis of the realization space for the two-sector Fock space model for conjunction of concepts focusing on the first and second sectors separately. We then introduce various representation of concepts that arise from the use of unitary operators in the realization space. In these concrete representations, a pair of concepts and their combination are modeled by a single conceptual state, and by a collection of exemplar-dependent operators. Therefore, they are consistent with cognitive modeling principles. This framework not only provides a uniform approach to model an entire data set, but, because all measurement operators are expressed in the same basis, allows us to address the question of compatibility of measurements. In particular, we present evidence that it may be possible to predict non-commutative effects from partial measurements of conceptual combinations. PMID:26617556

Unitary Transformations in the Quantum Model for Conceptual Conjunctions and Its Application to Data Representation.

PubMed

Veloz, Tomas; Desjardins, Sylvie

2015-01-01

Quantum models of concept combinations have been successful in representing various experimental situations that cannot be accommodated by traditional models based on classical probability or fuzzy set theory. In many cases, the focus has been on producing a representation that fits experimental results to validate quantum models. However, these representations are not always consistent with the cognitive modeling principles. Moreover, some important issues related to the representation of concepts such as the dimensionality of the realization space, the uniqueness of solutions, and the compatibility of measurements, have been overlooked. In this paper, we provide a dimensional analysis of the realization space for the two-sector Fock space model for conjunction of concepts focusing on the first and second sectors separately. We then introduce various representation of concepts that arise from the use of unitary operators in the realization space. In these concrete representations, a pair of concepts and their combination are modeled by a single conceptual state, and by a collection of exemplar-dependent operators. Therefore, they are consistent with cognitive modeling principles. This framework not only provides a uniform approach to model an entire data set, but, because all measurement operators are expressed in the same basis, allows us to address the question of compatibility of measurements. In particular, we present evidence that it may be possible to predict non-commutative effects from partial measurements of conceptual combinations.

Effect of severity of illness on cesarean delivery rates in Washington State.

PubMed

Hitti, Jane; Walker, Suzan; Benedetti, Thomas J

2017-10-01

Hospitals and providers are increasingly held accountable for their cesarean delivery rates. In the perinatal quality improvement arena, there is vigorous debate about whether all hospitals can be held to the same benchmark for an acceptable cesarean rate regardless of patient acuity. However, the causes of variation in hospital cesarean delivery rates are not well understood. We sought to evaluate the association and temporal trends between severity of illness at admission and the primary term singleton vertex cesarean delivery rate among hospitals in Washington State. We hypothesized that hospitals with higher patient acuity would have higher cesarean delivery rates and that this pattern would persist over time. In this cross-sectional analysis, we analyzed aggregate hospital-level data for all nonmilitary hospitals in Washington State with ≥100 deliveries/y during federal fiscal years 2010 through 2014 (287,031 deliveries). Data were obtained from the Washington State Comprehensive Hospital Abstract Reporting System, which includes inpatient demographic, diagnosis, procedure, and discharge information derived from hospital billing systems. Age, admission diagnoses and procedure codes were converted to patient-level admission severity-of-illness scores using the All Patient Refined Diagnosis Related Groups classification system. This system is widely used throughout the United States to adjust hospital data for severity of illness. Mean admission hospital-level severity-of-illness scores were calculated for each fiscal year among the term singleton vertex population with no history of cesarean delivery. We used linear regression to evaluate the association between hospital admission severity of illness and the primary term singleton vertex cesarean delivery rate, calculated Pearson correlation coefficients, and compared regression line slopes and 95% confidence intervals for each fiscal year. Hospitals were diverse with respect to delivery volume, level of care, and geographic location within Washington. Hospital aggregate admission severity-of-illness score correlated with primary term singleton vertex cesarean delivery rate in all fiscal years (R 2 0.38-0.58, P < .001). For every year in the study interval, as admission severity of illness increased so did the primary term singleton vertex cesarean rate. The slope of the regression line decreased during the study interval, suggesting that statewide decrease in primary term singleton vertex cesarean rate occurred across the range of severity of illness. Admission severity-of-illness score is strongly associated with the primary term singleton vertex cesarean delivery rate among hospitals in Washington State. Approximately 50% of variation in hospital primary term singleton vertex cesarean delivery rates appeared to be related to admission severity of illness. This relationship persisted over time despite a statewide decrease in cesarean delivery, suggesting that patient acuity will likely continue to contribute to hospital variation in cesarean delivery rates despite perinatal quality improvement efforts. The major implication of this study is that patient acuity should be considered when determining optimal cesarean delivery rates. High-acuity hospitals are likely to have high cesarean rates because they provide a specific role in serving regional needs. To hold these centers to an arbitrary benchmark may jeopardize the funding necessary to support regional safety net institutions. Copyright © 2017. Published by Elsevier Inc.

Numerical operator calculus in higher dimensions

PubMed Central

Beylkin, Gregory; Mohlenkamp, Martin J.

2002-01-01

When an algorithm in dimension one is extended to dimension d, in nearly every case its computational cost is taken to the power d. This fundamental difficulty is the single greatest impediment to solving many important problems and has been dubbed the curse of dimensionality. For numerical analysis in dimension d, we propose to use a representation for vectors and matrices that generalizes separation of variables while allowing controlled accuracy. Basic linear algebra operations can be performed in this representation using one-dimensional operations, thus bypassing the exponential scaling with respect to the dimension. Although not all operators and algorithms may be compatible with this representation, we believe that many of the most important ones are. We prove that the multiparticle Schrödinger operator, as well as the inverse Laplacian, can be represented very efficiently in this form. We give numerical evidence to support the conjecture that eigenfunctions inherit this property by computing the ground-state eigenfunction for a simplified Schrödinger operator with 30 particles. We conjecture and provide numerical evidence that functions of operators inherit this property, in which case numerical operator calculus in higher dimensions becomes feasible. PMID:12140360

40 CFR 96.210 - Authorization and responsibilities of CAIR designated representative.

Code of Federal Regulations, 2012 CFR

2012-07-01

...)(4)(iv). (c) Upon receipt by the Administrator of a complete certificate of representation under § 96... representations, actions, inactions, or submissions, legally bind each owner and operator of the CAIR SO2 source... a complete certificate of representation under § 96.213 for a CAIR designated representative of the...

40 CFR 96.210 - Authorization and responsibilities of CAIR designated representative.

Code of Federal Regulations, 2013 CFR

2013-07-01

...)(4)(iv). (c) Upon receipt by the Administrator of a complete certificate of representation under § 96... representations, actions, inactions, or submissions, legally bind each owner and operator of the CAIR SO2 source... a complete certificate of representation under § 96.213 for a CAIR designated representative of the...

40 CFR 96.110 - Authorization and responsibilities of CAIR designated representative.

Code of Federal Regulations, 2012 CFR

2012-07-01

...)(4)(iv). (c) Upon receipt by the Administrator of a complete certificate of representation under § 96... representations, actions, inactions, or submissions, legally bind each owner and operator of the CAIR NOX source... received a complete certificate of representation under § 96.113 for a CAIR designated representative of...

40 CFR 96.110 - Authorization and responsibilities of CAIR designated representative.

Code of Federal Regulations, 2010 CFR

2010-07-01

...)(4)(iv). (c) Upon receipt by the Administrator of a complete certificate of representation under § 96... representations, actions, inactions, or submissions, legally bind each owner and operator of the CAIR NOX source... received a complete certificate of representation under § 96.113 for a CAIR designated representative of...

40 CFR 96.110 - Authorization and responsibilities of CAIR designated representative.

Code of Federal Regulations, 2014 CFR

2014-07-01

...)(4)(iv). (c) Upon receipt by the Administrator of a complete certificate of representation under § 96... representations, actions, inactions, or submissions, legally bind each owner and operator of the CAIR NOX source... received a complete certificate of representation under § 96.113 for a CAIR designated representative of...

40 CFR 96.210 - Authorization and responsibilities of CAIR designated representative.

Code of Federal Regulations, 2014 CFR

2014-07-01

...)(4)(iv). (c) Upon receipt by the Administrator of a complete certificate of representation under § 96... representations, actions, inactions, or submissions, legally bind each owner and operator of the CAIR SO2 source... a complete certificate of representation under § 96.213 for a CAIR designated representative of the...

40 CFR 96.110 - Authorization and responsibilities of CAIR designated representative.

Code of Federal Regulations, 2011 CFR

2011-07-01

...)(4)(iv). (c) Upon receipt by the Administrator of a complete certificate of representation under § 96... representations, actions, inactions, or submissions, legally bind each owner and operator of the CAIR NOX source... received a complete certificate of representation under § 96.113 for a CAIR designated representative of...

40 CFR 96.210 - Authorization and responsibilities of CAIR designated representative.

Code of Federal Regulations, 2011 CFR

2011-07-01

...)(4)(iv). (c) Upon receipt by the Administrator of a complete certificate of representation under § 96... representations, actions, inactions, or submissions, legally bind each owner and operator of the CAIR SO2 source... a complete certificate of representation under § 96.213 for a CAIR designated representative of the...

40 CFR 60.4110 - Authorization and Responsibilities of Hg designated representative.

Code of Federal Regulations, 2011 CFR

2011-07-01

... representation under § 60.4113, the Hg designated representative of the source shall represent and, by his or her representations, actions, inactions, or submissions, legally bind each owner and operator of the Hg Budget source... complete certificate of representation under § 60.4113 for a Hg designated representative of the source and...

40 CFR 96.110 - Authorization and responsibilities of CAIR designated representative.

Code of Federal Regulations, 2013 CFR

2013-07-01

...)(4)(iv). (c) Upon receipt by the Administrator of a complete certificate of representation under § 96... representations, actions, inactions, or submissions, legally bind each owner and operator of the CAIR NOX source... received a complete certificate of representation under § 96.113 for a CAIR designated representative of...

40 CFR 60.4110 - Authorization and Responsibilities of Hg designated representative.

Code of Federal Regulations, 2010 CFR

2010-07-01

... representation under § 60.4113, the Hg designated representative of the source shall represent and, by his or her representations, actions, inactions, or submissions, legally bind each owner and operator of the Hg Budget source... complete certificate of representation under § 60.4113 for a Hg designated representative of the source and...

New formulae for Zagreb indices

NASA Astrophysics Data System (ADS)

Cangul, Ismail Naci; Yurttas, Aysun; Togan, Muge; Cevik, Ahmet Sinan

2017-07-01

In this paper, we study with some graph descriptors also called topological indices. These descriptors are useful in determination of some properties of chemical structures and preferred to some earlier descriptors as they are more practical. Especially the first and second Zagreb indices together with the first and second multiplicative Zagreb indices are considered and they are calculated in terms of the smallest and largest vertex degrees and vertex number for some well-known classes of graphs.

Comparing Internet Probing Methodologies Through an Analysis of Large Dynamic Graphs

DTIC Science & Technology

2014-06-01

comparable Internet topologies in less time. We compare these by modeling union of traceroute outputs as graphs, and using standard graph theoretical...topologies in less time. We compare these by modeling union of traceroute outputs as graphs, and using standard graph theoretical measurements as well...We compare these by modeling union of traceroute outputs as graphs, and study the graphs by using vertex and edge count, average vertex degree

R matrices of three-state Hamiltonians solvable by coordinate Bethe ansatz

NASA Astrophysics Data System (ADS)

Fonseca, T.; Frappat, L.; Ragoucy, E.

2015-01-01

We review some of the strategies that can be implemented to infer an R-matrix from the knowledge of its Hamiltonian. We apply them to the classification achieved in Crampé, Frappat, and Ragoucy, J. Phys. A 46, 405001 (2013), on three state U(1)-invariant Hamiltonians solvable by coordinate Bethe ansatz, focusing on models for which the S-matrix is not trivial. For the 19-vertex solutions, we recover the R-matrices of the well-known Zamolodchikov-Fateev and Izergin-Korepin models. We point out that the generalized Bariev Hamiltonian is related to both main and special branches studied by Martins in Nucl. Phys. B 874, 243 (2013), that we prove to generate the same Hamiltonian. The 19-vertex SpR model still resists to the analysis, although we are able to state some no-go theorems on its R-matrix. For 17-vertex Hamiltonians, we produce a new R-matrix.

Active Vertex Model for cell-resolution description of epithelial tissue mechanics

PubMed Central

Barton, Daniel L.; Henkes, Silke

2017-01-01

We introduce an Active Vertex Model (AVM) for cell-resolution studies of the mechanics of confluent epithelial tissues consisting of tens of thousands of cells, with a level of detail inaccessible to similar methods. The AVM combines the Vertex Model for confluent epithelial tissues with active matter dynamics. This introduces a natural description of the cell motion and accounts for motion patterns observed on multiple scales. Furthermore, cell contacts are generated dynamically from positions of cell centres. This not only enables efficient numerical implementation, but provides a natural description of the T1 transition events responsible for local tissue rearrangements. The AVM also includes cell alignment, cell-specific mechanical properties, cell growth, division and apoptosis. In addition, the AVM introduces a flexible, dynamically changing boundary of the epithelial sheet allowing for studies of phenomena such as the fingering instability or wound healing. We illustrate these capabilities with a number of case studies. PMID:28665934

Effect of anomalous tbW vertex on decay-lepton distributions in e+ e-® tt(bar) and CP-violating asymmetries

NASA Astrophysics Data System (ADS)

Rindani, Saurabh D.

2000-06-01

We obtain analytic expressions for the energy and polar-angle double differential distributions of a secondary lepton l+(l-) arising from the decay of t (tbar) in with an anomalous tbW decay vertex. We also obtain analytic expressions for the various differential cross-sections with the lepton energy integrated over. In this case, we find that the angular distributions of the secondary lepton do not depend on the anomalous coupling in the decay, regardless of possible anomalous couplings occurring in the production amplitude for . Our study includes the effect of longitudinal e- and e+ beam polarization. We also study the lepton energy and beam polarization dependence of certain CP-violating lepton angular asymmetries arising from an anomalous tbW decay vertex and compare them with the asymmetries arising due to CP-violation in the production process due to the top electric or weak dipole moment.

Multifractal cross-correlation effects in two-variable time series of complex network vertex observables

NASA Astrophysics Data System (ADS)

OświÈ©cimka, Paweł; Livi, Lorenzo; DroŻdŻ, Stanisław

2016-10-01

We investigate the scaling of the cross-correlations calculated for two-variable time series containing vertex properties in the context of complex networks. Time series of such observables are obtained by means of stationary, unbiased random walks. We consider three vertex properties that provide, respectively, short-, medium-, and long-range information regarding the topological role of vertices in a given network. In order to reveal the relation between these quantities, we applied the multifractal cross-correlation analysis technique, which provides information about the nonlinear effects in coupling of time series. We show that the considered network models are characterized by unique multifractal properties of the cross-correlation. In particular, it is possible to distinguish between Erdös-Rényi, Barabási-Albert, and Watts-Strogatz networks on the basis of fractal cross-correlation. Moreover, the analysis of protein contact networks reveals characteristics shared with both scale-free and small-world models.

Active Vertex Model for cell-resolution description of epithelial tissue mechanics.

PubMed

Barton, Daniel L; Henkes, Silke; Weijer, Cornelis J; Sknepnek, Rastko

2017-06-01

We introduce an Active Vertex Model (AVM) for cell-resolution studies of the mechanics of confluent epithelial tissues consisting of tens of thousands of cells, with a level of detail inaccessible to similar methods. The AVM combines the Vertex Model for confluent epithelial tissues with active matter dynamics. This introduces a natural description of the cell motion and accounts for motion patterns observed on multiple scales. Furthermore, cell contacts are generated dynamically from positions of cell centres. This not only enables efficient numerical implementation, but provides a natural description of the T1 transition events responsible for local tissue rearrangements. The AVM also includes cell alignment, cell-specific mechanical properties, cell growth, division and apoptosis. In addition, the AVM introduces a flexible, dynamically changing boundary of the epithelial sheet allowing for studies of phenomena such as the fingering instability or wound healing. We illustrate these capabilities with a number of case studies.

Constant Communities in Complex Networks

NASA Astrophysics Data System (ADS)

Chakraborty, Tanmoy; Srinivasan, Sriram; Ganguly, Niloy; Bhowmick, Sanjukta; Mukherjee, Animesh

2013-05-01

Identifying community structure is a fundamental problem in network analysis. Most community detection algorithms are based on optimizing a combinatorial parameter, for example modularity. This optimization is generally NP-hard, thus merely changing the vertex order can alter their assignments to the community. However, there has been less study on how vertex ordering influences the results of the community detection algorithms. Here we identify and study the properties of invariant groups of vertices (constant communities) whose assignment to communities are, quite remarkably, not affected by vertex ordering. The percentage of constant communities can vary across different applications and based on empirical results we propose metrics to evaluate these communities. Using constant communities as a pre-processing step, one can significantly reduce the variation of the results. Finally, we present a case study on phoneme network and illustrate that constant communities, quite strikingly, form the core functional units of the larger communities.

Mirror-image discrimination in the literate brain: a causal role for the left occpitotemporal cortex.

PubMed

Nakamura, Kimihiro; Makuuchi, Michiru; Nakajima, Yasoichi

2014-01-01

Previous studies show that the primate and human visual system automatically generates a common and invariant representation from a visual object image and its mirror reflection. For humans, however, this mirror-image generalization seems to be partially suppressed through literacy acquisition, since literate adults have greater difficulty in recognizing mirror images of letters than those of other visual objects. At the neural level, such category-specific effect on mirror-image processing has been associated with the left occpitotemporal cortex (L-OTC), but it remains unclear whether the apparent "inhibition" on mirror letters is mediated by suppressing mirror-image representations covertly generated from normal letter stimuli. Using transcranial magnetic stimulation (TMS), we examined how transient disruption of the L-OTC affects mirror-image recognition during a same-different judgment task, while varying the semantic category (letters and non-letter objects), identity (same or different), and orientation (same or mirror-reversed) of the first and second stimuli. We found that magnetic stimulation of the L-OTC produced a significant delay in mirror-image recognition for letter-strings but not for other objects. By contrast, this category specific impact was not observed when TMS was applied to other control sites, including the right homologous area and vertex. These results thus demonstrate a causal link between the L-OTC and mirror-image discrimination in literate people. We further suggest that left-right sensitivity for letters is not achieved by a local inhibitory mechanism in the L-OTC but probably relies on the inter-regional coupling with other orientation-sensitive occipito-parietal regions.

Indoor A* Pathfinding Through an Octree Representation of a Point Cloud

NASA Astrophysics Data System (ADS)

Rodenberg, O. B. P. M.; Verbree, E.; Zlatanova, S.

2016-10-01

There is a growing demand of 3D indoor pathfinding applications. Researched in the field of robotics during the last decades of the 20th century, these methods focussed on 2D navigation. Nowadays we would like to have the ability to help people navigate inside buildings or send a drone inside a building when this is too dangerous for people. What these examples have in common is that an object with a certain geometry needs to find an optimal collision free path between a start and goal point. This paper presents a new workflow for pathfinding through an octree representation of a point cloud. We applied the following steps: 1) the point cloud is processed so it fits best in an octree; 2) during the octree generation the interior empty nodes are filtered and further processed; 3) for each interior empty node the distance to the closest occupied node directly under it is computed; 4) a network graph is computed for all empty nodes; 5) the A* pathfinding algorithm is conducted. This workflow takes into account the connectivity for each node to all possible neighbours (face, edge and vertex and all sizes). Besides, a collision avoidance system is pre-processed in two steps: first, the clearance of each empty node is computed, and then the maximal crossing value between two empty neighbouring nodes is computed. The clearance is used to select interior empty nodes of appropriate size and the maximal crossing value is used to filter the network graph. Finally, both these datasets are used in A* pathfinding.

Cell nuclei attributed relational graphs for efficient representation and classification of gastric cancer in digital histopathology

NASA Astrophysics Data System (ADS)

Sharma, Harshita; Zerbe, Norman; Heim, Daniel; Wienert, Stephan; Lohmann, Sebastian; Hellwich, Olaf; Hufnagl, Peter

2016-03-01

This paper describes a novel graph-based method for efficient representation and subsequent classification in histological whole slide images of gastric cancer. Her2/neu immunohistochemically stained and haematoxylin and eosin stained histological sections of gastric carcinoma are digitized. Immunohistochemical staining is used in practice by pathologists to determine extent of malignancy, however, it is laborious to visually discriminate the corresponding malignancy levels in the more commonly used haematoxylin and eosin stain, and this study attempts to solve this problem using a computer-based method. Cell nuclei are first isolated at high magnification using an automatic cell nuclei segmentation strategy, followed by construction of cell nuclei attributed relational graphs of the tissue regions. These graphs represent tissue architecture comprehensively, as they contain information about cell nuclei morphology as vertex attributes, along with knowledge of neighborhood in the form of edge linking and edge attributes. Global graph characteristics are derived and ensemble learning is used to discriminate between three types of malignancy levels, namely, non-tumor, Her2/neu positive tumor and Her2/neu negative tumor. Performance is compared with state of the art methods including four texture feature groups (Haralick, Gabor, Local Binary Patterns and Varma Zisserman features), color and intensity features, and Voronoi diagram and Delaunay triangulation. Texture, color and intensity information is also combined with graph-based knowledge, followed by correlation analysis. Quantitative assessment is performed using two cross validation strategies. On investigating the experimental results, it can be concluded that the proposed method provides a promising way for computer-based analysis of histopathological images of gastric cancer.

A unified development of several techniques for the representation of random vectors and data sets

NASA Technical Reports Server (NTRS)

Bundick, W. T.

1973-01-01

Linear vector space theory is used to develop a general representation of a set of data vectors or random vectors by linear combinations of orthonormal vectors such that the mean squared error of the representation is minimized. The orthonormal vectors are shown to be the eigenvectors of an operator. The general representation is applied to several specific problems involving the use of the Karhunen-Loeve expansion, principal component analysis, and empirical orthogonal functions; and the common properties of these representations are developed.

Spin-foam models and the physical scalar product

DOE Office of Scientific and Technical Information (OSTI.GOV)

Alesci, Emanuele; Centre de Physique Theorique de Luminy, Universite de la Mediterranee, F-13288 Marseille; Noui, Karim

2008-11-15

This paper aims at clarifying the link between loop quantum gravity and spin-foam models in four dimensions. Starting from the canonical framework, we construct an operator P acting on the space of cylindrical functions Cyl({gamma}), where {gamma} is the four-simplex graph, such that its matrix elements are, up to some normalization factors, the vertex amplitude of spin-foam models. The spin-foam models we are considering are the topological model, the Barrett-Crane model, and the Engle-Pereira-Rovelli model. If one of these spin-foam models provides a covariant quantization of gravity, then the associated operator P should be the so-called ''projector'' into physical statesmore » and its matrix elements should give the physical scalar product. We discuss the possibility to extend the action of P to any cylindrical functions on the space manifold.« less

The cylindrical GEM detector of the KLOE-2 experiment

NASA Astrophysics Data System (ADS)

Bencivenni, G.; Branchini, P.; Ciambrone, P.; Czerwinski, E.; De Lucia, E.; Di Cicco, A.; Domenici, D.; Felici, G.; Fermani, P.; Morello, G.

2017-07-01

The KLOE-2 experiment started its data taking campaign in November 2014 with an upgraded tracking system at the DAΦNE electron-positron collider at the Frascati National Laboratory of INFN. The new tracking device, the Inner Tracker, operated together with the KLOE-2 Drift Chamber, has been installed to improve track and vertex reconstruction capabilities of the experimental apparatus. The Inner Tracker is a cylindrical GEM detector composed of four cylindrical triple-GEM detectors, each provided with an X-V strips-pads stereo readout. Although GEM detectors are already used in high energy physics experiments, this device is considered a frontier detector due to its fully-cylindrical geometry: KLOE-2 is the first experiment benefiting of this novel detector technology. Alignment and calibration of this detector will be presented together with its operating performance and reconstruction capabilities.

Relating zeta functions of discrete and quantum graphs

NASA Astrophysics Data System (ADS)

Harrison, Jonathan; Weyand, Tracy

2018-02-01

We write the spectral zeta function of the Laplace operator on an equilateral metric graph in terms of the spectral zeta function of the normalized Laplace operator on the corresponding discrete graph. To do this, we apply a relation between the spectrum of the Laplacian on a discrete graph and that of the Laplacian on an equilateral metric graph. As a by-product, we determine how the multiplicity of eigenvalues of the quantum graph, that are also in the spectrum of the graph with Dirichlet conditions at the vertices, depends on the graph geometry. Finally we apply the result to calculate the vacuum energy and spectral determinant of a complete bipartite graph and compare our results with those for a star graph, a graph in which all vertices are connected to a central vertex by a single edge.

Evaluation of the operatorial Q-system for non-compact super spin chains

NASA Astrophysics Data System (ADS)

Frassek, Rouven; Marboe, Christian; Meidinger, David

2017-09-01

We present an approach to evaluate the full operatorial Q-system of all u(p,q\\Big|r+s) -invariant spin chains with representations of Jordan-Schwinger type. In particular, this includes the super spin chain of planar N=4 super Yang-Mills theory at one loop in the presence of a diagonal twist. Our method is based on the oscillator construction of Q-operators. The Q-operators are built as traces over Lax operators which are degenerate solutions of the Yang-Baxter equation. For non-compact representations these Lax operators may contain multiple infinite sums that conceal the form of the resulting functions. We determine these infinite sums and calculate the matrix elements of the lowest level Q-operators. Transforming the Lax operators corresponding to the Q-operators into a representation involving only finite sums allows us to take the supertrace and to obtain the explicit form of the Q-operators in terms of finite matrices for a given magnon sector. Imposing the functional relations, we then bootstrap the other Q-operators from those of the lowest level. We exemplify this approach for non-compact spin - s spin chains and apply it to N=4 at the one-loop level using the BMN vacuum as an example.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jeffrey A Appel

BTeV is a new Fermilab beauty and charm experiment designed to operate in the CZero region of the Tevatron collider. Critical to the success of BTeV is its pixel detector. The unique features of this pixel detector include its proximity to the beam, its operation with a beam crossing time of 132 ns, and the need for the detector information to be read out quickly enough to be used for the lowest level trigger. This talk presents an overview of the pixel detector design, giving the motivations for the technical choices made. The status of the current R&D on detectormore » components is also reviewed. Additional Pixel 2002 talks on the BTeV pixel detector are given by Dave Christian[1], Mayling Wong[2], and Sergio Zimmermann[3]. Table 1 gives a selection of pixel detector parameters for the ALICE, ATLAS, BTeV, and CMS experiments. Comparing the progression of this table, which I have been updating for the last several years, has shown a convergence of specifications. Nevertheless, significant differences endure. The BTeV data-driven readout, horizontal and vertical position resolution better than 9 {micro}m with the {+-} 300 mr forward acceptance, and positioning in vacuum and as close as 6 mm from the circulating beams remain unique. These features are driven by the physics goals of the BTeV experiment. Table 2 demonstrates that the vertex trigger performance made possible by these features is requisite for a very large fraction of the B meson decay physics which is so central to the motivation for BTeV. For most of the physics quantities of interest listed in the table, the vertex trigger is essential. The performance of the BTeV pixel detector may be summarized by looking at particular physics examples; e.g., the B{sub s} meson decay B{sub s} {yields} D{sub s}{sup -} K{sup +}. For that decay, studies using GEANT3 simulations provide quantitative measures of performance. For example, the separation between the B{sub s} decay point and the primary proton-antiproton interaction can be measured with an rms uncertainty of 138 {micro}m. This, with the uncertainty in the decay vertex position, leads to an uncertainty of the B{sub s} proper decay time of 46 fs. Even if the parameter x{sub s} equals 25 (where the current lower limit on x{sub s} is about 15), the corresponding relevant proper time is 400 fs. So, the detector resolution is more than adequate to make an excellent measurement of this parameter.« less

Algebraic special functions and SO(3,2)

DOE Office of Scientific and Technical Information (OSTI.GOV)

Celeghini, E., E-mail: celeghini@fi.infn.it; Olmo, M.A. del, E-mail: olmo@fta.uva.es

2013-06-15

A ladder structure of operators is presented for the associated Legendre polynomials and the sphericas harmonics. In both cases these operators belong to the irreducible representation of the Lie algebra so(3,2) with quadratic Casimir equals to −5/4. As both are also bases of square-integrable functions, the universal enveloping algebra of so(3,2) is thus shown to be homomorphic to the space of linear operators acting on the L{sup 2} functions defined on (−1,1)×Z and on the sphere S{sup 2}, respectively. The presence of a ladder structure is suggested to be the general condition to obtain a Lie algebra representation defining inmore » this way the “algebraic special functions” that are proposed to be the connection between Lie algebras and square-integrable functions so that the space of linear operators on the L{sup 2} functions is homomorphic to the universal enveloping algebra. The passage to the group, by means of the exponential map, shows that the associated Legendre polynomials and the spherical harmonics support the corresponding unitary irreducible representation of the group SO(3,2). -- Highlights: •The algebraic ladder structure is constructed for the associated Legendre polynomials (ALP). •ALP and spherical harmonics support a unitary irreducible SO(3,2)-representation. •A ladder structure is the condition to get a Lie group representation defining “algebraic special functions”. •The “algebraic special functions” connect Lie algebras and L{sup 2} functions.« less

Representations for the Generalized Drazin Inverse of the Sum in a Banach Algebra and Its Application for Some Operator Matrices

PubMed Central

Liu, Xiaoji; Qin, Xiaolan

2015-01-01

We investigate additive properties of the generalized Drazin inverse in a Banach algebra A. We find explicit expressions for the generalized Drazin inverse of the sum a + b, under new conditions on a, b ∈ A. As an application we give some new representations for the generalized Drazin inverse of an operator matrix. PMID:25729767

Representations for the generalized Drazin inverse of the sum in a Banach algebra and its application for some operator matrices.

PubMed

Liu, Xiaoji; Qin, Xiaolan

2015-01-01

We investigate additive properties of the generalized Drazin inverse in a Banach algebra A. We find explicit expressions for the generalized Drazin inverse of the sum a + b, under new conditions on a, b ∈ A. As an application we give some new representations for the generalized Drazin inverse of an operator matrix.

Multiloop amplitudes of light-cone gauge superstring field theory: odd spin structure contributions

NASA Astrophysics Data System (ADS)

Ishibashi, Nobuyuki; Murakami, Koichi

2018-03-01

We study the odd spin structure contributions to the multiloop amplitudes of light-cone gauge superstring field theory. We show that they coincide with the amplitudes in the conformal gauge with two of the vertex operators chosen to be in the pictures different from the standard choice, namely (-1, -1) picture in the type II case and -1 picture in the heterotic case. We also show that the contact term divergences can be regularized in the same way as in the amplitudes for the even structures and we get the amplitudes which coincide with those obtained from the first-quantized approach.

Poisson equation for the Mercedes diagram in string theory at genus one

NASA Astrophysics Data System (ADS)

Basu, Anirban

2016-03-01

The Mercedes diagram has four trivalent vertices which are connected by six links such that they form the edges of a tetrahedron. This three-loop Feynman diagram contributes to the {D}12{{ R }}4 amplitude at genus one in type II string theory, where the vertices are the points of insertion of the graviton vertex operators, and the links are the scalar propagators on the toroidal worldsheet. We obtain a modular invariant Poisson equation satisfied by the Mercedes diagram, where the source terms involve one- and two-loop Feynman diagrams. We calculate its contribution to the {D}12{{ R }}4 amplitude.

The In-Transit Vigilant Covering Tour Problem of Routing Unmanned Ground Vehicles

DTIC Science & Technology

2012-08-01

of vertices in both vertex sets V and W, rather than exclusively in the vertex set V. A metaheuristic algorithm which follows the Greedy Randomized...window (VRPTW) approach, with the application of Java-encoded metaheuristic , was used [O’Rourke et al., 2001] for the dynamic routing of UAVs. Harder et...minimize both the two conflicting objectives; tour length and the coverage distance via a multi-objective evolutionary algorithm . This approach avoids a

Study for online range monitoring with the interaction vertex imaging method.

PubMed

Finck, Ch; Karakaya, Y; Reithinger, V; Rescigno, R; Baudot, J; Constanzo, J; Juliani, D; Krimmer, J; Rinaldi, I; Rousseau, M; Testa, E; Vanstalle, M; Ray, C

2017-11-21

Ion beam therapy enables a highly accurate dose conformation delivery to the tumor due to the finite range of charged ions in matter (i.e. Bragg peak (BP)). Consequently, the dose profile is very sensitive to patients anatomical changes as well as minor mispositioning, and so it requires improved dose control techniques. Proton interaction vertex imaging (IVI) could offer an online range control in carbon ion therapy. In this paper, a statistical method was used to study the sensitivity of the IVI technique on experimental data obtained from the Heidelberg Ion-Beam Therapy Center. The vertices of secondary protons were reconstructed with pixelized silicon detectors. The statistical study used the [Formula: see text] test of the reconstructed vertex distributions for a given displacement of the BP position as a function of the impinging carbon ions. Different phantom configurations were used with or without bone equivalent tissue and air inserts. The inflection points in the fall-off region of the longitudinal vertex distribution were computed using different methods, while the relation with the BP position was established. In the present setup, the resolution of the BP position was about 4-5 mm in the homogeneous phantom under clinical conditions (10 6 incident carbon ions). Our results show that the IVI method could therefore monitor the BP position with a promising resolution in clinical conditions.

Clinical outcomes after external cephalic version with spinal anesthesia after failure of a first attempt without anesthesia.

PubMed

Massalha, Manal; Garmi, Gali; Zafran, Noah; Carmeli, Julia; Gimburg, Genady; Salim, Raed

2017-12-01

To determine whether repeat external cephalic version (ECV) with spinal anesthesia affects clinical outcomes and cesarean delivery rates. A retrospective study was conducted using data collected at one hospital in Israel between January 1, 2009, and December 31, 2015. Women with non-vertex singleton pregnancies (≥37 weeks) who had a failed ECV attempt without spinal anesthesia were included in the analysis. All women were offered a repeat ECV with spinal anesthesia. Outcomes assessed were rates of vertex presentation at delivery, successful repeat ECV, and cesarean delivery. Overall, 145 of 213 ECV attempts without spinal anesthesia were successful. Of the 68 women with a failed attempt, 5 (7%) experienced spontaneous version and 18 (26%) delivered at another institution or went into spontaneous labor. Among the remaining 45 women, 28 (62%) agreed to a repeat ECV with spinal anesthesia; 11 (39%) of these procedures were successful. All 11 women experienced vertex presentation at delivery versus none of the 17 women who refused repeat ECV (P=0.003). The cesarean delivery rate was 64% (18/28) versus 100% (17/17), respectively (P=0.007). Repeat ECV with spinal anesthesia after a failed first attempt without spinal anesthesia increased vertex presentation at birth and decreased the rate of cesarean delivery. © 2017 International Federation of Gynecology and Obstetrics.

Study for online range monitoring with the interaction vertex imaging method

NASA Astrophysics Data System (ADS)

Finck, Ch; Karakaya, Y.; Reithinger, V.; Rescigno, R.; Baudot, J.; Constanzo, J.; Juliani, D.; Krimmer, J.; Rinaldi, I.; Rousseau, M.; Testa, E.; Vanstalle, M.; Ray, C.

2017-12-01

Ion beam therapy enables a highly accurate dose conformation delivery to the tumor due to the finite range of charged ions in matter (i.e. Bragg peak (BP)). Consequently, the dose profile is very sensitive to patients anatomical changes as well as minor mispositioning, and so it requires improved dose control techniques. Proton interaction vertex imaging (IVI) could offer an online range control in carbon ion therapy. In this paper, a statistical method was used to study the sensitivity of the IVI technique on experimental data obtained from the Heidelberg Ion-Beam Therapy Center. The vertices of secondary protons were reconstructed with pixelized silicon detectors. The statistical study used the χ2 test of the reconstructed vertex distributions for a given displacement of the BP position as a function of the impinging carbon ions. Different phantom configurations were used with or without bone equivalent tissue and air inserts. The inflection points in the fall-off region of the longitudinal vertex distribution were computed using different methods, while the relation with the BP position was established. In the present setup, the resolution of the BP position was about 4-5 mm in the homogeneous phantom under clinical conditions (106 incident carbon ions). Our results show that the IVI method could therefore monitor the BP position with a promising resolution in clinical conditions.

Fusion of Positive Energy Representations of LSpin(2n)

NASA Astrophysics Data System (ADS)

Toledano-Laredo, V.

2004-09-01

Building upon the Jones-Wassermann program of studying Conformal Field Theory using operator algebraic tools, and the work of A. Wassermann on the loop group of LSU(n) (Invent. Math. 133 (1998), 467-538), we give a solution to the problem of fusion for the loop group of Spin(2n). Our approach relies on the use of A. Connes' tensor product of bimodules over a von Neumann algebra to define a multiplicative operation (Connes fusion) on the (integrable) positive energy representations of a given level. The notion of bimodules arises by restricting these representations to loops with support contained in an interval I of the circle or its complement. We study the corresponding Grothendieck ring and show that fusion with the vector representation is given by the Verlinde rules. The computation rests on 1) the solution of a 6-parameter family of Knizhnik-Zamolodchikhov equations and the determination of its monodromy, 2) the explicit construction of the primary fields of the theory, which allows to prove that they define operator-valued distributions and 3) the algebraic theory of superselection sectors developed by Doplicher-Haag-Roberts.

SIMD Optimization of Linear Expressions for Programmable Graphics Hardware

PubMed Central

Bajaj, Chandrajit; Ihm, Insung; Min, Jungki; Oh, Jinsang

2009-01-01

The increased programmability of graphics hardware allows efficient graphical processing unit (GPU) implementations of a wide range of general computations on commodity PCs. An important factor in such implementations is how to fully exploit the SIMD computing capacities offered by modern graphics processors. Linear expressions in the form of ȳ = Ax̄ + b̄, where A is a matrix, and x̄, ȳ and b̄ are vectors, constitute one of the most basic operations in many scientific computations. In this paper, we propose a SIMD code optimization technique that enables efficient shader codes to be generated for evaluating linear expressions. It is shown that performance can be improved considerably by efficiently packing arithmetic operations into four-wide SIMD instructions through reordering of the operations in linear expressions. We demonstrate that the presented technique can be used effectively for programming both vertex and pixel shaders for a variety of mathematical applications, including integrating differential equations and solving a sparse linear system of equations using iterative methods. PMID:19946569

Silicon technologies for the CLIC vertex detector

NASA Astrophysics Data System (ADS)

Spannagel, S.

2017-06-01

CLIC is a proposed linear e+e- collider designed to provide particle collisions at center-of-mass energies of up to 3 TeV. Precise measurements of the properties of the top quark and the Higgs boson, as well as searches for Beyond the Standard Model physics require a highly performant CLIC detector. In particular the vertex detector must provide a single point resolution of only a few micrometers while not exceeding the envisaged material budget of around 0.2% X0 per layer. Beam-beam interactions and beamstrahlung processes impose an additional requirement on the timestamping capabilities of the vertex detector of about 10 ns. These goals can only be met by using novel techniques in the sensor and ASIC design as well as in the detector construction. The R&D program for the CLIC vertex detector explores various technologies in order to meet these demands. The feasibility of planar sensors with a thickness of 50-150 μm, including different active edge designs, are evaluated using Timepix3 ASICs. First prototypes of the CLICpix readout ASIC, implemented in 65 nm CMOS technology and with a pixel size of 25×25μm 2, have been produced and tested in particle beams. An updated version of the ASIC with a larger pixel matrix and improved precision of the time-over-threshold and time-of-arrival measurements has been submitted. Different hybridization concepts have been developed for the interconnection between the sensor and readout ASIC, ranging from small-pitch bump bonding of planar sensors to capacitive coupling of active HV-CMOS sensors. Detector simulations based on Geant 4 and TCAD are compared with experimental results to assess and optimize the performance of the various designs. This contribution gives an overview of the R&D program undertaken for the CLIC vertex detector and presents performance measurements of the prototype detectors currently under investigation.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mueller, Bernhard; Janka, Hans-Thomas; Dimmelmeier, Harald, E-mail: bjmuellr@mpa-garching.mpg.d, E-mail: thj@mpa-garching.mpg.d, E-mail: harrydee@mpa-garching.mpg.d

We present a new general relativistic code for hydrodynamical supernova simulations with neutrino transport in spherical and azimuthal symmetry (one dimension and two dimensions, respectively). The code is a combination of the COCONUT hydro module, which is a Riemann-solver-based, high-resolution shock-capturing method, and the three-flavor, fully energy-dependent VERTEX scheme for the transport of massless neutrinos. VERTEX integrates the coupled neutrino energy and momentum equations with a variable Eddington factor closure computed from a model Boltzmann equation and uses the 'ray-by-ray plus' approximation in two dimensions, assuming the neutrino distribution to be axially symmetric around the radial direction at every pointmore » in space, and thus the neutrino flux to be radial. Our spacetime treatment employs the Arnowitt-Deser-Misner 3+1 formalism with the conformal flatness condition for the spatial three metric. This approach is exact for the one-dimensional case and has previously been shown to yield very accurate results for spherical and rotational stellar core collapse. We introduce new formulations of the energy equation to improve total energy conservation in relativistic and Newtonian hydro simulations with grid-based Eulerian finite-volume codes. Moreover, a modified version of the VERTEX scheme is developed that simultaneously conserves energy and lepton number in the neutrino transport with better accuracy and higher numerical stability in the high-energy tail of the spectrum. To verify our code, we conduct a series of tests in spherical symmetry, including a detailed comparison with published results of the collapse, shock formation, shock breakout, and accretion phases. Long-time simulations of proto-neutron star cooling until several seconds after core bounce both demonstrate the robustness of the new COCONUT-VERTEX code and show the approximate treatment of relativistic effects by means of an effective relativistic gravitational potential as in PROMETHEUS-VERTEX to be remarkably accurate in spherical symmetry.« less

DOE Office of Scientific and Technical Information (OSTI.GOV)

Aranda, J. I.; Tututi, E. S.; Flores-Tlalpa, A.

Higgs mediated flavor violating electromagnetic interactions, induced at the one-loop level by a nondiagonal Hf{sub i}f{sub j} vertex, with f{sub i} and f{sub j} charged leptons or quarks, are studied within the context of a completely general effective Yukawa sector that comprises SU{sub L}(2)xU{sub Y}(1)-invariant operators of up to dimension-six. Exact formulae for the one-loop {gamma}f{sub i}f{sub j} and {gamma}{gamma}f{sub i}f{sub j} couplings are presented and their related processes used to study the phenomena of Higgs mediated lepton flavor violation. The experimental limit on the {mu}{yields}e{gamma} decay is used to derive a bound on the branching ratio of the {mu}{yields}e{gamma}{gamma}more » transition, which is 6 orders of magnitude stronger than the current experimental limit. Previous results on the {tau}{yields}{mu}{gamma} and {tau}{yields}{mu}{gamma}{gamma} decays are reproduced. The possibility of detecting signals of lepton flavor violation at {gamma}{gamma} colliders is explored through the {gamma}{gamma}{yields}l{sub i}l{sub j} reaction, putting special emphasis on the {tau}{mu} final state. Using the bound imposed on the H{tau}{mu} vertex by the current experimental data on the muon anomalous magnetic moment, it is found that about half a hundred events may be produced in the International Linear Collider.« less

LHCb VELO upgrade

NASA Astrophysics Data System (ADS)

Hennessy, Karol; LHCb VELO Upgrade Collaboration

2017-02-01

The upgrade of the LHCb experiment, scheduled for LHC Run-III, scheduled to start in 2021, will transform the experiment to a trigger-less system reading out the full detector at 40 MHz event rate. All data reduction algorithms will be executed in a high-level software farm enabling the detector to run at luminosities of 2×1033 cm-2 s-1. The Vertex Locator (VELO) is the silicon vertex detector surrounding the interaction region. The current detector will be replaced with a hybrid pixel system equipped with electronics capable of reading out at 40 MHz. The upgraded VELO will provide fast pattern recognition and track reconstruction to the software trigger. The silicon pixel sensors have 55×55 μm2 pitch, and are read out by the VeloPix ASIC, from the Timepix/Medipix family. The hottest region will have pixel hit rates of 900 Mhits/s yielding a total data rate of more than 3 Tbit/s for the upgraded VELO. The detector modules are located in a separate vacuum, separated from the beam vacuum by a thin custom made foil. The foil will be manufactured through milling and possibly thinned further by chemical etching. The material budget will be minimised by the use of evaporative CO2 coolant circulating in microchannels within 400 μm thick silicon substrates. The current status of the VELO upgrade is described and latest results from operation of irradiated sensor assemblies are presented.

Estimation of the refractive index of rigid contact lenses on the basis of back vertex power measurements.

PubMed

Pearson, Richard

2011-03-01

To assess the possibility of estimating the refractive index of rigid contact lenses on the basis of measurements of their back vertex power (BVP) in air and when immersed in liquid. First, a spreadsheet model was used to quantify the magnitude of errors arising from simulated inaccuracies in the variables required to calculate refractive index. Then, refractive index was calculated from in-air and in-liquid measurements of BVP of 21 lenses that had been made in three negative BVPs from materials with seven different nominal refractive index values. The power measurements were made by two operators on two occasions. Intraobserver reliability showed a mean difference of 0.0033±0.0061 (t = 0.544, P = 0.59), interobserver reliability showed a mean difference of 0.0043±0.0061 (t = 0.707, P = 0.48), and the mean difference between the nominal and calculated refractive index values was -0.0010±0.0111 (t = -0.093, P = 0.93). The spreadsheet prediction that low-powered lenses might be subject to greater errors in the calculated values of refractive index was substantiated by the experimental results. This method shows good intra and interobserver reliabilities and can be used easily in a clinical setting to provide an estimate of the refractive index of rigid contact lenses having a BVP of 3 D or more.

Quantum mechanics of a constrained particle on an ellipsoid: Bein formalism and Geometric momentum

DOE Office of Scientific and Technical Information (OSTI.GOV)

Panahi, H., E-mail: t-panahi@guilan.ac.ir; Jahangiri, L., E-mail: laleh.jahangiry@yahoo.com

2016-09-15

In this work we apply the Dirac method in order to obtain the classical relations for a particle on an ellipsoid. We also determine the quantum mechanical form of these relations by using Dirac quantization. Then by considering the canonical commutation relations between the position and momentum operators in terms of curved coordinates, we try to propose the suitable representations for momentum operator that satisfy the obtained commutators between position and momentum in Euclidean space. We see that our representations for momentum operators are the same as geometric one.

Integral representations on supermanifolds: super Hodge duals, PCOs and Liouville forms

NASA Astrophysics Data System (ADS)

Castellani, Leonardo; Catenacci, Roberto; Grassi, Pietro Antonio

2017-01-01

We present a few types of integral transforms and integral representations that are very useful for extending to supergeometry many familiar concepts of differential geometry. Among them we discuss the construction of the super Hodge dual, the integral representation of picture changing operators of string theories and the construction of the super-Liouville form of a symplectic supermanifold.

Phase separation in the six-vertex model with a variety of boundary conditions

NASA Astrophysics Data System (ADS)

Lyberg, I.; Korepin, V.; Ribeiro, G. A. P.; Viti, J.

2018-05-01

We present numerical results for the six-vertex model with a variety of boundary conditions. Adapting an algorithm for domain wall boundary conditions, proposed in the work of Allison and Reshetikhin [Ann. Inst. Fourier 55(6), 1847-1869 (2005)], we examine some modifications of these boundary conditions. To be precise, we discuss partial domain wall boundary conditions, reflecting ends, and half turn boundary conditions (domain wall boundary conditions with half turn symmetry). Dedicated to the memory of Ludwig Faddeev

Effective-range parameters and vertex constants for Λ-nuclear systems

NASA Astrophysics Data System (ADS)

Rakityansky, S. A.; Gopane, I. M.

For a wide range of the core-nuclei (6 ≤ A ≤ 207), the scattering lengths, effective radii, and the other effective-range parameters (up to the order ˜ k8) for the angular momentum ℓ = 0, 1, 2 are calculated within a two-body ΛA-model. For the same hypernuclear systems, the S-matrix residues as well as the corresponding Nuclear-Vertex and Asymptotic-Normalization constants (NVC’s and ANC’s) for the bound states are also found.

Extending the Riemann-Solver-Free High-Order Space-Time Discontinuous Galerkin Cell Vertex Scheme (DG-CVS) to Solve Compressible Magnetohydrodynamics Equations

DTIC Science & Technology

2016-06-08

forces. Plasmas in hypersonic and astrophysical flows are one of the most typical examples of such conductive fluids. Though MHD models are a low...remain powerful tools in helping researchers to understand the complex physical processes in the geospace environment. For example, the ideal MHD...vertex level within each physical time step. For this reason and the method’s DG ingredient, the method was named as the space-time discontinuous Galerkin

Topological vertex formalism with O5-plane

NASA Astrophysics Data System (ADS)

Kim, Sung-Soo; Yagi, Futoshi

2018-01-01

We propose a new topological vertex formalism for a type IIB (p ,q ) 5-brane web with an O5-plane. We apply our proposal to five-dimensional N =1 Sp(1) gauge theory with Nf=0 , 1, 8 flavors to compute the topological string partition functions and check the agreement with the known results. Especially for the Nf=8 case, which corresponds to E-string theory on a circle, we obtain a new, yet simple, expression of the partition function with a two Young diagram sum.

Multiloop Functional Renormalization Group That Sums Up All Parquet Diagrams

NASA Astrophysics Data System (ADS)

Kugler, Fabian B.; von Delft, Jan

2018-02-01

We present a multiloop flow equation for the four-point vertex in the functional renormalization group (FRG) framework. The multiloop flow consists of successive one-loop calculations and sums up all parquet diagrams to arbitrary order. This provides substantial improvement of FRG computations for the four-point vertex and, consequently, the self-energy. Using the x-ray-edge singularity as an example, we show that solving the multiloop FRG flow is equivalent to solving the (first-order) parquet equations and illustrate this with numerical results.

Generic construction of efficient matrix product operators

NASA Astrophysics Data System (ADS)

Hubig, C.; McCulloch, I. P.; Schollwöck, U.

2017-01-01

Matrix product operators (MPOs) are at the heart of the second-generation density matrix renormalization group (DMRG) algorithm formulated in matrix product state language. We first summarize the widely known facts on MPO arithmetic and representations of single-site operators. Second, we introduce three compression methods (rescaled SVD, deparallelization, and delinearization) for MPOs and show that it is possible to construct efficient representations of arbitrary operators using MPO arithmetic and compression. As examples, we construct powers of a short-ranged spin-chain Hamiltonian, a complicated Hamiltonian of a two-dimensional system and, as proof of principle, the long-range four-body Hamiltonian from quantum chemistry.

Phase operator problem and macroscopic extension of quantum mechanics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ozawa, M.

1997-06-01

To find the Hermitian phase operator of a single-mode electromagnetic field in quantum mechanics, the Schr{umlt o}dinger representation is extended to a larger Hilbert space augmented by states with infinite excitation by nonstandard analysis. The Hermitian phase operator is shown to exist on the extended Hilbert space. This operator is naturally considered as the controversial limit of the approximate phase operators on finite dimensional spaces proposed by Pegg and Barnett. The spectral measure of this operator is a Naimark extension of the optimal probability operator-valued measure for the phase parameter found by Helstrom. Eventually, the two promising approaches to themore » statistics of the phase in quantum mechanics are synthesized by means of the Hermitian phase operator in the macroscopic extension of the Schr{umlt o}dinger representation. {copyright} 1997 Academic Press, Inc.« less

Studies for a 10 μs, thin, high resolution CMOS pixel sensor for future vertex detectors

NASA Astrophysics Data System (ADS)

Voutsinas, G.; Amar-Youcef, S.; Baudot, J.; Bertolone, G.; Brogna, A.; Chon-Sen, N.; Claus, G.; Colledani, C.; Dorokhov, A.; Dozière, G.; Dulinski, W.; Degerli, Y.; De Masi, R.; Deveaux, M.; Gelin, M.; Goffe, M.; Hu-Guo, Ch.; Himmi, A.; Jaaskelainen, K.; Koziel, M.; Morel, F.; Müntz, C.; Orsini, F.; Santos, C.; Schrader, C.; Specht, M.; Stroth, J.; Valin, I.; Wagner, F. M.; Winter, M.

2011-06-01

Future high energy physics (HEP) experiments require detectors with unprecedented performances for track and vertex reconstruction. These requirements call for high precision sensors, with low material budget and short integration time. The development of CMOS sensors for HEP applications was initiated at IPHC Strasbourg more than 10 years ago, motivated by the needs for vertex detectors at the International Linear Collider (ILC) [R. Turchetta et al, NIM A 458 (2001) 677]. Since then several other applications emerged. The first real scale digital CMOS sensor MIMOSA26 equips Flavour Tracker at RHIC, as well as for the microvertex detector of the CBM experiment at FAIR. MIMOSA sensors may also offer attractive performances for the ALICE upgrade at LHC. This paper will demonstrate the substantial performance improvement of CMOS sensors based on a high resistivity epitaxial layer. First studies for integrating the sensors into a detector system will be addressed and finally the way to go to a 10 μs readout sensor will be discussed.

Testing V-A in Top Decay at CDF at √s = 1.8 TeV

NASA Astrophysics Data System (ADS)

Kilminster, Ben

2004-02-01

The structure of the tbW vertex can be probed by measuring the polarization of the W in t → W + b → l + ν + b. The invariant mass of the the lepton and b quark measures the W decay angle which in turn allows a comparison with polarizations expected from a V-A and V+A tbW vertex. We measure the fraction by rate of Ws produced with a V+A coupling in lieu of the Standard Model V-A to be fV+A = -0.21-0.24+0.42 (stat) ± 0.21 (sys). We assign a limit of fV+A < 0.80 @ 95% CL. By combining this result with a complementary observable in the same data, we assign a limit of fV+A < 0.61 @ 95% CL. From this CDF Run I preliminary result, we find no evidence for a non-standard Model tbW vertex.

Symmetric functions and wavefunctions of XXZ-type six-vertex models and elliptic Felderhof models by Izergin-Korepin analysis

NASA Astrophysics Data System (ADS)

Motegi, Kohei

2018-05-01

We present a method to analyze the wavefunctions of six-vertex models by extending the Izergin-Korepin analysis originally developed for domain wall boundary partition functions. First, we apply the method to the case of the basic wavefunctions of the XXZ-type six-vertex model. By giving the Izergin-Korepin characterization of the wavefunctions, we show that these wavefunctions can be expressed as multiparameter deformations of the quantum group deformed Grothendieck polynomials. As a second example, we show that the Izergin-Korepin analysis is effective for analysis of the wavefunctions for a triangular boundary and present the explicit forms of the symmetric functions representing these wavefunctions. As a third example, we apply the method to the elliptic Felderhof model which is a face-type version and an elliptic extension of the trigonometric Felderhof model. We show that the wavefunctions can be expressed as one-parameter deformations of an elliptic analog of the Vandermonde determinant and elliptic symmetric functions.

All-reflective optical target illumination system with high numerical aperture

DOEpatents

Sigler, Robert D.

1978-01-01

An all-reflective optical system for providing illumination of a target focal region at high numerical aperture from a pair of co-axially, confluent collimated light beams. A target cavity is defined by a pair of opposed inner ellipsoidal reflectors having respective first focal points within a target region and second focal points at a vertex opening in the opposing reflector. Outwardly of each inner reflector is the opposed combination of a spherical reflector, and an outer generally ellipsoidal reflector having an aberrated first focal point coincident with the focus of the opposing spherical reflector and a second focal point coincident with the second focal point of the opposing inner ellipsoidal reflector through a vertex opening in the spherical reflector. The confluent collimated beams are incident through vertex openings in the outer ellipsoidal reflectors onto respective opposing spherical reflectors. Each beam is reflected by the associated spherical reflector onto the opposing outer ellipsoidal reflector and focused thereby onto the opposing inner ellipsoidal reflector, and then onto the target region.

The NLO jet vertex in the small-cone approximation for kt and cone algorithms

NASA Astrophysics Data System (ADS)

Colferai, D.; Niccoli, A.

2015-04-01

We determine the jet vertex for Mueller-Navelet jets and forward jets in the small-cone approximation for two particular choices of jet algoritms: the kt algorithm and the cone algorithm. These choices are motivated by the extensive use of such algorithms in the phenomenology of jets. The differences with the original calculations of the small-cone jet vertex by Ivanov and Papa, which is found to be equivalent to a formerly algorithm proposed by Furman, are shown at both analytic and numerical level, and turn out to be sizeable. A detailed numerical study of the error introduced by the small-cone approximation is also presented, for various observables of phenomenological interest. For values of the jet "radius" R = 0 .5, the use of the small-cone approximation amounts to an error of about 5% at the level of cross section, while it reduces to less than 2% for ratios of distributions such as those involved in the measure of the azimuthal decorrelation of dijets.

Origami building blocks: Generic and special four-vertices

NASA Astrophysics Data System (ADS)

Waitukaitis, Scott; van Hecke, Martin

2016-02-01

Four rigid panels connected by hinges that meet at a point form a four-vertex, the fundamental building block of origami metamaterials. Most materials designed so far are based on the same four-vertex geometry, and little is known regarding how different geometries affect folding behavior. Here we systematically categorize and analyze the geometries and resulting folding motions of Euclidean four-vertices. Comparing the relative sizes of sector angles, we identify three types of generic vertices and two accompanying subtypes. We determine which folds can fully close and the possible mountain-valley assignments. Next, we consider what occurs when sector angles or sums thereof are set equal, which results in 16 special vertex types. One of these, flat-foldable vertices, has been studied extensively, but we show that a wide variety of qualitatively different folding motions exist for the other 15 special and 3 generic types. Our work establishes a straightforward set of rules for understanding the folding motion of both generic and special four-vertices and serves as a roadmap for designing origami metamaterials.

Origami building blocks: Generic and special four-vertices.

PubMed

Waitukaitis, Scott; van Hecke, Martin

2016-02-01

Four rigid panels connected by hinges that meet at a point form a four-vertex, the fundamental building block of origami metamaterials. Most materials designed so far are based on the same four-vertex geometry, and little is known regarding how different geometries affect folding behavior. Here we systematically categorize and analyze the geometries and resulting folding motions of Euclidean four-vertices. Comparing the relative sizes of sector angles, we identify three types of generic vertices and two accompanying subtypes. We determine which folds can fully close and the possible mountain-valley assignments. Next, we consider what occurs when sector angles or sums thereof are set equal, which results in 16 special vertex types. One of these, flat-foldable vertices, has been studied extensively, but we show that a wide variety of qualitatively different folding motions exist for the other 15 special and 3 generic types. Our work establishes a straightforward set of rules for understanding the folding motion of both generic and special four-vertices and serves as a roadmap for designing origami metamaterials.

A geometric construction of the Riemann scalar curvature in Regge calculus

NASA Astrophysics Data System (ADS)

McDonald, Jonathan R.; Miller, Warner A.

2008-10-01

The Riemann scalar curvature plays a central role in Einstein's geometric theory of gravity. We describe a new geometric construction of this scalar curvature invariant at an event (vertex) in a discrete spacetime geometry. This allows one to constructively measure the scalar curvature using only clocks and photons. Given recent interest in discrete pre-geometric models of quantum gravity, we believe is it ever so important to reconstruct the curvature scalar with respect to a finite number of communicating observers. This derivation makes use of a new fundamental lattice cell built from elements inherited from both the original simplicial (Delaunay) spacetime and its circumcentric dual (Voronoi) lattice. The orthogonality properties between these two lattices yield an expression for the vertex-based scalar curvature which is strikingly similar to the corresponding hinge-based expression in Regge calculus (deficit angle per unit Voronoi dual area). In particular, we show that the scalar curvature is simply a vertex-based weighted average of deficits per weighted average of dual areas.

Measuring the Scalar Curvature with Clocks and Photons: Voronoi-Delaunay Lattices in Regge Calculus

NASA Astrophysics Data System (ADS)

Miller, Warner; McDonald, Jonathan

2008-04-01

The Riemann scalar curvature plays a central role in Einstein's geometric theory of gravity. We describe a new geometric construction of this scalar curvature invariant at an event (vertex) in a discrete spacetime geometry. This allows one to constructively measure the scalar curvature using only clocks and photons. Given recent interest in discrete pre-geometric models of quantum gravity, we believe it is ever so important to reconstruct the curvature scalar with respect to a finite number of communicating observers. This derivation makes use of a fundamental lattice cell built from elements inherited from both the original simplicial (Delaunay) spacetime and its circumcentric dual (Voronoi) lattice. The orthogonality properties between these two lattices yield an expression for the vertex-based scalar curvature which is strikingly similar to the corresponding hinge-based expression in Regge Calculus (deficit angle per unit Voronoi dual area). In particular, we show that the scalar curvature is simply a vertex-based weighted average of deficits per weighted average of dual areas.

Transversal Fluctuations of the ASEP, Stochastic Six Vertex Model, and Hall-Littlewood Gibbsian Line Ensembles

NASA Astrophysics Data System (ADS)

Corwin, Ivan; Dimitrov, Evgeni

2018-05-01

We consider the ASEP and the stochastic six vertex model started with step initial data. After a long time, T, it is known that the one-point height function fluctuations for these systems are of order T 1/3. We prove the KPZ prediction of T 2/3 scaling in space. Namely, we prove tightness (and Brownian absolute continuity of all subsequential limits) as T goes to infinity of the height function with spatial coordinate scaled by T 2/3 and fluctuations scaled by T 1/3. The starting point for proving these results is a connection discovered recently by Borodin-Bufetov-Wheeler between the stochastic six vertex height function and the Hall-Littlewood process (a certain measure on plane partitions). Interpreting this process as a line ensemble with a Gibbsian resampling invariance, we show that the one-point tightness of the top curve can be propagated to the tightness of the entire curve.

The sPHENIX Experiment

NASA Astrophysics Data System (ADS)

Pérez Lara, Carlos E.

2018-02-01

Our understanding of QCD under extreme conditions has advanced tremendously in the last 20 years with the discovery of the Quark Gluon Plasma and its characterisation in heavy ion collisions at RHIC and LHC. The sPHENIX detector planned at RHIC is designed to further study the microscopic nature of the QGP through precision measurements of jet, upsilon and open heavy flavor probes over a broad pT range. The multi-year sPHENIX physics program will commence in early 2023, using state-of-the art detector technologies to fully exploit the highest RHIC luminosities. The experiment incorporates the 1.4 T former BaBar solenoid magnet, and will feature high precision tracking and vertexing capabilities, provided by a compact TPC, Si-strip intermediate tracker and MAPS vertex detector. This is complemented by highly granular electromagnetic and hadronic calorimetry with full azimuthal coverage. In this document I describe the sPHENIX detector design and physics program, with particular emphasis on the comprehensive open heavy flavour program enabled by the experiment's large coverage, high rate capability and precision vertexing.

Coupled dynamics in gluon mass generation and the impact of the three-gluon vertex

NASA Astrophysics Data System (ADS)

Binosi, Daniele; Papavassiliou, Joannis

2018-03-01

We present a detailed study of the subtle interplay transpiring at the level of two integral equations that are instrumental for the dynamical generation of a gluon mass in pure Yang-Mills theories. The main novelty is the joint treatment of the Schwinger-Dyson equation governing the infrared behavior of the gluon propagator and of the integral equation that controls the formation of massless bound-state excitations, whose inclusion is instrumental for obtaining massive solutions from the former equation. The self-consistency of the entire approach imposes the requirement of using a single value for the gauge coupling entering in the two key equations; its fulfilment depends crucially on the details of the three-gluon vertex, which contributes to both of them, but with different weight. In particular, the characteristic suppression of this vertex at intermediate and low energies enables the convergence of the iteration procedure to a single gauge coupling, whose value is reasonably close to that extracted from related lattice simulations.

Intertwining operator realization of non-relativistic holography

NASA Astrophysics Data System (ADS)

Aizawa, N.; Dobrev, V. K.

2010-04-01

We give a group-theoretic interpretation of non-relativistic holography as equivalence between representations of the Schrödinger algebra describing bulk fields and boundary fields. Our main result is the explicit construction of the boundary-to-bulk operators in the framework of representation theory (without specifying any action). Further we show that these operators and the bulk-to-boundary operators are intertwining operators. In analogy to the relativistic case, we show that each bulk field has two boundary fields with conjugated conformal weights. These fields are related by another intertwining operator given by a two-point function on the boundary. Analogously to the relativistic result of Klebanov-Witten we give the conditions when both boundary fields are physical. Finally, we recover in our formalism earlier non-relativistic results for scalar fields by Son and others.

Decision support systems and methods for complex networks

DOEpatents

Huang, Zhenyu [Richland, WA; Wong, Pak Chung [Richland, WA; Ma, Jian [Richland, WA; Mackey, Patrick S [Richland, WA; Chen, Yousu [Richland, WA; Schneider, Kevin P [Seattle, WA

2012-02-28

Methods and systems for automated decision support in analyzing operation data from a complex network. Embodiments of the present invention utilize these algorithms and techniques not only to characterize the past and present condition of a complex network, but also to predict future conditions to help operators anticipate deteriorating and/or problem situations. In particular, embodiments of the present invention characterize network conditions from operation data using a state estimator. Contingency scenarios can then be generated based on those network conditions. For at least a portion of all of the contingency scenarios, risk indices are determined that describe the potential impact of each of those scenarios. Contingency scenarios with risk indices are presented visually as graphical representations in the context of a visual representation of the complex network. Analysis of the historical risk indices based on the graphical representations can then provide trends that allow for prediction of future network conditions.

SPECTRAL STATES OF XTE J1701 - 462: LINK BETWEEN Z AND ATOLL SOURCES

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lin Dacheng; Remillard, Ronald A.; Homan, Jeroen

2009-05-10

We have analyzed 866 Rossi X-ray Timing Explorer observations of the 2006-2007 outburst of the accreting neutron star XTE J1701 -462, during which the source evolves from super-Eddington luminosities to quiescence. The X-ray color evolution first resembles the Cyg X-2 subgroup of Z sources, with frequent excursions on the horizontal and normal branches (HB/NB). The source then decays and evolves to the Sco X-1 subgroup, with increasing focus on the flaring branch (FB) and the lower vertex of the 'Z'. Finally, the FB subsides, and the source transforms into an atoll source, with the lower vertex evolving to the atollmore » soft state. Spectral analyses suggest that the atoll stage is characterized by a constant inner disk radius, while the Z stages exhibit a luminosity-dependent expansion of the inner disk, which we interpret as effects related to the local Eddington limit. Contrary to the view that the mass accretion rate m-dot changes along the Z, we find that changes in m-dot are instead responsible for the secular evolution of the Z and the subclasses. Motion along the Z branches appears to be caused by three different mechanisms that may operate at roughly constant m-dot. For the Sco X-1-like Z stage, we find that the FB is an instability track that proceeds off the lower vertex when the inner disk radius shrinks from the value set by the X-ray luminosity toward the value measured for the atoll soft state. Excursions up the NB occur when the apparent size of the boundary layer increases while the disk exhibits little change. The HB is associated with Comptonization of the disk emission. The Z branches for the Cyg X-2-like stage are more complicated, and their origin is unclear. Finally, our spectral results lead us to hypothesize that the lower and upper Z vertices correspond to a standard thin disk and a slim disk, respectively.« less

Diagrammatic expansion for positive spectral functions beyond GW: Application to vertex corrections in the electron gas

NASA Astrophysics Data System (ADS)

Stefanucci, G.; Pavlyukh, Y.; Uimonen, A.-M.; van Leeuwen, R.

2014-09-01

We present a diagrammatic approach to construct self-energy approximations within many-body perturbation theory with positive spectral properties. The method cures the problem of negative spectral functions which arises from a straightforward inclusion of vertex diagrams beyond the GW approximation. Our approach consists of a two-step procedure: We first express the approximate many-body self-energy as a product of half-diagrams and then identify the minimal number of half-diagrams to add in order to form a perfect square. The resulting self-energy is an unconventional sum of self-energy diagrams in which the internal lines of half a diagram are time-ordered Green's functions, whereas those of the other half are anti-time-ordered Green's functions, and the lines joining the two halves are either lesser or greater Green's functions. The theory is developed using noninteracting Green's functions and subsequently extended to self-consistent Green's functions. Issues related to the conserving properties of diagrammatic approximations with positive spectral functions are also addressed. As a major application of the formalism we derive the minimal set of additional diagrams to make positive the spectral function of the GW approximation with lowest-order vertex corrections and screened interactions. The method is then applied to vertex corrections in the three-dimensional homogeneous electron gas by using a combination of analytical frequency integrations and numerical Monte Carlo momentum integrations to evaluate the diagrams.

QSPR modeling: graph connectivity indices versus line graph connectivity indices

PubMed

Basak; Nikolic; Trinajstic; Amic; Beslo

2000-07-01

Five QSPR models of alkanes were reinvestigated. Properties considered were molecular surface-dependent properties (boiling points and gas chromatographic retention indices) and molecular volume-dependent properties (molar volumes and molar refractions). The vertex- and edge-connectivity indices were used as structural parameters. In each studied case we computed connectivity indices of alkane trees and alkane line graphs and searched for the optimum exponent. Models based on indices with an optimum exponent and on the standard value of the exponent were compared. Thus, for each property we generated six QSPR models (four for alkane trees and two for the corresponding line graphs). In all studied cases QSPR models based on connectivity indices with optimum exponents have better statistical characteristics than the models based on connectivity indices with the standard value of the exponent. The comparison between models based on vertex- and edge-connectivity indices gave in two cases (molar volumes and molar refractions) better models based on edge-connectivity indices and in three cases (boiling points for octanes and nonanes and gas chromatographic retention indices) better models based on vertex-connectivity indices. Thus, it appears that the edge-connectivity index is more appropriate to be used in the structure-molecular volume properties modeling and the vertex-connectivity index in the structure-molecular surface properties modeling. The use of line graphs did not improve the predictive power of the connectivity indices. Only in one case (boiling points of nonanes) a better model was obtained with the use of line graphs.

Morphometric evaluation of parasagittal venous anatomy for intracranial approaches: a cadaveric study.

PubMed

Sayhan, Salih; Guvencer, Mustafa; Ozer, Ercan; Arda, Mehmet Nuri

2012-01-01

Obstruction of superior sagittal sinus (SSS) and collateral bridging veins is a well-known reason of postoperative brain edema and brain infarct, however, morphometric anatomic studies done in the light of surgical landmarks aren't sufficient in number. Object of this study is to describe venous structures related to SSS with silicon injected cadaveric models. This study was on 6 silicon injected cadaveric heads at Anatomy Department. Duramater was removed and veins on parasagittal area were examined. SSS morphology, veins draining into SSS, their size, number and distance were evaluated. Mean vein number draining into SSS is 2.9±1.5 at anterior to coronal suture (CS), between CS and vertex is 3.2±0.8, between vertex and lambdoid suture (LS) is 2.3±0.9, between LS and confluens sinuum 0.3±0.5. There was no statically difference between right and left sides (p=0.140, p > 0.05). Diameter of veins was 2.4±1.0 mm at anterior to CS, 3.0±1.2 mm at between CS and vertex, 2.4±0.7 mm at between vertex and LS, and 2.2±0.5 mm at between LS and confluens sinuum. Knowing details of anatomic structures of SSS and venous structures draining into it may protect the patients from many surgical complications. SSS and related structures with surgical landmarks are valuable for neurosurgeons.

The Atom in a Molecule: Implications for Molecular Structure and Properties

DTIC Science & Technology

2016-05-23

unlimited. PA Clearance #16075.” Atomic- Product Representations of Molecules Employ “van der Waals” products of atomic states to represent molecules...representation the electrons “stay home” with each nucleus. Atomic fragment operators are well-defined over product representations. Expectation values of...release; distribution unlimited. PA Clearance #16075.” Hamiltonian Matrix in the Atomic- Product Basis Technical Questions Addressed: J. Chem. Phys

Improved water-level forecasting for the Northwest European Shelf and North Sea through direct modelling of tide, surge and non-linear interaction

NASA Astrophysics Data System (ADS)

Zijl, Firmijn; Verlaan, Martin; Gerritsen, Herman

2013-07-01

In real-time operational coastal forecasting systems for the northwest European shelf, the representation accuracy of tide-surge models commonly suffers from insufficiently accurate tidal representation, especially in shallow near-shore areas with complex bathymetry and geometry. Therefore, in conventional operational systems, the surge component from numerical model simulations is used, while the harmonically predicted tide, accurately known from harmonic analysis of tide gauge measurements, is added to forecast the full water-level signal at tide gauge locations. Although there are errors associated with this so-called astronomical correction (e.g. because of the assumption of linearity of tide and surge), for current operational models, astronomical correction has nevertheless been shown to increase the representation accuracy of the full water-level signal. The simulated modulation of the surge through non-linear tide-surge interaction is affected by the poor representation of the tide signal in the tide-surge model, which astronomical correction does not improve. Furthermore, astronomical correction can only be applied to locations where the astronomic tide is known through a harmonic analysis of in situ measurements at tide gauge stations. This provides a strong motivation to improve both tide and surge representation of numerical models used in forecasting. In the present paper, we propose a new generation tide-surge model for the northwest European Shelf (DCSMv6). This is the first application on this scale in which the tidal representation is such that astronomical correction no longer improves the accuracy of the total water-level representation and where, consequently, the straightforward direct model forecasting of total water levels is better. The methodology applied to improve both tide and surge representation of the model is discussed, with emphasis on the use of satellite altimeter data and data assimilation techniques for reducing parameter uncertainty. Historic DCSMv6 model simulations are compared against shelf wide observations for a full calendar year. For a selection of stations, these results are compared to those with astronomical correction, which confirms that the tide representation in coastal regions has sufficient accuracy, and that forecasting total water levels directly yields superior results.

The Influence of Different Representations on Solving Concentration Problems at Elementary School

NASA Astrophysics Data System (ADS)

Liu, Chia-Ju; Shen, Ming-Hsun

2011-10-01

This study investigated the students' learning process of the concept of concentration at the elementary school level in Taiwan. The influence of different representational types on the process of proportional reasoning was also explored. The participants included nineteen third-grade and eighteen fifth-grade students. Eye-tracking technology was used in conducting the experiment. The materials were adapted from Noelting's (1980a) "orange juice test" experiment. All problems on concentration included three stages (the intuitive, the concrete operational, and the formal operational), and each problem was displayed in iconic and symbolic representations. The data were collected through eye-tracking technology and post-test interviews. The results showed that the representational types influenced students' solving of concentration problems. Furthermore, the data on eye movement indicated that students used different strategies or rules to solve concentration problems at the different stages of the problems with different representational types. This study is intended to contribute to the understanding of elementary school students' problem-solving strategies and the usability of eye-tracking technology in related studies.

Processes of Similarity Judgment

ERIC Educational Resources Information Center

Larkey, Levi B.; Markman, Arthur B.

2005-01-01

Similarity underlies fundamental cognitive capabilities such as memory, categorization, decision making, problem solving, and reasoning. Although recent approaches to similarity appreciate the structure of mental representations, they differ in the processes posited to operate over these representations. We present an experiment that…

Development of common neural representations for distinct numerical problems

PubMed Central

Chang, Ting-Ting; Rosenberg-Lee, Miriam; Metcalfe, Arron W. S.; Chen, Tianwen; Menon, Vinod

2015-01-01

How the brain develops representations for abstract cognitive problems is a major unaddressed question in neuroscience. Here we tackle this fundamental question using arithmetic problem solving, a cognitive domain important for the development of mathematical reasoning. We first examined whether adults demonstrate common neural representations for addition and subtraction problems, two complementary arithmetic operations that manipulate the same quantities. We then examined how the common neural representations for the two problem types change with development. Whole-brain multivoxel representational similarity (MRS) analysis was conducted to examine common coding of addition and subtraction problems in children and adults. We found that adults exhibited significant levels of MRS between the two problem types, not only in the intra-parietal sulcus (IPS) region of the posterior parietal cortex (PPC), but also in ventral temporal-occipital, anterior temporal and dorsolateral prefrontal cortices. Relative to adults, children showed significantly reduced levels of MRS in these same regions. In contrast, no brain areas showed significantly greater MRS between problem types in children. Our findings provide novel evidence that the emergence of arithmetic problem solving skills from childhood to adulthood is characterized by maturation of common neural representations between distinct numerical operations, and involve distributed brain regions important for representing and manipulating numerical quantity. More broadly, our findings demonstrate that representational analysis provides a powerful approach for uncovering fundamental mechanisms by which children develop proficiencies that are a hallmark of human cognition. PMID:26160287

Characteristics of an ITS that evolves from tutor to operator's assistant. [intelligent tutoring system

NASA Technical Reports Server (NTRS)

Chu, R. W.; Mitchell, C. M.; Govindaraj, T.

1989-01-01

This paper discusses the motivation and goals of a research project which addresses the problems and issues of operator training in complex engineering sytems. The research proposes a tutor/aid paradigm for the design of an intelligent tutoring system (ITS) that evolves from a tutor to an operator's assistant for supervisory control of complex dynamic systems. Characteristics of an intelligent tutoring/aiding system are identified with respect to the representation of domain knowledge, the tutor's pedagogical structure, and the student knowledge representation. The research represents a first step in the design of an intelligent complex dynamic systems.

Pion momentum distributions in the nucleon in chiral effective theory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Burkardt, Matthias R.; Hendricks, K. S.; Ji, Cheung Ryong

2013-03-01

We compute the light-cone momentum distributions of pions in the nucleon in chiral effective theory using both pseudovector and pseudoscalar pion--nucleon couplings. For the pseudovector coupling we identifymore » $$\\delta$$-function contributions associated with end-point singularities arising from the pion-nucleon rainbow diagrams, as well as from pion tadpole diagrams which are not present in the pseudoscalar model. Gauge invariance is demonstrated, to all orders in the pion mass, with the inclusion of Weinberg-Tomozawa couplings involving operator insertions at the $$\\pi NN$$ vertex. The results pave the way for phenomenological applications of pion cloud models that are manifestly consistent with the chiral symmetry properties of QCD.« less

N-point functions in rolling tachyon background

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jokela, Niko; Keski-Vakkuri, Esko; Department of Physics, P.O. Box 64, FIN-00014, University of Helsinki

2009-04-15

We study n-point boundary correlation functions in timelike boundary Liouville theory, relevant for open string multiproduction by a decaying unstable D brane. We give an exact result for the one-point function of the tachyon vertex operator and show that it is consistent with a previously proposed relation to a conserved charge in string theory. We also discuss when the one-point amplitude vanishes. Using a straightforward perturbative expansion, we find an explicit expression for a tachyon n-point amplitude for all n, however the result is still a toy model. The calculation uses a new asymptotic approximation for Toeplitz determinants, derived bymore » relating the system to a Dyson gas at finite temperature.« less

Processing data, for improved, accuracy, from device for measuring speed of sound in a gas

DOEpatents

Owen, Thomas E.

2006-09-19

A method, used in connection with a pulse-echo type sensor for determining the speed of sound in a gas, for improving the accuracy of speed of sound measurements. The sensor operates on the principle that speed of sound can be derived from the difference between the two-way travel time of signals reflected from two different target faces of the sensor. This time difference is derived by computing the cross correlation between the two reflections. The cross correlation function may be fitted to a parabola whose vertex represents the optimum time coordinate of the coherence peak, thereby providing an accurate measure of the two-way time diffference.

Integration over families of Lagrangian submanifolds in BV formalism

NASA Astrophysics Data System (ADS)

Mikhailov, Andrei

2018-03-01

Gauge fixing is interpreted in BV formalism as a choice of Lagrangian submanifold in an odd symplectic manifold (the BV phase space). A natural construction defines an integration procedure on families of Lagrangian submanifolds. In string perturbation theory, the moduli space integrals of higher genus amplitudes can be interpreted in this way. We discuss the role of gauge symmetries in this construction. We derive the conditions which should be imposed on gauge symmetries for the consistency of our integration procedure. We explain how these conditions behave under the deformations of the worldsheet theory. In particular, we show that integrated vertex operator is actually an inhomogeneous differential form on the space of Lagrangian submanifolds.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Aranda, J. I.; Ramirez-Zavaleta, F.; Tututi, E. S.

The Higgs-mediated flavor violating bottom-strange quarks transitions induced at the one-loop level by a nondiagonal Hbs coupling are studied within the context of an effective Yukawa sector that comprises SU{sub L}(2)xU{sub Y}(1)-invariant operators of up to dimension six. The most recent experimental result on B{yields}X{sub s{gamma}} with hard photons is employed to constrain the Hbs vertex, which is used to estimate the branching ratio for the B{sub s{yields}{gamma}{gamma}} decay. It is found that the B{sub s{yields}{gamma}{gamma}} decay can reach a branching ratio of the order of 4x10{sup -8}, which is 2 orders of magnitude smaller than the current experimental limit.

Convergence of spectra of graph-like thin manifolds

NASA Astrophysics Data System (ADS)

Exner, Pavel; Post, Olaf

2005-05-01

We consider a family of compact manifolds which shrinks with respect to an appropriate parameter to a graph. The main result is that the spectrum of the Laplace-Beltrami operator converges to the spectrum of the (differential) Laplacian on the graph with Kirchhoff boundary conditions at the vertices. On the other hand, if the shrinking at the vertex parts of the manifold is sufficiently slower comparing to that of the edge parts, the limiting spectrum corresponds to decoupled edges with Dirichlet boundary conditions at the endpoints. At the borderline between the two regimes we have a third possibility when the limiting spectrum can be described by a nontrivial coupling at the vertices.

Spectral resolution of SU(3)-invariant solutions of the Yang-Baxter equation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Alishauskas, S.I.; Kulish, P.P.

1986-11-20

The spectral resolution of invariant R-matrices is computed on the basis of solution of the defining equation. Multiple representations in the Clebsch-Gordon series are considered by means of the classifying operator A: a linear combination of known operators of third and fourth degrees in the group generators. The matrix elements of A in a nonorthonormal basis are found. Explicit expressions are presented for the spectral resolutions for a number of representations.

Spectral resolution of SU(3)-invariant solutions of the Yang-Baxter equation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Alishavskas, S.I.; Kulish, P.P.

1986-11-01

The spectral resolution of invariant R-matrices is computed on the basis of solution of the defining equation. Multiple representations in the Clebsch-Gordon series are considered by means of the classifying operator A: a linear combination of known operators of third and fourth degrees in the group generators. The matrix elements of A in a nonorthonormal basis are found. Explicit expressions are presented for the spectral resolutions for a number of representations.

On the local edge antimagicness of m-splitting graphs

NASA Astrophysics Data System (ADS)

Albirri, E. R.; Dafik; Slamin; Agustin, I. H.; Alfarisi, R.

2018-04-01

Let G be a connected and simple graph. A split graph is a graph derived by adding new vertex v‧ in every vertex v‧ such that v‧ adjacent to v in graph G. An m-splitting graph is a graph which has m v‧-vertices, denoted by mSpl(G). A local edge antimagic coloring in G = (V, E) graph is a bijection f:V (G)\\to \\{1,2,3,\\ldots,|V(G)|\\} in which for any two adjacent edges e 1 and e 2 satisfies w({e}1)\

Synthesis and structure of [Na11(OtBu)10(OH)]: 1H NMR shift of a hydroxide ion encapsulated in a 21-vertex alcoholate cage.

PubMed

Geier, Jens; Grützmacher, Hansjörg

2003-12-07

[Na11(OtBu)10(OH)], a hydroxide enclosing 21-vertex cage compound, was found to crystallize from mixtures of sodium tert.butanolate with sodium hydroxide. Its structure can be derived from the known (NaOtBu)6-hexaprismane by replacing one butanolate unit with OH- and capping the latter with five additional units of NaOtBu. The hydroxide shows a signal at -3.21 ppm in the 1H NMR spectrum.

Loop-quantum-gravity vertex amplitude.

PubMed

Engle, Jonathan; Pereira, Roberto; Rovelli, Carlo

2007-10-19

Spin foam models are hoped to provide the dynamics of loop-quantum gravity. However, the most popular of these, the Barrett-Crane model, does not have the good boundary state space and there are indications that it fails to yield good low-energy n-point functions. We present an alternative dynamics that can be derived as a quantization of a Regge discretization of Euclidean general relativity, where second class constraints are imposed weakly. Its state space matches the SO(3) loop gravity one and it yields an SO(4)-covariant vertex amplitude for Euclidean loop gravity.

Constructive tensorial group field theory II: the {U(1)-T^4_4} model

NASA Astrophysics Data System (ADS)

Lahoche, Vincent

2018-05-01

In this paper, we continue our program of non-pertubative constructions of tensorial group field theories (TGFT). We prove analyticity and Borel summability in a suitable domain of the coupling constant of the simplest super-renormalizable TGFT which contains some ultraviolet divergencies, namely the color-symmetric quartic melonic rank-four model with Abelian gauge invariance, nicknamed . We use a multiscale loop vertex expansion. It is an extension of the loop vertex expansion (the basic constructive technique for non-local theories) which is required for theories that involve non-trivial renormalization.

Representation of natural numbers in quantum mechanics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Benioff, Paul

2001-03-01

This paper represents one approach to making explicit some of the assumptions and conditions implied in the widespread representation of numbers by composite quantum systems. Any nonempty set and associated operations is a set of natural numbers or a model of arithmetic if the set and operations satisfy the axioms of number theory or arithmetic. This paper is limited to k-ary representations of length L and to the axioms for arithmetic modulo k{sup L}. A model of the axioms is described based on an abstract L-fold tensor product Hilbert space H{sup arith}. Unitary maps of this space onto a physicalmore » parameter based product space H{sup phy} are then described. Each of these maps makes states in H{sup phy}, and the induced operators, a model of the axioms. Consequences of the existence of many of these maps are discussed along with the dependence of Grover's and Shor's algorithms on these maps. The importance of the main physical requirement, that the basic arithmetic operations are efficiently implementable, is discussed. This condition states that there exist physically realizable Hamiltonians that can implement the basic arithmetic operations and that the space-time and thermodynamic resources required are polynomial in L.« less

Highest-weight representations of Brocherd`s algebras

DOE Office of Scientific and Technical Information (OSTI.GOV)

Slansky, R.

1997-01-01

General features of highest-weight representations of Borcherd`s algebras are described. to show their typical features, several representations of Borcherd`s extensions of finite-dimensional algebras are analyzed. Then the example of the extension of affine- su(2) to a Borcherd`s algebra is examined. These algebras provide a natural way to extend a Kac-Moody algebra to include the hamiltonian and number-changing operators in a generalized symmetry structure.

Identification of family-specific residue packing motifs and their use for structure-based protein function prediction: I. Method development.

PubMed

Bandyopadhyay, Deepak; Huan, Jun; Prins, Jan; Snoeyink, Jack; Wang, Wei; Tropsha, Alexander

2009-11-01

Protein function prediction is one of the central problems in computational biology. We present a novel automated protein structure-based function prediction method using libraries of local residue packing patterns that are common to most proteins in a known functional family. Critical to this approach is the representation of a protein structure as a graph where residue vertices (residue name used as a vertex label) are connected by geometrical proximity edges. The approach employs two steps. First, it uses a fast subgraph mining algorithm to find all occurrences of family-specific labeled subgraphs for all well characterized protein structural and functional families. Second, it queries a new structure for occurrences of a set of motifs characteristic of a known family, using a graph index to speed up Ullman's subgraph isomorphism algorithm. The confidence of function inference from structure depends on the number of family-specific motifs found in the query structure compared with their distribution in a large non-redundant database of proteins. This method can assign a new structure to a specific functional family in cases where sequence alignments, sequence patterns, structural superposition and active site templates fail to provide accurate annotation.

BCS: the Scientific "Love of my Life"

NASA Astrophysics Data System (ADS)

Anderson, Philip W.

After short comments on my early addenda to BCS — gauge invariance and the Anderson-Higgs mechanism, the dirty superconductor "theorem," and the spinor representation — I focus on the interaction mechanisms which cause electron-electron pairing. These bifurcate into two almost non-overlapping classes. In order to cause electrons to pair in spite of the strong, repulsive, instantaneous Coulomb vertex, the electrons can evade each others' propinquity on the same site at the same time either dynamically, by retaining D° (s-wave) relative symmetry, but avoiding each other in time — called "dynamic screening" — or by assuming a non-symmetric relative wave function, avoiding each other in space. All simple metals and alloys, including all the (so far) technically useful superconductors, follow the former scheme. But starting with the first discovery of "heavy-electron" super-conductors in 1979, and continuing with the "organics" and the magnetic transition metal compounds such as the cuprates and the iron pnictides, it appears that the second class may turn out to be numerically superior and theoretically more fascinating. The basic interaction in many of these cases appears to be the "kinetic exchange" or superexchange characteristic of magnetic insulators.

Event-Based Media Enrichment Using an Adaptive Probabilistic Hypergraph Model.

PubMed

Liu, Xueliang; Wang, Meng; Yin, Bao-Cai; Huet, Benoit; Li, Xuelong

2015-11-01

Nowadays, with the continual development of digital capture technologies and social media services, a vast number of media documents are captured and shared online to help attendees record their experience during events. In this paper, we present a method combining semantic inference and multimodal analysis for automatically finding media content to illustrate events using an adaptive probabilistic hypergraph model. In this model, media items are taken as vertices in the weighted hypergraph and the task of enriching media to illustrate events is formulated as a ranking problem. In our method, each hyperedge is constructed using the K-nearest neighbors of a given media document. We also employ a probabilistic representation, which assigns each vertex to a hyperedge in a probabilistic way, to further exploit the correlation among media data. Furthermore, we optimize the hypergraph weights in a regularization framework, which is solved as a second-order cone problem. The approach is initiated by seed media and then used to rank the media documents using a transductive inference process. The results obtained from validating the approach on an event dataset collected from EventMedia demonstrate the effectiveness of the proposed approach.

Simple, explicitly time-dependent, and regular solutions of the linearized vacuum Einstein equations in Bondi-Sachs coordinates

NASA Astrophysics Data System (ADS)

Mädler, Thomas

2013-05-01

Perturbations of the linearized vacuum Einstein equations in the Bondi-Sachs formulation of general relativity can be derived from a single master function with spin weight two, which is related to the Weyl scalar Ψ0, and which is determined by a simple wave equation. By utilizing a standard spin representation of tensors on a sphere and two different approaches to solve the master equation, we are able to determine two simple and explicitly time-dependent solutions. Both solutions, of which one is asymptotically flat, comply with the regularity conditions at the vertex of the null cone. For the asymptotically flat solution we calculate the corresponding linearized perturbations, describing all multipoles of spin-2 waves that propagate on a Minkowskian background spacetime. We also analyze the asymptotic behavior of this solution at null infinity using a Penrose compactification and calculate the Weyl scalar Ψ4. Because of its simplicity, the asymptotically flat solution presented here is ideally suited for test bed calculations in the Bondi-Sachs formulation of numerical relativity. It may be considered as a sibling of the Bergmann-Sachs or Teukolsky-Rinne solutions, on spacelike hypersurfaces, for a metric adapted to null hypersurfaces.

The partition dimension of subdivision of a graph

NASA Astrophysics Data System (ADS)

Amrullah, Baskoro, Edy Tri; Uttunggadewa, Saladin; Simanjuntak, Rinovia

2016-02-01

Let G = (V,E) be a connected graph, u,v ∈ V (G), e = uv ∈ E(G) and k be a positive integer. A k-subdivision of an edge e is a replacement of e = uv with a path u, x1, x2, x ..., xk, v. A graph G with a k-subdivided edge is denoted with S(G(e; k)). Let p be a positive integer and Π = {L1, L2, L3, …, Lp} be a p-partition of V (G). The representation of a vertex v with respect to Π, r(v|Π), is the vector (d(v, L1), d(v, L2), d(v, L3),…, d(v, Lp)) where d(v, Li) for i ∈ [1, p] is the minimum distance between v and the vertices of Li. The partition Π is called a resolving partition of G if r(w|Π) ≠ r(v|Π) for all w ≠ v ∈ V (G). The partition dimension, pd(G), of G is the smallest integer p such that G has a resolving p-partition. In this paper, we present sharp upper and lower bounds of the partition dimension of S(G(e; k)) for any graph G.

Covariant fields on anti-de Sitter spacetimes

NASA Astrophysics Data System (ADS)

Cotăescu, Ion I.

2018-02-01

The covariant free fields of any spin on anti-de Sitter (AdS) spacetimes are studied, pointing out that these transform under isometries according to covariant representations (CRs) of the AdS isometry group, induced by those of the Lorentz group. Applying the method of ladder operators, it is shown that the CRs with unique spin are equivalent with discrete unitary irreducible representations (UIRs) of positive energy of the universal covering group of the isometry one. The action of the Casimir operators is studied finding how the weights of these representations (reps.) may depend on the mass and spin of the covariant field. The conclusion is that on AdS spacetime, one cannot formulate a universal mass condition as in special relativity.

Phase-space representations of symmetric informationally complete positive-operator-valued-measure fiducial states

NASA Astrophysics Data System (ADS)

Saraceno, Marcos; Ermann, Leonardo; Cormick, Cecilia

2017-03-01

The problem of finding symmetric informationally complete positive-operator-valued-measures (SIC-POVMs) has been solved numerically for all dimensions d up to 67 [A. J. Scott and M. Grassl, J. Math. Phys. 51, 042203 (2010), 10.1063/1.3374022], but a general proof of existence is still lacking. For each dimension, it was shown that it is possible to find a SIC-POVM that is generated from a fiducial state upon application of the operators of the Heisenberg-Weyl group. We draw on the numerically determined fiducial states to study their phase-space features, as displayed by the characteristic function and the Wigner, Bargmann, and Husimi representations, adapted to a Hilbert space of finite dimension. We analyze the phase-space localization of fiducial states, and observe that the SIC-POVM condition is equivalent to a maximal delocalization property. Finally, we explore the consequences in phase space of the conjectured Zauner symmetry. In particular, we construct a Hermitian operator commuting with this symmetry that leads to a representation of fiducial states in terms of eigenfunctions with definite semiclassical features.

Operator product expansion for conformal defects

NASA Astrophysics Data System (ADS)

Fukuda, Masayuki; Kobayashi, Nozomu; Nishioka, Tatsuma

2018-01-01

We study the operator product expansion (OPE) for scalar conformal defects of any codimension in CFT. The OPE for defects is decomposed into "defect OPE blocks", the irreducible representations of the conformal group, each of which packages the contribution from a primary operator and its descendants. We use the shadow formalism to deduce an integral representation of the defect OPE blocks. They are shown to obey a set of constraint equations that can be regarded as equations of motion for a scalar field propagating on the moduli space of the defects. By employing the Radon transform between the AdS space and the moduli space, we obtain a formula of constructing an AdS scalar field from the defect OPE block for a conformal defect of any codimension in a scalar representation of the conformal group, which turns out to be the Euclidean version of the HKLL formula. We also introduce a duality between conformal defects of different codimensions and prove the equivalence between the defect OPE block for codimension-two defects and the OPE block for a pair of local operators.

Common Eigenvectors of N Particles' Compatible Observables and its Squeezing Operator

NASA Astrophysics Data System (ADS)

Xu, Shi-Min; Xu, Xing-Lei; Li, Hong-Qi

We construct 2N operators for a N-particle system, namely one center-of-mass coordinate operator, N-1 relative coordinate operators, one total momentum operator and N-1 mass-weighted relative momentum operators, and give common eigenvectors of N compatible observables \\{∑ Ni=1hat {p}i,hat {x}1-hat {x}2,hat {x}2-hat {x}3,hat {x}3-hat {x}4,...; ,hat {x}N-1-hat {x}N\\}, which are composed of N particles' coordinate hat {x}i and momentum hat {p}i. By compatible, we mean such observables can be simultaneously determined. Using the technique of integration within an ordered product of operators (IWOP), we prove that the common eigenvectors are complete and orthonormal, and hereby qualified for making up a representation. This new representation can be applied to solving some dynamic problems in quantum mechanics.

Recursion Operators and Tri-Hamiltonian Structure of the First Heavenly Equation of Plebański

NASA Astrophysics Data System (ADS)

Sheftel, Mikhail; Yazıcı, Devrim

2016-09-01

We present first heavenly equation of Plebański in a two-component evolutionary form and obtain Lagrangian and Hamiltonian representations of this system. We study all point symmetries of the two-component system and, using the inverse Noether theorem in the Hamiltonian form, obtain all the integrals of motion corresponding to each variational (Noether) symmetry. We derive two linearly independent recursion operators for symmetries of this system related by a discrete symmetry of both the two-component system and its symmetry condition. Acting by these operators on the first Hamiltonian operator J_0 we obtain second and third Hamiltonian operators. However, we were not able to find Hamiltonian densities corresponding to the latter two operators. Therefore, we construct two recursion operators, which are either even or odd, respectively, under the above-mentioned discrete symmetry. Acting with them on J_0, we generate another two Hamiltonian operators J_+ and J_- and find the corresponding Hamiltonian densities, thus obtaining second and third Hamiltonian representations for the first heavenly equation in a two-component form. Using P. Olver's theory of the functional multi-vectors, we check that the linear combination of J_0, J_+ and J_- with arbitrary constant coefficients satisfies Jacobi identities. Since their skew symmetry is obvious, these three operators are compatible Hamiltonian operators and hence we obtain a tri-Hamiltonian representation of the first heavenly equation. Our well-founded conjecture applied here is that P. Olver's method works fine for nonlocal operators and our proof of the Jacobi identities and bi-Hamiltonian structures crucially depends on the validity of this conjecture.

41 CFR 109-40.102 - Representation before regulatory bodies.

Code of Federal Regulations, 2011 CFR

2011-01-01

... regulatory bodies. 109-40.102 Section 109-40.102 Public Contracts and Property Management Federal Property... Representation before regulatory bodies. Participation in proceedings related to carrier applications to regulatory bodies for temporary or permanent authority to operate in specified geographical locations shall...

41 CFR 109-40.102 - Representation before regulatory bodies.

Code of Federal Regulations, 2010 CFR

2010-07-01

... regulatory bodies. 109-40.102 Section 109-40.102 Public Contracts and Property Management Federal Property... Representation before regulatory bodies. Participation in proceedings related to carrier applications to regulatory bodies for temporary or permanent authority to operate in specified geographical locations shall...

Continuous state-space representation of a bucket-type rainfall-runoff model: a case study with the GR4 model using state-space GR4 (version 1.0)

NASA Astrophysics Data System (ADS)

Santos, Léonard; Thirel, Guillaume; Perrin, Charles

2018-04-01

In many conceptual rainfall-runoff models, the water balance differential equations are not explicitly formulated. These differential equations are solved sequentially by splitting the equations into terms that can be solved analytically with a technique called operator splitting. As a result, only the solutions of the split equations are used to present the different models. This article provides a methodology to make the governing water balance equations of a bucket-type rainfall-runoff model explicit and to solve them continuously. This is done by setting up a comprehensive state-space representation of the model. By representing it in this way, the operator splitting, which makes the structural analysis of the model more complex, could be removed. In this state-space representation, the lag functions (unit hydrographs), which are frequent in rainfall-runoff models and make the resolution of the representation difficult, are first replaced by a so-called Nash cascade and then solved with a robust numerical integration technique. To illustrate this methodology, the GR4J model is taken as an example. The substitution of the unit hydrographs with a Nash cascade, even if it modifies the model behaviour when solved using operator splitting, does not modify it when the state-space representation is solved using an implicit integration technique. Indeed, the flow time series simulated by the new representation of the model are very similar to those simulated by the classic model. The use of a robust numerical technique that approximates a continuous-time model also improves the lag parameter consistency across time steps and provides a more time-consistent model with time-independent parameters.

Getting Mental Models and Computer Models to Cooperate

NASA Technical Reports Server (NTRS)

Sheridan, T. B.; Roseborough, J.; Charney, L.; Mendel, M.

1984-01-01

A qualitative theory of supervisory control is outlined wherein the mental models of one or more human operators are related to the knowledge representations within automatic controllers (observers, estimators) and operator decision aids (expert systems, advice-givers). Methods of quantifying knowledge and the calibration of one knowledge representation to another (human, computer, or objective truth) are discussed. Ongoing experiments in the use of decision aids for exploring one's own objective function or exploring system constraints and control strategies are described.

Matrix elements of hyperfine structure operators in the SL and jj representations for the s, p{sup N}, and d{sup N} configurations and the SL-jj transformation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Childs, W.J.

1997-09-01

Matrix elements of the hyperfine operators corresponding to the magnetic-dipole (A) and electric-quadrupole (B) hyperfine structures constants are given as linear combinations of the appropriate radial integrals for all states of the s, p{sup N}, and d{sub N} configurations in both the SL and pure jj representations. The associated SL-jj transformations are also given. 13 refs., 10 tabs.

cellGPU: Massively parallel simulations of dynamic vertex models

NASA Astrophysics Data System (ADS)

Sussman, Daniel M.

2017-10-01

Vertex models represent confluent tissue by polygonal or polyhedral tilings of space, with the individual cells interacting via force laws that depend on both the geometry of the cells and the topology of the tessellation. This dependence on the connectivity of the cellular network introduces several complications to performing molecular-dynamics-like simulations of vertex models, and in particular makes parallelizing the simulations difficult. cellGPU addresses this difficulty and lays the foundation for massively parallelized, GPU-based simulations of these models. This article discusses its implementation for a pair of two-dimensional models, and compares the typical performance that can be expected between running cellGPU entirely on the CPU versus its performance when running on a range of commercial and server-grade graphics cards. By implementing the calculation of topological changes and forces on cells in a highly parallelizable fashion, cellGPU enables researchers to simulate time- and length-scales previously inaccessible via existing single-threaded CPU implementations. Program Files doi:http://dx.doi.org/10.17632/6j2cj29t3r.1 Licensing provisions: MIT Programming language: CUDA/C++ Nature of problem: Simulations of off-lattice "vertex models" of cells, in which the interaction forces depend on both the geometry and the topology of the cellular aggregate. Solution method: Highly parallelized GPU-accelerated dynamical simulations in which the force calculations and the topological features can be handled on either the CPU or GPU. Additional comments: The code is hosted at https://gitlab.com/dmsussman/cellGPU, with documentation additionally maintained at http://dmsussman.gitlab.io/cellGPUdocumentation

Cleavage in conical sand dollar eggs.

PubMed

Rappaport, R; Rappaport, B N

1994-07-01

Previous experiments have shown that the mitotic apparatus and the surface can interact and produce functional furrows in various unusual geometrical circumstances. The consistent development of the furrow in the plane equidistant from the aster centers has led to conjecture about the need for a special structural configuration of the subsurface in the future cleavage plane. In most experiments involving altered cell geometry, the relation between each aster and nearby surface was symmetrical, and the effect of that symmetry upon the position and orientation of the cleavage mechanism in the cortex has not been systematically analyzed. The normal symmetry of sand dollar eggs can be changed by reshaping them into cones. When the cone and mitotic axes are parallel, the aster center closer to the vertex is also closer to the nearby surface, and the cleavage plane develops on the vertex side of the midpoint between the asters. A mitotic apparatus oriented perpendicular to the cone axis produces in the base of the cone a normal unilateral furrow that advances toward the vertex, and a second contractile band that isolates the vertex region. This event only occurs when the surface is conical and the mitotic apparatus is perpendicular to the cone axis. Furrow formation is not restricted to the plane of the metaphase plate or the midpoint between the aster centers. The orientation of mitotic apparatus-produced contractile bands is not limited to the circumstances in normal cytokinesis, but may vary according to surface contour. These results confirm predictions of the Harris and Gewalt model of contractile ring induction.

LOGISTIC NETWORK REGRESSION FOR SCALABLE ANALYSIS OF NETWORKS WITH JOINT EDGE/VERTEX DYNAMICS

PubMed Central

Almquist, Zack W.; Butts, Carter T.

2015-01-01

Change in group size and composition has long been an important area of research in the social sciences. Similarly, interest in interaction dynamics has a long history in sociology and social psychology. However, the effects of endogenous group change on interaction dynamics are a surprisingly understudied area. One way to explore these relationships is through social network models. Network dynamics may be viewed as a process of change in the edge structure of a network, in the vertex set on which edges are defined, or in both simultaneously. Although early studies of such processes were primarily descriptive, recent work on this topic has increasingly turned to formal statistical models. Although showing great promise, many of these modern dynamic models are computationally intensive and scale very poorly in the size of the network under study and/or the number of time points considered. Likewise, currently used models focus on edge dynamics, with little support for endogenously changing vertex sets. Here, the authors show how an existing approach based on logistic network regression can be extended to serve as a highly scalable framework for modeling large networks with dynamic vertex sets. The authors place this approach within a general dynamic exponential family (exponential-family random graph modeling) context, clarifying the assumptions underlying the framework (and providing a clear path for extensions), and they show how model assessment methods for cross-sectional networks can be extended to the dynamic case. Finally, the authors illustrate this approach on a classic data set involving interactions among windsurfers on a California beach. PMID:26120218

On the strong metric dimension of generalized butterfly graph, starbarbell graph, and {C}_{m}\\odot {P}_{n} graph

NASA Astrophysics Data System (ADS)

Yunia Mayasari, Ratih; Atmojo Kusmayadi, Tri

2018-04-01

Let G be a connected graph with vertex set V(G) and edge set E(G). For every pair of vertices u,v\\in V(G), the interval I[u, v] between u and v to be the collection of all vertices that belong to some shortest u ‑ v path. A vertex s\\in V(G) strongly resolves two vertices u and v if u belongs to a shortest v ‑ s path or v belongs to a shortest u ‑ s path. A vertex set S of G is a strong resolving set of G if every two distinct vertices of G are strongly resolved by some vertex of S. The strong metric basis of G is a strong resolving set with minimal cardinality. The strong metric dimension sdim(G) of a graph G is defined as the cardinality of strong metric basis. In this paper we determine the strong metric dimension of a generalized butterfly graph, starbarbell graph, and {C}mȯ {P}n graph. We obtain the strong metric dimension of generalized butterfly graph is sdim(BFn ) = 2n ‑ 2. The strong metric dimension of starbarbell graph is sdim(S{B}{m1,{m}2,\\ldots,{m}n})={\\sum }i=1n({m}i-1)-1. The strong metric dimension of {C}mȯ {P}n graph are sdim({C}mȯ {P}n)=2m-1 for m > 3 and n = 2, and sdim({C}mȯ {P}n)=2m-2 for m > 3 and n > 2.

CUDA Enabled Graph Subset Examiner

DOE Office of Scientific and Technical Information (OSTI.GOV)

Johnston, Jeremy T.

2016-12-22

Finding Godsil-McKay switching sets in graphs is one way to demonstrate that a specific graph is not determined by its spectrum--the eigenvalues of its adjacency matrix. An important area of active research in pure mathematics is determining which graphs are determined by their spectra, i.e. when the spectrum of the adjacency matrix uniquely determines the underlying graph. We are interested in exploring the spectra of graphs in the Johnson scheme and specifically seek to determine which of these graphs are determined by their spectra. Given a graph G, a Godsil-McKay switching set is an induced subgraph H on 2k verticesmore » with the following properties: I) H is regular, ii) every vertex in G/H is adjacent to either 0, k, or 2k vertices of H, and iii) at least one vertex in G/H is adjacent to k vertices in H. The software package examines each subset of a user specified size to determine whether or not it satisfies those 3 conditions. The software makes use of the massive parallel processing power of CUDA enabled GPUs. It also exploits the vertex transitivity of graphs in the Johnson scheme by reasoning that if G has a Godsil-McKay switching set, then it has a switching set which includes vertex 1. While the code (in its current state) is tuned to this specific problem, the method of examining each induced subgraph of G can be easily re-written to check for any user specified conditions on the subgraphs and can therefore be used much more broadly.« less

The Belle II Silicon Vertex Detector

NASA Astrophysics Data System (ADS)

Friedl, M.; Ackermann, K.; Aihara, H.; Aziz, T.; Bergauer, T.; Bozek, A.; Campbell, A.; Dingfelder, J.; Drasal, Z.; Frankenberger, A.; Gadow, K.; Gfall, I.; Haba, J.; Hara, K.; Hara, T.; Higuchi, T.; Himori, S.; Irmler, C.; Ishikawa, A.; Joo, C.; Kah, D. H.; Kang, K. H.; Kato, E.; Kiesling, C.; Kodys, P.; Kohriki, T.; Koike, S.; Kvasnicka, P.; Marinas, C.; Mayekar, S. N.; Mibe, T.; Mohanty, G. B.; Moll, A.; Negishi, K.; Nakayama, H.; Natkaniec, Z.; Niebuhr, C.; Onuki, Y.; Ostrowicz, W.; Park, H.; Rao, K. K.; Ritter, M.; Rozanska, M.; Saito, T.; Sakai, K.; Sato, N.; Schmid, S.; Schnell, M.; Shimizu, N.; Steininger, H.; Tanaka, S.; Tanida, K.; Taylor, G.; Tsuboyama, T.; Ueno, K.; Uozumi, S.; Ushiroda, Y.; Valentan, M.; Yamamoto, H.

2013-12-01

The KEKB machine and the Belle experiment in Tsukuba (Japan) are now undergoing an upgrade, leading to an ultimate luminosity of 8×1035 cm-2 s-1 in order to measure rare decays in the B system with high statistics. The previous vertex detector cannot cope with this 40-fold increase of luminosity and thus needs to be replaced. Belle II will be equipped with a two-layer Pixel Detector surrounding the beam pipe, and four layers of double-sided silicon strip sensors at higher radii than the old detector. The Silicon Vertex Detector (SVD) will have a total sensitive area of 1.13 m2 and 223,744 channels-twice as many as its predecessor. All silicon sensors will be made from 150 mm wafers in order to maximize their size and thus to reduce the relative contribution of the support structure. The forward part has slanted sensors of trapezoidal shape to improve the measurement precision and to minimize the amount of material as seen by particles from the vertex. Fast-shaping front-end amplifiers will be used in conjunction with an online hit time reconstruction algorithm in order to reduce the occupancy to the level of a few percent at most. A novel “Origami” chip-on-sensor scheme is used to minimize both the distance between strips and amplifier (thus reducing the electronic noise) as well as the overall material budget. This report gives an overview on the status of the Belle II SVD and its components, including sensors, front-end detector ladders, mechanics, cooling and the readout electronics.

Relationship of the actual thick intraocular lens optic to the thin lens equivalent.

PubMed

Holladay, J T; Maverick, K J

1998-09-01

To theoretically derive and empirically validate the relationship between the actual thick intraocular lens and the thin lens equivalent. Included in the study were 12 consecutive adult patients ranging in age from 54 to 84 years (mean +/- SD, 73.5 +/- 9.4 years) with best-corrected visual acuity better than 20/40 in each eye. Each patient had bilateral intraocular lens implants of the same style, placed in the same location (bag or sulcus) by the same surgeon. Preoperatively, axial length, keratometry, refraction, and vertex distance were measured. Postoperatively, keratometry, refraction, vertex distance, and the distance from the vertex of the cornea to the anterior vertex of the intraocular lens (AV(PC1)) were measured. Alternatively, the distance (AV(PC1)) was then back-calculated from the vergence formula used for intraocular lens power calculations. The average (+/-SD) of the absolute difference in the two methods was 0.23 +/- 0.18 mm, which would translate to approximately 0.46 diopters. There was no statistical difference between the measured and calculated values; the Pearson product-moment correlation coefficient from linear regression was 0.85 (r2 = .72, F = 56). The average intereye difference was -0.030 mm (SD, 0.141 mm; SEM, 0.043 mm) using the measurement method and +0.124 mm (SD, 0.412 mm; SEM, 0.124 mm) using the calculation method. The relationship between the actual thick intraocular lens and the thin lens equivalent has been determined theoretically and demonstrated empirically. This validation provides the manufacturer and surgeon additional confidence and utility for lens constants used in intraocular lens power calculations.

LOGISTIC NETWORK REGRESSION FOR SCALABLE ANALYSIS OF NETWORKS WITH JOINT EDGE/VERTEX DYNAMICS.

PubMed

Almquist, Zack W; Butts, Carter T

2014-08-01

Change in group size and composition has long been an important area of research in the social sciences. Similarly, interest in interaction dynamics has a long history in sociology and social psychology. However, the effects of endogenous group change on interaction dynamics are a surprisingly understudied area. One way to explore these relationships is through social network models. Network dynamics may be viewed as a process of change in the edge structure of a network, in the vertex set on which edges are defined, or in both simultaneously. Although early studies of such processes were primarily descriptive, recent work on this topic has increasingly turned to formal statistical models. Although showing great promise, many of these modern dynamic models are computationally intensive and scale very poorly in the size of the network under study and/or the number of time points considered. Likewise, currently used models focus on edge dynamics, with little support for endogenously changing vertex sets. Here, the authors show how an existing approach based on logistic network regression can be extended to serve as a highly scalable framework for modeling large networks with dynamic vertex sets. The authors place this approach within a general dynamic exponential family (exponential-family random graph modeling) context, clarifying the assumptions underlying the framework (and providing a clear path for extensions), and they show how model assessment methods for cross-sectional networks can be extended to the dynamic case. Finally, the authors illustrate this approach on a classic data set involving interactions among windsurfers on a California beach.

The Koslowski-Sahlmann representation: quantum configuration space

NASA Astrophysics Data System (ADS)

Campiglia, Miguel; Varadarajan, Madhavan

2014-09-01

The Koslowski-Sahlmann (KS) representation is a generalization of the representation underlying the discrete spatial geometry of loop quantum gravity (LQG), to accommodate states labelled by smooth spatial geometries. As shown recently, the KS representation supports, in addition to the action of the holonomy and flux operators, the action of operators which are the quantum counterparts of certain connection dependent functions known as ‘background exponentials’. Here we show that the KS representation displays the following properties which are the exact counterparts of LQG ones: (i) the abelian * algebra of SU(2) holonomies and ‘U(1)’ background exponentials can be completed to a C* algebra, (ii) the space of semianalytic SU(2) connections is topologically dense in the spectrum of this algebra, (iii) there exists a measure on this spectrum for which the KS Hilbert space is realized as the space of square integrable functions on the spectrum, (iv) the spectrum admits a characterization as a projective limit of finite numbers of copies of SU(2) and U(1), (v) the algebra underlying the KS representation is constructed from cylindrical functions and their derivations in exactly the same way as the LQG (holonomy-flux) algebra except that the KS cylindrical functions depend on the holonomies and the background exponentials, this extra dependence being responsible for the differences between the KS and LQG algebras. While these results are obtained for compact spaces, they are expected to be of use for the construction of the KS representation in the asymptotically flat case.

Simulating airless and/or hot planetary surfaces in the Planetary Emissivity Laboratory (PEL)

NASA Astrophysics Data System (ADS)

Maturilli, A.; Helbert, J.; D'Amore, M.

2010-12-01

A complete and extensive mineralogical survey of extraterrestrial bodies is actually possible only by means of remote sensing spectrometers, measuring the planetary surfaces in a spectral range that goes from the visible to the far infrared. The list of instruments still active today, observing the most interesting planets and bodies in our solar system is far too long to list them in this abstract. The important message is that all of them are sending to Earth a huge amount of data that needs to be correctly analysed, to infer the mineralogical composition of the observed regions on different targets. This requires laboratory data of relevant analogue materials under relevant conditions measured on a wide spectral range. At the Planetary Emissivity Laboratory (PEL) of DLR in Berlin two separate instruments, a Bruker IFS 88 and a Bruker Vertex 80V are operated in parallel and independently to measure reflectance and emissivity of planetary analogue materials to cover the 0.4 to 100 µm spectral range. The older IFS 88 is used to measure under room pressure and for emissivity measurements from low to moderate temperatures (up to 180° C), while the new Vertex 80V can be evacuated (below 1 mbar) and used to measure emissivity of moderate to very hot surfaces, reaching temperatures typical of the daily Mercury (beyond 500° C). The laboratory set-up and the already obtained results will be described, together with details about the online-archival and the standardized structure of the existing dataset.

"Interactive Classification Technology"

NASA Technical Reports Server (NTRS)

deBessonet, Cary

1999-01-01

The investigators are upgrading a knowledge representation language called SL (Symbolic Language) and an automated reasoning system called SMS (Symbolic Manipulation System) to enable the technologies to be used in automated reasoning and interactive classification systems. The overall goals of the project are: a) the enhancement of the representation language SL to accommodate multiple perspectives and a wider range of meaning; b) the development of a sufficient set of operators to enable the interpreter of SL to handle representations of basic cognitive acts; and c) the development of a default inference scheme to operate over SL notation as it is encoded. As to particular goals the first-year work plan focused on inferencing and.representation issues, including: 1) the development of higher level cognitive/ classification functions and conceptual models for use in inferencing and decision making; 2) the specification of a more detailed scheme of defaults and the enrichment of SL notation to accommodate the scheme; and 3) the adoption of additional perspectives for inferencing.

A study of complex scaling transformation using the Wigner representation of wavefunctions.

PubMed

Kaprálová-Ždánská, Petra Ruth

2011-05-28

The complex scaling operator exp(-θ ̂x̂p/ℏ), being a foundation of the complex scaling method for resonances, is studied in the Wigner phase-space representation. It is shown that the complex scaling operator behaves similarly to the squeezing operator, rotating and amplifying Wigner quasi-probability distributions of the respective wavefunctions. It is disclosed that the distorting effect of the complex scaling transformation is correlated with increased numerical errors of computed resonance energies and widths. The behavior of the numerical error is demonstrated for a computation of CO(2+) vibronic resonances. © 2011 American Institute of Physics

Task planning and control synthesis for robotic manipulation in space applications

NASA Technical Reports Server (NTRS)

Sanderson, A. C.; Peshkin, M. A.; Homem-De-mello, L. S.

1987-01-01

Space-based robotic systems for diagnosis, repair and assembly of systems will require new techniques of planning and manipulation to accomplish these complex tasks. Results of work in assembly task representation, discrete task planning, and control synthesis which provide a design environment for flexible assembly systems in manufacturing applications, and which extend to planning of manipulatiuon operations in unstructured environments are summarized. Assembly planning is carried out using the AND/OR graph representation which encompasses all possible partial orders of operations and may be used to plan assembly sequences. Discrete task planning uses the configuration map which facilitates search over a space of discrete operations parameters in sequential operations in order to achieve required goals in the space of bounded configuration sets.

The Heavy Photon Search beamline and its performance

DOE Office of Scientific and Technical Information (OSTI.GOV)

Baltzell, N.; Egiyan, H.; Ehrhart, M.

The Heavy Photon Search (HPS) is an experiment to search for a hidden sector photon, aka a heavy photon or dark photon, in fixed target electroproduction at the Thomas Jefferson National Accelerator Facility (JLab). The HPS experiment searches for the emore » $^+$e$^-$ decay of the heavy photon with bump hunt and detached vertex strategies using a compact, large acceptance forward spectrometer, consisting of a silicon microstrip detector (SVT) for tracking and vertexing, and a PbWO$$_4$$ electromagnetic calorimeter for energy measurement and fast triggering. To achieve large acceptance and good vertexing resolution, the first layer of silicon detectors is placed just 10 cm downstream of the target with the sensor edges only 500 $$\\mu$$m above and below the beam. Placing the SVT in such close proximity to the beam puts stringent requirements on the beam profile and beam position stability. As part of an approved engineering run, HPS took data in 2015 and 2016 at 1.05 GeV and 2.3 GeV beam energies, respectively. This study describes the beam line and its performance during that data taking.« less

The Heavy Photon Search beamline and its performance

DOE Office of Scientific and Technical Information (OSTI.GOV)

Baltzell, N.; Egiyan, H.; Ehrhart, M.

The Heavy Photon Search (HPS) is an experiment to search for a hidden sector photon, aka a heavy photon or dark photon, in fixed target electroproduction at the Thomas Jefferson National Accelerator Facility (JLab). The HPS experiment searches for the e+e- decay of the heavy photon with bump hunt and detached vertex strategies using a compact, large acceptance forward spectrometer, consisting of a silicon microstrip detector (SVT) for tracking and vertexing, and a PbWO 4 electromagnetic calorimeter for energy measurement and fast triggering. To achieve large acceptance and good vertexing resolution, the first layer of silicon detectors is placed justmore » 10 cm downstream of the target with the sensor edges only 500 μm above and below the beam. Placing the SVT in such close proximity to the beam puts stringent requirements on the beam profile and beam position stability. As part of an approved engineering run, HPS took data in 2015 and 2016 at 1.05 GeV and 2.3 GeV beam energies, respectively. This paper describes the beam line and its performance during that data taking.« less

Comparison of cell centered and cell vertex scheme in the calculation of high speed compressible flows

NASA Astrophysics Data System (ADS)

Rahman, Syazila; Yusoff, Mohd. Zamri; Hasini, Hasril

2012-06-01

This paper describes the comparison between the cell centered scheme and cell vertex scheme in the calculation of high speed compressible flow properties. The calculation is carried out using Computational Fluid Dynamic (CFD) in which the mass, momentum and energy equations are solved simultaneously over the flow domain. The geometry under investigation consists of a Binnie and Green convergent-divergent nozzle and structured mesh scheme is implemented throughout the flow domain. The finite volume CFD solver employs second-order accurate central differencing scheme for spatial discretization. In addition, the second-order accurate cell-vertex finite volume spatial discretization is also introduced in this case for comparison. The multi-stage Runge-Kutta time integration is implemented for solving a set of non-linear governing equations with variables stored at the vertices. Artificial dissipations used second and fourth order terms with pressure switch to detect changes in pressure gradient. This is important to control the solution stability and capture shock discontinuity. The result is compared with experimental measurement and good agreement is obtained for both cases.

Generalized non-equilibrium vertex correction method in coherent medium theory for quantum transport simulation of disordered nanoelectronics

NASA Astrophysics Data System (ADS)

Yan, Jiawei; Ke, Youqi

In realistic nanoelectronics, disordered impurities/defects are inevitable and play important roles in electron transport. However, due to the lack of effective quantum transport method, the important effects of disorders remain poorly understood. Here, we report a generalized non-equilibrium vertex correction (NVC) method with coherent potential approximation to treat the disorder effects in quantum transport simulation. With this generalized NVC method, any averaged product of two single-particle Green's functions can be obtained by solving a set of simple linear equations. As a result, the averaged non-equilibrium density matrix and various important transport properties, including averaged current, disordered induced current fluctuation and the averaged shot noise, can all be efficiently computed in a unified scheme. Moreover, a generalized form of conditionally averaged non-equilibrium Green's function is derived to incorporate with density functional theory to enable first-principles simulation. We prove the non-equilibrium coherent potential equals the non-equilibrium vertex correction. Our approach provides a unified, efficient and self-consistent method for simulating non-equilibrium quantum transport through disorder nanoelectronics. Shanghaitech start-up fund.

The Heavy Photon Search beamline and its performance

DOE PAGES

Baltzell, N.; Egiyan, H.; Ehrhart, M.; ...

2017-07-01

The Heavy Photon Search (HPS) is an experiment to search for a hidden sector photon, aka a heavy photon or dark photon, in fixed target electroproduction at the Thomas Jefferson National Accelerator Facility (JLab). The HPS experiment searches for the emore » $^+$e$^-$ decay of the heavy photon with bump hunt and detached vertex strategies using a compact, large acceptance forward spectrometer, consisting of a silicon microstrip detector (SVT) for tracking and vertexing, and a PbWO$$_4$$ electromagnetic calorimeter for energy measurement and fast triggering. To achieve large acceptance and good vertexing resolution, the first layer of silicon detectors is placed just 10 cm downstream of the target with the sensor edges only 500 $$\\mu$$m above and below the beam. Placing the SVT in such close proximity to the beam puts stringent requirements on the beam profile and beam position stability. As part of an approved engineering run, HPS took data in 2015 and 2016 at 1.05 GeV and 2.3 GeV beam energies, respectively. This study describes the beam line and its performance during that data taking.« less

Predicting links based on knowledge dissemination in complex network

NASA Astrophysics Data System (ADS)

Zhou, Wen; Jia, Yifan

2017-04-01

Link prediction is the task of mining the missing links in networks or predicting the next vertex pair to be connected by a link. A lot of link prediction methods were inspired by evolutionary processes of networks. In this paper, a new mechanism for the formation of complex networks called knowledge dissemination (KD) is proposed with the assumption of knowledge disseminating through the paths of a network. Accordingly, a new link prediction method-knowledge dissemination based link prediction (KDLP)-is proposed to test KD. KDLP characterizes vertex similarity based on knowledge quantity (KQ) which measures the importance of a vertex through H-index. Extensive numerical simulations on six real-world networks demonstrate that KDLP is a strong link prediction method which performs at a higher prediction accuracy than four well-known similarity measures including common neighbors, local path index, average commute time and matrix forest index. Furthermore, based on the common conclusion that an excellent link prediction method reveals a good evolving mechanism, the experiment results suggest that KD is a considerable network evolving mechanism for the formation of complex networks.

Deuteron electromagnetic form factors with the light-front approach

NASA Astrophysics Data System (ADS)

Sun, Bao-dong; Dong, Yu-bing

2017-01-01

The electromagnetic form factors and low-energy observables of the deuteron are studied with the help of the light-front approach, where the deuteron is regarded as a weakly bound state of a proton and a neutron. Both the S and D wave interacting vertexes among the deuteron, proton, and neutron are taken into account. Moreover, the regularization functions are also introduced. In our calculations, the vertex and the regularization functions are employed to simulate the momentum distribution inside the deuteron. Our numerical results show that the light-front approach can roughly reproduce the deuteron electromagnetic form factors, like charge G 0, magnetic G 1, and quadrupole G 2, in the low Q 2 region. The important effect of the D wave vertex on G 2 is also addressed. Supported by National Natural Science Foundation of China (10975146, 11475192), The fund provided by the Sino-German CRC 110 “Symmetries and the Emergence of Structure in QCD" project is also appreciated, YBD thanks FAPESP grant 2011/11973-4 for funding his visit to ICTP-SAIFR

Critical frontier of the triangular Ising antiferromagnet in a field

NASA Astrophysics Data System (ADS)

Qian, Xiaofeng; Wegewijs, Maarten; Blöte, Henk W.

2004-03-01

We study the critical line of the triangular Ising antiferromagnet in an external magnetic field by means of a finite-size analysis of results obtained by transfer-matrix and Monte Carlo techniques. We compare the shape of the critical line with predictions of two different theoretical scenarios. Both scenarios, while plausible, involve assumptions. The first scenario is based on the generalization of the model to a vertex model, and the assumption that the exact analytic form of the critical manifold of this vertex model is determined by the zeroes of an O(2) gauge-invariant polynomial in the vertex weights. However, it is not possible to fit the coefficients of such polynomials of orders up to 10, such as to reproduce the numerical data for the critical points. The second theoretical prediction is based on the assumption that a renormalization mapping exists of the Ising model on the Coulomb gas, and analysis of the resulting renormalization equations. It leads to a shape of the critical line that is inconsistent with the first prediction, but consistent with the numerical data.