LOGISTIC NETWORK REGRESSION FOR SCALABLE ANALYSIS OF NETWORKS WITH JOINT EDGE/VERTEX DYNAMICS

PubMed Central

Almquist, Zack W.; Butts, Carter T.

2015-01-01

Change in group size and composition has long been an important area of research in the social sciences. Similarly, interest in interaction dynamics has a long history in sociology and social psychology. However, the effects of endogenous group change on interaction dynamics are a surprisingly understudied area. One way to explore these relationships is through social network models. Network dynamics may be viewed as a process of change in the edge structure of a network, in the vertex set on which edges are defined, or in both simultaneously. Although early studies of such processes were primarily descriptive, recent work on this topic has increasingly turned to formal statistical models. Although showing great promise, many of these modern dynamic models are computationally intensive and scale very poorly in the size of the network under study and/or the number of time points considered. Likewise, currently used models focus on edge dynamics, with little support for endogenously changing vertex sets. Here, the authors show how an existing approach based on logistic network regression can be extended to serve as a highly scalable framework for modeling large networks with dynamic vertex sets. The authors place this approach within a general dynamic exponential family (exponential-family random graph modeling) context, clarifying the assumptions underlying the framework (and providing a clear path for extensions), and they show how model assessment methods for cross-sectional networks can be extended to the dynamic case. Finally, the authors illustrate this approach on a classic data set involving interactions among windsurfers on a California beach. PMID:26120218

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

LOGISTIC NETWORK REGRESSION FOR SCALABLE ANALYSIS OF NETWORKS WITH JOINT EDGE/VERTEX DYNAMICS.

PubMed

Almquist, Zack W; Butts, Carter T

2014-08-01

Change in group size and composition has long been an important area of research in the social sciences. Similarly, interest in interaction dynamics has a long history in sociology and social psychology. However, the effects of endogenous group change on interaction dynamics are a surprisingly understudied area. One way to explore these relationships is through social network models. Network dynamics may be viewed as a process of change in the edge structure of a network, in the vertex set on which edges are defined, or in both simultaneously. Although early studies of such processes were primarily descriptive, recent work on this topic has increasingly turned to formal statistical models. Although showing great promise, many of these modern dynamic models are computationally intensive and scale very poorly in the size of the network under study and/or the number of time points considered. Likewise, currently used models focus on edge dynamics, with little support for endogenously changing vertex sets. Here, the authors show how an existing approach based on logistic network regression can be extended to serve as a highly scalable framework for modeling large networks with dynamic vertex sets. The authors place this approach within a general dynamic exponential family (exponential-family random graph modeling) context, clarifying the assumptions underlying the framework (and providing a clear path for extensions), and they show how model assessment methods for cross-sectional networks can be extended to the dynamic case. Finally, the authors illustrate this approach on a classic data set involving interactions among windsurfers on a California beach.

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.

Generalized minimum dominating set and application in automatic text summarization

NASA Astrophysics Data System (ADS)

Xu, Yi-Zhi; Zhou, Hai-Jun

2016-03-01

For a graph formed by vertices and weighted edges, a generalized minimum dominating set (MDS) is a vertex set of smallest cardinality such that the summed weight of edges from each outside vertex to vertices in this set is equal to or larger than certain threshold value. This generalized MDS problem reduces to the conventional MDS problem in the limiting case of all the edge weights being equal to the threshold value. We treat the generalized MDS problem in the present paper by a replica-symmetric spin glass theory and derive a set of belief-propagation equations. As a practical application we consider the problem of extracting a set of sentences that best summarize a given input text document. We carry out a preliminary test of the statistical physics-inspired method to this automatic text summarization problem.

3D Facial Pattern Analysis for Autism

DTIC Science & Technology

2010-07-01

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

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

PubMed

Silva, Eduardo Sant Ana da; Pedrini, Helio

2016-03-01

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

Origami building blocks: Generic and special four-vertices

NASA Astrophysics Data System (ADS)

Waitukaitis, Scott; van Hecke, Martin

2016-02-01

Four rigid panels connected by hinges that meet at a point form a four-vertex, the fundamental building block of origami metamaterials. Most materials designed so far are based on the same four-vertex geometry, and little is known regarding how different geometries affect folding behavior. Here we systematically categorize and analyze the geometries and resulting folding motions of Euclidean four-vertices. Comparing the relative sizes of sector angles, we identify three types of generic vertices and two accompanying subtypes. We determine which folds can fully close and the possible mountain-valley assignments. Next, we consider what occurs when sector angles or sums thereof are set equal, which results in 16 special vertex types. One of these, flat-foldable vertices, has been studied extensively, but we show that a wide variety of qualitatively different folding motions exist for the other 15 special and 3 generic types. Our work establishes a straightforward set of rules for understanding the folding motion of both generic and special four-vertices and serves as a roadmap for designing origami metamaterials.

Origami building blocks: Generic and special four-vertices.

PubMed

Waitukaitis, Scott; van Hecke, Martin

2016-02-01

Four rigid panels connected by hinges that meet at a point form a four-vertex, the fundamental building block of origami metamaterials. Most materials designed so far are based on the same four-vertex geometry, and little is known regarding how different geometries affect folding behavior. Here we systematically categorize and analyze the geometries and resulting folding motions of Euclidean four-vertices. Comparing the relative sizes of sector angles, we identify three types of generic vertices and two accompanying subtypes. We determine which folds can fully close and the possible mountain-valley assignments. Next, we consider what occurs when sector angles or sums thereof are set equal, which results in 16 special vertex types. One of these, flat-foldable vertices, has been studied extensively, but we show that a wide variety of qualitatively different folding motions exist for the other 15 special and 3 generic types. Our work establishes a straightforward set of rules for understanding the folding motion of both generic and special four-vertices and serves as a roadmap for designing origami metamaterials.

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.

Low-mass materials and vertex detector systems

DOE PAGES

Cooper, William E.

2014-01-01

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

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.

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

Quality Improvement Initiatives Lead to Reduction in Nulliparous Term Singleton Vertex Cesarean Delivery Rate

PubMed Central

Vadnais, Mary A.; Hacker, Michele R.; Shah, Neel T.; Jordan, JoAnn; Modest, Anna M.; Siegel, Molly; Golen, Toni H.

2018-01-01

Background The nulliparous term singleton vertex (NTSV) cesarean delivery rate has been recognized as a meaningful benchmark. Variation in the NTSV cesarean delivery rate among hospitals and providers suggests many hospitals may be able to safely improve their rates. The NTSV cesarean delivery rate at the authors’ institution was higher than state and national averages. This study was conducted to determine the influence of a set of quality improvement interventions on the NTSV cesarean delivery rate. Methods From 2008 through 2015, at a single tertiary care academic medical center, a multi-strategy approach that included provider education, provider feedback, and implementation of new policies was used to target evidence-based and inferred factors that influence the NTSV cesarean delivery rate. Data on mode of delivery, maternal outcomes, and neonatal outcomes were collected from birth certificates and administrative claims data. The Cochran-Armitage test and linear regression were used to calculate the p-trend for categorical and continuous variables, respectively. Results More than 20,000 NTSV deliveries were analyzed, including more than 15,000 during the intervention period. The NTSV cesarean delivery rate declined from 35% to 21% over eight years. The total cesarean delivery rate declined as well. Increase in meconium aspiration syndrome and maternal transfusion were observed. Conclusion Quality improvement initiatives can decrease the NTSV cesarean delivery rate. Any increased incidence of fetal or maternal complications associated with decreased NTSV cesarean delivery rate should be considered in the context of the risks and benefits of vaginal delivery compared to cesarean delivery. PMID:28334563

The impact of oxytocin administration and maternal love withdrawal on event-related potential (ERP) responses to emotional faces with performance feedback.

PubMed

Huffmeijer, Renske; Alink, Lenneke R A; Tops, Mattie; Grewen, Karen M; Light, Kathleen C; Bakermans-Kranenburg, Marian J; van Ijzendoorn, Marinus H

2013-03-01

This is the first experimental study on the effect of oxytocin administration on the neural processing of facial stimuli conducted with female participants that uses event-related potentials (ERPs). Using a double-blind, placebo-controlled within-subjects design, we studied the effects of 16 IU of intranasal oxytocin on ERPs to pictures combining performance feedback with emotional facial expressions in 48 female undergraduate students. Participants also reported on the amount of love withdrawal they experienced from their mothers. Vertex positive potential (VPP) and late positive potential (LPP) amplitudes were more positive after oxytocin compared to placebo administration. This suggests that oxytocin increased attention to the feedback stimuli (LPP) and enhanced the processing of emotional faces (VPP). Oxytocin heightened processing of the happy and disgusted faces primarily for those reporting less love withdrawal. Significant associations with LPP amplitude suggest that more maternal love withdrawal relates to the allocation of attention toward the motivationally relevant combination of negative feedback with a disgusted face. Copyright © 2012 Elsevier Inc. All rights reserved.

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

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.

Fast determination of structurally cohesive subgroups in large networks

PubMed Central

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

2016-01-01

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

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

NASA Astrophysics Data System (ADS)

Rimadhany, Ruzika; Darmaji

2017-08-01

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

Clipping polygon faces through a polyhedron of vision

NASA Technical Reports Server (NTRS)

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

1980-01-01

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

The '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.

Transfer matrix spectrum for cyclic representations of the 6-vertex reflection algebra by quantum separation of variables

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.

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

SKATE: a docking program that decouples systematic sampling from scoring.

PubMed

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.

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.

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.

Determination of Algorithm Parallelism in NP Complete Problems for Distributed Architectures

DTIC Science & Technology

1990-03-05

12 structure STACK declare OpenStack (S-.NODE **TopPtr) -+TopPtrI FlushStack(S.-NODE **TopPtr) -*TopPtr PushOnStack(S-.NODE **TopPtr, ITEM *NewltemPtr...OfCoveringSets, CoveringSets, L, Best CoverTime, Vertex, Set3end SCND ADT B.26 structure STACKI declare OpenStack (S-NODE **TopPtr) -+TopPtr FlushStack(S

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

NASA Astrophysics Data System (ADS)

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

2018-04-01

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

The Latent Structure of Dictionaries.

PubMed

Vincent-Lamarre, Philippe; Massé, Alexandre Blondin; Lopes, Marcos; Lord, Mélanie; Marcotte, Odile; Harnad, Stevan

2016-07-01

How many words-and which ones-are sufficient to define all other words? When dictionaries are analyzed as directed graphs with links from defining words to defined words, they reveal a latent structure. Recursively removing all words that are reachable by definition but that do not define any further words reduces the dictionary to a Kernel of about 10% of its size. This is still not the smallest number of words that can define all the rest. About 75% of the Kernel turns out to be its Core, a "Strongly Connected Subset" of words with a definitional path to and from any pair of its words and no word's definition depending on a word outside the set. But the Core cannot define all the rest of the dictionary. The 25% of the Kernel surrounding the Core consists of small strongly connected subsets of words: the Satellites. The size of the smallest set of words that can define all the rest-the graph's "minimum feedback vertex set" or MinSet-is about 1% of the dictionary, about 15% of the Kernel, and part-Core/part-Satellite. But every dictionary has a huge number of MinSets. The Core words are learned earlier, more frequent, and less concrete than the Satellites, which are in turn learned earlier, more frequent, but more concrete than the rest of the Dictionary. In principle, only one MinSet's words would need to be grounded through the sensorimotor capacity to recognize and categorize their referents. In a dual-code sensorimotor/symbolic model of the mental lexicon, the symbolic code could do all the rest through recombinatory definition. Copyright © 2016 Cognitive Science Society, Inc.

A learning approach to the bandwidth multicolouring problem

NASA Astrophysics Data System (ADS)

Akbari Torkestani, Javad

2016-05-01

In this article, a generalisation of the vertex colouring problem known as bandwidth multicolouring problem (BMCP), in which a set of colours is assigned to each vertex such that the difference between the colours, assigned to each vertex and its neighbours, is by no means less than a predefined threshold, is considered. It is shown that the proposed method can be applied to solve the bandwidth colouring problem (BCP) as well. BMCP is known to be NP-hard in graph theory, and so a large number of approximation solutions, as well as exact algorithms, have been proposed to solve it. In this article, two learning automata-based approximation algorithms are proposed for estimating a near-optimal solution to the BMCP. We show, for the first proposed algorithm, that by choosing a proper learning rate, the algorithm finds the optimal solution with a probability close enough to unity. Moreover, we compute the worst-case time complexity of the first algorithm for finding a 1/(1-ɛ) optimal solution to the given problem. The main advantage of this method is that a trade-off between the running time of algorithm and the colour set size (colouring optimality) can be made, by a proper choice of the learning rate also. Finally, it is shown that the running time of the proposed algorithm is independent of the graph size, and so it is a scalable algorithm for large graphs. The second proposed algorithm is compared with some well-known colouring algorithms and the results show the efficiency of the proposed algorithm in terms of the colour set size and running time of algorithm.

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

PubMed

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

2016-01-01

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

Silicon pixel-detector R&D for CLIC

NASA Astrophysics Data System (ADS)

Nürnberg, A.

2016-11-01

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

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.

Comparison of cell centered and cell vertex scheme in the calculation of high speed compressible flows

NASA Astrophysics Data System (ADS)

Rahman, Syazila; Yusoff, Mohd. Zamri; Hasini, Hasril

2012-06-01

This paper describes the comparison between the cell centered scheme and cell vertex scheme in the calculation of high speed compressible flow properties. The calculation is carried out using Computational Fluid Dynamic (CFD) in which the mass, momentum and energy equations are solved simultaneously over the flow domain. The geometry under investigation consists of a Binnie and Green convergent-divergent nozzle and structured mesh scheme is implemented throughout the flow domain. The finite volume CFD solver employs second-order accurate central differencing scheme for spatial discretization. In addition, the second-order accurate cell-vertex finite volume spatial discretization is also introduced in this case for comparison. The multi-stage Runge-Kutta time integration is implemented for solving a set of non-linear governing equations with variables stored at the vertices. Artificial dissipations used second and fourth order terms with pressure switch to detect changes in pressure gradient. This is important to control the solution stability and capture shock discontinuity. The result is compared with experimental measurement and good agreement is obtained for both cases.

Generalized non-equilibrium vertex correction method in coherent medium theory for quantum transport simulation of disordered nanoelectronics

NASA Astrophysics Data System (ADS)

Yan, Jiawei; Ke, Youqi

In realistic nanoelectronics, disordered impurities/defects are inevitable and play important roles in electron transport. However, due to the lack of effective quantum transport method, the important effects of disorders remain poorly understood. Here, we report a generalized non-equilibrium vertex correction (NVC) method with coherent potential approximation to treat the disorder effects in quantum transport simulation. With this generalized NVC method, any averaged product of two single-particle Green's functions can be obtained by solving a set of simple linear equations. As a result, the averaged non-equilibrium density matrix and various important transport properties, including averaged current, disordered induced current fluctuation and the averaged shot noise, can all be efficiently computed in a unified scheme. Moreover, a generalized form of conditionally averaged non-equilibrium Green's function is derived to incorporate with density functional theory to enable first-principles simulation. We prove the non-equilibrium coherent potential equals the non-equilibrium vertex correction. Our approach provides a unified, efficient and self-consistent method for simulating non-equilibrium quantum transport through disorder nanoelectronics. Shanghaitech start-up fund.

Spectral Upscaling for Graph Laplacian Problems with Application to Reservoir Simulation

DOE PAGES

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

Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming

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.

Influence of reciprocal edges on degree distribution and degree correlations

NASA Astrophysics Data System (ADS)

Zlatić, Vinko; Štefančić, Hrvoje

2009-07-01

Reciprocal edges represent the lowest-order cycle possible to find in directed graphs without self-loops. Representing also a measure of feedback between vertices, it is interesting to understand how reciprocal edges influence other properties of complex networks. In this paper, we focus on the influence of reciprocal edges on vertex degree distribution and degree correlations. We show that there is a fundamental difference between properties observed on the static network compared to the properties of networks, which are obtained by simple evolution mechanism driven by reciprocity. We also present a way to statistically infer the portion of reciprocal edges, which can be explained as a consequence of feedback process on the static network. In the rest of the paper, the influence of reciprocal edges on a model of growing network is also presented. It is shown that our model of growing network nicely interpolates between Barabási-Albert (BA) model for undirected and the BA model for directed networks.

Super local edge antimagic total coloring of {P}_{n}\\vartriangleright H

NASA Astrophysics Data System (ADS)

Yuli Kurniawati, Elsa; Hesti Agustin, Ika; Dafik; Alfarisi, Ridho

2018-04-01

In this paper, we consider that all graphs are finite, simple and connected. Let G(V, E) be a graph of vertex set V and edge set E. A bijection f:V(G)\\to \\{1,2,3,\\ldots,|V(G)|\\} is called a local edge antimagic labeling if for any two adjacent edges e 1 and e 2, w({e}1)\

Minimum triplet covers of binary phylogenetic X-trees.

PubMed

Huber, K T; Moulton, V; Steel, M

2017-12-01

Trees with labelled leaves and with all other vertices of degree three play an important role in systematic biology and other areas of classification. A classical combinatorial result ensures that such trees can be uniquely reconstructed from the distances between the leaves (when the edges are given any strictly positive lengths). Moreover, a linear number of these pairwise distance values suffices to determine both the tree and its edge lengths. A natural set of pairs of leaves is provided by any 'triplet cover' of the tree (based on the fact that each non-leaf vertex is the median vertex of three leaves). In this paper we describe a number of new results concerning triplet covers of minimum size. In particular, we characterize such covers in terms of an associated graph being a 2-tree. Also, we show that minimum triplet covers are 'shellable' and thereby provide a set of pairs for which the inter-leaf distance values will uniquely determine the underlying tree and its associated branch lengths.

Diagrammatic expansion for positive spectral functions beyond GW: Application to vertex corrections in the electron gas

NASA Astrophysics Data System (ADS)

Stefanucci, G.; Pavlyukh, Y.; Uimonen, A.-M.; van Leeuwen, R.

2014-09-01

We present a diagrammatic approach to construct self-energy approximations within many-body perturbation theory with positive spectral properties. The method cures the problem of negative spectral functions which arises from a straightforward inclusion of vertex diagrams beyond the GW approximation. Our approach consists of a two-step procedure: We first express the approximate many-body self-energy as a product of half-diagrams and then identify the minimal number of half-diagrams to add in order to form a perfect square. The resulting self-energy is an unconventional sum of self-energy diagrams in which the internal lines of half a diagram are time-ordered Green's functions, whereas those of the other half are anti-time-ordered Green's functions, and the lines joining the two halves are either lesser or greater Green's functions. The theory is developed using noninteracting Green's functions and subsequently extended to self-consistent Green's functions. Issues related to the conserving properties of diagrammatic approximations with positive spectral functions are also addressed. As a major application of the formalism we derive the minimal set of additional diagrams to make positive the spectral function of the GW approximation with lowest-order vertex corrections and screened interactions. The method is then applied to vertex corrections in the three-dimensional homogeneous electron gas by using a combination of analytical frequency integrations and numerical Monte Carlo momentum integrations to evaluate the diagrams.

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.

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 performance of diphoton primary vertex reconstruction methods in H → γγ+Met channel of ATLAS experiment

NASA Astrophysics Data System (ADS)

Tomiwa, K. G.

2017-09-01

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

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

NASA Astrophysics Data System (ADS)

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

2013-10-01

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

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

PubMed

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

2016-01-01

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

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.

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.

Fast Solitons on Star Graphs

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.

Reconstructing Unrooted Phylogenetic Trees from Symbolic Ternary Metrics.

PubMed

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.

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

A comment on Baxter condition for commutativity of transfer matrices

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

Gutkin, E.

1986-07-01

Let T..nu.. and T'..nu.. be the transfer matrices of two vertex models corresponding to two sets of Boltzmann weights. The Baxter condition on Boltzmann weights was known to be sufficient for commutativity of T..nu.. and T'..nu.. for all ..nu... We show that generically it is also necessary.

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.

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.

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

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)

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.

Goal-setting, self-efficacy, and memory performance in older and younger adults.

PubMed

West, R L; Thorn, R M

2001-01-01

Research in field and laboratory settings has shown that goals lead to improved self-efficacy and performance, especially when individuals also receive positive feedback. The present study extended goal-setting theory to examine self-set goals and feedback in relation to younger and older adults' memory performance and self-efficacy. Following a baseline recall trial, participants completed three shopping list recall trials. Half of the participants were instructed to set goals for the three experimental trials, and half in each goal condition received performance feedback after each trial. Young adults' self-efficacy, clustering, and recall exceeded that of older adults. Goal setting increased self-efficacy for younger but not older adults, and it did not affect performance. Younger adults and participants in the feedback condition increased their goals across trials, as did participants for whom feedback indicated success. These data provide a first look at the motivational impact of feedback and self-set recall goals in memory aging. Additional study is needed to understand the interactive effects of type of feedback, memory task difficulty, and type of goal setting at different ages.

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

Fusion And Inference From Multiple And Massive Disparate Distributed Dynamic Data Sets

DTIC Science & Technology

2017-07-01

principled methodology for two-sample graph testing; designed a provably almost-surely perfect vertex clustering algorithm for block model graphs; proved...3.7 Semi-Supervised Clustering Methodology ...................................................................... 9 3.8 Robust Hypothesis Testing...dimensional Euclidean space – allows the full arsenal of statistical and machine learning methodology for multivariate Euclidean data to be deployed for

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)\

Combinatorial Problems of Applied Discrete Mathematics.

DTIC Science & Technology

1979-12-01

204 .I (30) 3. Steiner, Combinatorische Aufgabe, Z. Reine Angew. Math. 45 (1853) 18 1—182. (31) IC. Takeuchi, A table of difference sets generating...Assoc. Fr. Ay. Sd . 1 (1900) 122— 123; 2 (1901) 170—203. • (33) R.M. Wilson, Cyclotomy and difference fam ilies in elementary Abelian groups , 3. Number...the differe nt cliques containing either A or B. Let us first introduce the following notations. If A is a vertex in G, then 1(A) denotes the set of

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.

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 Space Analysis for Model-Based Target Recognition.

DTIC Science & Technology

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

Edge smoothing for real-time simulation of a polygon face object system as viewed by a moving observer

NASA Technical Reports Server (NTRS)

Lotz, Robert W. (Inventor); Westerman, David J. (Inventor)

1980-01-01

The visual system within an aircraft flight simulation system receives flight data and terrain data which is formated into a buffer memory. The image data is forwarded to an image processor which translates the image data into face vertex vectors Vf, defining the position relationship between the vertices of each terrain object and the aircraft. The image processor then rotates, clips, and projects the image data into two-dimensional display vectors (Vd). A display generator receives the Vd faces, and other image data to provide analog inputs to CRT devices which provide the window displays for the simulated aircraft. The video signal to the CRT devices passes through an edge smoothing device which prolongs the rise time (and fall time) of the video data inversely as the slope of the edge being smoothed. An operational amplifier within the edge smoothing device has a plurality of independently selectable feedback capacitors each having a different value. The values of the capacitors form a series which doubles as a power of two. Each feedback capacitor has a fast switch responsive to the corresponding bit of a digital binary control word for selecting (1) or not selecting (0) that capacitor. The control word is determined by the slope of each edge. The resulting actual feedback capacitance for each edge is the sum of all the selected capacitors and is directly proportional to the value of the binary control word. The output rise time (or fall time) is a function of the feedback capacitance, and is controlled by the slope through the binary control word.

Improving Written Communication Through Minimal Feedback

PubMed Central

Traxler, Matthew J.; Gernsbacher, Morton Ann

2014-01-01

We propose that writers must form accurate representations of how their readers will interpret their texts to convey their ideas successfully. In two experiments, we investigated whether getting feedback from their readers helps writers form better representations of how their texts are interpreted. In our first experiment, one group of subjects (writers) wrote descriptions of a set of geometric figures; another group of subjects (readers) read those descriptions and used them to select the figures from sets of similar looking distractor figures. Half the writers received feedback on how well their readers selected the figures, and half the writers did not receive this feedback. Those writers who received feedback improved their descriptions more than those writers who did not receive feedback. In our second experiment, half the writers received two treatments of feedback on their descriptions of one set of figures, whereas the other half of the writers did not receive feedback. Then, all the writers described a new set of figures. Those writers who had previously received feedback wrote better new descriptions than did those writers who had never received feedback. We concluded that feedback – even this minimal form of feedback – helps writers to envision how readers interpret their texts. PMID:25520535

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

PubMed

Moreira de Oliveira, Montauban; Eon, Jean Guillaume

2014-05-01

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

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.

Leadership in Libraries--Feedback as Communication.

ERIC Educational Resources Information Center

Wright, Dianne H.

This paper focuses on the role of feedback in effective communication and ways in which feedback can assist library managers at all levels in performing their role as leaders. The various kinds and sources of feedback are discussed, and the relationship between feedback and goal setting are considered, as well as the effects of goal setting and…

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

NASA Astrophysics Data System (ADS)

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

2017-09-01

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

Vertex functions at finite momentum: Application to antiferromagnetic quantum criticality

NASA Astrophysics Data System (ADS)

Wölfle, Peter; Abrahams, Elihu

2016-02-01

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

Total edge irregularity strength of (n,t)-kite graph

NASA Astrophysics Data System (ADS)

Winarsih, Tri; Indriati, Diari

2018-04-01

Let G(V, E) be a simple, connected, and undirected graph with vertex set V and edge set E. A total k-labeling is a map that carries vertices and edges of a graph G into a set of positive integer labels {1, 2, …, k}. An edge irregular total k-labeling λ :V(G)\\cup E(G)\\to \\{1,2,\\ldots,k\\} of a graph G is a labeling of vertices and edges of G in such a way that for any different edges e and f, weights wt(e) and wt(f) are distinct. The weight wt(e) of an edge e = xy is the sum of the labels of vertices x and y and the label of the edge e. The total edge irregularity strength of G, tes(G), is defined as the minimum k for which a graph G has an edge irregular total k-labeling. An (n, t)-kite graph consist of a cycle of length n with a t-edge path (the tail) attached to one vertex of a cycle. In this paper, we investigate the total edge irregularity strength of the (n, t)-kite graph, with n > 3 and t > 1. We obtain the total edge irregularity strength of the (n, t)-kite graph is tes((n, t)-kite) = \\lceil \\frac{n+t+2}{3}\\rceil .

Three nested randomized controlled trials of peer-only or multiple stakeholder group feedback within Delphi surveys during core outcome and information set development.

PubMed

Brookes, Sara T; Macefield, Rhiannon C; Williamson, Paula R; McNair, Angus G; Potter, Shelley; Blencowe, Natalie S; Strong, Sean; Blazeby, Jane M

2016-08-17

Methods for developing a core outcome or information set require involvement of key stakeholders to prioritise many items and achieve agreement as to the core set. The Delphi technique requires participants to rate the importance of items in sequential questionnaires (or rounds) with feedback provided in each subsequent round such that participants are able to consider the views of others. This study examines the impact of receiving feedback from different stakeholder groups, on the subsequent rating of items and the level of agreement between stakeholders. Randomized controlled trials were nested within the development of three core sets each including a Delphi process with two rounds of questionnaires, completed by patients and health professionals. Participants rated items from 1 (not essential) to 9 (absolutely essential). For round 2, participants were randomized to receive feedback from their peer stakeholder group only (peer) or both stakeholder groups separately (multiple). Decisions as to which items to retain following each round were determined by pre-specified criteria. Whilst type of feedback did not impact on the percentage of items for which a participant subsequently changed their rating, or the magnitude of change, it did impact on items retained at the end of round 2. Each core set contained discordant items retained by one feedback group but not the other (3-22 % discordant items). Consensus between patients and professionals in items to retain was greater amongst those receiving multiple group feedback in each core set (65-82 % agreement for peer-only feedback versus 74-94 % for multiple feedback). In addition, differences in round 2 scores were smaller between stakeholder groups receiving multiple feedback than between those receiving peer group feedback only. Variability in item scores across stakeholders was reduced following any feedback but this reduction was consistently greater amongst the multiple feedback group. In the development of a core outcome or information set, providing feedback within Delphi questionnaires from all stakeholder groups separately may influence the final core set and improve consensus between the groups. Further work is needed to better understand how participants rate and re-rate items within a Delphi process. The three randomized controlled trials reported here were each nested within the development of a core information or outcome set to investigate processes in core outcome and information set development. Outcomes were not health-related and therefore trial registration was not applicable.

Using goal setting and feedback to increase weekly running distance.

PubMed

Wack, Stephanie R; Crosland, Kimberly A; Miltenberger, Raymond G

2014-01-01

We evaluated goal setting with performance feedback to increase running distance among 5 healthy adults. Participants set a short-term goal each week and a long-term goal to achieve on completion of the study. Results demonstrated that goal setting and performance feedback increased running distance for all participants. © Society for the Experimental Analysis of Behavior.

Eigenvalues of the Laplacian of a graph

NASA Technical Reports Server (NTRS)

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

1971-01-01

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

RAVE—a Detector-independent vertex reconstruction toolkit

NASA Astrophysics Data System (ADS)

Waltenberger, Wolfgang; Mitaroff, Winfried; Moser, Fabian

2007-10-01

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

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

PubMed

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

2015-01-01

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

Misattribution of movement agency following right parietal TMS.

PubMed

Preston, Catherine; Newport, Roger

2008-03-01

Single pulse transcranial magnetic stimulation (TMS) was used to disrupt the right inferior parietal lobe (rIPL) whilst neurologically intact participants made self/other judgments about whole arm reaching movements. Visual feedback of a physically coincident virtual hand was perturbed or left unperturbed (randomly) while TMS was delivered to either the rIPL or the vertex (blocked). Visual feedback of the virtual hand was veridical until the hand became occluded by a virtual bar approximately half way through the movement. TMS was delivered on 50% of trials at random during occlusion of the hand. The position of the virtual hand relative to the real hand was also perturbed during occlusion of the virtual hand on 50% of trials at random. At the end of the reach participants were required to make a verbal judgment as to whether the movement they had seen was self (unperturbed) or other (perturbed). The results revealed that when TMS was applied over rIPL, participants were more likely to misattribute agency to the computer, making more other responses for both perturbed and unperturbed trials. These findings highlight the role of a parietal neural comparator as a low-level mechanism in the experience of agency.

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

NASA Astrophysics Data System (ADS)

Burns-Childers, Annie; Vidakovic, Draga

2018-07-01

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

Improving Closing Task Completion in a Drugstore

ERIC Educational Resources Information Center

Fante, Rhiannon; Davis, Ora L.; Kempt, Vivian

2013-01-01

A within-subject ABAB reversal design was utilized to investigate the effects of graphic feedback and goal setting on employee closing task completion. Goal setting was contingent upon baseline performance and graphic feedback was posted weekly. It was found that goal setting and graphic feedback improved employee closing task completion.…

Fetal presentation and successful twin vaginal delivery.

PubMed

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

2016-01-01

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

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

PubMed

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

2013-11-01

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

The Effects of Graphic Feedback, Goal-Setting, and Manager Praise on Customer Service Behaviors

ERIC Educational Resources Information Center

Loewy, Shannon; Bailey, Jon

2007-01-01

The current study used a multiple baseline design to investigate the effects of graphic feedback, goal setting, and manager praise on customer service behaviors in a large retail setting. Direct observation of customer greeting, eye contact, and smiling was used to collect data. After baseline data were collected feedback graphs were posted twice…

Acute effects of verbal feedback on upper-body performance in elite athletes.

PubMed

Argus, Christos K; Gill, Nicholas D; Keogh, Justin Wl; Hopkins, Will G

2011-12-01

Argus, CK, Gill, ND, Keogh, JWL, and Hopkins, WG. Acute effects of verbal feedback on upper-body performance in elite athletes. J Strength Cond Res 25(12): 3282-3287, 2011-Improved training quality has the potential to enhance training adaptations. Previous research suggests that receiving feedback improves single-effort maximal strength and power tasks, but whether quality of a training session with repeated efforts can be improved remains unclear. The purpose of this investigation was to determine the effects of verbal feedback on upper-body performance in a resistance training session consisting of multiple sets and repetitions in well-trained athletes. Nine elite rugby union athletes were assessed using the bench throw exercise on 4 separate occasions each separated by 7 days. Each athlete completed 2 sessions consisting of 3 sets of 4 repetitions of the bench throw with feedback provided after each repetition and 2 identical sessions where no feedback was provided after each repetition. When feedback was received, there was a small increase of 1.8% (90% confidence limits, ±2.7%) and 1.3% (±0.7%) in mean peak power and velocity when averaged over the 3 sets. When individual sets were compared, there was a tendency toward the improvements in mean peak power being greater in the second and third sets. These results indicate that providing verbal feedback produced acute improvements in upper-body power output of well-trained athletes. The benefits of feedback may be greatest in the latter sets of training and could improve training quality and result in greater long-term adaptation.

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

NASA Astrophysics Data System (ADS)

Merzlaya, Anastasia; NA61/SHINE Collaboration

2017-01-01

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

Coevolution of Vertex Weights Resolves Social Dilemma in Spatial Networks.

PubMed

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

2017-11-09

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

Causal Networks with Selectively Influenced Components

DTIC Science & Technology

2012-02-29

influences a different vertex. If so, the form of a processing tree accounting for the data can determined. Prior to the work on the grant, processing...their order. Processing trees were found to account well for data in the literature on immediate ordered recall and on effects of sleep and...ordered in the network) or concurrent (unordered). Ordinarily for a given data set, if one directed acyclic network can account for the data

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.

Inhibition of Pre-Supplementary Motor Area by Continuous Theta Burst Stimulation Leads to More Cautious Decision-making and More Efficient Sensory Evidence Integration.

PubMed

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.

Geometric interpretation of vertex operator algebras.

PubMed Central

Huang, Y Z

1991-01-01

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

NPSNET: Dynamic Terrain and Cultured Feature Depiction

DTIC Science & Technology

1992-09-01

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

Intrinsic non-commutativity of closed string theory

DOE PAGES

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

2017-09-14

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

Intrinsic non-commutativity of closed string theory

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

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

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

Manager's Guide to the Implementation of Feedback, Goal Setting, and Incentive Systems. Final Report for Period September 1983--January 1987.

ERIC Educational Resources Information Center

Pritchard, Robert D.; And Others

This manual is intended to assist operational managers in using feedback, goal-setting, and incentive systems. The first section presents background information on feedback, goal-setting, and incentive systems and on measuring productivity. It includes formal definitions of each system, examines the logic of why each system works, compares the…

Impact of implementation choices on quantitative predictions of cell-based computational models

NASA Astrophysics Data System (ADS)

Kursawe, Jochen; Baker, Ruth E.; Fletcher, Alexander G.

2017-09-01

'Cell-based' models provide a powerful computational tool for studying the mechanisms underlying the growth and dynamics of biological tissues in health and disease. An increasing amount of quantitative data with cellular resolution has paved the way for the quantitative parameterisation and validation of such models. However, the numerical implementation of cell-based models remains challenging, and little work has been done to understand to what extent implementation choices may influence model predictions. Here, we consider the numerical implementation of a popular class of cell-based models called vertex models, which are often used to study epithelial tissues. In two-dimensional vertex models, a tissue is approximated as a tessellation of polygons and the vertices of these polygons move due to mechanical forces originating from the cells. Such models have been used extensively to study the mechanical regulation of tissue topology in the literature. Here, we analyse how the model predictions may be affected by numerical parameters, such as the size of the time step, and non-physical model parameters, such as length thresholds for cell rearrangement. We find that vertex positions and summary statistics are sensitive to several of these implementation parameters. For example, the predicted tissue size decreases with decreasing cell cycle durations, and cell rearrangement may be suppressed by large time steps. These findings are counter-intuitive and illustrate that model predictions need to be thoroughly analysed and implementation details carefully considered when applying cell-based computational models in a quantitative setting.

Magnetoencephalographic Mapping of Epileptic Spike Population Using Distributed Source Analysis: Comparison With Intracranial Electroencephalographic Spikes.

PubMed

Tanaka, Naoaki; Papadelis, Christos; Tamilia, Eleonora; Madsen, Joseph R; Pearl, Phillip L; Stufflebeam, Steven M

2018-04-27

This study evaluates magnetoencephalographic (MEG) spike population as compared with intracranial electroencephalographic (IEEG) spikes using a quantitative method based on distributed source analysis. We retrospectively studied eight patients with medically intractable epilepsy who had an MEG and subsequent IEEG monitoring. Fifty MEG spikes were analyzed in each patient using minimum norm estimate. For individual spikes, each vertex in the source space was considered activated when its source amplitude at the peak latency was higher than a threshold, which was set at 50% of the maximum amplitude over all vertices. We mapped the total count of activation at each vertex. We also analyzed 50 IEEG spikes in the same manner over the intracranial electrodes and created the activation count map. The location of the electrodes was obtained in the MEG source space by coregistering postimplantation computed tomography to MRI. We estimated the MEG- and IEEG-active regions associated with the spike populations using the vertices/electrodes with a count over 25. The activation count maps of MEG spikes demonstrated the localization associated with the spike population by variable count values at each vertex. The MEG-active region overlapped with 65 to 85% of the IEEG-active region in our patient group. Mapping the MEG spike population is valid for demonstrating the trend of spikes clustering in patients with epilepsy. In addition, comparison of MEG and IEEG spikes quantitatively may be informative for understanding their relationship.

What's Stopping Them? A Study of Teachers' Use of Formative Feedback with Students Learning in the Clinical Setting

ERIC Educational Resources Information Center

Campos, Susan

2013-01-01

Acknowledging the powerful that role formative feedback plays in learning, students who are training for professions in the clinical setting and learn while working alongside professionals in their field report that they receive limited feedback. Formative feedback helps students gauge progress, identify weaknesses, and improve performance as well…

Princeton VLSI Project.

DTIC Science & Technology

1982-01-01

