The vertex operator for a generalization of MacMahon’s formula
NASA Astrophysics Data System (ADS)
Cai, Liqiang; Wang, Lifang; Wu, Ke; Yang, Jie
2015-10-01
We provide a vertex operator realization for a two-parameter generalization of MacMahon’s formula introduced by M. Vuletić [Trans. Amer. Math. Soc. 361, 2789 (2009)]. Since the generalized MacMahon function is the kernel function of some Macdonald symmetric function, we consider the action of two vertex operators on a state corresponding to a Macdonald symmetric function. It becomes evident that the vertex operators appear to be the creation and annihilation operators, respectively on the state.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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…
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)
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.
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
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.
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
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.
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.
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.
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.
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.
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.
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
Effect of contact angle on the orientation, stability, and assembly of dense floating cubes.
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.
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.
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.
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.
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.
NASA Astrophysics Data System (ADS)
Kuan, Jeffrey
2018-03-01
A recent paper (Kuniba in Nucl Phys B 913:248-277, 2016) introduced the stochastic U}_q(A_n^{(1)})} vertex model. The stochastic S-matrix is related to the R-matrix of the quantum group {U_q(A_n^{(1)})} by a gauge transformation. We will show that a certain function {D^+_{m intertwines with the transfer matrix and its space reversal. When interpreting the transfer matrix as the transition matrix of a discrete-time totally asymmetric particle system on the one-dimensional lattice Z , the function {D^+m} becomes a Markov duality function {Dm} which only depends on q and the vertical spin parameters μ_x. By considering degenerations in the spectral parameter, the duality results also hold on a finite lattice with closed boundary conditions, and for a continuous-time degeneration. This duality function had previously appeared in a multi-species ASEP(q, j) process (Kuan in A multi-species ASEP(q, j) and q-TAZRP with stochastic duality, 2017). The proof here uses that the R-matrix intertwines with the co-product, but does not explicitly use the Yang-Baxter equation. It will also be shown that the stochastic U}_q(A_n^{(1)})} is a multi-species version of a stochastic vertex model studied in Borodin and Petrov (Higher spin six vertex model and symmetric rational functions, 2016) and Corwin and Petrov (Commun Math Phys 343:651-700, 2016). This will be done by generalizing the fusion process of Corwin and Petrov (2016) and showing that it matches the fusion of Kulish and yu (Lett Math Phys 5:393-403, 1981) up to the gauge transformation. We also show, by direct computation, that the multi-species q-Hahn Boson process (which arises at a special value of the spectral parameter) also satisfies duality with respect to D_∞, generalizing the single-species result of Corwin (Int Math Res Not 2015:5577-5603, 2015).
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.
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
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.
Renormalization of generalized scalar Duffin-Kemmer-Petiau electrodynamics
NASA Astrophysics Data System (ADS)
Bufalo, R.; Cardoso, T. R.; Nogueira, A. A.; Pimentel, B. M.
2018-05-01
We establish the multiplicative renormalization procedure of generalized scalar Duffin-Kemmer-Petiau electrodynamics (GSDKP4 ) in the mass shell. We show an explicit calculation of the first radiative corrections (one-loop) associated with the photon propagator, meson propagator, vertex function, and photon-photon four-point function utilizing the dimensional regularization method, where the gauge symmetry is manifest. As we will see, one of the consequences of the study is that, from the complete photon propagator renormalization condition, imposing that it behaves as a massless field, an energy range where GSDKP4 is well defined is m2≪k2
Nonlinear response from transport theory and quantum field theory at finite temperature
NASA Astrophysics Data System (ADS)
Carrington, M. E.; Defu, Hou; Kobes, R.
2001-07-01
We study the nonlinear response in weakly coupled hot φ4 theory. We obtain an expression for a quadratic shear viscous response coefficient using two different formalisms: transport theory and response theory. The transport theory calculation is done by assuming a local equilibrium form for the distribution function and expanding in the gradient of the local four dimensional velocity field. By performing a Chapman-Enskog expansion on the Boltzmann equation we obtain a hierarchy of equations for the coefficients of the expanded distribution function. To do the response theory calculation we use Zubarev's techniques in nonequilibrium statistical mechanics to derive a generalized Kubo formula. Using this formula allows us to obtain the quadratic shear viscous response from the three-point retarded Green function of the viscous shear stress tensor. We use the closed time path formalism of real time finite temperature field theory to show that this three-point function can be calculated by writing it as an integral equation involving a four-point vertex. This four-point vertex can in turn be obtained from an integral equation which represents the resummation of an infinite series of ladder and extended-ladder diagrams. The connection between transport theory and response theory is made when we show that the integral equation for this four-point vertex has exactly the same form as the equation obtained from the Boltzmann equation for the coefficient of the quadratic term of the gradient expansion of the distribution function. We conclude that calculating the quadratic shear viscous response using transport theory and keeping terms that are quadratic in the gradient of the velocity field in the Chapman-Enskog expansion of the Boltzmann equation is equivalent to calculating the quadratic shear viscous response from response theory using the next-to-linear response Kubo formula, with a vertex given by an infinite resummation of ladder and extended-ladder diagrams.
Some notes on the Roman domination number and Italian domination number in graphs
NASA Astrophysics Data System (ADS)
Hajibaba, Maryam; Jafari Rad, Nader
2017-09-01
An Italian dominating function (or simply, IDF) on a graph G = (V, E) is a function f : V → {0, 1, 2} that satisfies the property that for every vertex v ∈ V, with f(v) = 0, Σ u∈N(v) f(u) ≥ 2. The weight of an Italian dominating function f is defined as w(f) = f(V ) = Σ u∈V f(u). The minimum weight among all of the Italian dominating functions on a graph G is called the Italian domination number of G, and is denoted by γI (G). A double Roman dominating function (or simply, DRDF) is a function f : V → {0, 1, 2, 3} having the property that if f(v) = 0 for a vertex v, then v has at least two adjacent vertices assigned 2 under f or one adjacent vertex assigned 3 under f, and if f(v) = 1, then v has at least one neighbor with f(w) ≥ 2. The weight of a DRDF f is defined as the sum f(V) = Σ v∈V f(v), and the minimum weight of a DRDF on G is the double Roman domination number of G, denoted by γdR (G). In this paper we show that γdR (G)/2 ≤ γI (G) ≤ 2γdR (G)/3, and characterize all trees T with γI (T) = 2γdR (T)/3.
NASA Astrophysics Data System (ADS)
Franchini, C.; Sanna, A.; Marsman, M.; Kresse, G.
2010-02-01
BaBiO3 is characterized by a charge disproportionation with half of the Bi atoms possessing a valence 3+ and half a valence 5+ . Because of self-interaction errors, local- and semilocal-density functionals fail to describe the charge disproportionation quantitatively, yielding a too small structural distortion and no band gap. Using hybrid functionals, we obtain a satisfactory description of the structural, electronic, optical, and vibrational properties of BaBiO3 . The results obtained using GW (Green’s function G and screened Coulomb potential W) based schemes on top of hybrid functionals, including fully self-consistent GW calculations with vertex corrections in the dielectric screening, qualitatively confirm the Heyd-Scuseria-Ernzerhof picture but a systematic overestimation of the band gap by about 0.4 eV is observed.
Integrability of the odd eight-vertex model with symmetric weights
NASA Astrophysics Data System (ADS)
Martins, M. J.
2018-06-01
In this paper we investigate the integrability properties of a two-state vertex model on the square lattice whose microstates at a vertex always have an odd number of incoming or outcoming arrows. This model was named the odd eight-vertex model by Wu and Kunz (2004 J. Stat. Phys. 116 67) to distinguish it from the well-known eight-vertex model possessing an even number of arrow orientations at each vertex. When the energy weights are invariant under arrow inversion we show that the integrable manifold of the odd eight-vertex model coincides with that of the even eight-vertex model. The form of the -matrix for the odd eight-vertex model is however not the same as that of the respective Lax operator. Altogether we find that these eight-vertex models give rise to a generic sheaf of -matrices satisfying the Yang–Baxter equations resembling intertwiner relations associated to equidimensional representations.
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
NASA Astrophysics Data System (ADS)
Fischer, M.; Groote, S.; Körner, J. G.
2018-05-01
We identify the T -odd structure functions that appear in the description of polarized top quark decays in the sequential decay t (↑)→Xb+W+(→ℓ++νℓ) (two structure functions) and the quasi-three-body decay t (↑)→X b+ℓ++νℓ (one structure function). A convenient measure of the magnitude of the T -odd structure functions is the contribution of the imaginary part Im gR of the right-chiral tensor coupling gR to the T -odd structure functions which we work out. Contrary to the case of QCD, the NLO electroweak corrections to polarized top quark decays admit absorptive one-loop vertex contributions. We analytically calculate the imaginary parts of the relevant four electroweak one-loop triangle vertex diagrams and determine their contributions to the T -odd helicity structure functions that appear in the description of polarized top quark decays.
Loop-quantum-gravity vertex amplitude.
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.
[ital N]-string vertices in string field theory
DOE Office of Scientific and Technical Information (OSTI.GOV)
Bordes, J.; Abdurrahman, A.; Anton, F.
1994-03-15
We give the general form of the vertex corresponding to the interaction of an arbitrary number of strings. The technique employed relies on the comma'' representation of string field theory where string fields and interactions are represented as matrices and operations between them such as multiplication and trace. The general formulation presented here shows that the interaction vertex of [ital N] strings, for any arbitrary [ital N], is given as a function of particular combinations of matrices corresponding to the change of representation between the full string and the half string degrees of freedom.
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.
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.
Planning the mode of delivery for twin pregnancies: A web-based questionnaire.
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.
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.
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.
NASA Astrophysics Data System (ADS)
Yan, Jiawei; Ke, Youqi
2016-07-01
Electron transport properties of nanoelectronics can be significantly influenced by the inevitable and randomly distributed impurities/defects. For theoretical simulation of disordered nanoscale electronics, one is interested in both the configurationally averaged transport property and its statistical fluctuation that tells device-to-device variability induced by disorder. However, due to the lack of an effective method to do disorder averaging under the nonequilibrium condition, the important effects of disorders on electron transport remain largely unexplored or poorly understood. In this work, we report a general formalism of Green's function based nonequilibrium effective medium theory to calculate the disordered nanoelectronics. In this method, based on a generalized coherent potential approximation for the Keldysh nonequilibrium Green's function, we developed a generalized nonequilibrium vertex correction method to calculate the average of a two-Keldysh-Green's-function correlator. We obtain nine nonequilibrium vertex correction terms, as a complete family, to express the average of any two-Green's-function correlator and find they can be solved by a set of linear equations. As an important result, the averaged nonequilibrium density matrix, averaged current, disorder-induced current fluctuation, and averaged shot noise, which involve different two-Green's-function correlators, can all be derived and computed in an effective and unified way. To test the general applicability of this method, we applied it to compute the transmission coefficient and its fluctuation with a square-lattice tight-binding model and compared with the exact results and other previously proposed approximations. Our results show very good agreement with the exact results for a wide range of disorder concentrations and energies. In addition, to incorporate with density functional theory to realize first-principles quantum transport simulation, we have also derived a general form of conditionally averaged nonequilibrium Green's function for multicomponent disorders.
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.
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)\
Multiloop functional renormalization group for general models
NASA Astrophysics Data System (ADS)
Kugler, Fabian B.; von Delft, Jan
2018-02-01
We present multiloop flow equations in the functional renormalization group (fRG) framework for the four-point vertex and self-energy, formulated for a general fermionic many-body problem. This generalizes the previously introduced vertex flow [F. B. Kugler and J. von Delft, Phys. Rev. Lett. 120, 057403 (2018), 10.1103/PhysRevLett.120.057403] and provides the necessary corrections to the self-energy flow in order to complete the derivative of all diagrams involved in the truncated fRG flow. Due to its iterative one-loop structure, the multiloop flow is well suited for numerical algorithms, enabling improvement of many fRG computations. We demonstrate its equivalence to a solution of the (first-order) parquet equations in conjunction with the Schwinger-Dyson equation for the self-energy.
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
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.
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.
Optimization of Cubic Polynomial Functions without Calculus
ERIC Educational Resources Information Center
Taylor, Ronald D., Jr.; Hansen, Ryan
2008-01-01
In algebra and precalculus courses, students are often asked to find extreme values of polynomial functions in the context of solving an applied problem; but without the notion of derivative, something is lost. Either the functions are reduced to quadratics, since students know the formula for the vertex of a parabola, or solutions are…
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.
GreedyMAX-type Algorithms for the Maximum Independent Set Problem
NASA Astrophysics Data System (ADS)
Borowiecki, Piotr; Göring, Frank
A maximum independent set problem for a simple graph G = (V,E) is to find the largest subset of pairwise nonadjacent vertices. The problem is known to be NP-hard and it is also hard to approximate. Within this article we introduce a non-negative integer valued function p defined on the vertex set V(G) and called a potential function of a graph G, while P(G) = max v ∈ V(G) p(v) is called a potential of G. For any graph P(G) ≤ Δ(G), where Δ(G) is the maximum degree of G. Moreover, Δ(G) - P(G) may be arbitrarily large. A potential of a vertex lets us get a closer insight into the properties of its neighborhood which leads to the definition of the family of GreedyMAX-type algorithms having the classical GreedyMAX algorithm as their origin. We establish a lower bound 1/(P + 1) for the performance ratio of GreedyMAX-type algorithms which favorably compares with the bound 1/(Δ + 1) known to hold for GreedyMAX. The cardinality of an independent set generated by any GreedyMAX-type algorithm is at least sum_{vin V(G)} (p(v)+1)^{-1}, which strengthens the bounds of Turán and Caro-Wei stated in terms of vertex degrees.
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.
Diagrammatic expansion for positive density-response spectra: Application to the electron gas
NASA Astrophysics Data System (ADS)
Uimonen, A.-M.; Stefanucci, G.; Pavlyukh, Y.; van Leeuwen, R.
2015-03-01
In a recent paper [Phys. Rev. B 90, 115134 (2014), 10.1103/PhysRevB.90.115134] we put forward a diagrammatic expansion for the self-energy which guarantees the positivity of the spectral function. In this work we extend the theory to the density-response function. We write the generic diagram for the density-response spectrum as the sum of "partitions." In a partition the original diagram is evaluated using time-ordered Green's functions on the left half of the diagram, antitime-ordered Green's functions on the right half of the diagram, and lesser or greater Green's function gluing the two halves. As there exists more than one way to cut a diagram in two halves, to every diagram corresponds more than one partition. We recognize that the most convenient diagrammatic objects for constructing a theory of positive spectra are the half-diagrams. Diagrammatic approximations obtained by summing the squares of half-diagrams do indeed correspond to a combination of partitions which, by construction, yield a positive spectrum. We develop the theory using bare Green's functions and subsequently extend it to dressed Green's functions. We further prove a connection between the positivity of the spectral function and the analytic properties of the polarizability. The general theory is illustrated with several examples and then applied to solve the long-standing problem of including vertex corrections without altering the positivity of the spectrum. In fact already the first-order vertex diagram, relevant to the study of gradient expansion, Friedel oscillations, etc., leads to spectra which are negative in certain frequency domain. We find that the simplest approximation to cure this deficiency is given by the sum of the zeroth-order bubble diagram, the first-order vertex diagram, and a partition of the second-order ladder diagram. We evaluate this approximation in the three-dimensional homogeneous electron gas and show the positivity of the spectrum for all frequencies and densities.
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.
Functional Imaging of Sleep Vertex Sharp Transients
Stern, John M.; Caporro, Matteo; Haneef, Zulfi; Yeh, Hsiang J.; Buttinelli, Carla; Lenartowicz, Agatha; Mumford, Jeanette A.; Parvizi, Josef; Poldrack, Russell A.
2011-01-01
Objective The vertex sharp transient (VST) is an electroencephalographic (EEG) discharge that is an early marker of non-REM sleep. It has been recognized since the beginning of sleep physiology research, but its source and function remain mostly unexplained. We investigated VST generation using functional MRI (fMRI). Methods Simultaneous EEG and fMRI were recorded from 7 individuals in drowsiness and light sleep. VST occurrences on EEG were modeled with fMRI using an impulse function convolved with a hemodynamic response function to identify cerebral regions correlating to the VSTs. A resulting statistical image was thresholded at Z>2.3. Results Two hundred VSTs were identified. Significantly increased signal was present bilaterally in medial central, lateral precentral, posterior superior temporal, and medial occipital cortex. No regions of decreased signal were present. Conclusion The regions are consistent with electrophysiologic evidence from animal models and functional imaging of human sleep, but the results are specific to VSTs. The regions principally encompass the primary sensorimotor cortical regions for vision, hearing, and touch. Significance The results depict a network comprising the presumed VST generator and its associated regions. The associated regions functional similarity for primary sensation suggests a role for VSTs in sensory experience during sleep. PMID:21310653
DOE Office of Scientific and Technical Information (OSTI.GOV)
Ko, L.F.
Calculations for the two-point correlation functions in the scaling limit for two statistical models are presented. In Part I, the Ising model with a linear defect is studied for T < T/sub c/ and T > T/sub c/. The transfer matrix method of Onsager and Kaufman is used. The energy-density correlation is given by functions related to the modified Bessel functions. The dispersion expansion for the spin-spin correlation functions are derived. The dominant behavior for large separations at T not equal to T/sub c/ is extracted. It is shown that these expansions lead to systems of Fredholm integral equations. Inmore » Part II, the electric correlation function of the eight-vertex model for T < T/sub c/ is studied. The eight vertex model decouples to two independent Ising models when the four spin coupling vanishes. To first order in the four-spin coupling, the electric correlation function is related to a three-point function of the Ising model. This relation is systematically investigated and the full dispersion expansion (to first order in four-spin coupling) is obtained. The results is a new kind of structure which, unlike those of many solvable models, is apparently not expressible in terms of linear integral equations.« less
Study for online range monitoring with the interaction vertex imaging method.
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.
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.
Li, Ting; Yan, Xu; Li, Yuan; Wang, Junjie; Li, Qiang; Li, Hong; Li, Junfeng
2017-01-01
There have been many neuroimaging studies of human personality traits, and it have already provided glimpse into the neurobiology of complex traits. And most of previous studies adopt voxel-based morphology (VBM) analysis to explore the brain-personality mechanism from two levels (vertex and regional based), the findings are mixed with great inconsistencies and the brain-personality relations are far from a full understanding. Here, we used a new method of surface-based morphology (SBM) analysis, which provides better alignment of cortical landmarks to generate about the associations between cortical morphology and the personality traits across 120 healthy individuals at both vertex and regional levels. While to further reveal local functional correlates of the morphology-personality relationships, we related surface-based functional homogeneity measures to the regions identified in the regional-based SBM correlation. Vertex-wise analysis revealed that people with high agreeableness exhibited larger areas in the left superior temporal gyrus. Based on regional parcellation we found that extroversion was negatively related with the volume of the left lateral occipito-temporal gyrus and agreeableness was negatively associated with the sulcus depth of the left superior parietal lobule. Moreover, increased regional homogeneity in the left lateral occipito-temporal gyrus is related to the scores of extroversion, and increased regional homogeneity in the left superior parietal lobule is related to the scores of agreeableness. These findings provide supporting evidence of a link between personality and brain structural mysteries with a method of SBM, and further suggest that local functional homogeneity of personality traits has neurobiological relevance that is likely based on anatomical substrates.
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.
Кузь, Виталий С; Дворник, Валентин Н; Тесленко, Александра И; Кузь, Гельфира М; Мартыненко, Игорь Н
2016-01-01
The effectiveness of orthopedic treatment of edentulous patients depends on the properties of the basic materials. The main group of materials for manufacturing of such structures are acrylic plastics of thermal polymerization. However, many years of experience in the use of plastics has revealed a number of shortcomings. One of the main is insufficient functional durability of prostheses, and as a consequence - the fragility of acrylic constructions. At present, more and more dentists use nonacrylic thermoplastics, which can improve the functional quality of full removable dentures, as well as, avoid the above disadvantages of acrylic basic plastic. The work is devoted to the study of comparative clinical effectiveness of dental prosthetic in edentulous patients using a variety of basic materials for the production of removable dentures. In this work we used the following materials - "Ftorax" - acrylic plastic of hot polymerization and «Vertex Thermosense» - nonacrylic thermoplastic plastic. As a result of the performed work it can be concluded that the use of the basic thermoplastic materials, namely «Vertex Thermosense», allows to get more rapid adaptation of the patient to full removable dentures due to better fixation and stabilization. Based on the results of our comparative clinical study it can be recommended using of base material «Vertex Thermosense» in the clinic of prosthetic dentistry in treatment of edentulous patients.
A comparative study of the electrostatic potential of fullerene-like structures of Au 32 and Au 42
NASA Astrophysics Data System (ADS)
Wang, Dong-Lai; Sun, Xiao-Ping; Shen, Hong-Tao; Hou, Dong-Yan; Zhai, Yu-Chun
2008-05-01
By using density functional theory calculations, it is found that the most negative MEP inside the gold cage occurs at the center of the sphere. The largest regions with the most negative MEP outside the sphere are localized in the neighborhood of the bridge sites and the vertex regions of the five-coordinated are more positive. The absolute values of the most negative potentials in both the inner and outer cages as well as the vertex regions of the five-coordinated of Au 32 structure are much larger than those of Au 42, which means Au 32 is preferable for electrophilic attack or nucleophilic processes.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Kashani-Poor, A.
2004-11-03
We demonstrate that for a broad class of local Calabi-Yau geometries built around a string of IP{sup 1}s--those whose toric diagrams are given by triangulations of a strip--we can derive simple rules, based on the topological vertex, for obtaining expressions for the topological string partition function in which the sums over Young tableaux have been performed. By allowing non-trivial tableaux on the external legs of the corresponding web diagrams, these strips can be used as building blocks for more general geometries. As applications of our result, we study the behavior of topological string amplitudes under flops, as well as checkmore » Nekrasov's conjecture in its most general form.« less
On two-point boundary correlations in the six-vertex model with domain wall boundary conditions
NASA Astrophysics Data System (ADS)
Colomo, F.; Pronko, A. G.
2005-05-01
The six-vertex model with domain wall boundary conditions on an N × N square lattice is considered. The two-point correlation function describing the probability of having two vertices in a given state at opposite (top and bottom) boundaries of the lattice is calculated. It is shown that this two-point boundary correlator is expressible in a very simple way in terms of the one-point boundary correlators of the model on N × N and (N - 1) × (N - 1) lattices. In alternating sign matrix (ASM) language this result implies that the doubly refined x-enumerations of ASMs are just appropriate combinations of the singly refined ones.
Ayral, Thomas; Vučičević, Jaksa; Parcollet, Olivier
2017-10-20
We present an embedded-cluster method, based on the triply irreducible local expansion formalism. It turns the Fierz ambiguity, inherent to approaches based on a bosonic decoupling of local fermionic interactions, into a convergence criterion. It is based on the approximation of the three-leg vertex by a coarse-grained vertex computed from a self-consistently determined cluster impurity model. The computed self-energies are, by construction, continuous functions of momentum. We show that, in three interaction and doping regimes of the two-dimensional Hubbard model, self-energies obtained with clusters of size four only are very close to numerically exact benchmark results. We show that the Fierz parameter, which parametrizes the freedom in the Hubbard-Stratonovich decoupling, can be used as a quality control parameter. By contrast, the GW+extended dynamical mean field theory approximation with four cluster sites is shown to yield good results only in the weak-coupling regime and for a particular decoupling. Finally, we show that the vertex has spatially nonlocal components only at low Matsubara frequencies.
Graphical Representations and Cluster Algorithms for Ice Rule Vertex Models.
NASA Astrophysics Data System (ADS)
Shtengel, Kirill; Chayes, L.
2002-03-01
We introduce a new class of polymer models which is closely related to loop models, recently a topic of intensive studies. These particular models arise as graphical representations for ice-rule vertex models. The associated cluster algorithms provide a unification and generalisation of most of the existing algorithms. For many lattices, percolation in the polymer models evidently indicates first order phase transitions in the vertex models. Critical phases can be understood as being susceptible to colour symmetry breaking in the polymer models. The analysis includes, but is certainly not limited to the square lattice six-vertex model. In particular, analytic criteria can be found for low temperature phases in other even coordinated 2D lattices such as the triangular lattice, or higher dimensional lattices such as the hyper-cubic lattices of arbitrary dimensionality. Finally, our approach can be generalised to the vertex models that do not obey the ice rule, such as the eight-vertex model.
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)
Functional imaging of sleep vertex sharp transients.
Stern, John M; Caporro, Matteo; Haneef, Zulfi; Yeh, Hsiang J; Buttinelli, Carla; Lenartowicz, Agatha; Mumford, Jeanette A; Parvizi, Josef; Poldrack, Russell A
2011-07-01
The vertex sharp transient (VST) is an electroencephalographic (EEG) discharge that is an early marker of non-REM sleep. It has been recognized since the beginning of sleep physiology research, but its source and function remain mostly unexplained. We investigated VST generation using functional MRI (fMRI). Simultaneous EEG and fMRI were recorded from seven individuals in drowsiness and light sleep. VST occurrences on EEG were modeled with fMRI using an impulse function convolved with a hemodynamic response function to identify cerebral regions correlating to the VSTs. A resulting statistical image was thresholded at Z>2.3. Two hundred VSTs were identified. Significantly increased signal was present bilaterally in medial central, lateral precentral, posterior superior temporal, and medial occipital cortex. No regions of decreased signal were present. The regions are consistent with electrophysiologic evidence from animal models and functional imaging of human sleep, but the results are specific to VSTs. The regions principally encompass the primary sensorimotor cortical regions for vision, hearing, and touch. The results depict a network comprising the presumed VST generator and its associated regions. The associated regions functional similarity for primary sensation suggests a role for VSTs in sensory experience during sleep. Copyright © 2011 International Federation of Clinical Neurophysiology. Published by Elsevier Ireland Ltd. All rights reserved.
Loop vertex expansion for higher-order interactions
NASA Astrophysics Data System (ADS)
Rivasseau, Vincent
2018-05-01
This note provides an extension of the constructive loop vertex expansion to stable interactions of arbitrarily high order, opening the way to many applications. We treat in detail the example of the (\\bar{φ } φ )^p field theory in zero dimension. We find that the important feature to extend the loop vertex expansion is not to use an intermediate field representation, but rather to force integration of exactly one particular field per vertex of the initial action.
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}\
Vertex Space Analysis for Model-Based Target Recognition.
1996-08-01
performed in our unique invariant representation, Vertex Space, that reduces both the dimensionality and size of the required search space. Vertex Space ... mapping results in a reduced representation that serves as a characteristic target signature which is invariant to four of the six viewing geometry
Infrared singularities in Landau gauge Yang-Mills theory
DOE Office of Scientific and Technical Information (OSTI.GOV)
Alkofer, Reinhard; Huber, Markus Q.; Schwenzer, Kai
2010-05-15
We present a more detailed picture of the infrared regime of Landau-gauge Yang-Mills theory. This is done within a novel framework that allows one to take into account the influence of finite scales within an infrared power counting analysis. We find that there are two qualitatively different infrared fixed points of the full system of Dyson-Schwinger equations. The first extends the known scaling solution, where the ghost dynamics is dominant and gluon propagation is strongly suppressed. It features in addition to the strong divergences of gluonic vertex functions in the previously considered uniform scaling limit, when all external momenta tendmore » to zero, also weaker kinematic divergences, when only some of the external momenta vanish. The second solution represents the recently proposed decoupling scenario where the gluons become massive and the ghosts remain bare. In this case we find that none of the vertex functions is enhanced, so that the infrared dynamics is entirely suppressed. Our analysis also provides a strict argument why the Landau-gauge gluon dressing function cannot be infrared divergent.« less
Towards Online Multiresolution Community Detection in Large-Scale Networks
Huang, Jianbin; Sun, Heli; Liu, Yaguang; Song, Qinbao; Weninger, Tim
2011-01-01
The investigation of community structure in networks has aroused great interest in multiple disciplines. One of the challenges is to find local communities from a starting vertex in a network without global information about the entire network. Many existing methods tend to be accurate depending on a priori assumptions of network properties and predefined parameters. In this paper, we introduce a new quality function of local community and present a fast local expansion algorithm for uncovering communities in large-scale networks. The proposed algorithm can detect multiresolution community from a source vertex or communities covering the whole network. Experimental results show that the proposed algorithm is efficient and well-behaved in both real-world and synthetic networks. PMID:21887325
Average focal length and power of a section of any defined surface.
Kaye, Stephen B
2010-04-01
To provide a method to allow calculation of the average focal length and power of a lens through a specified meridian of any defined surface, not limited to the paraxial approximations. University of Liverpool, Liverpool, United Kingdom. Functions were derived to model back-vertex focal length and representative power through a meridian containing any defined surface. Average back-vertex focal length was based on the definition of the average of a function, using the angle of incidence as an independent variable. Univariate functions allowed determination of average focal length and power through a section of any defined or topographically measured surface of a known refractive index. These functions incorporated aberrations confined to the section. The proposed method closely approximates the average focal length, and by inference power, of a section (meridian) of a surface to a single or scalar value. It is not dependent on the paraxial and other nonconstant approximations and includes aberrations confined to that meridian. A generalization of this method to include all orthogonal and oblique meridians is needed before a comparison with measured wavefront values can be made. Copyright (c) 2010 ASCRS and ESCRS. 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.
NASA Astrophysics Data System (ADS)
Maczewski, Lukasz
2010-05-01
The International Linear Collider (ILC) is a project of an electron-positron (e+e-) linear collider with the centre-of-mass energy of 200-500 GeV. Monolithic Active Pixel Sensors (MAPS) are one of the proposed silicon pixel detector concepts for the ILC vertex detector (VTX). Basic characteristics of two MAPS pixel matrices MIMOSA-5 (17 μm pixel pitch) and MIMOSA-18 (10 μm pixel pitch) are studied and compared (pedestals, noises, calibration of the ADC-to-electron conversion gain, detector efficiency and charge collection properties). The e+e- collisions at the ILC will be accompanied by intense beamsstrahlung background of electrons and positrons hitting inner planes of the vertex detector. Tracks of this origin leave elongated clusters contrary to those of secondary hadrons. Cluster characteristics and orientation with respect to the pixels netting are studied for perpendicular and inclined tracks. Elongation and precision of determining the cluster orientation as a function of the angle of incidence were measured. A simple model of signal formation (based on charge diffusion) is proposed and tested using the collected data.
Three-dimensional structure and function of the Paramecium bursaria chlorella virus capsid.
Zhang, Xinzheng; Xiang, Ye; Dunigan, David D; Klose, Thomas; Chipman, Paul R; Van Etten, James L; Rossmann, Michael G
2011-09-06
A cryoelectron microscopy 8.5 Å resolution map of the 1,900 Å diameter, icosahedral, internally enveloped Paramecium bursaria chlorella virus was used to interpret structures of the virus at initial stages of cell infection. A fivefold averaged map demonstrated that two minor capsid proteins involved in stabilizing the capsid are missing in the vicinity of the unique vertex. Reconstruction of the virus in the presence of host chlorella cell walls established that the spike at the unique vertex initiates binding to the cell wall, which results in the enveloped nucleocapsid moving closer to the cell. This process is concurrent with the release of the internal viral membrane that was linked to the capsid by many copies of a viral membrane protein in the mature infectous virus. Simultaneously, part of the trisymmetrons around the unique vertex disassemble, probably in part because two minor capsid proteins are absent, causing Paramecium bursaria chlorella virus and the cellular contents to merge, possibly as a result of enzyme(s) within the spike assembly. This may be one of only a few recordings of successive stages of a virus while infecting a eukaryotic host in pseudoatomic detail in three dimensions.
Three-dimensional structure and function of the Paramecium bursaria chlorella virus capsid
Zhang, Xinzheng; Xiang, Ye; Dunigan, David D.; Klose, Thomas; Chipman, Paul R.; Van Etten, James L.; Rossmann, Michael G.
2011-01-01
A cryoelectron microscopy 8.5 Å resolution map of the 1,900 Å diameter, icosahedral, internally enveloped Paramecium bursaria chlorella virus was used to interpret structures of the virus at initial stages of cell infection. A fivefold averaged map demonstrated that two minor capsid proteins involved in stabilizing the capsid are missing in the vicinity of the unique vertex. Reconstruction of the virus in the presence of host chlorella cell walls established that the spike at the unique vertex initiates binding to the cell wall, which results in the enveloped nucleocapsid moving closer to the cell. This process is concurrent with the release of the internal viral membrane that was linked to the capsid by many copies of a viral membrane protein in the mature infectous virus. Simultaneously, part of the trisymmetrons around the unique vertex disassemble, probably in part because two minor capsid proteins are absent, causing Paramecium bursaria chlorella virus and the cellular contents to merge, possibly as a result of enzyme(s) within the spike assembly. This may be one of only a few recordings of successive stages of a virus while infecting a eukaryotic host in pseudoatomic detail in three dimensions. PMID:21873222
2013-05-01
environmental objects are used to immerse the user in a 3D visualisation of the simulated war game. ADFStealthViewer has several ADF produced 3D models...OpenGL, audio , and networking devices. Some advanced functionality of the engine relies on modern graphics pixel and vertex shaders. These advanced
Imaginary parts of coupled electron and phonon propagators
NASA Astrophysics Data System (ADS)
Schwartzman, K.; Lawrence, W. E.
1988-01-01
Quasiparticle and phonon damping rates due to the electron-phonon and Coulomb interactions are obtained directly from the self-energy formalism of strong-coupling theory. This accounts for all processes involving phonon or quasiparticle decay into a single particle-hole pair, or quasiparticle decay by emission or absorption of a single real phonon. The two quasiparticle decay modes are treated on a common footing, without ad hoc separation, by accounting fully for the dynamics of the phonon propagator and the Coulomb vertex-the latter by expansion of the four-point Coulomb vertex function. The results are shown to be expressible in terms of only the physical (i.e., fully renormalized) energies and coupling constants, and are written in terms of spectral functions such as α2F(ω) and its generalizations. Expansion of these in powers of a phonon linewidth parameter distinguishes (in lowest orders) between quasiparticle decay modes involving real and virtual phonons. However, the simplest prescription for calculating decay rates involves an effective scattering amplitude in which this distinction is not made.
Ghost-gluon vertex in the presence of the Gribov horizon
NASA Astrophysics Data System (ADS)
Mintz, B. W.; Palhares, L. F.; Sorella, S. P.; Pereira, A. D.
2018-02-01
We consider Yang-Mills theories quantized in the Landau gauge in the presence of the Gribov horizon via the refined Gribov-Zwanziger (RGZ) framework. As the restriction of the gauge path integral to the Gribov region is taken into account, the resulting gauge field propagators display a nontrivial infrared behavior, being very close to the ones observed in lattice gauge field theory simulations. In this work, we explore a higher correlation function in the refined Gribov-Zwanziger theory: the ghost-gluon interaction vertex, at one-loop level. We show explicit compatibility with kinematical constraints, as required by the Ward identities of the theory, and obtain analytical expressions in the limit of vanishing gluon momentum. We find that the RGZ results are nontrivial in the infrared regime, being compatible with lattice Yang-Mills simulations in both SU(2) and SU(3), as well as with solutions from Schwinger-Dyson equations in different truncation schemes, Functional Renormalization Group analysis, and the renormalization group-improved Curci-Ferrari model.
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
Cleavage in conical sand dollar eggs.
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.
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.
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".
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.
Conductivity of Weakly Disordered Metals Close to a "Ferromagnetic" Quantum Critical Point
NASA Astrophysics Data System (ADS)
Kastrinakis, George
2018-05-01
We calculate analytically the conductivity of weakly disordered metals close to a "ferromagnetic" quantum critical point in the low-temperature regime. Ferromagnetic in the sense that the effective carrier potential V(q,ω ), due to critical fluctuations, is peaked at zero momentum q=0. Vertex corrections, due to both critical fluctuations and impurity scattering, are explicitly considered. We find that only the vertex corrections due to impurity scattering, combined with the self-energy, generate appreciable effects as a function of the temperature T and the control parameter a, which measures the proximity to the critical point. Our results are consistent with resistivity experiments in several materials displaying typical Fermi liquid behaviour, but with a diverging prefactor of the T^2 term for small a.
Fetal presentation and successful twin vaginal delivery.
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.
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.
Genus Ranges of 4-Regular Rigid Vertex Graphs
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
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.
Liao, Ke; Zhu, Min; Ding, Lei
2013-08-01
The present study investigated the use of transform sparseness of cortical current density on human brain surface to improve electroencephalography/magnetoencephalography (EEG/MEG) inverse solutions. Transform sparseness was assessed by evaluating compressibility of cortical current densities in transform domains. To do that, a structure compression method from computer graphics was first adopted to compress cortical surface structure, either regular or irregular, into hierarchical multi-resolution meshes. Then, a new face-based wavelet method based on generated multi-resolution meshes was proposed to compress current density functions defined on cortical surfaces. Twelve cortical surface models were built by three EEG/MEG softwares and their structural compressibility was evaluated and compared by the proposed method. Monte Carlo simulations were implemented to evaluate the performance of the proposed wavelet method in compressing various cortical current density distributions as compared to other two available vertex-based wavelet methods. The present results indicate that the face-based wavelet method can achieve higher transform sparseness than vertex-based wavelet methods. Furthermore, basis functions from the face-based wavelet method have lower coherence against typical EEG and MEG measurement systems than vertex-based wavelet methods. Both high transform sparseness and low coherent measurements suggest that the proposed face-based wavelet method can improve the performance of L1-norm regularized EEG/MEG inverse solutions, which was further demonstrated in simulations and experimental setups using MEG data. Thus, this new transform on complicated cortical structure is promising to significantly advance EEG/MEG inverse source imaging technologies. Copyright © 2013 Elsevier Ireland Ltd. All rights reserved.
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.
Haring, L; Müürsepp, A; Mõttus, R; Ilves, P; Koch, K; Uppin, K; Tarnovskaja, J; Maron, E; Zharkovsky, A; Vasar, E; Vasar, V
2016-07-01
In studies using magnetic resonance imaging (MRI), some have reported specific brain structure-function relationships among first-episode psychosis (FEP) patients, but findings are inconsistent. We aimed to localize the brain regions where cortical thickness (CTh) and surface area (cortical area; CA) relate to neurocognition, by performing an MRI on participants and measuring their neurocognitive performance using the Cambridge Neuropsychological Test Automated Battery (CANTAB), in order to investigate any significant differences between FEP patients and control subjects (CS). Exploration of potential correlations between specific cognitive functions and brain structure was performed using CANTAB computer-based neurocognitive testing and a vertex-by-vertex whole-brain MRI analysis of 63 FEP patients and 30 CS. Significant correlations were found between cortical parameters in the frontal, temporal, cingular and occipital brain regions and performance in set-shifting, working memory manipulation, strategy usage and sustained attention tests. These correlations were significantly dissimilar between FEP patients and CS. Significant correlations between CTh and CA with neurocognitive performance were localized in brain areas known to be involved in cognition. The results also suggested a disrupted structure-function relationship in FEP patients compared with CS.
Association between vaginal birth after cesarean delivery and primary cesarean delivery rates.
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.
Visibility of quantum graph spectrum from the vertices
NASA Astrophysics Data System (ADS)
Kühn, Christian; Rohleder, Jonathan
2018-03-01
We investigate the relation between the eigenvalues of the Laplacian with Kirchhoff vertex conditions on a finite metric graph and a corresponding Titchmarsh-Weyl function (a parameter-dependent Neumann-to-Dirichlet map). We give a complete description of all real resonances, including multiplicities, in terms of the edge lengths and the connectivity of the graph, and apply it to characterize all eigenvalues which are visible for the Titchmarsh-Weyl function.
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.
NASA Astrophysics Data System (ADS)
Pezelier, Baptiste
2018-02-01
In this proceeding, we recall the notion of quantum integrable systems on a lattice and then introduce the Sklyanin’s Separation of Variables method. We sum up the main results for the transfer matrix spectral problem for the cyclic representations of the trigonometric 6-vertex reflection algebra associated to the Bazanov-Stroganov Lax operator. These results apply as well to the spectral analysis of the lattice sine-Gordon model with open boundary conditions. The transfer matrix spectrum (both eigenvalues and eigenstates) is completely characterized in terms of the set of solutions to a discrete system of polynomial equations. We state an equivalent characterization as the set of solutions to a Baxter’s like T-Q functional equation, allowing us to rewrite the transfer matrix eigenstates in an algebraic Bethe ansatz form.
NASA Astrophysics Data System (ADS)
Merzlaya, Anastasia;
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.
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.
Geometric interpretation of vertex operator algebras.
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
NPSNET: Dynamic Terrain and Cultured Feature Depiction
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
Controllability and observability analysis for vertex domination centrality in directed networks
NASA Astrophysics Data System (ADS)
Wang, Bingbo; Gao, Lin; Gao, Yong; Deng, Yue; Wang, Yu
2014-06-01
Topological centrality is a significant measure for characterising the relative importance of a node in a complex network. For directed networks that model dynamic processes, however, it is of more practical importance to quantify a vertex's ability to dominate (control or observe) the state of other vertices. In this paper, based on the determination of controllable and observable subspaces under the global minimum-cost condition, we introduce a novel direction-specific index, domination centrality, to assess the intervention capabilities of vertices in a directed network. Statistical studies demonstrate that the domination centrality is, to a great extent, encoded by the underlying network's degree distribution and that most network positions through which one can intervene in a system are vertices with high domination centrality rather than network hubs. To analyse the interaction and functional dependence between vertices when they are used to dominate a network, we define the domination similarity and detect significant functional modules in glossary and metabolic networks through clustering analysis. The experimental results provide strong evidence that our indices are effective and practical in accurately depicting the structure of directed networks.
Controllability and observability analysis for vertex domination centrality in directed networks
Wang, Bingbo; Gao, Lin; Gao, Yong; Deng, Yue; Wang, Yu
2014-01-01
Topological centrality is a significant measure for characterising the relative importance of a node in a complex network. For directed networks that model dynamic processes, however, it is of more practical importance to quantify a vertex's ability to dominate (control or observe) the state of other vertices. In this paper, based on the determination of controllable and observable subspaces under the global minimum-cost condition, we introduce a novel direction-specific index, domination centrality, to assess the intervention capabilities of vertices in a directed network. Statistical studies demonstrate that the domination centrality is, to a great extent, encoded by the underlying network's degree distribution and that most network positions through which one can intervene in a system are vertices with high domination centrality rather than network hubs. To analyse the interaction and functional dependence between vertices when they are used to dominate a network, we define the domination similarity and detect significant functional modules in glossary and metabolic networks through clustering analysis. The experimental results provide strong evidence that our indices are effective and practical in accurately depicting the structure of directed networks. PMID:24954137
SKATE: a docking program that decouples systematic sampling from scoring.
Feng, Jianwen A; Marshall, Garland R
2010-11-15
SKATE is a docking prototype that decouples systematic sampling from scoring. This novel approach removes any interdependence between sampling and scoring functions to achieve better sampling and, thus, improves docking accuracy. SKATE systematically samples a ligand's conformational, rotational and translational degrees of freedom, as constrained by a receptor pocket, to find sterically allowed poses. Efficient systematic sampling is achieved by pruning the combinatorial tree using aggregate assembly, discriminant analysis, adaptive sampling, radial sampling, and clustering. Because systematic sampling is decoupled from scoring, the poses generated by SKATE can be ranked by any published, or in-house, scoring function. To test the performance of SKATE, ligands from the Asetex/CDCC set, the Surflex set, and the Vertex set, a total of 266 complexes, were redocked to their respective receptors. The results show that SKATE was able to sample poses within 2 A RMSD of the native structure for 98, 95, and 98% of the cases in the Astex/CDCC, Surflex, and Vertex sets, respectively. Cross-docking accuracy of SKATE was also assessed by docking 10 ligands to thymidine kinase and 73 ligands to cyclin-dependent kinase. 2010 Wiley Periodicals, Inc.
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
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.
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.
Universal vertex-IRF transformation for quantum affine algebras
DOE Office of Scientific and Technical Information (OSTI.GOV)
Buffenoir, E.; Roche, Ph.; Terras, V.
2012-10-15
We construct a universal solution of the generalized coboundary equation in the case of quantum affine algebras, which is an extension of our previous work to U{sub q}(A{sub r}{sup (1)}). This universal solution has a simple Gauss decomposition which is constructed using Sevostyanov's characters of twisted quantum Borel algebras. We show that in the evaluation representations it gives a vertex-face transformation between a vertex type solution and a face type solution of the quantum dynamical Yang-Baxter equation. In particular, in the evaluation representation of U{sub q}(A{sub 1}{sup (1)}), it gives Baxter's well-known transformation between the 8-vertex model and the interaction-round-facesmore » (IRF) height model.« less
The Vertex Version of Weighted Wiener Number for Bicyclic Molecular Structures
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
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.
Han, Kihwan; Davis, Rebecca A; Chapman, Sandra B; Krawczyk, Daniel C
2017-05-01
Prior studies have demonstrated training-induced changes in the healthy adult brain. Yet, it remains unclear how the injured brain responds to cognitive training months-to-years after injury. Sixty individuals with chronic traumatic brain injury (TBI) were randomized into either strategy-based ( N = 31) or knowledge-based ( N = 29) training for 8 weeks. We measured cortical thickness and resting-state functional connectivity (rsFC) before training, immediately posttraining, and 3 months posttraining. Relative to the knowledge-based training group, the cortical thickness of the strategy-based training group showed diverse temporal patterns of changes over multiple brain regions ( p vertex < .05, p cluster < .05): (1) increases followed by decreases, (2) monotonic increases, and (3) monotonic decreases. However, network-based statistics (NBS) analysis of rsFC among these regions revealed that the strategy-based training group induced only monotonic increases in connectivity, relative to the knowledge-based training group (| Z | > 1.96, p NBS < 0.05). Complementing the rsFC results, the strategy-based training group yielded monotonic improvement in scores for the trail-making test ( p < .05). Analyses of brain-behavior relationships revealed that improvement in trail-making scores were associated with training-induced changes in cortical thickness ( p vertex < .05, p cluster < .05) and rsFC ( p vertex < .05, p cluster < .005) within the strategy-based training group. These findings suggest that training-induced brain plasticity continues through chronic phases of TBI and that brain connectivity and cortical thickness may serve as markers of plasticity.
Local adjacency metric dimension of sun graph and stacked book graph
NASA Astrophysics Data System (ADS)
Yulisda Badri, Alifiah; Darmaji
2018-03-01
A graph is a mathematical system consisting of a non-empty set of nodes and a set of empty sides. One of the topics to be studied in graph theory is the metric dimension. Application in the metric dimension is the navigation robot system on a path. Robot moves from one vertex to another vertex in the field by minimizing the errors that occur in translating the instructions (code) obtained from the vertices of that location. To move the robot must give different instructions (code). In order for the robot to move efficiently, the robot must be fast to translate the code of the nodes of the location it passes. so that the location vertex has a minimum distance. However, if the robot must move with the vertex location on a very large field, so the robot can not detect because the distance is too far.[6] In this case, the robot can determine its position by utilizing location vertices based on adjacency. The problem is to find the minimum cardinality of the required location vertex, and where to put, so that the robot can determine its location. The solution to this problem is the dimension of adjacency metric and adjacency metric bases. Rodrguez-Velzquez and Fernau combine the adjacency metric dimensions with local metric dimensions, thus becoming the local adjacency metric dimension. In the local adjacency metric dimension each vertex in the graph may have the same adjacency representation as the terms of the vertices. To obtain the local metric dimension of values in the graph of the Sun and the stacked book graph is used the construction method by considering the representation of each adjacent vertex of the graph.
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.
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.
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
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
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.
Noise propagation issues in Belle II pixel detector power cable
NASA Astrophysics Data System (ADS)
Iglesias, M.; Arteche, F.; Echeverria, I.; Pradas, A.; Rivetta, C.; Moser, H.-G.; Kiesling, C.; Rummel, S.; Arcega, F. J.
2018-04-01
The vertex detector used in the upgrade of High-Energy physics experiment Belle II includes DEPFET pixel detector (PXD) technology. In this complex topology the power supply units and the front-end electronics are connected through a PXD power cable bundle which may propagate the output noise from the power supplies to the vertex area. This paper presents a study of the propagation of noise caused by power converters in the PXD cable bundle based on Multi-conductor Transmission Line (MTL) theory. The work exposes the effect of the complex cable topology and shield connections on the noise propagation, which has an impact on the requirements of the power supplies. This analysis is part of the electromagnetic compatibility based design focused on functional safety to define the shield connections and power supply specifications required to ensure the successful integration of the detector and, specifically, to achieve the designed performance of the front-end electronics.
On total irregularity strength of caterpillar graphs with two leaves on each internal vertex
NASA Astrophysics Data System (ADS)
Rosyida, I.; Widodo; Indriati, D.
2018-04-01
Let G(V, E) be a graph. A function f from V(G)\\cup E(G) to the set {1, 2, …, k} is said to be a totally irregular total k-labeling of G if the weights of any two different vertices x and y in V (G) satisfy {w}f(x)\
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.
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.
Screenings and vertex operators of quantum superalgebra U{sub q}(sl-caret(N|1))
DOE Office of Scientific and Technical Information (OSTI.GOV)
Kojima, Takeo
2012-08-15
We construct the screening currents of the quantum superalgebra U{sub q}(sl-caret(N|1)) for an arbitrary level k{ne}-N+ 1. We show that these screening currents commute with the superalgebra modulo total difference. We propose bosonizations of the vertex operators by using the screening currents. We check that these vertex operators are the intertwiners among the Fock-Wakimoto representation and the typical representation for rank N Less-Than-Or-Slanted-Equal-To 4.
Design and Construction of a Vertex Chamber and Measurement of the Average Beta-Hadron Lifetime
NASA Astrophysics Data System (ADS)
Nelson, Harry Norman
Four parameters describe the mixing of the three quark generations in the Standard Model of the weak charged current interaction. These four parameters are experimental inputs to the model. A measurement of the mean lifetime of hadrons containing b-quarks, or B-Hadrons, constrains the magnitudes of two of these parameters. Measurement of the B-Hadron lifetime requires a device that can measure the locations of the stable particles that result from B-Hadron decay. This device must function reliably in an inaccessible location, and survive high radiation levels. We describe the design and construction of such a device, a gaseous drift chamber. Tubes of 6.9 mm diameter, having aluminized mylar walls of 100 μm thickness are utilized in this Vertex Chamber. It achieves a spatial resolution of 45 mum, and a resolution in extrapolation to the B-Hadron decay location of 87 mum. Its inner layer is 4.6 cm from e^+e ^- colliding beams. The Vertex Chamber is situated within the MAC detector at PEP. We have analyzed both the 94 pb ^{-1} of integrated luminosity accumulated at sqrt{s} = 29 GeV with the Vertex Chamber in place as well as the 210 pb^{-1} accumulated previously. We require a lepton with large momentum transverse to the event thrust axis to obtain a sample of events enriched in B-Hadron decays. The distribution of signed impact parameters of all tracks in these events is used to measure the B-Hadron flight distance, and hence lifetime. The trimmed mean signed impact parameters are 130 +/- 19 μm for data accumulated with the Vertex Chamber, and 162 +/- 25 μm for previous data. Together these indicate an average B-Hadron lifetime of tau_{b} = (1.37_sp{-0.19}{+0.22} stat. +/- 0.11 sys.) times (1 +/- 0.15 sys.) psec. We separate additive and multiplicative systematic errors because the second does not degrade the statistical significance of the difference of the result from 0. If b-c dominates b-quark decay the corresponding weak mixing matrix element mid V_ {cb}mid = 0.047 +/- 0.006 +/- 0.005, where the first error is from this experiment, and the second theoretical uncertainty. If b-u dominates, midV _{ub}mid = 0.033 +/- 0.004 +/- 0.12.
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.
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.
Nonperturbative finite-temperature Yang-Mills theory
NASA Astrophysics Data System (ADS)
Cyrol, Anton K.; Mitter, Mario; Pawlowski, Jan M.; Strodthoff, Nils
2018-03-01
We present nonperturbative correlation functions in Landau-gauge Yang-Mills theory at finite temperature. The results are obtained from the functional renormalisation group within a self-consistent approximation scheme. In particular, we compute the magnetic and electric components of the gluon propagator, and the three- and four-gluon vertices. We also show the ghost propagator and the ghost-gluon vertex at finite temperature. Our results for the propagators are confronted with lattice simulations and our Debye mass is compared to hard thermal loop perturbation theory.
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.
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.
Pose-oblivious shape signature.
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.
NASA Astrophysics Data System (ADS)
Tazai, Rina; Yamakawa, Youichi; Tsuchiizu, Masahisa; Kontani, Hiroshi
2016-09-01
In various multiorbital systems, the emergence of the orbital fluctuations and their role on the pairing mechanism attract increasing attention. To achieve deep understanding on these issues, we perform a functional renormalization group (fRG) study for the two-orbital Hubbard model. The vertex corrections for the electron-boson coupling (U -VC), which are dropped in the Migdal-Eliashberg gap equation, are obtained by solving the RG equation. We reveal that the dressed electron-boson coupling for the charge channel Ûeffc becomes much larger than the bare Coulomb interaction Û 0 due to the U -VC in the presence of moderate spin fluctuations. For this reason, the attractive pairing interaction due to the charge or orbital fluctuations is enlarged by the factor (Ûeffc/Û0) 2≫1 . In contrast, the spin fluctuation pairing interaction is suppressed by the spin-channel U -VC, because of the relation Ûeffs≪Û 0 . The present study demonstrates that the orbital or charge fluctuation pairing mechanism can be realized in various multiorbital systems thanks to the U -VC, such as in Fe-based superconductors.
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.
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.
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.
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
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
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.
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.
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.
Many-body perturbation theory using the density-functional concept: beyond the GW approximation.
Bruneval, Fabien; Sottile, Francesco; Olevano, Valerio; Del Sole, Rodolfo; Reining, Lucia
2005-05-13
We propose an alternative formulation of many-body perturbation theory that uses the density-functional concept. Instead of the usual four-point integral equation for the polarizability, we obtain a two-point one, which leads to excellent optical absorption and energy-loss spectra. The corresponding three-point vertex function and self-energy are then simply calculated via an integration, for any level of approximation. Moreover, we show the direct impact of this formulation on the time-dependent density-functional theory. Numerical results for the band gap of bulk silicon and solid argon illustrate corrections beyond the GW approximation for the self-energy.
A 32 vertex polyhedron via supramolecular assembly of silanedithiolate silanolate units.
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.
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.
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.
Noise propagation issues in Belle II pixel detector power cable
Iglesias, M.; Arteche, F.; Echeverria, I.; ...
2018-04-26
The vertex detector used in the upgrade of High-Energy physics experiment Belle II includes DEPFET pixel detector (PXD) technology. In this complex topology the power supply units and the front-end electronics are connected through a PXD power cable bundle which may propagate the output noise from the power supplies to the vertex area. This article presents a study of the propagation of noise caused by power converters in the PXD cable bundle based on Multi-conductor Transmission Line (MTL) theory. The work exposes the effect of the complex cable topology and shield connections on the noise propagation, which has an impactmore » on the requirements of the power supplies. This analysis is part of the electromagnetic compatibility based design focused on functional safety to define the shield connections and power supply specifications required to ensure the successful integration of the detector and, specifically, to achieve the designed performance of the front-end electronics.« less
Noise propagation issues in Belle II pixel detector power cable
DOE Office of Scientific and Technical Information (OSTI.GOV)
Iglesias, M.; Arteche, F.; Echeverria, I.
The vertex detector used in the upgrade of High-Energy physics experiment Belle II includes DEPFET pixel detector (PXD) technology. In this complex topology the power supply units and the front-end electronics are connected through a PXD power cable bundle which may propagate the output noise from the power supplies to the vertex area. This article presents a study of the propagation of noise caused by power converters in the PXD cable bundle based on Multi-conductor Transmission Line (MTL) theory. The work exposes the effect of the complex cable topology and shield connections on the noise propagation, which has an impactmore » on the requirements of the power supplies. This analysis is part of the electromagnetic compatibility based design focused on functional safety to define the shield connections and power supply specifications required to ensure the successful integration of the detector and, specifically, to achieve the designed performance of the front-end electronics.« less
A dynamic cellular vertex model of growing epithelial tissues
NASA Astrophysics Data System (ADS)
Lin, Shao-Zhen; Li, Bo; Feng, Xi-Qiao
2017-04-01
Intercellular interactions play a significant role in a wide range of biological functions and processes at both the cellular and tissue scales, for example, embryogenesis, organogenesis, and cancer invasion. In this paper, a dynamic cellular vertex model is presented to study the morphomechanics of a growing epithelial monolayer. The regulating role of stresses in soft tissue growth is revealed. It is found that the cells originating from the same parent cell in the monolayer can orchestrate into clustering patterns as the tissue grows. Collective cell migration exhibits a feature of spatial correlation across multiple cells. Dynamic intercellular interactions can engender a variety of distinct tissue behaviors in a social context. Uniform cell proliferation may render high and heterogeneous residual compressive stresses, while stress-regulated proliferation can effectively release the stresses, reducing the stress heterogeneity in the tissue. The results highlight the critical role of mechanical factors in the growth and morphogenesis of epithelial tissues and help understand the development and invasion of epithelial tumors.
Connecting dark matter annihilation to the vertex functions of Standard Model fermions
DOE Office of Scientific and Technical Information (OSTI.GOV)
Kumar, Jason; Light, Christopher, E-mail: jkumar@hawaii.edu, E-mail: lightc@hawaii.edu
We consider scenarios in which dark matter is a Majorana fermion which couples to Standard Model fermions through the exchange of charged mediating particles. The matrix elements for various dark matter annihilation processes are then related to one-loop corrections to the fermion-photon vertex, where dark matter and the charged mediators run in the loop. In particular, in the limit where Standard Model fermion helicity mixing is suppressed, the cross section for dark matter annihilation to various final states is related to corrections to the Standard Model fermion charge form factor. These corrections can be extracted in a gauge-invariant manner frommore » collider cross sections. Although current measurements from colliders are not precise enough to provide useful constraints on dark matter annihilation, improved measurements at future experiments, such as the International Linear Collider, could improve these constraints by several orders of magnitude, allowing them to surpass the limits obtainable by direct observation.« less
Modeling the coevolution of topology and traffic on weighted technological networks
NASA Astrophysics Data System (ADS)
Xie, Yan-Bo; Wang, Wen-Xu; Wang, Bing-Hong
2007-02-01
For many technological networks, the network structures and the traffic taking place on them mutually interact. The demands of traffic increment spur the evolution and growth of the networks to maintain their normal and efficient functioning. In parallel, a change of the network structure leads to redistribution of the traffic. In this paper, we perform an extensive numerical and analytical study, extending results of Wang [Phys. Rev. Lett. 94, 188702 (2005)]. By introducing a general strength-coupling interaction driven by the traffic increment between any pair of vertices, our model generates networks of scale-free distributions of strength, weight, and degree. In particular, the obtained nonlinear correlation between vertex strength and degree, and the disassortative property demonstrate that the model is capable of characterizing weighted technological networks. Moreover, the generated graphs possess both dense clustering structures and an anticorrelation between vertex clustering and degree, which are widely observed in real-world networks. The corresponding theoretical predictions are well consistent with simulation results.
The spectrum of a vertex model and related spin one chain sitting in a genus five curve
NASA Astrophysics Data System (ADS)
Martins, M. J.
2017-11-01
We derive the transfer matrix eigenvalues of a three-state vertex model whose weights are based on a R-matrix not of difference form with spectral parameters lying on a genus five curve. We have shown that the basic building blocks for both the transfer matrix eigenvalues and Bethe equations can be expressed in terms of meromorphic functions on an elliptic curve. We discuss the properties of an underlying spin one chain originated from a particular choice of the R-matrix second spectral parameter. We present numerical and analytical evidences that the respective low-energy excitations can be gapped or massless depending on the strength of the interaction coupling. In the massive phase we provide analytical and numerical evidences in favor of an exact expression for the lowest energy gap. We point out that the critical point separating these two distinct physical regimes coincides with the one in which the weights geometry degenerate into union of genus one curves.
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
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.
Hierarchical graphs for rule-based modeling of biochemical systems
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
2015-01-01
Background Cellular processes are known to be modular and are realized by groups of proteins implicated in common biological functions. Such groups of proteins are called functional modules, and many community detection methods have been devised for their discovery from protein interaction networks (PINs) data. In current agglomerative clustering approaches, vertices with just a very few neighbors are often classified as separate clusters, which does not make sense biologically. Also, a major limitation of agglomerative techniques is that their computational efficiency do not scale well to large PINs. Finally, PIN data obtained from large scale experiments generally contain many false positives, and this makes it hard for agglomerative clustering methods to find the correct clusters, since they are known to be sensitive to noisy data. Results We propose a local similarity premetric, the relative vertex clustering value, as a new criterion allowing to decide when a node can be added to a given node's cluster and which addresses the above three issues. Based on this criterion, we introduce a novel and very fast agglomerative clustering technique, FAC-PIN, for discovering functional modules and protein complexes from a PIN data. Conclusions Our proposed FAC-PIN algorithm is applied to nine PIN data from eight different species including the yeast PIN, and the identified functional modules are validated using Gene Ontology (GO) annotations from DAVID Bioinformatics Resources. Identified protein complexes are also validated using experimentally verified complexes. Computational results show that FAC-PIN can discover functional modules or protein complexes from PINs more accurately and more efficiently than HC-PIN and CNM, the current state-of-the-art approaches for clustering PINs in an agglomerative manner. PMID:25734691
Random packing of regular polygons and star polygons on a flat two-dimensional surface.
Cieśla, Michał; Barbasz, Jakub
2014-08-01
Random packing of unoriented regular polygons and star polygons on a two-dimensional flat continuous surface is studied numerically using random sequential adsorption algorithm. Obtained results are analyzed to determine the saturated random packing ratio as well as its density autocorrelation function. Additionally, the kinetics of packing growth and available surface function are measured. In general, stars give lower packing ratios than polygons, but when the number of vertexes is large enough, both shapes approach disks and, therefore, properties of their packing reproduce already known results for disks.
Extremal values on Zagreb indices of trees with given distance k-domination number.
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
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).
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.
Vertex Operators, Grassmannians, and Hilbert Schemes
NASA Astrophysics Data System (ADS)
Carlsson, Erik
2010-12-01
We approximate the infinite Grassmannian by finite-dimensional cutoffs, and define a family of fermionic vertex operators as the limit of geometric correspondences on the equivariant cohomology groups, with respect to a one-dimensional torus action. We prove that in the localization basis, these are the well-known fermionic vertex operators on the infinite wedge representation. Furthermore, the boson-fermion correspondence, locality, and intertwining properties with the Virasoro algebra are the limits of relations on the finite-dimensional cutoff spaces, which are true for geometric reasons. We then show that these operators are also, almost by definition, the vertex operators defined by Okounkov and the author in Carlsson and Okounkov (
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.
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
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
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.
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.
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.
Self-locking degree-4 vertex origami structures
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.
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].
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.
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.
On the partition dimension of comb product of path and complete graph
NASA Astrophysics Data System (ADS)
Darmaji, Alfarisi, Ridho
2017-08-01
For a vertex v of a connected graph G(V, E) 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). Finding the 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 path and complete graph. The results show that comb product of complete grapph Km and path Pn namely p d (Km⊳Pn)=m where m ≥ 3 and n ≥ 2 and p d (Pn⊳Km)=m where m ≥ 3, n ≥ 2 and m ≥ n.
Return probability after a quench from a domain wall initial state in the spin-1/2 XXZ chain
NASA Astrophysics Data System (ADS)
Stéphan, Jean-Marie
2017-10-01
We study the return probability and its imaginary (τ) time continuation after a quench from a domain wall initial state in the XXZ spin chain, focusing mainly on the region with anisotropy \\vert Δ\\vert < 1 . We establish exact Fredholm determinant formulas for those, by exploiting a connection to the six-vertex model with domain wall boundary conditions. In imaginary time, we find the expected scaling for a partition function of a statistical mechanical model of area proportional to τ2 , which reflects the fact that the model exhibits the limit shape phenomenon. In real time, we observe that in the region \\vert Δ\\vert <1 the decay for long time t is nowhere continuous as a function of anisotropy: it is Gaussian at roots of unity and exponential otherwise. We also determine that the front moves as x_f(t)=t\\sqrt{1-Δ^2} , by the analytic continuation of known arctic curves in the six-vertex model. Exactly at \\vert Δ\\vert =1 , we find the return probability decays as e-\\zeta(3/2) \\sqrt{t/π}t1/2O(1) . It is argued that this result provides an upper bound on spin transport. In particular, it suggests that transport should be diffusive at the isotropic point for this quench.
Enumeration of Extended m-Regular Linear Stacks.
Guo, Qiang-Hui; Sun, Lisa H; Wang, Jian
2016-12-01
The contact map of a protein fold in the two-dimensional (2D) square lattice has arc length at least 3, and each internal vertex has degree at most 2, whereas the two terminal vertices have degree at most 3. Recently, Chen, Guo, Sun, and Wang studied the enumeration of [Formula: see text]-regular linear stacks, where each arc has length at least [Formula: see text] and the degree of each vertex is bounded by 2. Since the two terminal points in a protein fold in the 2D square lattice may form contacts with at most three adjacent lattice points, we are led to the study of extended [Formula: see text]-regular linear stacks, in which the degree of each terminal point is bounded by 3. This model is closed to real protein contact maps. Denote the generating functions of the [Formula: see text]-regular linear stacks and the extended [Formula: see text]-regular linear stacks by [Formula: see text] and [Formula: see text], respectively. We show that [Formula: see text] can be written as a rational function of [Formula: see text]. For a certain [Formula: see text], by eliminating [Formula: see text], we obtain an equation satisfied by [Formula: see text] and derive the asymptotic formula of the numbers of [Formula: see text]-regular linear stacks of length [Formula: see text].
Subcortical regional morphology correlates with fluid and spatial intelligence.
Burgaleta, Miguel; MacDonald, Penny A; Martínez, Kenia; Román, Francisco J; Álvarez-Linera, Juan; Ramos González, Ana; Karama, Sherif; Colom, Roberto
2014-05-01
Neuroimaging studies have revealed associations between intelligence and brain morphology. However, researchers have focused primarily on the anatomical features of the cerebral cortex, whereas subcortical structures, such as the basal ganglia (BG), have often been neglected despite extensive functional evidence on their relation with higher-order cognition. Here we performed shape analyses to understand how individual differences in BG local morphology account for variability in cognitive performance. Structural MRI was acquired in 104 young adults (45 men, 59 women, mean age = 19.83, SD = 1.64), and the outer surface of striatal structures (caudate, nucleus accumbens, and putamen), globus pallidus, and thalamus was estimated for each subject and hemisphere. Further, nine cognitive tests were used to measure fluid (Gf), crystallized (Gc), and spatial intelligence (Gv). Latent scores for these factors were computed by means of confirmatory factor analysis and regressed vertex-wise against subcortical shape (local displacements of vertex position), controlling for age, sex, and adjusted for brain size. Significant results (FDR < 5%) were found for Gf and Gv, but not Gc, for the right striatal structures and thalamus. The main results show a relative enlargement of the rostral putamen, which is functionally connected to the right dorsolateral prefrontal cortex and other intelligence-related prefrontal areas. Copyright © 2013 Wiley Periodicals, Inc.
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.
Hierarchical graphs for better annotations of rule-based models of biochemical systems
DOE Office of Scientific and Technical Information (OSTI.GOV)
Hu, Bin; Hlavacek, William
2009-01-01
In the graph-based formalism of the BioNetGen language (BNGL), graphs are used to represent molecules, with a colored vertex representing a component of a molecule, a vertex label representing the internal state of a component, and an edge representing a bond between components. Components of a molecule share the same color. Furthermore, graph-rewriting rules are used to represent molecular interactions, with a rule that specifies addition (removal) of an edge representing a class of association (dissociation) reactions and with a rule that specifies a change of vertex label representing a class of reactions that affect the internal state of amore » molecular component. A set of rules comprises a mathematical/computational model that can be used to determine, through various means, the system-level dynamics of molecular interactions in a biochemical system. Here, for purposes of model annotation, we propose an extension of BNGL that involves the use of hierarchical graphs to represent (1) relationships among components and subcomponents of molecules and (2) relationships among classes of reactions defined by rules. 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)/CD3 complex. Likewise, we illustrate how hierarchical graphs can be used to document the similarity of two related rules for kinase-catalyzed phosphorylation of a protein substrate. We also demonstrate how a hierarchical graph representing a protein can be encoded in an XML-based format.« less
Super (a*, d*)-ℋ-antimagic total covering of second order of shackle graphs
NASA Astrophysics Data System (ADS)
Hesti Agustin, Ika; Dafik; Nisviasari, Rosanita; Prihandini, R. M.
2017-12-01
Let H be a simple and connected graph. A shackle of graph H, denoted by G = shack(H, v, n), is a graph G constructed by non-trivial graphs H 1, H 2, …, H n such that, for every 1 ≤ s, t ≤ n, H s and Ht have no a common vertex with |s - t| ≥ 2 and for every 1 ≤ i ≤ n - 1, Hi and H i+1 share exactly one common vertex v, called connecting vertex, and those k - 1 connecting vertices are all distinct. The graph G is said to be an (a*, d*)-H-antimagic total graph of second order if there exist a bijective function f : V(G) ∪ E(G) → {1, 2, …, |V(G)| + |E(G)|} such that for all subgraphs isomorphic to H, the total H-weights W(H)=\\displaystyle {\\sum }v\\in V(H)f(v)+\\displaystyle {\\sum }e\\in E(H)f(e) form an arithmetic sequence of second order of \\{a* ,a* +d* ,a* +3d* ,a* +6d* ,\\ldots ,a* +(\\frac{{n}2-n}{2})d* \\}, where a* and d* are positive integers and n is the number of all subgraphs isomorphic to H. An (a*, d*)-H-antimagic total labeling of second order f is called super if the smallest labels appear in the vertices. In this paper, we study a super (a*, d*)-H antimagic total labeling of second order of G = shack(H, v, n) by using a partition technique of second order.
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.
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.
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…
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.
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.
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:
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
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).
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.
Dynamics of functional failures and recovery in complex road networks
NASA Astrophysics Data System (ADS)
Zhan, Xianyuan; Ukkusuri, Satish V.; Rao, P. Suresh C.
2017-11-01
We propose a new framework for modeling the evolution of functional failures and recoveries in complex networks, with traffic congestion on road networks as the case study. Differently from conventional approaches, we transform the evolution of functional states into an equivalent dynamic structural process: dual-vertex splitting and coalescing embedded within the original network structure. The proposed model successfully explains traffic congestion and recovery patterns at the city scale based on high-resolution data from two megacities. Numerical analysis shows that certain network structural attributes can amplify or suppress cascading functional failures. Our approach represents a new general framework to model functional failures and recoveries in flow-based networks and allows understanding of the interplay between structure and function for flow-induced failure propagation and recovery.
Components of Adenovirus Genome Packaging
Ahi, Yadvinder S.; Mittal, Suresh K.
2016-01-01
Adenoviruses (AdVs) are icosahedral viruses with double-stranded DNA (dsDNA) genomes. Genome packaging in AdV is thought to be similar to that seen in dsDNA containing icosahedral bacteriophages and herpesviruses. Specific recognition of the AdV genome is mediated by a packaging domain located close to the left end of the viral genome and is mediated by the viral packaging machinery. Our understanding of the role of various components of the viral packaging machinery in AdV genome packaging has greatly advanced in recent years. Characterization of empty capsids assembled in the absence of one or more components involved in packaging, identification of the unique vertex, and demonstration of the role of IVa2, the putative packaging ATPase, in genome packaging have provided compelling evidence that AdVs follow a sequential assembly pathway. This review provides a detailed discussion on the functions of the various viral and cellular factors involved in AdV genome packaging. We conclude by briefly discussing the roles of the empty capsids, assembly intermediates, scaffolding proteins, portal vertex and DNA encapsidating enzymes in AdV assembly and packaging. PMID:27721809
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.
Galilean invariance and vertex renormalization in turbulence theory.
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\
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.
Lee, Nancy Raitano; Wallace, Gregory L.; Raznahan, Armin; Clasen, Liv S.; Giedd, Jay N.
2014-01-01
While researchers have gained a richer understanding of the neural correlates of executive function in adulthood, much less is known about how these abilities are represented in the developing brain and what structural brain networks underlie them. Thus, the current study examined how individual differences in executive function, as measured by the Trail Making Test (TMT), relate to structural covariance in the pediatric brain. The sample included 146 unrelated, typically developing youth (80 females), ages 9–14 years, who completed a structural MRI scan of the brain and the Halstead-Reitan TMT (intermediate form). TMT scores used to index executive function included those that evaluated set-shifting ability: Trails B time (number-letter sequencing) and the difference in time between Trails B and A (number sequencing only). Anatomical coupling was measured by examining correlations between mean cortical thickness (MCT) across the entire cortical ribbon and individual vertex thickness measured at ~81,000 vertices. To examine how TMT scores related to anatomical coupling strength, linear regression was utilized and the interaction between age-normed TMT scores and both age and sex-normed MCT was used to predict vertex thickness. Results revealed that stronger Trails B scores were associated with greater anatomical coupling between a large swath of prefrontal cortex and the rest of cortex. For the difference between Trails B and A, a network of regions in the frontal, temporal, and parietal lobes was found to be more tightly coupled with the rest of cortex in stronger performers. This study is the first to highlight the importance of structural covariance in in the prediction of individual differences in executive function skills in youth. Thus, it adds to the growing literature on the neural correlates of childhood executive functions and identifies neuroanatomic coupling as a biological substrate that may contribute to executive function and dysfunction in childhood. PMID:25071613
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
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.
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.
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.
Measurement of the bottom hadron lifetime at the Z 0 resonancce
DOE Office of Scientific and Technical Information (OSTI.GOV)
Fujino, Donald Hideo
1992-06-01
We have measured the bottom hadron lifetime from bmore » $$\\bar{b}$$ events produced at the Z 0 resonance. Using the precision vertex detectors of the Mark II detector at the Stanford Linear Collider, we developed an impact parameter tag to identify bottom hadrons. The vertex tracking system resolved impact parameters to 30 μm for high momentum tracks, and 70 μm for tracks with a momentum of 1 GeV. We selected B hadrons with an efficiency of 40% and a sample purity of 80%, by requiring there be at least two tracks in a single jet that significantly miss the Z 0 decay vertex. From a total of 208 hadronic Z 0 events collected by the Mark II detector in 1990, we tagged 53 jets, of which 22 came from 11 double-tagged events. The jets opposite the tagged ones, referred as the ``untagged`` sample, are rich in B hadrons and unbiased in B decay times. The variable Σδ is the sum of impact parameters from tracks in the jet, and contains vital information on the B decay time. We measured the B lifetime from a one-parameter likelihood fit to the untagged Σδ distribution, obtaining τ b = 1.53 $$+0.55\\atop{-0.45}$$ ± 0.16 ps which agrees with the current world average. The first error is statistical and the second is systematic. The systematic error was dominated by uncertainties in the track resolution function. As a check, we also obtained consistent results using the Σδ distribution from the tagged jets and from the entire hadronic sample without any bottom enrichment.« less
Measurement of the bottom hadron lifetime at the Z sup 0 resonancce
DOE Office of Scientific and Technical Information (OSTI.GOV)
Fujino, D.H.
1992-06-01
We have measured the bottom hadron lifetime from b{bar b} events produced at the Z{sup 0} resonance. Using the precision vertex detectors of the Mark II detector at the Stanford Linear Collider, we developed an impact parameter tag to identify bottom hadrons. The vertex tracking system resolved impact parameters to 30 {mu}m for high momentum tracks, and 70 {mu}m for tracks with a momentum of 1 GeV. We selected B hadrons with an efficiency of 40% and a sample purity of 80%, by requiring there be at least two tracks in a single jet that significantly miss the Z{sup 0}more » decay vertex. From a total of 208 hadronic Z{sup 0} events collected by the Mark II detector in 1990, we tagged 53 jets, of which 22 came from 11 double-tagged events. The jets opposite the tagged ones, referred as the untagged'' sample, are rich in B hadrons and unbiased in B decay times. The variable {Sigma}{delta} is the sum of impact parameters from tracks in the jet, and contains vital information on the B decay time. We measured the B lifetime from a one-parameter likelihood fit to the untagged {Sigma}{delta} distribution, obtaining {tau}{sub b} = 1.53{sub {minus}0.45}{sup +0.55}{plus minus}0.16 ps which agrees with the current world average. The first error is statistical and the second is systematic. The systematic error was dominated by uncertainties in the track resolution function. As a check, we also obtained consistent results using the {Sigma}{delta} distribution from the tagged jets and from the entire hadronic sample without any bottom enrichment.« less
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.
Gender differences in the neural underpinning of perceiving and appreciating the beauty of the body.
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.
Mak, E; Bergsland, N; Dwyer, M G; Zivadinov, R; Kandiah, N
2014-12-01
The involvement of subcortical deep gray matter and cortical thinning associated with mild Parkinson disease remains poorly understood. We assessed cortical thickness and subcortical volumes in patients with Parkinson disease without dementia and evaluated their associations with cognitive dysfunction. The study included 90 patients with mild Parkinson disease without dementia. Neuropsychological assessments classified the sample into patients with mild cognitive impairment (n = 25) and patients without cognitive impairment (n = 65). Volumetric data for subcortical structures were obtained by using the FMRIB Integrated Registration and Segmentation Tool while whole-brain, gray and white matter volumes were estimated by using Structural Image Evaluation, with Normalization of Atrophy. Vertex-based shape analyses were performed to investigate shape differences in subcortical structures. Vertex-wise group differences in cortical thickness were also assessed. Volumetric comparisons between Parkinson disease with mild cognitive impairment and Parkinson disease with no cognitive impairment were performed by using ANCOVA. Associations of subcortical structures with both cognitive function and disease severity were assessed by using linear regression models. Compared with Parkinson disease with no cognitive impairment, Parkinson disease with mild cognitive impairment demonstrated reduced volumes of the thalamus (P = .03) and the nucleus accumbens (P = .04). Significant associations were found for the nucleus accumbens and putamen with performances on the attention/working memory domains (P < .05) and nucleus accumbens and language domains (P = .04). The 2 groups did not differ in measures of subcortical shape or in cortical thickness. Patients with Parkinson disease with mild cognitive impairment demonstrated reduced subcortical volumes, which were associated with cognitive deficits. The thalamus, nucleus accumbens, and putamen may serve as potential biomarkers for Parkinson disease-mild cognitive impairment. © 2014 by American Journal of Neuroradiology.
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.
Distinct DNA exit and packaging portals in the virus Acanthamoeba polyphaga mimivirus.
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
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].
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.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Vijayan, S; Xiong, Z; Rudin, S
Purpose: The functionality of the Dose-Tracking System (DTS) has been expanded to include the calculation of the Kerma-Area Product (KAP) for non-uniform x-ray fields such as result from the use of compensation filters during fluoroscopic procedures Methods: The DTS calculates skin dose during fluoroscopic interventions and provides a color-coded dose map on a patient-graphic model. The KAP is the integral of air kerma over the x-ray field and is usually measured with a transmission-ionization chamber that intercepts the entire x-ray beam. The DTS has been modified to determine KAP when there are beam non-uniformities that can be modeled. For example,more » the DTS includes models of the three compensation filters with tapered edges located in the collimator assembly of the Toshiba Infinix fluoroscopic C-Arm and can track their movement. To determine the air kerma after the filters, DTS includes transmission factors for the compensation filters as a function of kVp and beam filtration. A virtual KAP dosimeter is simulated in the DTS by an array of graphic vertices; the air kerma at each vertex is corrected by the field non-uniformity, which in this case is the attenuation factor for those rays which pass through the filter. The products of individual vertex air-kerma values for all vertices within the beam times the effective-area-per-vertex are summed for each x-ray pulse to yield the KAP per pulse and the cumulative KAP for the procedure is then calculated. Results: The KAP values estimated by DTS with the compensation filter inserted into the x-ray field agree within ± 6% with the values displayed on the fluoroscopy unit monitor, which are measured with a transmission chamber. Conclusion: The DTS can account for field non-uniformities such as result from the use of compensation filters in calculating KAP and can obviate the need for a KAP transmission ionization chamber. Partial support from NIH Grant R01-EB002873 and Toshiba Medical Systems Corp.« 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 .
Diaphragm motion quantification in megavoltage cone-beam CT projection images.
Chen, Mingqing; Siochi, R Alfredo
2010-05-01
To quantify diaphragm motion in megavoltage (MV) cone-beam computed tomography (CBCT) projections. User identified ipsilateral hemidiaphragm apex (IHDA) positions in two full exhale and inhale frames were used to create bounding rectangles in all other frames of a CBCT scan. The bounding rectangle was enlarged to create a region of interest (ROI). ROI pixels were associated with a cost function: The product of image gradients and a gradient direction matching function for an ideal hemidiaphragm determined from 40 training sets. A dynamic Hough transform (DHT) models a hemidiaphragm as a contour made of two parabola segments with a common vertex (the IHDA). The images within the ROIs are transformed into Hough space where a contour's Hough value is the sum of the cost function over all contour pixels. Dynamic programming finds the optimal trajectory of the common vertex in Hough space subject to motion constraints between frames, and an active contour model further refines the result. Interpolated ray tracing converts the positions to room coordinates. Root-mean-square (RMS) distances between these positions and those resulting from an expert's identification of the IHDA were determined for 21 Siemens MV CBCT scans. Computation time on a 2.66 GHz CPU was 30 s. The average craniocaudal RMS error was 1.38 +/- 0.67 mm. While much larger errors occurred in a few near-sagittal frames on one patient's scans, adjustments to algorithm constraints corrected them. The DHT based algorithm can compute IHDA trajectories immediately prior to radiation therapy on a daily basis using localization MVCBCT projection data. This has potential for calibrating external motion surrogates against diaphragm motion.
Elastic strain field due to an inclusion of a polyhedral shape with a non-uniform lattice misfit
NASA Astrophysics Data System (ADS)
Nenashev, A. V.; Dvurechenskii, A. V.
2017-03-01
An analytical solution in a closed form is obtained for the three-dimensional elastic strain distribution in an unlimited medium containing an inclusion with a coordinate-dependent lattice mismatch (an eigenstrain). Quantum dots consisting of a solid solution with a spatially varying composition are examples of such inclusions. It is assumed that both the inclusion and the surrounding medium (the matrix) are elastically isotropic and have the same Young's modulus and Poisson ratio. The inclusion shape is supposed to be an arbitrary polyhedron, and the coordinate dependence of the lattice misfit, with respect to the matrix, is assumed to be a polynomial of any degree. It is shown that, both inside and outside the inclusion, the strain tensor is expressed as a sum of contributions of all faces, edges, and vertices of the inclusion. Each of these contributions, as a function of the observation point's coordinates, is a product of some polynomial and a simple analytical function, which is the solid angle subtended by the face from the observation point (for a contribution of a face), or the potential of the uniformly charged edge (for a contribution of an edge), or the distance from the vertex to the observation point (for a contribution of a vertex). The method of constructing the relevant polynomial functions is suggested. We also found out that similar expressions describe an electrostatic or gravitational potential, as well as its first and second derivatives, of a polyhedral body with a charge/mass density that depends on coordinates polynomially.
Andoh, Jamila; Zatorre, Robert J.
2011-01-01
Repetitive transcranial magnetic stimulation (rTMS) has been shown to interfere with many components of language processing, including semantic, syntactic, and phonologic. However, not much is known about its effects on nonlinguistic auditory processing, especially its action on Heschl's gyrus (HG). We aimed to investigate the behavioral and neural basis of rTMS during a melody processing task, while targeting the left HG, the right HG, and the Vertex as a control site. Response times (RT) were normalized relative to the baseline-rTMS (Vertex) and expressed as percentage change from baseline (%RT change). We also looked at sex differences in rTMS-induced response as well as in functional connectivity during melody processing using rTMS and functional magnetic resonance imaging (fMRI). fMRI results showed an increase in the right HG compared with the left HG during the melody task, as well as sex differences in functional connectivity indicating a greater interhemispheric connectivity between left and right HG in females compared with males. TMS results showed that 10 Hz-rTMS targeting the right HG induced differential effects according to sex, with a facilitation of performance in females and an impairment of performance in males. We also found a differential correlation between the %RT change after 10 Hz-rTMS targeting the right HG and the interhemispheric functional connectivity between right and left HG, indicating that an increase in interhemispheric functional connectivity was associated with a facilitation of performance. This is the first study to report a differential rTMS-induced interference with melody processing depending on sex. In addition, we showed a relationship between the interference induced by rTMS on behavioral performance and the neural activity in the network connecting left and right HG, suggesting that the interhemispheric functional connectivity could determine the degree of modulation of behavioral performance. PMID:21811478
Effective temperature in an interacting vertex system: theory and experiment on artificial spin ice.
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.
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…
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
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.
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.
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.
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.
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.
Renormalization of QCD in the interpolating momentum subtraction scheme at three loops
NASA Astrophysics Data System (ADS)
Gracey, J. A.; Simms, R. M.
2018-04-01
We introduce a more general set of kinematic renormalization schemes than the original momentum subtraction schemes of Celmaster and Gonsalves. These new schemes will depend on a parameter ω , which tags the external momentum of one of the legs of the three-point vertex functions in QCD. In each of the three new schemes, we renormalize QCD in the Landau and maximal Abelian gauges and establish the three-loop renormalization group functions in each gauge. For an application, we evaluate two critical exponents at the Banks-Zaks fixed point and demonstrate that their values appear to be numerically scheme independent in a subrange of the conformal window.
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.
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
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.
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.
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.
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
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.
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.
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
Dual little strings and their partition functions
NASA Astrophysics Data System (ADS)
Bastian, Brice; Hohenegger, Stefan; Iqbal, Amer; Rey, Soo-Jong
2018-05-01
We study the topological string partition function of a class of toric, double elliptically fibered Calabi-Yau threefolds XN ,M at a generic point in the Kähler moduli space. These manifolds engineer little string theories in five dimensions or lower and are dual to stacks of M5-branes probing a transverse orbifold singularity. Using the refined topological vertex formalism, we explicitly calculate a generic building block which allows us to compute the topological string partition function of XN ,M as a series expansion in different Kähler parameters. Using this result, we give further explicit proof for a duality found previously in the literature, which relates XN ,M˜XN',M' for N M =N'M' and gcd (N ,M )=gcd (N',M') .
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
NASA Astrophysics Data System (ADS)
Batchelor, Murray T.; Wille, Luc T.
The Table of Contents for the book is as follows: * Preface * Modelling the Immune System - An Example of the Simulation of Complex Biological Systems * Brief Overview of Quantum Computation * Quantal Information in Statistical Physics * Modeling Economic Randomness: Statistical Mechanics of Market Phenomena * Essentially Singular Solutions of Feigenbaum- Type Functional Equations * Spatiotemporal Chaotic Dynamics in Coupled Map Lattices * Approach to Equilibrium of Chaotic Systems * From Level to Level in Brain and Behavior * Linear and Entropic Transformations of the Hydrophobic Free Energy Sequence Help Characterize a Novel Brain Polyprotein: CART's Protein * Dynamical Systems Response to Pulsed High-Frequency Fields * Bose-Einstein Condensates in the Light of Nonlinear Physics * Markov Superposition Expansion for the Entropy and Correlation Functions in Two and Three Dimensions * Calculation of Wave Center Deflection and Multifractal Analysis of Directed Waves Through the Study of su(1,1)Ferromagnets * Spectral Properties and Phases in Hierarchical Master Equations * Universality of the Distribution Functions of Random Matrix Theory * The Universal Chiral Partition Function for Exclusion Statistics * Continuous Space-Time Symmetries in a Lattice Field Theory * Quelques Cas Limites du Problème à N Corps Unidimensionnel * Integrable Models of Correlated Electrons * On the Riemann Surface of the Three-State Chiral Potts Model * Two Exactly Soluble Lattice Models in Three Dimensions * Competition of Ferromagnetic and Antiferromagnetic Order in the Spin-l/2 XXZ Chain at Finite Temperature * Extended Vertex Operator Algebras and Monomial Bases * Parity and Charge Conjugation Symmetries and S Matrix of the XXZ Chain * An Exactly Solvable Constrained XXZ Chain * Integrable Mixed Vertex Models Ftom the Braid-Monoid Algebra * From Yang-Baxter Equations to Dynamical Zeta Functions for Birational Tlansformations * Hexagonal Lattice Directed Site Animals * Direction in the Star-Triangle Relations * A Self-Avoiding Walk Through Exactly Solved Lattice Models in Statistical Mechanics
Effect of severity of illness on cesarean delivery rates in Washington State.
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.
Highlights from PHENIX at RHIC
NASA Astrophysics Data System (ADS)
Nouicer, Rachid
2018-02-01
Hadrons conveying strange quarks or heavy quarks are essential probes of the hot and dense medium created in relativistic heavy-ion collisions. With hidden strangeness, ϕ meson production and its transport in the nuclear medium have attracted high interest since its discovery. Heavy quark-antiquark pairs, like charmonium and bottomonium mesons, are mainly produced in initial hard scattering processes of partons. While some of the produced pairs form bound quarkonia, the vast majority hadronize into particles carrying open heavy flavor. In this context, the PHENIX collaboration carries out a comprehensive physics program which studies the ϕ meson production, and heavy flavor production in relativistic heavy-ion collisions at RHIC. In recent years, the PHENIX experiment upgraded the detector in installing silicon vertex tracker (VTX) at mid-rapidity region and forward silicon vertex tracker (FVTX) at the forward rapidity region. With these new upgrades, the experiment has collected large data samples, and enhanced the capability of heavy flavor measurements via precision tracking. This paper summarizes the latest PHENIX results concerning ϕ meson, open and closed charm and beauty heavy quark production in relativistic heavy-ion collisions. These results are presented as a function of rapidity, energy and system size, and their interpretation with respect to the current theoretical understanding.
Sutapun, Boonsong; Somboonkaew, Armote; Amarit, Ratthasart; Chanhorm, Sataporn
2015-01-01
This work describes a new design of a fiber-optic confocal probe suitable for measuring the central thicknesses of small-radius optical lenses or similar objects. The proposed confocal probe utilizes an integrated camera that functions as a shape-encoded position-sensing device. The confocal signal for thickness measurement and beam-shape data for off-axis measurement can be simultaneously acquired using the proposed probe. Placing the probe’s focal point off-center relative to a sample’s vertex produces a non-circular image at the camera’s image plane that closely resembles an ellipse for small displacements. We were able to precisely position the confocal probe’s focal point relative to the vertex point of a ball lens with a radius of 2.5 mm, with a lateral resolution of 1.2 µm. The reflected beam shape based on partial blocking by an aperture was analyzed and verified experimentally. The proposed confocal probe offers a low-cost, high-precision technique, an alternative to a high-cost three-dimensional surface profiler, for tight quality control of small optical lenses during the manufacturing process. PMID:25871720
A scale-free network with limiting on vertices
NASA Astrophysics Data System (ADS)
Tang, Lian; Wang, Bin
2010-05-01
We propose and analyze a random graph model which explains a phenomena in the economic company network in which company may not expand its business at some time due to the limiting of money and capacity. The random graph process is defined as follows: at any time-step t, (i) with probability α(k) and independently of other time-step, each vertex vi (i≤t-1) is inactive which means it cannot be connected by more edges, where k is the degree of vi at the time-step t; (ii) a new vertex vt is added along with m edges incident with vt at one time and its neighbors are chosen in the manner of preferential attachment. We prove that the degree distribution P(k) of this random graph process satisfies P(k)∝C1k if α(ṡ) is a constant α0; and P(k)∝C2k-3 if α(ℓ)↓0 as ℓ↑∞, where C1,C2 are two positive constants. The analytical result is found to be in good agreement with that obtained by numerical simulations. Furthermore, we get the degree distributions in this model with m-varying functions by simulation.
Impact of MPEG-4 3D mesh coding on watermarking algorithms for polygonal 3D meshes
NASA Astrophysics Data System (ADS)
Funk, Wolfgang
2004-06-01
The MPEG-4 multimedia standard addresses the scene-based composition of audiovisual objects. Natural and synthetic multimedia content can be mixed and transmitted over narrow and broadband communication channels. Synthetic natural hybrid coding (SNHC) within MPEG-4 provides tools for 3D mesh coding (3DMC). We investigate the robustness of two different 3D watermarking algorithms for polygonal meshes with respect to 3DMC. The first algorithm is a blind detection scheme designed for labelling applications that require high bandwidth and low robustness. The second algorithm is a robust non-blind one-bit watermarking scheme intended for copyright protection applications. Both algorithms have been proposed by Benedens. We expect 3DMC to have an impact on the watermarked 3D meshes, as the algorithms used for our simulations work on vertex coordinates to encode the watermark. We use the 3DMC implementation provided with the MPEG-4 reference software and the Princeton Shape Benchmark model database for our simulations. The watermarked models are sent through the 3DMC encoder and decoder, and the watermark decoding process is performed. For each algorithm under consideration we examine the detection properties as a function of the quantization of the vertex coordinates.
Probing anomalous W W γ triple gauge bosons coupling at the LHeC
NASA Astrophysics Data System (ADS)
Li, Ruibo; Shen, Xiao-Min; Wang, Kai; Xu, Tao; Zhang, Liangliang; Zhu, Guohuai
2018-04-01
The precision measurement of the W W γ vertex at the future Large Hadron electron Collider (LHeC) at CERN is discussed in this paper. We propose to measure this vertex in the e-p →e-W±j channel as a complement to the conventional charged current νeγ j channel. In addition to the cross section measurement, χ2 method studies of angular variables provide powerful tools to probe the anomalous structure of triple gauge boson couplings. We study the distribution of the well-known azimuthal angle between the final state forward electron and jet in this vector-boson fusion process. On the other hand, full reconstruction of leptonic W decay opens a new opportunity to measure W polarization that is also sensitive to the anomalous triple gauge boson couplings. Taking into consideration the superior determination of parton distribution functions based on future LHeC data, the constraints of λγ and Δ κγ might reach up to O (10-3) level in the most ideal case with the 2 - 3 ab-1 data set, which shows a potential advantage compared to those from LHC and Large Electron-Positron Collider (LEP) data.
Learning-based 3D surface optimization from medical image reconstruction
NASA Astrophysics Data System (ADS)
Wei, Mingqiang; Wang, Jun; Guo, Xianglin; Wu, Huisi; Xie, Haoran; Wang, Fu Lee; Qin, Jing
2018-04-01
Mesh optimization has been studied from the graphical point of view: It often focuses on 3D surfaces obtained by optical and laser scanners. This is despite the fact that isosurfaced meshes of medical image reconstruction suffer from both staircases and noise: Isotropic filters lead to shape distortion, while anisotropic ones maintain pseudo-features. We present a data-driven method for automatically removing these medical artifacts while not introducing additional ones. We consider mesh optimization as a combination of vertex filtering and facet filtering in two stages: Offline training and runtime optimization. In specific, we first detect staircases based on the scanning direction of CT/MRI scanners, and design a staircase-sensitive Laplacian filter (vertex-based) to remove them; and then design a unilateral filtered facet normal descriptor (uFND) for measuring the geometry features around each facet of a given mesh, and learn the regression functions from a set of medical meshes and their high-resolution reference counterparts for mapping the uFNDs to the facet normals of the reference meshes (facet-based). At runtime, we first perform staircase-sensitive Laplacian filter on an input MC (Marching Cubes) mesh, and then filter the mesh facet normal field using the learned regression functions, and finally deform it to match the new normal field for obtaining a compact approximation of the high-resolution reference model. Tests show that our algorithm achieves higher quality results than previous approaches regarding surface smoothness and surface accuracy.
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
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
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
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.
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.
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.
Continuously differentiable PIC shape functions for triangular meshes
Barnes, D. C.
2018-03-21
In this study, a new class of continuously-differentiable shape functions is developed and applied to two-dimensional electrostatic PIC simulation on an unstructured simplex (triangle) mesh. It is shown that troublesome aliasing instabilities are avoided for cold plasma simulation in which the Debye length is as small as 0.01 cell sizes. These new shape functions satisfy all requirements for PIC particle shape. They are non-negative, have compact support, and partition unity. They are given explicitly by cubic expressions in the usual triangle logical (areal) coordinates. The shape functions are not finite elements because their structure depends on the topology of themore » mesh, in particular, the number of triangles neighboring each mesh vertex. Nevertheless, they may be useful as approximations to solution of other problems in which continuity of derivatives is required or desired.« less
Spectral function of a hole in the t - J model
DOE Office of Scientific and Technical Information (OSTI.GOV)
Liu, Z.; Manousakis, E.
1991-08-01
We give numerical solutions, on finite but large-size square lattices, of the equation for the single-hole Green's function obtained by the self-consistent approach of Schmitt-Rink {ital et} {ital al}. and Kane {ital et} {ital al}. The spectral function of the hole in a quantum antiferromagnet shows that most features describing the hole motion are in close agreement with the results of the exact diagonalization on the 4{sup 2} lattice in the region of {ital J}/{ital t}{le}0.2. Our results obtained on sufficiently large-size lattices suggest that certain important features of the spectral function survive in the thermodynamic limit while others changemore » due to finite-size effects. We find that the leading nonzero vertex correction is given by a two-loop diagram, which has a small contribution.« less
Continuously differentiable PIC shape functions for triangular meshes
DOE Office of Scientific and Technical Information (OSTI.GOV)
Barnes, D. C.
In this study, a new class of continuously-differentiable shape functions is developed and applied to two-dimensional electrostatic PIC simulation on an unstructured simplex (triangle) mesh. It is shown that troublesome aliasing instabilities are avoided for cold plasma simulation in which the Debye length is as small as 0.01 cell sizes. These new shape functions satisfy all requirements for PIC particle shape. They are non-negative, have compact support, and partition unity. They are given explicitly by cubic expressions in the usual triangle logical (areal) coordinates. The shape functions are not finite elements because their structure depends on the topology of themore » mesh, in particular, the number of triangles neighboring each mesh vertex. Nevertheless, they may be useful as approximations to solution of other problems in which continuity of derivatives is required or desired.« less
The In-Transit Vigilant Covering Tour Problem of Routing Unmanned Ground Vehicles
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
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.
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.
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.
Heavy and Heavy-Light Mesons in the Covariant Spectator Theory
NASA Astrophysics Data System (ADS)
Stadler, Alfred; Leitão, Sofia; Peña, M. T.; Biernat, Elmar P.
2018-05-01
The masses and vertex functions of heavy and heavy-light mesons, described as quark-antiquark bound states, are calculated with the Covariant Spectator Theory (CST). We use a kernel with an adjustable mixture of Lorentz scalar, pseudoscalar, and vector linear confining interaction, together with a one-gluon-exchange kernel. A series of fits to the heavy and heavy-light meson spectrum were calculated, and we discuss what conclusions can be drawn from it, especially about the Lorentz structure of the kernel. We also apply the Brodsky-Huang-Lepage prescription to express the CST wave functions for heavy quarkonia in terms of light-front variables. They agree remarkably well with light-front wave functions obtained in the Hamiltonian basis light-front quantization approach, even in excited states.
A non-symmetric Yang-Baxter algebra for the quantum nonlinear Schrödinger model
NASA Astrophysics Data System (ADS)
Vlaar, Bart
2013-06-01
We study certain non-symmetric wavefunctions associated with the quantum nonlinear Schrödinger model, introduced by Komori and Hikami using Gutkin’s propagation operator, which involves representations of the degenerate affine Hecke algebra. We highlight how these functions can be generated using a vertex-type operator formalism similar to the recursion defining the symmetric (Bethe) wavefunction in the quantum inverse scattering method. Furthermore, some of the commutation relations encoded in the Yang-Baxter equation for the relevant monodromy matrix are generalized to the non-symmetric case.
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
Lehar, Steven
2003-01-01
Visual illusions and perceptual grouping phenomena offer an invaluable tool for probing the computational mechanism of low-level visual processing. Some illusions, like the Kanizsa figure, reveal illusory contours that form edges collinear with the inducing stimulus. This kind of illusory contour has been modeled by neural network models by way of cells equipped with elongated spatial receptive fields designed to detect and complete the collinear alignment. There are, however, other illusory groupings which are not so easy to account for in neural network terms. The Ehrenstein illusion exhibits an illusory contour that forms a contour orthogonal to the stimulus instead of collinear with it. Other perceptual grouping effects reveal illusory contours that exhibit a sharp corner or vertex, and still others take the form of vertices defined by the intersection of three, four, or more illusory contours that meet at a point. A direct extension of the collinear completion models to account for these phenomena tends towards a combinatorial explosion, because it would suggest cells with specialized receptive fields configured to perform each of those completion types, each of which would have to be replicated at every location and every orientation across the visual field. These phenomena therefore challenge the adequacy of the neural network approach to account for these diverse perceptual phenomena. I have proposed elsewhere an alternative paradigm of neurocomputation in the harmonic resonance theory (Lehar 1999, see website), whereby pattern recognition and completion are performed by spatial standing waves across the neural substrate. The standing waves perform a computational function analogous to that of the spatial receptive fields of the neural network approach, except that, unlike that paradigm, a single resonance mechanism performs a function equivalent to a whole array of spatial receptive fields of different spatial configurations and of different orientations, and thereby avoids the combinatorial explosion inherent in the older paradigm. The present paper presents the directional harmonic model, a more specific development of the harmonic resonance theory, designed to account for specific perceptual grouping phenomena. Computer simulations of the directional harmonic model show that it can account for collinear contours as observed in the Kanizsa figure, orthogonal contours as seen in the Ehrenstein illusion, and a number of illusory vertex percepts composed of two, three, or more illusory contours that meet in a variety of configurations.
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.
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
NASA Astrophysics Data System (ADS)
Sure, Thomas; Bauer, Tobias; Heil, Joachim; Wesner, Joachim
2005-10-01
Cemented doublets and triplets can not be used for objectives working at wavelengths of 248 nm and shorter, because the optical cement can not withstand the high photon energies. It will be shown that high NA deep UV objectives can be designed and built successfully with the help of air spaced doublets. Assuring Strehl ratios above 95% enforces very tight tolerances. For example the distance error of the lens vertex to its mount has to be less than 1 μm. This calls for a new manufacturing precision never realized before in series production. We show how a white light Mirau interferometer can be used to measure lens vertex positions with an accuracy of 200 nm. We also demonstrate how the fine-tuning process can be optimized by using a "simulated star test", where the point-spread function is calculated in real time with a FFT-algorithm from the optical path difference data, acquired by a Twyman-Green interferometer. To realize the required precision, today various measurement techniques and production processes are used. Picking up the subgroups on different machining tools and measurement systems will loosen the accuracy. Here, we present the concept and the layout of a new manufacturing tool where we implemented the different measurement techniques needed in one CNC machining center. This tool is able to 1) adjust automatically the optical axis of the subgroups related to the machining axis better than 0.5 μm with the help of the stick-slip effect where a mechanical impulse is transferred by an electromagnetically driven hammer, 2) measure the lens vertex relative to the shoulder of the mount with an accuracy of 250 nm and 3) do all steps which are necessary to process the lens mount within the accuracies described above.
Uţă, M M; King, R B
2012-05-31
Structures of the beryllium-centered germanium clusters Be@Ge(n)(z) (n = 8, 7, 6; z = -4, -2, 0, +2) have been investigated by density functional theory to provide some insight regarding the smallest metal cluster that can encapsulate an interstitial atom. The lowest energy structures of the eight-vertex Be@Ge(8)(z) clusters (z = -4, -2, 0, +2) all have the Be atom at the center of a closed polyhedron, namely, a D(4d) square antiprism for Be@Ge(8)(4-), a D(2d) bisdisphenoid for Be@Ge(8)(2-), an ideal O(h) cube for Be@Ge(8), and a C(2v) distorted cube for Be@Ge(8)(2+). The Be-centered cubic structures predicted for Be@Ge(8) and Be@Ge(8)(2+) differ from the previously predicted lowest energy structures for the isoelectronic Ge(8)(2-) and Ge(8). This appears to be related to the larger internal volume of the cube relative to other closed eight-vertex polyhedra. The lowest energy structures for the smaller seven- and six-vertex clusters Be@Ge(n)(z) (n = 7, 6; z = -4, -2, 0, +2) no longer have the Be atom at the center of a closed Ge(n) polyhedron. Instead, either the Ge(n) polyhedron has opened up to provide a larger volume for the Be atom or the Be atom has migrated to the surface of the polyhedron. However, higher energy structures are found in which the Be atom is located at the center of a Ge(n) (n = 7, 6) polyhedron. Examples of such structures are a centered C(2v) capped trigonal prismatic structure for Be@Ge(7)(2-), a centered D(5h) pentagonal bipyramidal structure for Be@Ge(7), a centered D(3h) trigonal prismatic structure for Be@Ge(6)(4-), and a centered octahedral structure for Be@Ge(6). Cluster buildup reactions of the type Be@Ge(n)(z) + Ge(2) → Be@Ge(n+2)(z) (n = 6, 8; z = -4, -2, 0, +2) are all predicted to be highly exothermic. This suggests that interstitial clusters having an endohedral atom inside a bare post transition element polyhedron with eight or fewer vertices are less than the optimum size. This is consistent with the experimental observation of several types of 10-vertex polyhedral bare post transition element clusters with interstitial atoms but the failure to observe such clusters with external polyhedra having eight or fewer vertices.
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.
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.
All-reflective optical target illumination system with high numerical aperture
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
Poisson equation for the three-loop ladder diagram in string theory at genus one
NASA Astrophysics Data System (ADS)
Basu, Anirban
2016-11-01
The three-loop ladder diagram is a graph with six links and four cubic vertices that contributes to the D12ℛ4 amplitude at genus one in type II string theory. The vertices represent the insertion points of vertex operators on the toroidal worldsheet and the links represent scalar Green functions connecting them. By using the properties of the Green function and manipulating the various expressions, we obtain a modular invariant Poisson equation satisfied by this diagram, with source terms involving one-, two- and three-loop diagrams. Unlike the source terms in the Poisson equations for diagrams at lower orders in the momentum expansion or the Mercedes diagram, a particular source term involves a five-point function containing a holomorphic and a antiholomorphic worldsheet derivative acting on different Green functions. We also obtain simple equalities between topologically distinct diagrams, and consider some elementary examples.
Padilla-Sanchez, Victor; Gao, Song; Kim, Hyung Rae; Kihara, Daisuke; Sun, Lei; Rossmann, Michael G; Rao, Venigalla B
2014-03-06
Tailed bacteriophages and herpesviruses consist of a structurally well conserved dodecameric portal at a special 5-fold vertex of the capsid. The portal plays critical roles in head assembly, genome packaging, neck/tail attachment, and genome ejection. Although the structures of portals from phages φ29, SPP1, and P22 have been determined, their mechanistic roles have not been well understood. Structural analysis of phage T4 portal (gp20) has been hampered because of its unusual interaction with the Escherichia coli inner membrane. Here, we predict atomic models for the T4 portal monomer and dodecamer, and we fit the dodecamer into the cryo-electron microscopy density of the phage portal vertex. The core structure, like that from other phages, is cone shaped with the wider end containing the "wing" and "crown" domains inside the phage head. A long "stem" encloses a central channel, and a narrow "stalk" protrudes outside the capsid. A biochemical approach was developed to analyze portal function by incorporating plasmid-expressed portal protein into phage heads and determining the effect of mutations on head assembly, DNA translocation, and virion production. We found that the protruding loops of the stalk domain are involved in assembling the DNA packaging motor. A loop that connects the stalk to the channel might be required for communication between the motor and the portal. The "tunnel" loops that project into the channel are essential for sealing the packaged head. These studies established that the portal is required throughout the DNA packaging process, with different domains participating at different stages of genome packaging. © 2013.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Sechin, Ivan, E-mail: shnbuz@gmail.com, E-mail: zotov@mi.ras.ru; ITEP, B. Cheremushkinskaya Str. 25, Moscow 117218; Zotov, Andrei, E-mail: shnbuz@gmail.com, E-mail: zotov@mi.ras.ru
In this paper we propose versions of the associative Yang-Baxter equation and higher order R-matrix identities which can be applied to quantum dynamical R-matrices. As is known quantum non-dynamical R-matrices of Baxter-Belavin type satisfy this equation. Together with unitarity condition and skew-symmetry it provides the quantum Yang-Baxter equation and a set of identities useful for different applications in integrable systems. The dynamical R-matrices satisfy the Gervais-Neveu-Felder (or dynamical Yang-Baxter) equation. Relation between the dynamical and non-dynamical cases is described by the IRF (interaction-round-a-face)-Vertex transformation. An alternative approach to quantum (semi-)dynamical R-matrices and related quantum algebras was suggested by Arutyunov, Chekhov,more » and Frolov (ACF) in their study of the quantum Ruijsenaars-Schneider model. The purpose of this paper is twofold. First, we prove that the ACF elliptic R-matrix satisfies the associative Yang-Baxter equation with shifted spectral parameters. Second, we directly prove a simple relation of the IRF-Vertex type between the Baxter-Belavin and the ACF elliptic R-matrices predicted previously by Avan and Rollet. It provides the higher order R-matrix identities and an explanation of the obtained equations through those for non-dynamical R-matrices. As a by-product we also get an interpretation of the intertwining transformation as matrix extension of scalar theta function likewise R-matrix is interpreted as matrix extension of the Kronecker function. Relations to the Gervais-Neveu-Felder equation and identities for the Felder’s elliptic R-matrix are also discussed.« less
A Mutation in UL15 of Herpes Simplex Virus 1 That Reduces Packaging of Cleaved Genomes▿
Yang, Kui; Wills, Elizabeth G.; Baines, Joel D.
2011-01-01
Herpesvirus genomic DNA is cleaved from concatemers that accumulate in infected cell nuclei. Genomic DNA is inserted into preassembled capsids through a unique portal vertex. Extensive analyses of viral mutants have indicated that intact capsids, the portal vertex, and all components of a tripartite terminase enzyme are required to both cleave and package viral DNA, suggesting that DNA cleavage and packaging are inextricably linked. Because the processes have not been functionally separable, it has been difficult to parse the roles of individual proteins in the DNA cleavage/packaging reaction. In the present study, a virus bearing the deletion of codons 400 to 420 of UL15, encoding a terminase component, was analyzed. This virus, designated vJB27, failed to replicate on noncomplementing cells but cleaved concatemeric DNA to ca. 35 to 98% of wild-type levels. No DNA cleavage was detected in cells infected with a UL15-null virus or a virus lacking UL15 codons 383 to 385, comprising a motif proposed to couple ATP hydrolysis to DNA translocation. The amount of vJB27 DNA protected from DNase I digestion was reduced compared to the wild-type virus by 6.5- to 200-fold, depending on the DNA fragment analyzed, thus indicating a profound defect in DNA packaging. Capsids containing viral DNA were not detected in vJB27-infected cells, as determined by electron microscopy. These data suggest that pUL15 plays an essential role in DNA translocation into the capsid and indicate that this function is separable from its role in DNA cleavage. PMID:21880766
Analysing Local Sparseness in the Macaque Brain Network
Singh, Raghavendra; Nagar, Seema; Nanavati, Amit A.
2015-01-01
Understanding the network structure of long distance pathways in the brain is a necessary step towards developing an insight into the brain’s function, organization and evolution. Dense global subnetworks of these pathways have often been studied, primarily due to their functional implications. Instead we study sparse local subnetworks of the pathways to establish the role of a brain area in enabling shortest path communication between its non-adjacent topological neighbours. We propose a novel metric to measure the topological communication load on a vertex due to its immediate neighbourhood, and show that in terms of distribution of this local communication load, a network of Macaque long distance pathways is substantially different from other real world networks and random graph models. Macaque network contains the entire range of local subnetworks, from star-like networks to clique-like networks, while other networks tend to contain a relatively small range of subnetworks. Further, sparse local subnetworks in the Macaque network are not only found across topographical super-areas, e.g., lobes, but also within a super-area, arguing that there is conservation of even relatively short-distance pathways. To establish the communication role of a vertex we borrow the concept of brokerage from social science, and present the different types of brokerage roles that brain areas play, highlighting that not only the thalamus, but also cingulate gyrus and insula often act as “relays” for areas in the neocortex. These and other analysis of communication load and roles of the sparse subnetworks of the Macaque brain provide new insights into the organisation of its pathways. PMID:26437077
QSPR modeling: graph connectivity indices versus line graph connectivity indices
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.
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.
NASA Astrophysics Data System (ADS)
Ansari, R.; Sadeghi, F.; Darvizeh, M.
2016-02-01
This article aims to present a comprehensive study on the oscillatory behavior of concentric carbon nanocones (CNCs) inside carbon nanotubes (CNTs) using a continuum approach. To this end, the optimum radius of nanotube for which the nanocone lies on the tube axis is determined based on the distribution of suction energy. Using the Runge-Kutta numerical integration scheme, the equation of motion is solved numerically to attain the time history of displacement and velocity of nanocone. It is observed that the oscillation of nanocone occurs with respect to its axial equilibrium distance which moves further away from the middle axis of nanotube as the number of pentagons increases. A novel semi-analytical expression as a function of geometrical parameters, initial conditions and cone vertex direction is also proposed for the precise evaluation of oscillation frequency. With respect to the proposed frequency expression, a detailed parametric study is conducted to get an insight into the effects of number of pentagons, cone vertex direction and initial conditions on the oscillatory behavior of CNC-CNT oscillators. It is found that nanocones with more pentagons generate greater maximum frequencies inside nanotubes. Furthermore, it is shown that higher maximum frequencies can be achieved if the nanocone enters the nanotube from base.
Tosun, Tuğçe; Berkay, Dilara; Sack, Alexander T; Çakmak, Yusuf Ö; Balcı, Fuat
2017-08-01
Decisions are made based on the integration of available evidence. The noise in evidence accumulation leads to a particular speed-accuracy tradeoff in decision-making, which can be modulated and optimized by adaptive decision threshold setting. Given the effect of pre-SMA activity on striatal excitability, we hypothesized that the inhibition of pre-SMA would lead to higher decision thresholds and an increased accuracy bias. We used offline continuous theta burst stimulation to assess the effect of transient inhibition of the right pre-SMA on the decision processes in a free-response two-alternative forced-choice task within the drift diffusion model framework. Participants became more cautious and set higher decision thresholds following right pre-SMA inhibition compared with inhibition of the control site (vertex). Increased decision thresholds were accompanied by an accuracy bias with no effects on post-error choice behavior. Participants also exhibited higher drift rates as a result of pre-SMA inhibition compared with the vertex inhibition. These results, in line with the striatal theory of speed-accuracy tradeoff, provide evidence for the functional role of pre-SMA activity in decision threshold modulation. Our results also suggest that pre-SMA might be a part of the brain network associated with the sensory evidence integration.
Structure, function and dynamics in adenovirus maturation
DOE Office of Scientific and Technical Information (OSTI.GOV)
Mangel, Walter F.; San Martín, Carmen
2014-11-21
Here we review the current knowledge on maturation of adenovirus, a non-enveloped icosahedral eukaryotic virus. The adenovirus dsDNA genome fills the capsid in complex with a large amount of histone-like viral proteins, forming the core. Maturation involves proteolytic cleavage of several capsid and core precursor proteins by the viral protease (AVP). AVP uses a peptide cleaved from one of its targets as a “molecular sled” to slide on the viral genome and reach its substrates, in a remarkable example of one-dimensional chemistry. Immature adenovirus containing the precursor proteins lacks infectivity because of its inability to uncoat. The immature core ismore » more compact and stable than the mature one, due to the condensing action of unprocessed core polypeptides; shell precursors underpin the vertex region and the connections between capsid and core. Maturation makes the virion metastable, priming it for stepwise uncoating by facilitating vertex release and loosening the condensed genome and its attachment to the icosahedral shell. The packaging scaffold protein L1 52/55k is also a substrate for AVP. Proteolytic processing of L1 52/55k disrupts its interactions with other virion components, providing a mechanism for its removal during maturation. In conclusion, possible roles for maturation of the terminal protein are discussed.« less
GPU based contouring method on grid DEM data
NASA Astrophysics Data System (ADS)
Tan, Liheng; Wan, Gang; Li, Feng; Chen, Xiaohui; Du, Wenlong
2017-08-01
This paper presents a novel method to generate contour lines from grid DEM data based on the programmable GPU pipeline. The previous contouring approaches often use CPU to construct a finite element mesh from the raw DEM data, and then extract contour segments from the elements. They also need a tracing or sorting strategy to generate the final continuous contours. These approaches can be heavily CPU-costing and time-consuming. Meanwhile the generated contours would be unsmooth if the raw data is sparsely distributed. Unlike the CPU approaches, we employ the GPU's vertex shader to generate a triangular mesh with arbitrary user-defined density, in which the height of each vertex is calculated through a third-order Cardinal spline function. Then in the same frame, segments are extracted from the triangles by the geometry shader, and translated to the CPU-side with an internal order in the GPU's transform feedback stage. Finally we propose a "Grid Sorting" algorithm to achieve the continuous contour lines by travelling the segments only once. Our method makes use of multiple stages of GPU pipeline for computation, which can generate smooth contour lines, and is significantly faster than the previous CPU approaches. The algorithm can be easily implemented with OpenGL 3.3 API or higher on consumer-level PCs.
The role of meson exchanges in light-by-light scattering
NASA Astrophysics Data System (ADS)
Lebiedowicz, Piotr; Szczurek, Antoni
2017-09-01
We discuss the role of meson exchange mechanisms in γγ → γγ scattering. Several pseudoscalar (π0, η, η‧ (958), ηc (1 S), ηc (2 S)), scalar (f0 (500), f0 (980), a0 (980), f0 (1370), χc0 (1 P)) and tensor (f2 (1270), a2 (1320), f2‧ (1525), f2 (1565), a2 (1700)) mesons are taken into account. We consider not only s-channel but also for the first time t- and u-channel meson exchange amplitudes corrected for off-shell effects including vertex form factors. We find that, depending on not well known vertex form factors, the meson exchange amplitudes interfere among themselves and could interfere with fermion-box amplitudes and modify the resulting cross sections. The meson contributions are shown as a function of collision energy as well as angular distributions are presented. Interesting interference effects separately for light pseudoscalar, scalar and tensor meson groups are discussed. The meson exchange contributions may be potentially important in the context of a measurement performed recently in ultraperipheral collisions of heavy ions by the ATLAS collaboration. The light-by-light interactions could be studied in future in electron-positron collisions by the Belle II at SuperKEKB accelerator.
Development of monolithic pixel detector with SOI technology for the ILC vertex detector
NASA Astrophysics Data System (ADS)
Yamada, M.; Ono, S.; Tsuboyama, T.; Arai, Y.; Haba, J.; Ikegami, Y.; Kurachi, I.; Togawa, M.; Mori, T.; Aoyagi, W.; Endo, S.; Hara, K.; Honda, S.; Sekigawa, D.
2018-01-01
We have been developing a monolithic pixel sensor for the International Linear Collider (ILC) vertex detector with the 0.2 μm FD-SOI CMOS process by LAPIS Semiconductor Co., Ltd. We aim to achieve a 3 μm single-point resolution required for the ILC with a 20×20 μm2 pixel. Beam bunch crossing at the ILC occurs every 554 ns in 1-msec-long bunch trains with an interval of 200 ms. Each pixel must record the charge and time stamp of a hit to identify a collision bunch for event reconstruction. Necessary functions include the amplifier, comparator, shift register, analog memory and time stamp implementation in each pixel, and column ADC and Zero-suppression logic on the chip. We tested the first prototype sensor, SOFIST ver.1, with a 120 GeV proton beam at the Fermilab Test Beam Facility in January 2017. SOFIST ver.1 has a charge sensitive amplifier and two analog memories in each pixel, and an 8-bit Wilkinson-type ADC is implemented for each column on the chip. We measured the residual of the hit position to the reconstructed track. The standard deviation of the residual distribution fitted by a Gaussian is better than 3 μm.
Incremental k-core decomposition: Algorithms and evaluation
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
Nonperturbative quark, gluon, and meson correlators of unquenched QCD
NASA Astrophysics Data System (ADS)
Cyrol, Anton K.; Mitter, Mario; Pawlowski, Jan M.; Strodthoff, Nils
2018-03-01
We present nonperturbative first-principle results for quark, gluon, and meson 1PI correlation functions of two-flavor Landau-gauge QCD in the vacuum. These correlation functions carry the full information about the theory. They are obtained by solving their functional renormalization group equations in a systematic vertex expansion, aiming at apparent convergence. This work represents a crucial prerequisite for quantitative first-principle studies of the QCD phase diagram and the hadron spectrum within this framework. In particular, we have computed the gluon, ghost, quark, and scalar-pseudoscalar meson propagators, as well as gluon, ghost-gluon, quark-gluon, quark, quark-meson, and meson interactions. Our results stress the crucial importance of the quantitatively correct running of different vertices in the semiperturbative regime for describing the phenomena and scales of confinement and spontaneous chiral symmetry breaking without phenomenological input.
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.
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.
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.
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)\
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.
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
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.
Remarkable Second-Order Optical Nonlinearity of Nano-Sized Au Cluster: A TDDFT Study
DOE Office of Scientific and Technical Information (OSTI.GOV)
Wu, Kechen; Li, Jun; Lin, Chensheng
2004-04-21
The dipole polarizability, static first hyperpolarizability, and UV-vis spectrum of the recently identified nano-sized tetrahedral cluster of Au have been investigated by using time-dependent density functional response theory. We have discovered that the Au cluster possesses remarkably large molecular second-order optical nonlinearity with the first hyperpolarizabilty (xyz) calculated to be 14.3 x 10 electrostatic unit (esu). The analysis of the low-energy absorption band suggests that the charge transfer from the edged gold atoms to the vertex ones plays the key role in nonlinear optical (NLO) response of Au.
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.
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
LOGISTIC NETWORK REGRESSION FOR SCALABLE ANALYSIS OF NETWORKS WITH JOINT EDGE/VERTEX DYNAMICS
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
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.
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.
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.
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.
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
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.
The Heavy Photon Search beamline and its performance
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.
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.
Searches for light sterile neutrinos with multitrack displaced vertices
NASA Astrophysics Data System (ADS)
Cottin, Giovanna; Helo, Juan Carlos; Hirsch, Martin
2018-03-01
We study discovery prospects for long-lived sterile neutrinos at the LHC with multitrack displaced vertices, with masses below the electroweak scale. We reinterpret current displaced vertex searches making use of publicly available, parametrized selection efficiencies for modeling the detector response to displaced vertices. We focus on the production of right-handed WR bosons and neutrinos N in a left-right symmetric model, and find poor sensitivity. After proposing a different trigger strategy (considering the prompt lepton accompanying the neutrino displaced vertex) and optimized cuts in the invariant mass and track multiplicity of the vertex, we find that the LHC with √{s }=13 TeV and 300 fb-1 is able to probe sterile neutrino masses between 10 GeV
Spectral Upscaling for Graph Laplacian Problems with Application to Reservoir Simulation
Barker, Andrew T.; Lee, Chak S.; Vassilevski, Panayot S.
2017-10-26
Here, we consider coarsening procedures for graph Laplacian problems written in a mixed saddle-point form. In that form, in addition to the original (vertex) degrees of freedom (dofs), we also have edge degrees of freedom. We extend previously developed aggregation-based coarsening procedures applied to both sets of dofs to now allow more than one coarse vertex dof per aggregate. Those dofs are selected as certain eigenvectors of local graph Laplacians associated with each aggregate. Additionally, we coarsen the edge dofs by using traces of the discrete gradients of the already constructed coarse vertex dofs. These traces are defined on themore » interface edges that connect any two adjacent aggregates. The overall procedure is a modification of the spectral upscaling procedure developed in for the mixed finite element discretization of diffusion type PDEs which has the important property of maintaining inf-sup stability on coarse levels and having provable approximation properties. We consider applications to partitioning a general graph and to a finite volume discretization interpreted as a graph Laplacian, developing consistent and accurate coarse-scale models of a fine-scale problem.« less
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.
NASA Astrophysics Data System (ADS)
Gutin, Gregory; Kim, Eun Jung; Soleimanfallah, Arezou; Szeider, Stefan; Yeo, Anders
The NP-hard general factor problem asks, given a graph and for each vertex a list of integers, whether the graph has a spanning subgraph where each vertex has a degree that belongs to its assigned list. The problem remains NP-hard even if the given graph is bipartite with partition U ⊎ V, and each vertex in U is assigned the list {1}; this subproblem appears in the context of constraint programming as the consistency problem for the extended global cardinality constraint. We show that this subproblem is fixed-parameter tractable when parameterized by the size of the second partite set V. More generally, we show that the general factor problem for bipartite graphs, parameterized by |V |, is fixed-parameter tractable as long as all vertices in U are assigned lists of length 1, but becomes W[1]-hard if vertices in U are assigned lists of length at most 2. We establish fixed-parameter tractability by reducing the problem instance to a bounded number of acyclic instances, each of which can be solved in polynomial time by dynamic programming.
Overview of the Micro Vertex Detector for the P bar ANDA experiment
NASA Astrophysics Data System (ADS)
Calvo, Daniela; P¯ANDA MVD Group
2017-02-01
The P bar ANDA experiment is devoted to study interactions between cooled antiproton beams and a fixed target (the interaction rate is of about 107 events/s), hydrogen or heavier nuclei. The innermost tracker of P bar ANDA is the Micro Vertex Detector (MVD), specially designed to ensure the secondary vertex resolution for the discrimination of short-lived charmonium states. Hybrid epitaxial silicon pixels and double-sided silicon microstrips will equip four barrels, arranged around the interaction point, and six forward disks. The experiment features a triggerless architecture with a master clock of 160 MHz, therefore the MVD has to run with a continuous data transmission where the hits need precise timestamps. The energy loss of the particles in the sensor will be measured as well. The challenging request of a triggerless readout suggested to develop custom readout chips for both pixel (ToPix) and microstrip (PASTA) devices. To validate components and the triggerless readout architecture, prototypes have been built and tested. After an overview of the MVD, the technological aspects and performances of some prototypes will be reported.
Combinatorial approximation algorithms for MAXCUT using random walks.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Seshadhri, Comandur; Kale, Satyen
We give the first combinatorial approximation algorithm for MaxCut that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, and easily described. It essentially performs a number of random walks and aggregates the information to provide the partition. We can control the running time to get an approximation factor-running time tradeoff. We show that for any constant b > 1.5, there is an {tilde O}(n{sup b}) algorithm that outputs a (0.5 + {delta})-approximation for MaxCut, where {delta} = {delta}(b) is some positive constant. One of the components of our algorithm is a weakmore » local graph partitioning procedure that may be of independent interest. Given a starting vertex i and a conductance parameter {phi}, unless a random walk of length {ell} = O(log n) starting from i mixes rapidly (in terms of {phi} and {ell}), we can find a cut of conductance at most {phi} close to the vertex. The work done per vertex found in the cut is sublinear in n.« less
A fast algorithm for vertex-frequency representations of signals on graphs
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
NASA Astrophysics Data System (ADS)
Munker, M.
2017-01-01
Challenging detector requirements are imposed by the physics goals at the future multi-TeV e+ e- Compact Linear Collider (CLIC). A single point resolution of 3 μm for the vertex detector and 7 μm for the tracker is required. Moreover, the CLIC vertex detector and tracker need to be extremely light weighted with a material budget of 0.2% X0 per layer in the vertex detector and 1-2% X0 in the tracker. A fast time slicing of 10 ns is further required to suppress background from beam-beam interactions. A wide range of sensor and readout ASIC technologies are investigated within the CLIC silicon pixel R&D effort. Various hybrid planar sensor assemblies with a pixel size of 25×25 μm2 and 55×55 μm2 have been produced and characterised by laboratory measurements and during test-beam campaigns. Experimental and simulation results for thin (50 μm-500 μm) slim edge and active-edge planar, and High-Voltage CMOS sensors hybridised to various readout ASICs (Timepix, Timepix3, CLICpix) are presented.
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.
The Belle-II Depfet Pixel Detector at the Superkekb Flavour Factory
NASA Astrophysics Data System (ADS)
Heindl, Stefan
2012-08-01
The ongoing upgrade of the asymmetric electron positron collider KEKB also requires extensive detector upgrades to cope with the new design luminosity of 8 · 1035 cm-2 · s-1 · Of critical importance is the new silicon pixel vertex tracker, which will significantly improve the decay vertex resolution, crucial for time dependent CP violation measurements. This new detector will consist of two layers of DEPFET pixel seii8ors very close to the interaction point. These sensors combine both particle detection and amplification of the signal by embedding a field effect transistor into a 75 μm thick fully depleted silicon substrate, providing very high signal to noise ratios and excellent spatial resolution. Using this technology satisfies the given requirements of extremely low material and high radiation tolerance at the new Belle II experiment. The power dissipation due to continuous readout at high rate and spatial constraints also give strict requirements for the mechanical support and cooling of the new detector. We will discuss the overall concept of the pixel vertex tracker, its expected performance and the challenging mechanical integration.
Electronics for a Picosecond Time-of-flight Measurement
DOE Office of Scientific and Technical Information (OSTI.GOV)
Brandt, Andrew Gerhart; Rijssenbeek, Michael
TITLE: Electronics for a Picosecond Time-of-flight Measurement ABSTRACT: Time-of-flight (TOF) detectors have historically been used as part of the particle identification capability of multi-purpose particle physics detectors. An accurate time measurement, combined with a momentum measurement based on the curvature of the track in a magnetic field, is often sufficient to determine the particle's mass, and thus its identity. Such detectors typically have measured the particle flight time extremely precisely, with an uncertainty of one hundred trillionths of a second (also referred to as 100 picoseconds). To put this in perspective it would be like counting all the people onmore » the Earth and getting it right within 1 person! Another use of TOFs is to measure the vertex of the event, which is the location along the beam line where the incoming particles (typically protons) collide. This vertex positon is a well measured quantity for events where the protons collide “head on” as the outgoing particles produced when you blast the proton apart can be used to trace back to a vertex point from which they originated. More frequently the protons just strike a glancing blow and remain intact—in this case they are nearly parallel to the beam and you cannot tell their vertex without this ability to precisely measure the time of flight of the protons. Occasionally both happen in the same event, that is, a central system and two protons are produced. But are they from the same collision, or just a boring background where more than one collision in the same bunch crossing conspire to fake the signal of interest? That’s where the timing of the protons comes into play. The main idea is to measure the time it takes for the two protons to reach TOF detectors positioned equidistant from the center of the main detector. If the vertex is displaced to one side than that detector will measure a shorter time while the other side detector will measure a correspondingly longer time. Taking into account the speed of the particles, which is very close to the speed of light, an accuracy of 100 ps gives a vertex measurement of a few cm or a little more than an inch. At the Large Hadron Collider, where there are up to a hundred billion protons per bunch, and the collision region is compressed to a few inches, that is just not good enough. A higher level of precision is needed to determine whether the vertex of the protons and that of the central system are the same. A factor 10 improvement in the timing measurement to the 10 trillionths of a second level, for example would give the requisite 10 times improvement in the vertex measurement. An accurate measurement of the flight time depends on three key elements: the radiator that produces light when the proton passes through it, the photo-sensor that converts the light to an electrical signal, and the electronics that convert this electrical signal into a time measurement with a compact recordable format. With recent improvements in detector design featuring a series of quartz radiators connected to a micro-channel plate photomultiplier tube, this superior measurement capability is within reach if the readout electronics are sufficiently performant. As a result of the funding of this proposal, we have achieved our primary goals. 1) We have developed from scratch or improved upon existing designs of the full chain of electronics that can maintain the performance of a TOF detector from the output of the photo-sensor to the recording of a compressed data packet containing the timing information. We have accomplished this with a cost effective modular approach such that some or all of the components in the chain could easily be adapted for use in diverse particle physics experiments or in other areas where precise timing is required, such as medical and homeland security devices.« less
Exploiting structure: Introduction and motivation
NASA Technical Reports Server (NTRS)
Xu, Zhong Ling
1994-01-01
This annual report summarizes the research activities that were performed from 26 Jun. 1993 to 28 Feb. 1994. We continued to investigate the Robust Stability of Systems where transfer functions or characteristic polynomials are affine multilinear functions of parameters. An approach that differs from 'Stability by Linear Process' and that reduces the computational burden of checking the robust stability of the system with multilinear uncertainty was found for low order, 2-order, and 3-order cases. We proved a crucial theorem, the so-called Face Theorem. Previously, we have proven Kharitonov's Vertex Theorem and the Edge Theorem by Bartlett. The detail of this proof is contained in the Appendix. This Theorem provides a tool to describe the boundary of the image of the affine multilinear function. For SPR design, we have developed some new results. The third objective for this period is to design a controller for IHM by the H-infinity optimization technique. The details are presented in the Appendix.
Han, Kihwan; Martinez, David; Chapman, Sandra B; Krawczyk, Daniel C
2018-03-23
Depression is the most frequent comorbid psychiatric condition among individuals with traumatic brain injury (TBI). Yet, little is known about changes in the brain associated with reduced depressive symptoms following rehabilitation for TBI. We identified whether cognitive training alleviates comorbid depressive symptoms in chronic TBI (>6 months post-injury) as a secondary effect. Further, we elucidated neural correlates of alleviated depressive symptoms following cognitive training. A total of seventy-nine individuals with chronic TBI (53 depressed and 26 non-depressed individuals, measured using the Beck Depressive Inventory [BDI]), underwent either strategy- or information-based cognitive training in a small group for 8 weeks. We measured psychological functioning scores, cortical thickness, and resting-state functional connectivity (rsFC) for these individuals before training, immediately post-training, and 3 months post-training. After confirming that changes in BDI scores were independent of training group affiliation, we identified that the depressive-symptoms group showed reductions in BDI scores over time relative to the non-depressed TBI controls (p < .01). Within the depressive-symptoms group, reduced BDI scores was associated with improvements in scores for post-traumatic stress disorder, TBI symptom awareness, and functional status (p < .00625), increases in cortical thickness in four regions within the right prefrontal cortex (p vertex < .01, p cluster <.05), and decreases in rsFC with each of these four prefrontal regions (p vertex < .01, p cluster < .0125). Overall, these findings suggest that cognitive training can reduce depressive symptoms in TBI even when the training does not directly target psychiatric symptoms. Importantly, cortical thickness and brain connectivity may offer promising neuroimaging markers of training-induced improvement in mental health status in TBI. © 2018 The Authors Human Brain Mapping Published by Wiley Periodicals, Inc.
NASA Astrophysics Data System (ADS)
Yan, Jiawei; Wang, Shizhuo; Xia, Ke; Ke, Youqi
2017-03-01
Because disorders are inevitable in realistic nanodevices, the capability to quantitatively simulate the disorder effects on electron transport is indispensable for quantum transport theory. Here, we report a unified and effective first-principles quantum transport method for analyzing effects of chemical or substitutional disorder on transport properties of nanoelectronics, including averaged transmission coefficient, shot noise, and disorder-induced device-to-device variability. All our theoretical formulations and numerical implementations are worked out within the framework of the tight-binding linear muffin tin orbital method. In this method, we carry out the electronic structure calculation with the density functional theory, treat the nonequilibrium statistics by the nonequilbrium Green's function method, and include the effects of multiple impurity scattering with the generalized nonequilibrium vertex correction (NVC) method in coherent potential approximation (CPA). The generalized NVC equations are solved from first principles to obtain various disorder-averaged two-Green's-function correlators. This method provides a unified way to obtain different disorder-averaged transport properties of disordered nanoelectronics from first principles. To test our implementation, we apply the method to investigate the shot noise in the disordered copper conductor, and find all our results for different disorder concentrations approach a universal Fano factor 1 /3 . As the second test, we calculate the device-to-device variability in the spin-dependent transport through the disordered Cu/Co interface and find the conductance fluctuation is very large in the minority spin channel and negligible in the majority spin channel. Our results agree well with experimental measurements and other theories. In both applications, we show the generalized nonequilibrium vertex corrections play a determinant role in electron transport simulation. Our results demonstrate the effectiveness of the first-principles generalized CPA-NVC for atomistic analysis of disordered nanoelectronics, extending the capability of quantum transport simulation.
Yang, Min Jae; Kim, Jin Hong; Hwang, Jae Chul; Yoo, Byung Moo; Lee, Sang Hyub; Ryu, Ji Kon; Kim, Yong-Tae; Woo, Sang Myung; Lee, Woo Jin; Jeong, Seok; Lee, Don Haeng
2018-06-22
Although endoscopic bilateral stent-in-stent placement is challenging, many recent studies have reported promising outcomes regarding technical success and endoscopic reintervention. This study aimed to evaluate the technical feasibility of stent-in-stent placement using large cell-type stents in patients with inoperable malignant hilar biliary obstruction. Forty-three patients with inoperable malignant hilar biliary obstruction from four academic centers were prospectively enrolled from March 2013 to June 2015. Bilateral stent-in-stent placement using two large cell-type stents was successfully performed in 88.4% of the patients (38/43). In four of the five cases with technical failure, the delivery sheath of the second stent became caught in the hook-cross-type vertex of the large cell of the first stent, and subsequent attempts to pass a guidewire and stent assembly through the mesh failed. Functional success was achieved in all cases with technical success. Stent occlusion occurred in 63.2% of patients (24/38), with a median patient survival of 300 days. The median stent patency was 198 days. The stent patency rate was 82.9%, 63.1%, and 32.1% at 3, 6, and 12 months, respectively. Endoscopic re-intervention was performed in 14 patients, whereas 10 underwent percutaneous drainage. Large cell-type stents for endoscopic bilateral stent-in-stent placement showed acceptable functional success and stent patency when technically successful. However, the technical difficulty associated with the entanglement of the second stent delivery sheath in the hook-cross-type vertex of the first stent may preclude large cell-type stents from being considered as a dedicated standard tool for stent-in-stent placement.
Scaling and percolation in the small-world network model
NASA Astrophysics Data System (ADS)
Newman, M. E. J.; Watts, D. J.
1999-12-01
In this paper we study the small-world network model of Watts and Strogatz, which mimics some aspects of the structure of networks of social interactions. We argue that there is one nontrivial length-scale in the model, analogous to the correlation length in other systems, which is well-defined in the limit of infinite system size and which diverges continuously as the randomness in the network tends to zero, giving a normal critical point in this limit. This length-scale governs the crossover from large- to small-world behavior in the model, as well as the number of vertices in a neighborhood of given radius on the network. We derive the value of the single critical exponent controlling behavior in the critical region and the finite size scaling form for the average vertex-vertex distance on the network, and, using series expansion and Padé approximants, find an approximate analytic form for the scaling function. We calculate the effective dimension of small-world graphs and show that this dimension varies as a function of the length-scale on which it is measured, in a manner reminiscent of multifractals. We also study the problem of site percolation on small-world networks as a simple model of disease propagation, and derive an approximate expression for the percolation probability at which a giant component of connected vertices first forms (in epidemiological terms, the point at which an epidemic occurs). The typical cluster radius satisfies the expected finite size scaling form with a cluster size exponent close to that for a random graph. All our analytic results are confirmed by extensive numerical simulations of the model.
Padilla-Sanchez, Victor; Gao, Song; Kim, Hyung Rae; Kihara, Daisuke; Sun, Lei; Rossmann, Michael G.; Rao, Venigalla B.
2013-01-01
Tailed bacteriophages and herpesviruses consist of a structurally well conserved dodecameric portal at a special five-fold vertex of the capsid. The portal plays critical roles in head assembly, genome packaging, neck/tail attachment, and genome ejection. Although the structures of portals from phages φ29, SPP1 and P22 have been determined, their mechanistic roles have not been well understood. Structural analysis of phage T4 portal (gp20) has been hampered because of its unusual interaction with the E. coli inner membrane. Here, we predict atomic models for the T4 portal monomer and dodecamer, and fit the dodecamer into the cryoEM density of the phage portal vertex. The core structure, like that from other phages, is cone-shaped with the wider end containing the “wing” and “crown” domains inside the phage head. A long “stem” encloses a central channel, and a narrow “stalk” protrudes outside the capsid. A biochemical approach was developed to analyze portal function by incorporating plasmid-expressed portal protein into phage heads and determining the effect of mutations on head assembly, DNA translocation, and virion production. We found that the protruding loops of the stalk domain are involved in assembling the DNA packaging motor. A loop that connects the stalk to the channel might be required for communication between the motor and portal. The “tunnel” loops that project into the channel are essential for sealing the packaged head. These studies established that the portal is required throughout the DNA packaging process, with different domains participating at different stages of genome packaging. PMID:24126213
Conditions for l =1 Pomeranchuk instability in a Fermi liquid
NASA Astrophysics Data System (ADS)
Wu, Yi-Ming; Klein, Avraham; Chubukov, Andrey V.
2018-04-01
We perform a microscopic analysis of how the constraints imposed by conservation laws affect q =0 Pomeranchuk instabilities in a Fermi liquid. The conventional view is that these instabilities are determined by the static interaction between low-energy quasiparticles near the Fermi surface, in the limit of vanishing momentum transfer q . The condition for a Pomeranchuk instability is set by Flc (s )=-1 , where Flc (s ) (a Landau parameter) is a properly normalized partial component of the antisymmetrized static interaction F (k ,k +q ;p ,p -q ) in a charge (c) or spin (s) subchannel with angular momentum l . However, it is known that conservation laws for total spin and charge prevent Pomeranchuk instabilities for l =1 spin- and charge-current order parameters. Our study aims to understand whether this holds only for these special forms of l =1 order parameters or is a more generic result. To this end we perform a diagrammatic analysis of spin and charge susceptibilities for charge and spin density order parameters, as well as perturbative calculations to second order in the Hubbard U . We argue that for l =1 spin-current and charge-current order parameters, certain vertex functions, which are determined by high-energy fermions, vanish at Fl=1 c (s )=-1 , preventing a Pomeranchuk instability from taking place. For an order parameter with a generic l =1 form factor, the vertex function is not expressed in terms of Fl=1 c (s ), and a Pomeranchuk instability may occur when F1c (s )=-1 . We argue that for other values of l , a Pomeranchuk instability may occur at Flc (s )=-1 for an order parameter with any form factor.
Euclidean bridge to the relativistic constituent quark model
NASA Astrophysics Data System (ADS)
Hobbs, T. J.; Alberg, Mary; Miller, Gerald A.
2017-03-01
Background: Knowledge of nucleon structure is today ever more of a precision science, with heightened theoretical and experimental activity expected in coming years. At the same time, a persistent gap lingers between theoretical approaches grounded in Euclidean methods (e.g., lattice QCD, Dyson-Schwinger equations [DSEs]) as opposed to traditional Minkowski field theories (such as light-front constituent quark models). Purpose: Seeking to bridge these complementary world views, we explore the potential of a Euclidean constituent quark model (ECQM). This formalism enables us to study the gluonic dressing of the quark-level axial-vector vertex, which we undertake as a test of the framework. Method: To access its indispensable elements with a minimum of inessential detail, we develop our ECQM using the simplified quark + scalar diquark picture of the nucleon. We construct a hyperspherical formalism involving polynomial expansions of diquark propagators to marry our ECQM with the results of Bethe-Salpeter equation (BSE) analyses, and constrain model parameters by fitting electromagnetic form factor data. Results: From this formalism, we define and compute a new quantity—the Euclidean density function (EDF)—an object that characterizes the nucleon's various charge distributions as functions of the quark's Euclidean momentum. Applying this technology and incorporating information from BSE analyses, we find the quenched dressing effect on the proton's axial-singlet charge to be small in magnitude and consistent with zero, while use of recent determinations of unquenched BSEs results in a large suppression. Conclusions: The quark + scalar diquark ECQM is a step toward a realistic quark model in Euclidean space, and needs additional refinements. The substantial effect we obtain for the impact on the axial-singlet charge of the unquenched dressed vertex compared to the quenched demands further investigation.
Reflection matrices with U q [osp(2) (2|2m)] symmetry
NASA Astrophysics Data System (ADS)
Vieira, R. S.; Lima-Santos, A.
2017-09-01
We propose a classification of the reflection K-matrices (solutions of the boundary Yang-Baxter equation) for the Uq[osp(2)(2\\vert 2m)]=Uq[C(2)(m+1)] vertex-model. We found four families of solutions, namely, the complete solutions, in which no elements of the reflection K-matrix is null, the block-diagonal solutions, the X-shape solutions and the diagonal solutions. We highlight that these diagonal K-matrices also hold for the Uq[osp(2)(2n+2\\vert 2m)]=Uq[D(2)(n+1, m)] vertex-model.
Slow relaxation in weakly open rational polygons.
Kokshenev, Valery B; Vicentini, Eduardo
2003-07-01
The interplay between the regular (piecewise-linear) and irregular (vertex-angle) boundary effects in nonintegrable rational polygonal billiards (of m equal sides) is discussed. Decay dynamics in polygons (of perimeter P(m) and small opening Delta) is analyzed through the late-time survival probability S(m) approximately equal t(-delta). Two distinct slow relaxation channels are established. The primary universal channel exhibits relaxation of regular sliding orbits, with delta=1. The secondary channel is given by delta>1 and becomes open when m>P(m)/Delta. It originates from vertex order-disorder dual effects and is due to relaxation of chaoticlike excitations.
Quark scalar, axial and tensor charges in the Schwinger-Dyson formalism
DOE Office of Scientific and Technical Information (OSTI.GOV)
Yamanaka, Nodoka
2016-01-22
The quark scalar, axial and tensor charges of nucleon are calculated in the Schwinger-Dyson formalism. We first calculate these charges in the rainbow-ladder truncation using the IR cut quark-gluon vertex, and show that the result is in agreement with the known data. We then perform the same calculation with the phenomenological IR singular quark-gluon vertex. In this case, the Schwinger-Dyson equation does not converge. We show that this result suggests the requirement of additional corrections to the rainbow-ladder truncation, due to the interaction between quark and gluons in the deep IR region.
On the locating domination number of corona product
NASA Astrophysics Data System (ADS)
Nur Santi, Risan; Hesti Agustin, Ika; Dafik; Alfarisi, Ridho
2018-04-01
Let G = (V(G), E(G) be a connected graph and vɛV(G). A dominating set for a graph G = (V, E) is a subset D of V such that every vertex not in D is adjacent to at least one member of D. The domination number γ(G) is the number of vertices in a smallest dominating set for G. Vertex set S in graph G = (V, E) is a locating dominating set if for each pair of distinct vertices u and v in V(G) ‑ S we have N(u)\\cap S\
DOE Office of Scientific and Technical Information (OSTI.GOV)
Boucaud, Ph.; De Soto, F.; Rodriguez-Quintero, J.
This article reports on the detailed study of the three-gluon vertex in four-dimensional $SU(3)$ Yang-Mills theory employing lattice simulations with large physical volumes and high statistics. A meticulous scrutiny of the so-called symmetric and asymmetric kinematical configurations is performed and it is shown that the associated form-factor changes sign at a given range of momenta. Here, the lattice results are compared to the model independent predictions of Schwinger-Dyson equations and a very good agreement among the two is found.
Boucaud, Ph.; De Soto, F.; Rodriguez-Quintero, J.; ...
2017-06-14
This article reports on the detailed study of the three-gluon vertex in four-dimensional $SU(3)$ Yang-Mills theory employing lattice simulations with large physical volumes and high statistics. A meticulous scrutiny of the so-called symmetric and asymmetric kinematical configurations is performed and it is shown that the associated form-factor changes sign at a given range of momenta. Here, the lattice results are compared to the model independent predictions of Schwinger-Dyson equations and a very good agreement among the two is found.
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.
Sterile neutrino searches via displaced vertices at LHCb
NASA Astrophysics Data System (ADS)
Antusch, Stefan; Cazzato, Eros; Fischer, Oliver
2017-11-01
We explore the sensitivity of displaced vertex searches at LHCb for testing sterile neutrino extensions of the Standard Model towards explaining the observed neutrino masses. We derive estimates for the constraints on sterile neutrino parameters from a recently published displaced vertex search at LHCb based on run 1 data. They yield the currently most stringent limit on active-sterile neutrino mixing in the sterile neutrino mass range between 4.5 GeV and 10 GeV. Furthermore, we present forecasts for the sensitivities that could be obtained from the run 2 data and also for the high-luminosity phase of the LHC.
Faster quantum walk search on a weighted graph
NASA Astrophysics Data System (ADS)
Wong, Thomas G.
2015-09-01
A randomly walking quantum particle evolving by Schrödinger's equation searches for a unique marked vertex on the "simplex of complete graphs" in time Θ (N3 /4) . We give a weighted version of this graph that preserves vertex transitivity, and we show that the time to search on it can be reduced to nearly Θ (√{N }) . To prove this, we introduce two extensions to degenerate perturbation theory: an adjustment that distinguishes the weights of the edges and a method to determine how precisely the jumping rate of the quantum walk must be chosen.
Smoothing optimization of supporting quadratic surfaces with Zernike polynomials
NASA Astrophysics Data System (ADS)
Zhang, Hang; Lu, Jiandong; Liu, Rui; Ma, Peifu
2018-03-01
A new optimization method to get a smooth freeform optical surface from an initial surface generated by the supporting quadratic method (SQM) is proposed. To smooth the initial surface, a 9-vertex system from the neighbor quadratic surface and the Zernike polynomials are employed to establish a linear equation system. A local optimized surface to the 9-vertex system can be build by solving the equations. Finally, a continuous smooth optimization surface is constructed by stitching the above algorithm on the whole initial surface. The spot corresponding to the optimized surface is no longer discrete pixels but a continuous distribution.
Quantum speedup of the traveling-salesman problem for bounded-degree graphs
NASA Astrophysics Data System (ADS)
Moylett, Dominic J.; Linden, Noah; Montanaro, Ashley
2017-03-01
The traveling-salesman problem is one of the most famous problems in graph theory. However, little is currently known about the extent to which quantum computers could speed up algorithms for the problem. In this paper, we prove a quadratic quantum speedup when the degree of each vertex is at most 3 by applying a quantum backtracking algorithm to a classical algorithm by Xiao and Nagamochi. We then use similar techniques to accelerate a classical algorithm for when the degree of each vertex is at most 4, before speeding up higher-degree graphs via reductions to these instances.
The role of the right superior temporal gyrus in stimulus-centered spatial processing.
Shah-Basak, Priyanka P; Chen, Peii; Caulfield, Kevin; Medina, Jared; Hamilton, Roy H
2018-05-01
Although emerging neuropsychological evidence supports the involvement of temporal areas, and in particular the right superior temporal gyrus (STG), in allocentric neglect deficits, the role of STG in healthy spatial processing remains elusive. While several functional brain imaging studies have demonstrated involvement of the STG in tasks involving explicit stimulus-centered judgments, prior rTMS studies targeting the right STG did not find the expected neglect-like rightward bias in size judgments using the conventional landmark task. The objective of the current study was to investigate whether disruption of the right STG using inhibitory repetitive transcranial magnetic stimulation (rTMS) could impact stimulus-centered, allocentric spatial processing in healthy individuals. A lateralized version of the landmark task was developed to accentuate the dissociation between viewer-centered and stimulus-centered reference frames. We predicted that inhibiting activity in the right STG would decrease accuracy because of induced rightward bias centered on the line stimulus irrespective of its viewer-centered or egocentric locations. Eleven healthy, right-handed adults underwent the lateralized landmark task. After viewing each stimulus, participants had to judge whether the line was bisected, or whether the left (left-long trials) or the right segment (right-long trials) of the line was longer. Participants repeated the task before (pre-rTMS) and after (post-rTMS) receiving 20 min of 1 Hz rTMS over the right STG, the right supramarginal gyrus (SMG), and the vertex (a control site) during three separate visits. Linear mixed models for binomial data were generated with either accuracy or judgment errors as dependent variables, to compare 1) performance across trial types (bisection, non-bisection), and 2) pre- vs. post-rTMS performance between the vertex and the STG and the vertex and the SMG. Line eccentricity (z = 4.31, p < 0.0001) and line bisection (z = 5.49, p < 0.0001) were significant predictors of accuracy. In the models comparing the effects of rTMS, a significant two-way interaction with STG (z = -3.09, p = 0.002) revealed a decrease in accuracy of 9.5% and an increase in errors of the right-long type by 10.7% on bisection trials, in both left and right viewer-centered locations. No significant changes in leftward errors were found. These findings suggested an induced stimulus-centered rightward bias in our participants after STG stimulation. Notably, accuracy or errors were not influenced by SMG stimulation compared to vertex. In line with our predictions, the findings provide compelling evidence for right STG's involvement in healthy stimulus-centered spatial processing. Copyright © 2018 Elsevier Ltd. All rights reserved.
Criticality in conserved dynamical systems: experimental observation vs. exact properties.
Marković, Dimitrije; Gros, Claudius; Schuelein, André
2013-03-01
Conserved dynamical systems are generally considered to be critical. We study a class of critical routing models, equivalent to random maps, which can be solved rigorously in the thermodynamic limit. The information flow is conserved for these routing models and governed by cyclic attractors. We consider two classes of information flow, Markovian routing without memory and vertex routing involving a one-step routing memory. Investigating the respective cycle length distributions for complete graphs, we find log corrections to power-law scaling for the mean cycle length, as a function of the number of vertices, and a sub-polynomial growth for the overall number of cycles. When observing experimentally a real-world dynamical system one normally samples stochastically its phase space. The number and the length of the attractors are then weighted by the size of their respective basins of attraction. This situation is equivalent, for theory studies, to "on the fly" generation of the dynamical transition probabilities. For the case of vertex routing models, we find in this case power law scaling for the weighted average length of attractors, for both conserved routing models. These results show that the critical dynamical systems are generically not scale-invariant but may show power-law scaling when sampled stochastically. It is hence important to distinguish between intrinsic properties of a critical dynamical system and its behavior that one would observe when randomly probing its phase space.
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.
Demeter, Elise; Mirdamadi, Jasmine L.; Meehan, Sean K.; Taylor, Stephan F.
2016-01-01
Deep semantic encoding of verbal stimuli can aid in later successful retrieval of those stimuli from long-term episodic memory. Evidence from numerous neuropsychological and neuroimaging experiments demonstrate regions in left prefrontal cortex, including left dorsolateral prefrontal cortex (DLPFC), are important for processes related to encoding. Here, we investigated the relationship between left DLPFC activity during encoding and successful subsequent memory with transcranial magnetic stimulation (TMS). In a pair of experiments using a 2-session within-subjects design, we stimulated either left DLPFC or a control region (Vertex) with a single 2-s train of short theta burst stimulation (sTBS) during a semantic encoding task and then gave participants a recognition memory test. We found that subsequent memory was enhanced on the day left DLPFC was stimulated, relative to the day Vertex was stimulated, and that DLPFC stimulation also increased participants’ confidence in their decisions during the recognition task. We also explored the time course of how long the effects of sTBS persisted. Our data suggest 2 s of sTBS to left DLPFC is capable of enhancing subsequent memory for items encoded up to 15 s following stimulation. Collectively, these data demonstrate sTBS is capable of enhancing long-term memory and provide evidence that TBS protocols are a potentially powerful tool for modulating cognitive function. PMID:27098772
Kalla, Roger; Muggleton, Neil G; Cowey, Alan; Walsh, Vincent
2009-10-01
Functional neuroimaging studies have shown that the detection of a target defined by more than one feature (for example, a conjunction of colour and orientation) amongst distractors is associated with the activation of a network of brain areas. Dorsolateral prefrontal cortex (DLPFC), along with areas such as the frontal eye fields (FEF) and posterior parietal cortex (PPC), is a component of this network. While transcranial magnetic stimulation (TMS) had shown that both FEF and PPC are necessary for, and not just correlated with, successful conjunction search, this is not the case for DLPFC. To test the hypothesis that this area is also necessary for efficient conjunction search, TMS was applied over DLPFC and the effects on conjunction and feature (in this case colour) search performance compared with those when TMS was delivered over area MT/V5 and a vertex control stimulation condition. DLPFC TMS impaired performance on the conjunction search task but was without effect on feature search, similar to findings when TMS is delivered over PPC or FEF. Vertex TMS had no effects whereas MT/V5 TMS significantly improved performance with a time course that may indicate that this was due to modulation of V4 activity. These findings illustrate that, like FEF and PPC, DLPFC is necessary for fully effective conjunction visual search performance.
Dynamical Vertex Approximation for the Hubbard Model
NASA Astrophysics Data System (ADS)
Toschi, Alessandro
A full understanding of correlated electron systems in the physically relevant situations of three and two dimensions represents a challenge for the contemporary condensed matter theory. However, in the last years considerable progress has been achieved by means of increasingly more powerful quantum many-body algorithms, applied to the basic model for correlated electrons, the Hubbard Hamiltonian. Here, I will review the physics emerging from studies performed with the dynamical vertex approximation, which includes diagrammatic corrections to the local description of the dynamical mean field theory (DMFT). In particular, I will first discuss the phase diagram in three dimensions with a special focus on the commensurate and incommensurate magnetic phases, their (quantum) critical properties, and the impact of fluctuations on electronic lifetimes and spectral functions. In two dimensions, the effects of non-local fluctuations beyond DMFT grow enormously, determining the appearance of a low-temperature insulating behavior for all values of the interaction in the unfrustrated model: Here the prototypical features of the Mott-Hubbard metal-insulator transition, as well as the existence of magnetically ordered phases, are completely overwhelmed by antiferromagnetic fluctuations of exponentially large extension, in accordance with the Mermin-Wagner theorem. Eventually, by a fluctuation diagnostics analysis of cluster DMFT self-energies, the same magnetic fluctuations are identified as responsible for the pseudogap regime in the holed-doped frustrated case, with important implications for the theoretical modeling of the cuprate physics.
Panelli, Danielle M; Easter, Sarah Rae; Bibbo, Carolina; Robinson, Julian N; Carusi, Daniela A
2017-11-01
To identify clinical factors associated with a change from vertex to nonvertex presentation in the second twin after vaginal birth of the first. We assembled a retrospective cohort of women with viable vertex-vertex twin pregnancies who delivered the presenting twin vaginally. Women whose second twin changed from vertex to nonvertex after vaginal birth of the first were classified as experiencing an intrapartum change in presentation. Characteristics associated with intrapartum presentation change in a univariate analysis with a P value ≤.10 were then evaluated in a multivariate logistic regression model. Four-hundred fifty women met inclusion criteria, of whom 55 (12%) had intrapartum presentation change of the second twin. Women experiencing intrapartum presentation change were more likely to be multiparous (69% compared with 47%, P<.01) and to have had a change in the presentation of the second twin between the most recent antepartum ultrasonogram and the ultrasonogram done on admission to labor and delivery (11% compared with 4%, P=.04). In an adjusted analysis, multiparity and gestational age less than 34 weeks were significantly associated with presentation change (adjusted odds ratio [OR] 2.9, 95% CI 1.5-5.6 and adjusted OR 2.6, 95% CI 1.1-5.9, respectively). Women with intrapartum presentation change were more likely to undergo cesarean delivery for their second twin (44% compared with 7%, P<.01) with an adjusted OR of 10.50 (95% CI 5.20-21.20) compared with those with stable intrapartum presentation. Twenty of the 24 (83%) cesarean deliveries performed in the intrapartum presentation change group were done for issues related to malpresentation. Multiparity and gestational age less than 34 weeks are associated with intrapartum presentation change of the second twin.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Novales-Sanchez, H.; Toscano, J. J.; Rosado, A.
In this paper, we review the search of possible physics effects beyond the standard model on the electromagnetic charge and anapole form factors, f{sub Q}(q{sup 2}) and f{sub A}(q{sup 2}), for a no massive Dirac neutrino, when these quantities are calculated in the frame of an effective electroweak Yang-Mills theory, which induces the most general SU{sub L}(2)-invariant Lorentz tensor structure of nonrenormalizable type for the WW{gamma} vertex. We found that in this frame, besides the standard model contribution, the additional contribution to f{sub Q}(q{sup 2}) and f{sub A}(q{sup 2}) (f{sub Q}{sup O{sub W}}(q{sup 2}) and f{sub A}{sup O{sub W}}(q{sup 2}),more » respectively) are gauge independent and finite functions of q{sup 2} after adopting a renormalization scheme. These form factors, f{sub Q}{sup O{sub W}}(q{sup 2}) and f{sub A}{sup O{sub W}}(q{sup 2}), get contribution at the one loop level only from the proper neutrino electromagnetic vertex. Besides, the relation f{sub Q}{sup eff}(q{sup 2}) = q{sup 2}f{sub A}{sup eff}(q{sup 2})(f{sub Q}{sup eff}(q{sup 2}) = f{sub Q}{sup SM}(q{sup 2})+f{sub Q}{sup O{sub W}}(q{sup 2}),f{sub A}{sup eff}(q{sup 2}) = f{sub A}{sup SM}(q{sup 2})+f{sub A}{sup O{sub W}}(q{sup 2})) is still fulfilled and hence the relation a{sub v}{sup eff} = {sup eff}/6(a{sub v}{sup eff} = a{sub v}{sup SM}+a{sub v}{sup O{sub W}},{sup eff} = {sup SM}+{sup O{sub W}}) is obtained, just as in the SM. Using the experimental constraint on the anomalous WW{gamma} vertex, a value for the additional contribution to the charge radius of Double-Vertical-Line {sup O{sub W}} Double-Vertical-Line Less-Than-Or-Equivalent-To 10{sup -34} cm{sup 2} is gotten, which is one order of magnitude lower than the SM value.« less
How Bright is the Proton? A Precise Determination of the Photon Parton Distribution Function
DOE Office of Scientific and Technical Information (OSTI.GOV)
Manohar, Aneesh; Nason, Paolo; Salam, Gavin P.
2016-12-09
It has become apparent in recent years that it is important, notably for a range of physics studies at the Large Hadron Collider, to have accurate knowledge on the distribution of photons in the proton. We show how the photon parton distribution function (PDF) can be determined in a model-independent manner, using electron-proton (ep) scattering data, in effect viewing the ep → e + X process as an electron scattering off the photon field of the proton. To this end, we consider an imaginary, beyond the Standard Model process with a flavor changing photon-lepton vertex. We write its cross sectionmore » in two ways: one in terms of proton structure functions, the other in terms of a photon distribution. Requiring their equivalence yields the photon distribution as an integral over proton structure functions. As a result of the good precision of ep data, we constrain the photon PDF at the level of 1%–2% over a wide range of momentum fractions.« less
How Bright is the Proton? A Precise Determination of the Photon Parton Distribution Function.
Manohar, Aneesh; Nason, Paolo; Salam, Gavin P; Zanderighi, Giulia
2016-12-09
It has become apparent in recent years that it is important, notably for a range of physics studies at the Large Hadron Collider, to have accurate knowledge on the distribution of photons in the proton. We show how the photon parton distribution function (PDF) can be determined in a model-independent manner, using electron-proton (ep) scattering data, in effect viewing the ep→e+X process as an electron scattering off the photon field of the proton. To this end, we consider an imaginary, beyond the Standard Model process with a flavor changing photon-lepton vertex. We write its cross section in two ways: one in terms of proton structure functions, the other in terms of a photon distribution. Requiring their equivalence yields the photon distribution as an integral over proton structure functions. As a result of the good precision of ep data, we constrain the photon PDF at the level of 1%-2% over a wide range of momentum fractions.
On Connected Diagrams and Cumulants of Erdős-Rényi Matrix Models
NASA Astrophysics Data System (ADS)
Khorunzhiy, O.
2008-08-01
Regarding the adjacency matrices of n-vertex graphs and related graph Laplacian we introduce two families of discrete matrix models constructed both with the help of the Erdős-Rényi ensemble of random graphs. Corresponding matrix sums represent the characteristic functions of the average number of walks and closed walks over the random graph. These sums can be considered as discrete analogues of the matrix integrals of random matrix theory. We study the diagram structure of the cumulant expansions of logarithms of these matrix sums and analyze the limiting expressions as n → ∞ in the cases of constant and vanishing edge probabilities.
Ab initio quantum chemical study of electron transfer in carboranes
NASA Astrophysics Data System (ADS)
Pati, Ranjit; Pineda, Andrew C.; Pandey, Ravindra; Karna, Shashi P.
2005-05-01
The electron transfer (ET) properties of 10- and 12-vertex carboranes are investigated by the ab initio Hartree-Fock method within the Marcus-Hush (MH) two-state model and the Koopman theorem (KT) approach. The calculated value of the ET coupling matrix element, VAB, is consistently higher in the KT approach than in the MH two-state model. For the carborane molecules functionalized by -CH 2 groups at C-vertices, VAB strongly depends on the relative orientation of the planes containing the terminal -CH 2 groups. The predicted conformation dependence of VAB offers a molecular mechanism to control ET between two active centers in molecular systems.
Low-mass materials and vertex detector systems
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
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.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Altmeyer, Michaela; Guterding, Daniel; Hirschfeld, P. J.
2016-12-21
In the framework of a multiorbital Hubbard model description of superconductivity, a matrix formulation of the superconducting pairing interaction that has been widely used is designed to treat spin, charge, and orbital fluctuations within a random phase approximation (RPA). In terms of Feynman diagrams, this takes into account particle-hole ladder and bubble contributions as expected. It turns out, however, that this matrix formulation also generates additional terms which have the diagrammatic structure of vertex corrections. Furthermore we examine these terms and discuss the relationship between the matrix-RPA superconducting pairing interaction and the Feynman diagrams that it sums.
Measurement of the W boson polarization in top decay at CDF at √(s)=1.8 TeV
NASA Astrophysics Data System (ADS)
Acosta, D.; Affolder, T.; Albrow, M. G.; Ambrose, D.; Amidei, D.; Anikeev, K.; Antos, J.; Apollinari, G.; Arisawa, T.; Artikov, A.; Ashmanskas, W.; Azfar, F.; Azzi-Bacchetta, P.; Bacchetta, N.; Bachacou, H.; Badgett, W.; Barbaro-Galtieri, A.; Barnes, V. E.; Barnett, B. A.; Baroiant, S.; Barone, M.; Bauer, G.; Bedeschi, F.; Behari, S.; Belforte, S.; Bell, W. H.; Bellettini, G.; Bellinger, J.; Benjamin, D.; Beretvas, A.; Bhatti, A.; Binkley, M.; Bisello, D.; Bishai, M.; Blair, R. E.; Blocker, C.; Bloom, K.; Blumenfeld, B.; Bocci, A.; Bodek, A.; Bolla, G.; Bolshov, A.; Bortoletto, D.; Boudreau, J.; Bromberg, C.; Brubaker, E.; Budagov, J.; Budd, H. S.; Burkett, K.; Busetto, G.; Byrum, K. L.; Cabrera, S.; Campbell, M.; Carithers, W.; Carlsmith, D.; Castro, A.; Cauz, D.; Cerri, A.; Cerrito, L.; Chapman, J.; Chen, C.; Chen, Y. C.; Chertok, M.; Chiarelli, G.; Chlachidze, G.; Chlebana, F.; Chu, M. L.; Chung, J. Y.; Chung, W.-H.; Chung, Y. S.; Ciobanu, C. I.; Clark, A. G.; Coca, M.; Connolly, A.; Convery, M.; Conway, J.; Cordelli, M.; Cranshaw, J.; Culbertson, R.; Dagenhart, D.; D'Auria, S.; de Barbaro, P.; Cecco, S. De; dell'Agnello, S.; dell'Orso, M.; Demers, S.; Demortier, L.; Deninno, M.; Pedis, D. De; Derwent, P. F.; Dionisi, C.; Dittmann, J. R.; Dominguez, A.; Donati, S.; D'Onofrio, M.; Dorigo, T.; Eddy, N.; Erbacher, R.; Errede, D.; Errede, S.; Eusebi, R.; Farrington, S.; Feild, R. G.; Fernandez, J. P.; Ferretti, C.; Field, R. D.; Fiori, I.; Flaugher, B.; Flores-Castillo, L. R.; Foster, G. W.; Franklin, M.; Friedman, J.; Furic, I.; Gallinaro, M.; Garcia-Sciveres, , M.; Garfinkel, A. F.; Gay, C.; Gerdes, D. W.; Gerstein, E.; Giagu, S.; Giannetti, P.; Giolo, K.; Giordani, M.; Giromini, P.; Glagolev, V.; Glenzinski, D.; Gold, M.; Goldschmidt, N.; Goldstein, J.; Gomez, G.; Goncharov, M.; Gorelov, I.; Goshaw, A. T.; Gotra, Y.; Goulianos, K.; Gresele, A.; Grosso-Pilcher, C.; Guenther, M.; da Costa, J. Guimaraes; Haber, C.; Hahn, S. R.; Halkiadakis, E.; Handler, R.; Happacher, F.; Hara, K.; Harris, R. M.; Hartmann, F.; Hatakeyama, K.; Hauser, J.; Heinrich, J.; Hennecke, M.; Herndon, M.; Hill, C.; Hocker, A.; Hoffman, K. D.; Hou, S.; Huffman, B. T.; Hughes, R.; Huston, J.; Incandela, J.; Introzzi, G.; Iori, M.; Issever, C.; Ivanov, A.; Iwata, Y.; Iyutin, B.; James, E.; Jones, M.; Kamon, T.; Kang, J.; Unel, M. Karagoz; Kartal, S.; Kasha, H.; Kato, Y.; Kennedy, R. D.; Kephart, R.; Kilminster, B.; Kim, D. H.; Kim, H. S.; Kim, M. J.; Kim, S. B.; Kim, S. H.; Kim, T. H.; Kim, Y. K.; Kirby, M.; Kirsch, L.; Klimenko, S.; Koehn, P.; Kondo, K.; Konigsberg, J.; Korn, A.; Korytov, A.; Kroll, J.; Kruse, M.; Krutelyov, V.; Kuhlmann, S. E.; Kuznetsova, N.; Laasanen, A. T.; Lami, S.; Lammel, S.; Lancaster, J.; Lancaster, M.; Lander, R.; Lannon, K.; Lath, A.; Latino, G.; Lecompte, T.; Le, Y.; Lee, J.; Lee, S. W.; Leonardo, N.; Leone, S.; Lewis, J. D.; Li, K.; Lin, C. S.; Lindgren, M.; Liss, T. M.; Litvintsev, D. O.; Liu, T.; Lockyer, N. S.; Loginov, A.; Loreti, M.; Lucchesi, D.; Lukens, P.; Lyons, L.; Lys, J.; Madrak, R.; Maeshima, K.; Maksimovic, P.; Malferrari, L.; Manca, G.; Mangano, M.; Mariotti, M.; Martin, A.; Martin, M.; Martin, V.; Martínez, M.; Mazzanti, P.; McFarland, K. S.; McIntyre, P.; Menguzzato, M.; Menzione, A.; Merkel, P.; Mesropian, C.; Meyer, A.; Miao, T.; Miller, J. S.; Miller, R.; Miscetti, S.; Mitselmakher, G.; Moggi, N.; Moore, R.; Moulik, T.; Mukherjee, A.; Mulhearn, M.; Muller, T.; Munar, A.; Murat, P.; Nachtman, J.; Nahn, S.; Nakano, I.; Napora, R.; Nelson, C.; Nelson, T.; Neu, C.; Neubauer, M. S.; Newman-Holmes, C.; Niell, F.; Nigmanov, T.; Nodulman, L.; Oh, S. H.; Oh, Y. D.; Ohsugi, T.; Okusawa, T.; Orejudos, W.; Pagliarone, C.; Palmonari, F.; Paoletti, R.; Papadimitriou, V.; Patrick, J.; Pauletta, G.; Paulini, M.; Pauly, T.; Paus, C.; Pellett, D.; Penzo, A.; Phillips, T. J.; Piacentino, G.; Piedra, J.; Pitts, K. T.; Pompoš, A.; Pondrom, L.; Pope, G.; Poukhov, O.; Pratt, T.; Prokoshin, F.; Proudfoot, J.; Ptohos, F.; Punzi, G.; Rademacker, J.; Rakitine, A.; Ratnikov, F.; Ray, H.; Reichold, A.; Renton, P.; Rescigno, M.; Rimondi, F.; Ristori, L.; Robertson, W. J.; Rodrigo, T.; Rolli, S.; Rosenson, L.; Roser, R.; Rossin, R.; Rott, C.; Roy, A.; Ruiz, A.; Ryan, D.; Safonov, A.; Denis, R. St.; Sakumoto, W. K.; Saltzberg, D.; Sanchez, C.; Sansoni, A.; Santi, L.; Sarkar, S.; Savard, P.; Savoy-Navarro, A.; Schlabach, P.; Schmidt, E. E.; Schmidt, M. P.; Schmitt, M.; Scodellaro, L.; Scribano, A.; Sedov, A.; Seidel, S.; Seiya, Y.; Semenov, A.; Semeria, F.; Shapiro, M. D.; Shepard, P. F.; Shibayama, T.; Shimojima, M.; Shochet, M.; Sidoti, A.; Sill, A.; Sinervo, P.; Slaughter, A. J.; Sliwa, K.; Snider, F. D.; Snihur, R.; Spezziga, M.; Spiegel, L.; Spinella, F.; Spiropulu, M.; Stefanini, A.; Strologas, J.; Stuart, D.; Sukhanov, A.; Sumorok, K.; Suzuki, T.; Takashima, R.; Takikawa, K.; Tanaka, M.; Tecchio, M.; Teng, P. K.; Terashi, K.; Tesarek, R. J.; Tether, S.; Thom, J.; Thompson, A. S.; Thomson, E.; Tipton, P.; Tkaczyk, S.; Toback, D.; Tollefson, K.; Tonelli, D.; Tönnesmann, M.; Toyoda, H.; Trischuk, W.; Tseng, J.; Tsybychev, D.; Turini, N.; Ukegawa, F.; Unverhau, T.; Vaiciulis, T.; Varganov, A.; Vataga, E.; Vejcik, S.; Velev, G.; Veramendi, G.; Vidal, R.; Vila, I.; Vilar, R.; Volobouev, I.; von der Mey, M.; Wagner, R. G.; Wagner, R. L.; Wagner, W.; Wan, Z.; Wang, C.; Wang, M. J.; Wang, S. M.; Ward, B.; Waschke, S.; Waters, D.; Watts, T.; Weber, M.; Wester, W. C.; Whitehouse, B.; Wicklund, A. B.; Wicklund, E.; Williams, H. H.; Wilson, P.; Winer, B. L.; Wolbers, S.; Wolter, M.; Worm, S.; Wu, X.; Würthwein, F.; Yang, U. K.; Yao, W.; Yeh, G. P.; Yi, K.; Yoh, J.; Yoshida, T.; Yu, I.; Yu, S.; Yun, J. C.; Zanello, L.; Zanetti, A.; Zetti, F.; Zucchelli, S.
2005-02-01
The polarization of the W boson in t→Wb decay is unambiguously predicted by the standard model of electroweak interactions and is a powerful test of our understanding of the tbW vertex. We measure this polarization from the invariant mass of the b quark from t→Wb and the lepton from W→lν whose momenta measure the W decay angle and direction of motion, respectively. In this paper we present a measurement of the decay rate (fV+A) of the W produced from the decay of the top quark in the hypothesis of V+A structure of the tWb vertex. We find no evidence for the nonstandard V+A vertex and set a limit on fV+A < 0.80 at 95% confidence level. By combining this result with a complementary observable in the same data, we assign a limit on fV+A < 0.61 at 95% CL. This corresponds to a constraint on the right-handed helicity component of the W polarization of f+<0.18 at 95% CL. This limit is the first significant direct constraint on fV+A in top decay.
Covariant open bosonic string field theory on multiple D-branes in the proper-time gauge
NASA Astrophysics Data System (ADS)
Lee, Taejin
2017-12-01
We construct a covariant open bosonic string field theory on multiple D-branes, which reduces to a non-Abelian group Yang-Mills gauge theory in the zero-slope limit. Making use of the first quantized open bosonic string in the proper time gauge, we convert the string amplitudes given by the Polyakov path integrals on string world sheets into those of the second quantized theory. The world sheet diagrams generated by the constructed open string field theory are planar in contrast to those of the Witten's cubic string field theory. However, the constructed string field theory is yet equivalent to the Witten's cubic string field theory. Having obtained planar diagrams, we may adopt the light-cone string field theory technique to calculate the multi-string scattering amplitudes with an arbitrary number of external strings. We examine in detail the three-string vertex diagram and the effective four-string vertex diagrams generated perturbatively by the three-string vertex at tree level. In the zero-slope limit, the string scattering amplitudes are identified precisely as those of non-Abelian Yang-Mills gauge theory if the external states are chosen to be massless vector particles.
Regional atrophy of the basal ganglia and thalamus in idiopathic generalized epilepsy.
Du, Hanjian; Zhang, Yuanchao; Xie, Bing; Wu, Nan; Wu, Guocai; Wang, Jian; Jiang, Tianzi; Feng, Hua
2011-04-01
To determine the regional changes in the shapes of subcortical structures in idiopathic generalized epilepsy using a vertex-based analysis method. Earlier studies found that gray matter volume in the frontal, parietal, and temporal lobes is significantly altered in idiopathic generalized epilepsy (IGE). Research has indicated that a relationship exists between the brain's subcortical structures and epilepsy. However, little is known about possible changes in the subcortical structures in IGE. This study aims to determine the changes in the shape of subcortical structures in IGE using vertex analysis. Fourteen male patients with IGE and 28 age- and sex-matched healthy controls were included in this study, which used high-resolution magnetic resonance imaging. We performed a vertex-based shape analysis, in which we compared patients with IGE with the controls, on the subcortical structures that we had obtained from the MRI data. Statistical analysis showed significant regional atrophy in the left thalamus, left putamen and bilateral globus pallidus in patients with IGE. These results indicate that regional atrophy of the basal ganglia and the thalamus may be related to seizure disorder. In the future, these findings may prove useful for choosing new therapeutic regimens. Copyright © 2011 Wiley-Liss, Inc.
Computation of Stability Derivatives of an oscillating cone for specific heat ratio = 1.66
NASA Astrophysics Data System (ADS)
Shabana, Aysha; Monis, Renita Sharon; Crasta, Asha; Khan, S. A.
2018-05-01
In this paper the expressions for stiffness and Damping derivatives are obtained in a closed form for perfect gas where the flow is quasi-steady and axi-axisymmetric, and the nose semi angle of the cone is such that the Mach number M 2 behind the shock M 2 ≥ 2.5. Results are presented for an oscillating cone for gas with = 1.666, at different Mach numbers and semi cone angles. The Stiffness derivative decreases with pivot position and also with semi vertex angle, there is substantial change in the stiffness derivative when semi-vertex has been increased from 5 degrees to ten degrees, further increase in the semi-vertex angle results in marginal change in the stiffness derivative. Due the marginal change in the Mach number level there is marginal increase in the magnitude of the stability and with further increase in the inertia level the stability derivative conform to the Mach number independence principle. The present theory for Oscillating cone is restricted to quasi-steady case. Viscous effects have been neglected. The expressions so obtained for stability derivative in pitch are valid for a slender ogive which often approximates to the whole fuselage of an aircraft.
NASA Astrophysics Data System (ADS)
Adami, Riccardo; Cacciapuoti, Claudio; Finco, Domenico; Noja, Diego
We define the Schrödinger equation with focusing, cubic nonlinearity on one-vertex graphs. We prove global well-posedness in the energy domain and conservation laws for some self-adjoint boundary conditions at the vertex, i.e. Kirchhoff boundary condition and the so-called δ and δ‧ boundary conditions. Moreover, in the same setting, we study the collision of a fast solitary wave with the vertex and we show that it splits in reflected and transmitted components. The outgoing waves preserve a soliton character over a time which depends on the logarithm of the velocity of the ingoing solitary wave. Over the same timescale, the reflection and transmission coefficients of the outgoing waves coincide with the corresponding coefficients of the linear problem. In the analysis of the problem, we follow ideas borrowed from the seminal paper [17] about scattering of fast solitons by a delta interaction on the line, by Holmer, Marzuola and Zworski. The present paper represents an extension of their work to the case of graphs and, as a byproduct, it shows how to extend the analysis of soliton scattering by other point interactions on the line, interpreted as a degenerate graph.
Gaia DR1 Evidence of Disrupting the Perseus Arm
NASA Astrophysics Data System (ADS)
Baba, Junichi; Kawata, Daisuke; Matsunaga, Noriyuki; Grand, Robert J. J.; Hunt, Jason A. S.
2018-02-01
We have discovered a clear sign of the disruption phase of the Perseus arm in the Milky Way using Cepheid variables, taking advantage of the accurately measured distances of Cepheids and the proper motions from Gaia Data Release 1. Both the Galactocentric radial and rotation velocities of 77 Cepheids within 1.5 kpc of the Perseus arm are correlated with their distances from the locus of the Perseus arm, as the trailing side is rotating faster and moving inward compared to the leading side. We also found a negative vertex deviation for the Cepheids on the trailing side, ‑27.°6 ± 2.°4, in contrast to the positive vertex deviation in the solar neighborhood. This is, to our knowledge, the first direct evidence that the vertex deviation around the Perseus arm is affected by the spiral arm. We compared these observational trends with our N-body/hydrodynamics simulations based on a static density-wave spiral scenario and with those based on a transient dynamic spiral scenario. Although our comparisons are limited to qualitative trends, they strongly favor the conclusion that the Perseus arm is in the disruption phase of a transient arm.
Event-related brain potentials preceding speech and nonspeech oral movements of varying complexity.
Wohlert, A B
1993-10-01
Cortical preparation for movement is reflected in the readiness potential (RP) waveform preceding voluntary limb movements. In the case of oral movements, the RP may be affected by the complexity or linguistic nature of the tasks. In this experiment, EEG potentials before a nonspeech task (lip pursing), a speech-like task (lip rounding), and single word production were recorded from scalp electrodes placed at the cranial vertex (Cz) and over the left and right motor strips (C3' and C4'). Seven right-handed female subjects produced at least 70 repetitions of the three tasks, in each of five repeated sessions. EEG records were averaged with respect to EMG onset at the lip. The word task, as opposed to the other tasks, was associated with greater negative amplitude in the RP waveform at the vertex site. Differences between the waveforms recorded at the right- and left-hemisphere sites were insignificant. Although intersubject variability was high, individuals had relatively stable patterns of response across sessions. Results suggest that the RP recorded at the vertex site is sensitive to changes in task complexity. The RP did not reflect lateralized activity indicative of hemispheric dominance.
Statistical features of hypnagogic EEG measured by a new scoring system.
Tanaka, H; Hayashi, M; Hori, T
1996-11-01
The purpose of this study was to examine the durations of individual occurrences of each of nine hypnagogic electroencephalographic (EEG) stages and the interchange relationship among these stages. Most of the alpha patterns (stages 1, 2, and 3), ripples (stage 5), and spindles (stage 9) tended to last > 2 minutes. On the other hand, histograms of the durations of time in EEG flattening (stage 4) and vertex sharp wave (stages 6, 7, and 8) patterns had peaks that lasted < 30 seconds. Analysis of the sequences of EEG stage changes demonstrated that shifts to adjacent stages were most common for all stages. A smooth change in EEG stage occurred in the downward or upward direction in the hypnagogic state. This was especially true for the first five stages. EEG stages with vertex sharp waves (stages 6, 7, and 8), however, showed less-smooth changes, with approximately 20% of all changes involving a jump of more than one stage. These results show that the basic EEG activities in the sleep onset period are the alpha, theta, and sleep spindles activities, whereas the activities of vertex sharp waves seem to have a secondary or enhancing role, instead of independent characteristics.
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
Wang, Jun; Pei, Jian; Cui, Xiao; Sun, Kexing; Ni, Huanhuan; Zhou, Cuixia; Wu, Ji; Huang, Mei; Ji, Li
2015-10-01
To compare the clinical efficacy on upper limb motor impairment in stroke between the interactive dynamic scalp acupuncture therapy and the traditional scalp acupuncture therapy. The randomized controlled trial and MINIMIZE layering randomization software were adopted. Seventy patients of upper limb with III to V grade in Brunnstrom scale after stroke were randomized into an interactive dynamic scalp acupuncture group and a traditional scalp acupuncture group, 35 cases in each one. In the interactive dynamic scalp acupuncture group, the middle 2/5 of Dingnieqianxiexian (anterior oblique line of vertex-temporal), the middle 2/5 of Dingniehouxiexian (posterior oblique line of vertex-temporal) and Dingpangerxian (lateral line 2 of vertex) on the affected side were selected as the stimulation areas. Additionally, the rehabilitation training was applied during scalp acupuncture treatment. In the traditional scalp acupuncture group, the scalp stimulation areas were same as the interactive dynamic scalp acupuncture group. But the rehabilitation training was applied separately. The rehabilitation training was applied in the morning and the scalp acupuncture was done in the afternoon. The results in Fugl-Meyer for the upper limb motor function (U-FMA), the Wolf motor function measure scale (WM- FT) and the modified Barthel index in the two groups were compared between the two groups before treatment and in 1 and 2 months of treatment, respectively. After treatment, the U-FMA score, WMFT score and the score of the modified Barthel index were all apparently improved as compared with those before treatment (all P < 0.01). The improvement in the U-FMA score after treatment in the interactive dynamic scalp acupuncture group was better than that in the traditional scalp acupuncture group (P < 0.05). For the patients of IV to V grade in Brunnstrom scale, WMFT score in 2 months of treatment and the score of Barthel index after treatment in the interactive dynamic scalp acupuncture group were improved apparently as compared with those in the traditional scalp acupuncture group (P < 0.05, P < 0.01). But, for the patients of III grade in Brunnstrom scale, WMFT score and the score of Barthel index after treatment in the interactive dynamic scalp acupuncture group were not different significantly as compared with those in the traditional scalp acupuncture group (both P > 0.05). For the patients of IV to V grade in Brunnstrom scale in stroke, the interactive dynamic scalp acupuncture therapy achieves the superior improvements of the upper limb motor function and the activity of daily life as compared with the traditional scalp acupuncture therapy, and the longer the treatment lasts, the more apparent the improvements are. For the patients of III grade in Brunnstrom scale, the interactive dynamic scalp acupuncture therapy achieves the similar improvement in the upper limb motor impairment as compared with the traditional scalp acupuncture therapy.
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.
Functional Data Approximation on Bounded Domains using Polygonal Finite Elements.
Cao, Juan; Xiao, Yanyang; Chen, Zhonggui; Wang, Wenping; Bajaj, Chandrajit
2018-07-01
We construct and analyze piecewise approximations of functional data on arbitrary 2D bounded domains using generalized barycentric finite elements, and particularly quadratic serendipity elements for planar polygons. We compare approximation qualities (precision/convergence) of these partition-of-unity finite elements through numerical experiments, using Wachspress coordinates, natural neighbor coordinates, Poisson coordinates, mean value coordinates, and quadratic serendipity bases over polygonal meshes on the domain. For a convex n -sided polygon, the quadratic serendipity elements have 2 n basis functions, associated in a Lagrange-like fashion to each vertex and each edge midpoint, rather than the usual n ( n + 1)/2 basis functions to achieve quadratic convergence. Two greedy algorithms are proposed to generate Voronoi meshes for adaptive functional/scattered data approximations. Experimental results show space/accuracy advantages for these quadratic serendipity finite elements on polygonal domains versus traditional finite elements over simplicial meshes. Polygonal meshes and parameter coefficients of the quadratic serendipity finite elements obtained by our greedy algorithms can be further refined using an L 2 -optimization to improve the piecewise functional approximation. We conduct several experiments to demonstrate the efficacy of our algorithm for modeling features/discontinuities in functional data/image approximation.
Keratosis follicularis spinulosa decalvans and acne keloidalis nuchae.
Goh, Michelle S Y; Magee, Jill; Chong, Alvin H
2005-11-01
A 27-year-old man presented with a 10-year history of scarring alopecia on the vertex of the scalp associated with follicular crusting and pustule formation, and a papular eruption on the posterior neck. Additionally, there was keratosis pilaris on the cheeks, eyebrows and thighs. Histology from the vertex showed scarring with a mixed perifollicular inflammatory infiltrate and foci of acute suppurative folliculitis. With clinical correlation, the diagnosis of keratosis follicularis spinulosa decalvans and concurrent acne keloidalis nuchae was made. The association of keratosis follicularis spinulosa decalvans with acne keloidalis nuchae has not previously been described. The patient responded to treatment with oral isotretinoin 20 mg (0.25 mg/kg) daily for 12 months.
Cryo-Electron Microscopy of Viruses Infecting Bacterium
NASA Astrophysics Data System (ADS)
Chiu, Wah
2010-03-01
Single particle cryo-EM can yield structures of infectious bacterial viruses with and without imposed icosahedral symmetry at subnanometer resolution. Reconstructions of infectious and empty phage particles show substantial differences in the portal vertex protein complex at one of the 12 pentameric vertices in the icosahedral virus particle through which the viral genomes are packaged or released. In addition, electron cryo-tomography of viruses during infecting its bacterial host cell displayed multiple conformations of the tail fiber of the virus. Our structural observations by single particle and tomographic reconstructions suggest a mechanism whereby the viral tail fibers, upon binding to the host cell, induce a cascade of structural alterations of the portal vertex protein complex that triggers DNA release.
Brévart, Christophe; Bertani, Antoine; Abdourahman Aden, Hassan; Menguy, Paul; Dulou, Renaud
2011-01-01
Vertex epidural hematomas (VEDHs) are an uncommon situation and difficulties may be encountered in their diagnosis and management. This is more complicated when the surgical management has to be performed by general surgeons, not specialized in neurosurgery, in a remote location. It was in this context that we were brought to care in charge a 2-year-old boy who required a neurosurgical emergency rescue for a severe VEDH in Djibouti. Through the description of this case, we want to emphasize the value of developing a network of teleconsultation for the benefit of remote and isolated locations and learning basic techniques of emergency neurosurgery. PMID:22606578
Distance Magic-Type and Distance Antimagic-Type Labelings of Graphs
NASA Astrophysics Data System (ADS)
Freyberg, Bryan J.
Generally speaking, a distance magic-type labeling of a graph G of order n is a bijection l from the vertex set of the graph to the first n natural numbers or to the elements of a group of order n, with the property that the weight of each vertex is the same. The weight of a vertex x is defined as the sum (or appropriate group operation) of all the labels of vertices adjacent to x. If instead we require that all weights differ, then we refer to the labeling as a distance antimagic-type labeling. This idea can be generalized for directed graphs; the weight will take into consideration the direction of the arcs. In this manuscript, we provide new results for d-handicap labeling, a distance antimagic-type labeling, and introduce a new distance magic-type labeling called orientable Gamma-distance magic labeling. A d-handicap distance antimagic labeling (or just d-handicap labeling for short) of a graph G = ( V,E) of order n is a bijection l from V to the set {1,2,...,n} with induced weight function [special characters omitted]. such that l(xi) = i and the sequence of weights w(x 1),w(x2),...,w (xn) forms an arithmetic sequence with constant difference d at least 1. If a graph G admits a d-handicap labeling, we say G is a d-handicap graph. A d-handicap incomplete tournament, H(n,k,d ) is an incomplete tournament of n teams ranked with the first n natural numbers such that each team plays exactly k games and the strength of schedule of the ith ranked team is d more than the i + 1st ranked team. That is, strength of schedule increases arithmetically with strength of team. Constructing an H(n,k,d) is equivalent to finding a d-handicap labeling of a k-regular graph of order n.. In Chapter 2 we provide general constructions for every d for large classes of both n and k, providing breadfth and depth to the catalog of known H(n,k,d)'s. In Chapters 3 - 6, we introduce a new type of labeling called orientable Gamma-distance magic labeling. Let Gamma be an abelian group of order n. If for a graph G = (V,E) of order n there exists an orientation of the edges of G and a companion bijection from V to Gamma with the property that there is an element mu of Gamma (called the magic constant) such that [special characters omitted] where w(x) is the weight of vertex x, we say that G is orientable Gamma -distance magic. In addition to introducing the concept, we provide numerous results on orientable Zn-distance magic graphs, where Zn is the cyclic group of order n.. In Chapter 7, we summarize the results of this dissertation and provide suggestions for future work.
Sex differences in the effect of puberty on hippocampal morphology.
Satterthwaite, Theodore D; Vandekar, Simon; Wolf, Daniel H; Ruparel, Kosha; Roalf, David R; Jackson, Chad; Elliott, Mark A; Bilker, Warren B; Calkins, Monica E; Prabhakaran, Karthik; Davatzikos, Christos; Hakonarson, Hakon; Gur, Raquel E; Gur, Ruben C
2014-03-01
Puberty is the defining process of adolescence, and is accompanied by divergent trajectories of behavior and cognition for males and females. Here we examine whether sex differences exist in the effect of puberty on the morphology of the hippocampus and amygdala. T1-weighted structural neuroimaging was performed in a sample of 524 pre- or postpubertal individuals ages 10 to 22 years. Hippocampal and amygdala volume and shape were quantified using the Functional Magnetic Resonance Imaging of the Brain (FMRIB) Software Library (FSL) FIRST procedure and scaled by intracranial volume. The effects on regional volume of age, sex, puberty, and their interactions were examined using linear regression. Postpubertal sex differences were examined using a vertex analysis. Prepubertal males and females had similar hippocampal volumes, whereas postpubertal females had significantly larger bilateral hippocampi, resulting in a significant puberty-by-sex interaction even when controlling for age and age-by-sex. This effect was regionally specific and was not apparent in the amygdala. Vertex analysis revealed that postpubertal differences were most prominent in the lateral aspect of the hippocampus bilaterally, corresponding to the CA1 subfield. These results establish that there are regionally specific sex differences in the effect of puberty on the hippocampus. These findings are relevant for the understanding of psychiatric disorders that have both hippocampal dysfunction and prominent gender disparities during adolescence. Copyright © 2014 American Academy of Child and Adolescent Psychiatry. Published by Elsevier Inc. All rights reserved.
A Weighted Configuration Model and Inhomogeneous Epidemics
NASA Astrophysics Data System (ADS)
Britton, Tom; Deijfen, Maria; Liljeros, Fredrik
2011-12-01
A random graph model with prescribed degree distribution and degree dependent edge weights is introduced. Each vertex is independently equipped with a random number of half-edges and each half-edge is assigned an integer valued weight according to a distribution that is allowed to depend on the degree of its vertex. Half-edges with the same weight are then paired randomly to create edges. An expression for the threshold for the appearance of a giant component in the resulting graph is derived using results on multi-type branching processes. The same technique also gives an expression for the basic reproduction number for an epidemic on the graph where the probability that a certain edge is used for transmission is a function of the edge weight (reflecting how closely `connected' the corresponding vertices are). It is demonstrated that, if vertices with large degree tend to have large (small) weights on their edges and if the transmission probability increases with the edge weight, then it is easier (harder) for the epidemic to take off compared to a randomized epidemic with the same degree and weight distribution. A recipe for calculating the probability of a large outbreak in the epidemic and the size of such an outbreak is also given. Finally, the model is fitted to three empirical weighted networks of importance for the spread of contagious diseases and it is shown that R 0 can be substantially over- or underestimated if the correlation between degree and weight is not taken into account.
Optical testing of progressive ophthalmic glasses based on galvo mirrors
NASA Astrophysics Data System (ADS)
Stuerwald, S.; Schmitt, R.
2014-03-01
In production of ophthalmic freeform optics like progressive eyeglasses, the specimens are tested according to a standardized method which is based on the measurement of the vertex power on usually less than 10 points. For a better quality management and thus to ensure more reliable and valid tests, a more comprehensive measurement approach is required. For Shack Hartmann Sensors (SHS) the dynamic range is defined by the number of micro-lenses and the resolution of the imaging sensor. Here, we present an approach for measuring wavefronts with increased dynamic range and lateral resolution by the use of a scanning procedure. Therefore, the proposed innovative setup is based on galvo mirrors that are capable of measuring the vertex power with a lateral resolution below one millimeter since this is sufficient for a functional test of progressive eyeglasses. Expressed in a more abstract way, the concept is based on a selection and thereby encoding of single sub-apertures of the wave front under test. This allows measuring the wave fronts slope consecutively in a scanning procedure. The use of high precision galvo systems allows a lateral resolution below one millimeter as well as a significant fast scanning ability. The measurement concept and performance of this method will be demonstrated for different spherical and freeformed specimens like progressive eye glasses. Furthermore, approaches for calibration of the measurement system will be characterized and the optical design of the detector will be discussed.
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.
Description and performance of track and primary-vertex reconstruction with the CMS tracker
Chatrchyan, Serguei
2014-10-16
A description is provided of the software algorithms developed for the CMS tracker both for reconstructing charged-particle trajectories in proton-proton interactions and for using the resulting tracks to estimate the positions of the LHC luminous region and individual primary-interaction vertices. Despite the very hostile environment at the LHC, the performance obtained with these algorithms is found to be excellent. For tbar t events under typical 2011 pileup conditions, the average track-reconstruction efficiency for promptly-produced charged particles with transverse momenta of p T > 0.9GeV is 94% for pseudorapidities of |η| < 0.9 and 85% for 0.9 < |η| < 2.5.more » The inefficiency is caused mainly by hadrons that undergo nuclear interactions in the tracker material. For isolated muons, the corresponding efficiencies are essentially 100%. For isolated muons of p T = 100GeV emitted at |η| < 1.4, the resolutions are approximately 2.8% in p T, and respectively, 10μm and 30μm in the transverse and longitudinal impact parameters. The position resolution achieved for reconstructed primary vertices that correspond to interesting pp collisions is 10–12μm in each of the three spatial dimensions. The tracking and vertexing software is fast and flexible, and easily adaptable to other functions, such as fast tracking for the trigger, or dedicated tracking for electrons that takes into account bremsstrahlung.« less
Michel, L; Reygagne, P; Benech, P; Jean-Louis, F; Scalvino, S; Ly Ka So, S; Hamidou, Z; Bianovici, S; Pouch, J; Ducos, B; Bonnet, M; Bensussan, A; Patatian, A; Lati, E; Wdzieczak-Bakala, J; Choulot, J-C; Loing, E; Hocquaux, M
2017-11-01
Male androgenetic alopecia (AGA) is the most common form of hair loss in men. It is characterized by a distinct pattern of progressive hair loss starting from the frontal area and the vertex of the scalp. Although several genetic risk loci have been identified, relevant genes for AGA remain to be defined. To identify biomarkers associated with AGA. Molecular biomarkers associated with premature AGA were identified through gene expression analysis using cDNA generated from scalp vertex biopsies of hairless or bald men with premature AGA, and healthy volunteers. This monocentric study reveals that genes encoding mast cell granule enzymes, inflammatory mediators and immunoglobulin-associated immune mediators were significantly overexpressed in AGA. In contrast, underexpressed genes appear to be associated with the Wnt/β-catenin and bone morphogenic protein/transforming growth factor-β signalling pathways. Although involvement of these pathways in hair follicle regeneration is well described, functional interpretation of the transcriptomic data highlights different events that account for their inhibition. In particular, one of these events depends on the dysregulated expression of proopiomelanocortin, as confirmed by polymerase chain reaction and immunohistochemistry. In addition, lower expression of CYP27B1 in patients with AGA supports the notion that changes in vitamin D metabolism contributes to hair loss. This study provides compelling evidence for distinct molecular events contributing to alopecia that may pave the way for new therapeutic approaches. © 2017 British Association of Dermatologists.
PROPOSAL FOR A SILICON VERTEX TRACKER (VTX) FOR THE PHENIX EXPERIMENT
DOE Office of Scientific and Technical Information (OSTI.GOV)
AKIBA,Y.
2004-10-01
We propose the construction of a Silicon Vertex Tracker (VTX) for the PHENIX experiment at RHIC. The VTX will substantially enhance the physics capabilities of the PHENIX central arm spectrometers. Our prime motivation is to provide precision measurements of heavy-quark production (charm and beauty) in A+A, p(d)+A, and polarized p+p collisions. These are key measurements for the future RHIC program, both for the heavy ion program as it moves from the discovery phase towards detailed investigation of the properties of the dense nuclear medium created in heavy ion collisions, and for the exploration of the nucleon spin-structure functions. In addition,more » the VTX will also considerably improve other measurements with PHENIX. The main physics topics addressed by the VTX are: (1) Hot and dense strongly interacting matter--(a) Potential enhancement of charm production, (b) Open beauty production, (c) Flavor dependence of jet quenching and QCD energy loss, (d) Accurate charm reference for quarkonium, (e) Thermal dilepton radiation, (f) High p{sub T} phenomena with light flavors above 10-15 GeV/c in p{sub T}, and (g) Upsilon spectroscopy in the e{sup +}e{sup -} decay channel. (2) Gluon spin structure of the nucleon--(a) {Delta}G/G with charm, (b) {Delta}G/G with beauty, and (c) x dependence of {Delta}G/G with {gamma}-jet correlations. (3) Nucleon structure in nuclei--Gluon shadowing over broad x-range.« less
Four-point functions and the permutation group S4
NASA Astrophysics Data System (ADS)
Eichmann, Gernot; Fischer, Christian S.; Heupel, Walter
2015-09-01
Four-point functions are at the heart of many interesting physical processes. A prime example is the light-by-light scattering amplitude, which plays an important role in the calculation of hadronic contributions to the anomalous magnetic moment of the muon. In the calculation of such quantities one faces the challenge of finding a suitable and well-behaved basis of tensor structures in coordinate and/or momentum space. Provided all (or many) of the external legs represent similar particle content, a powerful tool to construct and organize such bases is the permutation group S4. We introduce an efficient notation for dealing with the irreducible multiplets of S4, and we highlight the merits of this treatment by exemplifying four-point functions with gauge-boson legs such as the four-gluon vertex and the light-by-light scattering amplitude. The multiplet analysis is also useful for isolating the important kinematic regions and the dynamical singularity content of such amplitudes. Our analysis serves as a basis for future efficient calculations of these and similar objects.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Sun, Siyang; Gao, Song; Kondabagil, Kiran
2012-04-04
Tailed DNA bacteriophages assemble empty procapsids that are subsequently filled with the viral genome by means of a DNA packaging machine situated at a special fivefold vertex. The packaging machine consists of a 'small terminase' and a 'large terminase' component. One of the functions of the small terminase is to initiate packaging of the viral genome, whereas the large terminase is responsible for the ATP-powered translocation of DNA. The small terminase subunit has three domains, an N-terminal DNA-binding domain, a central oligomerization domain, and a C-terminal domain for interacting with the large terminase. Here we report structures of the centralmore » domain in two different oligomerization states for a small terminase from the T4 family of phages. In addition, we report biochemical studies that establish the function for each of the small terminase domains. On the basis of the structural and biochemical information, we propose a model for DNA packaging initiation.« less
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 ).
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
Processing data, for improved, accuracy, from device for measuring speed of sound in a gas
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.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Garriga, Jaume; Institute of Cosmology, Department of Physics and Astronomy, Tufts University,Medford, MA 02155; Urakawa, Yuko
It is well known that, in single clock inflation, the curvature perturbation ζ is constant in time on superhorizon scales. In the standard bulk description this follows quite simply from the local conservation of the energy momentum tensor in the bulk. On the other hand, in a holographic description, the constancy of the curvature perturbation must be related to the properties of the RG flow in the boundary theory. Here, we show that, in single clock holographic inflation, the time independence of correlators of ζ follows from the absence of the anomolous dimension of the energy momentum tensor in themore » boundary theory, and from the so-called consistency relations for vertex functions with a soft leg.« less
Domain decomposition methods for nonconforming finite element spaces of Lagrange-type
NASA Technical Reports Server (NTRS)
Cowsar, Lawrence C.
1993-01-01
In this article, we consider the application of three popular domain decomposition methods to Lagrange-type nonconforming finite element discretizations of scalar, self-adjoint, second order elliptic equations. The additive Schwarz method of Dryja and Widlund, the vertex space method of Smith, and the balancing method of Mandel applied to nonconforming elements are shown to converge at a rate no worse than their applications to the standard conforming piecewise linear Galerkin discretization. Essentially, the theory for the nonconforming elements is inherited from the existing theory for the conforming elements with only modest modification by constructing an isomorphism between the nonconforming finite element space and a space of continuous piecewise linear functions.
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.
A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs
DOE Office of Scientific and Technical Information (OSTI.GOV)
Choudhury, Sutanay; Holder, Larry; Chin, George
2015-02-02
Cyber security is one of the most significant technical challenges in current times. Detecting adversarial activities, prevention of theft of intellectual properties and customer data is a high priority for corporations and government agencies around the world. Cyber defenders need to analyze massive-scale, high-resolution network flows to identify, categorize, and mitigate attacks involving net- works spanning institutional and national boundaries. Many of the cyber attacks can be described as subgraph patterns, with promi- nent examples being insider infiltrations (path queries), denial of service (parallel paths) and malicious spreads (tree queries). This motivates us to explore subgraph matching on streaming graphsmore » in a continuous setting. The novelty of our work lies in using the subgraph distributional statistics collected from the streaming graph to determine the query processing strategy. We introduce a “Lazy Search" algorithm where the search strategy is decided on a vertex-to-vertex basis depending on the likelihood of a match in the vertex neighborhood. We also propose a metric named “Relative Selectivity" that is used to se- lect between different query processing strategies. Our experiments performed on real online news, network traffic stream and a syn- thetic social network benchmark demonstrate 10-100x speedups over selectivity agnostic approaches.« less
A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs
DOE Office of Scientific and Technical Information (OSTI.GOV)
Choudhury, Sutanay; Holder, Larry; Chin, George
2015-05-27
Cyber security is one of the most significant technical challenges in current times. Detecting adversarial activities, prevention of theft of intellectual properties and customer data is a high priority for corporations and government agencies around the world. Cyber defenders need to analyze massive-scale, high-resolution network flows to identify, categorize, and mitigate attacks involving networks spanning institutional and national boundaries. Many of the cyber attacks can be described as subgraph patterns, with prominent examples being insider infiltrations (path queries), denial of service (parallel paths) and malicious spreads (tree queries). This motivates us to explore subgraph matching on streaming graphs in amore » continuous setting. The novelty of our work lies in using the subgraph distributional statistics collected from the streaming graph to determine the query processing strategy. We introduce a ``Lazy Search" algorithm where the search strategy is decided on a vertex-to-vertex basis depending on the likelihood of a match in the vertex neighborhood. We also propose a metric named ``Relative Selectivity" that is used to select between different query processing strategies. Our experiments performed on real online news, network traffic stream and a synthetic social network benchmark demonstrate 10-100x speedups over non-incremental, selectivity agnostic approaches.« less
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.
Quantifying indices of short- and long-range white matter connectivity at each cortical vertex
Scariati, Elisa; Mutlu, A. Kadir; Zöller, Daniela; Schneider, Maude; Eliez, Stephan
2017-01-01
Several neurodevelopmental diseases are characterized by impairments in cortical morphology along with altered white matter connectivity. However, the relationship between these two measures is not yet clear. In this study, we propose a novel methodology to compute and display metrics of white matter connectivity at each cortical point. After co-registering the extremities of the tractography streamlines with the cortical surface, we computed two measures of connectivity at each cortical vertex: the mean tracts’ length, and the proportion of short- and long-range connections. The proposed measures were tested in a clinical sample of 62 patients with 22q11.2 deletion syndrome (22q11DS) and 57 typically developing individuals. Using these novel measures, we achieved a fine-grained visualization of the white matter connectivity patterns at each vertex of the cortical surface. We observed an intriguing pattern of both increased and decreased short- and long-range connectivity in 22q11DS, that provides novel information about the nature and topology of white matter alterations in the syndrome. We argue that the method presented in this study opens avenues for additional analyses of the relationship between cortical properties and patterns of underlying structural connectivity, which will help clarifying the intrinsic mechanisms that lead to altered brain structure in neurodevelopmental disorders. PMID:29141024
Quantifying indices of short- and long-range white matter connectivity at each cortical vertex.
Padula, Maria Carmela; Schaer, Marie; Scariati, Elisa; Mutlu, A Kadir; Zöller, Daniela; Schneider, Maude; Eliez, Stephan
2017-01-01
Several neurodevelopmental diseases are characterized by impairments in cortical morphology along with altered white matter connectivity. However, the relationship between these two measures is not yet clear. In this study, we propose a novel methodology to compute and display metrics of white matter connectivity at each cortical point. After co-registering the extremities of the tractography streamlines with the cortical surface, we computed two measures of connectivity at each cortical vertex: the mean tracts' length, and the proportion of short- and long-range connections. The proposed measures were tested in a clinical sample of 62 patients with 22q11.2 deletion syndrome (22q11DS) and 57 typically developing individuals. Using these novel measures, we achieved a fine-grained visualization of the white matter connectivity patterns at each vertex of the cortical surface. We observed an intriguing pattern of both increased and decreased short- and long-range connectivity in 22q11DS, that provides novel information about the nature and topology of white matter alterations in the syndrome. We argue that the method presented in this study opens avenues for additional analyses of the relationship between cortical properties and patterns of underlying structural connectivity, which will help clarifying the intrinsic mechanisms that lead to altered brain structure in neurodevelopmental disorders.
Young, Anna; Stoilova-McPhie, Svetla; Rothnie, Alice; Vallis, Yvonne; Harvey-Smith, Phillip; Ranson, Neil; Kent, Helen; Brodsky, Frances M; Pearse, Barbara M F; Roseman, Alan; Smith, Corinne J
2013-01-01
The molecular chaperone, Hsc70, together with its co-factor, auxilin, facilitates the ATP-dependent removal of clathrin during clathrin-mediated endocytosis in cells. We have used cryo-electron microscopy to determine the 3D structure of a complex of clathrin, auxilin401-910 and Hsc70 at pH 6 in the presence of ATP, frozen within 20 seconds of adding Hsc70 in order to visualize events that follow the binding of Hsc70 to clathrin and auxilin before clathrin disassembly. In this map, we observe density beneath the vertex of the cage that we attribute to bound Hsc70. This density emerges asymmetrically from the clathrin vertex, suggesting preferential binding by Hsc70 for one of the three possible sites at the vertex. Statistical comparison with a map of whole auxilin and clathrin previously published by us reveals the location of statistically significant differences which implicate involvement of clathrin light chains in structural rearrangements which occur after Hsc70 is recruited. Clathrin disassembly assays using light scattering suggest that loss of clathrin light chains reduces the efficiency with which auxilin facilitates this reaction. These data support a regulatory role for clathrin light chains in clathrin disassembly in addition to their established role in regulating clathrin assembly. PMID:23710728
NASA Astrophysics Data System (ADS)
Jiang, Wen; Chang, Juan; Jakana, Joanita; Weigele, Peter; King, Jonathan; Chiu, Wah
2006-02-01
The critical viral components for packaging DNA, recognizing and binding to host cells, and injecting the condensed DNA into the host are organized at a single vertex of many icosahedral viruses. These component structures do not share icosahedral symmetry and cannot be resolved using a conventional icosahedral averaging method. Here we report the structure of the entire infectious Salmonella bacteriophage epsilon15 (ref. 1) determined from single-particle cryo-electron microscopy, without icosahedral averaging. This structure displays not only the icosahedral shell of 60 hexamers and 11 pentamers, but also the non-icosahedral components at one pentameric vertex. The densities at this vertex can be identified as the 12-subunit portal complex sandwiched between an internal cylindrical core and an external tail hub connecting to six projecting trimeric tailspikes. The viral genome is packed as coaxial coils in at least three outer layers with ~90 terminal nucleotides extending through the protein core and the portal complex and poised for injection. The shell protein from icosahedral reconstruction at higher resolution exhibits a similar fold to that of other double-stranded DNA viruses including herpesvirus, suggesting a common ancestor among these diverse viruses. The image reconstruction approach should be applicable to studying other biological nanomachines with components of mixed symmetries.
The Approximability of Partial Vertex Covers in Trees.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Mkrtchyan, Vahan; Parekh, Ojas D.; Segev, Danny
Motivated by applications in risk management of computational systems, we focus our attention on a special case of the partial vertex cover problem, where the underlying graph is assumed to be a tree. Here, we consider four possible versions of this setting, depending on whether vertices and edges are weighted or not. Two of these versions, where edges are assumed to be unweighted, are known to be polynomial-time solvable (Gandhi, Khuller, and Srinivasan, 2004). However, the computational complexity of this problem with weighted edges, and possibly with weighted vertices, has not been determined yet. The main contribution of this papermore » is to resolve these questions, by fully characterizing which variants of partial vertex cover remain intractable in trees, and which can be efficiently solved. In particular, we propose a pseudo-polynomial DP-based algorithm for the most general case of having weights on both edges and vertices, which is proven to be NPhard. This algorithm provides a polynomial-time solution method when weights are limited to edges, and combined with additional scaling ideas, leads to an FPTAS for the general case. A secondary contribution of this work is to propose a novel way of using centroid decompositions in trees, which could be useful in other settings as well.« less
Lee, Si Woo; Hong, Jong Wook; Lee, Hyunhwa; Wi, Dae Han; Kim, Sun Mi; Han, Sang Woo; Park, Jeong Young
2018-06-14
The intrinsic correlation between an enhancement of catalytic activity and the flow of hot electrons generated at metal-oxide interfaces suggests an intriguing way to control catalytic reactions and is a significant subject in heterogeneous catalysis. Here, we show surface plasmon-induced catalytic enhancement by the peculiar nanocatalyst design of hexoctahedral (HOH) Au nanocrystals (NCs) with Cu2O clusters. We found that this inverse catalyst comprising a reactive oxide for the catalytic portion and a metal as the source of electrons by localized surface plasmon resonance (localized SPR) exhibits a change in catalytic activity by direct hot electron transfer or plasmon-induced resonance energy transfer (PIRET) when exposed to light. We prepared two types of inverse catalysts, Cu2O at the vertex sites of HOH Au NCs (Cu2O/Au vertex site) and a HOH Au NC-Cu2O core-shell structure (HOH Au@Cu2O), to test the structural effect on surface plasmons. Under broadband light illumination, the Cu2O/Au vertex site catalyst showed 30-90% higher catalytic activity and the HOH Au@Cu2O catalyst showed 10-30% higher catalytic activity than when in the dark. Embedding thin SiO2 layers between the HOH Au NCs and the Cu2O verified that the dominant mechanism for the catalytic enhancement is direct hot electron transfer from the HOH Au to the Cu2O. Finite-difference time domain calculations show that a much stronger electric field was formed on the vertex sites after growing the Cu2O on the HOH Au NCs. These results imply that the catalytic activity is enhanced when hot electrons, created from photon absorption on the HOH Au metal and amplified by the presence of surface plasmons, are transferred to the reactive Cu2O.
QUADRATIC SERENDIPITY FINITE ELEMENTS ON POLYGONS USING GENERALIZED BARYCENTRIC COORDINATES.
Rand, Alexander; Gillette, Andrew; Bajaj, Chandrajit
2014-01-01
We introduce a finite element construction for use on the class of convex, planar polygons and show it obtains a quadratic error convergence estimate. On a convex n -gon, our construction produces 2 n basis functions, associated in a Lagrange-like fashion to each vertex and each edge midpoint, by transforming and combining a set of n ( n + 1)/2 basis functions known to obtain quadratic convergence. The technique broadens the scope of the so-called 'serendipity' elements, previously studied only for quadrilateral and regular hexahedral meshes, by employing the theory of generalized barycentric coordinates. Uniform a priori error estimates are established over the class of convex quadrilaterals with bounded aspect ratio as well as over the class of convex planar polygons satisfying additional shape regularity conditions to exclude large interior angles and short edges. Numerical evidence is provided on a trapezoidal quadrilateral mesh, previously not amenable to serendipity constructions, and applications to adaptive meshing are discussed.
Low-momentum ghost dressing function and the gluon mass
DOE Office of Scientific and Technical Information (OSTI.GOV)
Boucaud, Ph.; Leroy, J. P.; Le Yaouanc, A.
2010-09-01
We study the low-momentum ghost propagator Dyson-Schwinger equation in the Landau gauge, assuming for the truncation a constant ghost-gluon vertex, as it is extensively done, and a simple model for a massive gluon propagator. Then, regular Dyson-Schwinger equation solutions (the zero-momentum ghost dressing function not diverging) appear to emerge, and we show the ghost propagator to be described by an asymptotic expression reliable up to the order O(q{sup 2}). That expression, depending on the gluon mass and the zero-momentum Taylor-scheme effective charge, is proven to fit pretty well some low-momentum ghost propagator data [I. L. Bogolubsky, E. M. Ilgenfritz, M.more » Muller-Preussker, and A. Sternbeck, Phys. Lett. B 676, 69 (2009); Proc. Sci., LAT2007 (2007) 290] from big-volume lattice simulations where the so-called ''simulated annealing algorithm'' is applied to fix the Landau gauge.« less
Nonlinear instability of half-solitons on star graphs
NASA Astrophysics Data System (ADS)
Kairzhan, Adilbek; Pelinovsky, Dmitry E.
2018-06-01
We consider a half-soliton stationary state of the nonlinear Schrödinger equation with the power nonlinearity on a star graph consisting of N edges and a single vertex. For the subcritical power nonlinearity, the half-soliton state is a degenerate critical point of the action functional under the mass constraint such that the second variation is nonnegative. By using normal forms, we prove that the degenerate critical point is a saddle point, for which the small perturbations to the half-soliton state grow slowly in time resulting in the nonlinear instability of the half-soliton state. The result holds for any N ≥ 3 and arbitrary subcritical power nonlinearity. It gives a precise dynamical characterization of the previous result of Adami et al. (2012) [2], where the half-soliton state was shown to be a saddle point of the action functional under the mass constraint for N = 3 and for cubic nonlinearity.
NASA Technical Reports Server (NTRS)
Rai, Man Mohan (Inventor); Madavan, Nateri K. (Inventor)
2007-01-01
A method and system for data modeling that incorporates the advantages of both traditional response surface methodology (RSM) and neural networks is disclosed. The invention partitions the parameters into a first set of s simple parameters, where observable data are expressible as low order polynomials, and c complex parameters that reflect more complicated variation of the observed data. Variation of the data with the simple parameters is modeled using polynomials; and variation of the data with the complex parameters at each vertex is analyzed using a neural network. Variations with the simple parameters and with the complex parameters are expressed using a first sequence of shape functions and a second sequence of neural network functions. The first and second sequences are multiplicatively combined to form a composite response surface, dependent upon the parameter values, that can be used to identify an accurate mode
Role of brain hemispheric dominance in anticipatory postural control strategies.
Cioncoloni, David; Rosignoli, Deborah; Feurra, Matteo; Rossi, Simone; Bonifazi, Marco; Rossi, Alessandro; Mazzocchio, Riccardo
2016-07-01
Most of the cerebral functions are asymmetrically represented in the two hemispheres. Moreover, dexterity and coordination of the distal segment of the dominant limbs depend on cortico-motor lateralization. In this study, we investigated whether postural control may be also considered a lateralized hemispheric brain function. To this aim, 15 young subjects were tested in standing position by measuring center of pressure (COP) shifts along the anteroposterior axis (COP-Y) during dynamic posturography before and after continuous Theta Burst Stimulation (cTBS) intervention applied to the dominant or non-dominant M1 hand area as well as to the vertex. We show that when subjects were expecting a forward platform translation, the COP-Y was positioned significantly backward or forward after dominant or non-dominant M1 stimulation, respectively. We postulate that cTBS applied on M1 may have disrupted the functional connectivity between intra- and interhemispheric areas implicated in the anticipatory control of postural stability. This study suggests a functional asymmetry between the two homologous primary motor areas, with the dominant hemisphere playing a critical role in the selection of the appropriate postural control strategy.
A measurement of the b quark fragmentation function at {radical}Q{sup 2} = 45.6 GeV
DOE Office of Scientific and Technical Information (OSTI.GOV)
Church, E.D.
1996-06-01
Presented here is a measurement of the b quark fragmentation function D{sub b}(X), taken from a sample of 504 semi-leptonic B decays which were selected from the 150,000 Z{sup 0} decays collected between 1993 and 1995 at the SLD at SLAC. The energy of each tagged B hadron is reconstructed using missing jet energy, based on the information from the lepton and a partially-reconstructed charm-decay vertex. Account is taken of the effect of primary orbitally excited mesons (B**s). An iterative unfolding procedure is used which serves to effectively extract the true fragmentation function from the reconstructed B energy spectrum. Themore » final result is shown to be compatible with many theoretical models. A comparison is made with other b fragmentation function measurements at 45.6 GeV, and this measurement is shown to be consistent with those results. The average scaled energy is found to be (x{sub E}) = 0.697{+-} 0.017(stat) {+-} 0.034(sys).« less
Beta-function B-spline smoothing on triangulations
NASA Astrophysics Data System (ADS)
Dechevsky, Lubomir T.; Zanaty, Peter
2013-03-01
In this work we investigate a novel family of Ck-smooth rational basis functions on triangulations for fitting, smoothing, and denoising geometric data. The introduced basis function is closely related to a recently introduced general method introduced in utilizing generalized expo-rational B-splines, which provides Ck-smooth convex resolutions of unity on very general disjoint partitions and overlapping covers of multidimensional domains with complex geometry. One of the major advantages of this new triangular construction is its locality with respect to the star-1 neighborhood of the vertex on which the said base is providing Hermite interpolation. This locality of the basis functions can be in turn utilized in adaptive methods, where, for instance a local refinement of the underlying triangular mesh affects only the refined domain, whereas, in other method one needs to investigate what changes are occurring outside of the refined domain. Both the triangular and the general smooth constructions have the potential to become a new versatile tool of Computer Aided Geometric Design (CAGD), Finite and Boundary Element Analysis (FEA/BEA) and Iso-geometric Analysis (IGA).
Betatron motion with coupling of horizontal and vertical degrees of freedom
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
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.
NASA Astrophysics Data System (ADS)
Li, Hsiang-Nan; Mishima, Satoshi; Sanda, A. I.
2005-12-01
We calculate the important next-to-leading-order contributions to the B→πK, ππ decays from the vertex corrections, the quark loops, and the magnetic penguins in the perturbative QCD approach. It is found that the latter two reduce the leading-order penguin amplitudes by about 10% and modify only the B→πK branching ratios. The main effect of the vertex corrections is to increase the small color-suppressed tree amplitude by a factor of 3, which then resolves the large difference between the direct CP asymmetries of the B0→π∓K± and B±→π0K± modes. The puzzle from the large B0→π0π0 branching ratio still remains.
Origami Multistability: From Single Vertices to Metasheets
NASA Astrophysics Data System (ADS)
Waitukaitis, Scott; Menaut, Rémi; Chen, Bryan Gin-ge; van Hecke, Martin
2015-02-01
We show that the simplest building blocks of origami-based materials—rigid, degree-four vertices—are generically multistable. The existence of two distinct branches of folding motion emerging from the flat state suggests at least bistability, but we show how nonlinearities in the folding motions allow generic vertex geometries to have as many as five stable states. In special geometries with collinear folds and symmetry, more branches emerge leading to as many as six stable states. Tuning the fold energy parameters, we show how monostability is also possible. Finally, we show how to program the stability features of a single vertex into a periodic fold tessellation. The resulting metasheets provide a previously unanticipated functionality—tunable and switchable shape and size via multistability.
Detection of honeycomb cell walls from measurement data based on Harris corner detection algorithm
NASA Astrophysics Data System (ADS)
Qin, Yan; Dong, Zhigang; Kang, Renke; Yang, Jie; Ayinde, Babajide O.
2018-06-01
A honeycomb core is a discontinuous material with a thin-wall structure—a characteristic that makes accurate surface measurement difficult. This paper presents a cell wall detection method based on the Harris corner detection algorithm using laser measurement data. The vertexes of honeycomb cores are recognized with two different methods: one method is the reduction of data density, and the other is the optimization of the threshold of the Harris corner detection algorithm. Each cell wall is then identified in accordance with the neighboring relationships of its vertexes. Experiments were carried out for different types and surface shapes of honeycomb cores, where the proposed method was proved effective in dealing with noise due to burrs and/or deformation of cell walls.
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.
Modularity of logarithmic parafermion vertex algebras
NASA Astrophysics Data System (ADS)
Auger, Jean; Creutzig, Thomas; Ridout, David
2018-05-01
The parafermionic cosets Ck = {Com} ( H , Lk(sl2) ) are studied for negative admissible levels k, as are certain infinite-order simple current extensions Bk of Ck . Under the assumption that the tensor theory considerations of Huang, Lepowsky and Zhang apply to Ck , irreducible Ck - and Bk -modules are obtained from those of Lk(sl2) . Assuming the validity of a certain Verlinde-type formula likewise gives the Grothendieck fusion rules of these irreducible modules. Notably, there are only finitely many irreducible Bk -modules. The irreducible Ck - and Bk -characters are computed and the latter are shown, when supplemented by pseudotraces, to carry a finite-dimensional representation of the modular group. The natural conjecture then is that the Bk are C_2 -cofinite vertex operator algebras.
Abd-Rabbo, Diala; Michnick, Stephen W
2017-03-16
Kinases and phosphatases (KP) form complex self-regulating networks essential for cellular signal processing. In spite of having a wealth of data about interactions among KPs and their substrates, we have very limited models of the structures of the directed networks they form and consequently our ability to formulate hypotheses about how their structure determines the flow of information in these networks is restricted. We assembled and studied the largest bona fide kinase-phosphatase network (KP-Net) known to date for the yeast Saccharomyces cerevisiae. Application of the vertex sort (VS) algorithm on the KP-Net allowed us to elucidate its hierarchical structure in which nodes are sorted into top, core and bottom layers, forming a bow tie structure with a strongly connected core layer. Surprisingly, phosphatases tend to sort into the top layer, implying they are less regulated by phosphorylation than kinases. Superposition of the widest range of KP biological properties over the KP-Net hierarchy shows that core layer KPs: (i), receive the largest number of inputs; (ii), form bottlenecks implicated in multiple pathways and in decision-making; (iii), and are among the most regulated KPs both temporally and spatially. Moreover, top layer KPs are more abundant and less noisy than those in the bottom layer. Finally, we showed that the VS algorithm depends on node degrees without biasing the biological results of the sorted network. The VS algorithm is available as an R package ( https://cran.r-project.org/web/packages/VertexSort/index.html ). The KP-Net model we propose possesses a bow tie hierarchical structure in which the top layer appears to ensure highest fidelity and the core layer appears to mediate signal integration and cell state-dependent signal interpretation. Our model of the yeast KP-Net provides both functional insight into its organization as we understand today and a framework for future investigation of information processing in yeast and eukaryotes in general.
Chen, Vincent Chin-Hung; Shen, Chao-Yu; Liang, Sophie Hsin-Yi; Li, Zhen-Hui; Tyan, Yeu-Sheng; Liao, Yin-To; Huang, Yin-Chen; Lee, Yena; McIntyre, Roger S; Weng, Jun-Cheng
2016-11-15
It is hypothesized that the phenomenology of major depressive disorder (MDD) is subserved by disturbances in the structure and function of brain circuits; however, findings of structural abnormalities using MRI have been inconsistent. Generalized q-sampling imaging (GQI) methodology provides an opportunity to assess the functional integrity of white matter tracts in implicated circuits. The study population was comprised of 16 outpatients with MDD (mean age 44.81±2.2 years) and 30 age- and gender-matched healthy controls (mean age 45.03±1.88 years). We excluded participants with any other primary mental disorder, substance use disorder, or any neurological illnesses. We used T1-weighted 3D MRI with voxel-based morphometry (VBM) and vertex-wise shape analysis, and GQI with voxel-based statistical analysis (VBA), graph theoretical analysis (GTA) and network-based statistical (NBS) analysis to evaluate brain structure and connectivity abnormalities in MDD compared to healthy controls correlates with clinical measures of depressive symptom severity, Hamilton Depression Rating Scale 17-item (HAMD) and Hospital Anxiety and Depression Scale (HADS). Using VBM and vertex-wise shape analyses, we found significant volumetric decreases in the hippocampus and amygdala among subjects with MDD (p<0.001). Using GQI, we found decreases in diffusion anisotropy in the superior longitudinal fasciculus and increases in diffusion probability distribution in the frontal lobe among subjects with MDD (p<0.01). In GTA and NBS analyses, we found several disruptions in connectivity among subjects with MDD, particularly in the frontal lobes (p<0.05). In addition, structural alterations were correlated with depressive symptom severity (p<0.01). Small sample size; the cross-sectional design did not allow us to observe treatment effects in the MDD participants. Our results provide further evidence indicating that MDD may be conceptualized as a brain disorder with abnormal circuit structure and connectivity. Copyright © 2016 Elsevier B.V. All rights reserved.
Hoving, E; Blaser, S; Kelly, E; Rutka, J T
1999-03-01
The case of a neonate with a large vertex cephalocele is presented. The anatomical features of this anomaly were evaluated by means of magnetic resonance imaging and magnetic resonance angiography. Fusion of the thalami, dysgenesis of the corpus callosum, and failure of adequate formation of the interhemispheric fissure were characteristics of the major cerebral anomalies associated with the cephalocele. The absence of a falx in the midline, a split configuration of the superior sagittal sinus, and a dysgenetic tentorium with a concomitant abnormal venous drainage pattern were found in association with a large dorsal cyst. Repair of the anomaly was undertaken on the 3rd postnatal day. A cerebrospinal fluid shunt was required to treat hydrocephalus on Day 30. The child is well at age 3 years, but with significant developmental delay. The pathogenesis of this vertex cephalocele relates to semilobar holoprosencephaly and dorsal cyst formation. In addition, a disturbance in the separation of the diencephalic portion of the neural tube from the surface ectoderm or skin during the final phases of neurulation had occurred to help create the large cephalocele. Detailed preoperative imaging studies and awareness of the embryology and anatomy of this lesion facilitated the repair of the cephalocele. The prognosis of the child is determined not only by the presence of hydrocephalus, but also by the number of associated major cerebral anomalies. Options for treatment are discussed.
Allanach, B. C.; Badziak, Marcin; Cottin, Giovanna; ...
2016-09-01
Here, we study the LHC phenomenology of the next-to-minimal model of gauge-mediated supersymmetry breaking, both for Run I and Run II. The Higgs phenomenology of the model is consistent with observations: a 125 GeV standard model-like Higgs which mixes with singlet-like state of mass around 90 GeV that provides a 2 \\sigma excess at LEP II. The model possesses regions of parameter space where a longer-lived lightest neutralino decays in the detector into a gravitino and a b-jet pair or a tau pair resulting in potential displaced vertex signatures. We investigate current bounds on sparticle masses and the discovery potentialmore » of the model, both via conventional searches and via searches for displaced vertices. The searches based on promptly decaying sparticles currently give a lower limit on the gluino mass 1080 GeV and could be sensitive up to 1900 GeV with 100 fb -1, whereas the current displaced vertex searches cannot probe this model due to b-quarks in the final state. We also show how the displaced vertex cuts might be relaxed in order to improve signal efficiency, while simultaneously applied prompt cuts reduce background, resulting in a much better sensitivity than either strategy alone and motivating a fully fledged experimental study.« less
NASA Astrophysics Data System (ADS)
Koziel, Michal; Amar-Youcef, Samir; Bialas, Norbert; Deveaux, Michael; Fröhlich, Ingo; Klaus, Philipp; Michel, Jan; Milanović, Borislav; Müntz, Christian; Stroth, Joachim; Tischler, Tobias; Weirich, Roland; Wiebusch, Michael
2017-02-01
The Compressed Baryonic Matter (CBM) Experiment is one of the core experiments of the future FAIR facility near Darmstadt (Germany). The fixed-target experiment will explore the phase diagram of strongly interacting matter in the regime of high net baryon densities with numerous probes, among them open charm mesons. The Micro Vertex Detector (MVD) will provide the secondary vertex resolution of ∼ 50 μm along the beam axis, contribute to the background rejection in dielectron spectroscopy, and to the reconstruction of weak decays. The detector comprises four stations placed at 5, 10, 15, and 20 cm downstream the target and inside the target vacuum. The stations will be populated with highly granular CMOS Monolithic Active Pixel Sensors, which will feature a spatial resolution of < 5 μm, a non-ionizing radiation tolerance of >1013neq /cm2, an ionizing radiation tolerance of ∼ 3 Mrad, and a readout speed of a few 10 μs/frame. This work introduces the MVD-PRESTO project, which aims at integrating a precursor of the second station of the CBM-MVD meeting the following requirements: material budget of x /X0 < 0.5 %, vacuum compatibility, double-sided sensor integration on a Thermal Pyrolytic Graphite (TPG) carrier, and heat evacuation of about 350 mW/cm2/sensor with a temperature gradient of a few K/cm.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Barbareschi, Daniele; et al.
We describe a general purpose detector ( "Fourth Concept") at the International Linear Collider (ILC) that can measure with high precision all the fundamental fermions and bosons of the standard model, and thereby access all known physics processes. The 4th concept consists of four basic subsystems: a pixel vertex detector for high precision vertex definitions, impact parameter tagging and near-beam occupancy reduction; a Time Projection Chamber for robust pattern recognition augmented with three high-precision pad rows for precision momentum measurement; a high precision multiple-readout fiber calorimeter, complemented with an EM dual-readout crystal calorimeter, for the energy measurement of hadrons, jets,more » electrons, photons, missing momentum, and the tagging of muons; and, an iron-free dual-solenoid muon system for the inverse direction bending of muons in a gas volume to achieve high acceptance and good muon momentum resolution. The pixel vertex chamber, TPC and calorimeter are inside the solenoidal magnetic field. All four subsytems separately achieve the important scientific goal to be 2-to-10 times better than the already excellent LEP detectors, ALEPH, DELPHI, L3 and OPAL. All four basic subsystems contribute to the identification of standard model partons, some in unique ways, such that consequent physics studies are cogent. As an integrated detector concept, we achieve comprehensive physics capabilities that puts all conceivable physics at the ILC within reach.« less
Results on 3D interconnection from AIDA WP3
NASA Astrophysics Data System (ADS)
Moser, Hans-Günther; AIDA-WP3
2016-09-01
From 2010 to 2014 the EU funded AIDA project established in one of its work packages (WP3) a network of groups working collaboratively on advanced 3D integration of electronic circuits and semiconductor sensors for applications in particle physics. The main motivation came from the severe requirements on pixel detectors for tracking and vertexing at future Particle Physics experiments at LHC, super-B factories and linear colliders. To go beyond the state-of-the-art, the main issues were studying low mass, high bandwidth applications, with radiation hardness capabilities, with low power consumption, offering complex functionality, with small pixel size and without dead regions. The interfaces and interconnects of sensors to electronic readout integrated circuits are a key challenge for new detector applications.
Stepwise emergence of the face-sensitive N170 event-related potential component.
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.
Some boundary-value problems for anisotropic quarter plane
NASA Astrophysics Data System (ADS)
Arkhypenko, K. M.; Kryvyi, O. F.
2018-04-01
To solve the mixed boundary-value problems of the anisotropic elasticity for the anisotropic quarter plane, a method based on the use of the space of generalized functions {\\Im }{\\prime }({\\text{R}}+2) with slow growth properties was developed. The two-dimensional integral Fourier transform was used to construct the system of fundamental solutions for the anisotropic quarter plane in this space and a system of eight boundary integral relations was obtained, which allows one to reduce the mixed boundary-value problems for the anisotropic quarter plane directly to systems of singular integral equations with fixed singularities. The exact solutions of these systems were found by using the integral Mellin transform. The asymptotic behavior of solutions was investigated at the vertex of the quarter plane.
Quantum group structure and local fields in the algebraic approach to 2D gravity
NASA Astrophysics Data System (ADS)
Schnittger, J.
1995-07-01
This review contains a summary of the work by J.-L. Gervais and the author on the operator approach to 2d gravity. Special emphasis is placed on the construction of local observables — the Liouville exponentials and the Liouville field itself — and the underlying algebra of chiral vertex operators. The double quantum group structure arising from the presence of two screening charges is discussed and the generalized algebra and field operators are derived. In the last part, we show that our construction gives rise to a natural definition of a quantum tau function, which is a noncommutative version of the classical group-theoretic representation of the Liouville fields by Leznov and Saveliev.
Experimental Highlights: Heavy Quark Physics in Heavy-Ion Collisions at RHIC
Nouicer, Rachid
2017-03-22
The discovery at RHIC of large high-p T suppression and flow of electrons from heavy quarks flavors have altered our view of the hot and dense matter formed in central Au + Au collisions at √s NN = 200 GeV. These results suggest a large energy loss and flow of heavy quarks in the hot, dense matter. In recent years, the RHIC experiments upgraded the detectors; (1) PHENIX Collaboration installed silicon vertex tracker (VTX) at midrapidity region and forward silicon vertex tracker (FVTX) at the forward rapidity region, and (2) STAR Collaboration installed the heavy flavor tracker (HFT) and themore » muon telescope detector (MTD) both at the mid-rapidity region. The PHENIX experiments established measurements of ψ (1S ) and ψ (2S ) production as a function of system size, p + p, p + Al, p + Au, and 3He + Au collisions at √s NN = 200 GeV. In p/ 3He + A collisions at forward rapidity, we observe no difference in the ψ (2S )/ψ (1S ) ratio relative to p + p collisions. At backward rapidity, where the comoving particle density is higher, we find that the ψ (2S ) is preferentially suppressed by a factor of two. STAR Collaboration presents the first J/ ψ measurements in the di-muon decay channel in Au + Au at √s NN = 200 GeV at mid-rapidity. In conclusion, we observe a clear J/ψ R AA suppression and qualitatively well described by transport models, including dissociation and regeneration simultaneously.« less
Confident false memories for spatial location are mediated by V1.
Karanian, Jessica M; Slotnick, Scott D
2018-06-27
Prior functional magnetic resonance imaging (fMRI) results suggest that true memories, but not false memories, activate early sensory cortex. It is thought that false memories, which reflect conscious processing, do not activate early sensory cortex because these regions are associated with nonconscious processing. We posited that false memories may activate the earliest visual cortical processing region (i.e., V1) when task conditions are manipulated to evoke conscious processing in this region. In an fMRI experiment, abstract shapes were presented to the left or right of fixation during encoding. During retrieval, old shapes were presented at fixation and participants characterized each shape as previously on the "left" or "right" followed by an "unsure"-"sure"-"very sure" confidence rating. False memories for spatial location (i.e., "right"/left or "left"/right trials with "sure" or "very sure" confidence ratings) were associated with activity in bilateral early visual regions, including V1. In a follow-up fMRI-guided transcranial magnetic stimulation (TMS) experiment that employed the same paradigm, we assessed whether V1 activity was necessary for false memory construction. Between the encoding phase and the retrieval phase of each run, TMS (1 Hz, 8 min) was used to target the location of false memory activity (identified in the fMRI experiment) in left V1, right V1, or the vertex (control site). Confident false memories for spatial location were significantly reduced following TMS to V1, as compared to vertex. The results of the present experiments provide convergent evidence that early sensory cortex can contribute to false memory construction under particular task conditions.
Godfrey, Stephen J; Geisler, Jonathan; Fitzgerald, Erich M G
2013-02-01
The structure of the olfactory apparatus is not well known in both archaic and extant whales; the result of poor preservation in most fossils and locational isolation deep within the skulls in both fossil and Recent taxa. Several specimens now shed additional light on the subject. A partial skull of an archaic cetacean is reported from the Pamunkey River, Virginia, USA. The specimen probably derives from the upper middle Eocene (Piney Point Formation) and is tentatively assigned to the Protocetidae. Uncrushed cranial cavities associated with the olfactory apparatus were devoid of sediment. CT scans clearly reveal the dorsal nasal meatus, ethmoturbinates within the olfactory recess, the cribriform plate, the area occupied by the olfactory bulbs, and the olfactory nerve tract. Several sectioned skulls of the minke whale (Balaenoptera acutorostrata) were also examined, and olfactory structures are remarkably similar to those observed in the fossil skull from the Pamunkey River. One important difference between the two is that the fossil specimen has an elongate olfactory nerve tract. The more forward position of the external nares in extant balaenopterids when compared with those of extant odontocetes is interpreted to be the result of the need to retain a functional olfactory apparatus and the forward position of the supraoccipital/cranial vertex. An increase in the distance between the occipital condyles and the vertex in balaenopterids enhances the mechanical advantage of the epaxial musculature that inserts on the occiput, a specialization that likely stabilizes the head of these enormous mammals during lunge feeding. Copyright © 2012 Wiley Periodicals, Inc.
PROPOSAL FOR A SILICON VERTEX TRACKER (VTX) FOR THE PHENIX EXPERIMENT.
DOE Office of Scientific and Technical Information (OSTI.GOV)
AKIBA,Y.
2004-03-30
We propose the construction of a Silicon Vertex Tracker (VTX) for the PHENIX experiment at RHIC. The VTX will substantially enhance the physics capabilities of the PHENIX central arm spectrometers. Our prime motivation is to provide precision measurements of heavy-quark production (charm and beauty) in A+A, p(d)+A, and polarized p+p collisions. These are key measurements for the future RHIC program, both for the heavy ion program as it moves from the discovery phase towards detailed investigation of the properties of the dense nuclear medium created in heavy ion collisions, and for the exploration of the nucleon spin-structure functions. In addition,more » the VTX will also considerably improve other measurements with PHENIX. The main physics topics addressed by the VTX are: (1) Hot and dense strongly interacting matter--Potential enhancement of charm production; Open beauty production; Flavor dependence of jet quenching and QCD energy loss; Accurate charm reference for quarkonium; Thermal dilepton radiation; High p{sub T} phenomena with light flavors above 10-15 GeV/c in p{sub T}; and Upsilon spectroscopy in the e{sup +}e{sup -} decay channel. (2) Gluon spin structure of the nucleon--{Delta}G/G with charm; {Delta}G/G with beauty; and x dependence of {Delta}G/G with {gamma}-jet correlations. (3) Nucleon structure in nuclei--Gluon shadowing over broad x-range. With the present PHENIX detector, heavy-quark production has been measured indirectly through the observation of single electrons. These measurements are inherently limited in accuracy by systematic uncertainties resulting from the large electron background from Dalitz decays and photon conversions. In particular, the statistical nature of the analysis does not allow for a model-independent separation of the charm and beauty contributions. The VTX detector will provide vertex tracking with a resolution of <50 {micro}m over a large coverage both in rapidity (|{eta}| < 1.2) and in azimuthal angle ({Delta}{phi} {approx} 2{pi}). With this device, significantly enhanced and qualitatively new data can be obtained. A more robust and accurate measurement of heavy-quark production over a wide kinematics range will be possible. The main benefits are in three areas. Firstly, by selecting electrons with a distance of closest approach (DCA) to the primary vertex larger than {approx}100 {micro}m, the background will be suppressed by several orders of magnitude and thereby a clean and robust measurement of heavy flavor production in the single electron channel will become available. Secondly, because the lifetime of mesons with beauty is significantly larger than that of mesons with charm, the VTX information will allow us to disentangle charm from beauty production over a broad p{sub T} range. Thirdly, a DCA cut on hadrons will reduce the combinatorial background of K{pi} to an extent that a direct measurement of D mesons through this decay channel will become possible. In addition, the VTX detector will substantially extend our p{sub T} coverage in high p{sub T} charged particles, and it also will enable us to measure {gamma}+jet correlations.« less
Faster search by lackadaisical quantum walk
NASA Astrophysics Data System (ADS)
Wong, Thomas G.
2018-03-01
In the typical model, a discrete-time coined quantum walk searching the 2D grid for a marked vertex achieves a success probability of O(1/log N) in O(√{N log N}) steps, which with amplitude amplification yields an overall runtime of O(√{N} log N). We show that making the quantum walk lackadaisical or lazy by adding a self-loop of weight 4 / N to each vertex speeds up the search, causing the success probability to reach a constant near 1 in O(√{N log N}) steps, thus yielding an O(√{log N}) improvement over the typical, loopless algorithm. This improved runtime matches the best known quantum algorithms for this search problem. Our results are based on numerical simulations since the algorithm is not an instance of the abstract search algorithm.
Nanoparticle/nanotube-based nanoelectronic devices and chemically-directed assembly thereof
Schmidt, Howard K [Cypress, TX
2011-02-22
According to some embodiments, the present invention provides a nanoelectronic device based on a nanostructure that may include a nanotube with first and second ends, a metallic nanoparticle attached to the first end, and an insulating nanoparticle attached to the second end. The nanoelectronic device may include additional nanostructures so a to form a plurality of nanostructures comprising the first nanostructure and the additional nanostructures. The plurality of nanostructures may arranged in a network comprising a plurality of edges and a plurality of vertices, wherein each edge comprises a nanotube and each vertex comprises at least one insulating nanoparticle and at least one metallic nanoparticle adjacent the insulating nanoparticle. The combination of at least one edge and at least one vertex comprises a diode. The device may be an optical rectenna.
NASA Astrophysics Data System (ADS)
Campbell, M.; Heijne, E. H. M.; Llopart, X.; Colas, P.; Giganon, A.; Giomataris, Y.; Chefdeville, M.; Colijn, A. P.; Fornaini, A.; van der Graaf, H.; Kluit, P.; Timmermans, J.; Visschers, J. L.; Schmitz, J.
2006-05-01
A small TPC has been read out by means of a Medipix2 chip as direct anode. A Micromegas foil was placed 50 μm above the chip, and electron multiplication occurred in the gap. With a He/isobutane 80/20 mixture, gas multiplication factors up to tens of thousands were achieved, resulting in an efficiency for detecting single electrons of better than 90%. With this new readout technology for gas-filled detectors we recorded many image frames containing 2D images with tracks from cosmic muons. Along these tracks, electron clusters were observed, as well as δ-rays. With a gas layer thickness of only 1 mm, the device could be applied as vertex detector, outperforming all Si-based detectors.
Charged lepton flavor violation in a class of radiative neutrino mass generation models
NASA Astrophysics Data System (ADS)
Chowdhury, Talal Ahmed; Nasri, Salah
2018-04-01
We investigate the charged lepton flavor violating processes μ →e γ , μ →e e e ¯, and μ -e conversion in nuclei for a class of three-loop radiative neutrino mass generation models with electroweak multiplets of increasing order. We find that, because of certain cancellations among various one-loop diagrams which give the dipole and nondipole contributions in an effective μ e γ vertex and a Z-penguin contribution in an effective μ e Z vertex, the flavor violating processes μ →e γ and μ -e conversion in nuclei become highly suppressed compared to μ →e e e ¯ process. Therefore, the observation of such a pattern in LFV processes may reveal the radiative mechanism behind neutrino mass generation.
Statistical physics of hard combinatorial optimization: Vertex cover problem
NASA Astrophysics Data System (ADS)
Zhao, Jin-Hua; Zhou, Hai-Jun
2014-07-01
Typical-case computation complexity is a research topic at the boundary of computer science, applied mathematics, and statistical physics. In the last twenty years, the replica-symmetry-breaking mean field theory of spin glasses and the associated message-passing algorithms have greatly deepened our understanding of typical-case computation complexity. In this paper, we use the vertex cover problem, a basic nondeterministic-polynomial (NP)-complete combinatorial optimization problem of wide application, as an example to introduce the statistical physical methods and algorithms. We do not go into the technical details but emphasize mainly the intuitive physical meanings of the message-passing equations. A nonfamiliar reader shall be able to understand to a large extent the physics behind the mean field approaches and to adjust the mean field methods in solving other optimization problems.
Chiral anomalies and effective vector meson Lagrangian beyond the tree level
DOE Office of Scientific and Technical Information (OSTI.GOV)
Dominguez, C.A.
1987-12-01
The decays ..pi../sup O/ ..-->.. ..gamma gamma.., rho ..-->.. ..pi gamma.., ..omega.. ..-->.. ..pi gamma.., ..omega.. ..-->.. 3..pi.. and ..gamma.. ..-->.. 3..pi.. are studied in the framework of the chiral invariant effective Vector Meson Lagrangian beyond the tree level. The standard Lagrangian is enlarged by including an infinite number of radial excitations which are summed according to the dual model. As a result tree level diagrams are modified by a universal form factor at each vertex containing off-mass-shell mesons, but still respecting chiral anomaly low energy theorems. These vertex corrections bring the tree level predictions into better agreement with experiment.more » The presence of the ..omega.. ..-->.. 3..pi.. contact term is confirmed but its strength is considerably smaller than at tree level.« less
Reconstructing Unrooted Phylogenetic Trees from Symbolic Ternary Metrics.
Grünewald, Stefan; Long, Yangjing; Wu, Yaokun
2018-03-09
Böcker and Dress (Adv Math 138:105-125, 1998) presented a 1-to-1 correspondence between symbolically dated rooted trees and symbolic ultrametrics. We consider the corresponding problem for unrooted trees. More precisely, given a tree T with leaf set X and a proper vertex coloring of its interior vertices, we can map every triple of three different leaves to the color of its median vertex. We characterize all ternary maps that can be obtained in this way in terms of 4- and 5-point conditions, and we show that the corresponding tree and its coloring can be reconstructed from a ternary map that satisfies those conditions. Further, we give an additional condition that characterizes whether the tree is binary, and we describe an algorithm that reconstructs general trees in a bottom-up fashion.
Sudden emergence of q-regular subgraphs in random graphs
NASA Astrophysics Data System (ADS)
Pretti, M.; Weigt, M.
2006-07-01
We investigate the computationally hard problem whether a random graph of finite average vertex degree has an extensively large q-regular subgraph, i.e., a subgraph with all vertices having degree equal to q. We reformulate this problem as a constraint-satisfaction problem, and solve it using the cavity method of statistical physics at zero temperature. For q = 3, we find that the first large q-regular subgraphs appear discontinuously at an average vertex degree c3 - reg simeq 3.3546 and contain immediately about 24% of all vertices in the graph. This transition is extremely close to (but different from) the well-known 3-core percolation point c3 - core simeq 3.3509. For q > 3, the q-regular subgraph percolation threshold is found to coincide with that of the q-core.
Graph modeling systems and methods
Neergaard, Mike
2015-10-13
An apparatus and a method for vulnerability and reliability modeling are provided. The method generally includes constructing a graph model of a physical network using a computer, the graph model including a plurality of terminating vertices to represent nodes in the physical network, a plurality of edges to represent transmission paths in the physical network, and a non-terminating vertex to represent a non-nodal vulnerability along a transmission path in the physical network. The method additionally includes evaluating the vulnerability and reliability of the physical network using the constructed graph model, wherein the vulnerability and reliability evaluation includes a determination of whether each terminating and non-terminating vertex represents a critical point of failure. The method can be utilized to evaluate wide variety of networks, including power grid infrastructures, communication network topologies, and fluid distribution systems.
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.
Complex structures from patterned cell sheets
Misra, M.; Audoly, B.; Shvartsman, S. Y.
2017-01-01
The formation of three-dimensional structures from patterned epithelial sheets plays a key role in tissue morphogenesis. An important class of morphogenetic mechanisms relies on the spatio-temporal control of apical cell contractility, which can result in the localized bending of cell sheets and in-plane cell rearrangements. We have recently proposed a modified vertex model that can be used to systematically explore the connection between the two-dimensional patterns of cell properties and the emerging three-dimensional structures. Here we review the proposed modelling framework and illustrate it through the computational analysis of the vertex model that captures the salient features of the formation of the dorsal appendages during Drosophila oogenesis. This article is part of the themed issue ‘Systems morphodynamics: understanding the development of tissue hardware’. PMID:28348251
Parallelized Stochastic Cutoff Method for Long-Range Interacting Systems
NASA Astrophysics Data System (ADS)
Endo, Eishin; Toga, Yuta; Sasaki, Munetaka
2015-07-01
We present a method of parallelizing the stochastic cutoff (SCO) method, which is a Monte-Carlo method for long-range interacting systems. After interactions are eliminated by the SCO method, we subdivide a lattice into noninteracting interpenetrating sublattices. This subdivision enables us to parallelize the Monte-Carlo calculation in the SCO method. Such subdivision is found by numerically solving the vertex coloring of a graph created by the SCO method. We use an algorithm proposed by Kuhn and Wattenhofer to solve the vertex coloring by parallel computation. This method was applied to a two-dimensional magnetic dipolar system on an L × L square lattice to examine its parallelization efficiency. The result showed that, in the case of L = 2304, the speed of computation increased about 102 times by parallel computation with 288 processors.
Enhancing Community Detection By Affinity-based Edge Weighting Scheme
DOE Office of Scientific and Technical Information (OSTI.GOV)
Yoo, Andy; Sanders, Geoffrey; Henson, Van
Community detection refers to an important graph analytics problem of finding a set of densely-connected subgraphs in a graph and has gained a great deal of interest recently. The performance of current community detection algorithms is limited by an inherent constraint of unweighted graphs that offer very little information on their internal community structures. In this paper, we propose a new scheme to address this issue that weights the edges in a given graph based on recently proposed vertex affinity. The vertex affinity quantifies the proximity between two vertices in terms of their clustering strength, and therefore, it is idealmore » for graph analytics applications such as community detection. We also demonstrate that the affinity-based edge weighting scheme can improve the performance of community detection algorithms significantly.« less
Measurement of Muon Neutrino Quasielastic Scattering on a Hydrocarbon Target at E ν~3.5 GeV
Fiorentini, G. A.; Schmitz, D. W.; Rodrigues, P. A.; ...
2013-07-11
We report a study of ν μ charged-current quasielastic events in the segmented scintillator inner tracker of the MINERvA experiment running in the NuMI neutrino beam at Fermilab. The events were selected by requiring a μ⁻ and low calorimetric recoil energy separated from the interaction vertex. We measure the flux-averaged differential cross section, dσ/dQ², and study the low energy particle content of the final state. Deviations are found between the measured dσ/dQ² and the expectations of a model of independent nucleons in a relativistic Fermi gas. We also observe an excess of energy near the vertex consistent with multiple protonsmore » in the final state.« less
Riggio, Egidio
2012-08-01
Extra-projected Natrelle 510 belongs to a new generation of silicone breast implants. A single-surgeon prospective study set out to investigate the device's features, outcomes, and complications, and devise a proper measurement method based on the zenith system. From December 2004 to June 2010, 75 subjects (150 implants) were enrolled in four cohorts: primary augmentation (66.7%), primary mastopexy augmentation (17.3%), secondary implant exchange (9.3%), and secondary implant exchange+pexy (6.7%). The system used to select the implant correlated the point of maximal projection (vertex-zenith) and nipple position. The surgical approach included (1) narrow pocket, preferably dual-plane; (2) device vertex 1-2.5 cm beneath nipple (zenith range=12°-23°) related to a nipple-inframammary fold distance of 7-7.5 cm at maximal stretch and a nipple-sternum/lower-pole line distance of 4-5 cm; (3) inframammary fold lowered minimally; (4) vertex at ±1 cm from the midbreast meridian crossing the nipple; and (5) maximizing the biomechanical effects between soft-tissue dynamics, firmer gel pressure, and pectoralis major counterpressure to expand the lower skin (dynamic tension). Mean follow-up was 26.5 months (range=6-72); in 20 subjects; follow-up was over 3 years (average=50 months) with a 90.8% patient satisfaction rate. This rate was lower in patients with preoperative ptosis. There was inframammary preservation with 60% of the implants and modification in 40% (0.80±0.45 cm). The overall complication rate per implant was 16.6% and included wound healing/scarring (7%), malrotation (2.6%, only 1% after primary augmentation), rippling (2%), capsular contracture (1.3%), and bottoming-out (0.6%). The revision rate was 6%, of which 3.3% were pocket revisions. Greater skills are required through the learning curve, patient education, case selection, planning using the nipple-vertex relationship (the zenith system), and improved surgical manipulation. Indications and contraindications were analyzed. Cosmetic results were compliant with different breast shapes, and excellent for the breast with poor projection, in thin subjects, and those with low BMI. Ptotic breast should require a larger amount of pexy, 510 did not lift the breast enough. Based on vertex-nipple distance, dynamic tension, and skin extensibility, this new approach gives guidelines and methods to perform breast augmentation with extra-projected implants. This journal requires that authors assign a level of evidence to each article. For a full description of these Evidence-Based Medicine ratings, please refer to the Table of Contents or the online Instructions to Authors at www.springer.com/00266.
Sensitivity to cutaneous warm stimuli varies greatly in the human head.
Kim, Yung-Bin; Jung, Dahee; Park, Joonhee; Lee, Joo-Young
2017-10-01
The head has been known as the most sensitive area to temperature changes but the values are limited to the face. The purpose of this study was to examine cutaneous warm thresholds on the scalp and face of young males. Eight males participated in this study (24 ± 3 yrs in age, 178.2 ± 5.3cm in height, and 90.0 ± 15.4kg in body mass). All measurements were conducted in an environmental chamber (27 ± 1°C air temperature and 53 ± 1% relative humidity). Cutaneous warm thresholds were measured on nine areas of the following regions: the frontal (two points on the right), parietal (a point on the right and the vertex, respectively), temporal (two points on the right), and occipital region (on the right) along with the forehead using a thermal stimulator (rate of temperature increase 0.1°Cs -1 ). Skin temperatures on the nine head regions were monitored during the threshold test. The results showed that 1) no significant differences were found in initial skin temperatures among the nine head regions; 2) cutaneous warm detecting temperatures were significantly greater on the vertex (38.2 ± 3.5°C) than on the forehead (34.8 ± 1.4°C) and the other seven scalp regions (P < 0.05); 3) subjects detected the increase of 1.2 ± 1.0°C on the forehead and 1.5 ± 1.2°C on the occipital region as the first warmth while the vertex was the most insensitive to the increase of temperature (4.0 ± 3.2°C) (P < 0.05). In summary, the scalp region of young males was less sensitive to the temperature change when compared to the forehead, and the vertex was the most insensitive among the eight scalp regions to the temperature increase. We conclude that the entire head should be considered as a binary topography with the face and the scalp in terms of cutaneous thermal sensitivity. Copyright © 2017 Elsevier Ltd. All rights reserved.
Double Collins effect in e+e-→Λ Λ ¯ X and e+e-→Λ π X processes in a diquark spectator model
NASA Astrophysics Data System (ADS)
Wang, Xiaoyu; Yang, Yongliang; Lu, Zhun
2018-06-01
We study the Collins function H1⊥ of the Λ hyperon, which describes the fragmentation of a transversely polarized quark into an unpolarized Λ hyperon. We calculate H1⊥ for light quarks of the Λ hyperon, in the diquark spectator model with a Gaussian form factor for the hyperon-quark-diquark vertex. The model calculation includes contributions from both the scalar diquark and vector diquark spectators. Using the model result, we estimate the azimuthal asymmetry A12, which appears in the ratio of unlike-sign events to like-sign events contributed by double Collins effects, in the processes e+e-→Λ Λ ¯X and e+e-→Λ π X . The QCD evolution effects for the half kT moment of the Collins function and the unpolarized fragmentation function D1(z ) are also included. The results show that the asymmetries are sizable and measurable at the kinematical configurations of Belle and BABAR experiments. We also find that the evolution effects play an important role in the phenomenological analysis.
Linearized self-consistent GW approach satisfying the Ward identity
NASA Astrophysics Data System (ADS)
Kuwahara, Riichi; Ohno, Kaoru
2014-09-01
We propose a linearized self-consistent GW approach satisfying the Ward identity. The vertex function derived from the Ward-Takahashi identity in the limit of q =0 and ω -ω'=0 is included in the self-energy and the polarization function as a consequence of the linearization of the quasiparticle equation. Due to the energy dependence of the self-energy, the Hamiltonian is a non-Hermitian operator and quasiparticle states are nonorthonormal and linearly dependent. However, the linearized quasiparticle states recover orthonormality and fulfill the completeness condition. This approach is very efficient, and the resulting quasiparticle energies are greatly improved compared to the nonlinearized self-consistent GW approach, although its computational cost is not much increased. We show the results for atoms and dimers of Li and Na compared with other approaches. We also propose convenient ways to calculate the Luttinger-Ward functional Φ based on a plasmon-pole model and calculate the total energy for the ground state. As a result, we conclude that the linearization improves overall behaviors in the self-consistent GW approach.
Pinch technique and the Batalin-Vilkovisky formalism
NASA Astrophysics Data System (ADS)
Binosi, Daniele; Papavassiliou, Joannis
2002-07-01
In this paper we take the first step towards a nondiagrammatic formulation of the pinch technique. In particular we proceed into a systematic identification of the parts of the one-loop and two-loop Feynman diagrams that are exchanged during the pinching process in terms of unphysical ghost Green's functions; the latter appear in the standard Slavnov-Taylor identity satisfied by the tree-level and one-loop three-gluon vertex. This identification allows for the consistent generalization of the intrinsic pinch technique to two loops, through the collective treatment of entire sets of diagrams, instead of the laborious algebraic manipulation of individual graphs, and sets up the stage for the generalization of the method to all orders. We show that the task of comparing the effective Green's functions obtained by the pinch technique with those computed in the background field method Feynman gauge is significantly facilitated when employing the powerful quantization framework of Batalin and Vilkovisky. This formalism allows for the derivation of a set of useful nonlinear identities, which express the background field method Green's functions in terms of the conventional (quantum) ones and auxiliary Green's functions involving the background source and the gluonic antifield; these latter Green's functions are subsequently related by means of a Schwinger-Dyson type of equation to the ghost Green's functions appearing in the aforementioned Slavnov-Taylor identity.
Abé, C; Rolstad, S; Petrovic, P; Ekman, C-J; Sparding, T; Ingvar, M; Landén, M
2018-06-15
Frontal cortical abnormalities and executive function impairment co-occur in bipolar disorder. Recent studies have shown that bipolar subtypes differ in the degree of structural and functional impairments. The relationships between cognitive performance and cortical integrity have not been clarified and might differ across patients with bipolar disorder type I, II, and healthy subjects. Using a vertex-wise whole-brain analysis, we investigated how cortical integrity, as measured by cortical thickness, correlates with executive performance in patients with bipolar disorder type I, II, and controls (N = 160). We found focal associations between executive function and cortical thickness in the medial prefrontal cortex in bipolar II patients and controls, but not in bipolar I disorder. In bipolar II patients, we observed additional correlations in lateral prefrontal and occipital regions. Our findings suggest that bipolar disorder patients show altered structure-function relationships, and importantly that those relationships may differ between bipolar subtypes. The findings are line with studies suggesting subtype-specific neurobiological and cognitive profiles. This study contributes to a better understanding of brain structure-function relationships in bipolar disorder and gives important insights into the neuropathophysiology of diagnostic subtypes. © 2018 The Authors Acta Psychiatrica Scandinavica Published by John Wiley & Sons Ltd.
Monolithic Active Pixel Sensors
NASA Astrophysics Data System (ADS)
Lutz, P.
In close collaboration with the group from Strasbourg, Saclay has been developing fast monolithic active pixel sensors for future vertex detectors. This presentation gives some recent results from the MIMOSA serie, emphazising the participation of the group.
Partial compensation interferometry measurement system for parameter errors of conicoid surface
NASA Astrophysics Data System (ADS)
Hao, Qun; Li, Tengfei; Hu, Yao; Wang, Shaopu; Ning, Yan; Chen, Zhuo
2018-06-01
Surface parameters, such as vertex radius of curvature and conic constant, are used to describe the shape of an aspheric surface. Surface parameter errors (SPEs) are deviations affecting the optical characteristics of an aspheric surface. Precise measurement of SPEs is critical in the evaluation of optical surfaces. In this paper, a partial compensation interferometry measurement system for SPE of a conicoid surface is proposed based on the theory of slope asphericity and the best compensation distance. The system is developed to measure the SPE-caused best compensation distance change and SPE-caused surface shape change and then calculate the SPEs with the iteration algorithm for accuracy improvement. Experimental results indicate that the average relative measurement accuracy of the proposed system could be better than 0.02% for the vertex radius of curvature error and 2% for the conic constant error.
A cell-vertex multigrid method for the Navier-Stokes equations
NASA Technical Reports Server (NTRS)
Radespiel, R.
1989-01-01
A cell-vertex scheme for the Navier-Stokes equations, which is based on central difference approximations and Runge-Kutta time stepping, is described. Using local time stepping, implicit residual smoothing, a multigrid method, and carefully controlled artificial dissipative terms, very good convergence rates are obtained for a wide range of two- and three-dimensional flows over airfoils and wings. The accuracy of the code is examined by grid refinement studies and comparison with experimental data. For an accurate prediction of turbulent flows with strong separations, a modified version of the nonequilibrium turbulence model of Johnson and King is introduced, which is well suited for an implementation into three-dimensional Navier-Stokes codes. It is shown that the solutions for three-dimensional flows with strong separations can be dramatically improved, when a nonequilibrium model of turbulence is used.
NASA Technical Reports Server (NTRS)
Schwent, V. L.; Hillyard, S. A.; Galambos, R.
1975-01-01
A randomized sequence of tone bursts was delivered to subjects at short inter-stimulus intervals with the tones originating from one of three spatially and frequency specific channels. The subject's task was to count the tones in one of the three channels at a time, ignoring the other two, and press a button after each tenth tone. In different conditions, tones were given at high and low intensities and with or without a background white noise to mask the tones. The N sub 1 component of the auditory vertex potential was found to be larger in response to attended channel tones in relation to unattended tones. This selective enhancement of N sub 1 was minimal for loud tones presented without noise and increased markedly for the lower tone intensity and in noise added conditions.
CCD-based vertex detector for ILC
NASA Astrophysics Data System (ADS)
Stefanov, Konstantin D.
2006-12-01
Charge Coupled Devices (CCDs) have been successfully used in several high-energy physics experiments over the last 20 years. Their small pixel size and excellent precision provide a superb tool for studying of short-lived particles and understanding the nature at fundamental level. Over the last few years the Linear Collider Flavour Identification (LCFI) collaboration has developed Column-Parallel CCDs (CPCCD) and CMOS readout chips, to be used for the vertex detector at the International Linear Collider (ILC). The CPCCDs are very fast devices capable of satisfying the challenging requirements imposed by the beam structure of the superconducting accelerator. The first set of prototype devices have been successfully designed, manufactured and tested, with second generation chips on the way. Another idea for CCD-based device, the In-situ Storage Image Sensor (ISIS) is also under development and the first prototype has been manufactured.
Eccentric connectivity index of chemical trees
DOE Office of Scientific and Technical Information (OSTI.GOV)
Haoer, R. S., E-mail: raadsehen@gmail.com; Department of Mathematics, Faculty of Computer Sciences and Mathematics, University Of Kufa, Najaf; Atan, K. A., E-mail: kamel@upm.edu.my
Let G = (V, E) be a simple connected molecular graph. In such a simple molecular graph, vertices and edges are depicted atoms and chemical bonds respectively, we refer to the sets of vertices by V (G) and edges by E (G). If d(u, v) be distance between two vertices u, v ∈ V(G) and can be defined as the length of a shortest path joining them. Then, the eccentricity connectivity index (ECI) of a molecular graph G is ξ(G) = ∑{sub v∈V(G)} d(v) ec(v), where d(v) is degree of a vertex v ∈ V(G). ec(v) is the length ofmore » a greatest path linking to another vertex of v. In this study, we focus the general formula for the eccentricity connectivity index (ECI) of some chemical trees as alkenes.« less