a rectilinear graph. iefnition 2.1: A rectiliwr graph G is a triple (V. E. X). where V is the vertex set, E is the edge set, and X:Vx V-E U le , where...G,(V, ,) as follows: . =e(z) I =z(a),a E Viand E., = (z, ) I Z1 >Z2E:I, V and E-V are similarly defined. It can be easily shown that C is consistent...width of the layout after the introduction the le .’gths of the drivers introduced on wn to u _-, If we of drivers, which is given by so,+m. is 0(m2

J/ψ Suppression in In-In Collisions at 158 GeV/n

NASA Astrophysics Data System (ADS)

Arnaldi, Roberta; NA60 Collaboration

2007-02-01

The NA60 experiment has studied J/ψ production in Indium-Indium collisions at 158 AṡGeV. In this paper we present an updated set of results obtained with the complete set of available statistics and an improved alignment of the vertex tracker. The centrality dependence of the J/ψ production, obtained with an analysis technique based only on the J/ψ sample, indicates that a suppression beyond that induced by nuclear absorption is present in In-In collisions, setting in at ˜80 participant nucleons. A first study of the systematic errors related with this measurement is discussed. We also present preliminary results on the J/ψ azimuthal distributions.

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

PubMed Central

Gao, Wei

2015-01-01

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

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.

The Effects of Evaluating Video Examples of Staffs' Own versus Others' Performance on Discrete-Trial Training Skills in a Human Service Setting

ERIC Educational Resources Information Center

Williams, W. Larry; Gallinat, Julianne

2011-01-01

Many studies have been conducted evaluating the use of feedback in staff training in organizational settings. Central to this literature has been the use of a variety of forms of feedback, including videotaped feedback. A distinction is outlined between video modeling and a variety of possible video feedback procedures. Previous studies have…

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

NASA Astrophysics Data System (ADS)

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

2014-04-01

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

Hubble Space Telescope secondary mirror vertex radius/conic constant test

NASA Technical Reports Server (NTRS)

Parks, Robert

1991-01-01

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

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

PubMed

Popov, Yuri O; Witten, Thomas A

2003-09-01

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

miniTri Mantevo miniapp v. 1.0

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

Berry, Johathan; Stark, Dylan; Wolf, Michael

2016-02-02

miniTri is a miniapplication developed as part of the Mantevo project. Given a graph, miniTri enumerates all triangles in this graph and computes a metric for each triangle based on the triangle edge and vertex degree. The output of miniTri is a summary of this metric. miniTri mimics the computational requirements of an important set of data science applications. Several approaches to this problem are included in the miniTri software.

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

DOE PAGES

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

2016-06-30

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

Vertex Models of Epithelial Morphogenesis

PubMed Central

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

2014-01-01

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

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.

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)

Photonic crystal surface-emitting lasers

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

Chua, Song Liang; Lu, Ling; Soljacic, Marin

2015-06-23

A photonic-crystal surface-emitting laser (PCSEL) includes a gain medium electromagnetically coupled to a photonic crystal whose energy band structure exhibits a Dirac cone of linear dispersion at the center of the photonic crystal's Brillouin zone. This Dirac cone's vertex is called a Dirac point; because it is at the Brillouin zone center, it is called an accidental Dirac point. Tuning the photonic crystal's band structure (e.g., by changing the photonic crystal's dimensions or refractive index) to exhibit an accidental Dirac point increases the photonic crystal's mode spacing by orders of magnitudes and reduces or eliminates the photonic crystal's distributed in-planemore » feedback. Thus, the photonic crystal can act as a resonator that supports single-mode output from the PCSEL over a larger area than is possible with conventional PCSELs, which have quadratic band edge dispersion. Because output power generally scales with output area, this increase in output area results in higher possible output powers.« less

Optimal Control Allocation with Load Sensor Feedback for Active Load Suppression

NASA Technical Reports Server (NTRS)

Miller, Christopher

2017-01-01

These slide sets describe the OCLA formulation and associated algorithms as a set of new technologies in the first practical application of load limiting flight control utilizing load feedback as a primary control measurement. Slide set one describes Experiment Development and slide set two describes Flight-Test Performance.

Predicting Reading and Mathematics from Neural Activity for Feedback Learning

ERIC Educational Resources Information Center

Peters, Sabine; Van der Meulen, Mara; Zanolie, Kiki; Crone, Eveline A.

2017-01-01

Although many studies use feedback learning paradigms to study the process of learning in laboratory settings, little is known about their relevance for real-world learning settings such as school. In a large developmental sample (N = 228, 8-25 years), we investigated whether performance and neural activity during a feedback learning task…

Mathematics Practice without Feedback: A Desirable Difficulty in a Classroom Setting

ERIC Educational Resources Information Center

Fyfe, Emily R.; Rittle-Johnson, Bethany

2017-01-01

Recent research highlights the potential benefits of practice without feedback on learner's strategy knowledge. However, most prior work has been conducted in one-on-one settings with short retention intervals. We compared the effects of mathematics practice with and without correct-answer feedback on immediate and 1-week delayed performance in a…

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

NASA Astrophysics Data System (ADS)

Hagendorf, Christian; Liénardy, Jean

2018-03-01

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

Towards ab initio Calculations with the Dynamical Vertex Approximation

NASA Astrophysics Data System (ADS)

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

2018-04-01

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

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

NASA Technical Reports Server (NTRS)

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

1974-01-01

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

High Performance Automatic Character Skinning Based on Projection Distance

NASA Astrophysics Data System (ADS)

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

2018-03-01

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

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

NASA Astrophysics Data System (ADS)

McGaughey, Georgia; Patrick Walters, W.

2017-03-01

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

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

PubMed

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

1989-10-01

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

Statistical metrics for the characterization of karst network geometry and topology

NASA Astrophysics Data System (ADS)

Collon, Pauline; Bernasconi, David; Vuilleumier, Cécile; Renard, Philippe

2017-04-01

Statistical metrics can be used to analyse the morphology of natural or simulated karst systems; they allow describing, comparing, and quantifying their geometry and topology. In this paper, we present and discuss a set of such metrics. We study their properties and their usefulness based on a set of more than 30 karstic networks mapped by speleologists. The data set includes some of the largest explored cave systems in the world and represents a broad range of geological and speleogenetic conditions allowing us to test the proposed metrics, their variability, and their usefulness for the discrimination of different morphologies. All the proposed metrics require that the topographical survey of the caves are first converted to graphs consisting of vertices and edges. This data preprocessing includes several quality check operations and some corrections to ensure that the karst is represented as accurately as possible. The statistical parameters relating to the geometry of the system are then directly computed on the graphs, while the topological parameters are computed on a reduced version of the network focusing only on its structure. Among the tested metrics, we include some that were previously proposed such as tortuosity or the Howard's coefficients. We also investigate the possibility to use new metrics derived from graph theory. In total, 21 metrics are introduced, discussed in detail, and compared on the basis of our data set. This work shows that orientation analysis and, in particular, the entropy of the orientation data can help to detect the existence of inception features. The statistics on branch length are useful to describe the extension of the conduits within the network. Rather surprisingly, the tortuosity does not vary very significantly. It could be heavily influenced by the survey methodology. The degree of interconnectivity of the network, related to the presence of maze patterns, can be measured using different metrics such as the Howard's parameters, global cyclic coefficient, or the average vertex degree. The average vertex degree of the reduced graph proved to be the most useful as it is simple to compute, it discriminates properly the interconnected systems (mazes) from the acyclic ones (tree-like structures), and it permits us to classify the acyclic systems as a function of the total number of branches. This topological information is completed by three parameters, allowing us to refine the description. The correlation of vertex degree is rather simple to obtain. It is systematically positive on all studied data sets indicating a predominance of assortative networks among karst systems. The average shortest path length is related to the transport efficiency. It is shown to be mainly correlated to the size of the network. Finally, central point dominance allows us to identify the presence of a centralized organization.

Unregulated provider perceptions of audit and feedback reports in long-term care: cross-sectional survey findings from a quality improvement intervention.

PubMed

Fraser, Kimberly D; O'Rourke, Hannah M; Baylon, Melba Andrea B; Boström, Anne-Marie; Sales, Anne E

2013-02-13

Audit with feedback is a moderately effective approach for improving professional practice in other health care settings. Although unregulated caregivers give the majority of direct care in long-term care settings, little is known about how they understand and perceive feedback reports because unregulated providers have not been directly targeted to receive audit with feedback in quality improvement interventions in long-term care. The purpose of this paper is to describe unregulated care providers' perceptions of usefulness of a feedback report in four Canadian long-term care facilities. We delivered monthly feedback reports to unregulated care providers for 13 months in 2009-2010. The feedback reports described a unit's performance in relation to falls, depression, and pain as compared to eight other units in the study. Follow-up surveys captured participant perceptions of the feedback report. We conducted descriptive analyses of the variables related to participant perceptions and multivariable logistic regression to assess the association between perceived usefulness of the feedback report and a set of independent variables. The vast majority (80%) of unregulated care providers (n = 171) who responded said they understood the reports. Those who discussed the report with others and were interested in other forms of data were more likely to find the feedback report useful for making changes in resident care. This work suggests that unregulated care providers can understand and feel positively about using audit with feedback reports to make changes to resident care. Further research should explore ways to promote fuller engagement of unregulated care providers in decision-making to improve quality of care in long-term care settings.

Unregulated provider perceptions of audit and feedback reports in long-term care: cross-sectional survey findings from a quality improvement intervention

PubMed Central

2013-01-01

Background Audit with feedback is a moderately effective approach for improving professional practice in other health care settings. Although unregulated caregivers give the majority of direct care in long-term care settings, little is known about how they understand and perceive feedback reports because unregulated providers have not been directly targeted to receive audit with feedback in quality improvement interventions in long-term care. The purpose of this paper is to describe unregulated care providers’ perceptions of usefulness of a feedback report in four Canadian long-term care facilities. Methods We delivered monthly feedback reports to unregulated care providers for 13 months in 2009–2010. The feedback reports described a unit’s performance in relation to falls, depression, and pain as compared to eight other units in the study. Follow-up surveys captured participant perceptions of the feedback report. We conducted descriptive analyses of the variables related to participant perceptions and multivariable logistic regression to assess the association between perceived usefulness of the feedback report and a set of independent variables. Results The vast majority (80%) of unregulated care providers (n = 171) who responded said they understood the reports. Those who discussed the report with others and were interested in other forms of data were more likely to find the feedback report useful for making changes in resident care. Conclusions This work suggests that unregulated care providers can understand and feel positively about using audit with feedback reports to make changes to resident care. Further research should explore ways to promote fuller engagement of unregulated care providers in decision-making to improve quality of care in long-term care settings. PMID:23402382

Quantitative description and modeling of real networks

NASA Astrophysics Data System (ADS)

Capocci, Andrea; Caldarelli, Guido; de Los Rios, Paolo

2003-10-01

We present data analysis and modeling of two particular cases of study in the field of growing networks. We analyze World Wide Web data set and authorship collaboration networks in order to check the presence of correlation in the data. The results are reproduced with good agreement through a suitable modification of the standard Albert-Barabási model of network growth. In particular, intrinsic relevance of sites plays a role in determining the future degree of the vertex.

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

Primitive graphs with small exponent and small scrambling index

NASA Astrophysics Data System (ADS)

Surbakti, Ita Y.; Suwilo, Saib; Butar-butar, Ericha A.; Oktaviani, Helda

2018-01-01

A connected graph G is primitive provide there is a positive integer k such that for each pair of vertices u and v there is a uv-walk of length k. The smallest of such positive integer k is the exponent of G and is denoted by exp(G). The scrambling index of a primitive graph G, denoted by k(G), is the smallest positive integer k such that for each pair of vertices u and v there is a vertex w such that there is a uw-walk and a vw-walk of length k. By an n-chainring CR(n) we mean a graph obtained from an n-cycle by replacing each edge of the n-cycle by a triangle. By a (q,p)-dory, D(q,p), we mean a graph with vertex set V(D(q,p)) = V(P q × P p ) ∪ {w 1, w 2} and edge set E(D(q,p)) = E(P q × Pp ) ∪ {w 1 - (u i ,v 1) : i = 1, 2,…, q}∪{w 2 -(u i ,vp ) : i = 1, 2,…, q}, where Pn is a path on n vertices. We discus the exponent and scrambling index of an n- chainring and (q, p)-dory. We present formulae for exponent and scrambling index in terms of their diameter.

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

PubMed

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

2014-12-01

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

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

NASA Astrophysics Data System (ADS)

Spencer, Meryl; Jabeen, Zahera; Lubensky, David

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

A neural network z-vertex trigger for Belle II

NASA Astrophysics Data System (ADS)

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

2015-05-01

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

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

NASA Astrophysics Data System (ADS)

Bertacchi, Daniela; Zucca, Fabio

2013-11-01

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

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.

Comparative Efficacy of Group and Individual Feedback in Gross Anatomy for Promoting Medical Student Professionalism

ERIC Educational Resources Information Center

Camp, Christopher L.; Gregory, Jeremy K.; Lachman, Nirusha; Chen, Laura P.; Juskewitch, Justin E.; Pawlina, Wojciech

2010-01-01

Professionalism is a core competency of medical training that requires students to develop the skills of providing and receiving feedback. Our study evaluated the effectiveness of delivering feedback in a group setting compared with an individual setting. The first-year class of Mayo medical students (n = 49) enrolled in gross anatomy (in…

Using Performance Feedback and Goal Setting to Improve Elementary Students' Writing Fluency: A Randomized Controlled Trial

ERIC Educational Resources Information Center

Koenig, Elizabeth A.; Eckert, Tanya L.; Hier, Bridget O.

2016-01-01

Although performance feedback interventions successfully lead to improvements in students' performance, research suggests that the combination of feedback and goal setting leads to greater performance than either component alone and that graphing performance in relation to a goal can lead to improvements in academic performance. The goal of the…

Simplified models for displaced dark matter signatures

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

Buchmueller, Oliver; De Roeck, Albert; Hahn, Kristian

We propose a systematic programme to search for long-lived neutral particle signatures through a minimal set of displaced =E T searches (dMETs). Here, our approach is to extend the well-established dark matter simpli ed models to include displaced vertices. The dark matter simplified models are used to describe the primary production vertex. A displaced secondary vertex, characterised by the mass of the long-lived particle and its lifetime, is added for the displaced signature. We show how these models can be motivated by, and mapped onto, complete models such as gauge-mediated SUSY breaking and models of neutral naturalness. We also outlinemore » how this approach may be used to extend other simplified models to incorporate displaced signatures and to characterise searches for longlived charged particles. Displaced vertices are a striking signature which is often virtually background free, and thus provide an excellent target for the high-luminosity run of the Large Hadron Collider. The proposed models and searches provide a first step towards a systematic broadening of the displaced dark matter search programme.« less

Finding the Optimal Nets for Self-Folding Kirigami

NASA Astrophysics Data System (ADS)

Araújo, N. A. M.; da Costa, R. A.; Dorogovtsev, S. N.; Mendes, J. F. F.

2018-05-01

Three-dimensional shells can be synthesized from the spontaneous self-folding of two-dimensional templates of interconnected panels, called nets. However, some nets are more likely to self-fold into the desired shell under random movements. The optimal nets are the ones that maximize the number of vertex connections, i.e., vertices that have only two of its faces cut away from each other in the net. Previous methods for finding such nets are based on random search, and thus, they do not guarantee the optimal solution. Here, we propose a deterministic procedure. We map the connectivity of the shell into a shell graph, where the nodes and links of the graph represent the vertices and edges of the shell, respectively. Identifying the nets that maximize the number of vertex connections corresponds to finding the set of maximum leaf spanning trees of the shell graph. This method allows us not only to design the self-assembly of much larger shell structures but also to apply additional design criteria, as a complete catalog of the maximum leaf spanning trees is obtained.

Statistical mechanical analysis of linear programming relaxation for combinatorial optimization problems

NASA Astrophysics Data System (ADS)

Takabe, Satoshi; Hukushima, Koji

2016-05-01

Typical behavior of the linear programming (LP) problem is studied as a relaxation of the minimum vertex cover (min-VC), a type of integer programming (IP) problem. A lattice-gas model on the Erdös-Rényi random graphs of α -uniform hyperedges is proposed to express both the LP and IP problems of the min-VC in the common statistical mechanical model with a one-parameter family. Statistical mechanical analyses reveal for α =2 that the LP optimal solution is typically equal to that given by the IP below the critical average degree c =e in the thermodynamic limit. The critical threshold for good accuracy of the relaxation extends the mathematical result c =1 and coincides with the replica symmetry-breaking threshold of the IP. The LP relaxation for the minimum hitting sets with α ≥3 , minimum vertex covers on α -uniform random graphs, is also studied. Analytic and numerical results strongly suggest that the LP relaxation fails to estimate optimal values above the critical average degree c =e /(α -1 ) where the replica symmetry is broken.

Simplified models for displaced dark matter signatures

DOE PAGES

Buchmueller, Oliver; De Roeck, Albert; Hahn, Kristian; ...

2017-09-18

We propose a systematic programme to search for long-lived neutral particle signatures through a minimal set of displaced =E T searches (dMETs). Here, our approach is to extend the well-established dark matter simpli ed models to include displaced vertices. The dark matter simplified models are used to describe the primary production vertex. A displaced secondary vertex, characterised by the mass of the long-lived particle and its lifetime, is added for the displaced signature. We show how these models can be motivated by, and mapped onto, complete models such as gauge-mediated SUSY breaking and models of neutral naturalness. We also outlinemore » how this approach may be used to extend other simplified models to incorporate displaced signatures and to characterise searches for longlived charged particles. Displaced vertices are a striking signature which is often virtually background free, and thus provide an excellent target for the high-luminosity run of the Large Hadron Collider. The proposed models and searches provide a first step towards a systematic broadening of the displaced dark matter search programme.« less

Statistical mechanical analysis of linear programming relaxation for combinatorial optimization problems.

PubMed

Takabe, Satoshi; Hukushima, Koji

2016-05-01

Typical behavior of the linear programming (LP) problem is studied as a relaxation of the minimum vertex cover (min-VC), a type of integer programming (IP) problem. A lattice-gas model on the Erdös-Rényi random graphs of α-uniform hyperedges is proposed to express both the LP and IP problems of the min-VC in the common statistical mechanical model with a one-parameter family. Statistical mechanical analyses reveal for α=2 that the LP optimal solution is typically equal to that given by the IP below the critical average degree c=e in the thermodynamic limit. The critical threshold for good accuracy of the relaxation extends the mathematical result c=1 and coincides with the replica symmetry-breaking threshold of the IP. The LP relaxation for the minimum hitting sets with α≥3, minimum vertex covers on α-uniform random graphs, is also studied. Analytic and numerical results strongly suggest that the LP relaxation fails to estimate optimal values above the critical average degree c=e/(α-1) where the replica symmetry is broken.

Alternative Parameterizations for Cluster Editing

NASA Astrophysics Data System (ADS)

Komusiewicz, Christian; Uhlmann, Johannes

Given an undirected graph G and a nonnegative integer k, the NP-hard Cluster Editing problem asks whether G can be transformed into a disjoint union of cliques by applying at most k edge modifications. In the field of parameterized algorithmics, Cluster Editing has almost exclusively been studied parameterized by the solution size k. Contrastingly, in many real-world instances it can be observed that the parameter k is not really small. This observation motivates our investigation of parameterizations of Cluster Editing different from the solution size k. Our results are as follows. Cluster Editing is fixed-parameter tractable with respect to the parameter "size of a minimum cluster vertex deletion set of G", a typically much smaller parameter than k. Cluster Editing remains NP-hard on graphs with maximum degree six. A restricted but practically relevant version of Cluster Editing is fixed-parameter tractable with respect to the combined parameter "number of clusters in the target graph" and "maximum number of modified edges incident to any vertex in G". Many of our results also transfer to the NP-hard Cluster Deletion problem, where only edge deletions are allowed.

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

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

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

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

Stress singularities at the vertex of a cylindrically anisotropic wedge

NASA Technical Reports Server (NTRS)

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

1980-01-01

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

Spin wave Feynman diagram vertex computation package

NASA Astrophysics Data System (ADS)

Price, Alexander; Javernick, Philip; Datta, Trinanjan

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

Quantum vertex model for reversible classical computing.

PubMed

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

2017-05-12

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

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

DOE PAGES

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

2015-03-13

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

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

PubMed

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

2016-10-01

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

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

NASA Astrophysics Data System (ADS)

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

2016-10-01

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

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

NASA Astrophysics Data System (ADS)

Neuhaus, Sara; Skambraks, Sebastian; Kiesling, Christian

2017-08-01

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

Quantum vertex model for reversible classical computing

NASA Astrophysics Data System (ADS)

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

2017-05-01

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

Multisource Feedback in the Ambulatory Setting

PubMed Central

Warm, Eric J.; Schauer, Daniel; Revis, Brian; Boex, James R.

2010-01-01

Background The Accreditation Council for Graduate Medical Education has mandated multisource feedback (MSF) in the ambulatory setting for internal medicine residents. Few published reports demonstrate actual MSF results for a residency class, and fewer still include clinical quality measures and knowledge-based testing performance in the data set. Methods Residents participating in a year-long group practice experience called the “long-block” received MSF that included self, peer, staff, attending physician, and patient evaluations, as well as concomitant clinical quality data and knowledge-based testing scores. Residents were given a rank for each data point compared with peers in the class, and these data were reviewed with the chief resident and program director over the course of the long-block. Results Multisource feedback identified residents who performed well on most measures compared with their peers (10%), residents who performed poorly on most measures compared with their peers (10%), and residents who performed well on some measures and poorly on others (80%). Each high-, intermediate-, and low-performing resident had a least one aspect of the MSF that was significantly lower than the other, and this served as the basis of formative feedback during the long-block. Conclusion Use of multi-source feedback in the ambulatory setting can identify high-, intermediate-, and low-performing residents and suggest specific formative feedback for each. More research needs to be done on the effect of such feedback, as well as the relationships between each of the components in the MSF data set. PMID:21975632

Data for improvement and clinical excellence: protocol for an audit with feedback intervention in long-term care.

PubMed

Sales, Anne E; Schalm, Corinne

2010-10-13

There is considerable evidence about the effectiveness of audit coupled with feedback, although few audit with feedback interventions have been conducted in long-term care (LTC) settings to date. In general, the effects have been found to be modest at best, although in settings where there has been little history of audit and feedback, the effects may be greater, at least initially. The primary purpose of the Data for Improvement and Clinical Excellence (DICE) Long-Term Care project is to assess the effects of an audit with feedback intervention delivered monthly over 13 months in four LTC facilities. The research questions we addressed are:1. What effects do feedback reports have on processes and outcomes over time?2. How do different provider groups in LTC and home care respond to feedback reports based on data targeted at improving quality of care? The research team conducting this study comprises researchers and decision makers in continuing care in the province of Alberta, Canada. The intervention consists of monthly feedback reports in nine LTC units in four facilities in Edmonton, Alberta. Data for the feedback reports comes from the Resident Assessment Instrument Minimum Data Set (RAI) version 2.0, a standardized instrument mandated for use in LTC facilities throughout Alberta. Feedback reports consist of one page, front and back, presenting both graphic and textual information. Reports are delivered to all staff working in the four LTC facilities. The primary evaluation uses a controlled interrupted time series design both adjusted and unadjusted for covariates. The concurrent process evaluation uses observation and self-report to assess uptake of the feedback reports. Following the project phase described in this protocol, a similar intervention will be conducted in home care settings in Alberta. Depending on project findings, if they are judged useful by decision makers participating in this research team, we plan dissemination and spread of the feedback report approach throughout Alberta.

Mental models of audit and feedback in primary care settings.

PubMed

Hysong, Sylvia J; Smitham, Kristen; SoRelle, Richard; Amspoker, Amber; Hughes, Ashley M; Haidet, Paul

2018-05-30

Audit and feedback has been shown to be instrumental in improving quality of care, particularly in outpatient settings. The mental model individuals and organizations hold regarding audit and feedback can moderate its effectiveness, yet this has received limited study in the quality improvement literature. In this study we sought to uncover patterns in mental models of current feedback practices within high- and low-performing healthcare facilities. We purposively sampled 16 geographically dispersed VA hospitals based on high and low performance on a set of chronic and preventive care measures. We interviewed up to 4 personnel from each location (n = 48) to determine the facility's receptivity to audit and feedback practices. Interview transcripts were analyzed via content and framework analysis to identify emergent themes. We found high variability in the mental models of audit and feedback, which we organized into positive and negative themes. We were unable to associate mental models of audit and feedback with clinical performance due to high variance in facility performance over time. Positive mental models exhibit perceived utility of audit and feedback practices in improving performance; whereas, negative mental models did not. Results speak to the variability of mental models of feedback, highlighting how facilities perceive current audit and feedback practices. Findings are consistent with prior research  in that variability in feedback mental models is associated with lower performance.; Future research should seek to empirically link mental models revealed in this paper to high and low levels of clinical performance.

Predicting reading and mathematics from neural activity for feedback learning.

PubMed

Peters, Sabine; Van der Meulen, Mara; Zanolie, Kiki; Crone, Eveline A

2017-01-01

Although many studies use feedback learning paradigms to study the process of learning in laboratory settings, little is known about their relevance for real-world learning settings such as school. In a large developmental sample (N = 228, 8-25 years), we investigated whether performance and neural activity during a feedback learning task predicted reading and mathematics performance 2 years later. The results indicated that feedback learning performance predicted both reading and mathematics performance. Activity during feedback learning in left superior dorsolateral prefrontal cortex (DLPFC) predicted reading performance, whereas activity in presupplementary motor area/anterior cingulate cortex (pre-SMA/ACC) predicted mathematical performance. Moreover, left superior DLPFC and pre-SMA/ACC activity predicted unique variance in reading and mathematics ability over behavioral testing of feedback learning performance alone. These results provide valuable insights into the relationship between laboratory-based learning tasks and learning in school settings, and the value of neural assessments for prediction of school performance over behavioral testing alone. (PsycINFO Database Record (c) 2016 APA, all rights reserved).

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

PubMed

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

2014-02-01

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

Method for neural network control of motion using real-time environmental feedback

NASA Technical Reports Server (NTRS)

Buckley, Theresa M. (Inventor)

1997-01-01

A method of motion control for robotics and other automatically controlled machinery using a neural network controller with real-time environmental feedback. The method is illustrated with a two-finger robotic hand having proximity sensors and force sensors that provide environmental feedback signals. The neural network controller is taught to control the robotic hand through training sets using back- propagation methods. The training sets are created by recording the control signals and the feedback signal as the robotic hand or a simulation of the robotic hand is moved through a representative grasping motion. The data recorded is divided into discrete increments of time and the feedback data is shifted out of phase with the control signal data so that the feedback signal data lag one time increment behind the control signal data. The modified data is presented to the neural network controller as a training set. The time lag introduced into the data allows the neural network controller to account for the temporal component of the robotic motion. Thus trained, the neural network controlled robotic hand is able to grasp a wide variety of different objects by generalizing from the training sets.

Structure of large dsDNA viruses

PubMed Central

Klose, Thomas; Rossmann, Michael G.

2015-01-01

Nucleocytoplasmic large dsDNA viruses (NCLDVs) encompass an ever-increasing group of large eukaryotic viruses, infecting a wide variety of organisms. The set of core genes shared by all these viruses includes a major capsid protein with a double jelly-roll fold forming an icosahedral capsid, which surrounds a double layer membrane that contains the viral genome. Furthermore, some of these viruses, such as the members of the Mimiviridae and Phycodnaviridae have a unique vertex that is used during infection to transport DNA into the host. PMID:25003382

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

PubMed

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

2012-08-28

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

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

NASA Astrophysics Data System (ADS)

Chakrabarti, Amitabha; Chakraborti, Anirban; Jedidi, Aymen

2010-12-01

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

Uncovering the overlapping community structure of complex networks by maximal cliques

NASA Astrophysics Data System (ADS)

Li, Junqiu; Wang, Xingyuan; Cui, Yaozu

2014-12-01

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

Z H η vertex in the simplest little Higgs model

NASA Astrophysics Data System (ADS)

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

2018-04-01

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

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

NASA Astrophysics Data System (ADS)

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

2018-01-01

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

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

DOE PAGES

Kutepov, A. L.

2015-07-22

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

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.

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

PubMed

Kutepov, A L

2015-08-12

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

Development of radiation tolerant monolithic active pixel sensors with fast column parallel read-out

NASA Astrophysics Data System (ADS)

Koziel, M.; Dorokhov, A.; Fontaine, J.-C.; De Masi, R.; Winter, M.

2010-12-01

Monolithic active pixel sensors (MAPS) [1] (Turchetta et al., 2001) are being developed at IPHC—Strasbourg to equip the EUDET telescope [2] (Haas, 2006) and vertex detectors for future high energy physics experiments, including the STAR upgrade at RHIC [3] (T.S. Collaboration, 2005) and the CBM experiment at FAIR/GSI [4] (Heuser, 2006). High granularity, low material budget and high read-out speed are systematically required for most applications, complemented, for some of them, with high radiation tolerance. A specific column-parallel architecture, implemented in the MIMOSA-22 sensor, was developed to achieve fast read-out MAPS. Previous studies of the front-end architecture integrated in this sensor, which includes in-pixel amplification, have shown that the fixed pattern noise increase consecutive to ionizing radiation can be controlled by means of a negative feedback [5] (Hu-Guo et al., 2008). However, an unexpected rise of the temporal noise was observed. A second version of this chip (MIMOSA-22bis) was produced in order to search for possible improvements of the radiation tolerance, regarding this type of noise. In this prototype, the feedback transistor was tuned in order to mitigate the sensitivity of the pixel to ionizing radiation. The performances of the pixels after irradiation were investigated for two types of feedback transistors: enclosed layout transistor (ELT) [6] (Snoeys et al., 2000) and "standard" transistor with either large or small transconductance. The noise performance of all test structures was studied in various conditions (expected in future experiments) regarding temperature, integration time and ionizing radiation dose. Test results are presented in this paper. Based on these observations, ideas for further improvement of the radiation tolerance of column parallel MAPS are derived.

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

Generalized nonequilibrium vertex correction method in coherent medium theory for quantum transport simulation of disordered nanoelectronics

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.

Research and analysis on new test lenses for calibration of focimeters used for measuring contact lenses

NASA Astrophysics Data System (ADS)

Zhang, Jiyan; Wang, Liru; Ma, Zhenya

2006-11-01

A focimeter is one of the basic ophthalmic instruments used in every optometric practice, and verification of the accuracy and calibration of the instrument are of the utmost importance. For many years the International Standardization for Organization requires that calibrations for all kinds of focimeters shall be accomplished by using test lenses described in ISO 9342:1996. These test lenses must be of high quality and of nominal back vertex power that is known with high accuracy. With the development of science and technology, ISO 9342 was revised in 2005. A new part ISO 9342-2 had been drafted for test lenses used to calibrate focimeters with contact lens measurement, and the original ISO 9342 was turned into the current ISO 9342-1, which could only be used to calibrate fociemters with spectacle lens measurement. As one of the standard drafters, the background for the newly published ISO 9342-2 is introduced in this study, and comparison between test lenses of ISO 9342-1 and ISO 9342-2 is made. Further, the influence of tolerance and uncertainty in design and production of standard test lenses of ISO 9342-2 is analyzed. The paraxial approximation is used to relate the lens parameters with back vertex power and to calculate the uncertainty budget. Moreover, one set of test lenses conforming to ISO 9342-2 is manufactured and experiments are done with it. Results show that test lenses described in ISO 9342-2 can correct the measurement errors of focimeters used for measuring contact lenses well, especially for spherical aberration, and the correction is more effective for spherical contact lenses with high back vertex power.

Automatically Generated Algorithms for the Vertex Coloring Problem

PubMed Central

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

2013-01-01

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

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

NASA Astrophysics Data System (ADS)

Akkurt, Semih; Sahin, Mehmet

2017-11-01

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

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

NASA Astrophysics Data System (ADS)

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

2015-03-01

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

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

NASA Astrophysics Data System (ADS)

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

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

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 ( http://arXiv.org/abs/0801.2565v2 [math.AG], 2009), on the equivariant cohomology groups of the Hilbert scheme of points on {mathbb C^2} , with respect to a special torus action.

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.

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

PubMed

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

2016-07-01

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

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.

Breast augmentation with extra-projected and high-cohesive Dual-Gel Prosthesis 510: a prospective study of 75 consecutive cases for a new method (the Zenith system).

PubMed

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.

Midterm peer feedback in problem-based learning groups: the effect on individual contributions and achievement.

PubMed

Kamp, Rachelle J A; van Berkel, Henk J M; Popeijus, Herman E; Leppink, Jimmie; Schmidt, Henk G; Dolmans, Diana H J M

2014-03-01

Even though peer process feedback is an often used tool to enhance the effectiveness of collaborative learning environments like PBL, the conditions under which it is best facilitated still need to be investigated. Therefore, this study investigated the effects of individual versus shared reflection and goal setting on students' individual contributions to the group and their academic achievement. In addition, the influence of prior knowledge on the effectiveness of peer feedback was studied. In this pretest-intervention-posttest study 242 first year students were divided into three conditions: condition 1 (individual reflection and goal setting), condition 2 (individual and shared reflection and goal setting), and condition 3 (control group). Results indicated that the quality of individual contributions to the tutorial group did not improve after receiving the peer feedback, nor did it differ between the three conditions. With regard to academic achievement, only males in conditions 1 and 2 showed better academic achievement compared with condition 3. However, there was no difference between both ways of reflection and goal setting with regard to achievement, indicating that both ways are equally effective. Nevertheless, it is still too early to conclude that peer feedback combined with reflection and goal setting is not effective in enhancing students' individual contributions. Students only had a limited number of opportunities to improve their contributions. Therefore, future research should investigate whether an increase in number of tutorial group meetings can enhance the effectiveness of peer feedback. In addition, the effect of quality of reflection and goal setting could be taken into consideration in future research.

Auditory cortical responses in patients with cochlear implants

PubMed Central

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

2006-01-01

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

Differential Effects of Context and Feedback on Orthographic Learning: How Good Is Good Enough?

ERIC Educational Resources Information Center

Martin-Chang, Sandra; Ouellette, Gene; Bond, Linda

2017-01-01

In this study, students in Grade 2 read different sets of words under 4 experimental training conditions (context/feedback, isolation/feedback, context/no-feedback, isolation/no-feedback). Training took place over 10 trials, followed by a spelling test and a delayed reading posttest. Reading in context boosted reading accuracy initially; in…

Classical field configurations and infrared slavery

NASA Astrophysics Data System (ADS)

Swanson, Mark S.

1987-09-01

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

Six-vertex model and Schramm-Loewner evolution.

PubMed

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

2017-05-01

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

Belle II silicon vertex detector

NASA Astrophysics Data System (ADS)

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

2016-09-01

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

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

DTIC Science & Technology

1981-01-01

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

Domain-wall trapping in a ferromagnetic nanowire network

NASA Astrophysics Data System (ADS)

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

2003-05-01

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

Determination system for solar cell layout in traffic light network using dominating set

NASA Astrophysics Data System (ADS)

Eka Yulia Retnani, Windi; Fambudi, Brelyanes Z.; Slamin

2018-04-01

Graph Theory is one of the fields in Mathematics that solves discrete problems. In daily life, the applications of Graph Theory are used to solve various problems. One of the topics in the Graph Theory that is used to solve the problem is the dominating set. The concept of dominating set is used, for example, to locate some objects systematically. In this study, the dominating set are used to determine the dominating points for solar panels, where the vertex represents the traffic light point and the edge represents the connection between the points of the traffic light. To search the dominating points for solar panels using the greedy algorithm. This algorithm is used to determine the location of solar panel. This research produced applications that can determine the location of solar panels with optimal results, that is, the minimum dominating points.

Computer-Supported Feedback Message Tailoring for Healthcare Providers in Malawi: Proof-of-Concept.

PubMed

Landis-Lewis, Zach; Douglas, Gerald P; Hochheiser, Harry; Kam, Matthew; Gadabu, Oliver; Bwanali, Mwatha; Jacobson, Rebecca S

2015-01-01

Although performance feedback has the potential to help clinicians improve the quality and safety of care, healthcare organizations generally lack knowledge about how this guidance is best provided. In low-resource settings, tools for theory-informed feedback tailoring may enhance limited clinical supervision resources. Our objectives were to establish proof-of-concept for computer-supported feedback message tailoring in Malawi, Africa. We conducted this research in five stages: clinical performance measurement, modeling the influence of feedback on antiretroviral therapy (ART) performance, creating a rule-based message tailoring process, generating tailored messages for recipients, and finally analysis of performance and message tailoring data. We retrospectively generated tailored messages for 7,448 monthly performance reports from 11 ART clinics. We found that tailored feedback could be routinely generated for four guideline-based performance indicators, with 35% of reports having messages prioritized to optimize the effect of feedback. This research establishes proof-of-concept for a novel approach to improving the use of clinical performance feedback in low-resource settings and suggests possible directions for prospective evaluations comparing alternative designs of feedback messages.

Self-locking degree-4 vertex origami structures

PubMed Central

Li, Suyi; Wang, K. W.

2016-01-01

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

Self-locking degree-4 vertex origami structures.

PubMed

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

2016-11-01

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

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

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

Simmhan, Yogesh; Kumbhare, Alok; Wickramaarachchi, Charith

2014-08-25

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

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

PubMed

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

2011-01-01

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

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

PubMed

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

2016-04-01

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

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.

Corrective Feedback, Learner Uptake, and Feedback Perception in a Chinese as a Foreign Language Classroom

ERIC Educational Resources Information Center

Fu, Tingfeng; Nassaji, Hossein

2016-01-01

The role of corrective feedback in second language classrooms has received considerable research attention in the past few decades. However, most of this research has been conducted in English-teaching settings, either ESL or EFL. This study examined teacher feedback, learner uptake as well as learner and teacher perception of feedback in an adult…

Photonic crystal surface-emitting lasers enabled by an accidental Dirac point

DOEpatents

Chua, Song Liang; Lu, Ling; Soljacic, Marin

2014-12-02

A photonic-crystal surface-emitting laser (PCSEL) includes a gain medium electromagnetically coupled to a photonic crystal whose energy band structure exhibits a Dirac cone of linear dispersion at the center of the photonic crystal's Brillouin zone. This Dirac cone's vertex is called a Dirac point; because it is at the Brillouin zone center, it is called an accidental Dirac point. Tuning the photonic crystal's band structure (e.g., by changing the photonic crystal's dimensions or refractive index) to exhibit an accidental Dirac point increases the photonic crystal's mode spacing by orders of magnitudes and reduces or eliminates the photonic crystal's distributed in-plane feedback. Thus, the photonic crystal can act as a resonator that supports single-mode output from the PCSEL over a larger area than is possible with conventional PCSELs, which have quadratic band edge dispersion. Because output power generally scales with output area, this increase in output area results in higher possible output powers.

Feedback GAP: pragmatic, cluster-randomized trial of goal setting and action plans to increase the effectiveness of audit and feedback interventions in primary care.

PubMed

Ivers, Noah M; Tu, Karen; Young, Jacqueline; Francis, Jill J; Barnsley, Jan; Shah, Baiju R; Upshur, Ross E; Moineddin, Rahim; Grimshaw, Jeremy M; Zwarenstein, Merrick

2013-12-17

Audit and feedback to physicians is a commonly used quality improvement strategy, but its optimal design is unknown. This trial tested the effects of a theory-informed worksheet to facilitate goal setting and action planning, appended to feedback reports on chronic disease management, compared to feedback reports provided without these worksheets. A two-arm pragmatic cluster randomized trial was conducted, with allocation at the level of primary care clinics. Participants were family physicians who contributed data from their electronic medical records. The 'usual feedback' arm received feedback every six months for two years regarding the proportion of their patients meeting quality targets for diabetes and/or ischemic heart disease. The intervention arm received these same reports plus a worksheet designed to facilitate goal setting and action plan development in response to the feedback reports. Blood pressure (BP) and low-density lipoprotein cholesterol (LDL) values were compared after two years as the primary outcomes. Process outcomes measured the proportion of guideline-recommended actions (e.g., testing and prescribing) conducted within the appropriate timeframe. Intention-to-treat analysis was performed. Outcomes were similar across groups at baseline. Final analysis included 20 physicians from seven clinics and 1,832 patients in the intervention arm (15% loss to follow up) and 29 physicians from seven clinics and 2,223 patients in the usual feedback arm (10% loss to follow up). Ten of 20 physicians completed the worksheet at least once during the study. Mean BP was 128/72 in the feedback plus worksheet arm and 128/73 in the feedback alone arm, while LDL was 2.1 and 2.0, respectively. Thus, no significant differences were observed across groups in the primary outcomes, but mean haemoglobin A1c was lower in the feedback plus worksheet arm (7.2% versus 7.4%, p<0.001). Improvements in both arms were noted over time for one-half of the process outcomes. Appending a theory-informed goal setting and action planning worksheet to an externally produced audit and feedback intervention did not lead to improvements in patient outcomes. The results may be explained in part by passive dissemination of the worksheet leading to inadequate engagement with the intervention. ClinicalTrials.gov NCT00996645.

Measurement of differential J/ψ production cross sections and forward-backward ratios in p + Pb collisions with the ATLAS detector

DOE PAGES

Aad, G.

2015-09-14

Measurements of differential cross sections for J/ψ production in p + Pb collisions at √s NN=5.02 TeV at the CERN Large Hadron Collider with the ATLAS detector are presented. The data set used corresponds to an integrated luminosity of 28.1 nb -1. The J/ψ mesons are reconstructed in the dimuon decay channel over the transverse momentum range 8< p T< 30GeV and over the center-of-mass rapidity range -2.87 < y*< 1.94. Prompt J/ψ are separated from J/ψ resulting from b-hadron decays through an analysis of the distance between the J/ψ decay vertex and the event primary vertex. The differential crossmore » section for production of nonprompt J/ψ is compared to a FONLL calculation that does not include nuclear effects. Forward-backward production ratios are presented and compared to theoretical predictions. These results complement previously published results by covering a region of higher transverse momentum and more central rapidity. They constrain the kinematic dependence of nuclear modifications of charmonium and b-quark production in p + Pb collisions.« less

Load Balancing in Hypergraphs

NASA Astrophysics Data System (ADS)

Delgosha, Payam; Anantharam, Venkat

2018-03-01

Consider a simple locally finite hypergraph on a countable vertex set, where each edge represents one unit of load which should be distributed among the vertices defining the edge. An allocation of load is called balanced if load cannot be moved from a vertex to another that is carrying less load. We analyze the properties of balanced allocations of load. We extend the concept of balancedness from finite hypergraphs to their local weak limits in the sense of Benjamini and Schramm (Electron J Probab 6(23):13, 2001) and Aldous and Steele (in: Probability on discrete structures. Springer, Berlin, pp 1-72, 2004). To do this, we define a notion of unimodularity for hypergraphs which could be considered an extension of unimodularity in graphs. We give a variational formula for the balanced load distribution and, in particular, we characterize it in the special case of unimodular hypergraph Galton-Watson processes. Moreover, we prove the convergence of the maximum load under some conditions. Our work is an extension to hypergraphs of Anantharam and Salez (Ann Appl Probab 26(1):305-327, 2016), which considered load balancing in graphs, and is aimed at more comprehensively resolving conjectures of Hajek (IEEE Trans Inf Theory 36(6):1398-1414, 1990).

Cortical thickness and surface area correlates with cognitive dysfunction among first-episode psychosis patients.

PubMed

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.

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.

Feedback Blunting: Total Sleep Deprivation Impairs Decision Making that Requires Updating Based on Feedback

PubMed Central

Whitney, Paul; Hinson, John M.; Jackson, Melinda L.; Van Dongen, Hans P.A.

2015-01-01

Study Objectives: To better understand the sometimes catastrophic effects of sleep loss on naturalistic decision making, we investigated effects of sleep deprivation on decision making in a reversal learning paradigm requiring acquisition and updating of information based on outcome feedback. Design: Subjects were randomized to a sleep deprivation or control condition, with performance testing at baseline, after 2 nights of total sleep deprivation (or rested control), and following 2 nights of recovery sleep. Subjects performed a decision task involving initial learning of go and no go response sets followed by unannounced reversal of contingencies, requiring use of outcome feedback for decisions. A working memory scanning task and psychomotor vigilance test were also administered. Setting: Six consecutive days and nights in a controlled laboratory environment with continuous behavioral monitoring. Subjects: Twenty-six subjects (22–40 y of age; 10 women). Interventions: Thirteen subjects were randomized to a 62-h total sleep deprivation condition; the others were controls. Results: Unlike controls, sleep deprived subjects had difficulty with initial learning of go and no go stimuli sets and had profound impairment adapting to reversal. Skin conductance responses to outcome feedback were diminished, indicating blunted affective reactions to feedback accompanying sleep deprivation. Working memory scanning performance was not significantly affected by sleep deprivation. And although sleep deprived subjects showed expected attentional lapses, these could not account for impairments in reversal learning decision making. Conclusions: Sleep deprivation is particularly problematic for decision making involving uncertainty and unexpected change. Blunted reactions to feedback while sleep deprived underlie failures to adapt to uncertainty and changing contingencies. Thus, an error may register, but with diminished effect because of reduced affective valence of the feedback or because the feedback is not cognitively bound with the choice. This has important implications for understanding and managing sleep loss-induced cognitive impairment in emergency response, disaster management, military operations, and other dynamic real-world settings with uncertain outcomes and imperfect information. Citation: Whitney P, Hinson JM, Jackson ML, Van Dongen HPA. Feedback blunting: total sleep deprivation impairs decision making that requires updating based on feedback. SLEEP 2015;38(5):745–754. PMID:25515105

Effects of absenteeism feedback and goal-setting interventions on nurses' fairness perceptions, discomfort feelings and absenteeism.

PubMed

Gaudine, Alice; Saks, Alan M; Dawe, Doreen; Beaton, Marilyn

2013-04-01

A longitudinal field experiment was conducted to test the effects of absenteeism feedback and goal-setting interventions on nurses' (1) fairness perceptions, (2) discomfort feelings and (3) absenteeism. Nurses' obstacles to reducing absenteeism were also explored. Absenteeism is a significant issue in health care and there is a need to avoid interventions that are seen to be negative, punitive or lead to sick nurses coming to work. Sixty-nine nurses working in a hospital in Eastern Canada received either: (1) absenteeism feedback with individual goal-setting, (2) absenteeism feedback with group goal-setting, or (3) no intervention, and were asked questions about how they could reduce their absenteeism. There was a significant decrease in the total number of days absent but no decrease in absent episodes, and a significant effect on fairness perceptions and discomfort feelings for the nurses in the absenteeism feedback conditions. Six categories of obstacles to reducing absenteeism were identified. The interventions made nurses feel their absence rate was less fair and to experience greater feelings of discomfort. The study's interventions may lead to a reduction in absence without the negative outcomes of a harsh absenteeism policy. © 2011 Blackwell Publishing Ltd.

Providing Behavioral Feedback to Students in an Alternative High School Setting

ERIC Educational Resources Information Center

Whitcomb, Sara A.; Hefter, Sheera; Barker, Elizabeth

2016-01-01

This column provides an example method for improving the consistency and quality of daily behavioral feedback provided to students in an alternative high school setting. Often, homeroom or advisory periods are prime points in the day for students to review their behavior from the previous day and set goals for a successful day to come. The method…

The eight tetrahedron equations

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

Hietarinta, J.; Nijhoff, F.

1997-07-01

In this paper we derive from arguments of string scattering a set of eight tetrahedron equations, with different index orderings. It is argued that this system of equations is the proper system that represents integrable structures in three dimensions generalizing the Yang{endash}Baxter equation. Under additional restrictions this system reduces to the usual tetrahedron equation in the vertex form. Most known solutions fall under this class, but it is by no means necessary. Comparison is made with the work on braided monoidal 2-categories also leading to eight tetrahedron equations. {copyright} {ital 1997 American Institute of Physics.}

[Technical aspects of measurement for optically sophisticated eyeglasses].

PubMed

Guilino, G

1988-07-01

This paper deals with the question of how aspherical ophthalmic lenses can be measured outside the reference point given by the manufacturer in order to make a lens comparison or to test the shape faithfulness of the lens surface. Three procedures are presented with measuring examples - vertex power measurement with swiveled lens mount, probe scan in a three-coordinate measurement, and interferometer measurement using a non-ideal reference lens. The basic problem inherent in an application-related interpretation of the measuring data sets gained by these methods is shown.

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

NASA Technical Reports Server (NTRS)

Kuan, Gary M.; Dekens, Frank G.

2006-01-01

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

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

NASA Astrophysics Data System (ADS)

Ishimoto, Yukitaka; Morishita, Yoshihiro

2014-11-01

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

Pileup Mitigation with Machine Learning (PUMML)

NASA Astrophysics Data System (ADS)

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

2017-12-01

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

Feedforward-feedback control of dissolved oxygen concentration in a predenitrification system.

PubMed

Yong, Ma; Yongzhen, Peng; Shuying, Wang

2005-07-01

As the largest single energy-consuming component in most biological wastewater treatment systems, aeration control is of great interest from the point of view of saving energy and improving wastewater treatment plant efficiency. In this paper, three different strategies, including conventional constant dissolved oxygen (DO) set-point control, cascade DO set-point control, and feedforward-feedback DO set-point control were evaluated using the denitrification layout of the IWA simulation benchmark. Simulation studies showed that the feedforward-feedback DO set-point control strategy was better than the other control strategies at meeting the effluent standards and reducing operational costs. The control strategy works primarily by feedforward control based on an ammonium sensor located at the head of the aerobic process. It has an important advantage over effluent measurements in that there is no (or only a very short) time delay for information; feedforward control was combined with slow feedback control to compensate for model approximations. The feedforward-feedback DO control was implemented in a lab-scale wastewater treatment plant for a period of 60 days. Compared to operation with constant DO concentration, the required airflow could be reduced by up to 8-15% by employing the feedforward-feedback DO-control strategy, and the effluent ammonia concentration could be reduced by up to 15-25%. This control strategy can be expected to be accepted by the operating personnel in wastewater treatment plants.

A model for educational feedback based on clinical communication skills strategies: beyond the "feedback sandwich".

PubMed

Milan, Felise B; Parish, Sharon J; Reichgott, Michael J

2006-01-01

Feedback is an essential tool in medical education, and the process is often difficult for both faculty and learner. There are strong analogies between the provision of educational feedback and doctor-patient communication during the clinical encounter. Relationship-building skills used in the clinical setting-Partnership, Empathy, Apology, Respect, Legitimation, Support (PEARLS)-can establish trust with the learner to better manage difficult feedback situations involving personal issues, unprofessional behavior, or a defensive learner. Using the stage of readiness to change (transtheoretical) model, the educator can "diagnose" the learner's stage of readiness and employ focused interventions to encourage desired changes. This approach has been positively received by medical educators in faculty development workshops. A model for provision of educational feedback based on communication skills used in the clinical encounter can be useful in the medical education setting. More robust evaluation of the construct validity is required in actual training program situations.

The Use of Keywords for Delivering Immediate Performance Feedback on Teacher Competence Development

ERIC Educational Resources Information Center

Coninx, Nele; Kreijns, Karel; Jochems, Wim

2013-01-01

Literature shows that feedback that is specific, immediate and goal-oriented is effective on (pre-service) teachers' performance. Synchronous coaching gives this kind of feedback. Due to immediateness of feedback, pre-service teachers can suffer from cognitive load. We propose a set of standardised keywords through which this performance feedback…

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.

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

NASA Astrophysics Data System (ADS)

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

2018-04-01

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

Predictive modeling of neuroanatomic structures for brain atrophy detection

NASA Astrophysics Data System (ADS)

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

2010-03-01

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

A Linear Kernel for Co-Path/Cycle Packing

NASA Astrophysics Data System (ADS)

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

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

Track and vertex reconstruction: From classical to adaptive methods

NASA Astrophysics Data System (ADS)

Strandlie, Are; Frühwirth, Rudolf

2010-04-01

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

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

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

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

Complex growing networks with intrinsic vertex fitness

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

Bedogne, C.; Rodgers, G. J.

2006-10-15

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

Barriers to using eHealth data for clinical performance feedback in Malawi: A case study.

PubMed

Landis-Lewis, Zach; Manjomo, Ronald; Gadabu, Oliver J; Kam, Matthew; Simwaka, Bertha N; Zickmund, Susan L; Chimbwandira, Frank; Douglas, Gerald P; Jacobson, Rebecca S

2015-10-01

Sub-optimal performance of healthcare providers in low-income countries is a critical and persistent global problem. The use of electronic health information technology (eHealth) in these settings is creating large-scale opportunities to automate performance measurement and provision of feedback to individual healthcare providers, to support clinical learning and behavior change. An electronic medical record system (EMR) deployed in 66 antiretroviral therapy clinics in Malawi collects data that supervisors use to provide quarterly, clinic-level performance feedback. Understanding barriers to provision of eHealth-based performance feedback for individual healthcare providers in this setting could present a relatively low-cost opportunity to significantly improve the quality of care. The aims of this study were to identify and describe barriers to using EMR data for individualized audit and feedback for healthcare providers in Malawi and to consider how to design technology to overcome these barriers. We conducted a qualitative study using interviews, observations, and informant feedback in eight public hospitals in Malawi where an EMR system is used. We interviewed 32 healthcare providers and conducted seven hours of observation of system use. We identified four key barriers to the use of EMR data for clinical performance feedback: provider rotations, disruptions to care processes, user acceptance of eHealth, and performance indicator lifespan. Each of these factors varied across sites and affected the quality of EMR data that could be used for the purpose of generating performance feedback for individual healthcare providers. Using routinely collected eHealth data to generate individualized performance feedback shows potential at large-scale for improving clinical performance in low-resource settings. However, technology used for this purpose must accommodate ongoing changes in barriers to eHealth data use. Understanding the clinical setting as a complex adaptive system (CAS) may enable designers of technology to effectively model change processes to mitigate these barriers. Copyright © 2015. Published by Elsevier Ireland Ltd.

Barriers to using eHealth data for clinical performance feedback in Malawi: A case study

PubMed Central

Landis-Lewis, Zach; Manjomo, Ronald; Gadabu, Oliver J; Kam, Matthew; Simwaka, Bertha N; Zickmund, Susan L; Chimbwandira, Frank; Douglas, Gerald P; Jacobson, Rebecca S

2016-01-01

Introduction Sub-optimal performance of healthcare providers in low-income countries is a critical and persistent global problem. The use of electronic health information technology (eHealth) in these settings is creating large-scale opportunities to automate performance measurement and provision of feedback to individual healthcare providers, to support clinical learning and behavior change. An electronic medical record system (EMR) deployed in 66 antiretroviral therapy clinics in Malawi collects data that supervisors use to provide quarterly, clinic-level performance feedback. Understanding barriers to provision of eHealth-based performance feedback for individual healthcare providers in this setting could present a relatively low-cost opportunity to significantly improve the quality of care. Objective The aims of this study were to identify and describe barriers to using EMR data for individualized audit and feedback for healthcare providers in Malawi and to consider how to design technology to overcome these barriers. Methods We conducted a qualitative study using interviews, observations, and informant feedback in eight public hospitals in Malawi where an EMR is used. We interviewed 32 healthcare providers and conducted seven hours of observation of system use. Results We identified four key barriers to the use of EMR data for clinical performance feedback: provider rotations, disruptions to care processes, user acceptance of eHealth, and performance indicator lifespan. Each of these factors varied across sites and affected the quality of EMR data that could be used for the purpose of generating performance feedback for individual healthcare providers. Conclusion Using routinely collected eHealth data to generate individualized performance feedback shows potential at large-scale for improving clinical performance in low-resource settings. However, technology used for this purpose must accommodate ongoing changes in barriers to eHealth data use. Understanding the clinical setting as a complex adaptive system (CAS) may enable designers of technology to effectively model change processes to mitigate these barriers. PMID:26238704

"It's Just Not the Culture": A Qualitative Study Exploring Residents' Perceptions of the Impact of Institutional Culture on Feedback.

PubMed

Ramani, Subha; Post, Sarah E; Könings, Karen; Mann, Karen; Katz, Joel T; van der Vleuten, Cees

2017-01-01

Phenomenon: Competency-based medical education requires ongoing performance-based feedback for professional growth. In several studies, medical trainees report that the quality of faculty feedback is inadequate. Sociocultural barriers to feedback exchanges are further amplified in graduate and postgraduate medical education settings, where trainees serve as frontline providers of patient care. Factors that affect institutional feedback culture, enhance feedback seeking, acceptance, and bidirectional feedback warrant further exploration in these settings. Using a constructivist grounded theory approach, we sought to examine residents' perspectives on institutional factors that affect the quality of feedback, factors that influence receptivity to feedback, and quality and impact of faculty feedback. Four focus group discussions were conducted, with two investigators present at each. One facilitated the discussion, and the other observed the interactions and took field notes. We audiotaped and transcribed the discussions, and performed a thematic analysis. Measures to ensure rigor included thick descriptions, independent coding by two investigators, and attention to reflexivity. We identified five key themes, dominated by resident perceptions regarding the influence of institutional feedback culture. The theme labels are taken from direct participant quotes: (a) the cultural norm lacks clear expectations and messages around feedback, (b) the prevailing culture of niceness does not facilitate honest feedback, (c) bidirectional feedback is not part of the culture, (d) faculty-resident relationships impact credibility and receptivity to feedback, and (e) there is a need to establish a culture of longitudinal professional growth. Insights: Institutional culture could play a key role in influencing the quality, credibility, and acceptability of feedback. A polite culture promotes a positive learning environment but can be a barrier to honest feedback. Feedback initiatives focusing solely on techniques of feedback giving may not enhance meaningful feedback. Further research on factors that promote feedback seeking, receptivity to constructive feedback, and bidirectional feedback would provide valuable insights.

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

PubMed Central

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

2014-01-01

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

Conservation laws, vertex corrections, and screening in Raman spectroscopy

NASA Astrophysics Data System (ADS)

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

2017-07-01

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

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.

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

PubMed

Andersson, J E; Odén, A

2001-08-01

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

Feedback GAP: pragmatic, cluster-randomized trial of goal setting and action plans to increase the effectiveness of audit and feedback interventions in primary care

PubMed Central

2013-01-01

Background Audit and feedback to physicians is a commonly used quality improvement strategy, but its optimal design is unknown. This trial tested the effects of a theory-informed worksheet to facilitate goal setting and action planning, appended to feedback reports on chronic disease management, compared to feedback reports provided without these worksheets. Methods A two-arm pragmatic cluster randomized trial was conducted, with allocation at the level of primary care clinics. Participants were family physicians who contributed data from their electronic medical records. The ‘usual feedback’ arm received feedback every six months for two years regarding the proportion of their patients meeting quality targets for diabetes and/or ischemic heart disease. The intervention arm received these same reports plus a worksheet designed to facilitate goal setting and action plan development in response to the feedback reports. Blood pressure (BP) and low-density lipoprotein cholesterol (LDL) values were compared after two years as the primary outcomes. Process outcomes measured the proportion of guideline-recommended actions (e.g., testing and prescribing) conducted within the appropriate timeframe. Intention-to-treat analysis was performed. Results Outcomes were similar across groups at baseline. Final analysis included 20 physicians from seven clinics and 1,832 patients in the intervention arm (15% loss to follow up) and 29 physicians from seven clinics and 2,223 patients in the usual feedback arm (10% loss to follow up). Ten of 20 physicians completed the worksheet at least once during the study. Mean BP was 128/72 in the feedback plus worksheet arm and 128/73 in the feedback alone arm, while LDL was 2.1 and 2.0, respectively. Thus, no significant differences were observed across groups in the primary outcomes, but mean haemoglobin A1c was lower in the feedback plus worksheet arm (7.2% versus 7.4%, p<0.001). Improvements in both arms were noted over time for one-half of the process outcomes. Discussion Appending a theory-informed goal setting and action planning worksheet to an externally produced audit and feedback intervention did not lead to improvements in patient outcomes. The results may be explained in part by passive dissemination of the worksheet leading to inadequate engagement with the intervention. Trial registration ClinicalTrials.gov NCT00996645 PMID:24341511

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

Kerns, Q.A.; Jackson, G.; Kerns, C.R.

This paper describes the damper design for 6 proton on 6 pbar bunches in the Tevatron collider. Signal pickup, transient phase detection, derivative networks, and phase correction via the high-level rf are covered. Each rf station is controlled by a slow feedback loop. In addition, global feedback loops control each set of four cavities, one set for protons and one set for antiprotons. Operational experience with these systems is discussed. 7 refs., 9 figs.

What supervisors say in their feedback: construction of CanMEDS roles in workplace settings.

PubMed

Renting, Nienke; Dornan, Tim; Gans, Rijk O B; Borleffs, Jan C C; Cohen-Schotanus, Janke; Jaarsma, A Debbie C

2016-05-01

The CanMEDS framework has been widely adopted in residency education and feedback processes are guided by it. It is, however, only one of many influences on what is actually discussed in feedback. The sociohistorical culture of medicine and individual supervisors' contexts, experiences and beliefs are also influential. Our aim was to find how CanMEDS roles are constructed in feedback in a postgraduate curriculum-in-action. We applied a set of discourse analytic tools to written feedback from 591 feedback forms from 7 hospitals, including 3150 feedback comments in which 126 supervisors provided feedback to 120 residents after observing their performance in authentic settings. The role of Collaborator was constructed in two different ways: a cooperative discourse of equality with other workers and patients; and a discourse, which gave residents positions of power-delegating, asserting and 'taking a firm stance'. Efficiency-being fast and to the point emerged as an important attribute of physicians. Patients were seldom part of the discourses and, when they were, they were constructed as objects of communication and collaboration rather than partners. Although some of the discourses are in line with what might be expected, others were in striking contrast to the spirit of CanMEDS. This study's findings suggest that it takes more than a competency framework, evaluation instruments, and supervisor training to change the culture of workplaces. The impact on residents of training in such demanding, efficiency-focused clinical environments is an important topic for future research.

Short Answers to Deep Questions: Supporting Teachers in Large-Class Settings

ERIC Educational Resources Information Center

McDonald, J.; Bird, R. J.; Zouaq, A.; Moskal, A. C. M.

2017-01-01

In large class settings, individualized student-teacher interaction is difficult. However, teaching interactions (e.g., formative feedback) are central to encouraging deep approaches to learning. While there has been progress in automatic short-answer grading, analysing student responses to support formative feedback at scale is arguably some way…

The Role of Feedback on Studying, Achievement and Calibration.

ERIC Educational Resources Information Center

Chu, Stephanie T. L.; Jamieson-Noel, Dianne L.; Winne, Philip H.

One set of hypotheses examined in this study was that various types of feedback (outcome, process, and corrective) supply different information about performance and have different effects on studying processes and on achievement. Another set of hypotheses concerned students' calibration, their accuracy in predicting and postdicting achievement…

Praise in Public, Criticize in Private? An Assessment of Performance Feedback Transparency in a Classroom Setting

ERIC Educational Resources Information Center

Seevers, Matthew T.; Rowe, William J.; Skinner, Steven J.

2014-01-01

Conventional wisdom in sales management encourages public delivery of positive feedback, and private delivery of negative feedback. In stark contrast, U.S. educators typically provide all performance feedback in relative (if not strict) privacy to comply with the Family Educational Rights and Privacy Act (FERPA). To investigate this discrepancy,…

Reducing pharmacy wait time to promote customer service: a follow-up study.

PubMed

Slowiak, Julie M; Huitema, Bradley E

2015-01-01

The present study had 3 objectives: (1) to evaluate the effects of 2 different interventions (feedback regarding customer satisfaction with wait time and combined feedback and goal setting) on wait time in a hospital outpatient pharmacy; (2) to assess the extent to which the previously applied interventions maintained their effects; and (3) to evaluate the differences between the effects of the original study and those of the present follow-up study. Participants were 10 employees (4 pharmacists and 6 technicians) of an outpatient pharmacy. Wait times and customer satisfaction ratings were collected for "waiting customers." An ABCB within-subjects design was used to assess the effects of the interventions on both wait time and customer satisfaction, where A was the baseline (no feedback and no goal setting); B was the customer satisfaction feedback; and C was the customer satisfaction feedback, the wait time feedback, and the goal setting for wait time reduction. Wait time decreased after baseline when the combined intervention was introduced, and wait time increased with the reintroduction of satisfaction feedback (alone). The results of the replication study confirm the pattern of the results of the original study and demonstrate high sensitivity of levels of customer satisfaction with wait time. The most impressive result of the replication is the nearly 2-year maintenance of lower wait time between the end of the original study and the beginning (baseline) of the replication.

Galilean invariance and vertex renormalization in turbulence theory.

PubMed

McComb, W D

2005-03-01

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

What do we know about how to do audit and feedback? Pitfalls in applying evidence from a systematic review.

PubMed

Foy, R; Eccles, M P; Jamtvedt, G; Young, J; Grimshaw, J M; Baker, R

2005-07-13

Improving the quality of health care requires a range of evidence-based activities. Audit and feedback is commonly used as a quality improvement tool in the UK National Health Service [NHS]. We set out to assess whether current guidance and systematic review evidence can sufficiently inform practical decisions about how to use audit and feedback to improve quality of care. We selected an important chronic disease encountered in primary care: diabetes mellitus. We identified recommendations from National Institute for Clinical Excellence (NICE) guidance on conducting audit and generated questions which would be relevant to any attempt to operationalise audit and feedback in a healthcare service setting. We explored the extent to which a systematic review of audit and feedback could provide practical guidance about whether audit and feedback should be used to improve quality of diabetes care and, if so, how audit and feedback could be optimised. National guidance suggests the importance of securing the right organisational conditions and processes. Review evidence suggests that audit and feedback can be effective in changing healthcare professional practice. However, the available evidence says relatively little about the detail of how to use audit and feedback most efficiently. Audit and feedback will continue to be an unreliable approach to quality improvement until we learn how and when it works best. Conceptualising audit and feedback within a theoretical framework offers a way forward.

Optimized Vertex Method and Hybrid Reliability

NASA Technical Reports Server (NTRS)

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

2002-01-01

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

Continuous-time quantum Monte Carlo calculation of multiorbital vertex asymptotics

NASA Astrophysics Data System (ADS)

Kaufmann, Josef; Gunacker, Patrik; Held, Karsten

2017-07-01

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

Anomalous glassy dynamics in simple models of dense biological tissue

NASA Astrophysics Data System (ADS)

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

2018-02-01

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

Effective feedback strategies for teaching in pediatric and adolescent gynecology.

PubMed

Kaul, Paritosh; Gong, Jennifer; Guiton, Gretchen

2014-08-01

The clinical setting of pediatric and adolescent gynecology poses complex tasks for the physician with its numerous procedures and the communication demands of interacting with an adolescent and/or guardian. Needless to say, teaching within this setting is highly demanding. Regardless of the level of learner or the professional role (e.g., nurse, medical student, resident, physician assistant) represented, clinical teaching requires that the instructor provide feedback in ways that benefit the student. Recent research on feedback suggests a more complex understanding of feedback than in the past. This article highlights key research and its implication for effective feedback by presenting a three part framework; know your learner, understand what is to be learned, and plan for improvement. Copyright © 2014 North American Society for Pediatric and Adolescent Gynecology. Published by Elsevier Inc. All rights reserved.

Marking and Providing Feedback Face-to-Face: Staff and Student Perspectives

ERIC Educational Resources Information Center

Chalmers, Charlotte; Mowat, Elaine; Chapman, Maggie

2018-01-01

The setting, marking and providing feedback on assessments form an important part of a tutor's role. Studies into the use of feedback and how it is interpreted by students indicate a mismatch between what students are looking for and what tutors think they are giving. Tutors comment that students are more interested in the mark than the feedback,…

A Note to Teacher: Improving Student Behavior through Goal Setting and Feedback.

ERIC Educational Resources Information Center

Martens, Brian K.; Hiralall, Andrea S.; Bradley, Tracy A.

1997-01-01

Examines the effects of goal setting and feedback applied to teacher behavior as a means of producing desired changes in students' behavior during consultation. Results indicate that the intervention was effective at increasing appropriate student behavior and was judged by the teacher to be acceptable. Implications of results are discussed. (RJM)

Enhancing Productivity Through Feedback and Goal Setting. Final Report.

ERIC Educational Resources Information Center

Pritchard, Robert D.; And Others

A field test was conducted to research the effects of feedback and goal-setting techniques on increasing productivity. Subjects were regular employees of two autonomous clerical-type units in a credit card and payment processing center of a Southwestern oil company. The study desiqn had three phases--baseline period and two experimental conditions…

A Daily-Adjusted Goal-Setting and Feedback Procedure for Improving Productivity in a University Admissions Department.

ERIC Educational Resources Information Center

Wilk, Leslie A.; Redmon, William K.

1990-01-01

Daily goals set by supervisors and feedback were used with three female application processors in a college admissions office. After 39 weeks, comparison with baseline data showed large increases in the amount of work done and decreases in overtime, use of temporaries, and absenteeism. (SK)

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.

A Negative-Feedback Loop between the Detoxification/Antioxidant Response Factor SKN-1 and Its Repressor WDR-23 Matches Organism Needs with Environmental Conditions

PubMed Central

Leung, Chi K.; Wang, Ying; Deonarine, Andrew; Tang, Lanlan; Prasse, Stephanie

2013-01-01

Negative-feedback loops between transcription factors and repressors in responses to xenobiotics, oxidants, heat, hypoxia, DNA damage, and infection have been described. Although common, the function of feedback is largely unstudied. Here, we define a negative-feedback loop between the Caenorhabditis elegans detoxification/antioxidant response factor SKN-1/Nrf and its repressor wdr-23 and investigate its function in vivo. Although SKN-1 promotes stress resistance and longevity, we find that tight regulation by WDR-23 is essential for growth and reproduction. By disabling SKN-1 transactivation of wdr-23, we reveal that feedback is required to set the balance between growth/reproduction and stress resistance/longevity. We also find that feedback is required to set the sensitivity of a core SKN-1 target gene to an electrophile. Interestingly, the effect of feedback on target gene induction is greatly reduced when the stress response is strongly activated, presumably to ensure maximum activation of cytoprotective genes during potentially fatal conditions. Our work provides a framework for understanding the function of negative feedback in inducible stress responses and demonstrates that manipulation of feedback alone can shift the balance of competing animal processes toward cell protection, health, and longevity. PMID:23836880

A mixed-method investigation of patient monitoring and enhanced feedback in routine practice: Barriers and facilitators

PubMed Central

Lucock, Mike; Halstead, Jeremy; Leach, Chris; Barkham, Michael; Tucker, Samantha; Randal, Chloe; Middleton, Joanne; Khan, Wajid; Catlow, Hannah; Waters, Emma; Saxon, David

2015-01-01

Abstract Objective: To investigate the barriers and facilitators of an effective implementation of an outcome monitoring and feedback system in a UK National Health Service psychological therapy service. Method: An outcome monitoring system was introduced in two services. Enhanced feedback was given to therapists after session 4. Qualitative and quantitative methods were used, including questionnaires for therapists and patients. Thematic analysis was carried out on written and verbal feedback from therapists. Analysis of patient outcomes for 202 episodes of therapy was compared with benchmark data of 136 episodes of therapy for which feedback was not given to therapists. Results: Themes influencing the feasibility and acceptability of the feedback system were the extent to which therapists integrated the measures and feedback into the therapy, availability of administrative support, information technology, and complexity of the service. There were low levels of therapist actions resulting from the feedback, including discussing the feedback in supervision and with patients. Conclusions: The findings support the feasibility and acceptability of setting up a routine system in a complex service, but a number of challenges and barriers have to be overcome and therapist differences are apparent. More research on implementation and effectiveness is needed in diverse clinical settings. PMID:26436605

The role of geometry in 4-vertex origami mechanics

NASA Astrophysics Data System (ADS)

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

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

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

PubMed

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

2017-01-01

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

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

NASA Astrophysics Data System (ADS)

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

2017-05-01

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

A systematic approach to sketch Bethe-Salpeter equation

NASA Astrophysics Data System (ADS)

Qin, Si-xue

2016-03-01

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

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

NASA Astrophysics Data System (ADS)

Nurhuda, Maryam; Aziz Majidi, Muhammad

2018-04-01

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

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

PubMed

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

2008-05-13

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

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

PubMed Central

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

2008-01-01

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

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.

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

PubMed

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

2009-01-01

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

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

DOE PAGES

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

2017-05-19

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

In vivo soft tissue differentiation by diffuse reflectance spectroscopy: preliminary results

NASA Astrophysics Data System (ADS)

Zam, Azhar; Stelzle, Florian; Tangermann-Gerk, Katja; Adler, Werner; Nkenke, Emeka; Neukam, Friedrich Wilhelm; Schmidt, Michael; Douplik, Alexandre

Remote laser surgery does not provide haptic feedback to operate layer by layer and preserve vulnerable anatomical structures like nerve tissue or blood vessels. The aim of this study is identification of soft tissue in vivo by diffuse reflectance spectroscopy to set the base for a feedback control system to enhance nerve preservation in oral and maxillofacial laser surgery. Various soft tissues can be identified by diffuse reflectance spectroscopy in vivo. The results may set the base for a feedback system to prevent nerve damage during oral and maxillofacial laser surgery.

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 .

What do we know about how to do audit and feedback? Pitfalls in applying evidence from a systematic review

PubMed Central

Foy, R; Eccles, MP; Jamtvedt, G; Young, J; Grimshaw, JM; Baker, R

2005-01-01

Background Improving the quality of health care requires a range of evidence-based activities. Audit and feedback is commonly used as a quality improvement tool in the UK National Health Service [NHS]. We set out to assess whether current guidance and systematic review evidence can sufficiently inform practical decisions about how to use audit and feedback to improve quality of care. Methods We selected an important chronic disease encountered in primary care: diabetes mellitus. We identified recommendations from National Institute for Clinical Excellence (NICE) guidance on conducting audit and generated questions which would be relevant to any attempt to operationalise audit and feedback in a healthcare service setting. We explored the extent to which a systematic review of audit and feedback could provide practical guidance about whether audit and feedback should be used to improve quality of diabetes care and, if so, how audit and feedback could be optimised. Results National guidance suggests the importance of securing the right organisational conditions and processes. Review evidence suggests that audit and feedback can be effective in changing healthcare professional practice. However, the available evidence says relatively little about the detail of how to use audit and feedback most efficiently. Conclusion Audit and feedback will continue to be an unreliable approach to quality improvement until we learn how and when it works best. Conceptualising audit and feedback within a theoretical framework offers a way forward. PMID:16011811

Designing Crowdcritique Systems for Formative Feedback

ERIC Educational Resources Information Center

Easterday, Matthew W.; Rees Lewis, Daniel; Gerber, Elizabeth M.

2017-01-01

Intelligent tutors based on expert systems often struggle to provide formative feedback on complex, ill-defined problems where answers are unknown. Hybrid crowdsourcing systems that combine the intelligence of multiple novices in face-to-face settings might provide an alternate approach for providing intelligent formative feedback. The purpose of…

E-Learning: Organizational Requirements for Successful Feedback Learning

ERIC Educational Resources Information Center

Cegarra-Navarro, Juan G.; Sabater-Sanchez, Ramon

2005-01-01

Purpose: Feedback learning transforms social knowledge into individual knowledge. In this process, tension arises because the current knowledge impedes the assimilation of new learning. Therefore, the feedback requires what Schumpeter refers to as "creative destruction": discarding, or at least setting aside, the institutional order to enact…

Epidemic spreading on complex networks with community structures

PubMed Central

Stegehuis, Clara; van der Hofstad, Remco; van Leeuwaarden, Johan S. H.

2016-01-01

Many real-world networks display a community structure. We study two random graph models that create a network with similar community structure as a given network. One model preserves the exact community structure of the original network, while the other model only preserves the set of communities and the vertex degrees. These models show that community structure is an important determinant of the behavior of percolation processes on networks, such as information diffusion or virus spreading: the community structure can both enforce as well as inhibit diffusion processes. Our models further show that it is the mesoscopic set of communities that matters. The exact internal structures of communities barely influence the behavior of percolation processes across networks. This insensitivity is likely due to the relative denseness of the communities. PMID:27440176

Chemometric analysis of multisensor hyperspectral images of precipitated atmospheric particulate matter.

PubMed

Ofner, Johannes; Kamilli, Katharina A; Eitenberger, Elisabeth; Friedbacher, Gernot; Lendl, Bernhard; Held, Andreas; Lohninger, Hans

2015-09-15

The chemometric analysis of multisensor hyperspectral data allows a comprehensive image-based analysis of precipitated atmospheric particles. Atmospheric particulate matter was precipitated on aluminum foils and analyzed by Raman microspectroscopy and subsequently by electron microscopy and energy dispersive X-ray spectroscopy. All obtained images were of the same spot of an area of 100 × 100 μm(2). The two hyperspectral data sets and the high-resolution scanning electron microscope images were fused into a combined multisensor hyperspectral data set. This multisensor data cube was analyzed using principal component analysis, hierarchical cluster analysis, k-means clustering, and vertex component analysis. The detailed chemometric analysis of the multisensor data allowed an extensive chemical interpretation of the precipitated particles, and their structure and composition led to a comprehensive understanding of atmospheric particulate matter.

Cosine problem in EPRL/FK spinfoam model

NASA Astrophysics Data System (ADS)

Vojinović, Marko

2014-01-01

We calculate the classical limit effective action of the EPRL/FK spinfoam model of quantum gravity coupled to matter fields. By employing the standard QFT background field method adapted to the spinfoam setting, we find that the model has many different classical effective actions. Most notably, these include the ordinary Einstein-Hilbert action coupled to matter, but also an action which describes antigravity. All those multiple classical limits appear as a consequence of the fact that the EPRL/FK vertex amplitude has cosine-like large spin asymptotics. We discuss some possible ways to eliminate the unwanted classical limits.

United States Air Force Summer Research Program 1991. Graduate Student Research Program (GSRP) Reports. Volume 8. Rome Laboratory, Arnold Engineering Development Center, F. J. Seiler Research Laboratory

DTIC Science & Technology

1992-01-09

and reliability and it concludes with a discussion of possible applications to the IMS prototype design. 1-2 AcknowledQements I would like to thank the...technologies and procedures such as cut-vertex set analysis, the results of which may lead to future applications of this work in network management. 1... mathematically as follows. If the distance between the atoms of the surface is d and the wave is scattered it an angle 9 (measured from the surface

Setting out the Role of Feedback in the Assessment Process through Both the Student and Tutor Perspective

ERIC Educational Resources Information Center

Hepplestone, Stuart; Glover, Ian; Irwin, Brian; Parkin, Helen J.

2016-01-01

Despite assessment and feedback being important elements of the student experience, it is not clear how students connect these two elements together to improve their learning. What are students doing with the assignment feedback that they receive from tutors, and how do they make use of this feedback in their future assessments? A research study…

ComPAIR: A New Online Tool Using Adaptive Comparative Judgement to Support Learning with Peer Feedback

ERIC Educational Resources Information Center

Potter, Tiffany; Englund, Letitia; Charbonneau, James; MacLean, Mark Thompson; Newell, Jonathan; Roll, Ido

2017-01-01

Peer feedback is a useful strategy in teaching and learning, but its effectiveness particularly in introductory courses can be limited by the relative newness of students to both the body of knowledge upon which they are being asked to provide feedback and the skill set involved in providing good feedback. This paper applies a novel approach to…

Digital adaptive control of a VTOL aircraft

NASA Technical Reports Server (NTRS)

Reid, G. F.

1976-01-01

A technique has been developed for calculating feedback and feedforward gain matrices that stabilize a VTOL aircraft while enabling it to track input commands of forward and vertical velocity. Leverrier's algorithm is used in a procedure for determining a set of state variable, feedback gains that force the closed loop poles and zeroes of one pilot input transfer function to be at preselected positions in the s plane. This set of feedback gains is then used to calculate the feedback and feedforward gains for the velocity command controller. The method is computationally attractive since the gains are determined by solving systems of linear, simultaneous equations. Responses obtained using a digital simulation of the longitudinal dynamics of the CH-47 helicopter are presented.

Sentinel-1 Interferometry from the Cloud to the Scientist

NASA Astrophysics Data System (ADS)

Garron, J.; Stoner, C.; Johnston, A.; Arko, S. A.

2017-12-01

Big data problems and solutions are growing in the technological and scientific sectors daily. Cloud computing is a vertically and horizontally scalable solution available now for archiving and processing large volumes of data quickly, without significant on-site computing hardware costs. Be that as it may, the conversion of scientific data processors to these powerful platforms requires not only the proof of concept, but the demonstration of credibility in an operational setting. The Alaska Satellite Facility (ASF) Distributed Active Archive Center (DAAC), in partnership with NASA's Jet Propulsion Laboratory, is exploring the functional architecture of Amazon Web Services cloud computing environment for the processing, distribution and archival of Synthetic Aperture Radar data in preparation for the NASA-ISRO Synthetic Aperture Radar (NISAR) Mission. Leveraging built-in AWS services for logging, monitoring and dashboarding, the GRFN (Getting Ready for NISAR) team has built a scalable processing, distribution and archival system of Sentinel-1 L2 interferograms produced using the ISCE algorithm. This cloud-based functional prototype provides interferograms over selected global land deformation features (volcanoes, land subsidence, seismic zones) and are accessible to scientists via NASA's EarthData Search client and the ASF DAACs primary SAR interface, Vertex, for direct download. The interferograms are produced using nearest-neighbor logic for identifying pairs of granules for interferometric processing, creating deep stacks of BETA products from almost every satellite orbit for scientists to explore. This presentation highlights the functional lessons learned to date from this exercise, including the cost analysis of various data lifecycle policies as implemented through AWS. While demonstrating the architecture choices in support of efficient big science data management, we invite feedback and questions about the process and products from the InSAR community.

Hierarchical graphs for rule-based modeling of biochemical systems

PubMed Central

2011-01-01

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

eBits: Compact stream of mesh refinements for remote visualization

DOE PAGES

Sati, Mukul; Lindstrom, Peter; Rossignac, Jarek

2016-05-12

Here, we focus on applications where a remote client needs to visualize or process a complex, manifold triangle mesh, M, but only in a relatively small, user controlled, Region of Interest (RoI) at a time. The client first downloads a coarse base mesh, pre-computed on the server via a series of simplification passes on M, one per Level of Detail (LoD), each pass identifying an independent set of triangles, collapsing them, and, for each collapse, storing, in a Vertex Expansion Record (VER), the information needed to reverse the collapse. On each client initiated RoI modification request, the server pushes tomore » the client a selected subset of these VERs, which, when decoded and applied to refine the mesh locally, ensure that the portion in the RoI is always at full resolution. The eBits approach proposed here offers state of the art compression ratios (using less than 2.5 bits per new full resolution RoI triangle when the RoI has more than 2000 vertices to transmit the connectivity for the selective refinements) and fine-grain control (allowing the user to adjust the RoI by small increments). The effectiveness of eBits results from several novel ideas and novel variations of previous solutions. We represent the VERs using persistent labels so that they can be applied in different orders within a given LoD. The server maintains a shadow copy of the client’s mesh. To avoid sending IDs identifying which vertices should be expanded, we either transmit, for each new vertex, a compact encoding of its death tag–the LoD at which it will be expanded if it lies in the Rol–or transmit vertex masks for the RoI and its neighboring vertices. We also propose a three-step simplification that reduces the overall transmission cost by increasing both the simplification effectiveness and the regularity of the valences in the resulting meshes.« less

eBits: Compact stream of mesh refinements for remote visualization

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

Sati, Mukul; Lindstrom, Peter; Rossignac, Jarek

2016-05-12

Here, we focus on applications where a remote client needs to visualize or process a complex, manifold triangle mesh, M, but only in a relatively small, user controlled, Region of Interest (RoI) at a time. The client first downloads a coarse base mesh, pre-computed on the server via a series of simplification passes on M, one per Level of Detail (LoD), each pass identifying an independent set of triangles, collapsing them, and, for each collapse, storing, in a Vertex Expansion Record (VER), the information needed to reverse the collapse. On each client initiated RoI modification request, the server pushes tomore » the client a selected subset of these VERs, which, when decoded and applied to refine the mesh locally, ensure that the portion in the RoI is always at full resolution. The eBits approach proposed here offers state of the art compression ratios (using less than 2.5 bits per new full resolution RoI triangle when the RoI has more than 2000 vertices to transmit the connectivity for the selective refinements) and fine-grain control (allowing the user to adjust the RoI by small increments). The effectiveness of eBits results from several novel ideas and novel variations of previous solutions. We represent the VERs using persistent labels so that they can be applied in different orders within a given LoD. The server maintains a shadow copy of the client’s mesh. To avoid sending IDs identifying which vertices should be expanded, we either transmit, for each new vertex, a compact encoding of its death tag ​–the LoD at which it will be expanded if it lies in the RoI–or transmit vertex masks for the RoI and its neighboring vertices. We also propose a three-step simplification that reduces the overall transmission cost by increasing both the simplification effectiveness and the regularity of the valences in the resulting meshes.« less

Feedback, Goal Setting, and Incentives Effects on Organizational Productivity.

ERIC Educational Resources Information Center

Pritchard, Robert D.; And Others

This technical paper is one of three produced by a large-scale effort aimed at implementing a new approach to measuring productivity, and using that approach to assess the impact of feedback, goal setting, and incentives on productivity. The productivity measurement system was developed for five units in the maintenance and supply areas at an Air…

Predicting Learning-Related Emotions from Students' Textual Classroom Feedback via Twitter

ERIC Educational Resources Information Center

Altrabsheh, Nabeela; Cocea, Mihaela; Fallahkhair, Sanaz

2015-01-01

Teachers/lecturers typically adapt their teaching to respond to students' emotions, e.g. provide more examples when they think the students are confused. While getting a feel of the students' emotions is easier in small settings, it is much more difficult in larger groups. In these larger settings textual feedback from students could provide…

The Effects of Task Clarification, Feedback, and Goal Setting on Student Advisors' Office Behaviors and Customer Service

ERIC Educational Resources Information Center

Tittelbach, Danielle; DeAngelis, Maureen; Sturmey, Peter; Alvero, Alicia M.

2007-01-01

This study evaluated the effects of feedback, task clarification and goal-setting on office behaviors and customer service of ten undergraduate participants that served as university advisors. A multiple baseline design was implemented across three target behaviors: client greeting, front-desk behaviors, and punctuality. During intervention the…

Increasing Following Headway with Prompts, Goal Setting, and Feedback in a Driving Simulator

ERIC Educational Resources Information Center

Arnold, Michelle L.; Van Houten, Ron

2011-01-01

We evaluated the effects of prompting, goal setting, and feedback on following headway of young drivers in a simulated driving environment and assessed whether changes produced in following headway were associated with reductions in hard braking when drivers were and were not using cell phones. Participants were 4 university students. During…

Searching for Dark Photons with the SeaQuest Spectrometer

NASA Astrophysics Data System (ADS)

Uemura, Sho; SeaQuest Collaboration

2017-09-01

The existence of a dark sector, containing families of particles that do not couple directly to the Standard Model, is motivated as a possible model for dark matter. A ``dark photon'' - a massive vector boson that couples weakly to electric charge - is a common component of dark sector models. The SeaQuest spectrometer at Fermilab is designed to detect dimuon pairs produced by the interaction of a 120 GeV proton beam with a rotating set of thin fixed targets. An iron-filled magnet downstream of the target, 5 meters in length, serves as a beam dump. The SeaQuest spectrometer is sensitive to dark photons that are mostly produced in the beam dump and decay to dimuons, and a SeaQuest search for dark sector particles was approved as Fermilab experiment E1067. As part of E1067, a displaced-vertex trigger was built, installed and commissioned this year. This trigger uses two planes of extruded scintillators to identify dimuons originating far downstream of the target, and is sensitive to dark photons that travel deep inside the beam dump before decaying to dimuons. This trigger will be used to take data parasitically with the primary SeaQuest physics program. In this talk I will present the displaced-vertex trigger and its performance, and projected sensitivity from future running.

Probing the W tb vertex structure in t-channel single-top-quark production and decay in pp collisions at √{s}=8 TeV with the ATLAS detector

NASA Astrophysics Data System (ADS)

Aaboud, M.; Aad, G.; Abbott, B.; Abdallah, J.; Abdinov, O.; Abeloos, B.; AbouZeid, O. S.; Abraham, N. L.; Abramowicz, H.; Abreu, H.; Abreu, R.; Abulaiti, Y.; Acharya, B. S.; Adachi, S.; Adamczyk, L.; Adams, D. L.; Adelman, J.; Adomeit, S.; Adye, T.; Affolder, A. A.; Agatonovic-Jovin, T.; 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.; Alshehri, A. A.; Alstaty, M.; Gonzalez, B. Alvarez; Piqueras, D. Álvarez; Alviggi, M. G.; Amadio, B. T.; 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, J. K.; Anderson, K. J.; Andreazza, A.; Andrei, V.; Angelidakis, S.; Angelozzi, I.; Angerami, A.; Anghinolfi, F.; Anisenkov, A. V.; Anjos, N.; Annovi, A.; Antel, C.; Antonelli, M.; Antonov, A.; Antrim, D. J.; Anulli, F.; Aoki, M.; Bella, L. Aperio; Arabidze, G.; Arai, Y.; Araque, J. P.; Ferraz, V. Araujo; 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.; Bajic, M.; 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.; 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.; Bethani, A.; Bethke, S.; Bevan, A. J.; Bianchi, R. M.; Bianco, M.; Biebel, O.; Biedermann, D.; Bielski, R.; Biesuz, N. V.; Biglietti, M.; De Mendizabal, J. Bilbao; Billoud, T. R. V.; Bilokon, H.; Bindi, M.; Bingul, A.; Bini, C.; Biondi, S.; Bisanz, T.; Bjergaard, D. M.; Black, C. W.; Black, J. E.; Black, K. M.; Blackburn, D.; Blair, R. E.; Blazek, T.; Bloch, I.; Blocker, C.; Blue, A.; Blum, W.; Blumenschein, U.; Blunier, S.; Bobbink, G. J.; Bobrovnikov, V. S.; Bocchetta, S. S.; Bocci, A.; Bock, C.; Boehler, M.; Boerner, D.; Bogaerts, J. A.; Bogavac, D.; Bogdanchikov, A. G.; Bohm, C.; Boisvert, V.; Bokan, P.; Bold, T.; Boldyrev, A. S.; Bomben, M.; Bona, M.; Boonekamp, M.; Borisov, A.; Borissov, G.; Bortfeldt, J.; Bortoletto, D.; Bortolotto, V.; Bos, K.; Boscherini, D.; Bosman, M.; 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.; 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.; Burger, A. M.; 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.; Cao, T.; Garrido, M. D. M. Capeans; Caprini, I.; Caprini, M.; Capua, M.; Carbone, R. M.; Cardarelli, R.; Cardillo, F.; Carli, I.; Carli, T.; Carlino, G.; Carlson, B. T.; Carminati, L.; Carney, R. M. D.; 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; Cerqueira, A. S.; Cerri, A.; Cerrito, L.; Cerutti, F.; 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, S.; Chen, S.; Chen, X.; Chen, Y.; Cheng, H. C.; Cheng, H. J.; Cheng, Y.; Cheplakov, A.; Cheremushkina, E.; El Moursli, R. Cherkaoui; Chernyatin, V.; Cheu, E.; Chevalier, L.; Chiarella, V.; Chiarelli, G.; Chiodini, G.; Chisholm, A. S.; Chitan, A.; Chiu, Y. H.; 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.; Ciftci, A. K.; Cinca, D.; Cindro, V.; Cioara, I. A.; Ciocca, C.; Ciocio, A.; Cirotto, F.; Citron, Z. H.; Citterio, M.; Ciubancan, M.; Clark, A.; Clark, B. L.; Clark, M. R.; Clark, P. J.; Clarke, R. N.; Clement, C.; Coadou, Y.; Cobal, M.; Coccaro, A.; Cochran, J.; Colasurdo, L.; Cole, B.; Colijn, A. P.; Collot, J.; Colombo, T.; 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, F.; Cormier, K. J. R.; Cornelissen, T.; Corradi, M.; Corriveau, F.; 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.; Cueto, A.; Donszelmann, T. Cuhadar; Cummings, J.; Curatolo, M.; Cúth, J.; Czirr, H.; Czodrowski, P.; D'amen, G.; D'Auria, S.; D'Onofrio, M.; Da Cunha Sargedas De Sousa, M. J.; Da Via, C.; Dabrowski, W.; Dado, T.; Dai, T.; Dale, O.; Dallaire, F.; Dallapiccola, C.; Dam, M.; Dandoy, J. R.; Dang, N. P.; Daniells, A. C.; Dann, N. S.; Danninger, M.; 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.; De, K.; de Asmundis, R.; De Benedetti, A.; De Castro, S.; De Cecco, S.; De Groot, N.; de Jong, P.; De la Torre, H.; De Lorenzi, F.; De Maria, A.; De Pedis, D.; De Salvo, A.; De Sanctis, U.; De Santo, A.; De Vivie De Regie, J. B.; Dearnaley, W. J.; Debbe, R.; Debenedetti, C.; Dedovich, D. V.; Dehghanian, N.; Deigaard, I.; Del Gaudio, M.; Del Peso, J.; Del Prete, T.; Delgove, D.; Deliot, F.; Delitzsch, C. M.; Dell'Acqua, A.; Dell'Asta, L.; Dell'Orso, M.; Pietra, M. Della; 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 Petrillo, K. F.; Di Simone, A.; Di Sipio, R.; Di Valentino, D.; Diaconu, C.; Diamond, M.; Dias, F. A.; Diaz, M. A.; Diehl, E. B.; Dietrich, J.; Cornell, S. Díez; Dimitrievska, A.; Dingfelder, J.; Dita, P.; Dita, S.; Dittus, F.; Djama, F.; Djobava, T.; Djuvsland, J. I.; do Vale, M. A. B.; Dobos, D.; Dobre, M.; Doglioni, C.; Dolejsi, J.; Dolezal, Z.; Donadelli, M.; Donati, S.; Dondero, P.; Donini, J.; Dopke, J.; Doria, A.; Dova, M. T.; Doyle, A. T.; Drechsler, E.; Dris, M.; Du, Y.; Duarte-Campderros, J.; Duchovni, E.; Duckeck, G.; Ducu, O. A.; Duda, D.; Dudarev, A.; Dudder, A. Chr.; Duffield, E. M.; Duflot, L.; Dührssen, M.; Dumancic, M.; Duncan, A. K.; 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.; El Kacimi, M.; Ellajosyula, V.; Ellert, M.; Elles, S.; Ellinghaus, F.; Elliot, A. A.; Ellis, N.; Elmsheuser, J.; Elsing, M.; Emeliyanov, D.; Enari, Y.; Endner, O. C.; Ennis, J. S.; Erdmann, J.; Ereditato, A.; Ernis, G.; Ernst, J.; Ernst, M.; Errede, S.; Ertel, E.; Escalier, M.; Esch, H.; Escobar, C.; Esposito, B.; Etienvre, A. I.; Etzion, E.; Evans, H.; Ezhilov, A.; Fabbri, F.; Fabbri, L.; Facini, G.; Fakhrutdinov, R. M.; Falciano, S.; Falla, R. J.; Faltova, J.; Fang, Y.; Fanti, M.; Farbin, A.; Farilla, A.; Farina, C.; Farina, E. M.; Farooque, T.; Farrell, S.; Farrington, S. M.; Farthouat, P.; Fassi, F.; Fassnacht, P.; Fassouliotis, D.; 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.; Fiedler, F.; Filipčič, A.; Filipuzzi, M.; Filthaut, F.; Fincke-Keeler, M.; Finelli, K. D.; Fiolhais, M. C. N.; Fiorini, L.; Fischer, A.; Fischer, C.; Fischer, J.; Fisher, W. C.; Flaschel, N.; Fleck, I.; Fleischmann, P.; Fletcher, G. T.; Fletcher, R. R. M.; Flick, T.; Flierl, B. M.; 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.; Torregrosa, E. Fullana; Fusayasu, T.; Fuster, J.; Gabaldon, C.; Gabizon, O.; Gabrielli, A.; Gabrielli, A.; Gach, G. P.; Gadatsch, 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.; Ganguly, S.; 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; Gasnikova, K.; Gatti, C.; Gaudiello, A.; Gaudio, G.; Gauthier, L.; Gavrilenko, I. L.; Gay, C.; Gaycken, G.; Gazis, E. N.; Gecse, Z.; Gee, C. N. P.; Geich-Gimbel, Ch.; Geisen, M.; Geisler, M. P.; Gellerstedt, K.; Gemme, C.; Genest, M. H.; Geng, C.; Gentile, S.; Gentsos, C.; George, S.; Gerbaudo, D.; Gershon, A.; Ghasemi, S.; Ghneimat, M.; Giacobbe, B.; Giagu, S.; Giannetti, P.; 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.; 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.; Gama, R. Goncalves; Da Costa, J. Goncalves Pinto Firmino; Gonella, G.; Gonella, L.; Gongadze, A.; de la Hoz, S. González; Gonzalez-Sevilla, S.; Goossens, L.; Gorbounov, P. A.; Gordon, H. A.; Gorelov, I.; Gorini, B.; Gorini, E.; Gorišek, A.; 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.; Gross, E.; Grosse-Knetter, J.; Grossi, G. C.; Grout, Z. J.; Guan, L.; Guan, W.; Guenther, J.; Guescini, F.; Guest, D.; Gueta, O.; Gui, B.; Guido, E.; Guillemin, T.; Guindon, S.; Gul, U.; Gumpert, C.; Guo, J.; Guo, W.; 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.; Hageböck, S.; Hagihara, M.; 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.; Han, S.; 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.; Hartjes, F.; Hartmann, N. M.; Hasegawa, M.; Hasegawa, Y.; Hasib, A.; Hassani, S.; Haug, S.; Hauser, R.; Hauswald, L.; Havranek, M.; Hawkes, C. M.; Hawkings, R. J.; Hayakawa, D.; Hayden, D.; Hays, C. P.; Hays, J. M.; Hayward, H. S.; Haywood, S. J.; Head, S. J.; Heck, T.; Hedberg, V.; Heelan, L.; 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.; Herde, H.; Herget, V.; Jiménez, Y. Hernández; Herten, G.; Hertenberger, R.; Hervas, L.; Hesketh, G. G.; Hessey, N. P.; Hetherly, J. W.; Higón-Rodriguez, E.; Hill, E.; Hill, J. C.; Hiller, K. H.; Hillier, S. J.; Hinchliffe, I.; Hines, E.; Hirose, M.; Hirschbuehl, D.; Hladik, O.; Hoad, X.; Hobbs, J.; Hod, N.; Hodgkinson, M. C.; Hodgson, P.; Hoecker, A.; Hoeferkamp, M. R.; Hoenig, F.; Hohn, D.; Holmes, T. R.; Homann, M.; Honda, S.; Honda, T.; Hong, T. M.; Hooberman, B. H.; Hopkins, W. H.; Horii, Y.; Horton, A. J.; Hostachy, J.-Y.; Hou, S.; Hoummada, A.; Howarth, J.; Hoya, J.; Hrabovsky, M.; Hristova, I.; Hrivnac, J.; Hryn'ova, T.; Hrynevich, A.; Hsu, P. J.; Hsu, S.-C.; Hu, Q.; Hu, S.; Huang, Y.; Hubacek, Z.; Hubaut, F.; Huegging, F.; Huffman, T. B.; Hughes, E. W.; Hughes, G.; Huhtinen, M.; Huo, P.; Huseynov, N.; Huston, J.; Huth, J.; Iacobucci, G.; Iakovidis, G.; Ibragimov, I.; Iconomidou-Fayard, L.; Ideal, E.; Iengo, P.; Igonkina, O.; Iizawa, T.; Ikegami, Y.; Ikeno, M.; Ilchenko, Y.; Iliadis, D.; Ilic, N.; Introzzi, G.; Ioannou, P.; Iodice, M.; Iordanidou, K.; Ippolito, V.; Ishijima, N.; Ishino, M.; Ishitsuka, M.; Issever, C.; Istin, S.; Ito, F.; Ponce, J. M. Iturbe; Iuppa, R.; Iwasaki, H.; Izen, J. M.; Izzo, V.; Jabbar, S.; Jackson, B.; Jackson, P.; Jain, V.; Jakobi, K. B.; Jakobs, K.; Jakobsen, S.; Jakoubek, T.; Jamin, D. O.; Jana, D. K.; Jansky, R.; Janssen, J.; Janus, M.; Janus, P. A.; Jarlskog, G.; Javadov, N.; Javůrek, T.; Javurkova, M.; Jeanneau, F.; Jeanty, L.; Jejelava, J.; Jeng, G.-Y.; Jenni, P.; Jeske, C.; Jézéquel, S.; Ji, H.; Jia, J.; Jiang, H.; Jiang, Y.; Jiang, Z.; Jiggins, S.; Pena, J. Jimenez; Jin, S.; Jinaru, A.; Jinnouchi, O.; Jivan, H.; Johansson, P.; Johns, K. A.; Johnson, C. 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.; Kaji, T.; Kajomovitz, E.; Kalderon, C. W.; Kaluza, A.; Kama, S.; Kamenshchikov, A.; Kanaya, N.; Kaneti, S.; Kanjir, L.; Kantserov, V. A.; Kanzaki, J.; Kaplan, B.; Kaplan, L. S.; Kapliy, A.; Kar, D.; Karakostas, K.; Karamaoun, A.; Karastathis, N.; Kareem, M. J.; Karentzos, E.; 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.; 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.; Kharlamova, T.; Khoo, T. J.; Khovanskiy, V.; Khramov, E.; Khubua, J.; Kido, S.; Kilby, C. R.; Kim, H. Y.; Kim, S. H.; Kim, Y. K.; Kimura, N.; Kind, O. M.; King, B. T.; King, M.; Kirchmeier, D.; Kirk, J.; Kiryunin, A. E.; Kishimoto, T.; Kisielewska, D.; Kiss, F.; Kiuchi, K.; Kivernyk, O.; Kladiva, E.; Klapdor-Kleingrothaus, T.; Klein, M. H.; Klein, M.; Klein, U.; Kleinknecht, K.; Klimek, P.; Klimentov, A.; Klingenberg, R.; 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.; Köhler, N. M.; 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.; 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.; Koulouris, A.; Kourkoumeli-Charalampidi, A.; Kourkoumelis, C.; Kouskoura, V.; Kowalewska, A. B.; Kowalewski, R.; Kowalski, T. Z.; Kozakai, C.; Kozanecki, W.; Kozhin, A. S.; Kramarenko, V. A.; Kramberger, G.; Krasnopevtsev, D.; Krasny, M. W.; Krasznahorkay, A.; Kravchenko, A.; Kretz, M.; Kretzschmar, J.; Kreutzfeldt, K.; Krieger, P.; Krizka, K.; Kroeninger, K.; Kroha, H.; Kroll, J.; Kroseberg, J.; Krstic, J.; Kruchonak, U.; Krüger, H.; Krumnack, N.; Kruse, M. C.; Kruskal, M.; Kubota, T.; Kucuk, H.; Kuday, S.; Kuechler, J. T.; Kuehn, S.; Kugel, A.; Kuger, F.; Kuhl, T.; Kukhtin, V.; Kukla, R.; Kulchitsky, Y.; Kuleshov, S.; Kuna, M.; Kunigo, T.; Kupco, A.; Kuprash, O.; Kurashige, H.; Kurchaninov, L. L.; Kurochkin, Y. A.; Kurth, M. G.; Kus, V.; Kuwertz, E. S.; Kuze, M.; Kvita, J.; Kwan, T.; Kyriazopoulos, D.; La Rosa, A.; La Rosa Navarro, J. L.; La Rotonda, L.; Lacasta, C.; Lacava, F.; Lacey, J.; Lacker, H.; Lacour, D.; 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.; Lapertosa, 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.; Le Dortz, O.; Le Guirriec, E.; Le Quilleuc, E. P.; LeBlanc, M.; LeCompte, T.; Ledroit-Guillon, F.; Lee, C. A.; Lee, S. C.; Lee, L.; Lefebvre, B.; Lefebvre, G.; Lefebvre, M.; Legger, F.; Leggett, C.; Lehan, A.; 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.; Leyton, M.; Li, B.; Li, C.; Li, H.; 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, Y. L.; Liu, Y.; Livan, M.; Lleres, A.; Merino, J. Llorente; Lloyd, S. L.; Sterzo, F. Lo; Lobodzinska, E. M.; Loch, P.; Loebinger, F. K.; 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.; Lopez, J. A.; 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.; 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, L.; Mandić, I.; Maneira, J.; de Andrade Filho, L. Manhaes; 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.; dit Latour, B. Martin; Martinez, M.; Outschoorn, V. I. Martinez; Martin-Haugh, S.; Martoiu, V. S.; Martyniuk, A. C.; 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.; Maznas, I.; 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.; Menary, S. B.; Meng, L.; Meng, X. T.; 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.; Minegishi, Y.; Ming, Y.; Mir, L. M.; Mistry, K. P.; Mitani, T.; Mitrevski, J.; Mitsou, V. A.; Miucci, A.; Miyagawa, P. S.; Mizukami, A.; Mjörnmark, J. U.; Mlynarikova, M.; Moa, T.; Mochizuki, K.; Mogg, P.; 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.; Moschovakos, P.; Mosidze, M.; Moss, H. J.; Moss, J.; Motohashi, K.; Mount, R.; Mountricha, E.; 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.; 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.; 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.; Manh, T. Nguyen; Nickerson, R. B.; Nicolaidou, R.; Nielsen, J.; 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'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.; y Garzon, G. Otero; 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; Paganini, M.; Paige, F.; Pais, P.; Pajchel, K.; Palacino, G.; Palazzo, S.; Palestini, S.; Palka, M.; Pallin, D.; Panagiotopoulou, E. St.; Panagoulias, I.; 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.; 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.; Pluth, D.; Poettgen, R.; Poggioli, L.; Pohl, D.; Polesello, G.; Poley, A.; Policicchio, A.; Polifka, R.; Polini, A.; Pollard, C. S.; Polychronakos, V.; Pommès, K.; Pontecorvo, L.; Pope, B. G.; Popeneciu, G. A.; Poppleton, A.; Pospisil, S.; Potamianos, K.; Potrap, I. N.; Potter, C. J.; Potter, C. T.; Poulard, G.; Poveda, J.; Pozdnyakov, V.; Astigarraga, M. E. Pozo; Pralavorio, P.; Pranko, A.; Prell, S.; Price, D.; Price, L. E.; Primavera, M.; Prince, S.; Prokofiev, K.; Prokoshin, F.; Protopopescu, S.; Proudfoot, J.; Przybycien, M.; Puddu, D.; Purohit, M.; Puzo, P.; Qian, J.; Qin, G.; Qin, Y.; Quadt, A.; Quayle, W. B.; Queitsch-Maitland, M.; Quilty, D.; Raddum, S.; Radeka, V.; Radescu, V.; Radhakrishnan, S. K.; Radloff, P.; Rados, P.; Ragusa, F.; Rahal, G.; Raine, J. A.; Rajagopalan, S.; Rammensee, M.; Rangel-Smith, C.; Ratti, M. G.; Rauch, D. M.; 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.; Reed, R. G.; Reeves, K.; Rehnisch, L.; Reichert, J.; Reiss, A.; Rembser, C.; Ren, H.; Rescigno, M.; Resconi, S.; Resseguie, E. D.; 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.; Roberts, R. T.; 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.; Roloff, J.; 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.; Rosien, N.-A.; Rossetti, V.; Rossi, E.; Rossi, L. P.; Rosten, J. H. N.; Rosten, R.; Rotaru, M.; Roth, I.; Rothberg, J.; Rousseau, D.; 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.; Sandhoff, M.; Sandoval, C.; 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.; Sato, K.; Sauvan, E.; Savage, G.; Savard, P.; Savic, N.; Sawyer, C.; Sawyer, L.; Saxon, J.; Sbarra, C.; Sbrizzi, A.; Scanlon, T.; Scannicchio, D. A.; Scarcella, M.; Scarfone, V.; Schaarschmidt, J.; Schacht, P.; Schachtner, B. M.; Schaefer, D.; Schaefer, L.; Schaefer, R.; Schaeffer, J.; Schaepe, S.; Schaetzel, S.; Schäfer, U.; Schaffer, A. C.; Schaile, D.; Schamberger, R. D.; Scharf, V.; Schegelsky, V. A.; Scheirich, D.; Schernau, M.; Schiavi, C.; Schier, S.; Schillo, C.; Schioppa, M.; Schlenker, S.; Schmidt-Sommerfeld, K. R.; Schmieden, K.; Schmitt, C.; Schmitt, S.; Schmitz, S.; Schneider, B.; Schnoor, U.; Schoeffel, L.; Schoening, A.; Schoenrock, B. D.; Schopf, E.; Schott, M.; Schouwenberg, J. F. P.; Schovancova, J.; Schramm, S.; Schreyer, M.; Schuh, N.; Schulte, A.; Schultens, M. J.; Schultz-Coulon, H.-C.; Schulz, H.; Schumacher, M.; Schumm, B. A.; Schune, Ph.; Schwartzman, A.; Schwarz, T. A.; Schweiger, H.; Schwemling, Ph.; Schwienhorst, R.; Schwindling, J.; Schwindt, T.; Sciolla, G.; Scuri, F.; Scutti, F.; Searcy, J.; Seema, P.; Seidel, S. C.; Seiden, A.; Seifert, F.; Seixas, J. M.; Sekhniaidze, G.; Sekhon, K.; Sekula, S. J.; 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.; Shirabe, S.; Shiyakova, M.; Shmeleva, A.; Saadi, D. Shoaleh; Shochet, M. J.; Shojaii, S.; Shope, D. R.; Shrestha, S.; Shulga, E.; Shupe, M. A.; Sicho, P.; Sickles, A. M.; Sidebo, P. E.; Haddad, E. Sideras; Sidiropoulou, O.; Sidorov, D.; Sidoti, A.; Siegert, F.; Sijacki, Dj.; Silva, J.; Silverstein, S. B.; Simak, V.; Simic, Lj.; Simion, S.; Simioni, E.; Simmons, B.; Simon, D.; Simon, M.; Sinervo, P.; Sinev, N. B.; Sioli, M.; Siragusa, G.; Siral, I.; 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, J. W.; Smith, M. N. K.; Smith, R. W.; Smizanska, M.; Smolek, K.; Snesarev, A. A.; Snyder, I. M.; 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.; Suster, C. J. E.; Sutton, M. R.; Suzuki, S.; Svatos, M.; Swiatlowski, M.; Swift, S. P.; Sykora, I.; Sykora, T.; Ta, D.; Tackmann, K.; Taenzer, J.; Taffard, A.; Tafirout, R.; Taiblum, N.; Takai, H.; Takashima, R.; Takeshita, T.; Takubo, Y.; Talby, M.; Talyshev, A. A.; Tanaka, J.; Tanaka, M.; Tanaka, R.; Tanaka, S.; Tanioka, R.; 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.; Ten Kate, H.; Teng, P. K.; Teoh, J. J.; Tepel, F.; Terada, S.; Terashi, K.; Terron, J.; Terzo, S.; Testa, M.; Teuscher, R. J.; Theveneaux-Pelzer, T.; Thomas, J. P.; Thomas-Wilsker, J.; Thompson, P. D.; Thompson, A. S.; Thomsen, L. A.; Thomson, E.; 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.; Tornambe, P.; 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.; Tu, Y.; Tudorache, A.; Tudorache, V.; Tulbure, T. T.; Tuna, A. N.; Tupputi, S. A.; Turchikhin, S.; Turgeman, D.; Cakir, I. Turk; Turra, R.; Tuts, P. 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.; Usui, J.; Vacavant, L.; Vacek, V.; Vachon, B.; Valderanis, C.; Santurio, E. Valdes; Valencic, N.; Valentinetti, S.; Valero, A.; Valéry, L.; Valkar, S.; Ferrer, J. A. Valls; Van Den Wollenberg, W.; Van Der Deijl, P. C.; van der Graaf, H.; van Eldik, N.; van Gemmeren, P.; Van Nieuwkoop, J.; van Vulpen, I.; van Woerden, M. C.; Vanadia, M.; Vandelli, W.; Vanguri, R.; Vaniachine, A.; Vankov, P.; Vardanyan, G.; Vari, R.; Varnes, E. W.; Varol, T.; Varouchas, D.; Vartapetian, A.; Varvell, K. E.; Vasquez, J. G.; Vasquez, G. A.; Vazeille, F.; Schroeder, T. Vazquez; Veatch, J.; Veeraraghavan, V.; Veloce, L. M.; Veloso, F.; Veneziano, S.; Ventura, A.; Venturi, M.; Venturi, N.; Venturini, A.; Vercesi, V.; Verducci, M.; Verkerke, W.; Vermeulen, J. C.; Vest, A.; Vetterli, M. C.; Viazlo, O.; Vichou, I.; Vickey, T.; Boeriu, O. E. Vickey; Viehhauser, G. H. A.; Viel, S.; Vigani, L.; Villa, M.; Perez, M. Villaplana; Vilucchi, E.; Vincter, M. G.; Vinogradov, V. B.; Vishwakarma, A.; 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.; 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, Q.; Wang, R.; Wang, S. M.; Wang, T.; Wang, W.; 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.; Weber, S. A.; 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. 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.; 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.; Wobisch, M.; Wolf, T. M. H.; Wolff, R.; 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.; Xi, Z.; Xu, D.; Xu, L.; Yabsley, B.; Yacoob, S.; Yamaguchi, D.; Yamaguchi, Y.; Yamamoto, A.; Yamamoto, S.; Yamanaka, T.; Yamauchi, K.; Yamazaki, Y.; Yan, Z.; Yang, H.; Yang, H.; Yang, Y.; Yang, Z.; Yao, W.-M.; Yap, Y. C.; Yasu, Y.; Yatsenko, E.; Wong, K. H. Yau; Ye, J.; Ye, S.; Yeletskikh, I.; 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.; Zacharis, G.; Zaidan, R.; Zaitsev, A. M.; Zakharchuk, N.; Zalieckas, J.; Zaman, A.; Zambito, S.; Zanzi, D.; Zeitnitz, C.; Zeman, M.; Zemla, A.; Zeng, J. C.; Zeng, Q.; Zenin, O.; Ženiš, T.; Zerwas, D.; Zhang, D.; Zhang, F.; Zhang, G.; Zhang, H.; Zhang, J.; Zhang, L.; Zhang, L.; Zhang, M.; Zhang, R.; Zhang, R.; Zhang, X.; Zhang, Y.; Zhang, Z.; Zhao, X.; Zhao, Y.; Zhao, Z.; Zhemchugov, A.; Zhong, J.; Zhou, B.; Zhou, C.; Zhou, L.; Zhou, L.; Zhou, M.; Zhou, M.; Zhou, N.; Zhu, C. G.; Zhu, H.; Zhu, J.; Zhu, Y.; Zhuang, X.; Zhukov, K.; Zibell, A.; Zieminska, D.; Zimine, N. I.; Zimmermann, C.; Zimmermann, S.; Zinonos, Z.; Zinser, M.; Ziolkowski, M.; Živković, L.; Zobernig, G.; Zoccoli, A.; zur Nedden, M.; Zwalinski, L.

2017-04-01

To probe the W tb vertex structure, top-quark and W -boson polarisation observables are measured from t-channel single-top-quark events produced in proton-proton collisions at a centre-of-mass energy of 8 TeV. The dataset corresponds to an integrated luminosity of 20.2 fb-1, recorded with the ATLAS detector at the LHC. Selected events contain one isolated electron or muon, large missing transverse momentum and exactly two jets, with one of them identified as likely to contain a b-hadron. Stringent selection requirements are applied to discriminate t-channel single-top-quark events from background. The polarisation observables are extracted from asymmetries in angular distributions measured with respect to spin quantisation axes appropriately chosen for the top quark and the W boson. The asymmetry measurements are performed at parton level by correcting the observed angular distributions for detector effects and hadronisation after subtracting the background contributions. The measured top-quark and W -boson polarisation values are in agreement with the Standard Model predictions. Limits on the imaginary part of the anomalous coupling g R are also set from model-independent measurements. [Figure not available: see fulltext.

Probing the W tb vertex structure in t-channel single-top-quark production and decay in pp collisions at $$ \\sqrt{s}=8 $$ TeV with the ATLAS detector

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

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

To probe the W tb vertex structure, top-quark and W -boson polarisation observables are measured from t-channel single-top-quark events produced in proton-proton collisions at a centre-of-mass energy of 8 TeV. The dataset corresponds to an integrated luminosity of 20.2 fb –1, recorded with the ATLAS detector at the LHC. Selected events contain one isolated electron or muon, large missing transverse momentum and exactly two jets, with one of them identified as likely to contain a b-hadron. Stringent selection requirements are applied to discriminate t-channel single-top-quark events from background. The polarisation observables are extracted from asymmetries in angular distributions measured withmore » respect to spin quantisation axes appropriately chosen for the top quark and the W boson. The asymmetry measurements are performed at parton level by correcting the observed angular distributions for detector effects and hadronisation after subtracting the background contributions. Here, the measured top-quark and W -boson polarisation values are in agreement with the Standard Model predictions. Limits on the imaginary part of the anomalous coupling g R are also set from model-independent measurements.« less

Probing the W tb vertex structure in t-channel single-top-quark production and decay in pp collisions at $$ \\sqrt{s}=8 $$ TeV with the ATLAS detector

DOE PAGES

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

2017-04-20

To probe the W tb vertex structure, top-quark and W -boson polarisation observables are measured from t-channel single-top-quark events produced in proton-proton collisions at a centre-of-mass energy of 8 TeV. The dataset corresponds to an integrated luminosity of 20.2 fb –1, recorded with the ATLAS detector at the LHC. Selected events contain one isolated electron or muon, large missing transverse momentum and exactly two jets, with one of them identified as likely to contain a b-hadron. Stringent selection requirements are applied to discriminate t-channel single-top-quark events from background. The polarisation observables are extracted from asymmetries in angular distributions measured withmore » respect to spin quantisation axes appropriately chosen for the top quark and the W boson. The asymmetry measurements are performed at parton level by correcting the observed angular distributions for detector effects and hadronisation after subtracting the background contributions. Here, the measured top-quark and W -boson polarisation values are in agreement with the Standard Model predictions. Limits on the imaginary part of the anomalous coupling g R are also set from model-independent measurements.« less

360 Degree Feedback: An Integrative Framework for Learning and Assessment

ERIC Educational Resources Information Center

Tee, Ding Ding; Ahmed, Pervaiz K.

2014-01-01

Feedback is widely acknowledged as the crux of a learning process. Multiplicities of research studies have been advanced to address the common "cri de coeur" of teachers and students for a constructive and effective feedback mechanism in the current higher educational settings. Nevertheless, existing pedagogical approaches in feedback…

Receptivity to Learner-Driven Feedback in EAP

ERIC Educational Resources Information Center

Maas, Clare

2017-01-01

There is still debate surrounding what constitutes the most effective feedback on EFL learners' writing, particularly in English for Academic Purposes (EAP) settings. Unanswered questions are found in the literature on topics such as the best formats for feedback, the role of technology, authors' authority over written texts, and ways of helping…

Quality of Feedback Following Performance Assessments: Does Assessor Expertise Matter?

ERIC Educational Resources Information Center

Govaerts, Marjan J. B.; van de Wiel, Margje W. J.; van der Vleuten, Cees P. M.

2013-01-01

Purpose: This study aims to investigate quality of feedback as offered by supervisor-assessors with varying levels of assessor expertise following assessment of performance in residency training in a health care setting. It furthermore investigates if and how different levels of assessor expertise influence feedback characteristics.…

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

PubMed

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

2010-07-23

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

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

ERIC Educational Resources Information Center

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

2008-01-01

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

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

ERIC Educational Resources Information Center

Burns-Childers, Annie; Vidakovic, Draga

2018-01-01

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

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

DTIC Science & Technology

2008-11-17

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

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

PubMed

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

2003-12-01

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

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

PubMed

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

2018-03-27

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

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

NASA Astrophysics Data System (ADS)

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

2018-04-01

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

Understanding feedback report uptake: process evaluation findings from a 13-month feedback intervention in long-term care settings.

PubMed

Sales, Anne E; Fraser, Kimberly; Baylon, Melba Andrea B; O'Rourke, Hannah M; Gao, Gloria; Bucknall, Tracey; Maisey, Suzanne

2015-02-12

Long-term care settings provide care to a large proportion of predominantly older, highly disabled adults across the United States and Canada. Managing and improving quality of care is challenging, in part because staffing is highly dependent on relatively non-professional health care aides and resources are limited. Feedback interventions in these settings are relatively rare, and there has been little published information about the process of feedback intervention. Our objectives were to describe the key components of uptake of the feedback reports, as well as other indicators of participant response to the intervention. We conducted this project in nine long-term care units in four facilities in Edmonton, Canada. We used mixed methods, including observations during a 13-month feedback report intervention with nine post-feedback survey cycles, to conduct a process evaluation of a feedback report intervention in these units. We included all facility-based direct care providers (staff) in the feedback report distribution and survey administration. We conducted descriptive analyses of the data from observations and surveys, presenting this in tabular and graphic form. We constructed a short scale to measure uptake of the feedback reports. Our analysis evaluated feedback report uptake by provider type over the 13 months of the intervention. We received a total of 1,080 survey responses over the period of the intervention, which varied by type of provider, facility, and survey month. Total number of reports distributed ranged from 103 in cycle 12 to 229 in cycle 3, although the method of delivery varied widely across the period, from 12% to 65% delivered directly to individuals and 15% to 84% left for later distribution. The key elements of feedback uptake, including receiving, reading, understanding, discussing, and reporting a perception that the reports were useful, varied by survey cycle and provider type, as well as by facility. Uptake, as we measured it, was consistently high overall, but varied widely by provider type and time period. We report detailed process data describing the aspects of uptake of a feedback report during an intensive, longitudinal feedback intervention in long-term care facilities. Uptake is a complex process for which we used multiple measures. We demonstrate the feasibility of conducting a complex longitudinal feedback intervention in relatively resource-poor long-term care facilities to a wider range of provider types than have been included in prior feedback interventions.

A unified framework for image retrieval using keyword and visual features.

PubMed

Jing, Feng; Li, Mingling; Zhang, Hong-Jiang; Zhang, Bo

2005-07-01

In this paper, a unified image retrieval framework based on both keyword annotations and visual features is proposed. In this framework, a set of statistical models are built based on visual features of a small set of manually labeled images to represent semantic concepts and used to propagate keywords to other unlabeled images. These models are updated periodically when more images implicitly labeled by users become available through relevance feedback. In this sense, the keyword models serve the function of accumulation and memorization of knowledge learned from user-provided relevance feedback. Furthermore, two sets of effective and efficient similarity measures and relevance feedback schemes are proposed for query by keyword scenario and query by image example scenario, respectively. Keyword models are combined with visual features in these schemes. In particular, a new, entropy-based active learning strategy is introduced to improve the efficiency of relevance feedback for query by keyword. Furthermore, a new algorithm is proposed to estimate the keyword features of the search concept for query by image example. It is shown to be more appropriate than two existing relevance feedback algorithms. Experimental results demonstrate the effectiveness of the proposed framework.

Capturing patient experience: a qualitative study of implementing real-time feedback in primary care

PubMed Central

Carter, Mary; Davey, Antoinette; Wright, Christine; Elmore, Natasha; Newbould, Jenny; Roland, Martin; Campbell, John; Burt, Jenni

2016-01-01

Background In recent years, hospitals have made use of new technologies, such as real-time feedback, to collect patient experience information. This approach is currently rarely used in primary care settings, but may provide practices with a useful tool that enables them to take prompt, focused action to improve their services. Aim To identify the factors inhibiting and enabling the implementation of real-time feedback in general practices. Design and setting Qualitative study embedded within an exploratory trial (July 2014 to February 2015) of a real-time feedback intervention targeting patient experience in general practices in south-west England and Cambridgeshire. Method Semi-structured interviews (n = 22) and focus groups (n = 4, total of 28 attendees) with practice staff were audiorecorded, transcribed, and analysed thematically, using a framework based on constructs from normalisation process theory. Results Staff engagement with real-time feedback varied considerably, and staff made sense of real-time feedback by comparing it with more familiar feedback modalities. Effective within-team communication was associated with positive attitudes towards real-time feedback. Timing of requests for feedback was important in relation to patient engagement. Real-time feedback may offer potential as a means of informing practice development, perhaps as a component of a wider programme of capturing and responding to patients’ comments. Conclusion Successful implementation of real-time feedback requires effective communication across the practice team to engender thorough engagement. Feedback processes should be carefully introduced to fit with existing patient and practice routines. Future studies should consider making real-time feedback content relevant to specific practice needs, and support participation by all patient groups. PMID:27621292

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

PubMed

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

2015-06-01

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

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

PubMed

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

2016-07-01

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

A 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.

The Additive Impact of Group and Individual Publicly Displayed Feedback: Examining Individual Response Patterns and Response Generalization in a Safe-Driving Occupational Intervention

ERIC Educational Resources Information Center

Ludwig, Timothy D.; Geller, E. Scott; Clarke, Steven W.

2010-01-01

Additive effects of publicly posting individual feedback following group goal-setting and feedback were evaluated. The turn-signal use of pizza deliverers was studied in a multiple baseline design across two pizza stores. After baseline observations, pizza deliverers voted on a group turn-signal goal and then received 4 weeks of group feedback on…

Guidelines: the do's, don'ts and don't knows of feedback for clinical education.

PubMed

Lefroy, Janet; Watling, Chris; Teunissen, Pim W; Brand, Paul

2015-12-01

The guidelines offered in this paper aim to amalgamate the literature on formative feedback into practical Do's, Don'ts and Don't Knows for individual clinical supervisors and for the institutions that support clinical learning. The authors built consensus by an iterative process. Do's and Don'ts were proposed based on authors' individual teaching experience and awareness of the literature, and the amalgamated set of guidelines were then refined by all authors and the evidence was summarized for each guideline. Don't Knows were identified as being important questions to this international group of educators which if answered would change practice. The criteria for inclusion of evidence for these guidelines were not those of a systematic review, so indicators of strength of these recommendations were developed which combine the evidence with the authors' consensus. A set of 32 Do and Don't guidelines with the important Don't Knows was compiled along with a summary of the evidence for each. These are divided into guidelines for the individual clinical supervisor giving feedback to their trainee (recommendations about both the process and the content of feedback) and guidelines for the learning culture (what elements of learning culture support the exchange of meaningful feedback, and what elements constrain it?) Feedback is not easy to get right, but it is essential to learning in medicine, and there is a wealth of evidence supporting the Do's and warning against the Don'ts. Further research into the critical Don't Knows of feedback is required. A new definition is offered: Helpful feedback is a supportive conversation that clarifies the trainee's awareness of their developing competencies, enhances their self-efficacy for making progress, challenges them to set objectives for improvement, and facilitates their development of strategies to enable that improvement to occur.

A vertex detector for SLD

NASA Astrophysics Data System (ADS)

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

1989-03-01

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

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

A Goal-Setting and Feedback Intervention to Increase ID-Checking Behavior: An Assessment of Social Validity and Behavioral Impact

ERIC Educational Resources Information Center

Downing, Christopher O., Jr.; Geller, E. Scott

2012-01-01

A participative goal-setting and feedback intervention increased cashiers' identification-checking behavior at a large grocery store. The cashiers' identification-checking percentages increased from 0.2% at baseline to 9.7% during the intervention phase and then declined to 2.3% during withdrawal. At the control store, the percentages of…

Using Goal Setting, Task Clarification, and Feedback to Increase the Use of the Hands-Free Technique by Hospital Operating Room Staff

ERIC Educational Resources Information Center

Cunningham, Thomas R.; Austin, John

2007-01-01

We evaluated the effects of a behavioral treatment on the safe passing of sharp instruments using the hands-free technique among hospital operating room personnel during surgical procedures. Treatment consisted of participative goal setting, task clarification, and feedback. The average percentage of sharp instruments passed safely increased from…

The benefits of computer-generated feedback for mathematics problem solving.

PubMed

Fyfe, Emily R; Rittle-Johnson, Bethany

2016-07-01

The goal of the current research was to better understand when and why feedback has positive effects on learning and to identify features of feedback that may improve its efficacy. In a randomized experiment, second-grade children received instruction on a correct problem-solving strategy and then solved a set of relevant problems. Children were assigned to receive no feedback, immediate feedback, or summative feedback from the computer. On a posttest the following day, feedback resulted in higher scores relative to no feedback for children who started with low prior knowledge. Immediate feedback was particularly effective, facilitating mastery of the material for children with both low and high prior knowledge. Results suggest that minimal computer-generated feedback can be a powerful form of guidance during problem solving. Copyright © 2016 Elsevier Inc. All rights reserved.

Managing Residential Electricity Demand Through Provision of Better Feedback

NASA Astrophysics Data System (ADS)

Collins, Myles

New and affordable technology for providing detailed feedback on household electricity usage presents a host of opportunities for utilities and policy-makers to manage demand. This dissertation examines ways to use these devices to reduce - and shift the timing of - energy use in the residential sector by influencing consumers' behavior. The first portion of the study analyzes the impact of programmable thermostats (PTs) on energy use, focusing on residents' knowledge of climate control settings in the dwelling. I found that of households with natural gas heating systems, young households with PTs used 17 percent less heating energy on average. In addition, residents who did not know their thermostat settings tended to use 10 percent more energy for heating. The main portion of the dissertation focuses specifically on the potential for better feedback on electricity usage to reduce household energy consumption. The existing literature suggests that feedback can reduce electricity consumption in homes by 5 to 20 percent, but that significant uncertainties remain in our knowledge of the effectiveness of feedback. These uncertainties include the variation in feedback effectiveness between demographic groups and consumers in different climate regions. This analysis uses these uncertainties to perform an exploratory analysis to determine the conditions under which the benefits of feedback outweigh the costs and to compare the cost-effectiveness of providing feedback against that of other DSM programs. I found that benefits would likely outweigh costs for enhanced monthly billing and real-time feedback and that cost-effectiveness was superior to that of other DSM programs for these types of feedback. For feedback that is disaggregated by appliance type, cost effectiveness was competitive with other DSM programs under a limited set of cases. This study also examines how energy consumption devices should display feedback on GHG emissions from electricity use under a real-time pricing program. I found that load-shifting can cause GHG emissions to increase or decrease depending on region and season and in no discernable pattern. Therefore, feedback may be more useful and comprehensible to households in the form of total GHG emissions attributable to electricity usage instead of the emission rate of the marginal power plant. Finally, this dissertation explores ways to maximize the effect of feedback by evaluating which appliances may be best suited for appliance-specific feedback. Due to the energy use and behavioral factors associated with each appliance, the most promising appliances were those that heat water for taps, showers, hot tubs, and waterbeds.

Effects of Performance Feedback on Typing Speed and Accuracy

ERIC Educational Resources Information Center

Tittelbach, Danielle; Fields, Lanny; Alvero, Alicia M.

2008-01-01

Performance feedback is one of the most widely used tools in organizational settings. To date, little research has been conducted focusing on comparisons of the differential effects of the sources, frequency, or media used for feedback on both the quality and quantity of performance. This research investigated the effects of different feedback…

Is Positive Feedback a Forgotten Classroom Practice? Findings and Implications for At-Risk Students

ERIC Educational Resources Information Center

Sprouls, Katie; Mathur, Sarup R.; Upreti, Gita

2015-01-01

Although using higher rates of positive to negative feedback is one best practice often recommended to teachers, particularly when it comes to students experiencing behavioral problems in classroom settings, research on the use of positive feedback in classroom teaching practice has revealed inconsistent results. Research has documented…

Using Video Feedback to Improve Horseback-Riding Skills

ERIC Educational Resources Information Center

Kelley, Heather; Miltenberger, Raymond G.

2016-01-01

This study used video feedback to improve the horseback-riding skills of advanced beginning riders. We focused on 3 skill sets: those used in jumping over obstacles, dressage riding on the flat, and jumping position riding on the flat. Baseline consisted of standard lesson procedures. Intervention consisted of video feedback in which a recorded…

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.

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

Reducing wait time in a hospital pharmacy to promote customer service.

PubMed

Slowiak, Julie M; Huitema, Bradley E; Dickinson, Alyce M

2008-01-01

The purpose of this study was to compare the effects of 2 different interventions on wait times at a hospital outpatient pharmacy: (1) giving feedback to employees about customer satisfaction with wait times and (2) giving a combined intervention package that included giving more specific feedback about actual wait times and goal setting for wait time reduction in addition to the customer satisfaction feedback. The relationship between customer satisfaction ratings and wait times was examined to determine whether wait times affected customer service satisfaction. Participants were 10 employees (4 pharmacists and 6 technicians) of an outpatient pharmacy. Wait times and customer satisfaction ratings were collected for "waiting customers." An ABCBA' within-subjects design was used to assess the effects of the interventions on both wait time and customer satisfaction, where A was the baseline (no feedback and no goal setting); B was the customer satisfaction feedback; C was the customer satisfaction feedback, the wait time feedback, and the goal setting for wait time reduction; and A' was a follow-up condition that was similar to the original baseline condition. Wait times were reduced by approximately 20%, and there was concomitant increased shift in levels of customer satisfaction, as indicated by the correlation between these variables (r = -0.57 and P < .05). Given the current prescription-filling process, we do not expect that major, additional reductions in wait times could be produced. Many variables may account for the variability in any individual customer's wait time. Data from this study may provide useful preliminary benchmarking data for standard pharmacy wait times.

Feedback-Equivalence of Nonlinear Systems with Applications to Power System Equations.

NASA Astrophysics Data System (ADS)

Marino, Riccardo

The key concept of the dissertation is feedback equivalence among systems affine in control. Feedback equivalence to linear systems in Brunovsky canonical form and the construction of the corresponding feedback transformation are used to: (i) design a nonlinear regulator for a detailed nonlinear model of a synchronous generator connected to an infinite bus; (ii) establish which power system network structures enjoy the feedback linearizability property and design a stabilizing control law for these networks with a constraint on the control space which comes from the use of d.c. lines. It is also shown that the feedback linearizability property allows the use of state feedback to contruct a linear controllable system with a positive definite linear Hamiltonian structure for the uncontrolled part if the state space is even; a stabilizing control law is derived for such systems. Feedback linearizability property is characterized by the involutivity of certain nested distributions for strongly accessible analytic systems; if the system is defined on a manifold M diffeomorphic to the Euclidean space, it is established that the set where the property holds is a submanifold open and dense in M. If an analytic output map is defined, a set of nested involutive distributions can be always defined and that allows the introduction of an observability property which is the dual concept, in some sense, to feedback linearizability: the goal is to investigate when a nonlinear system affine in control with an analytic output map is feedback equivalent to a linear controllable and observable system. Finally a nested involutive structure of distributions is shown to guarantee the existence of a state feedback that takes a nonlinear system affine in control to a single input one, both feedback equivalent to linear controllable systems, preserving one controlled vector field.

Participative versus assigned production standard setting in a repetitive industrial task: a strategy for improving worker productivity.

PubMed

Das, B; Shikdar, A A

1999-01-01

The participative standard with feedback condition was superior to the assigned difficult (140% of normal) standard with feedback condition in terms of worker productivity. The percentage increase in worker productivity with the participative standard and feedback condition was 46%, whereas the increase in the assigned difficult standard with feedback was 23%, compared to the control group (no standard, no feedback). Worker productivity also improved significantly as a result of assigning a normal (100%) production standard with feedback, compared to the control group, and the increase was 12%. The participative standard with feedback condition emerges as the optimum strategy for improving worker productivity in a repetitive industrial production task.

Feedback Blunting: Total Sleep Deprivation Impairs Decision Making that Requires Updating Based on Feedback.

PubMed

Whitney, Paul; Hinson, John M; Jackson, Melinda L; Van Dongen, Hans P A

2015-05-01

To better understand the sometimes catastrophic effects of sleep loss on naturalistic decision making, we investigated effects of sleep deprivation on decision making in a reversal learning paradigm requiring acquisition and updating of information based on outcome feedback. Subjects were randomized to a sleep deprivation or control condition, with performance testing at baseline, after 2 nights of total sleep deprivation (or rested control), and following 2 nights of recovery sleep. Subjects performed a decision task involving initial learning of go and no go response sets followed by unannounced reversal of contingencies, requiring use of outcome feedback for decisions. A working memory scanning task and psychomotor vigilance test were also administered. Six consecutive days and nights in a controlled laboratory environment with continuous behavioral monitoring. Twenty-six subjects (22-40 y of age; 10 women). Thirteen subjects were randomized to a 62-h total sleep deprivation condition; the others were controls. Unlike controls, sleep deprived subjects had difficulty with initial learning of go and no go stimuli sets and had profound impairment adapting to reversal. Skin conductance responses to outcome feedback were diminished, indicating blunted affective reactions to feedback accompanying sleep deprivation. Working memory scanning performance was not significantly affected by sleep deprivation. And although sleep deprived subjects showed expected attentional lapses, these could not account for impairments in reversal learning decision making. Sleep deprivation is particularly problematic for decision making involving uncertainty and unexpected change. Blunted reactions to feedback while sleep deprived underlie failures to adapt to uncertainty and changing contingencies. Thus, an error may register, but with diminished effect because of reduced affective valence of the feedback or because the feedback is not cognitively bound with the choice. This has important implications for understanding and managing sleep loss-induced cognitive impairment in emergency response, disaster management, military operations, and other dynamic real-world settings with uncertain outcomes and imperfect information. © 2015 Associated Professional Sleep Societies, LLC.

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

PubMed

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

2017-10-01

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

Video Feedback in the Classroom: Development of an Easy-to-Use Learning Environment

ERIC Educational Resources Information Center

De Poorter, John; De Jaegher, Lut; De Cock, Mieke; Neuttiens, Tom

2007-01-01

Video feedback offers great potential for use in teaching but the relative complexity of the normal set-up of a video camera, a special tripod and a monitor has limited its use in teaching. The authors have developed a computer-webcam set-up which simplifies this. Anyone with an ordinary computer and webcam can learn to control the video feedback…

Realizing actual feedback control of complex network

NASA Astrophysics Data System (ADS)

Tu, Chengyi; Cheng, Yuhua

2014-06-01

In this paper, we present the concept of feedbackability and how to identify the Minimum Feedbackability Set of an arbitrary complex directed network. Furthermore, we design an estimator and a feedback controller accessing one MFS to realize actual feedback control, i.e. control the system to our desired state according to the estimated system internal state from the output of estimator. Last but not least, we perform numerical simulations of a small linear time-invariant dynamics network and a real simple food network to verify the theoretical results. The framework presented here could make an arbitrary complex directed network realize actual feedback control and deepen our understanding of complex systems.

Structured Feedback Training for Time-Out: Efficacy and Efficiency in Comparison to a Didactic Method.

PubMed

Jensen, Scott A; Blumberg, Sean; Browning, Megan

2017-09-01

Although time-out has been demonstrated to be effective across multiple settings, little research exists on effective methods for training others to implement time-out. The present set of studies is an exploratory analysis of a structured feedback method for training time-out using repeated role-plays. The three studies examined (a) a between-subjects comparison to more a traditional didactic/video modeling method of time-out training, (b) a within-subjects comparison to traditional didactic/video modeling training for another skill, and (c) the impact of structured feedback training on in-home time-out implementation. Though findings are only preliminary and more research is needed, the structured feedback method appears across studies to be an efficient, effective method that demonstrates good maintenance of skill up to 3 months post training. Findings suggest, though do not confirm, a benefit of the structured feedback method over a more traditional didactic/video training model. Implications and further research on the method are discussed.

New formulae for Zagreb indices

NASA Astrophysics Data System (ADS)

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

2017-07-01

In this paper, we study with some graph descriptors also called topological indices. These descriptors are useful in determination of some properties of chemical structures and preferred to some earlier descriptors as they are more practical. Especially the first and second Zagreb indices together with the first and second multiplicative Zagreb indices are considered and they are calculated in terms of the smallest and largest vertex degrees and vertex number for some well-known classes of graphs.

Comparing Internet Probing Methodologies Through an Analysis of Large Dynamic Graphs

DTIC Science & Technology

2014-06-01

comparable Internet topologies in less time. We compare these by modeling union of traceroute outputs as graphs, and using standard graph theoretical...topologies in less time. We compare these by modeling union of traceroute outputs as graphs, and using standard graph theoretical measurements as well...We compare these by modeling union of traceroute outputs as graphs, and study the graphs by using vertex and edge count, average vertex degree

R matrices of three-state Hamiltonians solvable by coordinate Bethe ansatz

NASA Astrophysics Data System (ADS)

Fonseca, T.; Frappat, L.; Ragoucy, E.

2015-01-01

We review some of the strategies that can be implemented to infer an R-matrix from the knowledge of its Hamiltonian. We apply them to the classification achieved in Crampé, Frappat, and Ragoucy, J. Phys. A 46, 405001 (2013), on three state U(1)-invariant Hamiltonians solvable by coordinate Bethe ansatz, focusing on models for which the S-matrix is not trivial. For the 19-vertex solutions, we recover the R-matrices of the well-known Zamolodchikov-Fateev and Izergin-Korepin models. We point out that the generalized Bariev Hamiltonian is related to both main and special branches studied by Martins in Nucl. Phys. B 874, 243 (2013), that we prove to generate the same Hamiltonian. The 19-vertex SpR model still resists to the analysis, although we are able to state some no-go theorems on its R-matrix. For 17-vertex Hamiltonians, we produce a new R-matrix.

Active Vertex Model for cell-resolution description of epithelial tissue mechanics

PubMed Central

Barton, Daniel L.; Henkes, Silke

2017-01-01

We introduce an Active Vertex Model (AVM) for cell-resolution studies of the mechanics of confluent epithelial tissues consisting of tens of thousands of cells, with a level of detail inaccessible to similar methods. The AVM combines the Vertex Model for confluent epithelial tissues with active matter dynamics. This introduces a natural description of the cell motion and accounts for motion patterns observed on multiple scales. Furthermore, cell contacts are generated dynamically from positions of cell centres. This not only enables efficient numerical implementation, but provides a natural description of the T1 transition events responsible for local tissue rearrangements. The AVM also includes cell alignment, cell-specific mechanical properties, cell growth, division and apoptosis. In addition, the AVM introduces a flexible, dynamically changing boundary of the epithelial sheet allowing for studies of phenomena such as the fingering instability or wound healing. We illustrate these capabilities with a number of case studies. PMID:28665934

Effect of anomalous tbW vertex on decay-lepton distributions in e+ e-® tt(bar) and CP-violating asymmetries

NASA Astrophysics Data System (ADS)

Rindani, Saurabh D.

2000-06-01

We obtain analytic expressions for the energy and polar-angle double differential distributions of a secondary lepton l+(l-) arising from the decay of t (tbar) in with an anomalous tbW decay vertex. We also obtain analytic expressions for the various differential cross-sections with the lepton energy integrated over. In this case, we find that the angular distributions of the secondary lepton do not depend on the anomalous coupling in the decay, regardless of possible anomalous couplings occurring in the production amplitude for . Our study includes the effect of longitudinal e- and e+ beam polarization. We also study the lepton energy and beam polarization dependence of certain CP-violating lepton angular asymmetries arising from an anomalous tbW decay vertex and compare them with the asymmetries arising due to CP-violation in the production process due to the top electric or weak dipole moment.

Multifractal cross-correlation effects in two-variable time series of complex network vertex observables

NASA Astrophysics Data System (ADS)

OświÈ©cimka, Paweł; Livi, Lorenzo; DroŻdŻ, Stanisław

2016-10-01

We investigate the scaling of the cross-correlations calculated for two-variable time series containing vertex properties in the context of complex networks. Time series of such observables are obtained by means of stationary, unbiased random walks. We consider three vertex properties that provide, respectively, short-, medium-, and long-range information regarding the topological role of vertices in a given network. In order to reveal the relation between these quantities, we applied the multifractal cross-correlation analysis technique, which provides information about the nonlinear effects in coupling of time series. We show that the considered network models are characterized by unique multifractal properties of the cross-correlation. In particular, it is possible to distinguish between Erdös-Rényi, Barabási-Albert, and Watts-Strogatz networks on the basis of fractal cross-correlation. Moreover, the analysis of protein contact networks reveals characteristics shared with both scale-free and small-world models.

Active Vertex Model for cell-resolution description of epithelial tissue mechanics.

PubMed

Barton, Daniel L; Henkes, Silke; Weijer, Cornelis J; Sknepnek, Rastko

2017-06-01

We introduce an Active Vertex Model (AVM) for cell-resolution studies of the mechanics of confluent epithelial tissues consisting of tens of thousands of cells, with a level of detail inaccessible to similar methods. The AVM combines the Vertex Model for confluent epithelial tissues with active matter dynamics. This introduces a natural description of the cell motion and accounts for motion patterns observed on multiple scales. Furthermore, cell contacts are generated dynamically from positions of cell centres. This not only enables efficient numerical implementation, but provides a natural description of the T1 transition events responsible for local tissue rearrangements. The AVM also includes cell alignment, cell-specific mechanical properties, cell growth, division and apoptosis. In addition, the AVM introduces a flexible, dynamically changing boundary of the epithelial sheet allowing for studies of phenomena such as the fingering instability or wound healing. We illustrate these capabilities with a number of case studies.

Constant Communities in Complex Networks

NASA Astrophysics Data System (ADS)

Chakraborty, Tanmoy; Srinivasan, Sriram; Ganguly, Niloy; Bhowmick, Sanjukta; Mukherjee, Animesh

2013-05-01

Identifying community structure is a fundamental problem in network analysis. Most community detection algorithms are based on optimizing a combinatorial parameter, for example modularity. This optimization is generally NP-hard, thus merely changing the vertex order can alter their assignments to the community. However, there has been less study on how vertex ordering influences the results of the community detection algorithms. Here we identify and study the properties of invariant groups of vertices (constant communities) whose assignment to communities are, quite remarkably, not affected by vertex ordering. The percentage of constant communities can vary across different applications and based on empirical results we propose metrics to evaluate these communities. Using constant communities as a pre-processing step, one can significantly reduce the variation of the results. Finally, we present a case study on phoneme network and illustrate that constant communities, quite strikingly, form the core functional units of the larger communities.

Toward Personal and Emotional Connectivity in Mobile Higher Education through Asynchronous Formative Audio Feedback

ERIC Educational Resources Information Center

Rasi, Päivi; Vuojärvi, Hanna

2018-01-01

This study aims to develop asynchronous formative audio feedback practices for mobile learning in higher education settings. The development was conducted in keeping with the principles of design-based research. The research activities focused on an inter-university online course, within which the use of instructor audio feedback was tested,…

Effects of Feedback on Achievement Goals and Perceived Motivational Climate in Physical Education

ERIC Educational Resources Information Center

Erturan-Ilker, Gökçe

2014-01-01

The aim of the study is to determine the effects of teacher's positive and negative feedback on high school students' perceived motivational climate and achievement goals in a physical education setting. Forty seven ninth grade students participated in the study. The design was a 2 x 2 between subjects factorial crossing feedback condition…

The Benefits of Computer-Generated Feedback for Mathematics Problem Solving

ERIC Educational Resources Information Center

Fyfe, Emily R.; Rittle-Johnson, Bethany

2016-01-01

The goal of the current research was to better understand when and why feedback has positive effects on learning and to identify features of feedback that may improve its efficacy. In a randomized experiment, second-grade children (N = 75) received instruction on a correct problem-solving strategy and then solved a set of relevant problems.…

Medical student perspective: working toward specific and actionable clinical clerkship feedback.

PubMed

Moss, Haley A; Derman, Peter B; Clement, R Carter

2012-01-01

Feedback on the wards is an important component of medical student education. Medical schools have incorporated formalized feedback mechanisms such as clinical encounter cards and standardized patient encounters into clinical curricula. However, the system could be further improved as medical students frequently feel uncomfortable requesting feedback, and are often dissatisfied with the quality of the feedback they receive. This article explores the shortcomings of the existing medical student feedback system and examines the relevant literature in an effort to shed light on areas in which the system can be enhanced. The discussion focuses on resident-provided feedback but is broadly applicable to delivering feedback in general. A review of the organizational psychology and business administration literature on fostering effective feedback was performed. These insights were then applied to the setting of medical education. Providing effective feedback requires training and forethought. Feedback itself should be specific and actionable. Utilizing these strategies will help medical students and educators get the most out of existing feedback systems.

Augmented Hebbian reweighting accounts for accuracy and induced bias in perceptual learning with reverse feedback

PubMed Central

Liu, Jiajuan; Dosher, Barbara Anne; Lu, Zhong-Lin

2015-01-01

Using an asymmetrical set of vernier stimuli (−15″, −10″, −5″, +10″, +15″) together with reverse feedback on the small subthreshold offset stimulus (−5″) induces response bias in performance (Aberg & Herzog, 2012; Herzog, Eward, Hermens, & Fahle, 2006; Herzog & Fahle, 1999). These conditions are of interest for testing models of perceptual learning because the world does not always present balanced stimulus frequencies or accurate feedback. Here we provide a comprehensive model for the complex set of asymmetric training results using the augmented Hebbian reweighting model (Liu, Dosher, & Lu, 2014; Petrov, Dosher, & Lu, 2005, 2006) and the multilocation integrated reweighting theory (Dosher, Jeter, Liu, & Lu, 2013). The augmented Hebbian learning algorithm incorporates trial-by-trial feedback, when present, as another input to the decision unit and uses the observer's internal response to update the weights otherwise; block feedback alters the weights on bias correction (Liu et al., 2014). Asymmetric training with reversed feedback incorporates biases into the weights between representation and decision. The model correctly predicts the basic induction effect, its dependence on trial-by-trial feedback, and the specificity of bias to stimulus orientation and spatial location, extending the range of augmented Hebbian reweighting accounts of perceptual learning. PMID:26418382

Augmented Hebbian reweighting accounts for accuracy and induced bias in perceptual learning with reverse feedback.

PubMed

Liu, Jiajuan; Dosher, Barbara Anne; Lu, Zhong-Lin

2015-01-01

Using an asymmetrical set of vernier stimuli (-15″, -10″, -5″, +10″, +15″) together with reverse feedback on the small subthreshold offset stimulus (-5″) induces response bias in performance (Aberg & Herzog, 2012; Herzog, Eward, Hermens, & Fahle, 2006; Herzog & Fahle, 1999). These conditions are of interest for testing models of perceptual learning because the world does not always present balanced stimulus frequencies or accurate feedback. Here we provide a comprehensive model for the complex set of asymmetric training results using the augmented Hebbian reweighting model (Liu, Dosher, & Lu, 2014; Petrov, Dosher, & Lu, 2005, 2006) and the multilocation integrated reweighting theory (Dosher, Jeter, Liu, & Lu, 2013). The augmented Hebbian learning algorithm incorporates trial-by-trial feedback, when present, as another input to the decision unit and uses the observer's internal response to update the weights otherwise; block feedback alters the weights on bias correction (Liu et al., 2014). Asymmetric training with reversed feedback incorporates biases into the weights between representation and decision. The model correctly predicts the basic induction effect, its dependence on trial-by-trial feedback, and the specificity of bias to stimulus orientation and spatial location, extending the range of augmented Hebbian reweighting accounts of perceptual learning.

Soliton cellular automaton associated with Dn(1)-crystal B2,s

NASA Astrophysics Data System (ADS)

Misra, Kailash C.; Wilson, Evan A.

2013-04-01

A solvable vertex model in ferromagnetic regime gives rise to a soliton cellular automaton which is a discrete dynamical system in which site variables take on values in a finite set. We study the scattering of a class of soliton cellular automata associated with the U_q(D_n^{(1)})-perfect crystal B2, s. We calculate the combinatorial R matrix for all elements of B2, s ⊗ B2, 1. In particular, we show that the scattering rule for our soliton cellular automaton can be identified with the combinatorial R matrix for U_q(A_1^{(1)}) oplus U_q(D_{n-2}^{(1)})-crystals.

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.

Smart building temperature control using occupant feedback

NASA Astrophysics Data System (ADS)

Gupta, Santosh K.

This work was motivated by the problem of computing optimal commonly-agreeable thermal settings in spaces with multiple occupants. In this work we propose algorithms that take into account each occupant's preferences along with the thermal correlations between different zones in a building, to arrive at optimal thermal settings for all zones of the building in a coordinated manner. In the first part of this work we incorporate active occupant feedback to minimize aggregate user discomfort and total energy cost. User feedback is used to estimate the users comfort range, taking into account possible inaccuracies in the feedback. The control algorithm takes the energy cost into account, trading it off optimally with the aggregate user discomfort. A lumped heat transfer model based on thermal resistance and capacitance is used to model a multi-zone building. We provide a stability analysis and establish convergence of the proposed solution to a desired temperature that minimizes the sum of energy cost and aggregate user discomfort. However, for convergence to the optimal, sufficient separation between the user feedback frequency and the dynamics of the system is necessary; otherwise, the user feedback provided do not correctly reflect the effect of current control input value on user discomfort. The algorithm is further extended using singular perturbation theory to determine the minimum time between successive user feedback solicitations. Under sufficient time scale separation, we establish convergence of the proposed solution. Simulation study and experimental runs on the Watervliet based test facility demonstrates performance of the algorithm. In the second part we develop a consensus algorithm for attaining a common temperature set-point that is agreeable to all occupants of a zone in a typical multi-occupant space. The information on the comfort range functions is indeed held privately by each occupant. Using occupant differentiated dynamically adjusted prices as feedback signals, we propose a distributed solution, which ensures that a consensus is attained among all occupants upon convergence, irrespective of their temperature preferences being in coherence or conflicting. Occupants are only assumed to be rational, in that they choose their own temperature set-points so as to minimize their individual energy cost plus discomfort. We use Alternating Direction Method of Multipliers ( ADMM) to solve our consensus problem. We further establish the convergence of the proposed algorithm to the optimal thermal set point values that minimize the sum of the energy cost and the aggregate discomfort of all occupants in a multi-zone building. For simulating our consensus algorithm we use realistic building parameters based on the Watervliet test facility. The simulation study based on real world building parameters establish the validity of our theoretical model and provide insights on the dynamics of the system with a mobile user population. In the third part we present a game-theoretic (auction) mechanism, that requires occupants to "purchase" their individualized comfort levels beyond what is provided by default by the building operator. The comfort pricing policy, derived as an extension of Vickrey-Clarke-Groves (VCG) pricing, ensures incentive-compatibility of the mechanism, i.e., an occupant acting in self-interest cannot benefit from declaring their comfort function untruthfully, irrespective of the choices made by other occupants. The declared (or estimated) occupant comfort ranges (functions) are then utilized by the building operator---along with the energy cost information---to set the environment controls to optimally balance the aggregate discomfort of the occupants and the energy cost of the building operator. We use realistic building model and parameters based on our test facility to demonstrate the convergence of the actual temperatures in different zones to the desired temperatures, and provide insight to the pricing structure necessary for truthful comfort feedback from the occupants. Finally, we present an end-to-end framework designed for enabling occupant feedback collection and incorporating the feedback data towards energy efficient operation of a building. We have designed a mobile application that occupants can use on their smart phones to provide their thermal preference feedback. When relaying the occupant feedback to the central server the mobile application also uses indoor localization techniques to tie the occupant preference to their current thermal zone. Texas Instruments sensortags are used for real time zonal temperature readings. The mobile application relays the occupant preference along with the location to a central server that also hosts our learning algorithm to learn the environment and using occupant feedback calculates the optimal temperature set point. The entire process is triggered upon change of occupancy, environmental conditions, and or occupant preference. The learning algorithm is scheduled to run at regular intervals to respond dynamically to environmental and occupancy changes. We describe results from experimental studies in two different settings: a single family residential home setting and in a university based laboratory space setting. (Abstract shortened by UMI.).

Visual feedback attenuates mean concentric barbell velocity loss, and improves motivation, competitiveness, and perceived workload in male adolescent athletes.

PubMed

Weakley, Jonathon Js; Wilson, Kyle M; Till, Kevin; Read, Dale B; Darrall-Jones, Joshua; Roe, Gregory; Phibbs, Padraic J; Jones, Ben

2017-07-12

It is unknown whether instantaneous visual feedback of resistance training outcomes can enhance barbell velocity in younger athletes. Therefore, the purpose of this study was to quantify the effects of visual feedback on mean concentric barbell velocity in the back squat, and to identify changes in motivation, competitiveness, and perceived workload. In a randomised-crossover design (Feedback vs. Control) feedback of mean concentric barbell velocity was or was not provided throughout a set of 10 repetitions in the barbell back squat. Magnitude-based inferences were used to assess changes between conditions, with almost certainly greater differences in mean concentric velocity between the Feedback (0.70 ±0.04 m·s) and Control (0.65 ±0.05 m·s) observed. Additionally, individual repetition mean concentric velocity ranged from possibly (repetition number two: 0.79 ±0.04 vs. 0.78 ±0.04 m·s) to almost certainly (repetition number 10: 0.58 ±0.05 vs. 0.49 ±0.05 m·s) greater when provided feedback, while almost certain differences were observed in motivation, competitiveness, and perceived workload, respectively. Providing adolescent male athletes with visual kinematic information while completing resistance training is beneficial for the maintenance of barbell velocity during a training set, potentially enhancing physical performance. Moreover, these improvements were observed alongside increases in motivation, competitiveness and perceived workload providing insight into the underlying mechanisms responsible for the performance gains observed. Given the observed maintenance of barbell velocity during a training set, practitioners can use this technique to manipulate training outcomes during resistance training.

ATLAS: Airborne Tunable Laser Absorption Spectrometer for stratospheric trace gas measurements

NASA Technical Reports Server (NTRS)

Loewenstein, Max; Podolske, James R.; Strahan, Susan E.

1990-01-01

The ATLAS instrument is an advanced technology diode laser based absorption spectrometer designed specifically for stratospheric tracer studies. This technique was used in the acquisition of N2O tracer data sets on the Airborne Antarctic Ozone Experiment and the Airborne Arctic Stratospheric Expedition. These data sets have proved valuable for comparison with atmospheric models, as well as in assisting in the interpretation of the entire ensemble of chemical and meteorological data acquired on these two field studies. The N2O dynamical tracer data set analysis revealed several ramifications concerning the polar atmosphere: the N2O/NO(y) correlation, which is used as a tool to study denitrification in the polar vertex; the N2O Southern Hemisphere morphology, showing subsidence in the winter polar vortex; and the value of the N2O measurements in the interpretation of ClO, O3, and NO(y) measurements and of the derived dynamical tracer, potential vorticity. Field studies also led to improved characterization of the instrument and to improved accuracy.

Coordinated Platoon Routing in a Metropolitan Network

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

Larson, Jeffrey; Munson, Todd; Sokolov, Vadim

2016-10-10

Platooning vehicles—connected and automated vehicles traveling with small intervehicle distances—use less fuel because of reduced aerodynamic drag. Given a network de- fined by vertex and edge sets and a set of vehicles with origin/destination nodes/times, we model and solve the combinatorial optimization problem of coordinated routing of vehicles in a manner that routes them to their destination on time while using the least amount of fuel. Common approaches decompose the platoon coordination and vehicle routing into separate problems. Our model addresses both problems simultaneously to obtain the best solution. We use modern modeling techniques and constraints implied from analyzing themore » platoon routing problem to address larger numbers of vehicles and larger networks than previously considered. While the numerical method used is unable to certify optimality for candidate solutions to all networks and parameters considered, we obtain excellent solutions in approximately one minute for much larger networks and vehicle sets than previously considered in the literature.« less

Underwater (UW) Unexploded Ordnance (UXO) Multi-Sensor Data Base (MSDB) Collection

DTIC Science & Technology

2009-07-01

11 FIGURE 6 RTG SENSOR. FOUR SENSOR TRIADS ARE SHOWN, EACH WITH A 3-AXIS FLUXGATE MAGNETOMETER ...used by RTG to measure the gradients. Each triad includes a 3-axis fluxgate magnetometer and a set of feedback coils. The outputs of three triad...each with a 3-axis fluxgate magnetometer (internal, not clearly visible) and a set of 3 feedback coils. The upper triad 3-axis magnetometer

Formative Peer Assessment in Primary School: The Effects of Involving Pupils in Setting Assessment Criteria on Their Appraisal and Feedback Style

ERIC Educational Resources Information Center

Leenknecht, Martijn J. M.; Prins, Frans J.

2018-01-01

This experimental study is aimed at examining the effect of involving pupils in primary education in setting assessment criteria and standards on their appraisal of a peer's work and their peer feedback style. It is expected that our intervention will lead to (1) a criteria-referenced appraisal and (2) more final vocabulary, which is associated…

Feedback and rewards part III: commitment, goals, compensation, and job changes.

PubMed

Harolds, Jay A

2013-03-01

Formal and informal feedback is important to improve the performance, skill sets, commitment, accountability, and morale of the person being evaluated. Feedback can help people achieve their goals. Feedback is a basis for changes in compensation and other rewards. Formal reviews can also be the foundation for job changes. The latter includes promotions, lateral moves that are a better fit or will help the individual have new experiences or achieve new areas of proficiency, or finding opportunities to work outside the organization.

Audit and Feedback: A Quality Improvement Study to Increase Pneumococcal Vaccination Rates.

PubMed

Clark, Rebecca Culver; Carter, Kimberly Ferren; Jackson, Julie; Hodges, Deborah

The purpose of this quality improvement study was to explore the impact of audit and feedback on the pneumococcal immunization rate for at-risk adults in ambulatory settings. Study findings support the hypothesis that timely, individualized audit and feedback can have a positive impact on immunization rate; generalized feedback that did not provide actionable information did not have the same impact. The difference between the interventions was significant, χ (1, N = 1993) = 124.7, P <.001.

Study for online range monitoring with the interaction vertex imaging method.

PubMed

Finck, Ch; Karakaya, Y; Reithinger, V; Rescigno, R; Baudot, J; Constanzo, J; Juliani, D; Krimmer, J; Rinaldi, I; Rousseau, M; Testa, E; Vanstalle, M; Ray, C

2017-11-21

Ion beam therapy enables a highly accurate dose conformation delivery to the tumor due to the finite range of charged ions in matter (i.e. Bragg peak (BP)). Consequently, the dose profile is very sensitive to patients anatomical changes as well as minor mispositioning, and so it requires improved dose control techniques. Proton interaction vertex imaging (IVI) could offer an online range control in carbon ion therapy. In this paper, a statistical method was used to study the sensitivity of the IVI technique on experimental data obtained from the Heidelberg Ion-Beam Therapy Center. The vertices of secondary protons were reconstructed with pixelized silicon detectors. The statistical study used the [Formula: see text] test of the reconstructed vertex distributions for a given displacement of the BP position as a function of the impinging carbon ions. Different phantom configurations were used with or without bone equivalent tissue and air inserts. The inflection points in the fall-off region of the longitudinal vertex distribution were computed using different methods, while the relation with the BP position was established. In the present setup, the resolution of the BP position was about 4-5 mm in the homogeneous phantom under clinical conditions (10 6 incident carbon ions). Our results show that the IVI method could therefore monitor the BP position with a promising resolution in clinical conditions.

Clinical outcomes after external cephalic version with spinal anesthesia after failure of a first attempt without anesthesia.

PubMed

Massalha, Manal; Garmi, Gali; Zafran, Noah; Carmeli, Julia; Gimburg, Genady; Salim, Raed

2017-12-01

To determine whether repeat external cephalic version (ECV) with spinal anesthesia affects clinical outcomes and cesarean delivery rates. A retrospective study was conducted using data collected at one hospital in Israel between January 1, 2009, and December 31, 2015. Women with non-vertex singleton pregnancies (≥37 weeks) who had a failed ECV attempt without spinal anesthesia were included in the analysis. All women were offered a repeat ECV with spinal anesthesia. Outcomes assessed were rates of vertex presentation at delivery, successful repeat ECV, and cesarean delivery. Overall, 145 of 213 ECV attempts without spinal anesthesia were successful. Of the 68 women with a failed attempt, 5 (7%) experienced spontaneous version and 18 (26%) delivered at another institution or went into spontaneous labor. Among the remaining 45 women, 28 (62%) agreed to a repeat ECV with spinal anesthesia; 11 (39%) of these procedures were successful. All 11 women experienced vertex presentation at delivery versus none of the 17 women who refused repeat ECV (P=0.003). The cesarean delivery rate was 64% (18/28) versus 100% (17/17), respectively (P=0.007). Repeat ECV with spinal anesthesia after a failed first attempt without spinal anesthesia increased vertex presentation at birth and decreased the rate of cesarean delivery. © 2017 International Federation of Gynecology and Obstetrics.

Study for online range monitoring with the interaction vertex imaging method

NASA Astrophysics Data System (ADS)

Finck, Ch; Karakaya, Y.; Reithinger, V.; Rescigno, R.; Baudot, J.; Constanzo, J.; Juliani, D.; Krimmer, J.; Rinaldi, I.; Rousseau, M.; Testa, E.; Vanstalle, M.; Ray, C.

2017-12-01

Ion beam therapy enables a highly accurate dose conformation delivery to the tumor due to the finite range of charged ions in matter (i.e. Bragg peak (BP)). Consequently, the dose profile is very sensitive to patients anatomical changes as well as minor mispositioning, and so it requires improved dose control techniques. Proton interaction vertex imaging (IVI) could offer an online range control in carbon ion therapy. In this paper, a statistical method was used to study the sensitivity of the IVI technique on experimental data obtained from the Heidelberg Ion-Beam Therapy Center. The vertices of secondary protons were reconstructed with pixelized silicon detectors. The statistical study used the χ2 test of the reconstructed vertex distributions for a given displacement of the BP position as a function of the impinging carbon ions. Different phantom configurations were used with or without bone equivalent tissue and air inserts. The inflection points in the fall-off region of the longitudinal vertex distribution were computed using different methods, while the relation with the BP position was established. In the present setup, the resolution of the BP position was about 4-5 mm in the homogeneous phantom under clinical conditions (106 incident carbon ions). Our results show that the IVI method could therefore monitor the BP position with a promising resolution in clinical conditions.

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.

The Value of Adding Ambient Energy Feedback to Conservation Tips and Goal-Setting in a Dormitory

ERIC Educational Resources Information Center

Karp, Abigail; McCauley, Michelle; Byrne, Jack

2016-01-01

Purpose: The majority of research on energy feedback has been conducted in residential households; in this study, the authors aim to examine the effectiveness of similar initiatives in a college environment. The our goal was to see how much additional electricity savings could be induced using feedback beyond average savings achieved by…

"Now You Know What You're Doing Right and Wrong!" Peer Feedback Quality in Synchronous Peer Assessment in Secondary Education

ERIC Educational Resources Information Center

Rotsaert, Tijs; Panadero, Ernesto; Schellens, Tammy; Raes, Annelies

2018-01-01

This study explores the effects of peer assessment (PA) practice on peer feedback (PF) quality of 11th grade secondary education students (N = 36). The PA setting was synchronous: anonymous assessors gave immediate PF using mobile response technology during 10 feedback occasions. The design was quasi-experimental (experimental vs. control…

The Effects of Performance Feedback and Social Reinforcement on Up-Selling at Fast-Food Restaurants

ERIC Educational Resources Information Center

Wiesman, Daryl W.

2006-01-01

The present study sought to evaluate the effects of feedback and positive social reinforcement on the performance of restaurant drive-thru window order-takers in asking customers to "upsize" their order at a specific prompt. A multiple baseline across settings was followed by the introduction of an intervention of weekly performance feedback and…

What Supervisors Say in Their Feedback: Construction of CanMEDS Roles in Workplace Settings

ERIC Educational Resources Information Center

Renting, Nienke; Dornan, Tim; Gans, Rijk O. B.; Borleffs, Jan C. C.; Cohen-Schotanus, Janke; Jaarsma, A. Debbie C.

2016-01-01

The CanMEDS framework has been widely adopted in residency education and feedback processes are guided by it. It is, however, only one of many influences on what is actually discussed in feedback. The sociohistorical culture of medicine and individual supervisors' contexts, experiences and beliefs are also influential. Our aim was to find how…

The Timing of Feedback on Mathematics Problem Solving in a Classroom Setting

ERIC Educational Resources Information Center

Fyfe, Emily R.; Rittle-Johnson, Bethany

2015-01-01

Feedback is a ubiquitous learning tool that is theorized to help learners detect and correct their errors. The goal of this study was to examine the effects of feedback in a classroom context for children solving math equivalence problems (problems with operations on both sides of the equal sign). The authors worked with children in 7 second-grade…

Corrective Feedback and Student Uptakes in English Immersion Classrooms in Japan: Is the Counter-Balance Hypothesis Valid?

ERIC Educational Resources Information Center

Sakurai, Shogo

2014-01-01

There are a number of studies on teachers' corrective feedback and students' uptakes in immersion settings, but the majority is carried out in the North American context. Based on limited data, "the counter­-balance hypothesis" was proposed by Lyster and Mori (2006) to explain distributions of teacher feedback and students' uptakes in…

Improving emergency physician performance using audit and feedback: a systematic review.

PubMed

Le Grand Rogers, R; Narvaez, Yizza; Venkatesh, Arjun K; Fleischman, William; Hall, M Kennedy; Taylor, R Andrew; Hersey, Denise; Sette, Lynn; Melnick, Edward R

2015-10-01

Audit and feedback can decrease variation and improve the quality of care in a variety of health care settings. There is a growing literature on audit and feedback in the emergency department (ED) setting. Because most studies have been small and not focused on a single clinical process, systematic assessment could determine the effectiveness of audit and feedback interventions in the ED and which specific characteristics improve the quality of emergency care. The objective of the study is to assess the effect of audit and feedback on emergency physician performance and identify features critical to success. We adhered to the PRISMA statement to conduct a systematic review of the literature from January 1994 to January 2014 related to audit and feedback of physicians in the ED. We searched Medline, EMBASE, PsycINFO, and PubMed databases. We included studies that were conducted in the ED and reported quantitative outcomes with interventions using both audit and feedback. For included studies, 2 reviewers independently assessed methodological quality using the validated Downs and Black checklist for nonrandomized studies. Treatment effect and heterogeneity were to be reported via meta-analysis and the I2 inconsistency index. The search yielded 4332 articles, all of which underwent title review; 780 abstracts and 131 full-text articles were reviewed. Of these, 24 studies met inclusion criteria with an average Downs and Black score of 15.6 of 30 (range, 6-22). Improved performance was reported in 23 of the 24 studies. Six studies reported sufficient outcome data to conduct summary analysis. Pooled data from studies that included 41,124 patients yielded an average treatment effect among physicians of 36% (SD, 16%) with high heterogeneity (I2=83%). The literature on audit and feedback in the ED reports positive results for interventions across numerous clinical conditions but without standardized reporting sufficient for meta-analysis. Characteristics of audit and feedback interventions that were used in a majority of studies were feedback that targeted errors of omission and that was explicit with measurable instruction and a plan for change delivered in the clinical setting greater than 1 week after the audited performance using a combination of media and types at both the individual and group levels. Future work should use standardized reporting to identify the specific aspects of audit or feedback that drive effectiveness in the ED. Copyright © 2015 Elsevier Inc. All rights reserved.

A m-ary linear feedback shift register with binary logic

NASA Technical Reports Server (NTRS)

Perlman, M. (Inventor)

1973-01-01

A family of m-ary linear feedback shift registers with binary logic is disclosed. Each m-ary linear feedback shift register with binary logic generates a binary representation of a nonbinary recurring sequence, producible with a m-ary linear feedback shift register without binary logic in which m is greater than 2. The state table of a m-ary linear feedback shift register without binary logic, utilizing sum modulo m feedback, is first tubulated for a given initial state. The entries in the state table are coded in binary and the binary entries are used to set the initial states of the stages of a plurality of binary shift registers. A single feedback logic unit is employed which provides a separate feedback binary digit to each binary register as a function of the states of corresponding stages of the binary registers.

The modification of hybrid method of ant colony optimization, particle swarm optimization and 3-OPT algorithm in traveling salesman problem

NASA Astrophysics Data System (ADS)

Hertono, G. F.; Ubadah; Handari, B. D.

2018-03-01

The traveling salesman problem (TSP) is a famous problem in finding the shortest tour to visit every vertex exactly once, except the first vertex, given a set of vertices. This paper discusses three modification methods to solve TSP by combining Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO) and 3-Opt Algorithm. The ACO is used to find the solution of TSP, in which the PSO is implemented to find the best value of parameters α and β that are used in ACO.In order to reduce the total of tour length from the feasible solution obtained by ACO, then the 3-Opt will be used. In the first modification, the 3-Opt is used to reduce the total tour length from the feasible solutions obtained at each iteration, meanwhile, as the second modification, 3-Opt is used to reduce the total tour length from the entire solution obtained at every iteration. In the third modification, 3-Opt is used to reduce the total tour length from different solutions obtained at each iteration. Results are tested using 6 benchmark problems taken from TSPLIB by calculating the relative error to the best known solution as well as the running time. Among those modifications, only the second and third modification give satisfactory results except the second one needs more execution time compare to the third modifications.

Estimation of the refractive index of rigid contact lenses on the basis of back vertex power measurements.

PubMed

Pearson, Richard

2011-03-01

To assess the possibility of estimating the refractive index of rigid contact lenses on the basis of measurements of their back vertex power (BVP) in air and when immersed in liquid. First, a spreadsheet model was used to quantify the magnitude of errors arising from simulated inaccuracies in the variables required to calculate refractive index. Then, refractive index was calculated from in-air and in-liquid measurements of BVP of 21 lenses that had been made in three negative BVPs from materials with seven different nominal refractive index values. The power measurements were made by two operators on two occasions. Intraobserver reliability showed a mean difference of 0.0033±0.0061 (t = 0.544, P = 0.59), interobserver reliability showed a mean difference of 0.0043±0.0061 (t = 0.707, P = 0.48), and the mean difference between the nominal and calculated refractive index values was -0.0010±0.0111 (t = -0.093, P = 0.93). The spreadsheet prediction that low-powered lenses might be subject to greater errors in the calculated values of refractive index was substantiated by the experimental results. This method shows good intra and interobserver reliabilities and can be used easily in a clinical setting to provide an estimate of the refractive index of rigid contact lenses having a BVP of 3 D or more.

Do my peers approve? Interest in injunctive norms feedback delivered online to college student drinkers.

PubMed

Merrill, Jennifer E; Miller, Mary Beth; Balestrieri, Sara G; Carey, Kate B

2016-07-01

Injunctive norms feedback is promising but understudied as a component of college drinking interventions. The aim of the present study was to demonstrate acceptability of injunctive norms feedback delivered to college drinkers via the web. We examined subjective interest in information reflecting peer approval of four sets of drinking behaviors and outcomes, and correlates of interest in the normative feedback. A sample of 221 young adults enrolled in a 2- or 4-year college or university (ages 18-25 years; 52% female) completed online surveys in which they were asked to rate their interest in each of 11 injunctive norms statements. Participants were randomly assigned to one of four sets of statements regarding peer approval of (a) intoxicated behaviors, (b) safe drinking strategies, (c) drinking-related consequences, and (d) drinking behaviors of potential partners. All items were framed to reflect disapproval of risky behaviors and approval of protective behaviors. Across norm sets, participants found the items to be moderately interesting and interest ratings did not differ across sets. Higher scores on the Alcohol Use Disorders Identification Test (AUDIT), stronger perceived approval of drinking in general (injunctive norms), stronger perceptions of drinking among peers (descriptive norms), and female gender were bivariately correlated with more interest. In a multiple regression, female gender, higher AUDIT (consequence subscale), and stronger general drinking injunctive norms remained significantly associated with interest in the pro-moderation statements. An important future direction is to determine whether the presentation of specific types of injunctive norms feedback can result in downward changes in drinking behavior. Copyright © 2016 Elsevier Ltd. All rights reserved.

Doctors' engagements with patient experience surveys in primary and secondary care: a qualitative study.

PubMed

Farrington, Conor; Burt, Jenni; Boiko, Olga; Campbell, John; Roland, Martin

2017-06-01

Patient experience surveys are increasingly important in the measurement of, and attempts to improve, health-care quality. To date, little research has focused upon doctors' attitudes to surveys which give them personalized feedback. This paper explores doctors' perceptions of patient experience surveys in primary and secondary care settings in order to deepen understandings of how doctors view the plausibility of such surveys. We conducted a qualitative study with doctors in two regions of England, involving in-depth semi-structured interviews with doctors working in primary care (n = 21) and secondary care (n = 20) settings. The doctors in both settings had recently received individualized feedback from patient experience surveys. Doctors in both settings express strong personal commitments to incorporating patient feedback in quality improvement efforts. However, they also concurrently express strong negative views about the credibility of survey findings and patients' motivations and competence in providing feedback. Thus, individual doctors demonstrate contradictory views regarding the plausibility of patient surveys, leading to complex, varied and on balance negative engagements with patient feedback. Doctors' contradictory views towards patient experience surveys are likely to limit the impact of such surveys in quality improvement initiatives in primary and secondary care. We highlight the need for 'sensegiving' initiatives (i.e. attempts to influence perceptions by communicating particular ideas, narratives and visions) to engage with doctors regarding the plausibility of patient experience surveys. This study highlights the importance of engaging with doctors' views about patient experience surveys when developing quality improvement initiatives. © 2016 The Authors. Health Expectations Published by John Wiley & Sons Ltd.

Cessation of oscillations in a chemo-mechanical oscillator

NASA Astrophysics Data System (ADS)

Phogat, Richa; Tiwari, Ishant; Kumar, Pawan; Rivera, Marco; Parmananda, Punit

2018-06-01

In this paper, different methods for cessation of oscillations in a chemo-mechanical oscillator [mercury beating heart (MBH)] are presented. The first set of experiments were carried out on a single MBH oscillator. To achieve cessation of oscillations, two protocols, namely, inverted feedback and delayed feedback were employed. In the second set of experiments, two quasi-identical MBH oscillators are considered. They are first synchronized via a bidirectional attractive coupling. These two synchronized oscillators are thereafter coupled with a unidirectional repulsive coupling and the system dynamics were observed. Subsequently, in the next protocol, the effect of a unidirectional delay coupling on the two synchronized oscillators was explored. The cessation of oscillations in all the above experimental setups was observed as the feedback/coupling was switched on at a suitable strength. Oscillatory dynamics of the system were restored when the feedback/coupling was switched off.

Decentralized Feedback Controllers for Exponential Stabilization of Hybrid Periodic Orbits: Application to Robotic Walking.

PubMed

Hamed, Kaveh Akbari; Gregg, Robert D

2016-07-01

This paper presents a systematic algorithm to design time-invariant decentralized feedback controllers to exponentially stabilize periodic orbits for a class of hybrid dynamical systems arising from bipedal walking. The algorithm assumes a class of parameterized and nonlinear decentralized feedback controllers which coordinate lower-dimensional hybrid subsystems based on a common phasing variable. The exponential stabilization problem is translated into an iterative sequence of optimization problems involving bilinear and linear matrix inequalities, which can be easily solved with available software packages. A set of sufficient conditions for the convergence of the iterative algorithm to a stabilizing decentralized feedback control solution is presented. The power of the algorithm is demonstrated by designing a set of local nonlinear controllers that cooperatively produce stable walking for a 3D autonomous biped with 9 degrees of freedom, 3 degrees of underactuation, and a decentralization scheme motivated by amputee locomotion with a transpelvic prosthetic leg.

Decentralized Feedback Controllers for Exponential Stabilization of Hybrid Periodic Orbits: Application to Robotic Walking*

PubMed Central

Hamed, Kaveh Akbari; Gregg, Robert D.

2016-01-01

This paper presents a systematic algorithm to design time-invariant decentralized feedback controllers to exponentially stabilize periodic orbits for a class of hybrid dynamical systems arising from bipedal walking. The algorithm assumes a class of parameterized and nonlinear decentralized feedback controllers which coordinate lower-dimensional hybrid subsystems based on a common phasing variable. The exponential stabilization problem is translated into an iterative sequence of optimization problems involving bilinear and linear matrix inequalities, which can be easily solved with available software packages. A set of sufficient conditions for the convergence of the iterative algorithm to a stabilizing decentralized feedback control solution is presented. The power of the algorithm is demonstrated by designing a set of local nonlinear controllers that cooperatively produce stable walking for a 3D autonomous biped with 9 degrees of freedom, 3 degrees of underactuation, and a decentralization scheme motivated by amputee locomotion with a transpelvic prosthetic leg. PMID:27990059

A Staff-Training Program to Increase Spontaneous Vocal Requests in Children With Autism

PubMed Central

Karp, Rebecca

2013-01-01

This study evaluated a staff-training and feedback program to increase (a) staff use of naturalistic language training techniques, and (b) child production of spontaneous vocal requests in a school setting for young children with autism. Training was conducted in integrated preschool centers and in an art group. The results revealed that the training and feedback procedure was successful in increasing staff use of naturalistic language training techniques. Further, these increased strategies were associated with corresponding increases in spontaneous vocal requests for all children during embedded training and ongoing feedback conditions. In addition, probes collected by an unobtrusive observer revealed durability of child requesting when staff feedback was discontinued. Social validity measures from front-line staff regarding the intervention revealed positive ratings. The results are discussed in relation to the continued search for effective service-delivery systems to improve communication for children with autism in the public school setting. PMID:27999635

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

Intelligent shell feedback control in EXTRAP T2R reversed field pinch with partial coverage of the toroidal surface by a discrete active coil array

NASA Astrophysics Data System (ADS)

Yadikin, D.; Brunsell, P. R.; Drake, J. R.

2006-01-01

An active feedback system is required for long pulse operation of the reversed field pinch (RFP) device to suppress resistive wall modes (RWMs). A general feature of a feedback system using a discrete active coil array is a coupling effect which arises when a set of side band modes determined by the number of active coils is produced. Recent results obtained on the EXTRAP T2R RFP demonstrated the suppression of independent m = 1 RWMs using an active feedback system with a two-dimensional array of discrete active coils in the poloidal and toroidal directions. One of the feedback algorithms used is the intelligent shell feedback scheme. Active feedback systems having different number of active coils in the poloidal (Mc) and toroidal (Nc) directions (Mc × Nc = 2 × 32 and Mc × Nc = 4 × 16) are studied. Different side band effects are seen for these configurations. A significant prolongation of the plasma discharge is achieved for the intelligent shell feedback scheme using the 2 × 32 active coil configuration. This is attributed to the side band sets including only one of the dominant unstable RWMs and avoiding coupling to resonant modes. Analog proportional-integral-derivative controllers are used in the feedback system. Regimes with different values of the proportional gain are studied. The requirement of the proportional-integral control for low proportional gain and proportional-derivative control for high proportional gain is seen in the experiments.

Mining Specific and General Features in Both Positive and Negative Relevance Feedback. QUT E-Discovery Lab at the TREC󈧍 Relevance Feedback Track

DTIC Science & Technology

2009-11-01

relevance feedback algo- rithm. Four methods, εMap [1], MapA , P10A, and StatAP [2], were used in the track to measure the performance of Phase 2 runs...εMap and StatAP were applied to the runs us- ing the testing set of only ClueWeb09 Category-B, whereas MapA and P10A were applied to those using the...whole ClueWeb09 English set. Because our experiments were based on only ClueWeb09 Category-B, measuring our per- formance by MapA and P10A might not

Feedback, the various tasks of the doctor, and the feedforward alternative.

PubMed

Kluger, Avraham N; Van Dijk, Dina

2010-12-01

This study aims to alert users of feedback to its dangers, explain some of its complexities and offer the feedforward alternative. We review the damage that feedback may cause to both motivation and performance. We provide an initial solution to the puzzle of the feedback sign (positive versus negative) using the concepts of promotion focus and prevention focus. We discuss additional open questions pertaining to feedback sign and consider implications for health care systems. Feedback that threatens the self is likely to debilitate recipients and, on average, positive and negative feedback are similar in their effects on performance. Positive feedback contributes to motivation and performance under promotion focus, but the same is true for negative feedback under prevention focus. We offer an alternative to feedback--the feedforward interview--and describe a brief protocol and suggestions on how it might be used in medical education. Feedback is a double-edged sword; its effective application includes careful consideration of regulatory focus and of threats to the self. Feedforward may be a good substitute for feedback in many settings. © Blackwell Publishing Ltd 2010.

Antimicrobial Stewardship Program Implementation of a Quality Improvement Intervention Using Real-Time Feedback and an Electronic Order Set for the Management of Staphylococcus aureus Bacteremia.

PubMed

Rosa, Rossana; Zavala, Bruno; Cain, Natalie; Anjan, Shweta; Aragon, Laura; Abbo, Lilian M

2018-03-01

Antimicrobial stewardship programs can optimize the management of Staphylococcus aureus bacteremia by integrating information technology and microbiology laboratory resources. This study describes our experience implementing an intervention consisting of real-time feedback and the use of an electronic order set for the management of S. aureus bacteremia. Infect Control Hosp Epidemiol 2018;39:346-349.

Role of combined tactile and kinesthetic feedback in minimally invasive surgery.

PubMed

Lim, Soo-Chul; Lee, Hyung-Kew; Park, Joonah

2014-10-18

Haptic feedback is of critical importance in surgical tasks. However, conventional surgical robots do not provide haptic feedback to surgeons during surgery. Thus, in this study, a combined tactile and kinesthetic feedback system was developed to provide haptic feedback to surgeons during robotic surgery. To assess haptic feasibility, the effects of two types of haptic feedback were examined empirically - kinesthetic and tactile feedback - to measure object-pulling force with a telesurgery robotics system at two desired pulling forces (1 N and 2 N). Participants answered a set of questionnaires after experiments. The experimental results reveal reductions in force error (39.1% and 40.9%) when using haptic feedback during 1 N and 2 N pulling tasks. Moreover, survey analyses show the effectiveness of the haptic feedback during teleoperation. The combined tactile and kinesthetic feedback of the master device in robotic surgery improves the surgeon's ability to control the interaction force applied to the tissue. Copyright © 2014 John Wiley & Sons, Ltd. Copyright © 2014 John Wiley & Sons, Ltd.

Alternator control for battery charging

DOEpatents

Brunstetter, Craig A.; Jaye, John R.; Tallarek, Glen E.; Adams, Joseph B.

2015-07-14

In accordance with an aspect of the present disclosure, an electrical system for an automotive vehicle has an electrical generating machine and a battery. A set point voltage, which sets an output voltage of the electrical generating machine, is set by an electronic control unit (ECU). The ECU selects one of a plurality of control modes for controlling the alternator based on an operating state of the vehicle as determined from vehicle operating parameters. The ECU selects a range for the set point voltage based on the selected control mode and then sets the set point voltage within the range based on feedback parameters for that control mode. In an aspect, the control modes include a trickle charge mode and battery charge current is the feedback parameter and the ECU controls the set point voltage within the range to maintain a predetermined battery charge current.

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.

Phase separation in the six-vertex model with a variety of boundary conditions

NASA Astrophysics Data System (ADS)

Lyberg, I.; Korepin, V.; Ribeiro, G. A. P.; Viti, J.

2018-05-01

We present numerical results for the six-vertex model with a variety of boundary conditions. Adapting an algorithm for domain wall boundary conditions, proposed in the work of Allison and Reshetikhin [Ann. Inst. Fourier 55(6), 1847-1869 (2005)], we examine some modifications of these boundary conditions. To be precise, we discuss partial domain wall boundary conditions, reflecting ends, and half turn boundary conditions (domain wall boundary conditions with half turn symmetry). Dedicated to the memory of Ludwig Faddeev

Effective-range parameters and vertex constants for Λ-nuclear systems

NASA Astrophysics Data System (ADS)

Rakityansky, S. A.; Gopane, I. M.

For a wide range of the core-nuclei (6 ≤ A ≤ 207), the scattering lengths, effective radii, and the other effective-range parameters (up to the order ˜ k8) for the angular momentum ℓ = 0, 1, 2 are calculated within a two-body ΛA-model. For the same hypernuclear systems, the S-matrix residues as well as the corresponding Nuclear-Vertex and Asymptotic-Normalization constants (NVC’s and ANC’s) for the bound states are also found.

Extending the Riemann-Solver-Free High-Order Space-Time Discontinuous Galerkin Cell Vertex Scheme (DG-CVS) to Solve Compressible Magnetohydrodynamics Equations

DTIC Science & Technology

2016-06-08

forces. Plasmas in hypersonic and astrophysical flows are one of the most typical examples of such conductive fluids. Though MHD models are a low...remain powerful tools in helping researchers to understand the complex physical processes in the geospace environment. For example, the ideal MHD...vertex level within each physical time step. For this reason and the method’s DG ingredient, the method was named as the space-time discontinuous Galerkin

Topological vertex formalism with O5-plane

NASA Astrophysics Data System (ADS)

Kim, Sung-Soo; Yagi, Futoshi

2018-01-01

We propose a new topological vertex formalism for a type IIB (p ,q ) 5-brane web with an O5-plane. We apply our proposal to five-dimensional N =1 Sp(1) gauge theory with Nf=0 , 1, 8 flavors to compute the topological string partition functions and check the agreement with the known results. Especially for the Nf=8 case, which corresponds to E-string theory on a circle, we obtain a new, yet simple, expression of the partition function with a two Young diagram sum.

Multiloop Functional Renormalization Group That Sums Up All Parquet Diagrams

NASA Astrophysics Data System (ADS)

Kugler, Fabian B.; von Delft, Jan

2018-02-01

We present a multiloop flow equation for the four-point vertex in the functional renormalization group (FRG) framework. The multiloop flow consists of successive one-loop calculations and sums up all parquet diagrams to arbitrary order. This provides substantial improvement of FRG computations for the four-point vertex and, consequently, the self-energy. Using the x-ray-edge singularity as an example, we show that solving the multiloop FRG flow is equivalent to solving the (first-order) parquet equations and illustrate this with numerical results.

The Pastoral Potential of Audio Feedback: A Review of the Literature

ERIC Educational Resources Information Center

Dixon, Stephen

2015-01-01

This paper surveys the literature on the use of audio feedback in higher education, where assignment feedback is sent as a recorded mp3 to students. Findings from the literature are set in the context of considerable changes to the HE sector over the last 20 years, including increased class sizes and less face-to-face contact between staff and…

Feedback, Goal Setting, and Incentives Effects on Organizational Productivity.

DTIC Science & Technology

1987-06-01

frequency of feedback (Chobbar & Wallin, 1984; Ivancevich , Donnelly, & Lyon , 1970). Greller (1975) focused on the sources of feedback in organizations...of ApDlied Psychalody, 0(4), 349-371. Ivancevich , J.M., Donnelly, J.N., & Lyon , J.L. (1970). A study of the impact of management by objectives on...Dockstader, Nebeker, & Shumate, 1977; Ilgen, Fisher, & Taylor, 1979; Ivancevich & McMahon, 1982; Pnitchard, Bigby, Beiting, Coverdale, & Morgan, 1981

The Effectiveness of Instructor Personalized and Formative Feedback Provided by Instructor in an Online Setting: Some Unresolved Issues

ERIC Educational Resources Information Center

Planar, Dolors; Moya, Soledad

2016-01-01

Formative feedback has great potential for teaching and learning in online undergraduate programmes. There is a large number of courses where the main source of feedback is provided by the instructor. This is particularly seen in subjects where assessments are designed based on specific activities which are the same for all students, and where the…

Teleoperation of steerable flexible needles by combining kinesthetic and vibratory feedback.

PubMed

Pacchierotti, Claudio; Abayazid, Momen; Misra, Sarthak; Prattichizzo, Domenico

2014-01-01

Needle insertion in soft-tissue is a minimally invasive surgical procedure that demands high accuracy. In this respect, robotic systems with autonomous control algorithms have been exploited as the main tool to achieve high accuracy and reliability. However, for reasons of safety and responsibility, autonomous robotic control is often not desirable. Therefore, it is necessary to focus also on techniques enabling clinicians to directly control the motion of the surgical tools. In this work, we address that challenge and present a novel teleoperated robotic system able to steer flexible needles. The proposed system tracks the position of the needle using an ultrasound imaging system and computes needle's ideal position and orientation to reach a given target. The master haptic interface then provides the clinician with mixed kinesthetic-vibratory navigation cues to guide the needle toward the computed ideal position and orientation. Twenty participants carried out an experiment of teleoperated needle insertion into a soft-tissue phantom, considering four different experimental conditions. Participants were provided with either mixed kinesthetic-vibratory feedback or mixed kinesthetic-visual feedback. Moreover, we considered two different ways of computing ideal position and orientation of the needle: with or without set-points. Vibratory feedback was found more effective than visual feedback in conveying navigation cues, with a mean targeting error of 0.72 mm when using set-points, and of 1.10 mm without set-points.

A Comparison of Performance Feedback Procedures on Teachers' Treatment Implementation Integrity and Students' Inappropriate Behavior in Special Education Classrooms

PubMed Central

DiGennaro, Florence D; Martens, Brian K; Kleinmann, Ava E

2007-01-01

This study examined the extent to which treatment integrity of 4 special education teachers was affected by goal setting, performance feedback regarding student or teacher performance, and a meeting cancellation contingency. Teachers were trained to implement function-based treatment packages to address student problem behavior. In one condition, teachers set a goal for student behavior and received daily written feedback about student performance. In a second condition, teachers received daily written feedback about student performance as well as their own accuracy in implementing the intervention and would be able to avoid meeting with a consultant to practice missed steps by implementing the intervention with 100% integrity. This latter package increased treatment integrity the most above baseline levels. Higher levels of treatment integrity were significantly correlated with lower levels of student problem behavior for 3 of the 4 teacher–student dyads. Three of the 4 teachers also rated both feedback procedures as highly acceptable. Implications for increasing and maintaining treatment integrity by teachers via a consultation model are discussed. PMID:17970259

Biocybernetic system evaluates indices of operator engagement in automated task

NASA Technical Reports Server (NTRS)

Pope, A. T.; Bogart, E. H.; Bartolome, D. S.

1995-01-01

A biocybernetic system has been developed as a method to evaluate automated flight deck concepts for compatibility with human capabilities. A biocybernetic loop is formed by adjusting the mode of operation of a task set (e.g., manual/automated mix) based on electroencephalographic (EEG) signals reflecting an operator's engagement in the task set. A critical issue for the loop operation is the selection of features of the EEG to provide an index of engagement upon which to base decisions to adjust task mode. Subjects were run in the closed-loop feedback configuration under four candidate and three experimental control definitions of an engagement index. The temporal patterning of system mode switching was observed for both positive and negative feedback of the index. The indices were judged on the basis of their relative strength in exhibiting expected feedback control system phenomena (stable operation under negative feedback and unstable operation under positive feedback). Of the candidate indices evaluated in this study, an index constructed according to the formula, beta power/(alpha power + theta power), reflected task engagement best.

Data for Improvement and Clinical Excellence: a report of an interrupted time series trial of feedback in home care.

PubMed

Fraser, Kimberly D; Sales, Anne E; Baylon, Melba Andrea B; Schalm, Corinne; Miklavcic, John J

2017-05-18

There is substantial evidence about the effectiveness of audit with feedback, but none that we know have been conducted in home care settings. The primary purpose of the Data for Improvement and Clinical Excellence - Home Care (DICE-HC) project was to evaluate the effects of an audit and feedback delivered to care providers on home care client outcomes. The objective of this paper is to report the effects of feedback on four specific quality indicators: pain, falls, delirium, and hospital visits. A 10-month audit with feedback intervention study was conducted with care providers in seven home care offices in Alberta, Canada, which involved delivery of four quarterly feedback reports consisting of data derived from the Resident Assessment Instrument - Home Care (RAI-HC). The primary evaluation employed an interrupted time series design using segmented regression analysis to assess the effects of feedback reporting on the four quality indicators: pain, falls, delirium, and hospitalization. Changes in level and trend of the quality indicators were measured before, during, and after the implementation of feedback reports. Pressure ulcer reporting was analyzed as a comparator condition not included in the feedback report. Care providers were surveyed on responses to feedback reporting which informed a process evaluation. At initiation of feedback report implementation, the percentage of clients reporting pain and falls significantly increased. Though the percentage of clients reporting pain and falls tended to increase and reporting of delirium and hospital visits tended to decrease relative to the pre-intervention period, there was no significant effect of feedback reporting on quality indicators during the 10-month intervention. The percentage of clients reporting falls, delirium, and hospital visits significantly increased in the 6-month period following feedback reporting relative to the intervention period. About 50% of the care providers that read and understand the feedback reports found the reports useful to make changes to the way clients are cared for. Routinely collected data used over time for feedback is feasible in home care settings. A high proportion of care providers find feedback reports useful for informing how they care for clients. Since reporting on the frequency of quality indicators increased in the post-intervention period, this study suggests that ongoing use of audit with feedback to enhance health outcomes in home care may promote improved reporting on standardized instruments.

L(2,1)-Labeling of the Strong Product of Paths and Cycles

PubMed Central

2014-01-01

An L(2,1)-labeling of a graph G = (V, E) is a function f from the vertex set V(G) to the set of nonnegative integers such that the labels on adjacent vertices differ by at least two and the labels on vertices at distance two differ by at least one. The span of f is the difference between the largest and the smallest numbers in f(V). The λ-number of G, denoted by λ(G), is the minimum span over all L(2,1)-labelings of G. We consider the λ-number of P n⊠C m and for n ≤ 11 the λ-number of C n⊠C m. We determine λ-numbers of graphs of interest with the exception of a finite number of graphs and we improve the bounds on the λ-number of C n⊠C m, m ≥ 24 and n ≥ 26. PMID:24711734

Performance of Quantum Annealers on Hard Scheduling Problems

NASA Astrophysics Data System (ADS)

Pokharel, Bibek; Venturelli, Davide; Rieffel, Eleanor

Quantum annealers have been employed to attack a variety of optimization problems. We compared the performance of the current D-Wave 2X quantum annealer to that of the previous generation D-Wave Two quantum annealer on scheduling-type planning problems. Further, we compared the effect of different anneal times, embeddings of the logical problem, and different settings of the ferromagnetic coupling JF across the logical vertex-model on the performance of the D-Wave 2X quantum annealer. Our results show that at the best settings, the scaling of expected anneal time to solution for D-WAVE 2X is better than that of the DWave Two, but still inferior to that of state of the art classical solvers on these problems. We discuss the implication of our results for the design and programming of future quantum annealers. Supported by NASA Ames Research Center.

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

Rivasseau, Vincent, E-mail: vincent.rivasseau@th.u-psud.fr, E-mail: adrian.tanasa@ens-lyon.org; Tanasa, Adrian, E-mail: vincent.rivasseau@th.u-psud.fr, E-mail: adrian.tanasa@ens-lyon.org

The Loop Vertex Expansion (LVE) is a quantum field theory (QFT) method which explicitly computes the Borel sum of Feynman perturbation series. This LVE relies in a crucial way on symmetric tree weights which define a measure on the set of spanning trees of any connected graph. In this paper we generalize this method by defining new tree weights. They depend on the choice of a partition of a set of vertices of the graph, and when the partition is non-trivial, they are no longer symmetric under permutation of vertices. Nevertheless we prove they have the required positivity property tomore » lead to a convergent LVE; in fact we formulate this positivity property precisely for the first time. Our generalized tree weights are inspired by the Brydges-Battle-Federbush work on cluster expansions and could be particularly suited to the computation of connected functions in QFT. Several concrete examples are explicitly given.« less

Edge Antimagic Total Labeling on Two Copies of Path

NASA Astrophysics Data System (ADS)

Nurdin; Abrar, A. M.; Bhayangkara, A. R. M.; Muliani; Samsir, A. U.; Nahdi, M. R. An

2018-03-01

A graph G = (V(G), E(G)) denotes the vertex set and the edge set, respectively. A (p,q)-graph G is a graph such that |V(G) | = p and |E(G) | = q. Graph of order p and size q is called (a,d)-edge-anti magic total if there exists a bijection f : V(G) U E(G)→ {1,2,..., p + q} such that the edge weights w(u,v) = f(u) + f(uv) + f(v) form an arithmetic sequence {a, a + d, a + 2d,...,a + (q - 1)d} with the first term a and common difference d. Two copies of path is disjoint union of two path graph with same order (Pn ∪Pn ) denoted by 2Pn . In this paper we construct the (a,d)-edge-anti magic total labeling in two copies of path for some differences d.

On cordial labeling of double duplication for some families of graph

NASA Astrophysics Data System (ADS)

Shobana, L.; Remigius Perpetua Mary, F.

2018-04-01

Let G (V, E) be a simple undirected graph where V,E are its vertex set and edge set respectively. Consider a labeling where f bea function from the vertices of G to {0, 1} and for each edge xy assign the label|f(x)-f(y)|. Then f is called cordial of G if the number of vertices labeled 0 and the number of vertices labeled 1 differs by at most 1 and the number of edges labeled 0 and the number of edges labeled 1 differs by at most 1. In this paper we proved the existence of cordial labeling for double duplication of path graph Pn: n≥2, cycle graph Cn: n≥3 except for n≡2 (mod 4), wheel graph Wn:n≥5 except for n≥3 (mod 4), flower graph Fn: n≥5 and bistar graph Bm,n: m,n≥2.

The challenge of giving written thesis feedback to nursing students.

PubMed

Tuvesson, Hanna; Borglin, Gunilla

2014-11-01

Providing effective written feedback on nursing student's assignments can be a challenging task for any assessor. Additionally, as the student groups tend to become larger, written feedback is likely to gain an overall more prominent position than verbal feedback. Lack of formal training or regular discussion in the teaching faculty about the skill set needed to provide written feedback could negatively affect the students' learning abilities. In this brief paper, we discuss written feedback practices, whilst using the Bachelor of Science in Nursing thesis as an example. Our aim is to highlight the importance of an informed understanding of the impact written feedback can have on students. Creating awareness about this can facilitate the development of more strategic and successful written feedback strategies. We end by offering examples of some relatively simple strategies for improving this practice. Copyright © 2014 Elsevier Ltd. All rights reserved.

Feedback and efficient behavior

PubMed Central

2017-01-01

Feedback is an effective tool for promoting efficient behavior: it enhances individuals’ awareness of choice consequences in complex settings. Our study aims to isolate the mechanisms underlying the effects of feedback on achieving efficient behavior in a controlled environment. We design a laboratory experiment in which individuals are not aware of the consequences of different alternatives and, thus, cannot easily identify the efficient ones. We introduce feedback as a mechanism to enhance the awareness of consequences and to stimulate exploration and search for efficient alternatives. We assess the efficacy of three different types of intervention: provision of social information, manipulation of the frequency, and framing of feedback. We find that feedback is most effective when it is framed in terms of losses, that it reduces efficiency when it includes information about inefficient peers’ behavior, and that a lower frequency of feedback does not disrupt efficiency. By quantifying the effect of different types of feedback, our study suggests useful insights for policymakers. PMID:28430787

Providing feedback following Leadership WalkRounds is associated with better patient safety culture, higher employee engagement and lower burnout

PubMed Central

Sexton, J Bryan; Adair, Kathryn C; Leonard, Michael W; Frankel, Terri Christensen; Proulx, Joshua; Watson, Sam R; Magnus, Brooke; Bogan, Brittany; Jamal, Maleek; Schwendimann, Rene; Frankel, Allan S

2018-01-01

Background There is a poorly understood relationship between Leadership WalkRounds (WR) and domains such as safety culture, employee engagement, burnout and work-life balance. Methods This cross-sectional survey study evaluated associations between receiving feedback about actions taken as a result of WR and healthcare worker assessments of patient safety culture, employee engagement, burnout and work-life balance, across 829 work settings. Results 16 797 of 23 853 administered surveys were returned (70.4%). 5497 (32.7% of total) reported that they had participated in WR, and 4074 (24.3%) reported that they participated in WR with feedback. Work settings reporting more WR with feedback had substantially higher safety culture domain scores (first vs fourth quartile Cohen’s d range: 0.34–0.84; % increase range: 15–27) and significantly higher engagement scores for four of its six domains (first vs fourth quartile Cohen’s d range: 0.02–0.76; % increase range: 0.48–0.70). Conclusion This WR study of patient safety and organisational outcomes tested relationships with a comprehensive set of safety culture and engagement metrics in the largest sample of hospitals and respondents to date. Beyond measuring simply whether WRs occur, we examine WR with feedback, as WR being done well. We suggest that when WRs are conducted, acted on, and the results are fed back to those involved, the work setting is a better place to deliver and receive care as assessed across a broad range of metrics, including teamwork, safety, leadership, growth opportunities, participation in decision-making and the emotional exhaustion component of burnout. Whether WR with feedback is a manifestation of better norms, or a cause of these norms, is unknown, but the link is demonstrably potent. PMID:28993441

Providing feedback following Leadership WalkRounds is associated with better patient safety culture, higher employee engagement and lower burnout.

PubMed

Sexton, J Bryan; Adair, Kathryn C; Leonard, Michael W; Frankel, Terri Christensen; Proulx, Joshua; Watson, Sam R; Magnus, Brooke; Bogan, Brittany; Jamal, Maleek; Schwendimann, Rene; Frankel, Allan S

2018-04-01

There is a poorly understood relationship between Leadership WalkRounds (WR) and domains such as safety culture, employee engagement, burnout and work-life balance. This cross-sectional survey study evaluated associations between receiving feedback about actions taken as a result of WR and healthcare worker assessments of patient safety culture, employee engagement, burnout and work-life balance, across 829 work settings. 16 797 of 23 853 administered surveys were returned (70.4%). 5497 (32.7% of total) reported that they had participated in WR, and 4074 (24.3%) reported that they participated in WR with feedback. Work settings reporting more WR with feedback had substantially higher safety culture domain scores (first vs fourth quartile Cohen's d range: 0.34-0.84; % increase range: 15-27) and significantly higher engagement scores for four of its six domains (first vs fourth quartile Cohen's d range: 0.02-0.76; % increase range: 0.48-0.70). This WR study of patient safety and organisational outcomes tested relationships with a comprehensive set of safety culture and engagement metrics in the largest sample of hospitals and respondents to date. Beyond measuring simply whether WRs occur, we examine WR with feedback, as WR being done well . We suggest that when WRs are conducted, acted on, and the results are fed back to those involved, the work setting is a better place to deliver and receive care as assessed across a broad range of metrics, including teamwork, safety, leadership, growth opportunities, participation in decision-making and the emotional exhaustion component of burnout. Whether WR with feedback is a manifestation of better norms, or a cause of these norms, is unknown, but the link is demonstrably potent. © Article author(s) (or their employer(s) unless otherwise stated in the text of the article) 2018. All rights reserved. No commercial use is permitted unless otherwise expressly granted.

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

Uemura, Sho

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

SPECTRAL STATES OF XTE J1701 - 462: LINK BETWEEN Z AND ATOLL SOURCES

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

Lin Dacheng; Remillard, Ronald A.; Homan, Jeroen

2009-05-10

We have analyzed 866 Rossi X-ray Timing Explorer observations of the 2006-2007 outburst of the accreting neutron star XTE J1701 -462, during which the source evolves from super-Eddington luminosities to quiescence. The X-ray color evolution first resembles the Cyg X-2 subgroup of Z sources, with frequent excursions on the horizontal and normal branches (HB/NB). The source then decays and evolves to the Sco X-1 subgroup, with increasing focus on the flaring branch (FB) and the lower vertex of the 'Z'. Finally, the FB subsides, and the source transforms into an atoll source, with the lower vertex evolving to the atollmore » soft state. Spectral analyses suggest that the atoll stage is characterized by a constant inner disk radius, while the Z stages exhibit a luminosity-dependent expansion of the inner disk, which we interpret as effects related to the local Eddington limit. Contrary to the view that the mass accretion rate m-dot changes along the Z, we find that changes in m-dot are instead responsible for the secular evolution of the Z and the subclasses. Motion along the Z branches appears to be caused by three different mechanisms that may operate at roughly constant m-dot. For the Sco X-1-like Z stage, we find that the FB is an instability track that proceeds off the lower vertex when the inner disk radius shrinks from the value set by the X-ray luminosity toward the value measured for the atoll soft state. Excursions up the NB occur when the apparent size of the boundary layer increases while the disk exhibits little change. The HB is associated with Comptonization of the disk emission. The Z branches for the Cyg X-2-like stage are more complicated, and their origin is unclear. Finally, our spectral results lead us to hypothesize that the lower and upper Z vertices correspond to a standard thin disk and a slim disk, respectively.« less

Studies for a 10 μs, thin, high resolution CMOS pixel sensor for future vertex detectors

NASA Astrophysics Data System (ADS)

Voutsinas, G.; Amar-Youcef, S.; Baudot, J.; Bertolone, G.; Brogna, A.; Chon-Sen, N.; Claus, G.; Colledani, C.; Dorokhov, A.; Dozière, G.; Dulinski, W.; Degerli, Y.; De Masi, R.; Deveaux, M.; Gelin, M.; Goffe, M.; Hu-Guo, Ch.; Himmi, A.; Jaaskelainen, K.; Koziel, M.; Morel, F.; Müntz, C.; Orsini, F.; Santos, C.; Schrader, C.; Specht, M.; Stroth, J.; Valin, I.; Wagner, F. M.; Winter, M.

2011-06-01

Future high energy physics (HEP) experiments require detectors with unprecedented performances for track and vertex reconstruction. These requirements call for high precision sensors, with low material budget and short integration time. The development of CMOS sensors for HEP applications was initiated at IPHC Strasbourg more than 10 years ago, motivated by the needs for vertex detectors at the International Linear Collider (ILC) [R. Turchetta et al, NIM A 458 (2001) 677]. Since then several other applications emerged. The first real scale digital CMOS sensor MIMOSA26 equips Flavour Tracker at RHIC, as well as for the microvertex detector of the CBM experiment at FAIR. MIMOSA sensors may also offer attractive performances for the ALICE upgrade at LHC. This paper will demonstrate the substantial performance improvement of CMOS sensors based on a high resistivity epitaxial layer. First studies for integrating the sensors into a detector system will be addressed and finally the way to go to a 10 μs readout sensor will be discussed.

Testing V-A in Top Decay at CDF at √s = 1.8 TeV

NASA Astrophysics Data System (ADS)

Kilminster, Ben

2004-02-01

The structure of the tbW vertex can be probed by measuring the polarization of the W in t → W + b → l + ν + b. The invariant mass of the the lepton and b quark measures the W decay angle which in turn allows a comparison with polarizations expected from a V-A and V+A tbW vertex. We measure the fraction by rate of Ws produced with a V+A coupling in lieu of the Standard Model V-A to be fV+A = -0.21-0.24+0.42 (stat) ± 0.21 (sys). We assign a limit of fV+A < 0.80 @ 95% CL. By combining this result with a complementary observable in the same data, we assign a limit of fV+A < 0.61 @ 95% CL. From this CDF Run I preliminary result, we find no evidence for a non-standard Model tbW vertex.

Symmetric functions and wavefunctions of XXZ-type six-vertex models and elliptic Felderhof models by Izergin-Korepin analysis

NASA Astrophysics Data System (ADS)

Motegi, Kohei

2018-05-01

We present a method to analyze the wavefunctions of six-vertex models by extending the Izergin-Korepin analysis originally developed for domain wall boundary partition functions. First, we apply the method to the case of the basic wavefunctions of the XXZ-type six-vertex model. By giving the Izergin-Korepin characterization of the wavefunctions, we show that these wavefunctions can be expressed as multiparameter deformations of the quantum group deformed Grothendieck polynomials. As a second example, we show that the Izergin-Korepin analysis is effective for analysis of the wavefunctions for a triangular boundary and present the explicit forms of the symmetric functions representing these wavefunctions. As a third example, we apply the method to the elliptic Felderhof model which is a face-type version and an elliptic extension of the trigonometric Felderhof model. We show that the wavefunctions can be expressed as one-parameter deformations of an elliptic analog of the Vandermonde determinant and elliptic symmetric functions.

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

DOEpatents

Sigler, Robert D.

1978-01-01

An all-reflective optical system for providing illumination of a target focal region at high numerical aperture from a pair of co-axially, confluent collimated light beams. A target cavity is defined by a pair of opposed inner ellipsoidal reflectors having respective first focal points within a target region and second focal points at a vertex opening in the opposing reflector. Outwardly of each inner reflector is the opposed combination of a spherical reflector, and an outer generally ellipsoidal reflector having an aberrated first focal point coincident with the focus of the opposing spherical reflector and a second focal point coincident with the second focal point of the opposing inner ellipsoidal reflector through a vertex opening in the spherical reflector. The confluent collimated beams are incident through vertex openings in the outer ellipsoidal reflectors onto respective opposing spherical reflectors. Each beam is reflected by the associated spherical reflector onto the opposing outer ellipsoidal reflector and focused thereby onto the opposing inner ellipsoidal reflector, and then onto the target region.

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.

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.

Transversal Fluctuations of the ASEP, Stochastic Six Vertex Model, and Hall-Littlewood Gibbsian Line Ensembles

NASA Astrophysics Data System (ADS)

Corwin, Ivan; Dimitrov, Evgeni

2018-05-01

We consider the ASEP and the stochastic six vertex model started with step initial data. After a long time, T, it is known that the one-point height function fluctuations for these systems are of order T 1/3. We prove the KPZ prediction of T 2/3 scaling in space. Namely, we prove tightness (and Brownian absolute continuity of all subsequential limits) as T goes to infinity of the height function with spatial coordinate scaled by T 2/3 and fluctuations scaled by T 1/3. The starting point for proving these results is a connection discovered recently by Borodin-Bufetov-Wheeler between the stochastic six vertex height function and the Hall-Littlewood process (a certain measure on plane partitions). Interpreting this process as a line ensemble with a Gibbsian resampling invariance, we show that the one-point tightness of the top curve can be propagated to the tightness of the entire curve.

The sPHENIX Experiment

NASA Astrophysics Data System (ADS)

Pérez Lara, Carlos E.

2018-02-01

Our understanding of QCD under extreme conditions has advanced tremendously in the last 20 years with the discovery of the Quark Gluon Plasma and its characterisation in heavy ion collisions at RHIC and LHC. The sPHENIX detector planned at RHIC is designed to further study the microscopic nature of the QGP through precision measurements of jet, upsilon and open heavy flavor probes over a broad pT range. The multi-year sPHENIX physics program will commence in early 2023, using state-of-the art detector technologies to fully exploit the highest RHIC luminosities. The experiment incorporates the 1.4 T former BaBar solenoid magnet, and will feature high precision tracking and vertexing capabilities, provided by a compact TPC, Si-strip intermediate tracker and MAPS vertex detector. This is complemented by highly granular electromagnetic and hadronic calorimetry with full azimuthal coverage. In this document I describe the sPHENIX detector design and physics program, with particular emphasis on the comprehensive open heavy flavour program enabled by the experiment's large coverage, high rate capability and precision vertexing.

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.

Linguistic Knowledge and Reasoning for Error Diagnosis and Feedback Generation.

ERIC Educational Resources Information Center

Delmonte, Rodolfo

2003-01-01

Presents four sets of natural language processing-based exercises for which error correction and feedback are produced by means of a rich database in which linguistic information is encoded either at the lexical or the grammatical level. (Author/VWL)

Improving the effectiveness of performance feedback by considering personality traits and task demands

PubMed Central

Peterson, Jordan B.

2018-01-01

Although performance feedback is widely employed as a means to improve motivation, the efficacy and reliability of performance feedback is often obscured by individual differences and situational variables. The joint role of these moderating variables remains unknown. Accordingly, we investigate how the motivational impact of feedback is moderated by personality and task-difficulty. Utilizing three samples (total N = 916), we explore how Big Five personality traits moderate the motivational impact of false positive and negative feedback on playful, neutral, and frustrating puzzle tasks, respectively. Conscientious and Neurotic individuals together appear particularly sensitive to task difficulty, becoming significantly more motivated by negative feedback on playful tasks and demotivated by negative feedback on frustrating tasks. Results are discussed in terms of Goal-Setting and Self Determination Theory. Implications for industry and education are considered. PMID:29787593

QSPR modeling: graph connectivity indices versus line graph connectivity indices

PubMed

Basak; Nikolic; Trinajstic; Amic; Beslo

2000-07-01

Five QSPR models of alkanes were reinvestigated. Properties considered were molecular surface-dependent properties (boiling points and gas chromatographic retention indices) and molecular volume-dependent properties (molar volumes and molar refractions). The vertex- and edge-connectivity indices were used as structural parameters. In each studied case we computed connectivity indices of alkane trees and alkane line graphs and searched for the optimum exponent. Models based on indices with an optimum exponent and on the standard value of the exponent were compared. Thus, for each property we generated six QSPR models (four for alkane trees and two for the corresponding line graphs). In all studied cases QSPR models based on connectivity indices with optimum exponents have better statistical characteristics than the models based on connectivity indices with the standard value of the exponent. The comparison between models based on vertex- and edge-connectivity indices gave in two cases (molar volumes and molar refractions) better models based on edge-connectivity indices and in three cases (boiling points for octanes and nonanes and gas chromatographic retention indices) better models based on vertex-connectivity indices. Thus, it appears that the edge-connectivity index is more appropriate to be used in the structure-molecular volume properties modeling and the vertex-connectivity index in the structure-molecular surface properties modeling. The use of line graphs did not improve the predictive power of the connectivity indices. Only in one case (boiling points of nonanes) a better model was obtained with the use of line graphs.

Morphometric evaluation of parasagittal venous anatomy for intracranial approaches: a cadaveric study.

PubMed

Sayhan, Salih; Guvencer, Mustafa; Ozer, Ercan; Arda, Mehmet Nuri

2012-01-01

Obstruction of superior sagittal sinus (SSS) and collateral bridging veins is a well-known reason of postoperative brain edema and brain infarct, however, morphometric anatomic studies done in the light of surgical landmarks aren't sufficient in number. Object of this study is to describe venous structures related to SSS with silicon injected cadaveric models. This study was on 6 silicon injected cadaveric heads at Anatomy Department. Duramater was removed and veins on parasagittal area were examined. SSS morphology, veins draining into SSS, their size, number and distance were evaluated. Mean vein number draining into SSS is 2.9±1.5 at anterior to coronal suture (CS), between CS and vertex is 3.2±0.8, between vertex and lambdoid suture (LS) is 2.3±0.9, between LS and confluens sinuum 0.3±0.5. There was no statically difference between right and left sides (p=0.140, p > 0.05). Diameter of veins was 2.4±1.0 mm at anterior to CS, 3.0±1.2 mm at between CS and vertex, 2.4±0.7 mm at between vertex and LS, and 2.2±0.5 mm at between LS and confluens sinuum. Knowing details of anatomic structures of SSS and venous structures draining into it may protect the patients from many surgical complications. SSS and related structures with surgical landmarks are valuable for neurosurgeons.

Feedback-related brain activity predicts learning from feedback in multiple-choice testing.

PubMed

Ernst, Benjamin; Steinhauser, Marco

2012-06-01

Different event-related potentials (ERPs) have been shown to correlate with learning from feedback in decision-making tasks and with learning in explicit memory tasks. In the present study, we investigated which ERPs predict learning from corrective feedback in a multiple-choice test, which combines elements from both paradigms. Participants worked through sets of multiple-choice items of a Swahili-German vocabulary task. Whereas the initial presentation of an item required the participants to guess the answer, corrective feedback could be used to learn the correct response. Initial analyses revealed that corrective feedback elicited components related to reinforcement learning (FRN), as well as to explicit memory processing (P300) and attention (early frontal positivity). However, only the P300 and early frontal positivity were positively correlated with successful learning from corrective feedback, whereas the FRN was even larger when learning failed. These results suggest that learning from corrective feedback crucially relies on explicit memory processing and attentional orienting to corrective feedback, rather than on reinforcement learning.

Observational Constraints on the Water Vapor Feedback Using GPS Radio Occultations

NASA Astrophysics Data System (ADS)

Vergados, P.; Mannucci, A. J.; Ao, C. O.; Fetzer, E. J.

2016-12-01

The air refractive index at L-band frequencies depends on the air's density and water vapor content. Exploiting these relationships, we derive a theoretical model to infer the specific humidity response to surface temperature variations, dq/dTs, given knowledge of how the air refractive index and temperature vary with surface temperature. We validate this model using 1.2-1.6 GHz Global Positioning System Radio Occultation (GPS RO) observations from 2007 to 2010 at 250 hPa, where the water vapor feedback on surface warming is strongest. Current research indicates that GPS RO data sets can capture the amount of water vapor in very dry and very moist air more efficiently than other observing platforms, possibly suggesting larger water vapor feedback than previously known. Inter-comparing the dq/dTs among different data sets will provide us with additional constraints on the water vapor feedback. The dq/dTs estimation from GPS RO observations shows excellent agreement with previously published results and the responses estimated using Atmospheric Infrared Sounder (AIRS) and NASA's Modern-Era Retrospective Analysis for Research and Applications (MERRA) data sets. In particular, the GPS RO-derived dq/dTs is larger by 6% than that estimated using the AIRS data set. This agrees with past evidence that AIRS may be dry-biased in the upper troposphere. Compared to the MERRA estimations, the GPS RO-derived dq/dTs is 10% smaller, also agreeing with previous results that show that MERRA may have a wet bias in the upper troposphere. Because of their high sensitivity to fractional changes in water vapor, and their inherent long-term accuracy, current and future GPS RO observations show great promise in monitoring climate feedbacks and their trends.

Factorization and the synthesis of optimal feedback kernels for differential-delay systems

NASA Technical Reports Server (NTRS)

Milman, Mark M.; Scheid, Robert E.

1987-01-01

A combination of ideas from the theories of operator Riccati equations and Volterra factorizations leads to the derivation of a novel, relatively simple set of hyperbolic equations which characterize the optimal feedback kernel for the finite-time regulator problem for autonomous differential-delay systems. Analysis of these equations elucidates the underlying structure of the feedback kernel and leads to the development of fast and accurate numerical methods for its computation. Unlike traditional formulations based on the operator Riccati equation, the gain is characterized by means of classical solutions of the derived set of equations. This leads to the development of approximation schemes which are analogous to what has been accomplished for systems of ordinary differential equations with given initial conditions.

Testing Quick Response (QR) Codes as an Innovation to Improve Feedback Among Geographically-Separated Clerkship Sites.

PubMed

Snyder, Matthew J; Nguyen, Dana R; Womack, Jasmyne J; Bunt, Christopher W; Westerfield, Katie L; Bell, Adriane E; Ledford, Christy J W

2018-03-01

Collection of feedback regarding medical student clinical experiences for formative or summative purposes remains a challenge across clinical settings. The purpose of this study was to determine whether the use of a quick response (QR) code-linked online feedback form improves the frequency and efficiency of rater feedback. In 2016, we compared paper-based feedback forms, an online feedback form, and a QR code-linked online feedback form at 15 family medicine clerkship sites across the United States. Outcome measures included usability, number of feedback submissions per student, number of unique raters providing feedback, and timeliness of feedback provided to the clerkship director. The feedback method was significantly associated with usability, with QR code scoring the highest, and paper second. Accessing feedback via QR code was associated with the shortest time to prepare feedback. Across four rotations, separate repeated measures analyses of variance showed no effect of feedback system on the number of submissions per student or the number of unique raters. The results of this study demonstrate that preceptors in the family medicine clerkship rate QR code-linked feedback as a high usability platform. Additionally, this platform resulted in faster form completion than paper or online forms. An overarching finding of this study is that feedback forms must be portable and easily accessible. Potential implementation barriers and the social norm for providing feedback in this manner need to be considered.

Using Feedback from Data Consumers to Capture Quality Information on Environmental Research Data

NASA Astrophysics Data System (ADS)

Devaraju, A.; Klump, J. F.

2015-12-01

Data quality information is essential to facilitate reuse of Earth science data. Recorded quality information must be sufficient for other researchers to select suitable data sets for their analysis and confirm the results and conclusions. In the research data ecosystem, several entities are responsible for data quality. Data producers (researchers and agencies) play a major role in this aspect as they often include validation checks or data cleaning as part of their work. It is possible that the quality information is not supplied with published data sets; if it is available, the descriptions might be incomplete, ambiguous or address specific quality aspects. Data repositories have built infrastructures to share data, but not all of them assess data quality. They normally provide guidelines of documenting quality information. Some suggests that scholarly and data journals should take a role in ensuring data quality by involving reviewers to assess data sets used in articles, and incorporating data quality criteria in the author guidelines. However, this mechanism primarily addresses data sets submitted to journals. We believe that data consumers will complement existing entities to assess and document the quality of published data sets. This has been adopted in crowd-source platforms such as Zooniverse, OpenStreetMap, Wikipedia, Mechanical Turk and Tomnod. This paper presents a framework designed based on open source tools to capture and share data users' feedback on the application and assessment of research data. The framework comprises a browser plug-in, a web service and a data model such that feedback can be easily reported, retrieved and searched. The feedback records are also made available as Linked Data to promote integration with other sources on the Web. Vocabularies from Dublin Core and PROV-O are used to clarify the source and attribution of feedback. The application of the framework is illustrated with the CSIRO's Data Access Portal.

Feedback GAP: study protocol for a cluster-randomized trial of goal setting and action plans to increase the effectiveness of audit and feedback interventions in primary care

PubMed Central

2010-01-01

Background Audit and feedback to physicians is commonly used alone or as part of multifaceted interventions. While it can play an important role in quality improvement, the optimal design of audit and feedback is unknown. This study explores how feedback can be improved to increase acceptability and usability in primary care. The trial seeks to determine whether a theory-informed worksheet appended to feedback reports can help family physicians improve quality of care for their patients with diabetes and/or ischemic heart disease. Methods Two-arm cluster trial was conducted with participating primary care practices allocated using minimization to simple feedback or enhanced feedback group. The simple feedback group receives performance feedback reports every six months for two years regarding the proportion of their patients with diabetes and/or ischemic heart disease who are meeting quality targets. The enhanced feedback group receives these same reports as well as a theory-informed worksheet designed to facilitate goal setting and action plan development in response to the feedback reports. Participants are family physicians from across Ontario who use electronic medical records; data for rostered patients are used to produce the feedback reports and for analysis. Outcomes The primary disease outcomes are the blood pressure (BP), and low-density lipoprotein cholesterol (LDL) levels. The primary process measure is a composite score indicating the number of recommended activities (e.g., tests and prescriptions) conducted by the family physicians for their patients with diabetes and/or ischemic heart disease within the appropriate timeframe. Secondary outcomes are the proportion of patients whose results meet targets for glucose, LDL, and BP as well as the percent of patients receiving relevant prescriptions. A qualitative process evaluation using semi-structured interviews will explore perceived barriers to behaviour change in response to feedback reports and preferences with regard to feedback design. Analysis Intention-to-treat approach will be used to analyze the trial. Analysis will be performed on patient-level variables using generalized estimating equation models to adjust for covariates and account for the clustered nature of the data. The trial is powered to show small, but clinically important differences of 7 mmHG in systolic BP and 0.32 mmol/L in LDL. Trial Registration ClinicalTrials.gov NCT00996645 PMID:21167034

Feedback GAP: study protocol for a cluster-randomized trial of goal setting and action plans to increase the effectiveness of audit and feedback interventions in primary care.

PubMed

Ivers, Noah M; Tu, Karen; Francis, Jill; Barnsley, Jan; Shah, Baiju; Upshur, Ross; Kiss, Alex; Grimshaw, Jeremy M; Zwarenstein, Merrick

2010-12-17

Audit and feedback to physicians is commonly used alone or as part of multifaceted interventions. While it can play an important role in quality improvement, the optimal design of audit and feedback is unknown. This study explores how feedback can be improved to increase acceptability and usability in primary care. The trial seeks to determine whether a theory-informed worksheet appended to feedback reports can help family physicians improve quality of care for their patients with diabetes and/or ischemic heart disease. Two-arm cluster trial was conducted with participating primary care practices allocated using minimization to simple feedback or enhanced feedback group. The simple feedback group receives performance feedback reports every six months for two years regarding the proportion of their patients with diabetes and/or ischemic heart disease who are meeting quality targets. The enhanced feedback group receives these same reports as well as a theory-informed worksheet designed to facilitate goal setting and action plan development in response to the feedback reports. Participants are family physicians from across Ontario who use electronic medical records; data for rostered patients are used to produce the feedback reports and for analysis. The primary disease outcomes are the blood pressure (BP), and low-density lipoprotein cholesterol (LDL) levels. The primary process measure is a composite score indicating the number of recommended activities (e.g., tests and prescriptions) conducted by the family physicians for their patients with diabetes and/or ischemic heart disease within the appropriate timeframe. Secondary outcomes are the proportion of patients whose results meet targets for glucose, LDL, and BP as well as the percent of patients receiving relevant prescriptions. A qualitative process evaluation using semi-structured interviews will explore perceived barriers to behaviour change in response to feedback reports and preferences with regard to feedback design. Intention-to-treat approach will be used to analyze the trial. Analysis will be performed on patient-level variables using generalized estimating equation models to adjust for covariates and account for the clustered nature of the data. The trial is powered to show small, but clinically important differences of 7 mmHG in systolic BP and 0.32 mmol/L in LDL. ClinicalTrials.gov NCT00996645.

Linear feedback stabilization of a dispersively monitored qubit

NASA Astrophysics Data System (ADS)

Patti, Taylor Lee; Chantasri, Areeya; García-Pintos, Luis Pedro; Jordan, Andrew N.; Dressel, Justin

2017-08-01

The state of a continuously monitored qubit evolves stochastically, exhibiting competition between coherent Hamiltonian dynamics and diffusive partial collapse dynamics that follow the measurement record. We couple these distinct types of dynamics together by linearly feeding the collected record for dispersive energy measurements directly back into a coherent Rabi drive amplitude. Such feedback turns the competition cooperative and effectively stabilizes the qubit state near a target state. We derive the conditions for obtaining such dispersive state stabilization and verify the stabilization conditions numerically. We include common experimental nonidealities, such as energy decay, environmental dephasing, detector efficiency, and feedback delay, and show that the feedback delay has the most significant negative effect on the feedback protocol. Setting the measurement collapse time scale to be long compared to the feedback delay yields the best stabilization.

Role of measurement in feedback-controlled quantum engines

NASA Astrophysics Data System (ADS)

Yi, Juyeon; Kim, Yong Woon

2018-01-01

In feedback controls, measurement is an essential step in designing protocols according to outcomes. For quantum mechanical systems, measurement has another effect; to supply energy to the measured system. We verify that in feedback-controlled quantum engines, measurement plays a dual role; not only as an auxiliary to perform feedback control but also as an energy supply to drive the engines. We consider a specific engine cycle exploiting feedback control followed by projective measurement and show that the maximum bound of the extractable work is set by both the efficacy of the feedback control and the energy change caused by projective measurement. We take a concrete example of an engine using an immobile spin-1/2 particle as a working substance and suggest two possible scenarios for work extraction.

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)\

Synthesis and structure of [Na11(OtBu)10(OH)]: 1H NMR shift of a hydroxide ion encapsulated in a 21-vertex alcoholate cage.

PubMed

Geier, Jens; Grützmacher, Hansjörg

2003-12-07

[Na11(OtBu)10(OH)], a hydroxide enclosing 21-vertex cage compound, was found to crystallize from mixtures of sodium tert.butanolate with sodium hydroxide. Its structure can be derived from the known (NaOtBu)6-hexaprismane by replacing one butanolate unit with OH- and capping the latter with five additional units of NaOtBu. The hydroxide shows a signal at -3.21 ppm in the 1H NMR spectrum.

Loop-quantum-gravity vertex amplitude.

PubMed

Engle, Jonathan; Pereira, Roberto; Rovelli, Carlo

2007-10-19

Spin foam models are hoped to provide the dynamics of loop-quantum gravity. However, the most popular of these, the Barrett-Crane model, does not have the good boundary state space and there are indications that it fails to yield good low-energy n-point functions. We present an alternative dynamics that can be derived as a quantization of a Regge discretization of Euclidean general relativity, where second class constraints are imposed weakly. Its state space matches the SO(3) loop gravity one and it yields an SO(4)-covariant vertex amplitude for Euclidean loop gravity.

[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.

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.

Affect-Aware Adaptive Tutoring Based on Human-Automation Etiquette Strategies.

PubMed

Yang, Euijung; Dorneich, Michael C

2018-06-01

We investigated adapting the interaction style of intelligent tutoring system (ITS) feedback based on human-automation etiquette strategies. Most ITSs adapt the content difficulty level, adapt the feedback timing, or provide extra content when they detect cognitive or affective decrements. Our previous work demonstrated that changing the interaction style via different feedback etiquette strategies has differential effects on students' motivation, confidence, satisfaction, and performance. The best etiquette strategy was also determined by user frustration. Based on these findings, a rule set was developed that systemically selected the proper etiquette strategy to address one of four learning factors (motivation, confidence, satisfaction, and performance) under two different levels of user frustration. We explored whether etiquette strategy selection based on this rule set (systematic) or random changes in etiquette strategy for a given level of frustration affected the four learning factors. Participants solved mathematics problems under different frustration conditions with feedback that adapted dynamic changes in etiquette strategies either systematically or randomly. The results demonstrated that feedback with etiquette strategies chosen systematically via the rule set could selectively target and improve motivation, confidence, satisfaction, and performance more than changing etiquette strategies randomly. The systematic adaptation was effective no matter the level of frustration for the participant. If computer tutors can vary the interaction style to effectively mitigate negative emotions, then ITS designers would have one more mechanism in which to design affect-aware adaptations that provide the proper responses in situations where human emotions affect the ability to learn.

A Mapmark method of standard setting as implemented for the National Assessment Governing Board.

PubMed

Schulz, E Matthew; Mitzel, Howard C

2011-01-01

This article describes a Mapmark standard setting procedure, developed under contract with the National Assessment Governing Board (NAGB). The procedure enhances the bookmark method with spatially representative item maps, holistic feedback, and an emphasis on independent judgment. A rationale for these enhancements, and the bookmark method, is presented, followed by a detailed description of the materials and procedures used in a meeting to set standards for the 2005 National Assessment of Educational Progress (NAEP) in Grade 12 mathematics. The use of difficulty-ordered content domains to provide holistic feedback is a particularly novel feature of the method. Process evaluation results comparing Mapmark to Anghoff-based methods previously used for NAEP standard setting are also presented.

Model-Free control performance improvement using virtual reference feedback tuning and reinforcement Q-learning

NASA Astrophysics Data System (ADS)

Radac, Mircea-Bogdan; Precup, Radu-Emil; Roman, Raul-Cristian

2017-04-01

This paper proposes the combination of two model-free controller tuning techniques, namely linear virtual reference feedback tuning (VRFT) and nonlinear state-feedback Q-learning, referred to as a new mixed VRFT-Q learning approach. VRFT is first used to find stabilising feedback controller using input-output experimental data from the process in a model reference tracking setting. Reinforcement Q-learning is next applied in the same setting using input-state experimental data collected under perturbed VRFT to ensure good exploration. The Q-learning controller learned with a batch fitted Q iteration algorithm uses two neural networks, one for the Q-function estimator and one for the controller, respectively. The VRFT-Q learning approach is validated on position control of a two-degrees-of-motion open-loop stable multi input-multi output (MIMO) aerodynamic system (AS). Extensive simulations for the two independent control channels of the MIMO AS show that the Q-learning controllers clearly improve performance over the VRFT controllers.

Feedback in a clinical setting: A way forward to enhance student's learning through constructive feedback.

PubMed

Sultan, Amber Shamim; Mateen Khan, Muhammad Arif

2017-07-01

Feedback is considered as a dynamic process in which information about the observed performance is used to promote the desirable behaviour and correct the negative ones. The importance of feedback is widely acknowledged, but still there seems to be inconsistency in the amount, type and timing of feedback received from the clinical faculty. No significant effort has been put forward from the educator end to empower the learners with the skills of receiving and using the feedback effectively. Some institutions conduct faculty development workshops and courses to facilitate the clinicians on how best to deliver constructive feedback to the learners. Despite of all these struggles learners are not fully satisfied with the quality of feedback received from their busy clinicians. The aim of this paper is to highlight what actually feedback is, type and structure of feedback, the essential components of a constructive feedback, benefits of providing feedback, barriers affecting the provision of timely feedback and different models used for providing feedback. The ultimate purpose of this paper is to provide sufficient information to the clinical directors that there is a need to establish a robust system for giving feedback to learners and to inform all the clinical educators with the skills required to provide constructive feedback to their learners. For the literature review, we had used the key words glossary as: Feedback, constructive feedback, barriers to feedback, principles of constructive feedback, Models of feedback, reflection, self-assessment and clinical practice etc. The data bases for the search include: Cardiff University library catalogue, Pub Med, Google Scholar, Web of Knowledge and Science direct.

Adolescents' Perspectives on Personalized E-Feedback in the Context of Health Risk Behavior Screening for Primary Care: Qualitative Study.

PubMed

Zieve, Garret G; Richardson, Laura P; Katzman, Katherine; Spielvogle, Heather; Whitehouse, Sandy; McCarty, Carolyn A

2017-07-20

Electronic health screening tools for primary care present an opportunity to go beyond data collection to provide education and feedback to adolescents in order to motivate behavior change. However, there is limited research to guide feedback message development. The aim of this study was to explore youth perceptions of and preferences for receiving personalized feedback for multiple health risk behaviors and reinforcement for health promoting behaviors from an electronic health screening tool for primary care settings, using qualitative methodology. In total, 31 adolescents aged 13-18 years completed the screening tool, received the electronic feedback, and subsequently participated in individual, semistructured, qualitative interviews lasting approximately 60 min. Participants were queried about their overall impressions of the tool, perceptions regarding various types of feedback messages, and additional features that would help motivate health behavior change. Using thematic analysis, interview transcripts were coded to identify common themes expressed across participants. Overall, the tool was well-received by participants who perceived it as a way to enhance-but not replace-their interactions with providers. They appreciated receiving nonjudgmental feedback from the tool and responded positively to information regarding the consequences of behaviors, comparisons with peer norms and health guidelines, tips for behavior change, and reinforcement of healthy choices. A small but noteworthy minority of participants dismissed the peer norms as not real or relevant and national guidelines as not valid or reasonable. When prompted for possible adaptations to the tool, adolescents expressed interest in receiving follow-up information, setting health-related goals, tracking their behaviors over time, and communicating with providers electronically between appointments. Adolescents in this qualitative study desired feedback that validates their healthy behavior choices and supports them as independent decision makers by neutrally presenting health information, facilitating goal setting, and offering ongoing technological supports. ©Garret G Zieve, Laura P Richardson, Katherine Katzman, Heather Spielvogle, Sandy Whitehouse, Carolyn A McCarty. Originally published in the Journal of Medical Internet Research (http://www.jmir.org), 20.07.2017.

Delay-based virtual congestion control in multi-tenant datacenters

NASA Astrophysics Data System (ADS)

Liu, Yuxin; Zhu, Danhong; Zhang, Dong

2018-03-01

With the evolution of cloud computing and virtualization, the congestion control of virtual datacenters has become the basic issue for multi-tenant datacenters transmission. Regarding to the friendly conflict of heterogeneous congestion control among multi-tenant, this paper proposes a delay-based virtual congestion control, which translates the multi-tenant heterogeneous congestion control into delay-based feedback uniformly by setting the hypervisor translation layer, modifying three-way handshake of explicit feedback and packet loss feedback and throttling receive window. The simulation results show that the delay-based virtual congestion control can effectively solve the unfairness of heterogeneous feedback congestion control algorithms.

Design of analog pixels front-end active feedback

NASA Astrophysics Data System (ADS)

Kmon, P.; Kadlubowski, L. A.; Kaczmarczyk, P.

2018-01-01

The paper presents the design of the active feedback used in a charge-sensitive amplifier. The predominant advantages of the presented circuit are its ability for setting wide range of pulse-time widths, small silicon area occupation and low power consumption. The feedback also allows sensor leakage current compensation and, thanks to an additional DC amplifier, it minimizes the output DC voltage variations, which is especially important in the DC coupled recording chain and for processes with limited supply voltage. The paper provides feedback description and its operation principle. The proposed circuit was designed in the CMOS 130nm technology.

Acoustic feedback margin improvements in hearing instruments using a prototype DFS (digital feedback suppression) system.

PubMed

Dyrlund, O; Bisgaard, N

1991-01-01

The properties of a prototype DFS (digital feedback suppression) system have been investigated. 21 ears fitted with behind-the-ear (BTE) hearing instruments and hard acrylic ear-moulds and 4 ears fitted with vented in-the-ear (ITE) hearing instruments were selected for the investigation. Two ITE instruments with different venting were employed to one of the ears. Complex loop gain has been measured in an anechoic room, and from these measurements the improvements in acoustic feedback margin due to the DFS system have been determined. For the BTE group, median values of 13.1 and 10.0 dB of improvement were established for two sets of measurements introducing a 180 degrees phase shift in connection with the last set of measurements. For the ITE group, values from 9.8 to 16.1 dB and from 13.7 to 16.3 dB of improvement were observed for the normal and the 180 degrees phase shift conditions respectively. Beyond this the DFS system may improve the sound quality to some extent, because the amplitude distortion, caused by the external feedback signal, is almost completely eliminated.

Integrated Control Using the SOFFT Control Structure

NASA Technical Reports Server (NTRS)

Halyo, Nesim

1996-01-01

The need for integrated/constrained control systems has become clearer as advanced aircraft introduced new coupled subsystems such as new propulsion subsystems with thrust vectoring and new aerodynamic designs. In this study, we develop an integrated control design methodology which accomodates constraints among subsystem variables while using the Stochastic Optimal Feedforward/Feedback Control Technique (SOFFT) thus maintaining all the advantages of the SOFFT approach. The Integrated SOFFT Control methodology uses a centralized feedforward control and a constrained feedback control law. The control thus takes advantage of the known coupling among the subsystems while maintaining the identity of subsystems for validation purposes and the simplicity of the feedback law to understand the system response in complicated nonlinear scenarios. The Variable-Gain Output Feedback Control methodology (including constant gain output feedback) is extended to accommodate equality constraints. A gain computation algorithm is developed. The designer can set the cross-gains between two variables or subsystems to zero or another value and optimize the remaining gains subject to the constraint. An integrated control law is designed for a modified F-15 SMTD aircraft model with coupled airframe and propulsion subsystems using the Integrated SOFFT Control methodology to produce a set of desired flying qualities.

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.

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

NASA Astrophysics Data System (ADS)

Xu, Cenke

2006-12-01

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

Simulating airless and/or hot planetary surfaces in the Planetary Emissivity Laboratory (PEL)

NASA Astrophysics Data System (ADS)

Maturilli, A.; Helbert, J.; D'Amore, M.

2010-12-01

A complete and extensive mineralogical survey of extraterrestrial bodies is actually possible only by means of remote sensing spectrometers, measuring the planetary surfaces in a spectral range that goes from the visible to the far infrared. The list of instruments still active today, observing the most interesting planets and bodies in our solar system is far too long to list them in this abstract. The important message is that all of them are sending to Earth a huge amount of data that needs to be correctly analysed, to infer the mineralogical composition of the observed regions on different targets. This requires laboratory data of relevant analogue materials under relevant conditions measured on a wide spectral range. At the Planetary Emissivity Laboratory (PEL) of DLR in Berlin two separate instruments, a Bruker IFS 88 and a Bruker Vertex 80V are operated in parallel and independently to measure reflectance and emissivity of planetary analogue materials to cover the 0.4 to 100 µm spectral range. The older IFS 88 is used to measure under room pressure and for emissivity measurements from low to moderate temperatures (up to 180° C), while the new Vertex 80V can be evacuated (below 1 mbar) and used to measure emissivity of moderate to very hot surfaces, reaching temperatures typical of the daily Mercury (beyond 500° C). The laboratory set-up and the already obtained results will be described, together with details about the online-archival and the standardized structure of the existing dataset.

Novel 3D Compression Methods for Geometry, Connectivity and Texture

NASA Astrophysics Data System (ADS)

Siddeq, M. M.; Rodrigues, M. A.

2016-06-01

A large number of applications in medical visualization, games, engineering design, entertainment, heritage, e-commerce and so on require the transmission of 3D models over the Internet or over local networks. 3D data compression is an important requirement for fast data storage, access and transmission within bandwidth limitations. The Wavefront OBJ (object) file format is commonly used to share models due to its clear simple design. Normally each OBJ file contains a large amount of data (e.g. vertices and triangulated faces, normals, texture coordinates and other parameters) describing the mesh surface. In this paper we introduce a new method to compress geometry, connectivity and texture coordinates by a novel Geometry Minimization Algorithm (GM-Algorithm) in connection with arithmetic coding. First, each vertex ( x, y, z) coordinates are encoded to a single value by the GM-Algorithm. Second, triangle faces are encoded by computing the differences between two adjacent vertex locations, which are compressed by arithmetic coding together with texture coordinates. We demonstrate the method on large data sets achieving compression ratios between 87 and 99 % without reduction in the number of reconstructed vertices and triangle faces. The decompression step is based on a Parallel Fast Matching Search Algorithm (Parallel-FMS) to recover the structure of the 3D mesh. A comparative analysis of compression ratios is provided with a number of commonly used 3D file formats such as VRML, OpenCTM and STL highlighting the performance and effectiveness of the proposed method.

Improving Nursing Home Care through Feedback On PerfoRMance Data (INFORM): Protocol for a cluster-randomized trial.

PubMed

Hoben, Matthias; Norton, Peter G; Ginsburg, Liane R; Anderson, Ruth A; Cummings, Greta G; Lanham, Holly J; Squires, Janet E; Taylor, Deanne; Wagg, Adrian S; Estabrooks, Carole A

2017-01-10

Audit and feedback is effective in improving the quality of care. However, methods and results of international studies are heterogeneous, and studies have been criticized for a lack of systematic use of theory. In TREC (Translating Research in Elder Care), a longitudinal health services research program, we collect comprehensive data from care providers and residents in Canadian nursing homes to improve quality of care and life of residents, and quality of worklife of caregivers. The study aims are to a) systematically feed back TREC research data to nursing home care units, and b) compare the effectiveness of three different theory-based feedback strategies in improving performance within care units. INFORM (Improving Nursing Home Care through Feedback On PerfoRMance Data) is a 3.5-year pragmatic, three-arm, parallel, cluster-randomized trial. We will randomize 67 Western Canadian nursing homes with 203 care units to the three study arms, a standard feedback strategy and two assisted and goal-directed feedback strategies. Interventions will target care unit managerial teams. They are based on theory and evidence related to audit and feedback, goal setting, complex adaptive systems, and empirical work on feeding back research results. The primary outcome is the increased number of formal interactions (e.g., resident rounds or family conferences) involving care aides - non-registered caregivers providing up to 80% of direct care. Secondary outcomes are a) other modifiable features of care unit context (improved feedback, social capital, slack time) b) care aides' quality of worklife (improved psychological empowerment, job satisfaction), c) more use of best practices, and d) resident outcomes based on the Resident Assessment Instrument - Minimum Data Set 2.0. Outcomes will be assessed at baseline, immediately after the 12-month intervention period, and 18 months post intervention. INFORM is the first study to systematically assess the effectiveness of different strategies to feed back research data to nursing home care units in order to improve their performance. Results of this study will enable development of a practical, sustainable, effective, and cost-effective feedback strategy for routine use by managers, policy makers and researchers. The results may also be generalizable to care settings other than nursing homes. ClinicalTrials.gov Identifier: NCT02695836 . Date of registration: 24 February 2016.

Using Quality Management Tools to Enhance Feedback from Student Evaluations

ERIC Educational Resources Information Center

Jensen, John B.; Artz, Nancy

2005-01-01

Statistical tools found in the service quality assessment literature--the "T"[superscript 2] statistic combined with factor analysis--can enhance the feedback instructors receive from student ratings. "T"[superscript 2] examines variability across multiple sets of ratings to isolate individual respondents with aberrant response…

A top-down approach for approximate data anonymisation

NASA Astrophysics Data System (ADS)

Li, JianQiang; Yang, Ji-Jiang; Zhao, Yu; Liu, Bo

2013-08-01

Data sharing in today's information society poses a threat to individual privacy and organisational confidentiality. k-anonymity is a widely adopted model to prevent the owner of a record being re-identified. By generalising and/or suppressing certain portions of the released dataset, it guarantees that no records can be uniquely distinguished from at least other k-1 records. A key requirement for the k-anonymity problem is to minimise the information loss resulting from data modifications. This article proposes a top-down approach to solve this problem. It first considers each record as a vertex and the similarity between two records as the edge weight to construct a complete weighted graph. Then, an edge cutting algorithm is designed to divide the complete graph into multiple trees/components. The Large Components with size bigger than 2k-1 are subsequently split to guarantee that each resulting component has the vertex number between k and 2k-1. Finally, the generalisation operation is applied on the vertices in each component (i.e. equivalence class) to make sure all the records inside have identical quasi-identifier values. We prove that the proposed approach has polynomial running time and theoretical performance guarantee O(k). The empirical experiments show that our approach results in substantial improvements over the baseline heuristic algorithms, as well as the bottom-up approach with the same approximate bound O(k). Comparing to the baseline bottom-up O(logk)-approximation algorithm, when the required k is smaller than 50, the adopted top-down strategy makes our approach achieve similar performance in terms of information loss while spending much less computing time. It demonstrates that our approach would be a best choice for the k-anonymity problem when both the data utility and runtime need to be considered, especially when k is set to certain value smaller than 50 and the record set is big enough to make the runtime have to be taken into account.

SIS epidemiological model for adaptive RT: Forecasting the parotid glands shrinkage during tomotherapy treatment

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

Maffei, Nicola; Guidi, Gabriele, E-mail: guidi.gab

Purpose: A susceptible-infected-susceptible (SIS) epidemic model was applied to radiation therapy (RT) treatments to predict morphological variations in head and neck (H&N) anatomy. Methods: 360 daily MVCT images of 12 H&N patients treated by tomotherapy were analyzed in this retrospective study. Deformable image registration (DIR) algorithms, mesh grids, and structure recontouring, implemented in the RayStation treatment planning system (TPS), were applied to assess the daily organ warping. The parotid’s warping was evaluated using the epidemiological approach considering each vertex as a single subject and its deformed vector field (DVF) as an infection. Dedicated IronPython scripts were developed to export dailymore » coordinates and displacements of the region of interest (ROI) from the TPS. MATLAB tools were implemented to simulate the SIS modeling. Finally, the fully trained model was applied to a new patient. Results: A QUASAR phantom was used to validate the model. The patients’ validation was obtained setting 0.4 cm of vertex displacement as threshold and splitting susceptible (S) and infectious (I) cases. The correlation between the epidemiological model and the parotids’ trend for further optimization of alpha and beta was carried out by Euclidean and dynamic time warping (DTW) distances. The best fit with experimental conditions across all patients (Euclidean distance of 4.09 ± 1.12 and DTW distance of 2.39 ± 0.66) was obtained setting the contact rate at 7.55 ± 0.69 and the recovery rate at 2.45 ± 0.26; birth rate was disregarded in this constant population. Conclusions: Combining an epidemiological model with adaptive RT (ART), the authors’ novel approach could support image-guided radiation therapy (IGRT) to validate daily setup and to forecast anatomical variations. The SIS-ART model developed could support clinical decisions in order to optimize timing of replanning achieving personalized treatments.« less

cellGPU: Massively parallel simulations of dynamic vertex models

NASA Astrophysics Data System (ADS)

Sussman, Daniel M.

2017-10-01

Vertex models represent confluent tissue by polygonal or polyhedral tilings of space, with the individual cells interacting via force laws that depend on both the geometry of the cells and the topology of the tessellation. This dependence on the connectivity of the cellular network introduces several complications to performing molecular-dynamics-like simulations of vertex models, and in particular makes parallelizing the simulations difficult. cellGPU addresses this difficulty and lays the foundation for massively parallelized, GPU-based simulations of these models. This article discusses its implementation for a pair of two-dimensional models, and compares the typical performance that can be expected between running cellGPU entirely on the CPU versus its performance when running on a range of commercial and server-grade graphics cards. By implementing the calculation of topological changes and forces on cells in a highly parallelizable fashion, cellGPU enables researchers to simulate time- and length-scales previously inaccessible via existing single-threaded CPU implementations. Program Files doi:http://dx.doi.org/10.17632/6j2cj29t3r.1 Licensing provisions: MIT Programming language: CUDA/C++ Nature of problem: Simulations of off-lattice "vertex models" of cells, in which the interaction forces depend on both the geometry and the topology of the cellular aggregate. Solution method: Highly parallelized GPU-accelerated dynamical simulations in which the force calculations and the topological features can be handled on either the CPU or GPU. Additional comments: The code is hosted at https://gitlab.com/dmsussman/cellGPU, with documentation additionally maintained at http://dmsussman.gitlab.io/cellGPUdocumentation

Cleavage in conical sand dollar eggs.

PubMed

Rappaport, R; Rappaport, B N

1994-07-01

Previous experiments have shown that the mitotic apparatus and the surface can interact and produce functional furrows in various unusual geometrical circumstances. The consistent development of the furrow in the plane equidistant from the aster centers has led to conjecture about the need for a special structural configuration of the subsurface in the future cleavage plane. In most experiments involving altered cell geometry, the relation between each aster and nearby surface was symmetrical, and the effect of that symmetry upon the position and orientation of the cleavage mechanism in the cortex has not been systematically analyzed. The normal symmetry of sand dollar eggs can be changed by reshaping them into cones. When the cone and mitotic axes are parallel, the aster center closer to the vertex is also closer to the nearby surface, and the cleavage plane develops on the vertex side of the midpoint between the asters. A mitotic apparatus oriented perpendicular to the cone axis produces in the base of the cone a normal unilateral furrow that advances toward the vertex, and a second contractile band that isolates the vertex region. This event only occurs when the surface is conical and the mitotic apparatus is perpendicular to the cone axis. Furrow formation is not restricted to the plane of the metaphase plate or the midpoint between the aster centers. The orientation of mitotic apparatus-produced contractile bands is not limited to the circumstances in normal cytokinesis, but may vary according to surface contour. These results confirm predictions of the Harris and Gewalt model of contractile ring induction.

The Belle II Silicon Vertex Detector

NASA Astrophysics Data System (ADS)

Friedl, M.; Ackermann, K.; Aihara, H.; Aziz, T.; Bergauer, T.; Bozek, A.; Campbell, A.; Dingfelder, J.; Drasal, Z.; Frankenberger, A.; Gadow, K.; Gfall, I.; Haba, J.; Hara, K.; Hara, T.; Higuchi, T.; Himori, S.; Irmler, C.; Ishikawa, A.; Joo, C.; Kah, D. H.; Kang, K. H.; Kato, E.; Kiesling, C.; Kodys, P.; Kohriki, T.; Koike, S.; Kvasnicka, P.; Marinas, C.; Mayekar, S. N.; Mibe, T.; Mohanty, G. B.; Moll, A.; Negishi, K.; Nakayama, H.; Natkaniec, Z.; Niebuhr, C.; Onuki, Y.; Ostrowicz, W.; Park, H.; Rao, K. K.; Ritter, M.; Rozanska, M.; Saito, T.; Sakai, K.; Sato, N.; Schmid, S.; Schnell, M.; Shimizu, N.; Steininger, H.; Tanaka, S.; Tanida, K.; Taylor, G.; Tsuboyama, T.; Ueno, K.; Uozumi, S.; Ushiroda, Y.; Valentan, M.; Yamamoto, H.

2013-12-01

The KEKB machine and the Belle experiment in Tsukuba (Japan) are now undergoing an upgrade, leading to an ultimate luminosity of 8×1035 cm-2 s-1 in order to measure rare decays in the B system with high statistics. The previous vertex detector cannot cope with this 40-fold increase of luminosity and thus needs to be replaced. Belle II will be equipped with a two-layer Pixel Detector surrounding the beam pipe, and four layers of double-sided silicon strip sensors at higher radii than the old detector. The Silicon Vertex Detector (SVD) will have a total sensitive area of 1.13 m2 and 223,744 channels-twice as many as its predecessor. All silicon sensors will be made from 150 mm wafers in order to maximize their size and thus to reduce the relative contribution of the support structure. The forward part has slanted sensors of trapezoidal shape to improve the measurement precision and to minimize the amount of material as seen by particles from the vertex. Fast-shaping front-end amplifiers will be used in conjunction with an online hit time reconstruction algorithm in order to reduce the occupancy to the level of a few percent at most. A novel “Origami” chip-on-sensor scheme is used to minimize both the distance between strips and amplifier (thus reducing the electronic noise) as well as the overall material budget. This report gives an overview on the status of the Belle II SVD and its components, including sensors, front-end detector ladders, mechanics, cooling and the readout electronics.

Relationship of the actual thick intraocular lens optic to the thin lens equivalent.

PubMed

Holladay, J T; Maverick, K J

1998-09-01

To theoretically derive and empirically validate the relationship between the actual thick intraocular lens and the thin lens equivalent. Included in the study were 12 consecutive adult patients ranging in age from 54 to 84 years (mean +/- SD, 73.5 +/- 9.4 years) with best-corrected visual acuity better than 20/40 in each eye. Each patient had bilateral intraocular lens implants of the same style, placed in the same location (bag or sulcus) by the same surgeon. Preoperatively, axial length, keratometry, refraction, and vertex distance were measured. Postoperatively, keratometry, refraction, vertex distance, and the distance from the vertex of the cornea to the anterior vertex of the intraocular lens (AV(PC1)) were measured. Alternatively, the distance (AV(PC1)) was then back-calculated from the vergence formula used for intraocular lens power calculations. The average (+/-SD) of the absolute difference in the two methods was 0.23 +/- 0.18 mm, which would translate to approximately 0.46 diopters. There was no statistical difference between the measured and calculated values; the Pearson product-moment correlation coefficient from linear regression was 0.85 (r2 = .72, F = 56). The average intereye difference was -0.030 mm (SD, 0.141 mm; SEM, 0.043 mm) using the measurement method and +0.124 mm (SD, 0.412 mm; SEM, 0.124 mm) using the calculation method. The relationship between the actual thick intraocular lens and the thin lens equivalent has been determined theoretically and demonstrated empirically. This validation provides the manufacturer and surgeon additional confidence and utility for lens constants used in intraocular lens power calculations.

Leverage Between the Buffering Effect and the Bystander Effect in Social Networking.

PubMed

Chiu, Yu-Ping; Chang, Shu-Chen

2015-08-01

This study examined encouraged and inhibited social feedback behaviors based on the theories of the buffering effect and the bystander effect. A system program was used to collect personal data and social feedback from a Facebook data set to test the research model. The results revealed that the buffering effect induced a positive relationship between social network size and feedback gained from friends when people's social network size was under a certain cognitive constraint. For people with a social network size that exceeds this cognitive constraint, the bystander effect may occur, in which having more friends may inhibit social feedback. In this study, two social psychological theories were applied to explain social feedback behavior on Facebook, and it was determined that social network size and social feedback exhibited no consistent linear relationship.

Improving lower limb weight distribution asymmetry during the squat using Nintendo Wii Balance Boards and real-time feedback.

PubMed

McGough, Rian; Paterson, Kade; Bradshaw, Elizabeth J; Bryant, Adam L; Clark, Ross A

2012-01-01

Weight-bearing asymmetry (WBA) may be detrimental to performance and could increase the risk of injury; however, detecting and reducing it is difficult in a field setting. This study assessed whether a portable and simple-to-use system designed with multiple Nintendo Wii Balance Boards (NWBBs) and customized software can be used to evaluate and improve WBA. Fifteen elite Australian Rules Footballers and 32 age-matched, untrained participants were tested for measures of WBA while squatting. The NWBB and customized software provided real-time visual feedback of WBA during half of the trials. Outcome measures included the mean mass difference (MMD) between limbs, interlimb symmetry index (SI), and percentage of time spent favoring a single limb (TFSL). Significant reductions in MMD (p = 0.028) and SI (p = 0.007) with visual feedback were observed for the entire group data. Subgroup analysis revealed significant reductions in MMD (p = 0.047) and SI (p = 0.026) with visual feedback in the untrained sample; however, the reductions in the trained sample were nonsignificant. The trained group showed significantly less WBA for TFSL under both visual conditions (no feedback: p = 0.015, feedback: p = 0.017). Correlation analysis revealed that participants with high levels of WBA had the greatest response to feedback (p < 0.001, ρ = 0.557). In conclusion, WBA exists in healthy untrained adults, and these asymmetries can be reduced using real-time visual feedback provided by an NWBB-based system. Healthy, well-trained professional athletes do not possess the same magnitude of WBA. Inexpensive, portable, and widely available gaming technology may be used to evaluate and improve WBA in clinical and sporting settings.

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

The Heavy Photon Search beamline and its performance

DOE PAGES

Baltzell, N.; Egiyan, H.; Ehrhart, M.; ...

2017-07-01

The Heavy Photon Search (HPS) is an experiment to search for a hidden sector photon, aka a heavy photon or dark photon, in fixed target electroproduction at the Thomas Jefferson National Accelerator Facility (JLab). The HPS experiment searches for the emore » $^+$e$^-$ decay of the heavy photon with bump hunt and detached vertex strategies using a compact, large acceptance forward spectrometer, consisting of a silicon microstrip detector (SVT) for tracking and vertexing, and a PbWO$$_4$$ electromagnetic calorimeter for energy measurement and fast triggering. To achieve large acceptance and good vertexing resolution, the first layer of silicon detectors is placed just 10 cm downstream of the target with the sensor edges only 500 $$\\mu$$m above and below the beam. Placing the SVT in such close proximity to the beam puts stringent requirements on the beam profile and beam position stability. As part of an approved engineering run, HPS took data in 2015 and 2016 at 1.05 GeV and 2.3 GeV beam energies, respectively. This study describes the beam line and its performance during that data taking.« less

Predicting links based on knowledge dissemination in complex network

NASA Astrophysics Data System (ADS)

Zhou, Wen; Jia, Yifan

2017-04-01

Link prediction is the task of mining the missing links in networks or predicting the next vertex pair to be connected by a link. A lot of link prediction methods were inspired by evolutionary processes of networks. In this paper, a new mechanism for the formation of complex networks called knowledge dissemination (KD) is proposed with the assumption of knowledge disseminating through the paths of a network. Accordingly, a new link prediction method-knowledge dissemination based link prediction (KDLP)-is proposed to test KD. KDLP characterizes vertex similarity based on knowledge quantity (KQ) which measures the importance of a vertex through H-index. Extensive numerical simulations on six real-world networks demonstrate that KDLP is a strong link prediction method which performs at a higher prediction accuracy than four well-known similarity measures including common neighbors, local path index, average commute time and matrix forest index. Furthermore, based on the common conclusion that an excellent link prediction method reveals a good evolving mechanism, the experiment results suggest that KD is a considerable network evolving mechanism for the formation of complex networks.

Deuteron electromagnetic form factors with the light-front approach

NASA Astrophysics Data System (ADS)

Sun, Bao-dong; Dong, Yu-bing

2017-01-01

The electromagnetic form factors and low-energy observables of the deuteron are studied with the help of the light-front approach, where the deuteron is regarded as a weakly bound state of a proton and a neutron. Both the S and D wave interacting vertexes among the deuteron, proton, and neutron are taken into account. Moreover, the regularization functions are also introduced. In our calculations, the vertex and the regularization functions are employed to simulate the momentum distribution inside the deuteron. Our numerical results show that the light-front approach can roughly reproduce the deuteron electromagnetic form factors, like charge G 0, magnetic G 1, and quadrupole G 2, in the low Q 2 region. The important effect of the D wave vertex on G 2 is also addressed. Supported by National Natural Science Foundation of China (10975146, 11475192), The fund provided by the Sino-German CRC 110 “Symmetries and the Emergence of Structure in QCD" project is also appreciated, YBD thanks FAPESP grant 2011/11973-4 for funding his visit to ICTP-SAIFR

Critical frontier of the triangular Ising antiferromagnet in a field

NASA Astrophysics Data System (ADS)

Qian, Xiaofeng; Wegewijs, Maarten; Blöte, Henk W.

2004-03-01

We study the critical line of the triangular Ising antiferromagnet in an external magnetic field by means of a finite-size analysis of results obtained by transfer-matrix and Monte Carlo techniques. We compare the shape of the critical line with predictions of two different theoretical scenarios. Both scenarios, while plausible, involve assumptions. The first scenario is based on the generalization of the model to a vertex model, and the assumption that the exact analytic form of the critical manifold of this vertex model is determined by the zeroes of an O(2) gauge-invariant polynomial in the vertex weights. However, it is not possible to fit the coefficients of such polynomials of orders up to 10, such as to reproduce the numerical data for the critical points. The second theoretical prediction is based on the assumption that a renormalization mapping exists of the Ising model on the Coulomb gas, and analysis of the resulting renormalization equations. It leads to a shape of the critical line that is inconsistent with the first prediction, but consistent with the numerical data.

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

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.

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

Fierz Convergence Criterion: A Controlled Approach to Strongly Interacting Systems with Small Embedded Clusters.

PubMed

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.

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

PubMed Central

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

2016-01-01

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

Silicon pixel R&D for CLIC

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.