Vacuum instabilities with a wrong-sign Higgs-gluon-gluon amplitude

NASA Astrophysics Data System (ADS)

Reece, Matthew

2013-04-01

The recently discovered 125 GeV boson appears very similar to a Standard Model (SM) Higgs, but with data favoring an enhanced h → γγ rate. A number of groups have found that fits would allow (or, less so after the latest updates, prefer) that the ht\\bar {t} coupling have the opposite sign. This can be given meaning in the context of an electroweak chiral Lagrangian, but it might also be interpreted to mean that a new colored and charged particle runs in loops and reinforces the W-loop contribution to hFF, while also producing the opposite-sign hGG amplitude to that generated by integrating out the top. Due to a correlation in sign of the new physics amplitudes, when the SM hFF coupling is enhanced the hGG coupling is decreased. Thus, in order to not suppress the rate of h → WW and h → ZZ, which appear to be approximately SM-like, one would need the loop to ‘overshoot’, not only canceling the top contribution but producing an opposite-sign hGG vertex of about the same magnitude as that in the SM. We argue that most such explanations have severe problems with fine-tuning and, more importantly, vacuum stability. In particular, the case of stop loops producing an opposite-sign hGG vertex of the same size as the SM one is ruled out by a combination of vacuum decay bounds and Large Electron-Positron Collider (LEP) constraints. We also show that scenarios with a sign flip from loops of color octet charged scalars or new fermionic states are highly constrained.

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.

Quantum speedup of the traveling-salesman problem for bounded-degree graphs

NASA Astrophysics Data System (ADS)

Moylett, Dominic J.; Linden, Noah; Montanaro, Ashley

2017-03-01

The traveling-salesman problem is one of the most famous problems in graph theory. However, little is currently known about the extent to which quantum computers could speed up algorithms for the problem. In this paper, we prove a quadratic quantum speedup when the degree of each vertex is at most 3 by applying a quantum backtracking algorithm to a classical algorithm by Xiao and Nagamochi. We then use similar techniques to accelerate a classical algorithm for when the degree of each vertex is at most 4, before speeding up higher-degree graphs via reductions to these instances.

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.

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

PubMed

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

2013-10-01

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

Local adjacency metric dimension of sun graph and stacked book graph

NASA Astrophysics Data System (ADS)

Yulisda Badri, Alifiah; Darmaji

2018-03-01

A graph is a mathematical system consisting of a non-empty set of nodes and a set of empty sides. One of the topics to be studied in graph theory is the metric dimension. Application in the metric dimension is the navigation robot system on a path. Robot moves from one vertex to another vertex in the field by minimizing the errors that occur in translating the instructions (code) obtained from the vertices of that location. To move the robot must give different instructions (code). In order for the robot to move efficiently, the robot must be fast to translate the code of the nodes of the location it passes. so that the location vertex has a minimum distance. However, if the robot must move with the vertex location on a very large field, so the robot can not detect because the distance is too far.[6] In this case, the robot can determine its position by utilizing location vertices based on adjacency. The problem is to find the minimum cardinality of the required location vertex, and where to put, so that the robot can determine its location. The solution to this problem is the dimension of adjacency metric and adjacency metric bases. Rodrguez-Velzquez and Fernau combine the adjacency metric dimensions with local metric dimensions, thus becoming the local adjacency metric dimension. In the local adjacency metric dimension each vertex in the graph may have the same adjacency representation as the terms of the vertices. To obtain the local metric dimension of values in the graph of the Sun and the stacked book graph is used the construction method by considering the representation of each adjacent vertex of the graph.

TMS evidence for a selective role of the precuneus in source memory retrieval.

PubMed

Bonnì, Sonia; Veniero, Domenica; Mastropasqua, Chiara; Ponzo, Viviana; Caltagirone, Carlo; Bozzali, Marco; Koch, Giacomo

2015-04-01

The posteromedial cortex including the precuneus (PC) is thought to be involved in episodic memory retrieval. Here we used continuous theta burst stimulation (cTBS) to disentangle the role of the precuneus in the recognition memory process in a sample of healthy subjects. During the encoding phase, subjects were presented with a series of colored pictures. Afterwards, during the retrieval phase, all previously presented items and a sample of new pictures were presented in black, and subjects were asked to indicate whether each item was new or old, and in the latter case to indicate the associated color. cTBS was delivered over PC, posterior parietal cortex (PPC) and vertex before the retrieval phase. The data were analyzed in terms of hits, false alarms, source errors and omissions. cTBS over the precuneus, but not over the PPC or the vertex, induced a selective decrease in source memory errors, indicating an improvement in context retrieval. All the other accuracy measurements were unchanged. These findings suggest a direct implication of the precuneus in successful context-dependent retrieval. Copyright © 2015 Elsevier B.V. All rights reserved.

Resolution to the B→πK puzzle

NASA Astrophysics Data System (ADS)

Li, Hsiang-Nan; Mishima, Satoshi; Sanda, A. I.

2005-12-01

We calculate the important next-to-leading-order contributions to the B→πK, ππ decays from the vertex corrections, the quark loops, and the magnetic penguins in the perturbative QCD approach. It is found that the latter two reduce the leading-order penguin amplitudes by about 10% and modify only the B→πK branching ratios. The main effect of the vertex corrections is to increase the small color-suppressed tree amplitude by a factor of 3, which then resolves the large difference between the direct CP asymmetries of the B0→π∓K± and B±→π0K± modes. The puzzle from the large B0→π0π0 branching ratio still remains.

Upper bound for the span of pencil graph

NASA Astrophysics Data System (ADS)

Parvathi, N.; Vimala Rani, A.

2018-04-01

An L(2,1)-Coloring or Radio Coloring or λ coloring of a graph is a function f from the vertex set V(G) to the set of all nonnegative integers such that |f(x) ‑ f(y)| ≥ 2 if d(x,y) = 1 and |f(x) ‑ f(y)| ≥ 1 if d(x,y)=2, where d(x,y) denotes the distance between x and y in G. The L(2,1)-coloring number or span number λ(G) of G is the smallest number k such that G has an L(2,1)-coloring with max{f(v) : v ∈ V(G)} = k. [2]The minimum number of colors used in L(2,1)-coloring is called the radio number rn(G) of G (Positive integer). Griggs and yeh conjectured that λ(G) ≤ Δ2 for any simple graph with maximum degree Δ>2. In this article, we consider some special graphs like, n-sunlet graph, pencil graph families and derive its upper bound of (G) and rn(G).

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

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.

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.

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

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.

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.

Statistical physics of hard combinatorial optimization: Vertex cover problem

NASA Astrophysics Data System (ADS)

Zhao, Jin-Hua; Zhou, Hai-Jun

2014-07-01

Typical-case computation complexity is a research topic at the boundary of computer science, applied mathematics, and statistical physics. In the last twenty years, the replica-symmetry-breaking mean field theory of spin glasses and the associated message-passing algorithms have greatly deepened our understanding of typical-case computation complexity. In this paper, we use the vertex cover problem, a basic nondeterministic-polynomial (NP)-complete combinatorial optimization problem of wide application, as an example to introduce the statistical physical methods and algorithms. We do not go into the technical details but emphasize mainly the intuitive physical meanings of the message-passing equations. A nonfamiliar reader shall be able to understand to a large extent the physics behind the mean field approaches and to adjust the mean field methods in solving other optimization problems.

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.

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

Model-based multiple patterning layout decomposition

NASA Astrophysics Data System (ADS)

Guo, Daifeng; Tian, Haitong; Du, Yuelin; Wong, Martin D. F.

2015-10-01

As one of the most promising next generation lithography technologies, multiple patterning lithography (MPL) plays an important role in the attempts to keep in pace with 10 nm technology node and beyond. With feature size keeps shrinking, it has become impossible to print dense layouts within one single exposure. As a result, MPL such as double patterning lithography (DPL) and triple patterning lithography (TPL) has been widely adopted. There is a large volume of literature on DPL/TPL layout decomposition, and the current approach is to formulate the problem as a classical graph-coloring problem: Layout features (polygons) are represented by vertices in a graph G and there is an edge between two vertices if and only if the distance between the two corresponding features are less than a minimum distance threshold value dmin. The problem is to color the vertices of G using k colors (k = 2 for DPL, k = 3 for TPL) such that no two vertices connected by an edge are given the same color. This is a rule-based approach, which impose a geometric distance as a minimum constraint to simply decompose polygons within the distance into different masks. It is not desired in practice because this criteria cannot completely capture the behavior of the optics. For example, it lacks of sufficient information such as the optical source characteristics and the effects between the polygons outside the minimum distance. To remedy the deficiency, a model-based layout decomposition approach to make the decomposition criteria base on simulation results was first introduced at SPIE 2013.1 However, the algorithm1 is based on simplified assumption on the optical simulation model and therefore its usage on real layouts is limited. Recently AMSL2 also proposed a model-based approach to layout decomposition by iteratively simulating the layout, which requires excessive computational resource and may lead to sub-optimal solutions. The approach2 also potentially generates too many stiches. In this paper, we propose a model-based MPL layout decomposition method using a pre-simulated library of frequent layout patterns. Instead of using the graph G in the standard graph-coloring formulation, we build an expanded graph H where each vertex represents a group of adjacent features together with a coloring solution. By utilizing the library and running sophisticated graph algorithms on H, our approach can obtain optimal decomposition results efficiently. Our model-based solution can achieve a practical mask design which significantly improves the lithography quality on the wafer compared to the rule based decomposition.

Anticounterfeiting Quick Response Code with Emission Color of Invisible Metal-Organic Frameworks as Encoding Information.

PubMed

Wang, Yong-Mei; Tian, Xue-Tao; Zhang, Hui; Yang, Zhong-Rui; Yin, Xue-Bo

2018-06-21

Counterfeiting is a global epidemic that is compelling the development of new anticounterfeiting strategy. Herein, we report a novel multiple anticounterfeiting encoding strategy of invisible fluorescent quick response (QR) codes with emission color as information storage unit. The strategy requires red, green, and blue (RGB) light-emitting materials for different emission colors as encrypting information, single excitation for all of the emission for practicability, and ultraviolet (UV) excitation for invisibility under daylight. Therefore, RGB light-emitting nanoscale metal-organic frameworks (NMOFs) are designed as inks to construct the colorful light-emitting boxes for information encrypting, while three black vertex boxes were used for positioning. Full-color emissions are obtained by mixing the trichromatic NMOFs inks through inkjet printer. The encrypting information capacity is easily adjusted by the number of light-emitting boxes with the infinite emission colors. The information is decoded with specific excitation light at 275 nm, making the QR codes invisible under daylight. The composition of inks, invisibility, inkjet printing, and the abundant encrypting information all contribute to multiple anticounterfeiting. The proposed QR codes pattern holds great potential for advanced anticounterfeiting.

Sudden emergence of q-regular subgraphs in random graphs

NASA Astrophysics Data System (ADS)

Pretti, M.; Weigt, M.

2006-07-01

We investigate the computationally hard problem whether a random graph of finite average vertex degree has an extensively large q-regular subgraph, i.e., a subgraph with all vertices having degree equal to q. We reformulate this problem as a constraint-satisfaction problem, and solve it using the cavity method of statistical physics at zero temperature. For q = 3, we find that the first large q-regular subgraphs appear discontinuously at an average vertex degree c3 - reg simeq 3.3546 and contain immediately about 24% of all vertices in the graph. This transition is extremely close to (but different from) the well-known 3-core percolation point c3 - core simeq 3.3509. For q > 3, the q-regular subgraph percolation threshold is found to coincide with that of the q-core.

Torus Knots and the Topological Vertex

NASA Astrophysics Data System (ADS)

Jockers, Hans; Klemm, Albrecht; Soroush, Masoud

2014-08-01

We propose a class of toric Lagrangian A-branes on the resolved conifold that is suitable to describe torus knots on S 3. The key role is played by the transformation, which generates a general torus knot from the unknot. Applying the topological vertex to the proposed A-branes, we rederive the colored HOMFLY polynomials for torus knots, in agreement with the Rosso and Jones formula. We show that our A-model construction is mirror symmetric to the B-model analysis of Brini, Eynard and Mariño. Compared to the recent proposal by Aganagic and Vafa for knots on S 3, we demonstrate that the disk amplitude of the A-brane associated with any knot is sufficient to reconstruct the entire B-model spectral curve. Finally, the construction of toric Lagrangian A-branes is generalized to other local toric Calabi-Yau geometries, which paves the road to study knots in other three-manifolds such as lens spaces.

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.

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.

The In-Transit Vigilant Covering Tour Problem of Routing Unmanned Ground Vehicles

DTIC Science & Technology

2012-08-01

of vertices in both vertex sets V and W, rather than exclusively in the vertex set V. A metaheuristic algorithm which follows the Greedy Randomized...window (VRPTW) approach, with the application of Java-encoded metaheuristic , was used [O’Rourke et al., 2001] for the dynamic routing of UAVs. Harder et...minimize both the two conflicting objectives; tour length and the coverage distance via a multi-objective evolutionary algorithm . This approach avoids a

On the gauge chosen by the bosonic open string

NASA Astrophysics Data System (ADS)

Pesando, Igor

2017-05-01

String theory gives S matrix elements from which is not possible to read any gauge information. Using factorization we go off shell in the simplest and most naive way and we read which are the vertices suggested by string. To compare with the associated Effective Field Theory it is natural to use color ordered vertices. The α‧ = 0 color ordered vertices suggested by string theory are more efficient than the usual ones since the three gluon color ordered vertex has three terms instead of six and the four gluon one has one term instead of three. They are written in the so called Gervais-Neveu gauge. The full Effective Field Theory is in a generalization of the Gervais-Neveu gauge with α‧ corrections. Moreover a field redefinition is required to be mapped to the field used by string theory. We also give an intuitive way of understanding why string choose this gauge in terms of the minimal number of couplings necessary to reproduce the non-abelian amplitudes starting from color ordered ones.

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.

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 .

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

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.

On the r-dynamic chromatic number of the corronation by complete graph

NASA Astrophysics Data System (ADS)

Indah Kristiana, Arika; Imam Utoyo, M.; Dafik

2018-04-01

In this paper we will study the r-dynamic chromatic number of the coronation by complete graph. A proper k-coloring of graph G such that the neighbors of any vertex v receive at least min{r, d(v)} different colors. The r-dynamic chromatic number, χ r (G) is the minimum k such that graph G has an r-dynamic k-coloring. We will obtain lower bound of the r-dynamic chromatic number of {χ }r({K}nȯ H), and {χ }r(Hȯ {K}m) We also study the exact value of the r-dynamic chromatic number of {χ }r({K}nȯ {S}m),{χ }r({K}nȯ {F}m),{χ }r({S}nȯ {K}m),{χ }r({F}nȯ {K}m) and {χ }r({K}nȯ {K}m) for m, n > 3.

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

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.

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

The Thinnest Path Problem

DTIC Science & Technology

2013-10-01

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

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.

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.

On the partition dimension of comb product of path and complete graph

NASA Astrophysics Data System (ADS)

Darmaji, Alfarisi, Ridho

2017-08-01

For a vertex v of a connected graph G(V, E) with vertex set V(G), edge set E(G) and S ⊆ V(G). Given an ordered partition Π = {S1, S2, S3, …, Sk} of the vertex set V of G, the representation of a vertex v ∈ V with respect to Π is the vector r(v|Π) = (d(v, S1), d(v, S2), …, d(v, Sk)), where d(v, Sk) represents the distance between the vertex v and the set Sk and d(v, Sk) = min{d(v, x)|x ∈ Sk}. A partition Π of V(G) is a resolving partition if different vertices of G have distinct representations, i.e., for every pair of vertices u, v ∈ V(G), r(u|Π) ≠ r(v|Π). The minimum k of Π resolving partition is a partition dimension of G, denoted by pd(G). Finding the partition dimension of G is classified to be a NP-Hard problem. In this paper, we will show that the partition dimension of comb product of path and complete graph. The results show that comb product of complete grapph Km and path Pn namely p d (Km⊳Pn)=m where m ≥ 3 and n ≥ 2 and p d (Pn⊳Km)=m where m ≥ 3, n ≥ 2 and m ≥ n.

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.

An iterated local search algorithm for the team orienteering problem with variable profits

NASA Astrophysics Data System (ADS)

Gunawan, Aldy; Ng, Kien Ming; Kendall, Graham; Lai, Junhan

2018-07-01

The orienteering problem (OP) is a routing problem that has numerous applications in various domains such as logistics and tourism. The objective is to determine a subset of vertices to visit for a vehicle so that the total collected score is maximized and a given time budget is not exceeded. The extensive application of the OP has led to many different variants, including the team orienteering problem (TOP) and the team orienteering problem with time windows. The TOP extends the OP by considering multiple vehicles. In this article, the team orienteering problem with variable profits (TOPVP) is studied. The main characteristic of the TOPVP is that the amount of score collected from a visited vertex depends on the duration of stay on that vertex. A mathematical programming model for the TOPVP is first presented and an algorithm based on iterated local search (ILS) that is able to solve modified benchmark instances is then proposed. It is concluded that ILS produces solutions which are comparable to those obtained by the commercial solver CPLEX for smaller instances. For the larger instances, ILS obtains good-quality solutions that have significantly better objective value than those found by CPLEX under reasonable computational times.

Measurements of B → J / ψ at forward rapidity in p + p collisions at s = 510 GeV

DOE PAGES

Aidala, C.; Ajitanand, N. N.; Akiba, Y.; ...

2017-05-02

Inmore » this paper, we report the first measurement of the fraction of J / ψ mesons coming from Β-meson decay (F Β→ J / ψ ) in p + p collisions at s = 510 GeV . The measurement is performed using the forward silicon vertex detector and central vertex detector at PHENIX, which provide precise tracking and distance-of-closest-approach determinations, enabling the statistical separation of J / ψ due to Β-meson decays from prompt J / ψ . The measured value of F Β→ J / ψ is 8.1% ± 2.3%(stat) ± 1.9%(syst) for J / ψ with transverse momenta 0 < p T < 5 GeV / c and rapidity 1.2 < |y| < 2.2. The measured fraction F Β→ J / ψ at PHENIX is compared to values measured by other experiments at higher center of mass energies and to fixed-order-next-to-leading-logarithm and color-evaporation-model predictions. The bb cross section per unit rapidity [dσ / dy(pp → bb)] extracted from the obtained F Β→ J / ψ and the PHENIX inclusive J / ψ cross section measured at 200 GeV scaled with color-evaporation-model calculations, at the mean Β hadron rapidity y = ±1.7 in 510 GeV p + p collisions, is 3.63 +1.92 -1.70 μb. Finally, it is consistent with the fixed-order-next-to-leading-logarithm calculations.« less

Measurements of B → J / ψ at forward rapidity in p + p collisions at s = 510 GeV

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

Aidala, C.; Ajitanand, N. N.; Akiba, Y.

Inmore » this paper, we report the first measurement of the fraction of J / ψ mesons coming from Β-meson decay (F Β→ J / ψ ) in p + p collisions at s = 510 GeV . The measurement is performed using the forward silicon vertex detector and central vertex detector at PHENIX, which provide precise tracking and distance-of-closest-approach determinations, enabling the statistical separation of J / ψ due to Β-meson decays from prompt J / ψ . The measured value of F Β→ J / ψ is 8.1% ± 2.3%(stat) ± 1.9%(syst) for J / ψ with transverse momenta 0 < p T < 5 GeV / c and rapidity 1.2 < |y| < 2.2. The measured fraction F Β→ J / ψ at PHENIX is compared to values measured by other experiments at higher center of mass energies and to fixed-order-next-to-leading-logarithm and color-evaporation-model predictions. The bb cross section per unit rapidity [dσ / dy(pp → bb)] extracted from the obtained F Β→ J / ψ and the PHENIX inclusive J / ψ cross section measured at 200 GeV scaled with color-evaporation-model calculations, at the mean Β hadron rapidity y = ±1.7 in 510 GeV p + p collisions, is 3.63 +1.92 -1.70 μb. Finally, it is consistent with the fixed-order-next-to-leading-logarithm calculations.« less

Cortical and subcortical gray matter bases of cognitive deficits in REM sleep behavior disorder.

PubMed

Rahayel, Shady; Postuma, Ronald B; Montplaisir, Jacques; Génier Marchand, Daphné; Escudier, Frédérique; Gaubert, Malo; Bourgouin, Pierre-Alexandre; Carrier, Julie; Monchi, Oury; Joubert, Sven; Blanc, Frédéric; Gagnon, Jean-François

2018-05-15

To investigate cortical and subcortical gray matter abnormalities underlying cognitive impairment in patients with REM sleep behavior disorder (RBD) with or without mild cognitive impairment (MCI). Fifty-two patients with RBD, including 17 patients with MCI, were recruited and compared to 41 controls. All participants underwent extensive clinical assessments, neuropsychological examination, and 3-tesla MRI acquisition of T1 anatomical images. Vertex-based cortical analyses of volume, thickness, and surface area were performed to investigate cortical abnormalities between groups, whereas vertex-based shape analysis was performed to investigate subcortical structure surfaces. Correlations were performed to investigate associations between cortical and subcortical metrics, cognitive domains, and other markers of neurodegeneration (color discrimination, olfaction, and autonomic measures). Patients with MCI had cortical thinning in the frontal, cingulate, temporal, and occipital cortices, and abnormal surface contraction in the lenticular nucleus and thalamus. Patients without MCI had cortical thinning restricted to the frontal cortex. Lower patient performance in cognitive domains was associated with cortical and subcortical abnormalities. Moreover, impaired performance on olfaction, color discrimination, and autonomic measures was associated with thinning in the occipital lobe. Cortical and subcortical gray matter abnormalities are associated with cognitive status in patients with RBD, with more extensive patterns in patients with MCI. Our results highlight the importance of distinguishing between subgroups of patients with RBD according to cognitive status in order to better understand the neurodegenerative process in this population. © 2018 American Academy of Neurology.

Measurements of B →J /ψ at forward rapidity in p +p collisions at √{s }=510 GeV

NASA Astrophysics Data System (ADS)

Aidala, C.; Ajitanand, N. N.; Akiba, Y.; Akimoto, R.; Alexander, J.; Alfred, M.; Aoki, K.; Apadula, N.; Asano, H.; Atomssa, E. T.; Attila, A.; Awes, T. C.; Ayuso, C.; Azmoun, B.; Babintsev, V.; Bai, M.; Bai, X.; Bannier, B.; Barish, K. N.; Bathe, S.; Baublis, V.; Baumann, C.; Baumgart, S.; Bazilevsky, A.; Beaumier, M.; Belmont, R.; Berdnikov, A.; Berdnikov, Y.; Black, D.; Blau, D. S.; Boer, M.; Bok, J. S.; Boyle, K.; Brooks, M. L.; Bryslawskyj, J.; Buesching, H.; Bumazhnov, V.; Butler, C.; Butsyk, S.; Campbell, S.; Canoaroman, C.; Chen, C.-H.; Chi, C. Y.; Chiu, M.; Choi, I. J.; Choi, J. B.; Choi, S.; Christiansen, P.; Chujo, T.; Cianciolo, V.; Cole, B. A.; Connors, M.; Cronin, N.; Crossette, N.; Csanád, M.; Csörgő, T.; Danley, T. W.; Datta, A.; Daugherity, M. S.; David, G.; Deblasio, K.; Dehmelt, K.; Denisov, A.; Deshpande, A.; Desmond, E. J.; Ding, L.; Do, J. H.; D'Orazio, L.; Drapier, O.; Drees, A.; Drees, K. A.; Dumancic, M.; Durham, J. M.; Durum, A.; Elder, T.; Engelmore, T.; Enokizono, A.; Esumi, S.; Eyser, K. O.; Fadem, B.; Fan, W.; Feege, N.; Fields, D. E.; Finger, M.; Finger, M.; Fleuret, F.; Fokin, S. L.; Frantz, J. E.; Franz, A.; Frawley, A. D.; Fukao, Y.; Fukuda, Y.; Fusayasu, T.; Gainey, K.; Gal, C.; Garg, P.; Garishvili, A.; Garishvili, I.; Ge, H.; Giordano, F.; Glenn, A.; Gong, X.; Gonin, M.; Goto, Y.; Granier de Cassagnac, R.; Grau, N.; Greene, S. V.; Grosse Perdekamp, M.; Gu, Y.; Gunji, T.; Guragain, H.; Hachiya, T.; Haggerty, J. S.; Hahn, K. I.; Hamagaki, H.; Han, S. Y.; Hanks, J.; Hasegawa, S.; Haseler, T. O. S.; Hashimoto, K.; Hayano, R.; He, X.; Hemmick, T. K.; Hester, T.; Hill, J. C.; Hill, K.; Hollis, R. S.; Homma, K.; Hong, B.; Hoshino, T.; Hotvedt, N.; Huang, J.; Huang, S.; Ichihara, T.; Ikeda, Y.; Imai, K.; Imazu, Y.; Inaba, M.; Iordanova, A.; Isenhower, D.; Isinhue, A.; Ito, Y.; Ivanishchev, D.; Jacak, B. V.; Jeon, S. J.; Jezghani, M.; Ji, Z.; Jia, J.; Jiang, X.; Johnson, B. M.; Joo, K. S.; Jorjadze, V.; Jouan, D.; Jumper, D. S.; Kamin, J.; Kanda, S.; Kang, B. H.; Kang, J. H.; Kang, J. S.; Kapukchyan, D.; Kapustinsky, J.; Karthas, S.; Kawall, D.; Kazantsev, A. V.; Key, J. A.; Khachatryan, V.; Khandai, P. K.; Khanzadeev, A.; Kijima, K. M.; Kim, C.; Kim, D. J.; Kim, E.-J.; Kim, M.; Kim, M. H.; Kim, Y.-J.; Kim, Y. K.; Kincses, D.; Kistenev, E.; Klatsky, J.; Kleinjan, D.; Kline, P.; Koblesky, T.; Kofarago, M.; Komkov, B.; Koster, J.; Kotchetkov, D.; Kotov, D.; Krizek, F.; Kudo, S.; Kurita, K.; Kurosawa, M.; Kwon, Y.; Lacey, R.; Lai, Y. S.; Lajoie, J. G.; Lallow, E. O.; Lebedev, A.; Lee, D. M.; Lee, G. H.; Lee, J.; Lee, K. B.; Lee, K. S.; Lee, S. H.; Leitch, M. J.; Leitgab, M.; Leung, Y. H.; Lewis, B.; Lewis, N. A.; Li, X.; Li, X.; Lim, S. H.; Liu, L. D.; Liu, M. X.; Loggins, V.-R.; Lokos, S.; Lynch, D.; Maguire, C. F.; Makdisi, Y. I.; Makek, M.; Manion, A.; Manko, V. I.; Mannel, E.; McCumber, M.; McGaughey, P. L.; McGlinchey, D.; McKinney, C.; Meles, A.; Mendoza, M.; Meredith, B.; Miake, Y.; Mibe, T.; Mignerey, A. C.; Mihalik, D. E. M.; Milov, A.; Mishra, D. K.; Mitchell, J. T.; Mitsuka, G.; Miyasaka, S.; Mizuno, S.; Mohanty, A. K.; Mohapatra, S.; Moon, T.; Morrison, D. P.; Morrow, S. I. M.; Moskowitz, M.; Moukhanova, T. V.; Murakami, T.; Murata, J.; Mwai, A.; Nagae, T.; Nagai, K.; Nagamiya, S.; Nagashima, K.; Nagashima, T.; Nagle, J. L.; Nagy, M. I.; Nakagawa, I.; Nakagomi, H.; Nakamiya, Y.; Nakamura, K. R.; Nakamura, T.; Nakano, K.; Nattrass, C.; Netrakanti, P. K.; Nihashi, M.; Niida, T.; Nouicer, R.; Novák, T.; Novitzky, N.; Novotny, R.; Nyanin, A. S.; O'Brien, E.; Ogilvie, C. A.; Oide, H.; Okada, K.; Orjuela Koop, J. D.; Osborn, J. D.; Oskarsson, A.; Ozawa, K.; Pak, R.; Pantuev, V.; Papavassiliou, V.; Park, I. H.; Park, J. S.; Park, S.; Park, S. K.; Pate, S. F.; Patel, L.; Patel, M.; Peng, J.-C.; Peng, W.; Perepelitsa, D. V.; Perera, G. D. N.; Peressounko, D. Yu.; Perezlara, C. E.; Perry, J.; Petti, R.; Phipps, M.; Pinkenburg, C.; Pisani, R. P.; Pun, A.; Purschke, M. L.; Qu, H.; Radzevich, P. V.; Rak, J.; Ravinovich, I.; Read, K. F.; Reynolds, D.; Riabov, V.; Riabov, Y.; Richardson, E.; Richford, D.; Rinn, T.; Riveli, N.; Roach, D.; Rolnick, S. D.; Rosati, M.; Rowan, Z.; Runchey, J.; Ryu, M. S.; Sahlmueller, B.; Saito, N.; Sakaguchi, T.; Sako, H.; Samsonov, V.; Sarsour, M.; Sato, K.; Sato, S.; Sawada, S.; Schaefer, B.; Schmoll, B. K.; Sedgwick, K.; Seele, J.; Seidl, R.; Sekiguchi, Y.; Sen, A.; Seto, R.; Sett, P.; Sexton, A.; Sharma, D.; Shaver, A.; Shein, I.; Shibata, T.-A.; Shigaki, K.; Shimomura, M.; Shoji, K.; Shukla, P.; Sickles, A.; Silva, C. L.; Silvermyr, D.; Singh, B. K.; Singh, C. P.; Singh, V.; Skoby, M. J.; Skolnik, M.; Slunečka, M.; Smith, K. L.; Solano, S.; Soltz, R. A.; Sondheim, W. E.; Sorensen, S. P.; Sourikova, I. V.; Stankus, P. W.; Steinberg, P.; Stenlund, E.; Stepanov, M.; Ster, A.; Stoll, S. P.; Stone, M. R.; Sugitate, T.; Sukhanov, A.; Sun, J.; Syed, S.; Takahara, A.; Taketani, A.; Tanaka, Y.; Tanida, K.; Tannenbaum, M. J.; Tarafdar, S.; Taranenko, A.; Tarnai, G.; Tennant, E.; Tieulent, R.; Timilsina, A.; Todoroki, T.; Tomášek, M.; Torii, H.; Towell, C. L.; Towell, R. S.; Tserruya, I.; Ueda, Y.; Ujvari, B.; van Hecke, H. W.; Vargyas, M.; Vazquez-Carson, S.; Vazquez-Zambrano, E.; Veicht, A.; Velkovska, J.; Vértesi, R.; Virius, M.; Vrba, V.; Vznuzdaev, E.; Wang, X. R.; Wang, Z.; Watanabe, D.; Watanabe, K.; Watanabe, Y.; Watanabe, Y. S.; Wei, F.; Whitaker, S.; Wolin, S.; Wong, C. P.; Woody, C. L.; Wysocki, M.; Xia, B.; Xu, C.; Xu, Q.; Yamaguchi, Y. L.; Yanovich, A.; Yin, P.; Yokkaichi, S.; Yoo, J. H.; Yoon, I.; You, Z.; Younus, I.; Yu, H.; Yushmanov, I. E.; Zajc, W. A.; Zelenski, A.; Zharko, S.; Zhou, S.; Zou, L.; Phenix Collaboration

2017-05-01

We report the first measurement of the fraction of J /ψ mesons coming from B -meson decay (FB →J /ψ) in p +p collisions at √{s }=510 GeV . The measurement is performed using the forward silicon vertex detector and central vertex detector at PHENIX, which provide precise tracking and distance-of-closest-approach determinations, enabling the statistical separation of J /ψ due to B -meson decays from prompt J /ψ . The measured value of FB →J /ψ is 8.1 %±2.3 %(stat)±1.9 %(syst) for J /ψ with transverse momenta 0

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.

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.

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

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.

A note on closed-string interactions a la witten

NASA Astrophysics Data System (ADS)

Romans, L. J.

1987-08-01

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

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.

Statistical mechanics of the vertex-cover problem

NASA Astrophysics Data System (ADS)

Hartmann, Alexander K.; Weigt, Martin

2003-10-01

We review recent progress in the study of the vertex-cover problem (VC). The VC belongs to the class of NP-complete graph theoretical problems, which plays a central role in theoretical computer science. On ensembles of random graphs, VC exhibits a coverable-uncoverable phase transition. Very close to this transition, depending on the solution algorithm, easy-hard transitions in the typical running time of the algorithms occur. We explain a statistical mechanics approach, which works by mapping the VC to a hard-core lattice gas, and then applying techniques such as the replica trick or the cavity approach. Using these methods, the phase diagram of the VC could be obtained exactly for connectivities c < e, where the VC is replica symmetric. Recently, this result could be confirmed using traditional mathematical techniques. For c > e, the solution of the VC exhibits full replica symmetry breaking. The statistical mechanics approach can also be used to study analytically the typical running time of simple complete and incomplete algorithms for the VC. Finally, we describe recent results for the VC when studied on other ensembles of finite- and infinite-dimensional graphs.

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.

Finite plateau in spectral gap of polychromatic constrained random networks

NASA Astrophysics Data System (ADS)

Avetisov, V.; Gorsky, A.; Nechaev, S.; Valba, O.

2017-12-01

We consider critical behavior in the ensemble of polychromatic Erdős-Rényi networks and regular random graphs, where network vertices are painted in different colors. The links can be randomly removed and added to the network subject to the condition of the vertex degree conservation. In these constrained graphs we run the Metropolis procedure, which favors the connected unicolor triads of nodes. Changing the chemical potential, μ , of such triads, for some wide region of μ , we find the formation of a finite plateau in the number of intercolor links, which exactly matches the finite plateau in the network algebraic connectivity (the value of the first nonvanishing eigenvalue of the Laplacian matrix, λ2). We claim that at the plateau the spontaneously broken Z2 symmetry is restored by the mechanism of modes collectivization in clusters of different colors. The phenomena of a finite plateau formation holds also for polychromatic networks with M ≥2 colors. The behavior of polychromatic networks is analyzed via the spectral properties of their adjacency and Laplacian matrices.

Application of 3D reconstruction system in diabetic foot ulcer injury assessment

NASA Astrophysics Data System (ADS)

Li, Jun; Jiang, Li; Li, Tianjian; Liang, Xiaoyao

2018-04-01

To deal with the considerable deviation of transparency tracing method and digital planimetry method used in current clinical diabetic foot ulcer injury assessment, this paper proposes a 3D reconstruction system which can be used to get foot model with good quality texture, then injury assessment is done by measuring the reconstructed model. The system uses the Intel RealSense SR300 depth camera which is based on infrared structured-light as input device, the required data from different view is collected by moving the camera around the scanned object. The geometry model is reconstructed by fusing the collected data, then the mesh is sub-divided to increase the number of mesh vertices and the color of each vertex is determined using a non-linear optimization, all colored vertices compose the surface texture of the reconstructed model. Experimental results indicate that the reconstructed model has millimeter-level geometric accuracy and texture with few artificial effect.

Improved quantum backtracking algorithms using effective resistance estimates

NASA Astrophysics Data System (ADS)

Jarret, Michael; Wan, Kianna

2018-02-01

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

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

NASA Astrophysics Data System (ADS)

Ekstrand, Joel

2011-02-01

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

Trace for Differential Pencils on a Star-Type Graph

NASA Astrophysics Data System (ADS)

Yang, Chuan-Fu

2013-07-01

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

Gluing silicon with silicone

NASA Astrophysics Data System (ADS)

Abt, I.; Fox, H.; Moshous, B.; Richter, R. H.; Riechmann, K.; Rietz, M.; Riedl, J.; Denis, R. St; Wagner, W.

1998-02-01

Problems and solutions concerning the gluing of silicon detectors are discussed. The R & D work for the HERA- B vertex detector system led to gluing studies with epoxy and silicone-based adhesives used on ceramics and carbon fibre. The HERA- B solution using a silicone glue is presented.

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

Visweswara Sathanur, Arun; Choudhury, Sutanay; Joslyn, Cliff A.

Property graphs can be used to represent heterogeneous networks with attributed vertices and edges. Given one property graph, simulating another graph with same or greater size with identical statistical properties with respect to the attributes and connectivity is critical for privacy preservation and benchmarking purposes. In this work we tackle the problem of capturing the statistical dependence of the edge connectivity on the vertex labels and using the same distribution to regenerate property graphs of the same or expanded size in a scalable manner. However, accurate simulation becomes a challenge when the attributes do not completely explain the network structure.more » We propose the Property Graph Model (PGM) approach that uses an attribute (or label) augmentation strategy to mitigate the problem and preserve the graph connectivity as measured via degree distribution, vertex label distributions and edge connectivity. Our proposed algorithm is scalable with a linear complexity in the number of edges in the target graph. We illustrate the efficacy of the PGM approach in regenerating and expanding the datasets by leveraging two distinct illustrations.« less

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.

Trapped surfaces and emergent curved space in the Bose-Hubbard model

NASA Astrophysics Data System (ADS)

Caravelli, Francesco; Hamma, Alioscia; Markopoulou, Fotini; Riera, Arnau

2012-02-01

A Bose-Hubbard model on a dynamical lattice was introduced in previous work as a spin system analogue of emergent geometry and gravity. Graphs with regions of high connectivity in the lattice were identified as candidate analogues of spacetime geometries that contain trapped surfaces. We carry out a detailed study of these systems and show explicitly that the highly connected subgraphs trap matter. We do this by solving the model in the limit of no back-reaction of the matter on the lattice, and for states with certain symmetries that are natural for our problem. We find that in this case the problem reduces to a one-dimensional Hubbard model on a lattice with variable vertex degree and multiple edges between the same two vertices. In addition, we obtain a (discrete) differential equation for the evolution of the probability density of particles which is closed in the classical regime. This is a wave equation in which the vertex degree is related to the local speed of propagation of probability. This allows an interpretation of the probability density of particles similar to that in analogue gravity systems: matter inside this analogue system sees a curved spacetime. We verify our analytic results by numerical simulations. Finally, we analyze the dependence of localization on a gradual, rather than abrupt, falloff of the vertex degree on the boundary of the highly connected region and find that matter is localized in and around that region.

Cell nuclei attributed relational graphs for efficient representation and classification of gastric cancer in digital histopathology

NASA Astrophysics Data System (ADS)

Sharma, Harshita; Zerbe, Norman; Heim, Daniel; Wienert, Stephan; Lohmann, Sebastian; Hellwich, Olaf; Hufnagl, Peter

2016-03-01

This paper describes a novel graph-based method for efficient representation and subsequent classification in histological whole slide images of gastric cancer. Her2/neu immunohistochemically stained and haematoxylin and eosin stained histological sections of gastric carcinoma are digitized. Immunohistochemical staining is used in practice by pathologists to determine extent of malignancy, however, it is laborious to visually discriminate the corresponding malignancy levels in the more commonly used haematoxylin and eosin stain, and this study attempts to solve this problem using a computer-based method. Cell nuclei are first isolated at high magnification using an automatic cell nuclei segmentation strategy, followed by construction of cell nuclei attributed relational graphs of the tissue regions. These graphs represent tissue architecture comprehensively, as they contain information about cell nuclei morphology as vertex attributes, along with knowledge of neighborhood in the form of edge linking and edge attributes. Global graph characteristics are derived and ensemble learning is used to discriminate between three types of malignancy levels, namely, non-tumor, Her2/neu positive tumor and Her2/neu negative tumor. Performance is compared with state of the art methods including four texture feature groups (Haralick, Gabor, Local Binary Patterns and Varma Zisserman features), color and intensity features, and Voronoi diagram and Delaunay triangulation. Texture, color and intensity information is also combined with graph-based knowledge, followed by correlation analysis. Quantitative assessment is performed using two cross validation strategies. On investigating the experimental results, it can be concluded that the proposed method provides a promising way for computer-based analysis of histopathological images of gastric cancer.

The TSP-approach to approximate solving the m-Cycles Cover Problem

NASA Astrophysics Data System (ADS)

Gimadi, Edward Kh.; Rykov, Ivan; Tsidulko, Oxana

2016-10-01

In the m-Cycles Cover problem it is required to find a collection of m vertex-disjoint cycles that covers all vertices of the graph and the total weight of edges in the cover is minimum (or maximum). The problem is a generalization of the Traveling salesmen problem. It is strongly NP-hard. We discuss a TSP-approach that gives polynomial approximate solutions for this problem. It transforms an approximation TSP algorithm into an approximation m-CCP algorithm. In this paper we present a number of successful transformations with proven performance guarantees for the obtained solutions.

Transforming graph states using single-qubit operations.

PubMed

Dahlberg, Axel; Wehner, Stephanie

2018-07-13

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

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.

Ink Wash Painting Style Rendering With Physically-based Ink Dispersion Model

NASA Astrophysics Data System (ADS)

Wang, Yifan; Li, Weiran; Zhu, Qing

2018-04-01

This paper presents a real-time rendering method based on the GPU programmable pipeline for rendering the 3D scene in ink wash painting style. The method is divided into main three parts: First, render the ink properties of 3D model by calculating its vertex curvature. Then, cached the ink properties to a paper structure and using an ink dispersion model which is defined by referencing the theory of porous media to simulate the dispersion of ink. Finally, convert the ink properties to the pixel color information and render it to the screen. This method has a better performance than previous methods in visual quality.

Nonlinear Fourier algorithm applied to solving equations of gravitational gas dynamics

NASA Technical Reports Server (NTRS)

Kolosov, B. I.

1979-01-01

Two dimensional gas flow problems were reduced to an approximating system of common differential equations, which were solved by a standard procedure of the Runge-Kutta type. A theorem of the existence of stationary conical shock waves with the cone vertex in the gravitating center was proved.

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

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

Korotkova, Anna M.; Lukstins, Juris

2010-01-05

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

Faster search by lackadaisical quantum walk

NASA Astrophysics Data System (ADS)

Wong, Thomas G.

2018-03-01

In the typical model, a discrete-time coined quantum walk searching the 2D grid for a marked vertex achieves a success probability of O(1/log N) in O(√{N log N}) steps, which with amplitude amplification yields an overall runtime of O(√{N} log N). We show that making the quantum walk lackadaisical or lazy by adding a self-loop of weight 4 / N to each vertex speeds up the search, causing the success probability to reach a constant near 1 in O(√{N log N}) steps, thus yielding an O(√{log N}) improvement over the typical, loopless algorithm. This improved runtime matches the best known quantum algorithms for this search problem. Our results are based on numerical simulations since the algorithm is not an instance of the abstract search algorithm.

Multiloop functional renormalization group for general models

NASA Astrophysics Data System (ADS)

Kugler, Fabian B.; von Delft, Jan

2018-02-01

We present multiloop flow equations in the functional renormalization group (fRG) framework for the four-point vertex and self-energy, formulated for a general fermionic many-body problem. This generalizes the previously introduced vertex flow [F. B. Kugler and J. von Delft, Phys. Rev. Lett. 120, 057403 (2018), 10.1103/PhysRevLett.120.057403] and provides the necessary corrections to the self-energy flow in order to complete the derivative of all diagrams involved in the truncated fRG flow. Due to its iterative one-loop structure, the multiloop flow is well suited for numerical algorithms, enabling improvement of many fRG computations. We demonstrate its equivalence to a solution of the (first-order) parquet equations in conjunction with the Schwinger-Dyson equation for the self-energy.

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

Kinematics and M(sub v) calibration of K and M dwarf stars using Hipparcos data

NASA Technical Reports Server (NTRS)

Upgren, A. R.; Ratnatunga, K. U.; Casertano, S.; Weis, E.

1997-01-01

The luminosities and kinematics of lower main sequence stars in a spectroscopically selected sample covering spectral types K 3 to M 5 are determined using Hipparcos parallaxes and proper motions. The stars separate into two kinematically distinct components, called young disk and old disk components. The young component has velocity dispersion (30, 17, 12) km/s in the U, V and W directions, respectively, and features an asymmetric drift of 8 km/s, a vertex deviation of 10 +/- 3 deg and an absolute magnitude of 10.48 mag at color (R - I)(sub Kron) = 1.0 mag. The respective features of the old component are: (56, 34, 31) km/s, 28 km/s and 0.6 mag at the same color. The slope and intrinsic width of the magnitude calibration of each component are determined. The analysis is used to investigate the possible presence of residual systematic discrepancies of the model with Hipparcos data. There are indications of a possible underestimation of the parallax errors.

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.

A Stochastic Approach to Path Planning in the Weighted-Region Problem

DTIC Science & Technology

1991-03-01

polynomial time. However, the polyhedrons in this three-dimensional obstacle-avoidance problem are all obstacles (i.e. travel is not permitted within...them). Therefore, optimal paths tend to avoid their vertices, and settle into closest approach tangents across polyhedron edges. So, in a sense...intersection update map database with new vertex for this edge 3. IF (C1 > D) and (C2 > D) THEN edge intersects ellipse at two points OR edge is

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.

Optimization of Cubic Polynomial Functions without Calculus

ERIC Educational Resources Information Center

Taylor, Ronald D., Jr.; Hansen, Ryan

2008-01-01

In algebra and precalculus courses, students are often asked to find extreme values of polynomial functions in the context of solving an applied problem; but without the notion of derivative, something is lost. Either the functions are reduced to quadratics, since students know the formula for the vertex of a parabola, or solutions are…

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.

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.

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

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

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.

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.

Fuzzy simulation in concurrent engineering

NASA Technical Reports Server (NTRS)

Kraslawski, A.; Nystrom, L.

1992-01-01

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

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.

Participation in the ARGUS experiment at the DORIS collider at DESY, Hamburg, Germany

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

Darden, C.

1986-03-27

Progress reported for 1985 includes publishing final results for investigation of F mesons. Particle decays were sought including a gamma line at 9.46 GeV. One such decay was Upsilon(1S)..--> gamma..H/sup 0/. A search for fractionally charged particles is reported. The muon pair branching ratio was determined for decays of the Upsilon(2S). Six anti-deuterons were seen in a data sample of over 720,000 electron-positron annihilation events. A clear D/sup 0/ signal was seen in the K/sup +/K/sup -/ channel. Results were obtained for the radiative transitions from the Upsilon(2S) to the 1/sup 3/P states of the banti-b system. Fifteen events weremore » also seen which were interpreted to be the color suppressed decay of a B meson to J/psi. A new upper limit was set for the mass of the tau neutrino. A CAMAC booster was used to reduce dead time in the experiment. New preamplifiers raised the vertex drift chambers enough above the electromagnetic noise of the storage ring that it was no longer a problem. The performance of the inner compensation coils, storage ring, and main drift chamber are reported, as well as the time of flight, shower, and muon counters. (LEW)« less

The Full Ward-Takahashi Identity for Colored Tensor Models

NASA Astrophysics Data System (ADS)

Pérez-Sánchez, Carlos I.

2018-03-01

Colored tensor models (CTM) is a random geometrical approach to quantum gravity. We scrutinize the structure of the connected correlation functions of general CTM-interactions and organize them by boundaries of Feynman graphs. For rank- D interactions including, but not restricted to, all melonic φ^4 -vertices—to wit, solely those quartic vertices that can lead to dominant spherical contributions in the large- N expansion—the aforementioned boundary graphs are shown to be precisely all (possibly disconnected) vertex-bipartite regularly edge- D-colored graphs. The concept of CTM-compatible boundary-graph automorphism is introduced and an auxiliary graph calculus is developed. With the aid of these constructs, certain U (∞)-invariance of the path integral measure is fully exploited in order to derive a strong Ward-Takahashi Identity for CTMs with a symmetry-breaking kinetic term. For the rank-3 φ^4 -theory, we get the exact integral-like equation for the 2-point function. Similarly, exact equations for higher multipoint functions can be readily obtained departing from this full Ward-Takahashi identity. Our results hold for some Group Field Theories as well. Altogether, our non-perturbative approach trades some graph theoretical methods for analytical ones. We believe that these tools can be extended to tensorial SYK-models.

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.

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.

Explicit calculation of the two-loop corrections to the chiral magnetic effect with the NJL model

NASA Astrophysics Data System (ADS)

Chu, Kit-fai; Huang, Peng-hui; Liu, Hui

2018-05-01

The chiral magnetic effect (CME) is usually believed to not receive higher-order corrections due to the nonrenormalization of the AVV triangle diagram in the framework of quantum field theory. However, the CME-relevant triangle, which is obtained by expanding the current-current correlation, requires zero momentum on the axial vertex and is not equivalent to the general AVV triangle when taking the zero-momentum limit owing to the infrared problem on the axial vertex. Therefore, it is still significant to check if there exists perturbative higher-order corrections to the current-current correlation. In this paper, we explicitly calculate the two-loop corrections of CME within the Nambu-Jona-Lasinio model with a Chern-Simons term, which ensures a consistent μ5 . The result shows the two-loop corrections to the CME conductivity are zero, which confirms the nonrenomalization of CME conductivity.

A vertex similarity index for better personalized recommendation

NASA Astrophysics Data System (ADS)

Chen, Ling-Jiao; Zhang, Zi-Ke; Liu, Jin-Hu; Gao, Jian; Zhou, Tao

2017-01-01

Recommender systems benefit us in tackling the problem of information overload by predicting our potential choices among diverse niche objects. So far, a variety of personalized recommendation algorithms have been proposed and most of them are based on similarities, such as collaborative filtering and mass diffusion. Here, we propose a novel vertex similarity index named CosRA, which combines advantages of both the cosine index and the resource-allocation (RA) index. By applying the CosRA index to real recommender systems including MovieLens, Netflix and RYM, we show that the CosRA-based method has better performance in accuracy, diversity and novelty than some benchmark methods. Moreover, the CosRA index is free of parameters, which is a significant advantage in real applications. Further experiments show that the introduction of two turnable parameters cannot remarkably improve the overall performance of the CosRA index.

Boosting the discriminative power of color models for feature detection

NASA Astrophysics Data System (ADS)

Stokman, Harro M. G.; Gevers, Theo

2005-01-01

We consider the well-known problem of segmenting a color image into foreground-background pixels. Such result can be obtained by segmenting the red, green and blue channels directly. Alternatively, the result may be obtained through the transformation of the color image into other color spaces, such as HSV or normalized colors. The problem then is how to select the color space or color channel that produces the best segmentation result. Furthermore, if more than one channels are equally good candidates, the next problem is how to combine the results. In this article, we investigate if the principles of the formal model for diversification of Markowitz (1952) can be applied to solve the problem. We verify, in theory and in practice, that the proposed diversification model can be applied effectively to determine the most appropriate combination of color spaces for the application at hand.

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)

The Psychological Four-Color Mapping Problem

ERIC Educational Resources Information Center

Francis, Gregory; Bias, Keri; Shive, Joshua

2010-01-01

Mathematicians have proven that four colors are sufficient to color 2-D maps so that no neighboring regions share the same color. Here we consider the psychological 4-color problem: Identifying which 4 colors should be used to make a map easy to use. We build a model of visual search for this design task and demonstrate how to apply it to the task…

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.

Color Vision Deficiency and Color Blindness: An Introduction to the Problem.

ERIC Educational Resources Information Center

Olsen, Mary Margaret; Harris, Kenneth R.

The paper examines issues concerned with the education and employment of individuals, primarily males, with color vision deficiency. After a brief introduction, the first chapter looks at adult problems such as employment areas in which the disability presents problems. The next chapter considers problems of children, noting the heavy use of color…

Color and Contingency in Robert Boyle's Works.

PubMed

Baker, Tawrin

2015-01-01

This essay investigates the relationship between color and contingency in Robert Boyle's Experiments and Considerations Touching Colours (1664) and his essays on the unsuccessfulness of experiments in Certain Physiological Essays (1661). In these two works Boyle wrestles with a difficult practical and philosophical problem with experiments, which he calls the problem of contingency. In Touching Colours, the problem of contingency is magnified by the much-debated issue of whether color had any deep epistemic importance. His limited theoretical principle guiding him in Touching Colours, that color is but modified light, further exacerbated the problem. Rather than theory, Boyle often relied on craftsmen, whose mastery of color phenomena was, Boyle mentions, brought about by economic forces, to determine when colors were indicators of important 'inward' properties of substances, and thus to secure a solid foundation for his experimental history of color.

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.

Locating domination number of m-shadowing of graphs

NASA Astrophysics Data System (ADS)

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

2018-04-01

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

Observations of classical cepheids

NASA Technical Reports Server (NTRS)

Pel, J. W.

1980-01-01

The observations of classical Cepheids are reviewed. The main progress that has been made is summarized and some of the problems yet to be solved are discussed. The problems include color excesses, calibration of color, duplicity, ultraviolet colors, temperature-color relations, mass discrepancies, and radius determination.

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

A restricted Steiner tree problem is solved by Geometric Method II

NASA Astrophysics Data System (ADS)

Lin, Dazhi; Zhang, Youlin; Lu, Xiaoxu

2013-03-01

The minimum Steiner tree problem has wide application background, such as transportation system, communication network, pipeline design and VISL, etc. It is unfortunately that the computational complexity of the problem is NP-hard. People are common to find some special problems to consider. In this paper, we first put forward a restricted Steiner tree problem, which the fixed vertices are in the same side of one line L and we find a vertex on L such the length of the tree is minimal. By the definition and the complexity of the Steiner tree problem, we know that the complexity of this problem is also Np-complete. In the part one, we have considered there are two fixed vertices to find the restricted Steiner tree problem. Naturally, we consider there are three fixed vertices to find the restricted Steiner tree problem. And we also use the geometric method to solve such the problem.

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

Combinatorial and Algorithmic Rigidity: Beyond Two Dimensions

DTIC Science & Technology

2012-12-01

problem. Manuscript, 2010. [35] G. Panina and I. Streinu. Flattening single-vertex origami : the non- expansive case. Computational Geometry : Theory and...in 2008, under the DARPA solicitation “Mathemat- ical Challenges, BAA 07-68”. It addressed Mathematical Challenge Ten: Al- gorithmic Origami and...a number of optimal algorithms and provided critical complexity analysis. The topic of algorithmic origami was successfully engaged from the same

Adaptive Connectivity Restoration from Node Failure(s) in Wireless Sensor Networks

PubMed Central

Wang, Huaiyuan; Ding, Xu; Huang, Cheng; Wu, Xiaobei

2016-01-01

Recently, there is a growing interest in the applications of wireless sensor networks (WSNs). A set of sensor nodes is deployed in order to collectively survey an area of interest and/or perform specific surveillance tasks in some of the applications, such as battlefield reconnaissance. Due to the harsh deployment environments and limited energy supply, nodes may fail, which impacts the connectivity of the whole network. Since a single node failure (cut-vertex) will destroy the connectivity and divide the network into disjoint blocks, most of the existing studies focus on the problem of single node failure. However, the failure of multiple nodes would be a disaster to the whole network and must be repaired effectively. Only few studies are proposed to handle the problem of multiple cut-vertex failures, which is a special case of multiple node failures. Therefore, this paper proposes a comprehensive solution to address the problems of node failure (single and multiple). Collaborative Single Node Failure Restoration algorithm (CSFR) is presented to solve the problem of single node failure only with cooperative communication, but CSFR-M, which is the extension of CSFR, handles the single node failure problem more effectively with node motion. Moreover, Collaborative Connectivity Restoration Algorithm (CCRA) is proposed on the basis of cooperative communication and node maneuverability to restore network connectivity after multiple nodes fail. CSFR-M and CCRA are reactive methods that initiate the connectivity restoration after detecting the node failure(s). In order to further minimize the energy dissipation, CCRA opts to simplify the recovery process by gridding. Moreover, the distance that an individual node needs to travel during recovery is reduced by choosing the nearest suitable candidates. Finally, extensive simulations validate the performance of CSFR, CSFR-M and CCRA. PMID:27690030

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.

Graph Coloring Used to Model Traffic Lights.

ERIC Educational Resources Information Center

Williams, John

1992-01-01

Two scheduling problems, one involving setting up an examination schedule and the other describing traffic light problems, are modeled as colorings of graphs consisting of a set of vertices and edges. The chromatic number, the least number of colors necessary for coloring a graph, is employed in the solutions. (MDH)

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

NASA Astrophysics Data System (ADS)

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

2017-09-01

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

Vertex functions at finite momentum: Application to antiferromagnetic quantum criticality

NASA Astrophysics Data System (ADS)

Wölfle, Peter; Abrahams, Elihu

2016-02-01

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

Eigenvalues of the Laplacian of a graph

NASA Technical Reports Server (NTRS)

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

1971-01-01

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

RAVE—a Detector-independent vertex reconstruction toolkit

NASA Astrophysics Data System (ADS)

Waltenberger, Wolfgang; Mitaroff, Winfried; Moser, Fabian

2007-10-01

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

Investigation of Lyapunov stability of a central configuration in the restricted four-body problem

NASA Astrophysics Data System (ADS)

Bardin, B. S.; Esipov, P. A.

2018-05-01

The restricted planar four-body problem is considered. It is supposed that one of four bodies has infinitesimal mass and does not affect on motions of three other bodies. If two bodies have equal masses then there exists a central configuration such that three bodies are located in vertex of an equilateral triangle and the fourth body having infinitesimal mass is located in perpendicular bisector of the triangle. By using the method of normal forms and KAM theory stability of the above configuration is studied in the sense of Lyapunov.

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.

Applications of remote sensing to estuarine problems. [estuaries of Chesapeake Bay

NASA Technical Reports Server (NTRS)

Munday, J. C., Jr.

1975-01-01

A variety of siting problems for the estuaries of the lower Chesapeake Bay have been solved with cost beneficial remote sensing techniques. Principal techniques used were repetitive 1:30,000 color photography of dye emitting buoys to map circulation patterns, and investigation of water color boundaries via color and color infrared imagery to scales of 1:120,000. Problems solved included sewage outfall siting, shoreline preservation and enhancement, oil pollution risk assessment, and protection of shellfish beds from dredge operations.

Tensor network method for reversible classical computation

NASA Astrophysics Data System (ADS)

Yang, Zhi-Cheng; Kourtis, Stefanos; Chamon, Claudio; Mucciolo, Eduardo R.; Ruckenstein, Andrei E.

2018-03-01

We develop a tensor network technique that can solve universal reversible classical computational problems, formulated as vertex models on a square lattice [Nat. Commun. 8, 15303 (2017), 10.1038/ncomms15303]. By encoding the truth table of each vertex constraint in a tensor, the total number of solutions compatible with partial inputs and outputs at the boundary can be represented as the full contraction of a tensor network. We introduce an iterative compression-decimation (ICD) scheme that performs this contraction efficiently. The ICD algorithm first propagates local constraints to longer ranges via repeated contraction-decomposition sweeps over all lattice bonds, thus achieving compression on a given length scale. It then decimates the lattice via coarse-graining tensor contractions. Repeated iterations of these two steps gradually collapse the tensor network and ultimately yield the exact tensor trace for large systems, without the need for manual control of tensor dimensions. Our protocol allows us to obtain the exact number of solutions for computations where a naive enumeration would take astronomically long times.

Color vision test

MedlinePlus

... present from birth) color vision problems: Achromatopsia -- complete color blindness , seeing only shades of gray Deuteranopia -- difficulty telling ... Vision test - color; Ishihara color vision test Images Color blindness tests References Bowling B. Hereditary fundus dystrophies. In: ...

Fetal presentation and successful twin vaginal delivery.

PubMed

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

2016-01-01

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

Genus Ranges of 4-Regular Rigid Vertex Graphs

PubMed Central

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

2016-01-01

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

Lightness modification of color image for protanopia and deuteranopia

NASA Astrophysics Data System (ADS)

Tanaka, Go; Suetake, Noriaki; Uchino, Eiji

2010-01-01

In multimedia content, colors play important roles in conveying visual information. However, color information cannot always be perceived uniformly by all people. People with a color vision deficiency, such as dichromacy, cannot recognize and distinguish certain color combinations. In this paper, an effective lightness modification method, which enables barrier-free color vision for people with dichromacy, especially protanopia or deuteranopia, while preserving the color information in the original image for people with standard color vision, is proposed. In the proposed method, an optimization problem concerning lightness components is first defined by considering color differences in an input image. Then a perceptible and comprehensible color image for both protanopes and viewers with no color vision deficiency or both deuteranopes and viewers with no color vision deficiency is obtained by solving the optimization problem. Through experiments, the effectiveness of the proposed method is illustrated.

Finding minimum-quotient cuts in planar graphs

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

Park, J.K.; Phillips, C.A.

Given a graph G = (V, E) where each vertex v {element_of} V is assigned a weight w(v) and each edge e {element_of} E is assigned a cost c(e), the quotient of a cut partitioning the vertices of V into sets S and {bar S} is c(S, {bar S})/min{l_brace}w(S), w(S){r_brace}, where c(S, {bar S}) is the sum of the costs of the edges crossing the cut and w(S) and w({bar S}) are the sum of the weights of the vertices in S and {bar S}, respectively. The problem of finding a cut whose quotient is minimum for a graph hasmore » in recent years attracted considerable attention, due in large part to the work of Rao and Leighton and Rao. They have shown that an algorithm (exact or approximation) for the minimum-quotient-cut problem can be used to obtain an approximation algorithm for the more famous minimumb-balanced-cut problem, which requires finding a cut (S,{bar S}) minimizing c(S,{bar S}) subject to the constraint bW {le} w(S) {le} (1 {minus} b)W, where W is the total vertex weight and b is some fixed balance in the range 0 < b {le} {1/2}. Unfortunately, the minimum-quotient-cut problem is strongly NP-hard for general graphs, and the best polynomial-time approximation algorithm known for the general problem guarantees only a cut whose quotient is at mostO(lg n) times optimal, where n is the size of the graph. However, for planar graphs, the minimum-quotient-cut problem appears more tractable, as Rao has developed several efficient approximation algorithms for the planar version of the problem capable of finding a cut whose quotient is at most some constant times optimal. In this paper, we improve Rao`s algorithms, both in terms of accuracy and speed. As our first result, we present two pseudopolynomial-time exact algorithms for the planar minimum-quotient-cut problem. As Rao`s most accurate approximation algorithm for the problem -- also a pseudopolynomial-time algorithm -- guarantees only a 1.5-times-optimal cut, our algorithms represent a significant advance.« less

Finding minimum-quotient cuts in planar graphs

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

Park, J.K.; Phillips, C.A.

Given a graph G = (V, E) where each vertex v [element of] V is assigned a weight w(v) and each edge e [element of] E is assigned a cost c(e), the quotient of a cut partitioning the vertices of V into sets S and [bar S] is c(S, [bar S])/min[l brace]w(S), w(S)[r brace], where c(S, [bar S]) is the sum of the costs of the edges crossing the cut and w(S) and w([bar S]) are the sum of the weights of the vertices in S and [bar S], respectively. The problem of finding a cut whose quotient is minimummore » for a graph has in recent years attracted considerable attention, due in large part to the work of Rao and Leighton and Rao. They have shown that an algorithm (exact or approximation) for the minimum-quotient-cut problem can be used to obtain an approximation algorithm for the more famous minimumb-balanced-cut problem, which requires finding a cut (S,[bar S]) minimizing c(S,[bar S]) subject to the constraint bW [le] w(S) [le] (1 [minus] b)W, where W is the total vertex weight and b is some fixed balance in the range 0 < b [le] [1/2]. Unfortunately, the minimum-quotient-cut problem is strongly NP-hard for general graphs, and the best polynomial-time approximation algorithm known for the general problem guarantees only a cut whose quotient is at mostO(lg n) times optimal, where n is the size of the graph. However, for planar graphs, the minimum-quotient-cut problem appears more tractable, as Rao has developed several efficient approximation algorithms for the planar version of the problem capable of finding a cut whose quotient is at most some constant times optimal. In this paper, we improve Rao's algorithms, both in terms of accuracy and speed. As our first result, we present two pseudopolynomial-time exact algorithms for the planar minimum-quotient-cut problem. As Rao's most accurate approximation algorithm for the problem -- also a pseudopolynomial-time algorithm -- guarantees only a 1.5-times-optimal cut, our algorithms represent a significant advance.« less

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.

Color blindness

MedlinePlus

Color deficiency; Blindness - color ... Color blindness occurs when there is a problem with the pigments in certain nerve cells of the eye that sense color. These cells are called cones. They are found ...

On the Maximum-Weight Clique Problem.

DTIC Science & Technology

1985-06-01

hypergeometric distribution", Discrete Math . 25, 285-287 .* CHVATAL, V. (1983), Linear Programming, W.H. Freeman, New York/San Francisco. COOK, S.A. (1971...Annals Discrete Math . 21, 325-356 GROTSCHEL, M., L. LOVASZ, and A. SCHRIJVER ((1984b), "Relaxations of Vertex Packing", Preprint No. 35...de Grenoble. See also N. Sbihi, "Algorithme de recherche d’un stable de cardinalite maximum dans un graphe sans etoile", Discrete Math . 19 (1980), 53

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.

Discrete Applied Mathematics

DTIC Science & Technology

1993-05-31

program. In paper [28], we give a brief and elementary proof of a result of Hoffman [1952) about approximate solutions to systems, of linear inequalities...UCLA, Vestvood, CA, February 1993. " Linear Problems: Formulation and Solution," International Linear Algebra Society, Pensacola, FL, May 1993. Denise S...thresAold If there is a number h and a linear k-separator w assigning a real number to each vertex so that for any subset S of vertices, the sum of w

The Ordered Clustered Travelling Salesman Problem: A Hybrid Genetic Algorithm

PubMed Central

Ahmed, Zakir Hussain

2014-01-01

The ordered clustered travelling salesman problem is a variation of the usual travelling salesman problem in which a set of vertices (except the starting vertex) of the network is divided into some prespecified clusters. The objective is to find the least cost Hamiltonian tour in which vertices of any cluster are visited contiguously and the clusters are visited in the prespecified order. The problem is NP-hard, and it arises in practical transportation and sequencing problems. This paper develops a hybrid genetic algorithm using sequential constructive crossover, 2-opt search, and a local search for obtaining heuristic solution to the problem. The efficiency of the algorithm has been examined against two existing algorithms for some asymmetric and symmetric TSPLIB instances of various sizes. The computational results show that the proposed algorithm is very effective in terms of solution quality and computational time. Finally, we present solution to some more symmetric TSPLIB instances. PMID:24701148

MO-FG-CAMPUS-IeP1-04: Kerma Area Product Calculation for Non-Uniform X-Ray Fields Using a Skin Dose Tracking System

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

Vijayan, S; Xiong, Z; Rudin, S

Purpose: The functionality of the Dose-Tracking System (DTS) has been expanded to include the calculation of the Kerma-Area Product (KAP) for non-uniform x-ray fields such as result from the use of compensation filters during fluoroscopic procedures Methods: The DTS calculates skin dose during fluoroscopic interventions and provides a color-coded dose map on a patient-graphic model. The KAP is the integral of air kerma over the x-ray field and is usually measured with a transmission-ionization chamber that intercepts the entire x-ray beam. The DTS has been modified to determine KAP when there are beam non-uniformities that can be modeled. For example,more » the DTS includes models of the three compensation filters with tapered edges located in the collimator assembly of the Toshiba Infinix fluoroscopic C-Arm and can track their movement. To determine the air kerma after the filters, DTS includes transmission factors for the compensation filters as a function of kVp and beam filtration. A virtual KAP dosimeter is simulated in the DTS by an array of graphic vertices; the air kerma at each vertex is corrected by the field non-uniformity, which in this case is the attenuation factor for those rays which pass through the filter. The products of individual vertex air-kerma values for all vertices within the beam times the effective-area-per-vertex are summed for each x-ray pulse to yield the KAP per pulse and the cumulative KAP for the procedure is then calculated. Results: The KAP values estimated by DTS with the compensation filter inserted into the x-ray field agree within ± 6% with the values displayed on the fluoroscopy unit monitor, which are measured with a transmission chamber. Conclusion: The DTS can account for field non-uniformities such as result from the use of compensation filters in calculating KAP and can obviate the need for a KAP transmission ionization chamber. Partial support from NIH Grant R01-EB002873 and Toshiba Medical Systems Corp.« less

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

Dual fluorescence from an isonido ReIII rhenacarborane phosphine complex, [7,10-mu-H-7-CO-7,7-(PPh3)2-isonido-7,8,9-ReC2B7H9].

PubMed

Buckner, Steven W; Fischer, Matthew J; Jelliss, Paul A; Luo, Rensheng; Minteer, Shelley D; Rath, Nigam P; Siemiarczuk, Aleksander

2006-09-04

The complex [7,10-mu-H-7-CO-7,7-(PPh3)2-isonido-7,8,9-ReC2B7H9] has been synthesized by treatment of the complex salt [NHMe3][3,3-Cl2-3,3-(CO)2-closo-3,1,2-ReC2B9H11] with PPh3 in refluxing THF (tetrahydrofuran) and isolated as intensely colored orange-red microcrystals. Spectroscopic NMR and IR data have suggested that the product has a highly asymmetric structure with two inequivalent PPh3 ligands and a single CO ligand. Measurement of 11B NMR spectra in particular have indicated seven distinct boron vertexes, although the resulting cage degradation by removal of two BH vertexes was confirmed only following X-ray crystallographic analysis, which revealed the pentadecahedral isonido-7,8,9-ReC2B7 architecture. The 11B NMR resonances span an enormous chemical shift range (Deltadelta = 113), and this appears to be a direct consequence of the deshielding of the boron vertex directly opposite the quadrilateral |ReCCB| aperture. The new complex has been shown by electrochemical measurements to undergo a reversible one-electron oxidation. Digitally simulated cyclic voltammograms support a proposed square scheme (E(1/2) = 0.58, 0.69 V vs ferrocene) involving a reversible isonido-closo transition of the metallacarborane cage. Most unusually for a metallacarborane complex, ambient temperature solutions in CH2Cl2 and DMF have been shown to be intensely turquoise-blue fluorescent (lambda(em) = 442 nm, Phi = 0.012). Fluorescence spectroscopy measurements in MeTHF (2-methyltetrahydrofuran) glass at 77 K have indicated that the likely cause of such a broad emission is dual fluorescence (lambda(em) = 404, 505 nm), with both emissions displaying vibronic structure. Following excited-state lifetime decay analysis, the emissive behavior has been accredited to metal-perturbed 1IL states, with the lower energy emission arising from a slight geometric distortion of the initially excited complex.

Some boundary-value problems for anisotropic quarter plane

NASA Astrophysics Data System (ADS)

Arkhypenko, K. M.; Kryvyi, O. F.

2018-04-01

To solve the mixed boundary-value problems of the anisotropic elasticity for the anisotropic quarter plane, a method based on the use of the space of generalized functions {\\Im }{\\prime }({\\text{R}}+2) with slow growth properties was developed. The two-dimensional integral Fourier transform was used to construct the system of fundamental solutions for the anisotropic quarter plane in this space and a system of eight boundary integral relations was obtained, which allows one to reduce the mixed boundary-value problems for the anisotropic quarter plane directly to systems of singular integral equations with fixed singularities. The exact solutions of these systems were found by using the integral Mellin transform. The asymptotic behavior of solutions was investigated at the vertex of the quarter plane.

Phase Transitions in Combinatorial Optimization Problems: Basics, Algorithms and Statistical Mechanics

NASA Astrophysics Data System (ADS)

Hartmann, Alexander K.; Weigt, Martin

2005-10-01

A concise, comprehensive introduction to the topic of statistical physics of combinatorial optimization, bringing together theoretical concepts and algorithms from computer science with analytical methods from physics. The result bridges the gap between statistical physics and combinatorial optimization, investigating problems taken from theoretical computing, such as the vertex-cover problem, with the concepts and methods of theoretical physics. The authors cover rapid developments and analytical methods that are both extremely complex and spread by word-of-mouth, providing all the necessary basics in required detail. Throughout, the algorithms are shown with examples and calculations, while the proofs are given in a way suitable for graduate students, post-docs, and researchers. Ideal for newcomers to this young, multidisciplinary field.

Defect-phase-dynamics approach to statistical domain-growth problem of clock models

NASA Technical Reports Server (NTRS)

Kawasaki, K.

1985-01-01

The growth of statistical domains in quenched Ising-like p-state clock models with p = 3 or more is investigated theoretically, reformulating the analysis of Ohta et al. (1982) in terms of a phase variable and studying the dynamics of defects introduced into the phase field when the phase variable becomes multivalued. The resulting defect/phase domain-growth equation is applied to the interpretation of Monte Carlo simulations in two dimensions (Kaski and Gunton, 1983; Grest and Srolovitz, 1984), and problems encountered in the analysis of related Potts models are discussed. In the two-dimensional case, the problem is essentially that of a purely dissipative Coulomb gas, with a sq rt t growth law complicated by vertex-pinning effects at small t.

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.

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

A new species of open-air processional column termite, Hospitalitermes nigriantennalis sp. n. (Termitidae), from Borneo.

PubMed

Syaukani, Syaukani; Thompson, Graham J; Zettel, Herbert; Pribadi, Teguh

2016-01-01

A new species of open-air processional column termite is here described based on the soldier and worker castes from eight colonies in north Barito, central Kalimantan. Hospitalitermes nigriantennalis sp. n. is readily distinguished in the field from related Hospitalitermes spp. by the light brown to orangish coloration of the soldier head capsule that, further, is with vertex yellowish and nasus brownish. The soldier antenna and the maxillary and labial palps are blackish. By contrast, soldiers from other species of Hospitalitermes from this region have a uniformly black head capsule and antennae. Finally, Hospitalitermes nigriantennalis sp. n. has a minute indentation in the middle of the posterior part of head capsule, which further helps to differentiate this new species from other Hospitalitermes from the Indo-Malayan and Austro-Malayan regions.

A new species of open-air processional column termite, Hospitalitermes nigriantennalis sp. n. (Termitidae), from Borneo

PubMed Central

Syaukani, Syaukani; Thompson, Graham J.; Zettel, Herbert; Pribadi, Teguh

2016-01-01

Abstract A new species of open-air processional column termite is here described based on the soldier and worker castes from eight colonies in north Barito, central Kalimantan. Hospitalitermes nigriantennalis sp. n. is readily distinguished in the field from related Hospitalitermes spp. by the light brown to orangish coloration of the soldier head capsule that, further, is with vertex yellowish and nasus brownish. The soldier antenna and the maxillary and labial palps are blackish. By contrast, soldiers from other species of Hospitalitermes from this region have a uniformly black head capsule and antennae. Finally, Hospitalitermes nigriantennalis sp. n. has a minute indentation in the middle of the posterior part of head capsule, which further helps to differentiate this new species from other Hospitalitermes from the Indo-Malayan and Austro-Malayan regions. PMID:26877678

The effect of different standard illumination conditions on color balance failure in offset printed images on glossy coated paper expressed by color difference

NASA Astrophysics Data System (ADS)

Spiridonov, I.; Shopova, M.; Boeva, R.; Nikolov, M.

2012-05-01

One of the biggest problems in color reproduction processes is color shifts occurring when images are viewed under different illuminants. Process ink colors and their combinations that match under one light source will often appear different under another light source. This problem is referred to as color balance failure or color inconstancy. The main goals of the present study are to investigate and determine the color balance failure (color inconstancy) of offset printed images expressed by color difference and color gamut changes depending on three of the most commonly used in practice illuminants, CIE D50, CIE F2 and CIE A. The results obtained are important from a scientific and a practical point of view. For the first time, a methodology is suggested and implemented for the examination and estimation of color shifts by studying a large number of color and gamut changes in various ink combinations for different illuminants.

Finding Strong Bridges and Strong Articulation Points in Linear Time

NASA Astrophysics Data System (ADS)

Italiano, Giuseppe F.; Laura, Luigi; Santaroni, Federico

Given a directed graph G, an edge is a strong bridge if its removal increases the number of strongly connected components of G. Similarly, we say that a vertex is a strong articulation point if its removal increases the number of strongly connected components of G. In this paper, we present linear-time algorithms for computing all the strong bridges and all the strong articulation points of directed graphs, solving an open problem posed in [2].

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.

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

PubMed

Huh, Yong; Yu, Kiyun; Park, Woojin

2016-01-01

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

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.

Binning and filtering: the six-color solution

NASA Astrophysics Data System (ADS)

Ashdown, Ian; Robinson, Shane; Salsbury, Marc

2006-08-01

The use of LED backlighting for LCD displays requires careful binning of red, green, and blue LEDs by dominant wavelength to maintain the color gamuts as specified by NTSC, SMPTE, and EBU/ITU standards. This problem also occurs to a lesser extent with RGB and RGBA assemblies for solid-state lighting, where color gamut consistency is required for color-changing luminaires. In this paper, we propose a "six-color solution," based on Grassman's laws, that does not require color binning, but nevertheless guarantees a fixed color gamut that subsumes the color gamuts of carefully-binned RGB assemblies. A further advantage of this solution is that it solves the problem of peak wavelength shifts with varying junction temperatures. The color gamut can thus remain fixed over the full range of LED intensities and ambient temperatures. A related problem occurs with integrated circuit (IC) colorimeters used for optical feedback with LED backlighting and RGB(A) solid-state lighting, wherein it can be difficult to distinguish between peak wavelength shifts and changes in LED intensity. We apply our six-color solution to the design of a novel colorimeter for LEDs that independently measures changes in peak wavelength and intensity. The design is compatible with current manufacturing techniques for tristimulus colorimeter ICs. Together, the six-color solution for LEDs and colorimeters enables less expensive LED backlighting and solid-state lighting systems with improved color stability.

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.

Robustness of mission plans for unmanned aircraft

NASA Astrophysics Data System (ADS)

Niendorf, Moritz

This thesis studies the robustness of optimal mission plans for unmanned aircraft. Mission planning typically involves tactical planning and path planning. Tactical planning refers to task scheduling and in multi aircraft scenarios also includes establishing a communication topology. Path planning refers to computing a feasible and collision-free trajectory. For a prototypical mission planning problem, the traveling salesman problem on a weighted graph, the robustness of an optimal tour is analyzed with respect to changes to the edge costs. Specifically, the stability region of an optimal tour is obtained, i.e., the set of all edge cost perturbations for which that tour is optimal. The exact stability region of solutions to variants of the traveling salesman problems is obtained from a linear programming relaxation of an auxiliary problem. Edge cost tolerances and edge criticalities are derived from the stability region. For Euclidean traveling salesman problems, robustness with respect to perturbations to vertex locations is considered and safe radii and vertex criticalities are introduced. For weighted-sum multi-objective problems, stability regions with respect to changes in the objectives, weights, and simultaneous changes are given. Most critical weight perturbations are derived. Computing exact stability regions is intractable for large instances. Therefore, tractable approximations are desirable. The stability region of solutions to relaxations of the traveling salesman problem give under approximations and sets of tours give over approximations. The application of these results to the two-neighborhood and the minimum 1-tree relaxation are discussed. Bounds on edge cost tolerances and approximate criticalities are obtainable likewise. A minimum spanning tree is an optimal communication topology for minimizing the cumulative transmission power in multi aircraft missions. The stability region of a minimum spanning tree is given and tolerances, stability balls, and criticalities are derived. This analysis is extended to Euclidean minimum spanning trees. This thesis aims at enabling increased mission performance by providing means of assessing the robustness and optimality of a mission and methods for identifying critical elements. Examples of the application to mission planning in contested environments, cargo aircraft mission planning, multi-objective mission planning, and planning optimal communication topologies for teams of unmanned aircraft are given.

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.

Leveraging disjoint communities for detecting overlapping community structure

NASA Astrophysics Data System (ADS)

Chakraborty, Tanmoy

2015-05-01

Network communities represent mesoscopic structure for understanding the organization of real-world networks, where nodes often belong to multiple communities and form overlapping community structure in the network. Due to non-triviality in finding the exact boundary of such overlapping communities, this problem has become challenging, and therefore huge effort has been devoted to detect overlapping communities from the network. In this paper, we present PVOC (Permanence based Vertex-replication algorithm for Overlapping Community detection), a two-stage framework to detect overlapping community structure. We build on a novel observation that non-overlapping community structure detected by a standard disjoint community detection algorithm from a network has high resemblance with its actual overlapping community structure, except the overlapping part. Based on this observation, we posit that there is perhaps no need of building yet another overlapping community finding algorithm; but one can efficiently manipulate the output of any existing disjoint community finding algorithm to obtain the required overlapping structure. We propose a new post-processing technique that by combining with any existing disjoint community detection algorithm, can suitably process each vertex using a new vertex-based metric, called permanence, and thereby finds out overlapping candidates with their community memberships. Experimental results on both synthetic and large real-world networks show that PVOC significantly outperforms six state-of-the-art overlapping community detection algorithms in terms of high similarity of the output with the ground-truth structure. Thus our framework not only finds meaningful overlapping communities from the network, but also allows us to put an end to the constant effort of building yet another overlapping community detection algorithm.

Resumming the large-N approximation for time evolving quantum systems

NASA Astrophysics Data System (ADS)

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

2001-05-01

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

A new wavelet transform to sparsely represent cortical current densities for EEG/MEG inverse problems.

PubMed

Liao, Ke; Zhu, Min; Ding, Lei

2013-08-01

The present study investigated the use of transform sparseness of cortical current density on human brain surface to improve electroencephalography/magnetoencephalography (EEG/MEG) inverse solutions. Transform sparseness was assessed by evaluating compressibility of cortical current densities in transform domains. To do that, a structure compression method from computer graphics was first adopted to compress cortical surface structure, either regular or irregular, into hierarchical multi-resolution meshes. Then, a new face-based wavelet method based on generated multi-resolution meshes was proposed to compress current density functions defined on cortical surfaces. Twelve cortical surface models were built by three EEG/MEG softwares and their structural compressibility was evaluated and compared by the proposed method. Monte Carlo simulations were implemented to evaluate the performance of the proposed wavelet method in compressing various cortical current density distributions as compared to other two available vertex-based wavelet methods. The present results indicate that the face-based wavelet method can achieve higher transform sparseness than vertex-based wavelet methods. Furthermore, basis functions from the face-based wavelet method have lower coherence against typical EEG and MEG measurement systems than vertex-based wavelet methods. Both high transform sparseness and low coherent measurements suggest that the proposed face-based wavelet method can improve the performance of L1-norm regularized EEG/MEG inverse solutions, which was further demonstrated in simulations and experimental setups using MEG data. Thus, this new transform on complicated cortical structure is promising to significantly advance EEG/MEG inverse source imaging technologies. Copyright © 2013 Elsevier Ireland Ltd. All rights reserved.

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

PubMed

Popov, Yuri O; Witten, Thomas A

2003-09-01

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

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

DOE PAGES

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

2016-06-30

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

Vertex Models of Epithelial Morphogenesis

PubMed Central

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

2014-01-01

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

Exploiting Elementary Landscapes for TSP, Vehicle Routing and Scheduling

DTIC Science & Technology

2015-09-03

Traveling Salesman Problem (TSP) and Graph Coloring are elementary. Problems such as MAX-kSAT are a superposition of k elementary landscapes. This...search space. Problems such as the Traveling Salesman Problem (TSP), Graph Coloring, the Frequency Assignment Problem , as well as Min-Cut and Max-Cut...echoing our earlier esults on the Traveling Salesman Problem . Using two locally optimal solutions as “parent” solutions, we have developed a

Multi-sparse dictionary colorization algorithm based on the feature classification and detail enhancement

NASA Astrophysics Data System (ADS)

Yan, Dan; Bai, Lianfa; Zhang, Yi; Han, Jing

2018-02-01

For the problems of missing details and performance of the colorization based on sparse representation, we propose a conceptual model framework for colorizing gray-scale images, and then a multi-sparse dictionary colorization algorithm based on the feature classification and detail enhancement (CEMDC) is proposed based on this framework. The algorithm can achieve a natural colorized effect for a gray-scale image, and it is consistent with the human vision. First, the algorithm establishes a multi-sparse dictionary classification colorization model. Then, to improve the accuracy rate of the classification, the corresponding local constraint algorithm is proposed. Finally, we propose a detail enhancement based on Laplacian Pyramid, which is effective in solving the problem of missing details and improving the speed of image colorization. In addition, the algorithm not only realizes the colorization of the visual gray-scale image, but also can be applied to the other areas, such as color transfer between color images, colorizing gray fusion images, and infrared images.

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.

Evaluation of parameters of color profile models of LCD and LED screens

NASA Astrophysics Data System (ADS)

Zharinov, I. O.; Zharinov, O. O.

2017-12-01

The purpose of the research relates to the problem of parametric identification of the color profile model of LCD (liquid crystal display) and LED (light emitting diode) screens. The color profile model of a screen is based on the Grassmann’s Law of additive color mixture. Mathematically the problem is to evaluate unknown parameters (numerical coefficients) of the matrix transformation between different color spaces. Several methods of evaluation of these screen profile coefficients were developed. These methods are based either on processing of some colorimetric measurements or on processing of technical documentation data.

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)

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

Minimizing Communication in All-Pairs Shortest Paths

DTIC Science & Technology

2013-02-13

on a 16,384 vertex, 5% dense graph, is slightly faster using our approach (18.6 vs . 22.6 seconds) than using the replicated Johnson’s algorithm...Oracle and Samsung , as well as MathWorks. Research is also supported by DOE grants DE-SC0004938, DE-SC0005136, DE-SC0003959, DE-SC0008700, and AC02...Brickell, I. S. Dhillon, S. Sra, and J. A. Tropp. The metric nearness problem. SIAM J. Matrix Anal. Appl ., 30:375–396, 2008. [11] A. Buluç, J. R. Gilbert

Knot Invariants and Cellular Automata

DTIC Science & Technology

1993-05-04

behavior might be found in a naturally associated two dimensional statistical mechanics model. The Boltzmann weight TV’b := exp[-/3E(a,b, c ,d)] can be...the Yang-Baxter (star-triangle) equation [10,11]: +, b ) C I k( ) = ± )tI k I The relevance of this result to our problem is the following. The two com...J. Baxter and P. J. Forrester, "Eight-vertex SOS model and generalized Rogers- Ramanujan -type identities," J. Stat. Phys. 35 (1934) 193-266. [13] L. H

Evaluating the Role of the Dorsolateral Prefrontal Cortex and Posterior Parietal Cortex in Memory-Guided Attention With Repetitive Transcranial Magnetic Stimulation.

PubMed

Wang, Min; Yang, Ping; Wan, Chaoyang; Jin, Zhenlan; Zhang, Junjun; Li, Ling

2018-01-01

The contents of working memory (WM) can affect the subsequent visual search performance, resulting in either beneficial or cost effects, when the visual search target is included in or spatially dissociated from the memorized contents, respectively. The right dorsolateral prefrontal cortex (rDLPFC) and the right posterior parietal cortex (rPPC) have been suggested to be associated with the congruence/incongruence effects of the WM content and the visual search target. Thus, in the present study, we investigated the role of the dorsolateral prefrontal cortex and the PPC in controlling the interaction between WM and attention during a visual search, using repetitive transcranial magnetic stimulation (rTMS). Subjects maintained a color in WM while performing a search task. The color cue contained the target (valid), the distractor (invalid) or did not reappear in the search display (neutral). Concurrent stimulation with the search onset showed that relative to rTMS over the vertex, rTMS over rPPC and rDLPFC further decreased the search reaction time, when the memory cue contained the search target. The results suggest that the rDLPFC and the rPPC are critical for controlling WM biases in human visual attention.

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.

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.

Rate-independent dissipation in phase-field modelling of displacive transformations

NASA Astrophysics Data System (ADS)

Tůma, K.; Stupkiewicz, S.; Petryk, H.

2018-05-01

In this paper, rate-independent dissipation is introduced into the phase-field framework for modelling of displacive transformations, such as martensitic phase transformation and twinning. The finite-strain phase-field model developed recently by the present authors is here extended beyond the limitations of purely viscous dissipation. The variational formulation, in which the evolution problem is formulated as a constrained minimization problem for a global rate-potential, is enhanced by including a mixed-type dissipation potential that combines viscous and rate-independent contributions. Effective computational treatment of the resulting incremental problem of non-smooth optimization is developed by employing the augmented Lagrangian method. It is demonstrated that a single Lagrange multiplier field suffices to handle the dissipation potential vertex and simultaneously to enforce physical constraints on the order parameter. In this way, the initially non-smooth problem of evolution is converted into a smooth stationarity problem. The model is implemented in a finite-element code and applied to solve two- and three-dimensional boundary value problems representative for shape memory alloys.

The inverse Wiener polarity index problem for chemical trees.

PubMed

Du, Zhibin; Ali, Akbar

2018-01-01

The Wiener polarity number (which, nowadays, known as the Wiener polarity index and usually denoted by Wp) was devised by the chemist Harold Wiener, for predicting the boiling points of alkanes. The index Wp of chemical trees (chemical graphs representing alkanes) is defined as the number of unordered pairs of vertices (carbon atoms) at distance 3. The inverse problems based on some well-known topological indices have already been addressed in the literature. The solution of such inverse problems may be helpful in speeding up the discovery of lead compounds having the desired properties. This paper is devoted to solving a stronger version of the inverse problem based on Wiener polarity index for chemical trees. More precisely, it is proved that for every integer t ∈ {n - 3, n - 2,…,3n - 16, 3n - 15}, n ≥ 6, there exists an n-vertex chemical tree T such that Wp(T) = t.

Systematics of quark/gluon tagging

DOE PAGES

Gras, Philippe; Höche, Stefan; Kar, Deepak; ...

2017-07-18

By measuring the substructure of a jet, one can assign it a “quark” or “gluon” tag. In the eikonal (double-logarithmic) limit, quark/gluon discrimination is determined solely by the color factor of the initiating parton (C F versus C A). In this paper, we confront the challenges faced when going beyond this leading-order understanding, using both parton-shower generators and first-principles calculations to assess the impact of higher-order perturbative and nonperturbative physics. Working in the idealized context of electron-positron collisions, where one can define a proxy for quark and gluon jets based on the Lorentz structure of the production vertex, we findmore » a fascinating interplay between perturbative shower effects and nonperturbative hadronization effects. Turning to proton-proton collisions, we highlight a core set of measurements that would constrain current uncertainties in quark/gluon tagging and improve the overall modeling of jets at the Large Hadron Collider.« less

Systematics of quark/gluon tagging

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

Gras, Philippe; Höche, Stefan; Kar, Deepak

By measuring the substructure of a jet, one can assign it a “quark” or “gluon” tag. In the eikonal (double-logarithmic) limit, quark/gluon discrimination is determined solely by the color factor of the initiating parton (C F versus C A). In this paper, we confront the challenges faced when going beyond this leading-order understanding, using both parton-shower generators and first-principles calculations to assess the impact of higher-order perturbative and nonperturbative physics. Working in the idealized context of electron-positron collisions, where one can define a proxy for quark and gluon jets based on the Lorentz structure of the production vertex, we findmore » a fascinating interplay between perturbative shower effects and nonperturbative hadronization effects. Turning to proton-proton collisions, we highlight a core set of measurements that would constrain current uncertainties in quark/gluon tagging and improve the overall modeling of jets at the Large Hadron Collider.« less

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

PubMed

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

2014-12-01

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

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

NASA Astrophysics Data System (ADS)

Spencer, Meryl; Jabeen, Zahera; Lubensky, David

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

A neural network z-vertex trigger for Belle II

NASA Astrophysics Data System (ADS)

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

2015-05-01

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

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

NASA Astrophysics Data System (ADS)

Bertacchi, Daniela; Zucca, Fabio

2013-11-01

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

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

NASA Astrophysics Data System (ADS)

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

2017-11-01

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

Dual-color 3D superresolution microscopy by combined spectral-demixing and biplane imaging.

PubMed

Winterflood, Christian M; Platonova, Evgenia; Albrecht, David; Ewers, Helge

2015-07-07

Multicolor three-dimensional (3D) superresolution techniques allow important insight into the relative organization of cellular structures. While a number of innovative solutions have emerged, multicolor 3D techniques still face significant technical challenges. In this Letter we provide a straightforward approach to single-molecule localization microscopy imaging in three dimensions and two colors. We combine biplane imaging and spectral-demixing, which eliminates a number of problems, including color cross-talk, chromatic aberration effects, and problems with color registration. We present 3D dual-color images of nanoscopic structures in hippocampal neurons with a 3D compound resolution routinely achieved only in a single color. Copyright © 2015 Biophysical Society. Published by Elsevier Inc. All rights reserved.

Internet Color Imaging

DTIC Science & Technology

2000-07-01

UNCLASSIFIED Defense Technical Information Center Compilation Part Notice ADPO1 1348 TITLE: Internet Color Imaging DISTRIBUTION: Approved for public...Paper Internet Color Imaging Hsien-Che Lee Imaging Science and Technology Laboratory Eastman Kodak Company, Rochester, New York 14650-1816 USA...ABSTRACT The sharing and exchange of color images over the Internet pose very challenging problems to color science and technology . Emerging color standards

Tensor discriminant color space for face recognition.

PubMed

Wang, Su-Jing; Yang, Jian; Zhang, Na; Zhou, Chun-Guang

2011-09-01

Recent research efforts reveal that color may provide useful information for face recognition. For different visual tasks, the choice of a color space is generally different. How can a color space be sought for the specific face recognition problem? To address this problem, this paper represents a color image as a third-order tensor and presents the tensor discriminant color space (TDCS) model. The model can keep the underlying spatial structure of color images. With the definition of n-mode between-class scatter matrices and within-class scatter matrices, TDCS constructs an iterative procedure to obtain one color space transformation matrix and two discriminant projection matrices by maximizing the ratio of these two scatter matrices. The experiments are conducted on two color face databases, AR and Georgia Tech face databases, and the results show that both the performance and the efficiency of the proposed method are better than those of the state-of-the-art color image discriminant model, which involve one color space transformation matrix and one discriminant projection matrix, specifically in a complicated face database with various pose variations.

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.

A software package to improve image quality and isolation of objects of interest for quantitative stereology studies of rat hepatocarcinogenesis.

PubMed

Xu, Yihua; Pitot, Henry C

2006-03-01

In the studies of quantitative stereology of rat hepatocarcinogenesis, we have used image analysis technology (automatic particle analysis) to obtain data such as liver tissue area, size and location of altered hepatic focal lesions (AHF), and nuclei counts. These data are then used for three-dimensional estimation of AHF occurrence and nuclear labeling index analysis. These are important parameters for quantitative studies of carcinogenesis, for screening and classifying carcinogens, and for risk estimation. To take such measurements, structures or cells of interest should be separated from the other components based on the difference of color and density. Common background problems seen on the captured sample image such as uneven light illumination or color shading can cause severe problems in the measurement. Two application programs (BK_Correction and Pixel_Separator) have been developed to solve these problems. With BK_Correction, common background problems such as incorrect color temperature setting, color shading, and uneven light illumination background, can be corrected. With Pixel_Separator different types of objects can be separated from each other in relation to their color, such as seen with different colors in immunohistochemically stained slides. The resultant images of such objects separated from other components are then ready for particle analysis. Objects that have the same darkness but different colors can be accurately differentiated in a grayscale image analysis system after application of these programs.

Color Counts, Too!

ERIC Educational Resources Information Center

Sewell, Julia H.

1983-01-01

Students with undetected color blindness can have problems with specific teaching methods and materials. The problem should be ruled out in children with suspected learning disabilities and taken into account in career counseling. Nine examples of simple classroom modifications are described. (CL)

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

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.

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.

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

PubMed

Silva, Eduardo Sant Ana da; Pedrini, Helio

2016-03-01

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

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

NASA Astrophysics Data System (ADS)

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

2018-02-01

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

An Algorithm to Automatically Generate the Combinatorial Orbit Counting Equations

PubMed Central

Melckenbeeck, Ine; Audenaert, Pieter; Michoel, Tom; Colle, Didier; Pickavet, Mario

2016-01-01

Graphlets are small subgraphs, usually containing up to five vertices, that can be found in a larger graph. Identification of the graphlets that a vertex in an explored graph touches can provide useful information about the local structure of the graph around that vertex. Actually finding all graphlets in a large graph can be time-consuming, however. As the graphlets grow in size, more different graphlets emerge and the time needed to find each graphlet also scales up. If it is not needed to find each instance of each graphlet, but knowing the number of graphlets touching each node of the graph suffices, the problem is less hard. Previous research shows a way to simplify counting the graphlets: instead of looking for the graphlets needed, smaller graphlets are searched, as well as the number of common neighbors of vertices. Solving a system of equations then gives the number of times a vertex is part of each graphlet of the desired size. However, until now, equations only exist to count graphlets with 4 or 5 nodes. In this paper, two new techniques are presented. The first allows to generate the equations needed in an automatic way. This eliminates the tedious work needed to do so manually each time an extra node is added to the graphlets. The technique is independent on the number of nodes in the graphlets and can thus be used to count larger graphlets than previously possible. The second technique gives all graphlets a unique ordering which is easily extended to name graphlets of any size. Both techniques were used to generate equations to count graphlets with 4, 5 and 6 vertices, which extends all previous results. Code can be found at https://github.com/IneMelckenbeeck/equation-generator and https://github.com/IneMelckenbeeck/graphlet-naming. PMID:26797021

Color doppler in clinical cardiology

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

Duncan, W.J.

1987-01-01

A presentation of color doppler, which enables physicians to pinpoint problems and develop effective treatment. State-of-the-art illustrations and layout, with color images and explanatory text are included.

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.

Minimizing the Diameter of a Network Using Shortcut Edges

NASA Astrophysics Data System (ADS)

Demaine, Erik D.; Zadimoghaddam, Morteza

We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor approximation algorithms for different variations of this problem. We also show how to improve the approximation ratios using resource augmentation to allow more than k shortcut edges. We observe a close relation between the single-source version of the problem, where we want to minimize the largest distance from a given source vertex, and the well-known k-median problem. First we show that our constant-factor approximation algorithms for the general case solve the single-source problem within a constant factor. Then, using a linear-programming formulation for the single-source version, we find a (1 + ɛ)-approximation using O(klogn) shortcut edges. To show the tightness of our result, we prove that any ({3 over 2}-ɛ)-approximation for the single-source version must use Ω(klogn) shortcut edges assuming P ≠ NP.

Improved color constancy in honey bees enabled by parallel visual projections from dorsal ocelli.

PubMed

Garcia, Jair E; Hung, Yu-Shan; Greentree, Andrew D; Rosa, Marcello G P; Endler, John A; Dyer, Adrian G

2017-07-18

How can a pollinator, like the honey bee, perceive the same colors on visited flowers, despite continuous and rapid changes in ambient illumination and background color? A hundred years ago, von Kries proposed an elegant solution to this problem, color constancy, which is currently incorporated in many imaging and technological applications. However, empirical evidence on how this method can operate on animal brains remains tenuous. Our mathematical modeling proposes that the observed spectral tuning of simple ocellar photoreceptors in the honey bee allows for the necessary input for an optimal color constancy solution to most natural light environments. The model is fully supported by our detailed description of a neural pathway allowing for the integration of signals originating from the ocellar photoreceptors to the information processing regions in the bee brain. These findings reveal a neural implementation to the classic color constancy problem that can be easily translated into artificial color imaging systems.

The Trouble with Color.

ERIC Educational Resources Information Center

Merchant, David

1999-01-01

Discusses problems with color quality in Web sites. Topics include differences in monitor settings, including contrast; amount of video RAM; user preference settings; browser-safe colors; cross-platform readability; and gamma values. (LRW)

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.

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

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.

Color Functionality Used in Visual Display for Occupational and Environmental Safety and Managing Color Vision Deficiency.

PubMed

Ochiai, Nobuhisa; Kondo, Hiroyuki

2017-01-01

The effects of color perception are utilized in visual displays for the purpose of safety in the workplace and in daily life. These effects, generally known as color functionality, are divided into four classifications: visibility, legibility, conspicuity and discriminability. This article focuses on the relationship between the color functionality of color schemes used in visual displays for occupational and environmental safety and color vision deficiency (particularly congenital red-green color deficiency), a critical issue in ophthalmology, and examines the effects of color functionality on the perception of the color red in individuals with protan defects. Due to abrupt system reforms, current Japanese clinical ophthalmology finds itself in a situation where it is insufficiently prepared to handle congenital red-green color deficiencies. Indeed, occupational problems caused by color vision deficiencies have been almost completely neglected, and are an occupational safety and health concern that will need to be solved in the future. This report will present the guidelines for the color vision testing established by the British Health and Safety Executive (HSE), a pioneering example of a model meant to solve these problems. Issues relating to the creation of guidelines adapted to Japanese clinical ophthalmology will also be examined, and we will discuss ways to utilize color functionality used in visual displays for occupational and environmental safety to help manage color vision deficiency.

Using Color as Information in Computer Displays: Problems with Perception and Communication.

ERIC Educational Resources Information Center

Adkins, Mark; Pease, Warren

The advancement of microcomputer technology has reached the point where color monitors and color computer software are fast becoming the norm in our information society. Color is another channel for communication, and can be used for enhancement of both aesthetic characteristics and productivity. The advantage to the use of color for communication…

Slow Mapping: Color Word Learning as a Gradual Inductive Process

ERIC Educational Resources Information Center

Wagner, Katie; Dobkins, Karen; Barner, David

2013-01-01

Most current accounts of color word acquisition propose that the delay between children's first production of color words and adult-like understanding is due to problems abstracting color as a domain of meaning. Here we present evidence against this hypothesis, and show that, from the time children produce color words in a labeling task they use…

Electronic thermal transport in strongly correlated multilayered nanostructures

NASA Astrophysics Data System (ADS)

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

2007-01-01

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

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

Exotic quarks in Twin Higgs models

DOE PAGES

Cheng, Hsin -Chia; Jung, Sunghoon; Salvioni, Ennio; ...

2016-03-14

The Twin Higgs model provides a natural theory for the electroweak symmetry breaking without the need of new particles carrying the standard model gauge charges below a few TeV. In the low energy theory, the only probe comes from the mixing of the Higgs fields in the standard model and twin sectors. However, an ultraviolet completion is required below ~ 10 TeV to remove residual logarithmic divergences. In non-supersymmetric completions, new exotic fermions charged under both the standard model and twin gauge symmetries have to be present to accompany the top quark, thus providing a high energy probe of themore » model. Some of them carry standard model color, and may therefore be copiously produced at current or future hadron colliders. Once produced, these exotic quarks can decay into a top together with twin sector particles. If the twin sector particles escape the detection, we have the irreducible stop-like signals. On the other hand, some twin sector particles may decay back into the standard model particles with long lifetimes, giving spectacular displaced vertex signals in combination with the prompt top quarks. This happens in the Fraternal Twin Higgs scenario with typical parameters, and sometimes is even necessary for cosmological reasons. We study the potential displaced vertex signals from the decays of the twin bottomonia, twin glueballs, and twin leptons in the Fraternal Twin Higgs scenario. As a result, depending on the details of the twin sector, the exotic quarks may be probed up to ~ 2.5 TeV at the LHC and beyond 10 TeV at a future 100 TeV collider, providing a strong test of this class of ultraviolet completions.« less

On size-constrained minimum s–t cut problems and size-constrained dense subgraph problems

DOE PAGES

Chen, Wenbin; Samatova, Nagiza F.; Stallmann, Matthias F.; ...

2015-10-30

In some application cases, the solutions of combinatorial optimization problems on graphs should satisfy an additional vertex size constraint. In this paper, we consider size-constrained minimum s–t cut problems and size-constrained dense subgraph problems. We introduce the minimum s–t cut with at-least-k vertices problem, the minimum s–t cut with at-most-k vertices problem, and the minimum s–t cut with exactly k vertices problem. We prove that they are NP-complete. Thus, they are not polynomially solvable unless P = NP. On the other hand, we also study the densest at-least-k-subgraph problem (DalkS) and the densest at-most-k-subgraph problem (DamkS) introduced by Andersen andmore » Chellapilla [1]. We present a polynomial time algorithm for DalkS when k is bounded by some constant c. We also present two approximation algorithms for DamkS. In conclusion, the first approximation algorithm for DamkS has an approximation ratio of n-1/k-1, where n is the number of vertices in the input graph. The second approximation algorithm for DamkS has an approximation ratio of O (n δ), for some δ < 1/3.« less

Perceptual issues for color helmet-mounted displays: luminance and color contrast requirements

NASA Astrophysics Data System (ADS)

Harding, Thomas H.; Rash, Clarence E.; Lattimore, Morris R.; Statz, Jonathan; Martin, John S.

2016-05-01

Color is one of the latest design characteristics of helmet-mounted displays (HMDs). It's inclusion in design specifications is based on two suppositions: 1) color provides an additional method of encoding information, and 2) color provides a more realistic, and hence more intuitive, presentation of information, especially pilotage imagery. To some degree, these two perceived advantages have been validated with head-down panel-mounted displays, although not without a few problems associated with visual physiology and perception. These problems become more prevalent when the user population expands beyond military aviators to a general user population, of which a significant portion may have color vision deficiencies. When color is implemented in HMDs, which are eyes-out, see-through displays, visual perception issues become an increased concern. A major confound with HMDs is their inherent see-through (transparent) property. The result is color in the displayed image combines with color from the outside (or in-cockpit) world, possibly producing a false perception of either or both images. While human-factors derived guidelines based on trial and error have been developed, color HMD systems still place more emphasis on colorimetric than perceptual standards. This paper identifies the luminance and color contrast requirements for see-through HMDs. Also included is a discussion of ambient scene metrics and the choice of symbology color.

Environmental influences on neural systems of relational complexity

PubMed Central

Kalbfleisch, M. Layne; deBettencourt, Megan T.; Kopperman, Rebecca; Banasiak, Meredith; Roberts, Joshua M.; Halavi, Maryam

2013-01-01

Constructivist learning theory contends that we construct knowledge by experience and that environmental context influences learning. To explore this principle, we examined the cognitive process relational complexity (RC), defined as the number of visual dimensions considered during problem solving on a matrix reasoning task and a well-documented measure of mature reasoning capacity. We sought to determine how the visual environment influences RC by examining the influence of color and visual contrast on RC in a neuroimaging task. To specify the contributions of sensory demand and relational integration to reasoning, our participants performed a non-verbal matrix task comprised of color, no-color line, or black-white visual contrast conditions parametrically varied by complexity (relations 0, 1, 2). The use of matrix reasoning is ecologically valid for its psychometric relevance and for its potential to link the processing of psychophysically specific visual properties with various levels of RC during reasoning. The role of these elements is important because matrix tests assess intellectual aptitude based on these seemingly context-less exercises. This experiment is a first step toward examining the psychophysical underpinnings of performance on these types of problems. The importance of this is increased in light of recent evidence that intelligence can be linked to visual discrimination. We submit three main findings. First, color and black-white visual contrast (BWVC) add demand at a basic sensory level, but contributions from color and from BWVC are dissociable in cortex such that color engages a “reasoning heuristic” and BWVC engages a “sensory heuristic.” Second, color supports contextual sense-making by boosting salience resulting in faster problem solving. Lastly, when visual complexity reaches 2-relations, color and visual contrast relinquish salience to other dimensions of problem solving. PMID:24133465

High dynamic range algorithm based on HSI color space

NASA Astrophysics Data System (ADS)

Zhang, Jiancheng; Liu, Xiaohua; Dong, Liquan; Zhao, Yuejin; Liu, Ming

2014-10-01

This paper presents a High Dynamic Range algorithm based on HSI color space. To keep hue and saturation of original image and conform to human eye vision effect is the first problem, convert the input image data to HSI color space which include intensity dimensionality. To raise the speed of the algorithm is the second problem, use integral image figure out the average of every pixel intensity value under a certain scale, as local intensity component of the image, and figure out detail intensity component. To adjust the overall image intensity is the third problem, we can get an S type curve according to the original image information, adjust the local intensity component according to the S type curve. To enhance detail information is the fourth problem, adjust the detail intensity component according to the curve designed in advance. The weighted sum of local intensity component after adjusted and detail intensity component after adjusted is final intensity. Converting synthetic intensity and other two dimensionality to output color space can get final processed image.

The Use of Color-Coded Genograms in Family Therapy.

ERIC Educational Resources Information Center

Lewis, Karen Gail

1989-01-01

Describes a variable color-coding system which has been added to the standard family genogram in which characteristics or issues associated with a particular presenting problem or for a particular family are arbitrarily assigned a color. Presents advantages of color-coding, followed by clinical examples. (Author/ABL)

Separation of irradiance and reflectance from observed color images by logarithmical nonlinear diffusion process

NASA Astrophysics Data System (ADS)

Saito, Takahiro; Takahashi, Hiromi; Komatsu, Takashi

2006-02-01

The Retinex theory was first proposed by Land, and deals with separation of irradiance from reflectance in an observed image. The separation problem is an ill-posed problem. Land and others proposed various Retinex separation algorithms. Recently, Kimmel and others proposed a variational framework that unifies the previous Retinex algorithms such as the Poisson-equation-type Retinex algorithms developed by Horn and others, and presented a Retinex separation algorithm with the time-evolution of a linear diffusion process. However, the Kimmel's separation algorithm cannot achieve physically rational separation, if true irradiance varies among color channels. To cope with this problem, we introduce a nonlinear diffusion process into the time-evolution. Moreover, as to its extension to color images, we present two approaches to treat color channels: the independent approach to treat each color channel separately and the collective approach to treat all color channels collectively. The latter approach outperforms the former. Furthermore, we apply our separation algorithm to a high quality chroma key in which before combining a foreground frame and a background frame into an output image a color of each pixel in the foreground frame are spatially adaptively corrected through transformation of the separated irradiance. Experiments demonstrate superiority of our separation algorithm over the Kimmel's separation algorithm.

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

PubMed

Pei, Lidan; Pan, Xiangfeng

2018-01-01

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

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.

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.

Median Hetero-Associative Memories Applied to the Categorization of True-Color Patterns

NASA Astrophysics Data System (ADS)

Vázquez, Roberto A.; Sossa, Humberto

Median associative memories (MED-AMs) are a special type of associative memory based on the median operator. This type of associative model has been applied to the restoration of gray scale images and provides better performance than other models, such as morphological associative memories, when the patterns are altered with mixed noise. Despite of his power, MED-AMs have not been applied in problems involving true-color patterns. In this paper we describe how a median hetero-associative memory (MED-HAM) could be applied in problems that involve true-color patterns. A complete study of the behavior of this associative model in the restoration of true-color images is performed using a benchmark of 14400 images altered by different type of noises. Furthermore, we describe how this model can be applied to an image categorization problem.

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

Six-vertex model and Schramm-Loewner evolution.

PubMed

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

2017-05-01

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

Belle II silicon vertex detector

NASA Astrophysics Data System (ADS)

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

2016-09-01

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

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

DTIC Science & Technology

1981-01-01

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

Domain-wall trapping in a ferromagnetic nanowire network

NASA Astrophysics Data System (ADS)

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

2003-05-01

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

The psychological four-color mapping problem.

PubMed

Francis, Gregory; Bias, Keri; Shive, Joshua

2010-06-01

Mathematicians have proven that four colors are sufficient to color 2-D maps so that no neighboring regions share the same color. Here we consider the psychological 4-color problem: Identifying which 4 colors should be used to make a map easy to use. We build a model of visual search for this design task and demonstrate how to apply it to the task of identifying the optimal colors for a map. We parameterized the model with a set of 7 colors using a visual search experiment in which human participants found a target region on a small map. We then used the model to predict search times for new maps and identified the color assignments that minimize or maximize average search time. The differences between these maps were predicted to be substantial. The model was then tested with a larger set of 31 colors on a map of English counties under conditions in which participants might memorize some aspects of the map. Empirical tests of the model showed that an optimally best colored version of this map is searched 15% faster than the correspondingly worst colored map. Thus, the color assignment seems to affect search times in a way predicted by the model, and this effect persists even when participants might use other sources of knowledge about target location. PsycINFO Database Record (c) 2010 APA, all rights reserved.

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.

Finding text in color images

NASA Astrophysics Data System (ADS)

Zhou, Jiangying; Lopresti, Daniel P.; Tasdizen, Tolga

1998-04-01

In this paper, we consider the problem of locating and extracting text from WWW images. A previous algorithm based on color clustering and connected components analysis works well as long as the color of each character is relatively uniform and the typography is fairly simple. It breaks down quickly, however, when these assumptions are violated. In this paper, we describe more robust techniques for dealing with this challenging problem. We present an improved color clustering algorithm that measures similarity based on both RGB and spatial proximity. Layout analysis is also incorporated to handle more complex typography. THese changes significantly enhance the performance of our text detection procedure.

Current Developments in Colour Microform Technology.

ERIC Educational Resources Information Center

Gunn, Michael J.

1985-01-01

Addresses some lingering problems with production and use of color microforms, e.g., reliable microfilm emulsion, color temperature, and image fading; and reports on recent advances in color stability and accuracy and international efforts to standardize production. (MBR)

Optimization of LED light spectrum to enhance colorfulness of illuminated objects with white light constraints.

PubMed

Wu, Haining; Dong, Jianfei; Qi, Gaojin; Zhang, Guoqi

2015-07-01

Enhancing the colorfulness of illuminated objects is a promising application of LED lighting for commercial, exhibiting, and scientific purposes. This paper proposes a method to enhance the color of illuminated objects for a given polychromatic lamp. Meanwhile, the light color is restricted to white. We further relax the white light constraints by introducing soft margins. Based on the spectral and electrical characteristics of LEDs and object surface properties, we determine the optimal mixing of the LED light spectrum by solving a numerical optimization problem, which is a quadratic fractional programming problem by formulation. Simulation studies show that the trade-off between the white light constraint and the level of the color enhancement can be adjusted by tuning an upper limit value of the soft margin. Furthermore, visual evaluation experiments are performed to evaluate human perception of the color enhancement. The experiments have verified the effectiveness of the proposed method.

Self-aligned quadruple patterning-compliant placement

NASA Astrophysics Data System (ADS)

Nakajima, Fumiharu; Kodama, Chikaaki; Nakayama, Koichi; Nojima, Shigeki; Kotani, Toshiya

2015-03-01

Self-Aligned Quadruple Patterning (SAQP) will be one of the leading candidates for sub-14nm node and beyond. However, compared with triple patterning, making a feasible standard cell placement has following problems. (1) When coloring conflicts occur between two adjoining cells, they may not be solved easily since SAQP layout has stronger coloring constraints. (2) SAQP layout cannot use stitch to solve coloring conflict. In this paper, we present a framework of SAQP-aware standard cell placement considering the above problems. When standard cell is placed, the proposed method tries to solve coloring conflicts between two cells by exchanging two of three colors. If some conflicts remain between adjoining cells, dummy space will be inserted to keep coloring constraints of SAQP. We show some examples to confirm effectiveness of the proposed framework. To our best knowledge, this is the first framework of SAQP-aware standard cell placement.

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.

Grouper: a compact, streamable triangle mesh data structure.

PubMed

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

2014-01-01

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

Grouper: A Compact, Streamable Triangle Mesh Data Structure

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

Luffel, Mark; Gurung, Topraj; Lindstrom, Peter

2014-01-01

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

Color aspects of variable data proofing

NASA Astrophysics Data System (ADS)

Beretta, Giordano B.

2005-01-01

The Internet in combination with digital presses has allowed the geographical distribution of manufacturing printed materials. An increasing number of printed pieces is customized for the recipient; when each printed piece is different, conventional proofing fails, because it is impossible to proof the entire print job. One frequent problem in automatically generated pieces is the readability of one page element on top of another element; the color combination can be unreadable or clash. I propose simple algorithms to automatically detect and correct color discriminability problems in variable data printing.

Color aspects of variable data proofing

NASA Astrophysics Data System (ADS)

Beretta, Giordano B.

2004-12-01

The Internet in combination with digital presses has allowed the geographical distribution of manufacturing printed materials. An increasing number of printed pieces is customized for the recipient; when each printed piece is different, conventional proofing fails, because it is impossible to proof the entire print job. One frequent problem in automatically generated pieces is the readability of one page element on top of another element; the color combination can be unreadable or clash. I propose simple algorithms to automatically detect and correct color discriminability problems in variable data printing.

The Chemistry of Food Dyes. Palette of Color Monograph Series.

ERIC Educational Resources Information Center

Epp, Dianne N.

Dyes aren't just for fabrics--colorants have been added to food for centuries to enhance its appearance. This monograph and teaching guide investigates both the compounds that give foods their natural color and synthetic colorants currently approved for use in foods. Problem-solving inquiry based activities involve high school level students in…

Reimagining the Color Wheel

ERIC Educational Resources Information Center

Snyder, Jennifer

2011-01-01

Color wheels are a traditional project for many teachers. The author has used them in art appreciation classes for many years, but one problem she found when her pre-service art education students created colored wheels was that they were boring: simple circles, with pie-shaped pieces, which students either painted or colored in. This article…

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

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.

Adaptive Local Linear Regression with Application to Printer Color Management

DTIC Science & Technology

2008-01-01

values formed the test samples. This process guaranteed that the CIELAB test samples were in the gamut for each printer, but each printer had a...digital images has recently led to increased consumer demand for accurate color reproduction. Given a CIELAB color one would like to reproduce, the color...management problem is to determine what RGB color one must send the printer to minimize the error between the desired CIELAB color and the CIELAB

Colored Traveling Salesman Problem.

PubMed

Li, Jun; Zhou, MengChu; Sun, Qirui; Dai, Xianzhong; Yu, Xiaolong

2015-11-01

The multiple traveling salesman problem (MTSP) is an important combinatorial optimization problem. It has been widely and successfully applied to the practical cases in which multiple traveling individuals (salesmen) share the common workspace (city set). However, it cannot represent some application problems where multiple traveling individuals not only have their own exclusive tasks but also share a group of tasks with each other. This work proposes a new MTSP called colored traveling salesman problem (CTSP) for handling such cases. Two types of city groups are defined, i.e., each group of exclusive cities of a single color for a salesman to visit and a group of shared cities of multiple colors allowing all salesmen to visit. Evidences show that CTSP is NP-hard and a multidepot MTSP and multiple single traveling salesman problems are its special cases. We present a genetic algorithm (GA) with dual-chromosome coding for CTSP and analyze the corresponding solution space. Then, GA is improved by incorporating greedy, hill-climbing (HC), and simulated annealing (SA) operations to achieve better performance. By experiments, the limitation of the exact solution method is revealed and the performance of the presented GAs is compared. The results suggest that SAGA can achieve the best quality of solutions and HCGA should be the choice making good tradeoff between the solution quality and computing time.

The 1/ N Expansion of Tensor Models Beyond Perturbation Theory

NASA Astrophysics Data System (ADS)

Gurau, Razvan

2014-09-01

We analyze in full mathematical rigor the most general quartically perturbed invariant probability measure for a random tensor. Using a version of the Loop Vertex Expansion (which we call the mixed expansion) we show that the cumulants write as explicit series in 1/ N plus bounded rest terms. The mixed expansion recasts the problem of determining the subleading corrections in 1/ N into a simple combinatorial problem of counting trees decorated by a finite number of loop edges. As an aside, we use the mixed expansion to show that the (divergent) perturbative expansion of the tensor models is Borel summable and to prove that the cumulants respect an uniform scaling bound. In particular the quartically perturbed measures fall, in the N→ ∞ limit, in the universality class of Gaussian tensor models.

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.

Nonminimal Einstein-Yang-Mills-Higgs theory: Associated, color, and color-acoustic metrics for the Wu-Yang monopole model

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

Balakin, A. B.; Zayats, A. E.; Dehnen, H.

2007-12-15

We discuss a nonminimal Einstein-Yang-Mills-Higgs model with uniaxial anisotropy in the group space associated with the Higgs field. We apply this theory to the problem of propagation of color and color-acoustic waves in the gravitational background related to the nonminimal regular Wu-Yang monopole.

Color naming: color scientists do it between Munsell sheets of color

NASA Astrophysics Data System (ADS)

Beretta, Giordano B.; Moroney, Nathan M.

2010-01-01

With the advent of high dynamic range imaging and wide gamut color spaces, gamut mapping algorithms have to nudge image colors much more drastically to constrain them within a rendering device's gamut. Classical colorimetry is concerned with color matching and the developed color difference metrics are for small distances. For larger distances, categorization becomes a more useful concept. In the gamut mapping case, lexical distance induced by color names is a more useful metric, which translates to the condition that a nudged color may not cross a name boundary. The new problem is to find these color name boundaries. We compare the experimental procedures used for color naming by linguists, ethnologists, and color scientists and propose a methodology that leads to robust repeatable experiments.

Physics-based approach to color image enhancement in poor visibility conditions.

PubMed

Tan, K K; Oakley, J P

2001-10-01

Degradation of images by the atmosphere is a familiar problem. For example, when terrain is imaged from a forward-looking airborne camera, the atmosphere degradation causes a loss in both contrast and color information. Enhancement of such images is a difficult task because of the complexity in restoring both the luminance and the chrominance while maintaining good color fidelity. One particular problem is the fact that the level of contrast loss depends strongly on wavelength. A novel method is presented for the enhancement of color images. This method is based on the underlying physics of the degradation process, and the parameters required for enhancement are estimated from the image itself.

Thresholded-Rewards Decision Problems: Acting Effectively in Timed Domains

DTIC Science & Technology

2009-04-02

intermediate reward (score difference). 89 5.8 Regions covered by each role in each play. (a) RoboCup play. The defender’s region is colored with dark dots; the...colored with dark dots; the middle defender’s region is colored with a light checkerboard pattern, and the front defender’s region is colored with...defender’s region is colored with dark dots; the supporter’s region is colored with diagonal lines. The attacker’s region is the entire field. (b

Introduction to Color Imaging Science

NASA Astrophysics Data System (ADS)

Lee, Hsien-Che

2005-04-01

Color imaging technology has become almost ubiquitous in modern life in the form of monitors, liquid crystal screens, color printers, scanners, and digital cameras. This book is a comprehensive guide to the scientific and engineering principles of color imaging. It covers the physics of light and color, how the eye and physical devices capture color images, how color is measured and calibrated, and how images are processed. It stresses physical principles and includes a wealth of real-world examples. The book will be of value to scientists and engineers in the color imaging industry and, with homework problems, can also be used as a text for graduate courses on color imaging.

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.

Track and vertex reconstruction: From classical to adaptive methods

NASA Astrophysics Data System (ADS)

Strandlie, Are; Frühwirth, Rudolf

2010-04-01

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

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

NASA Astrophysics Data System (ADS)

Indriati, Diari; Rosyida, Isnaini; Widodo

2018-04-01

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

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

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

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

Complex growing networks with intrinsic vertex fitness

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

Bedogne, C.; Rodgers, G. J.

2006-10-15

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

Vertex shading of the three-dimensional model based on ray-tracing algorithm

NASA Astrophysics Data System (ADS)

Hu, Xiaoming; Sang, Xinzhu; Xing, Shujun; Yan, Binbin; Wang, Kuiru; Dou, Wenhua; Xiao, Liquan

2016-10-01

Ray Tracing Algorithm is one of the research hotspots in Photorealistic Graphics. It is an important light and shadow technology in many industries with the three-dimensional (3D) structure, such as aerospace, game, video and so on. Unlike the traditional method of pixel shading based on ray tracing, a novel ray tracing algorithm is presented to color and render vertices of the 3D model directly. Rendering results are related to the degree of subdivision of the 3D model. A good light and shade effect is achieved by realizing the quad-tree data structure to get adaptive subdivision of a triangle according to the brightness difference of its vertices. The uniform grid algorithm is adopted to improve the rendering efficiency. Besides, the rendering time is independent of the screen resolution. In theory, as long as the subdivision of a model is adequate, cool effects as the same as the way of pixel shading will be obtained. Our practical application can be compromised between the efficiency and the effectiveness.

Spontaneous symmetry breaking and phase coexistence in two-color networks

NASA Astrophysics Data System (ADS)

Avetisov, V.; Gorsky, A.; Nechaev, S.; Valba, O.

2016-01-01

We consider an equilibrium ensemble of large Erdős-Renyi topological random networks with fixed vertex degree and two types of vertices, black and white, prepared randomly with the bond connection probability p . The network energy is a sum of all unicolor triples (either black or white), weighted with chemical potential of triples μ . Minimizing the system energy, we see for some positive μ the formation of two predominantly unicolor clusters, linked by a string of Nb w black-white bonds. We have demonstrated that the system exhibits critical behavior manifested in the emergence of a wide plateau on the Nb w(μ ) curve, which is relevant to a spinodal decomposition in first-order phase transitions. In terms of a string theory, the plateau formation can be interpreted as an entanglement between baby universes in two-dimensional gravity. We conjecture that the observed classical phenomenon can be considered as a toy model for the chiral condensate formation in quantum chromodynamics.

Spontaneous symmetry breaking and phase coexistence in two-color networks.

PubMed

Avetisov, V; Gorsky, A; Nechaev, S; Valba, O

2016-01-01

We consider an equilibrium ensemble of large Erdős-Renyi topological random networks with fixed vertex degree and two types of vertices, black and white, prepared randomly with the bond connection probability p. The network energy is a sum of all unicolor triples (either black or white), weighted with chemical potential of triples μ. Minimizing the system energy, we see for some positive μ the formation of two predominantly unicolor clusters, linked by a string of N_{bw} black-white bonds. We have demonstrated that the system exhibits critical behavior manifested in the emergence of a wide plateau on the N_{bw}(μ) curve, which is relevant to a spinodal decomposition in first-order phase transitions. In terms of a string theory, the plateau formation can be interpreted as an entanglement between baby universes in two-dimensional gravity. We conjecture that the observed classical phenomenon can be considered as a toy model for the chiral condensate formation in quantum chromodynamics.

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.

Open Technology Approaches to Geospatial Interface Design

NASA Astrophysics Data System (ADS)

Crevensten, B.; Simmons, D.; Alaska Satellite Facility

2011-12-01

What problems do you not want your software developers to be solving? Choosing open technologies across the entire stack of software development-from low-level shared libraries to high-level user interaction implementations-is a way to help ensure that customized software yields innovative and valuable tools for Earth Scientists. This demonstration will review developments in web application technologies and the recurring patterns of interaction design regarding exploration and discovery of geospatial data through the Vertex: ASF's Dataportal interface, a project utilizing current open web application standards and technologies including HTML5, jQueryUI, Backbone.js and the Jasmine unit testing framework.

Color infrared film as a negative material

USGS Publications Warehouse

Pease, Robert W.

1970-01-01

Original problems encountered in endeavors to use color infraredfilm as a negative material have been overcome by a simple modification in processing. This makes more feasible the production of infrared color prints for field use and yields an infrared counterpart to Aero-Neg.

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

PubMed Central

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

2014-01-01

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

Conservation laws, vertex corrections, and screening in Raman spectroscopy

NASA Astrophysics Data System (ADS)

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

2017-07-01

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

Clipping polygon faces through a polyhedron of vision

NASA Technical Reports Server (NTRS)

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

1980-01-01

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

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.

Number of discernible object colors is a conundrum.

PubMed

Masaoka, Kenichiro; Berns, Roy S; Fairchild, Mark D; Moghareh Abed, Farhad

2013-02-01

Widely varying estimates of the number of discernible object colors have been made by using various methods over the past 100 years. To clarify the source of the discrepancies in the previous, inconsistent estimates, the number of discernible object colors is estimated over a wide range of color temperatures and illuminance levels using several chromatic adaptation models, color spaces, and color difference limens. Efficient and accurate models are used to compute optimal-color solids and count the number of discernible colors. A comprehensive simulation reveals limitations in the ability of current color appearance models to estimate the number of discernible colors even if the color solid is smaller than the optimal-color solid. The estimates depend on the color appearance model, color space, and color difference limen used. The fundamental problem lies in the von Kries-type chromatic adaptation transforms, which have an unknown effect on the ranking of the number of discernible colors at different color temperatures.

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.

A new fringeline-tracking approach for color Doppler ultrasound imaging phase unwrapping

NASA Astrophysics Data System (ADS)

Saad, Ashraf A.; Shapiro, Linda G.

2008-03-01

Color Doppler ultrasound imaging is a powerful non-invasive diagnostic tool for many clinical applications that involve examining the anatomy and hemodynamics of human blood vessels. These clinical applications include cardio-vascular diseases, obstetrics, and abdominal diseases. Since its commercial introduction in the early eighties, color Doppler ultrasound imaging has been used mainly as a qualitative tool with very little attempts to quantify its images. Many imaging artifacts hinder the quantification of the color Doppler images, the most important of which is the aliasing artifact that distorts the blood flow velocities measured by the color Doppler technique. In this work we will address the color Doppler aliasing problem and present a recovery methodology for the true flow velocities from the aliased ones. The problem is formulated as a 2D phase-unwrapping problem, which is a well-defined problem with solid theoretical foundations for other imaging domains, including synthetic aperture radar and magnetic resonance imaging. This paper documents the need for a phase unwrapping algorithm for use in color Doppler ultrasound image analysis. It describes a new phase-unwrapping algorithm that relies on the recently developed cutline detection approaches. The algorithm is novel in its use of heuristic information provided by the ultrasound imaging modality to guide the phase unwrapping process. Experiments have been performed on both in-vitro flow-phantom data and in-vivo human blood flow data. Both data types were acquired under a controlled acquisition protocol developed to minimize the distortion of the color Doppler data and hence to simplify the phase-unwrapping task. In addition to the qualitative assessment of the results, a quantitative assessment approach was developed to measure the success of the results. The results of our new algorithm have been compared on ultrasound data to those from other well-known algorithms, and it outperforms all of them.

Instrumental color control in textile printing

NASA Astrophysics Data System (ADS)

Connelly, Roland L., Sr.

1996-03-01

In textile printing there are several color outputs that need to be controlled. Just as important is the color coordination of these outputs. The types of color output are the video display on the textile design system (CATD for Computer Aided Textile Design), the color scanner, the color pattern printer, and the actual pattern printed on the textile substrate. Each of these systems has its own gamut(s) that is partially overlapping of the others and will require mapping and/or truncation to adequately represent the colors of the final print in the other systems. One of the goals of instrumentation systems is to control these devices so that the message of the pattern is the same on all four media. To accomplish this is a significant task that has yet to be completed to meet the rigorous requirements of the textile and apparel industries. Several of the major problems and directions for solving them will be discussed in this paper. These include getting good instrumental measurements, translation of data between systems, and specific problems related to the hard copy output.

Effect of time spacing on the perceived color

NASA Astrophysics Data System (ADS)

Roch, Sylvain; Hardeberg, Jon Y.; Nussbaum, Peter

2007-01-01

One of latest developments for pre-press applications is the concept of soft proofing, which aims to provide an accurate preview on a monitor of how the final document will appear once it is printed. At the core of this concept is the problem of identifying, for any printed color, the most similar color the monitor can display. This problem is made difficult by such factors as varying viewing conditions, color gamut limitations, or the less studied time spacing. Color matching experiments are usually done by examining samples viewed simultaneously. However, in soft proofing applications, the proof and the print are not always viewed together. This paper attempts to shed more light on the difference between simultaneous and time-spaced color matching, in order to contribute to improving the accuracy of soft proofs. A color matching experiment setup has been established in which observers were asked to match a color patch displayed on a LCD monitor, by adjusting its RGB values, to another color patch printed out on paper. In the first part of the experiment the two colors were viewed simultaneously. In the second part, the observers were asked to produce the match according to a previously memorized color. According to the obtained results, the color appearance attributes lightness and chroma were the most difficult components for the observers to remember, generating huge differences with the simultaneous match, whereas hue was the component which varied the least. This indicates that for soft proofing, getting the hues right is of primordial importance.

Path coloring on the Mesh

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

Rabani, Y.

In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edge disjoint. Our objective is to minimize the number of colors used. This problem was raised by Aggarwal et al and Raghavan and Upfal as a model for routing in all-optical networks. It is also related to questions in circuit routing. In this paper, we improve the O (ln N) approximation result of Kleinberg and Tardos for path coloring on the N x Nmore » mesh. We give an O(1) approximation algorithm to the number of colors needed, and a poly(ln ln N) approximation algorithm to the choice of paths and colors. To the best of our knowledge, these are the first sub-logarithmic bounds for any network other than trees, rings, or trees of rings. Our results are based on developing new techniques for randomized rounding. These techniques iteratively improve a fractional solution until it approaches integrality. They are motivated by the method used by Leighton, Maggs, and Rao for packet routing.« less

Spatio-spectral color filter array design for optimal image recovery.

PubMed

Hirakawa, Keigo; Wolfe, Patrick J

2008-10-01

In digital imaging applications, data are typically obtained via a spatial subsampling procedure implemented as a color filter array-a physical construction whereby only a single color value is measured at each pixel location. Owing to the growing ubiquity of color imaging and display devices, much recent work has focused on the implications of such arrays for subsequent digital processing, including in particular the canonical demosaicking task of reconstructing a full color image from spatially subsampled and incomplete color data acquired under a particular choice of array pattern. In contrast to the majority of the demosaicking literature, we consider here the problem of color filter array design and its implications for spatial reconstruction quality. We pose this problem formally as one of simultaneously maximizing the spectral radii of luminance and chrominance channels subject to perfect reconstruction, and-after proving sub-optimality of a wide class of existing array patterns-provide a constructive method for its solution that yields robust, new panchromatic designs implementable as subtractive colors. Empirical evaluations on multiple color image test sets support our theoretical results, and indicate the potential of these patterns to increase spatial resolution for fixed sensor size, and to contribute to improved reconstruction fidelity as well as significantly reduced hardware complexity.

Colorful Success: Preschoolers' Use of Perceptual Color Cues to Solve a Spatial Reasoning Problem

ERIC Educational Resources Information Center

Joh, Amy S.; Spivey, Leigh A.

2012-01-01

Spatial reasoning, a crucial skill for everyday actions, develops gradually during the first several years of childhood. Previous studies have shown that perceptual information and problem solving strategies are critical for successful spatial reasoning in young children. Here, we sought to link these two factors by examining children's use of…

Removing the Veil: Coates, Neoliberalism, and the Color Line

ERIC Educational Resources Information Center

Humphrey, David

2017-01-01

The words of W. E. B. Du Bois, in his widely-acclaimed work" The Souls of Black Folk," that "the problem of the twentieth century is the problem of the color-line" were a visceral attempt to illuminate the plight of the "Negro" in the United States of America. With this phrase, Du Bois positioned racial valorizations…

Color blindness defect and medical laboratory technologists: unnoticed problems and the care for screening.

PubMed

Dargahi, Hossein; Einollahi, Nahid; Dashti, Nasrin

2010-01-01

Color-blindness is the inability to perceive differences between some color that other people can distinguish. Using a literature search, the results indicate the prevalence of color vision deficiency in the medical profession and its on medical skills. Medical laboratory technicians and technologists employees should also screen for color blindness. This research aimed to study color blindness prevalence among Hospitals' Clinical Laboratories' Employees and Students in Tehran University of Medical Sciences (TUMS). A cross-sectional descriptive and analytical study was conducted among 633 TUMS Clinical Laboratory Sciences' Students and Hospitals' Clinical Laboratories' Employees to detect color-blindness problems by Ishihara Test. The tests were first screened with certain pictures, then compared to the Ishihara criteria to be possible color defective were tested further with other plates to determine color - blindness defects. The data was saved using with SPSS software and analyzed by statistical methods. This is the first study to determine the prevalence of color - blindness in Clinical Laboratory Sciences' Students and Employees. 2.4% of TUMS Medical Laboratory Sciences Students and Hospitals' Clinical Laboratories' Employees are color-blind. There is significant correlation between color-blindness and sex and age. But the results showed that there is not significant correlation between color-blindness defect and exposure to chemical agents, type of job, trauma and surgery history, history of familial defect and race. It would be a wide range of difficulties by color blinded students and employees in their practice of laboratory diagnosis and techniques with a potentially of errors. We suggest color blindness as a medical conditions should restrict employment choices for medical laboratory technicians and technologists job in Iran.

Incremental k-core decomposition: Algorithms and evaluation

DOE PAGES

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

2016-02-01

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

A Fast linking approach for CMYK to CMYK conversion preserving black separation in ICC color management system

NASA Astrophysics Data System (ADS)

Zeng, Huanzhao

2003-12-01

In the linking step of the standard ICC color management workflow for CMYK to CMYK conversion, a CMM takes an AToBn tag (n = 0, 1, or 2) from a source ICC profile to convert a color from the source color space to PCS (profile connection space), and then takes a BToAn tag from the destination ICC profile to convert the color from PCS to the destination color space. This approach may give satisfactory result perceptually or colorimetrically. However, it does not preserve the K channel for CMYK to CMYK conversion, which is often required in graphic art"s market. The problem is that the structure of a BtoAn tag is designed to convert colors from PCS to a device color space ignoring the K values from the source color space. Different approaches have been developed to control K in CMYK to CMYK printing, yet none of them well fits into the "Profile - PCS - Profile" model in the ICC color management system. A traditional approach is to transform the source CMYK to the destination CMYK by 1-D TRC curves and GCR/UCR tables. This method is so simple that it cannot accurately transform colors perceptually or colorimetrically. Another method is to build a 4-D CMYK to CMYK closed-loop lookup table (LUT) (or a deviceLink ICC profile) for the color transformation. However, this approach does not fit into opened color management workflows for it ties the source and the destination color spaces in the color characterization step. A specialized CMM may preserve K for a limit number of colors by mapping those CMYK colors to some carefully chosen PCS colors in both the AToBi tag and the BToAi tag. A more complete solution is to move to smart linking in which gamut mapping is performed in the real-time linking at a CMM. This method seems to solve all problems existed in the CMYK to CMYK conversion. However, it introduces new problems: 1) gamut mapping at real-time linking is often unacceptable slow; 2) gamut mapping may not be optimized or may be unreliable; 3) manual adjustment for building high quality maps does not fit to the smart CMM workflow. A new approach is described in this paper to solve these problems. Instead of using a BtoAn tag from the destination profile for color transformation, a new tag is created to map colors in PCS (L*a*b* or XYZ) with different K values to different CMY values. A set of 3-D LUTs for different K values are created for the conversion from PCS to CMY, and 1-D LUTs are created for the conversion from luminance to K and to guide a CMM to perform the interpolation from KPCS (K plus PCS) to CMYK. The gamut mapping is performed in the step to create the profile, thus avoiding realtime gamut mapping in a CMM. With this approach, the black channel is preserved; the "Profile - PCS - Profile" approach is still valid; and the gamut mapping is not performed during linking in a CMM. Therefore, gamut mapping can be manually adjusted for high quality color mapping, the linking is almost as easy and fast as the standard linking, and the black channel is preserved.

Galilean invariance and vertex renormalization in turbulence theory.

PubMed

McComb, W D

2005-03-01

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

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

NASA Astrophysics Data System (ADS)

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

2018-04-01

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

Optimized Vertex Method and Hybrid Reliability

NASA Technical Reports Server (NTRS)

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

2002-01-01

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

Continuous-time quantum Monte Carlo calculation of multiorbital vertex asymptotics

NASA Astrophysics Data System (ADS)

Kaufmann, Josef; Gunacker, Patrik; Held, Karsten

2017-07-01

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

Anomalous glassy dynamics in simple models of dense biological tissue

NASA Astrophysics Data System (ADS)

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

2018-02-01

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

Diagrammatic expansion for positive density-response spectra: Application to the electron gas

NASA Astrophysics Data System (ADS)

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

2015-03-01

In a recent paper [Phys. Rev. B 90, 115134 (2014), 10.1103/PhysRevB.90.115134] we put forward a diagrammatic expansion for the self-energy which guarantees the positivity of the spectral function. In this work we extend the theory to the density-response function. We write the generic diagram for the density-response spectrum as the sum of "partitions." In a partition the original diagram is evaluated using time-ordered Green's functions on the left half of the diagram, antitime-ordered Green's functions on the right half of the diagram, and lesser or greater Green's function gluing the two halves. As there exists more than one way to cut a diagram in two halves, to every diagram corresponds more than one partition. We recognize that the most convenient diagrammatic objects for constructing a theory of positive spectra are the half-diagrams. Diagrammatic approximations obtained by summing the squares of half-diagrams do indeed correspond to a combination of partitions which, by construction, yield a positive spectrum. We develop the theory using bare Green's functions and subsequently extend it to dressed Green's functions. We further prove a connection between the positivity of the spectral function and the analytic properties of the polarizability. The general theory is illustrated with several examples and then applied to solve the long-standing problem of including vertex corrections without altering the positivity of the spectrum. In fact already the first-order vertex diagram, relevant to the study of gradient expansion, Friedel oscillations, etc., leads to spectra which are negative in certain frequency domain. We find that the simplest approximation to cure this deficiency is given by the sum of the zeroth-order bubble diagram, the first-order vertex diagram, and a partition of the second-order ladder diagram. We evaluate this approximation in the three-dimensional homogeneous electron gas and show the positivity of the spectrum for all frequencies and densities.

Printing quality control automation

NASA Astrophysics Data System (ADS)

Trapeznikova, O. V.

2018-04-01

One of the most important problems in the concept of standardizing the process of offset printing is the control the quality rating of printing and its automation. To solve the problem, a software has been developed taking into account the specifics of printing system components and the behavior in printing process. In order to characterize the distribution of ink layer on the printed substrate the so-called deviation of the ink layer thickness on the sheet from nominal surface is suggested. The geometric data construction the surface projections of the color gamut bodies allows to visualize the color reproduction gamut of printing systems in brightness ranges and specific color sectors, that provides a qualitative comparison of the system by the reproduction of individual colors in a varying ranges of brightness.

Equivalent Colorings with "Maple"

ERIC Educational Resources Information Center

Cecil, David R.; Wang, Rongdong

2005-01-01

Many counting problems can be modeled as "colorings" and solved by considering symmetries and Polya's cycle index polynomial. This paper presents a "Maple 7" program link http://users.tamuk.edu/kfdrc00/ that, given Polya's cycle index polynomial, determines all possible associated colorings and their partitioning into equivalence classes. These…

New flesh colors in watermelon?

USDA-ARS?s Scientific Manuscript database

There are currently six published flesh colors in watermelon along with the associated genes for each of the designated flesh colors. Previous results have shown that segregation patterns did not fit with published results for canary yellow and red flesh. We believe that part of the problem has been...

Example-Based Image Colorization Using Locality Consistent Sparse Representation.

PubMed

Bo Li; Fuchen Zhao; Zhuo Su; Xiangguo Liang; Yu-Kun Lai; Rosin, Paul L

2017-11-01

Image colorization aims to produce a natural looking color image from a given gray-scale image, which remains a challenging problem. In this paper, we propose a novel example-based image colorization method exploiting a new locality consistent sparse representation. Given a single reference color image, our method automatically colorizes the target gray-scale image by sparse pursuit. For efficiency and robustness, our method operates at the superpixel level. We extract low-level intensity features, mid-level texture features, and high-level semantic features for each superpixel, which are then concatenated to form its descriptor. The collection of feature vectors for all the superpixels from the reference image composes the dictionary. We formulate colorization of target superpixels as a dictionary-based sparse reconstruction problem. Inspired by the observation that superpixels with similar spatial location and/or feature representation are likely to match spatially close regions from the reference image, we further introduce a locality promoting regularization term into the energy formulation, which substantially improves the matching consistency and subsequent colorization results. Target superpixels are colorized based on the chrominance information from the dominant reference superpixels. Finally, to further improve coherence while preserving sharpness, we develop a new edge-preserving filter for chrominance channels with the guidance from the target gray-scale image. To the best of our knowledge, this is the first work on sparse pursuit image colorization from single reference images. Experimental results demonstrate that our colorization method outperforms the state-of-the-art methods, both visually and quantitatively using a user study.

Neurocognitive effects of neurofeedback in adolescents with ADHD: a randomized controlled trial.

PubMed

Bink, Marleen; van Nieuwenhuizen, Chijs; Popma, Arne; Bongers, Ilja L; van Boxtel, Geert J M

2014-05-01

Neurofeedback aims to reduce symptoms of attention-deficit/hyperactivity disorder (ADHD), mainly attention problems. However, the additional influence of neurofeedback over treatment as usual (TAU) on neurocognitive functioning for adolescents with ADHD remains unclear. By using a multicenter parallel randomized controlled trial (RCT) design, male adolescents with a DSM-IV-TR diagnosis of ADHD (mean age = 16.1 years; range, 12-24) were randomized to receive either a combination of TAU and neurofeedback (n = 45) or TAU (n = 26). Randomization was computer generated and stratified by age group (ages 12 through 15, 16 through 20, and 21 through 24 years). The neurofeedback intervention consisted of approximately 37 sessions over a period of 25 weeks of theta/sensorimotor rhythm training on the vertex (Cz). Primary neurocognitive outcomes included performance parameters derived from the D2 Test of Attention, the Digit Span backward, the Stroop Color-Word Test and the Tower of London, all assessed preintervention and postintervention. Data were collected between December 2009 and July 2012. At postintervention, outcomes of attention and/or motor speed were improved, with faster processing times for both intervention conditions and with medium to large effect sizes (range, ηp2 = .08-.54; P values < .023). In both groups, no improvements for higher executive functions were observed. Results might partly resemble practice effects. Although neurocognitive outcomes improved in all adolescents receiving treatment for ADHD, no additional value for neurofeedback over TAU was observed. Hence, this study does not provide evidence for using theta/sensorimotor rhythm neurofeedback to enhance neurocognitive performance as additional intervention to TAU for adolescents with ADHD symptoms. Trialregister.nl identifier: 1759. © Copyright 2014 Physicians Postgraduate Press, Inc.

Grapheme-color synesthesia influences overt visual attention.

PubMed

Carriere, Jonathan S A; Eaton, Daniel; Reynolds, Michael G; Dixon, Mike J; Smilek, Daniel

2009-02-01

For individuals with grapheme-color synesthesia, achromatic letters and digits elicit vivid perceptual experiences of color. We report two experiments that evaluate whether synesthesia influences overt visual attention. In these experiments, two grapheme-color synesthetes viewed colored letters while their eye movements were monitored. Letters were presented in colors that were either congruent or incongruent with the synesthetes' colors. Eye tracking analysis showed that synesthetes exhibited a color congruity bias-a propensity to fixate congruently colored letters more often and for longer durations than incongruently colored letters-in a naturalistic free-viewing task. In a more structured visual search task, this congruity bias caused synesthetes to rapidly fixate and identify congruently colored target letters, but led to problems in identifying incongruently colored target letters. The results are discussed in terms of their implications for perception in synesthesia.

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.

Stability of Dirac Liquids with Strong Coulomb Interaction.

PubMed

Tupitsyn, Igor S; Prokof'ev, Nikolay V

2017-01-13

We develop and apply the diagrammatic Monte Carlo technique to address the problem of the stability of the Dirac liquid state (in a graphene-type system) against the strong long-range part of the Coulomb interaction. So far, all attempts to deal with this problem in the field-theoretical framework were limited either to perturbative or random phase approximation and functional renormalization group treatments, with diametrically opposite conclusions. Our calculations aim at the approximation-free solution with controlled accuracy by computing vertex corrections from higher-order skeleton diagrams and establishing the renormalization group flow of the effective Coulomb coupling constant. We unambiguously show that with increasing the system size L (up to ln(L)∼40), the coupling constant always flows towards zero; i.e., the two-dimensional Dirac liquid is an asymptotically free T=0 state with divergent Fermi velocity.

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

NASA Astrophysics Data System (ADS)

Gandrajula, Reddy Pratap

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

Color enhancement for portable LCD displays in low-power mode

NASA Astrophysics Data System (ADS)

Shih, Kuang-Tsu; Huang, Tai-Hsiang; Chen, Homer H.

2011-09-01

Switching the backlight of handheld devices to low power mode saves energy but affects the color appearance of an image. In this paper, we consider the chroma degradation problem and propose an enhancement algorithm that incorporates the CIECAM02 appearance model to quantitatively characterize the problem. In the proposed algorithm, we enhance the color appearance of the image in low power mode by weighted linear superposition of the chroma of the image and that of the estimated dim-backlight image. Subjective tests are carried out to determine the perceptually optimal weighting and prove the effectiveness of our framework.

The role of geometry in 4-vertex origami mechanics

NASA Astrophysics Data System (ADS)

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

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

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

PubMed

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

2017-01-01

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

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

NASA Astrophysics Data System (ADS)

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

2017-05-01

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

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

NASA Astrophysics Data System (ADS)

Bao, Xiaohong; Pajarola, Renato

2003-05-01

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

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

Preferred skin color enhancement for photographic color reproduction

NASA Astrophysics Data System (ADS)

Zeng, Huanzhao; Luo, Ronnier

2011-01-01

Skin tones are the most important colors among the memory color category. Reproducing skin colors pleasingly is an important factor in photographic color reproduction. Moving skin colors toward their preferred skin color center improves the color preference of skin color reproduction. Several methods to morph skin colors to a smaller preferred skin color region has been reported in the past. In this paper, a new approach is proposed to further improve the result of skin color enhancement. An ellipsoid skin color model is applied to compute skin color probabilities for skin color detection and to determine a weight for skin color adjustment. Preferred skin color centers determined through psychophysical experiments were applied for color adjustment. Preferred skin color centers for dark, medium, and light skin colors are applied to adjust skin colors differently. Skin colors are morphed toward their preferred color centers. A special processing is applied to avoid contrast loss in highlight. A 3-D interpolation method is applied to fix a potential contouring problem and to improve color processing efficiency. An psychophysical experiment validates that the method of preferred skin color enhancement effectively identifies skin colors, improves the skin color preference, and does not objectionably affect preferred skin colors in original images.

Sunglasses, traffic signals, and color vision deficiencies.

PubMed

Dain, Stephen J; Wood, Joanne M; Atchison, David A

2009-04-01

To determine (a) the effect of different sunglass tint colorations on traffic signal detection and recognition for color normal and color deficient observers, and (b) the adequacy of coloration requirements in current sunglass standards. Twenty color-normals and 49 color-deficient males performed a tracking task while wearing sunglasses of different colorations (clear, gray, green, yellow-green, yellow-brown, red-brown). At random intervals, simulated traffic light signals were presented against a white background at 5 degrees to the right or left and observers were instructed to identify signal color (red/yellow/green) by pressing a response button as quickly as possible; response times and response errors were recorded. Signal color and sunglass tint had significant effects on response times and error rates (p < 0.05), with significant between-color group differences and interaction effects. Response times for color deficient people were considerably slower than color normals for both red and yellow signals for all sunglass tints, but for green signals they were only noticeably slower with the green and yellow-green lenses. For most of the color deficient groups, there were recognition errors for yellow signals combined with the yellow-green and green tints. In addition, deuteranopes had problems for red signals combined with red-brown and yellow-brown tints, and protanopes had problems for green signals combined with the green tint and for red signals combined with the red-brown tint. Many sunglass tints currently permitted for drivers and riders cause a measurable decrement in the ability of color deficient observers to detect and recognize traffic signals. In general, combinations of signals and sunglasses of similar colors are of particular concern. This is prima facie evidence of a risk in the use of these tints for driving and cautions against the relaxation of coloration limits in sunglasses beyond those represented in the study.

Reconstructing color images of astronomical objects using black and white spectroscopic emulsions

NASA Technical Reports Server (NTRS)

Dufour, R. I.; Martins, D. H.

1976-01-01

A color photograph of the peculiar elliptical galaxy NGC 5128 (Centaurus A) has been reconstructed from three Kodak 103a emulsion type photographs by projecting positives of the three B&W plates through appropriate filters onto a conventional color film. The resulting photograph shows color balance and latitude characteristics superior to color photographs of similar astronomical objects made with commercially available conventional color film. Similar results have been obtained for color reconstructed photographs of the Large and Small Magellanic Clouds. These and other results suggest that these projection-reconstruction techniques can be used to obtain high-quality color photographs of astronomical objects which overcome many of the problems associated with the use of conventional color film for the long exposures required in astronomy.

Design and optimization of color lookup tables on a simplex topology.

PubMed

Monga, Vishal; Bala, Raja; Mo, Xuan

2012-04-01

An important computational problem in color imaging is the design of color transforms that map color between devices or from a device-dependent space (e.g., RGB/CMYK) to a device-independent space (e.g., CIELAB) and vice versa. Real-time processing constraints entail that such nonlinear color transforms be implemented using multidimensional lookup tables (LUTs). Furthermore, relatively sparse LUTs (with efficient interpolation) are employed in practice because of storage and memory constraints. This paper presents a principled design methodology rooted in constrained convex optimization to design color LUTs on a simplex topology. The use of n simplexes, i.e., simplexes in n dimensions, as opposed to traditional lattices, recently has been of great interest in color LUT design for simplex topologies that allow both more analytically tractable formulations and greater efficiency in the LUT. In this framework of n-simplex interpolation, our central contribution is to develop an elegant iterative algorithm that jointly optimizes the placement of nodes of the color LUT and the output values at those nodes to minimize interpolation error in an expected sense. This is in contrast to existing work, which exclusively designs either node locations or the output values. We also develop new analytical results for the problem of node location optimization, which reduces to constrained optimization of a large but sparse interpolation matrix in our framework. We evaluate our n -simplex color LUTs against the state-of-the-art lattice (e.g., International Color Consortium profiles) and simplex-based techniques for approximating two representative multidimensional color transforms that characterize a CMYK xerographic printer and an RGB scanner, respectively. The results show that color LUTs designed on simplexes offer very significant benefits over traditional lattice-based alternatives in improving color transform accuracy even with a much smaller number of nodes.

Structures in color space

NASA Astrophysics Data System (ADS)

Petrov, Alexander P.

1996-09-01

Classic colorimetry and the traditionally used color space do not represent all perceived colors (for example, browns look dark yellow in colorimetric conditions of observation) so, the specific goal of this work is to suggest another concept of color and to prove that the corresponding set of colors is complete. The idea of our approach attributing color to surface patches (not to the light) immediately ties all the problems of color perception and vision geometry. The equivalence relation in the linear space of light fluxes F established by a procedure of colorimetry gives us a 3D color space H. By definition we introduce a sample (sigma) (surface patch) as a linear mapping (sigma) : L yields H, where L is a subspace of F called the illumination space. A Dedekind structure of partial order can be defined in the set of the samples: two samples (alpha) and (Beta) belong to one chromatic class if ker(alpha) equals ker(Beta) and (alpha) > (Beta) if ker(alpha) ker(Beta) . The maximal elements of this chain create the chromatic class BLACK. There can be given geometrical arguments for L to be 3D and it can be proved that in this case the minimal element of the above Dedekind structure is unique and the corresponding chromatic class is called WHITE containing the samples (omega) such that ker(omega) equals {0} L. Color is defined as mapping C: H yields H and assuming color constancy the complete set of perceived colors is proved to be isomorphic to a subset C of 3 X 3 matrices. This subset is convex, limited and symmetrical with E/2 as the center of symmetry. The problem of metrization of the color space C is discussed and a color metric related to shape, i.e., to vision geometry, is suggested.

Development of color-grapheme synesthesia and its effect on mathematical operations.

PubMed

Mills, Carol Bergfeld; Metzger, Shari R; Foster, Catherine A; Valentine-Gresko, Melaina N; Ricketts, Stephanie

2009-01-01

SE, a 19-year-old female college student and a color-grapheme synesthete, reported consistent synesthetic experiences (photisms) for digits, and most letters in the Roman and Hebrew alphabets over a 6-month period. Photisms for later-learned Hebrew letters were influenced by those of the Roman alphabet and photisms for auditorily presented words were influenced by the spelling of the words. As hypothesized, in two studies, SE's solution times for addition problems were significantly slower when the colors of the digits in the problems mismatched her synesthetic photisms than when they matched or were in black (p < 0.001), whereas color had no effect on solution times for six female non-synesthetes (aged 19 to 22 years). Implications for learning and cognitive processing are discussed.

Color enhancement and image defogging in HSI based on Retinex model

NASA Astrophysics Data System (ADS)

Gao, Han; Wei, Ping; Ke, Jun

2015-08-01

Retinex is a luminance perceptual algorithm based on color consistency. It has a good performance in color enhancement. But in some cases, the traditional Retinex algorithms, both Single-Scale Retinex(SSR) and Multi-Scale Retinex(MSR) in RGB color space, do not work well and will cause color deviation. To solve this problem, we present improved SSR and MSR algorithms. Compared to other Retinex algorithms, we implement Retinex algorithms in HSI(Hue, Saturation, Intensity) color space, and use a parameter αto improve quality of the image. Moreover, the algorithms presented in this paper has a good performance in image defogging. Contrasted with traditional Retinex algorithms, we use intensity channel to obtain reflection information of an image. The intensity channel is processed using a Gaussian center-surround image filter to get light information, which should be removed from intensity channel. After that, we subtract the light information from intensity channel to obtain the reflection image, which only includes the attribute of the objects in image. Using the reflection image and a parameter α, which is an arbitrary scale factor set manually, we improve the intensity channel, and complete the color enhancement. Our experiments show that this approach works well compared with existing methods for color enhancement. Besides a better performance in color deviation problem and image defogging, a visible improvement in the image quality for human contrast perception is also observed.

Color-quality control using color-difference formulas: progress and problems

NASA Astrophysics Data System (ADS)

Melgosa, M.; Gómez-Robledo, L.; García, P. A.; Morillas, S.; Fernández-Maloigne, C.; Richard, N.; Huang, M.; Li, C.; Cui, G.

2017-08-01

We report on some recent advances in industrial color-difference evaluation focused in three main fields: Development of reliable experimental visual datasets; proposal of new color spaces and color-difference formulas; tools to evaluate the merits of color-difference formulas. The use of fuzzy techniques to assign consistency degrees to color pairs in combined visual datasets is described. The CIE/ISO joint proposal of the CIEDE2000 color-difference formula as a standard will facilitate the communication among companies and users. The CIE recommendation of the STRESS index to assess observers' variability and relative merits of different color-difference formulas is reported. Power functions are an efficient method to improve the performance of modern color-difference formulas. We need of advanced color-difference formulas accounting for new materials with different kind of textures and gonioapparent effects.

Computing Role Assignments of Proper Interval Graphs in Polynomial Time

NASA Astrophysics Data System (ADS)

Heggernes, Pinar; van't Hof, Pim; Paulusma, Daniël

A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-role assignment of G. Role assignments have applications in distributed computing, social network theory, and topological graph theory. The Role Assignment problem has as input a pair of graphs (G,R) and asks whether G has an R-role assignment. This problem is NP-complete already on input pairs (G,R) where R is a path on three vertices. So far, the only known non-trivial tractable case consists of input pairs (G,R) where G is a tree. We present a polynomial time algorithm that solves Role Assignment on all input pairs (G,R) where G is a proper interval graph. Thus we identify the first graph class other than trees on which the problem is tractable. As a complementary result, we show that the problem is Graph Isomorphism-hard on chordal graphs, a superclass of proper interval graphs and trees.

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

PubMed

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

2010-07-23

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

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

ERIC Educational Resources Information Center

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

2008-01-01

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

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

ERIC Educational Resources Information Center

Burns-Childers, Annie; Vidakovic, Draga

2018-01-01

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

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

DTIC Science & Technology

2008-11-17

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

3D Facial Pattern Analysis for Autism

DTIC Science & Technology

2010-07-01

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

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

PubMed

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

2003-12-01

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

Boundary implications for frequency response of interval FIR and IIR filters

NASA Technical Reports Server (NTRS)

Bose, N. K.; Kim, K. D.

1991-01-01

It is shown that vertex implication results in parameter space apply to interval trigonometric polynomials. Subsequently, it is shown that the frequency responses of both interval FIR and IIR filters are bounded by the frequency responses of certain extreme filters. The results apply directly in the evaluation of properties of designed filters, especially because it is more realistic to bound the filter coefficients from above and below instead of determining those with infinite precision because of finite arithmetic effects. Illustrative examples are provided to show how the extreme filters might be easily derived in any specific interval FIR or IIR filter design problem.

Inheritance of Kernel Color in Corn: Explanations and Investigations.

ERIC Educational Resources Information Center

Ford, Rosemary H.

2000-01-01

Offers a new perspective on traditional problems in genetics on kernel color in corn, including information about genetic regulation, metabolic pathways, and evolution of genes. (Contains 15 references.) (ASK)

A dual-channel fusion system of visual and infrared images based on color transfer

NASA Astrophysics Data System (ADS)

Pei, Chuang; Jiang, Xiao-yu; Zhang, Peng-wei; Liang, Hao-cong

2013-09-01

A dual-channel fusion system of visual and infrared images based on color transfer The increasing availability and deployment of imaging sensors operating in multiple spectrums has led to a large research effort in image fusion, resulting in a plethora of pixel-level image fusion algorithms. However, most of these algorithms have gray or false color fusion results which are not adapt to human vision. Transfer color from a day-time reference image to get natural color fusion result is an effective way to solve this problem, but the computation cost of color transfer is expensive and can't meet the request of real-time image processing. We developed a dual-channel infrared and visual images fusion system based on TMS320DM642 digital signal processing chip. The system is divided into image acquisition and registration unit, image fusion processing unit, system control unit and image fusion result out-put unit. The image registration of dual-channel images is realized by combining hardware and software methods in the system. False color image fusion algorithm in RGB color space is used to get R-G fused image, then the system chooses a reference image to transfer color to the fusion result. A color lookup table based on statistical properties of images is proposed to solve the complexity computation problem in color transfer. The mapping calculation between the standard lookup table and the improved color lookup table is simple and only once for a fixed scene. The real-time fusion and natural colorization of infrared and visual images are realized by this system. The experimental result shows that the color-transferred images have a natural color perception to human eyes, and can highlight the targets effectively with clear background details. Human observers with this system will be able to interpret the image better and faster, thereby improving situational awareness and reducing target detection time.

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

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

Szumila-Vance, Holly

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

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

PubMed

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

2015-06-01

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

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

PubMed

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

2016-07-01

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

Silicon pixel-detector R&D for CLIC

NASA Astrophysics Data System (ADS)

Nürnberg, A.

2016-11-01

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

A z-Vertex Trigger for Belle II

NASA Astrophysics Data System (ADS)

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

2015-08-01

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

Inverse Diffusion Curves Using Shape Optimization.

PubMed

Zhao, Shuang; Durand, Fredo; Zheng, Changxi

2018-07-01

The inverse diffusion curve problem focuses on automatic creation of diffusion curve images that resemble user provided color fields. This problem is challenging since the 1D curves have a nonlinear and global impact on resulting color fields via a partial differential equation (PDE). We introduce a new approach complementary to previous methods by optimizing curve geometry. In particular, we propose a novel iterative algorithm based on the theory of shape derivatives. The resulting diffusion curves are clean and well-shaped, and the final image closely approximates the input. Our method provides a user-controlled parameter to regularize curve complexity, and generalizes to handle input color fields represented in a variety of formats.

Problems with the Baade-Wesselink method

NASA Technical Reports Server (NTRS)

Bohm-Vitense, E.; Garnavich, P.; Lawler, M.; Mena-Werth, J.; Morgan, S.

1989-01-01

The discrepancy noted in radii obtained by the Baade-Wesselink method when different colors are used to determine the effective temperatures is explored. The discrepancy is found to be due to an inconsistency in the applied temperature-color calibrations. The assumption of the maximum likelihood method that beta (the effective temperature + 0.1 times the bolometric correction) is a linear function of the color is valid for the B-V and V-I colors, but not for the V-R colors. It is suggested that the errors introduced by the nonlinearity in the relation between beta and the V-R colors will produce radii which are too large. The radii derived from the V-B colors appear to be too small.

The use of color infrared aerial photography in determining salt marsh vegetation and delimiting man-made structures of Lynnhaven Bay, Virginia. M.S. Thesis

NASA Technical Reports Server (NTRS)

Holman, R. E., III

1974-01-01

Color infrared aerial photography was found to be superior to color aerial photography in an ecological study of Lynnhaven Bay, Virginia. The research was divided into three phases: (1) Determination of the feasibility of correlating color infrared aerial photography with saline wetland species composition and zonation patterns, (2) determination of the accuracy of the aerial interpretation and problems related to the aerial method used; and (3) comparison of developed with undeveloped areas along Lynnhaven Bay's shoreline. Wetland species composition and plant community zonation bands were compared with aerial infrared photography and resulted in a high degree of correlation. Problems existed with changing physical conditions; time of day, aircraft angle and sun angle, making it necessary to use several different characteristics in wetland species identification. The main characteristics used were known zonation patterns, textural signatures and color tones. Lynnhaven Bay's shoreline was 61.5 percent developed.

Visual function and color vision in adults with Attention-Deficit/Hyperactivity Disorder.

PubMed

Kim, Soyeon; Chen, Samantha; Tannock, Rosemary

2014-01-01

Color vision and self-reported visual function in everyday life in young adults with Attention-Deficit/Hyperactivity Disorder (ADHD) were investigated. Participants were 30 young adults with ADHD and 30 controls matched for age and gender. They were tested individually and completed the Visual Activities Questionnaire (VAQ), Farnsworth-Munsell 100 Hue Test (FMT) and A Quick Test of Cognitive Speed (AQT). The ADHD group reported significantly more problems in 4 of 8 areas on the VAQ: depth perception, peripheral vision, visual search and visual processing speed. Further analyses of VAQ items revealed that the ADHD group endorsed more visual problems associated with driving than controls. Color perception difficulties on the FMT were restricted to the blue spectrum in the ADHD group. FMT and AQT results revealed slower processing of visual stimuli in the ADHD group. A comprehensive investigation of mechanisms underlying visual function and color vision in adults with ADHD is warranted, along with the potential impact of these visual problems on driving performance. Copyright © 2013 Spanish General Council of Optometry. Published by Elsevier Espana. All rights reserved.

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

Distance Domination Number of Graphs Resulting from Edge Comb Product

NASA Astrophysics Data System (ADS)

Slamin; Dafik; Angger Waspodo, Gembong

2018-05-01

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

The SLD VXD3 detector and its initial performance

NASA Astrophysics Data System (ADS)

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

1997-02-01

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

Vertex detectors: The state of the art and future prospects

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

Damerell, C.J.S.

1997-01-01

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

A distributed-memory approximation algorithm for maximum weight perfect bipartite matching

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

Azad, Ariful; Buluc, Aydin; Li, Xiaoye S.

We design and implement an efficient parallel approximation algorithm for the problem of maximum weight perfect matching in bipartite graphs, i.e. the problem of finding a set of non-adjacent edges that covers all vertices and has maximum weight. This problem differs from the maximum weight matching problem, for which scalable approximation algorithms are known. It is primarily motivated by finding good pivots in scalable sparse direct solvers before factorization where sequential implementations of maximum weight perfect matching algorithms, such as those available in MC64, are widely used due to the lack of scalable alternatives. To overcome this limitation, we proposemore » a fully parallel distributed memory algorithm that first generates a perfect matching and then searches for weightaugmenting cycles of length four in parallel and iteratively augments the matching with a vertex disjoint set of such cycles. For most practical problems the weights of the perfect matchings generated by our algorithm are very close to the optimum. An efficient implementation of the algorithm scales up to 256 nodes (17,408 cores) on a Cray XC40 supercomputer and can solve instances that are too large to be handled by a single node using the sequential algorithm.« less

Why Do Marbles Become Paler on Grinding? Reflectance, Spectroscopy, Color, and Particle Size

ERIC Educational Resources Information Center

Lagorio, Maria Gabriela

2004-01-01

A qualitative description of the color-change problem, which will assist in rationalizing the change in color of marbles after grinding them using a simple physical picture and the qualitative dependence of diffuse reflectance on particle size is presented. Different approaches are discussed but it is seen that the interpretation of nanoparticles…

The Multiple Futures of Racism--Beyond Color and Culture, toward a New Paradigm for Resolution in the Third Millennium.

ERIC Educational Resources Information Center

Rosado, Caleb

The paper asserts that racism is still one of the most pervasive social evils in the world. Part of the problem is that attempts to eliminate racism have focused on surface differences of race, color, and biological supremacy. Such attempts do not get to the root of the problem, the deep-level value and belief systems that undergird racism. This…

Edge union of networks on the same vertex set

NASA Astrophysics Data System (ADS)

Loe, Chuan Wen; Jeldtoft Jensen, Henrik

2013-06-01

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

Evidence of ghost suppression in gluon mass scale dynamics

NASA Astrophysics Data System (ADS)

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

2018-03-01

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

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

NASA Astrophysics Data System (ADS)

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

2018-06-01

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

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

Fuzzy-based simulation of real color blindness.

PubMed

Lee, Jinmi; dos Santos, Wellington P

2010-01-01

About 8% of men are affected by color blindness. That population is at a disadvantage since they cannot perceive a substantial amount of the visual information. This work presents two computational tools developed to assist color blind people. The first one tests color blindness and assess its severity. The second tool is based on Fuzzy Logic, and implements a method proposed to simulate real red and green color blindness in order to generate synthetic cases of color vision disturbance in a statistically significant amount. Our purpose is to develop correction tools and obtain a deeper understanding of the accessibility problems faced by people with chromatic visual impairment.

Theoretical princi les of constructing the equations of motion for a spin color-charged particle in gauge and fermion fields

NASA Astrophysics Data System (ADS)

Markov, Yu. A.; Shishmarev, A. A.

2010-11-01

Based on the most general principles of materiality, gauge, and re-parameterized invariance, the problem of constructing an action describing the dynamics of a classical color-charged particle moving in external non-Abelian gauge and fermion fields is considered. The case of a linear Lagrangian dependence on the external fermion fields is discussed. Within the framework of the description of the color degree of freedom of the particle with half-integer spin by the Grassmann color charges, a new concept of the Grassmann color source of the particle being a fermion analog of the conventional color current is introduced.

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

NASA Astrophysics Data System (ADS)

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

2011-07-01

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

Amprenavir, new protease inhibitor, approved.

PubMed

James, J S

1999-05-07

A new protease inhibitor, amprenavir (Agenerase), has received FDA marketing approval. The approval was based on two 24-week controlled trials and safety data in more than 1,400 patients under FDA accelerated-approval rules. Amprenavir is approved for patients 4 years of age and older. The drug is taken twice daily, with or without food. Side effects include gastrointestinal disturbances, rashes, and oral paresthesia. Severe or life-threatening rashes have occurred in 1 percent of all patients. Pregnant women should not use the drug unless necessary. The drug was developed by Vertex Pharmaceuticals Inc. and is being marketed by Glaxo Wellcome. Some studies suggest that amprenavir is less likely than other protease inhibitors to be associated with lipid metabolism problems. It may have a resistance profile different from that of other protease inhibitors, and therefore may cause different cross resistance problems. Amprenavir appears to be synergistic with abacavir (Ziagen) in laboratory tests.

A system for routing arbitrary directed graphs on SIMD architectures

NASA Technical Reports Server (NTRS)

Tomboulian, Sherryl

1987-01-01

There are many problems which can be described in terms of directed graphs that contain a large number of vertices where simple computations occur using data from connecting vertices. A method is given for parallelizing such problems on an SIMD machine model that is bit-serial and uses only nearest neighbor connections for communication. Each vertex of the graph will be assigned to a processor in the machine. Algorithms are given that will be used to implement movement of data along the arcs of the graph. This architecture and algorithms define a system that is relatively simple to build and can do graph processing. All arcs can be transversed in parallel in time O(T), where T is empirically proportional to the diameter of the interconnection network times the average degree of the graph. Modifying or adding a new arc takes the same time as parallel traversal.

Isomorphism of dimer configurations and spanning trees on finite square lattices

NASA Astrophysics Data System (ADS)

Brankov, J. G.

1995-09-01

One-to-one mappings of the close-packed dimer configurations on a finite square lattice with free boundaries L onto the spanning trees of a related graph (or two-graph) G are found. The graph (two-graph) G can be constructed from L by: (1) deleting all the vertices of L with arbitrarily fixed parity of the row and column numbers; (2) suppressing all the vertices of degree 2 except those of degree 2 in L; (3) merging all the vertices of degree 1 into a single vertex g. The matrix Kirchhoff theorem reduces the enumeration problem for the spanning trees on G to the eigenvalue problem for the discrete Laplacian on the square lattice L'=G g with mixed Dirichlet-Neumann boundary conditions in at least one direction. That fact explains some of the unusual finite-size properties of the dimer model.

Typical performance of approximation algorithms for NP-hard problems

NASA Astrophysics Data System (ADS)

Takabe, Satoshi; Hukushima, Koji

2016-11-01

Typical performance of approximation algorithms is studied for randomized minimum vertex cover problems. A wide class of random graph ensembles characterized by an arbitrary degree distribution is discussed with the presentation of a theoretical framework. Herein, three approximation algorithms are examined: linear-programming relaxation, loopy-belief propagation, and the leaf-removal algorithm. The former two algorithms are analyzed using a statistical-mechanical technique, whereas the average-case analysis of the last one is conducted using the generating function method. These algorithms have a threshold in the typical performance with increasing average degree of the random graph, below which they find true optimal solutions with high probability. Our study reveals that there exist only three cases, determined by the order of the typical performance thresholds. In addition, we provide some conditions for classification of the graph ensembles and demonstrate explicitly some examples for the difference in thresholds.

Modification of Prim’s algorithm on complete broadcasting graph

NASA Astrophysics Data System (ADS)

Dairina; Arif, Salmawaty; Munzir, Said; Halfiani, Vera; Ramli, Marwan

2017-09-01

Broadcasting is an information dissemination from one object to another object through communication between two objects in a network. Broadcasting for n objects can be solved by n - 1 communications and minimum time unit defined by ⌈2log n⌉ In this paper, weighted graph broadcasting is considered. The minimum weight of a complete broadcasting graph will be determined. Broadcasting graph is said to be complete if every vertex is connected. Thus to determine the minimum weight of complete broadcasting graph is equivalent to determine the minimum spanning tree of a complete graph. The Kruskal’s and Prim’s algorithm will be used to determine the minimum weight of a complete broadcasting graph regardless the minimum time unit ⌈2log n⌉ and modified Prim’s algorithm for the problems of the minimum time unit ⌈2log n⌉ is done. As an example case, here, the training of trainer problem is solved using these algorithms.

Measurement of charm meson production in Au+Au collisions at √S NN =200 GEV

NASA Astrophysics Data System (ADS)

Quintero, Amilkar

The study and characterization of nuclear matter under extreme conditions of temperature and pressure, and a full understanding of deconfined partonic matter, the Quark Gluon Plasma (QGP), are major goals of modern high-energy nuclear physics. Heavy quarks (charm and bottom) are formed mainly in the early stages of the collision. Open heavy flavor measurements, e.g. D0, D+/-, DS, are excellent tools to probe and study the hot and dense medium formed in heavy ion collisions. Details of their interaction with the surrounding medium can be studied through energy loss and elliptic flow measurements thus providing valuable information about the nature of the medium and its degree of thermalization. Initial indirect reconstruction studies of heavy quark particles using the electrons from heavy flavor decays, showed a large magnitude of energy loss that was inconsistent with model predictions and assumptions, at the time. Precise measurements of fully reconstructed heavy mesons would provide better understanding of the energy loss mechanisms and the properties of the formed medium. In relativistic heavy ion collisions, the relatively low abundance of heavy quarks and their short lifetimes makes them difficult to distinguish from the event vertex and the combinatorial background; therefore the need for a high precision vertex detector to reconstruct their decay particles. In 2014 a new micro vertex detector was installed in the STAR experiment at Brookhaven National Lab. The Heavy Flavor Tracker (HFT) was designed to perform direct topological reconstruction of the weak decays of heavy flavor particles. The HFT improves STAR track pointing resolution from a few millimeters to ˜30 microns for 1 GeV/c pions, allowing direct reconstruction of short lifetime particles. Although the results of the open charm meson reconstruction using the HFT improved dramatically there is still a lot of room for optimization, especially for reconstructed particles with low transverse momentum (< 1 GeV/c). The standard reconstruction algorithm in the STAR experiment is based on a helix swimming of the reconstructed tracks. This method consists of finding the distance of closest approach between the two helices and defining the midpoint as the decay particle's vertex position. In this work we are using an algorithm based on the Kalman filter to perform full vertex reconstruction. Although the Kalman filter is the most common fitting and filtering method used in tracking, it is not commonly used for particle reconstruction. By using the Kalman filter, the full error matrix for each track is taken into account in the calculations, performing a more complete approach to vertex reconstruction of the charm mesons by providing error estimates on all reconstructed quantities. Also in the traditional analyses, rectangular cuts are made to the reconstructed parameters of the candidate particle decay in order to improve the signal to background ratio and get the cleanest signal possible. In this analysis we use multivariate techniques (i.e. machine learning) to maximize the efficiency of the acquired signal. Machine learning techniques are widely used in many data analysis problems and are also in wide use in high-energy physics experiments. Different optimization methods are tested like Likelihood, Neural Networks. The one with the better performance for reconstruction of D0 mesons was found to be the Binary Decision Trees (BDT). We have applied these analysis techniques on our Run-14 data sample (~1.2 billion Au+Au events at 200 GeV) and we present results for D0 meson pT spectra and nuclear modification factor (RAA) for different event centralities. We discuss the obtained results and compare with current theory models.

Guided color consistency optimization for image mosaicking

NASA Astrophysics Data System (ADS)

Xie, Renping; Xia, Menghan; Yao, Jian; Li, Li

2018-01-01

This paper studies the problem of color consistency correction for sequential images with diverse color characteristics. Existing algorithms try to adjust all images to minimize color differences among images under a unified energy framework, however, the results are prone to presenting a consistent but unnatural appearance when the color difference between images is large and diverse. In our approach, this problem is addressed effectively by providing a guided initial solution for the global consistency optimization, which avoids converging to a meaningless integrated solution. First of all, to obtain the reliable intensity correspondences in overlapping regions between image pairs, we creatively propose the histogram extreme point matching algorithm which is robust to image geometrical misalignment to some extents. In the absence of the extra reference information, the guided initial solution is learned from the major tone of the original images by searching some image subset as the reference, whose color characteristics will be transferred to the others via the paths of graph analysis. Thus, the final results via global adjustment will take on a consistent color similar to the appearance of the reference image subset. Several groups of convincing experiments on both the synthetic dataset and the challenging real ones sufficiently demonstrate that the proposed approach can achieve as good or even better results compared with the state-of-the-art approaches.

Distance preservation in color image transforms

NASA Astrophysics Data System (ADS)

Santini, Simone

1999-12-01

Most current image processing systems work on color images, and color is a precious perceptual clue for determining image similarity. Working with color images, however, is not the sam thing as working with images taking values in a 3D Euclidean space. Not only are color spaces bounded, but the characteristics of the observer endow the space with a 'perceptual' metric that in general does not correspond to the metric naturally inherited from R3. This paper studies the problem of filtering color images abstractly. It begins by determining the properties of the color sum and color product operations such that he desirable properties of orthonormal bases will be preserved. The paper then defines a general scheme, based on the action of the additive group on the color space, by which operations that satisfy the required properties can be defined.

Symmetry preserving truncations of the gap and Bethe-Salpeter equations

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

Binosi, Daniele; Chang, Lei; Papavassiliou, Joannis

2016-05-01

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

Spin Ice

NASA Astrophysics Data System (ADS)

Bramwell, Steven T.; Gingras, Michel J. P.; Holdsworth, Peter C. W.

2013-03-01

Pauling's model of hydrogen disorder in water ice represents the prototype of a frustrated system. Over the years it has spawned several analogous models, including Anderson's model antiferromagnet and the statistical "vertex" models. Spin Ice is a sixteen vertex model of "ferromagnetic frustration" that is approximated by real materials, most notably the rare earth pyrochlores Ho2Ti2O7, Dy2Ti2O7 and Ho2Sn2O7. These "spin ice materials" have the Pauling zero point entropy and in all respects represent almost ideal realisations of Pauling's model. They provide experimentalists with unprecedented access to a wide variety of novel magnetic states and phase transitions that are located in different regions of the field-temperature phase diagram. They afford theoreticians the opportunity to explore many new features of the magnetic interactions and statistical mechanics of frustrated systems. This chapter is a comprehensive review of the physics -- both experimental and theoretical -- of spin ice. It starts with a discussion of the historic problem of water ice and its relation to spin ice and other frustrated magnets. The properties of spin ice are then discussed in three sections that deal with the zero field spin ice state, the numerous field-induced states (including the recently identified "kagomé ice") and the magnetic dynamics. Some materials related to spin ice are briefly described and the chapter is concluded with a short summary of spin ice physics.

Overlapping clusters for distributed computation.

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

Mirrokni, Vahab; Andersen, Reid; Gleich, David F.

2010-11-01

Scalable, distributed algorithms must address communication problems. We investigate overlapping clusters, or vertex partitions that intersect, for graph computations. This setup stores more of the graph than required but then affords the ease of implementation of vertex partitioned algorithms. Our hope is that this technique allows us to reduce communication in a computation on a distributed graph. The motivation above draws on recent work in communication avoiding algorithms. Mohiyuddin et al. (SC09) design a matrix-powers kernel that gives rise to an overlapping partition. Fritzsche et al. (CSC2009) develop an overlapping clustering for a Schwarz method. Both techniques extend an initialmore » partitioning with overlap. Our procedure generates overlap directly. Indeed, Schwarz methods are commonly used to capitalize on overlap. Elsewhere, overlapping communities (Ahn et al, Nature 2009; Mishra et al. WAW2007) are now a popular model of structure in social networks. These have long been studied in statistics (Cole and Wishart, CompJ 1970). We present two types of results: (i) an estimated swapping probability {rho}{infinity}; and (ii) the communication volume of a parallel PageRank solution (link-following {alpha} = 0.85) using an additive Schwarz method. The volume ratio is the amount of extra storage for the overlap (2 means we store the graph twice). Below, as the ratio increases, the swapping probability and PageRank communication volume decreases.« less

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.

Mean-field theory of baryonic matter for QCD in the large Nc and heavy quark mass limits

NASA Astrophysics Data System (ADS)

Adhikari, Prabal; Cohen, Thomas D.

2013-11-01

We discuss theoretical issues pertaining to baryonic matter in the combined heavy-quark and large Nc limits of QCD. Witten's classic argument that baryons and interacting systems of baryons can be described in a mean-field approximation with each of the quarks moving in an average potential due to the remaining quarks is heuristic. It is important to justify this heuristic description for the case of baryonic matter since systems of interacting baryons are intrinsically more complicated than single baryons due to the possibility of hidden color states—states in which the subsystems making up the entire baryon crystal are not color-singlet nucleons but rather colorful states coupled together to make a color-singlet state. In this work, we provide a formal justification of this heuristic prescription. In order to do this, we start by taking the heavy quark limit, thus effectively reducing the problem to a many-body quantum mechanical system. This problem can be formulated in terms of integrals over coherent states, which for this problem are simple Slater determinants. We show that for the many-body problem, the support region for these integrals becomes narrow at large Nc, yielding an energy which is well approximated by a single coherent state—that is a mean-field description. Corrections to the energy are of relative order 1/Nc. While hidden color states are present in the exact state of the heavy quark system, they only influence the interaction energy below leading order in 1/Nc.

Color preservation for tone reproduction and image enhancement

NASA Astrophysics Data System (ADS)

Hsin, Chengho; Lee, Zong Wei; Lee, Zheng Zhan; Shin, Shaw-Jyh

2014-01-01

Applications based on luminance processing often face the problem of recovering the original chrominance in the output color image. A common approach to reconstruct a color image from the luminance output is by preserving the original hue and saturation. However, this approach often produces a highly colorful image which is undesirable. We develop a color preservation method that not only retains the ratios of the input tri-chromatic values but also adjusts the output chroma in an appropriate way. Linearizing the output luminance is the key idea to realize this method. In addition, a lightness difference metric together with a colorfulness difference metric are proposed to evaluate the performance of the color preservation methods. It shows that the proposed method performs consistently better than the existing approaches.

Retaining Teachers of Color: A Pressing Problem and a Potential Strategy for "Hard-to-Staff" Schools

ERIC Educational Resources Information Center

Achinstein, Betty; Ogawa, Rodney T.; Sexton, Dena; Freitas, Casia

2010-01-01

Given calls to diversify the teaching workforce, this review examines research on retention and turnover of teachers of color, focusing on new teachers because they leave at disproportionately high rates. Reviewing 70 studies, the authors found that (a) recent national studies identify turnover rates for teachers of color are now higher than those…

Improving Learning Results and Reducing Cognitive Load through 3D Courseware on Color Management and Inspection Instruction

ERIC Educational Resources Information Center

Hsiung, Liang-Yuan; Lai, Mu-Hui

2013-01-01

This study intends to solve the problem that schools in Taiwan lack of the equipment for color management and inspection instruction and seek ways to improve learning results and reduce cognitive load. The researchers developed 3D courseware for color management and inspection through a research and development process. To further scrutinize the…

Image enhancement and quality measures for dietary assessment using mobile devices

NASA Astrophysics Data System (ADS)

Xu, Chang; Zhu, Fengqing; Khanna, Nitin; Boushey, Carol J.; Delp, Edward J.

2012-03-01

Measuring accurate dietary intake is considered to be an open research problem in the nutrition and health fields. We are developing a system, known as the mobile device food record (mdFR), to automatically identify and quantify foods and beverages consumed based on analyzing meal images captured with a mobile device. The mdFR makes use of a fiducial marker and other contextual information to calibrate the imaging system so that accurate amounts of food can be estimated from the scene. Food identification is a difficult problem since foods can dramatically vary in appearance. Such variations may arise not only from non-rigid deformations and intra-class variability in shape, texture, color and other visual properties, but also from changes in illumination and viewpoint. To address the color consistency problem, this paper describes illumination quality assessment methods implemented on a mobile device and three post color correction methods.

Image Enhancement and Quality Measures for Dietary Assessment Using Mobile Devices

PubMed Central

Xu, Chang; Zhu, Fengqing; Khanna, Nitin; Boushey, Carol J.; Delp, Edward J.

2016-01-01

Measuring accurate dietary intake is considered to be an open research problem in the nutrition and health fields. We are developing a system, known as the mobile device food record (mdFR), to automatically identify and quantify foods and beverages consumed based on analyzing meal images captured with a mobile device. The mdFR makes use of a fiducial marker and other contextual information to calibrate the imaging system so that accurate amounts of food can be estimated from the scene. Food identification is a difficult problem since foods can dramatically vary in appearance. Such variations may arise not only from non-rigid deformations and intra-class variability in shape, texture, color and other visual properties, but also from changes in illumination and viewpoint. To address the color consistency problem, this paper describes illumination quality assessment methods implemented on a mobile device and three post color correction methods. PMID:28572695

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.

Influence of tensor interactions on masses and decay widths of dibaryons

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

Pang Hourong; Ping Jialun; Chen Lingzhi

The influence of gluon and Goldstone boson induced tensor interactions on the dibaryon masses and D-wave decay widths has been studied in the quark delocalization, color screening model. The effective S-D wave transition interactions induced by gluon and Goldstone boson exchanges decrease rapidly with increasing strangeness of the channel. The tensor contribution of K and {eta} mesons is negligible in this model. There is no six-quark state in the light flavor world studied so far that can become bound by means of these tensor interactions besides the deuteron. The partial D-wave decay widths of the IJ{sup p}=(1/2)2{sup +}N{omega} state tomore » spin 0 and 1 {lambda}{xi} final states are 12.0 and 21.9 keV, respectively. This is a very narrow dibaryon resonance that might be detectable in those production reactions with rich high strangeness particles through the reconstruction of the vertex mass of the decay product {lambda}{xi} by existing detectors at RHIC and COMPASS at CERN or at JHF in Japan and FAIR in Germany in the future.« less

Improving the image discontinuous problem by using color temperature mapping method

NASA Astrophysics Data System (ADS)

Jeng, Wei-De; Mang, Ou-Yang; Lai, Chien-Cheng; Wu, Hsien-Ming

2011-09-01

This article mainly focuses on image processing of radial imaging capsule endoscope (RICE). First, it used the radial imaging capsule endoscope (RICE) to take the images, the experimental used a piggy to get the intestines and captured the images, but the images captured by RICE were blurred due to the RICE has aberration problems in the image center and lower light uniformity affect the image quality. To solve the problems, image processing can use to improve it. Therefore, the images captured by different time can use Person correlation coefficient algorithm to connect all the images, and using the color temperature mapping way to improve the discontinuous problem in the connection region.

Visual thinking networking promotes long-term meaningful learning and achievement for 9th grade earth science students

NASA Astrophysics Data System (ADS)

Longo, Palma Joni

2001-12-01

An experimental and interview-based design was used to test the efficacy of visual thinking networking (VTN), a new generation of metacognitive learning strategies. Students constructed network diagrams using semantic and figural elements to represent knowledge relationships. The findings indicated the importance of using color in VTN strategies. The use of color promoted the encoding and reconstruction of earth science knowledge in memory and enhanced higher order thinking skills of problem solving. Fifty-six ninth grade earth science students (13--15 years of age) in a suburban school district outside New York City were randomly assigned to three classes with the same instructor. Five major positive findings emerged in the areas of problem solving achievement, organization of knowledge in memory, problem solving strategy dimensionality, conceptual understanding, and gender differences. A multi-covariate analysis was conducted on the pre-post gain scores of the AGI/NSTA Earth Science Examination (Part 1). Students who used the color VTN strategies had a significantly higher mean gain score on the problem solving criterion test items than students who used the black/white VTN (p = .003) and the writing strategies for learning science (p < .001). During a think-out-loud problem solving interview, students who used the color VTN strategies: (1) significantly recalled more earth science knowledge than students who used the black/white VTN (p = .021) and the writing strategies (p < .001); (2) significantly recalled more interrelated earth science knowledge than students who used black/white VTN strategies (p = .048) and the writing strategy (p < .001); (3) significantly used a greater number of action verbs than students who used the writing strategy (p = .033). Students with low abstract reasoning aptitude who used the color VTNs had a significantly higher mean number of conceptually accurate propositions than students who used the black/white VTN (p = .018) and the writing strategies (p = .010). Gender influenced the choice of VTN strategy. Females used significantly more color VTN strategies, while males used predominately black/white VTN strategies (p = .01). A neurocognitive model, the encoding activation theory of the anterior cingulate (ENACT-AC), is proposed as an explanation for these findings.

Two plus blue equals green: Grapheme-color synesthesia allows cognitive access to numerical information via color

PubMed Central

McCarthy, J. Daniel; Barnes, Lianne N.; Alvarez, Bryan D.; Caplovitz, Gideon Paul

2013-01-01

In grapheme-color synesthesia, graphemes (e.g., numbers or letters) evoke color experiences. It is generally reported that the opposite is not true: colors will not generate experiences of graphemes or their associated information. However, recent research has provided evidence that colors can implicitly elicit symbolic representations of associated graphemes. Here, we examine if these representations can be cognitively accessed. Using a mathematical verification task replacing graphemes with color patches, we find that synesthetes can verify such problems with colors as accurately as with graphemes. Doing so, however, takes time: ~250ms per color. Moreover, we find minimal reaction time switch-costs for switching between computing with graphemes and colors. This demonstrates that given specific task demands, synesthetes can cognitively access numerical information elicited by physical colors, and they do so as accurately as with graphemes. We discuss these results in the context of possible cognitive strategies used to access the information. PMID:24100131

Tongue Disorders

MedlinePlus

... of many muscles. The upper surface contains your taste buds. Problems with the tongue include Pain Swelling Changes in color or texture Abnormal movement or difficulty moving the tongue Taste problems These problems can have many different causes. ...

Solving Constraint-Satisfaction Problems with Distributed Neocortical-Like Neuronal Networks.

PubMed

Rutishauser, Ueli; Slotine, Jean-Jacques; Douglas, Rodney J

2018-05-01

Finding actions that satisfy the constraints imposed by both external inputs and internal representations is central to decision making. We demonstrate that some important classes of constraint satisfaction problems (CSPs) can be solved by networks composed of homogeneous cooperative-competitive modules that have connectivity similar to motifs observed in the superficial layers of neocortex. The winner-take-all modules are sparsely coupled by programming neurons that embed the constraints onto the otherwise homogeneous modular computational substrate. We show rules that embed any instance of the CSP's planar four-color graph coloring, maximum independent set, and sudoku on this substrate and provide mathematical proofs that guarantee these graph coloring problems will convergence to a solution. The network is composed of nonsaturating linear threshold neurons. Their lack of right saturation allows the overall network to explore the problem space driven through the unstable dynamics generated by recurrent excitation. The direction of exploration is steered by the constraint neurons. While many problems can be solved using only linear inhibitory constraints, network performance on hard problems benefits significantly when these negative constraints are implemented by nonlinear multiplicative inhibition. Overall, our results demonstrate the importance of instability rather than stability in network computation and offer insight into the computational role of dual inhibitory mechanisms in neural circuits.

Serial-to-parallel color-TV converter

NASA Technical Reports Server (NTRS)

Doak, T. W.; Merwin, R. B.; Zuckswert, S. E.; Sepper, W.

1976-01-01

Solid analog-to-digital converter eliminates flicker and problems with time base stability and gain variation in sequential color TV cameras. Device includes 3-bit delta modulator; two-field memory; timing, switching, and sync network; and three 3-bit delta demodulators

Tanning Products

MedlinePlus

... the FDA. Some tanning pills contain the color additive canthaxanthin. When large amounts of canthaxanthin are ingested, it can turn the skin a range of colors from orange to brown. It can also cause serious health problems including liver damage; hives; and an eye ...

Color transfer method preserving perceived lightness

NASA Astrophysics Data System (ADS)

Ueda, Chiaki; Azetsu, Tadahiro; Suetake, Noriaki; Uchino, Eiji

2016-06-01

Color transfer originally proposed by Reinhard et al. is a method to change the color appearance of an input image by using the color information of a reference image. The purpose of this study is to modify color transfer so that it works well even when the scenes of the input and reference images are not similar. Concretely, a color transfer method with lightness correction and color gamut adjustment is proposed. The lightness correction is applied to preserve the perceived lightness which is explained by the Helmholtz-Kohlrausch (H-K) effect. This effect is the phenomenon that vivid colors are perceived as brighter than dull colors with the same lightness. Hence, when the chroma is changed by image processing, the perceived lightness is also changed even if the physical lightness is preserved after the image processing. In the proposed method, by considering the H-K effect, color transfer that preserves the perceived lightness after processing is realized. Furthermore, color gamut adjustment is introduced to address the color gamut problem, which is caused by color space conversion. The effectiveness of the proposed method is verified by performing some experiments.

[Establishment of the background color to make discrimination of domestic ethical tablets sharper and more feasible based on the analysis of their color distribution].

PubMed

Ishizaki, Makiko; Maeda, Hatsuo; Okamoto, Ikuko

2012-01-01

In Japan, pharmacists as well as patients often have problems distinguishing one ethical tablet from another because they can be very similar in color. In an attempt to solve this problem, we hypothesized using a background sheet of dark gray identified by N3.5 on the Munsell color system (Munsell CS). The colors of 369 and 656 ethical tablets in Japan and the USA, respectively, were measured. On the Munsell CS, the Japanese tablets were localized mostly in the range of hues between 10R∼10Y with values ≧ 8 and chroma ≦ 4, while the colors of the American tablets were scattered over the hue spectrum with a variety of values and chroma. Based on these findings, we examined the effects of background colors on discrimination between 5 tablets classified into yellow, yellow red, red, or mixed groups that represented typical domestic Japanese tablets. Background colors of light, medium, and dark gray, purple, blue, and blue green were selected based on a general concept on color discrimination. The influence of white 10 mm-ruled squares on background sheets was examined as well. Under JIS Z8723 conditions, 42 volunteers used a 4-point scale to evaluate how clearly they could discriminate between each set of tablets on each of the background sheets. Variance analysis of the obtained data with SPSS demonstrated that with healthy vision, use of a dark gray background sheet with or without ruled squares enabled the sharpest and most feasible discrimination between all sets of tablets. A similar test with dark gray and white clearly demonstrated that the former works as a practical background color for discrimination among different domestic Japanese tablets.

Complex network problems in physics, computer science and biology

NASA Astrophysics Data System (ADS)

Cojocaru, Radu Ionut

There is a close relation between physics and mathematics and the exchange of ideas between these two sciences are well established. However until few years ago there was no such a close relation between physics and computer science. Even more, only recently biologists started to use methods and tools from statistical physics in order to study the behavior of complex system. In this thesis we concentrate on applying and analyzing several methods borrowed from computer science to biology and also we use methods from statistical physics in solving hard problems from computer science. In recent years physicists have been interested in studying the behavior of complex networks. Physics is an experimental science in which theoretical predictions are compared to experiments. In this definition, the term prediction plays a very important role: although the system is complex, it is still possible to get predictions for its behavior, but these predictions are of a probabilistic nature. Spin glasses, lattice gases or the Potts model are a few examples of complex systems in physics. Spin glasses and many frustrated antiferromagnets map exactly to computer science problems in the NP-hard class defined in Chapter 1. In Chapter 1 we discuss a common result from artificial intelligence (AI) which shows that there are some problems which are NP-complete, with the implication that these problems are difficult to solve. We introduce a few well known hard problems from computer science (Satisfiability, Coloring, Vertex Cover together with Maximum Independent Set and Number Partitioning) and then discuss their mapping to problems from physics. In Chapter 2 we provide a short review of combinatorial optimization algorithms and their applications to ground state problems in disordered systems. We discuss the cavity method initially developed for studying the Sherrington-Kirkpatrick model of spin glasses. We extend this model to the study of a specific case of spin glass on the Bethe lattice at zero temperature and then we apply this formalism to the K-SAT problem defined in Chapter 1. The phase transition which physicists study often corresponds to a change in the computational complexity of the corresponding computer science problem. Chapter 3 presents phase transitions which are specific to the problems discussed in Chapter 1 and also known results for the K-SAT problem. We discuss the replica method and experimental evidences of replica symmetry breaking. The physics approach to hard problems is based on replica methods which are difficult to understand. In Chapter 4 we develop novel methods for studying hard problems using methods similar to the message passing techniques that were discussed in Chapter 2. Although we concentrated on the symmetric case, cavity methods show promise for generalizing our methods to the un-symmetric case. As has been highlighted by John Hopfield, several key features of biological systems are not shared by physical systems. Although living entities follow the laws of physics and chemistry, the fact that organisms adapt and reproduce introduces an essential ingredient that is missing in the physical sciences. In order to extract information from networks many algorithm have been developed. In Chapter 5 we apply polynomial algorithms like minimum spanning tree in order to study and construct gene regulatory networks from experimental data. As future work we propose the use of algorithms like min-cut/max-flow and Dijkstra for understanding key properties of these networks.

Depth-color fusion strategy for 3-D scene modeling with Kinect.

PubMed

Camplani, Massimo; Mantecon, Tomas; Salgado, Luis

2013-12-01

Low-cost depth cameras, such as Microsoft Kinect, have completely changed the world of human-computer interaction through controller-free gaming applications. Depth data provided by the Kinect sensor presents several noise-related problems that have to be tackled to improve the accuracy of the depth data, thus obtaining more reliable game control platforms and broadening its applicability. In this paper, we present a depth-color fusion strategy for 3-D modeling of indoor scenes with Kinect. Accurate depth and color models of the background elements are iteratively built, and used to detect moving objects in the scene. Kinect depth data is processed with an innovative adaptive joint-bilateral filter that efficiently combines depth and color by analyzing an edge-uncertainty map and the detected foreground regions. Results show that the proposed approach efficiently tackles main Kinect data problems: distance-dependent depth maps, spatial noise, and temporal random fluctuations are dramatically reduced; objects depth boundaries are refined, and nonmeasured depth pixels are interpolated. Moreover, a robust depth and color background model and accurate moving objects silhouette are generated.

Color-Blindness vs. Race Matters: Pre-School Education and the Need for a Communal Vision

ERIC Educational Resources Information Center

Hein, Christina Judith

2004-01-01

The author discerns two trends ruling with many of the teachers, intellectuals, and citizens of the United States. One is the color-blind-myth that Williams (1997) cites in her essay, "The Emperor's New Clothes": "I don't think about color, therefore your problems don't exist," is the phrase that she attributes to this "school of idealism". The…

Least Squares Approach to the Alignment of the Generic High Precision Tracking System

NASA Astrophysics Data System (ADS)

de Renstrom, Pawel Brückman; Haywood, Stephen

2006-04-01

A least squares method to solve a generic alignment problem of a high granularity tracking system is presented. The algorithm is based on an analytical linear expansion and allows for multiple nested fits, e.g. imposing a common vertex for groups of particle tracks is of particular interest. We present a consistent and complete recipe to impose constraints on either implicit or explicit parameters. The method has been applied to the full simulation of a subset of the ATLAS silicon tracking system. The ultimate goal is to determine ≈35,000 degrees of freedom (DoF's). We present a limited scale exercise exploring various aspects of the solution.

Diagrammatic routes to nonlocal correlations beyond dynamical mean field theory

NASA Astrophysics Data System (ADS)

Rohringer, G.; Hafermann, H.; Toschi, A.; Katanin, A. A.; Antipov, A. E.; Katsnelson, M. I.; Lichtenstein, A. I.; Rubtsov, A. N.; Held, K.

2018-04-01

Strong electronic correlations pose one of the biggest challenges to solid state theory. Recently developed methods that address this problem by starting with the local, eminently important correlations of dynamical mean field theory (DMFT) are reviewed. In addition, nonlocal correlations on all length scales are generated through Feynman diagrams, with a local two-particle vertex instead of the bare Coulomb interaction as a building block. With these diagrammatic extensions of DMFT long-range charge, magnetic, and superconducting fluctuations as well as (quantum) criticality can be addressed in strongly correlated electron systems. An overview is provided of the successes and results achieved, mainly for model Hamiltonians, and an outline is given of future prospects for realistic material calculations.

Glnemo2: Interactive Visualization 3D Program

NASA Astrophysics Data System (ADS)

Lambert, Jean-Charles

2011-10-01

Glnemo2 is an interactive 3D visualization program developed in C++ using the OpenGL library and Nokia QT 4.X API. It displays in 3D the particles positions of the different components of an nbody snapshot. It quickly gives a lot of information about the data (shape, density area, formation of structures such as spirals, bars, or peanuts). It allows for in/out zooms, rotations, changes of scale, translations, selection of different groups of particles and plots in different blending colors. It can color particles according to their density or temperature, play with the density threshold, trace orbits, display different time steps, take automatic screenshots to make movies, select particles using the mouse, and fly over a simulation using a given camera path. All these features are accessible from a very intuitive graphic user interface. Glnemo2 supports a wide range of input file formats (Nemo, Gadget 1 and 2, phiGrape, Ramses, list of files, realtime gyrfalcON simulation) which are automatically detected at loading time without user intervention. Glnemo2 uses a plugin mechanism to load the data, so that it is easy to add a new file reader. It's powered by a 3D engine which uses the latest OpenGL technology, such as shaders (glsl), vertex buffer object, frame buffer object, and takes in account the power of the graphic card used in order to accelerate the rendering. With a fast GPU, millions of particles can be rendered in real time. Glnemo2 runs on Linux, Windows (using minGW compiler), and MaxOSX, thanks to the QT4API.

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.

Physics Notes.

ERIC Educational Resources Information Center

School Science Review, 1983

1983-01-01

Describes computer measurement of capacitor charge decay, change of fringe width with color, computer simulation of color mixing, Doppler effect/carrier waves, gravitational waves, microwave apparatus, computer simulation of Brownian motion, search coils and problems with the teaching of the relationships of velocity, frequency, and wavelength in…

A Simple Experimental Setup for Teaching Additive Colors with Arduino

NASA Astrophysics Data System (ADS)

Carvalho, Paulo Simeão; Hahn, Marcelo

2016-04-01

The result of additive colors is always fascinating to young students. When we teach this topic to 14- to 16-year-old students, they do not usually notice we use maximum light quantities of red (R), green (G), and blue (B) to obtain yellow, magenta, and cyan colors in order to build the well-known additive color diagram of Fig. 1. But how about using different light intensities for R, G, and B? What colors do we get? This problem of color mixing has been intensively discussed for decades by several authors, as pointed out by Ruiz's "Color Addition and Subtraction Apps" work and the references included therein. An early LED demonstrator for additive color mixing dates back to 1985, and apps to illustrate color mixing are available online. In this work, we describe an experimental setup making use of a microcontroller device: the Arduino Uno. This setup is designed as a game in order to improve students' understanding of color mixing.

Pilot feasibility study of binaural auditory beats for reducing symptoms of inattention in children and adolescents with attention-deficit/hyperactivity disorder.

PubMed

Kennel, Susan; Taylor, Ann Gill; Lyon, Debra; Bourguignon, Cheryl

2010-02-01

The purpose of this pilot study was to explore the potential for the use of binaural auditory beat stimulation to reduce the symptom of inattention in children and adolescents with attention-deficit/hyperactivity disorder. This pilot study had a randomized, double-blind, placebo-controlled design. Twenty participants were randomly assigned to listen to either an audio program on compact disk that contained binaural auditory beats or a sham audio program that did not have binaural beats for 20 minutes, three times a week for 3 weeks. The Children's Color Trails Test, the Color Trails Test, the Test of Variables of Attention (TOVA), and the Homework Problem Checklist were used to measure changes in inattention pre- and postintervention. Repeated measures analysis of variance was used to analyze pre- and postintervention scores on the Color Trails Tests, Homework Problem Checklist, and the TOVA. The effect of time was significant on the Color Trails Test. However, there were no significant group differences on the Color Trails Test or the TOVA scores postintervention. Parents reported that the study participants had fewer homework problems postintervention. The results from this study indicate that binaural auditory beat stimulation did not significantly reduce the symptom of inattention in the experimental group. However, parents and adolescents stated that homework problems due to inattention improved during the 3-week study. Parents and participants stated that the modality was easy to use and helpful. Therefore, this modality should be studied over a longer time frame in a larger sample to further its effectiveness to reduce the symptom of inattention in those diagnosed with attention-deficit/hyperactivity disorder. Copyright 2010 Elsevier Inc. All rights reserved.

Bias effects of short- and long-term color memory for unique objects.

PubMed

Bloj, Marina; Weiß, David; Gegenfurtner, Karl R

2016-04-01

Are objects remembered with a more saturated color? Some of the evidence supporting this statement comes from research using "memory colors"-the typical colors of particular objects, for example, the green of grass. The problematic aspect of these findings is that many different exemplars exist, some of which might exhibit a higher saturation than the one measured by the experimenter. Here we avoid this problem by using unique personal items and comparing long- and short-term color memory matches (in hue, value, and chroma) with those obtained with the object present. Our results, on average, confirm that objects are remembered as more saturated than they are.

Video systems for real-time oil-spill detection

NASA Technical Reports Server (NTRS)

Millard, J. P.; Arvesen, J. C.; Lewis, P. L.; Woolever, G. F.

1973-01-01

Three airborne television systems are being developed to evaluate techniques for oil-spill surveillance. These include a conventional TV camera, two cameras operating in a subtractive mode, and a field-sequential camera. False-color enhancement and wavelength and polarization filtering are also employed. The first of a series of flight tests indicates that an appropriately filtered conventional TV camera is a relatively inexpensive method of improving contrast between oil and water. False-color enhancement improves the contrast, but the problem caused by sun glint now limits the application to overcast days. Future effort will be aimed toward a one-camera system. Solving the sun-glint problem and developing the field-sequential camera into an operable system offers potential for color 'flagging' oil on water.

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

Intersecting Identities and Substance Use Problems: Sexual Orientation, Gender, Race, and Lifetime Substance Use Problems

PubMed Central

Mereish, Ethan H.; Bradford, Judith B.

2014-01-01

Objective: Research has documented that sexual minorities are at greater risk for substance use than heterosexuals. However, there are limited studies and mixed findings when investigating these health disparities among racial and ethnic minority samples. We used an intersectionality framework to examine disparities in lifetime substance use problems between heterosexual and sexual minority men and women and within sexual minority groups among a racially diverse sample. Method: A nonprobability sample of heterosexual (n = 1,091) and sexual minority (n = 1,465) patients from an urban community health center ranged in age from 18 to 72 years. Participants completed a brief patient survey and reported demographic information and history of lifetime substance use problems. Logistic regressions analyses were used to examine interactions between and among sexual orientation, gender, and race. Results: We found a significant three-way interaction among sexual orientation, gender, and race. Sexual minorities had a greater risk of self-reported lifetime substance use problems than heterosexuals, with nuanced gender and racial differences. Of greatest note, sexual minority women of color had greater risks than heterosexual women of color and than White sexual minority women. Sexual minority men of color did not differ in their risk when compared with heterosexual men of color, and they had lower risk than White sexual minority men. Conclusions: The results of this study demonstrate that an intersectionality framework is crucial to clearly identify lifetime substance use disparities between racially diverse sexual minority and heterosexual men and women. Future research, treatment, and policy should use intersectionality approaches when addressing substance use disparities. PMID:24411810

Color transfer algorithm in medical images

NASA Astrophysics Data System (ADS)

Wang, Weihong; Xu, Yangfa

2007-12-01

In digital virtual human project, image data acquires from the freezing slice of human body specimen. The color and brightness between a group of images of a certain organ could be quite different. The quality of these images could bring great difficulty in edge extraction, segmentation, as well as 3D reconstruction process. Thus it is necessary to unify the color of the images. The color transfer algorithm is a good algorithm to deal with this kind of problem. This paper introduces the principle of this algorithm and uses it in the medical image processing.

On a numerical method for solving integro-differential equations with variable coefficients with applications in finance

NASA Astrophysics Data System (ADS)

Kudryavtsev, O.; Rodochenko, V.

2018-03-01

We propose a new general numerical method aimed to solve integro-differential equations with variable coefficients. The problem under consideration arises in finance where in the context of pricing barrier options in a wide class of stochastic volatility models with jumps. To handle the effect of the correlation between the price and the variance, we use a suitable substitution for processes. Then we construct a Markov-chain approximation for the variation process on small time intervals and apply a maturity randomization technique. The result is a system of boundary problems for integro-differential equations with constant coefficients on the line in each vertex of the chain. We solve the arising problems using a numerical Wiener-Hopf factorization method. The approximate formulae for the factors are efficiently implemented by means of the Fast Fourier Transform. Finally, we use a recurrent procedure that moves backwards in time on the variance tree. We demonstrate the convergence of the method using Monte-Carlo simulations and compare our results with the results obtained by the Wiener-Hopf method with closed-form expressions of the factors.

A binary linear programming formulation of the graph edit distance.

PubMed

Justice, Derek; Hero, Alfred

2006-08-01

A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. A general formulation for editing graphs is used to derive a graph edit distance that is proven to be a metric, provided the cost function for individual edit operations is a metric. Then, a binary linear program is developed for computing this graph edit distance, and polynomial time methods for determining upper and lower bounds on the solution of the binary program are derived by applying solution methods for standard linear programming and the assignment problem. A recognition problem of comparing a sample input graph to a database of known prototype graphs in the context of a chemical information system is presented as an application of the new method. The costs associated with various edit operations are chosen by using a minimum normalized variance criterion applied to pairwise distances between nearest neighbors in the database of prototypes. The new metric is shown to perform quite well in comparison to existing metrics when applied to a database of chemical graphs.

Interim Report on the Investigation of the Fresh Properties of Synthetic Fiber-Reinforced Concrete for the Richardson Landing Casting Field

DTIC Science & Technology

2017-04-01

Figure 2. ASTM (2011) (C40) organic impurities testing of dredged sand. ........................................... 6 Tables Table 1. ASTM (2006) (C136...International (2011) (C40). The ASTM C40 organic impurity color was reported as a 4. Aggregates with this dark of a color may have problems with air...entrainment, freeze thaw durability, and compressive strength due to organic impurities being present in the fine aggregate. Problems with air

Color management with a hammer: the B-spline fitter

NASA Astrophysics Data System (ADS)

Bell, Ian E.; Liu, Bonny H. P.

2003-01-01

To paraphrase Abraham Maslow: If the only tool you have is a hammer, every problem looks like a nail. We have a B-spline fitter customized for 3D color data, and many problems in color management can be solved with this tool. Whereas color devices were once modeled with extensive measurement, look-up tables and trilinear interpolation, recent improvements in hardware have made B-spline models an affordable alternative. Such device characterizations require fewer color measurements than piecewise linear models, and have uses beyond simple interpolation. A B-spline fitter, for example, can act as a filter to remove noise from measurements, leaving a model with guaranteed smoothness. Inversion of the device model can then be carried out consistently and efficiently, as the spline model is well behaved and its derivatives easily computed. Spline-based algorithms also exist for gamut mapping, the composition of maps, and the extrapolation of a gamut. Trilinear interpolation---a degree-one spline---can still be used after nonlinear spline smoothing for high-speed evaluation with robust convergence. Using data from several color devices, this paper examines the use of B-splines as a generic tool for modeling devices and mapping one gamut to another, and concludes with applications to high-dimensional and spectral data.

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.

Preferential Remedies for Employment Discrimination

ERIC Educational Resources Information Center

Edwards, Harry T.; Zaretsky, Barry L.

1975-01-01

An overview of the problem of preferential remedies to achieve equal employment opportunities for women and minority groups. Contends that "color blindness" will not end discrimination but that some form of "color conscious" affirmative action program must be employed. Temporary preferential treatment is justified, according to…

Coloured Shadows.

ERIC Educational Resources Information Center

Olivieri, G.; And Others

1988-01-01

Investigates the relationship between knowledge of geometrical optics and the understanding of the phenomenon of colored shadows through adult interviews. Reports that the knowledge of geometrical optics facilitates the pinpointing of the color problem while experience with the mixing of paints may act as a barrier. (Author/YP)

Color/Form Matching as Indicator of Cognitive Reorganization in Kindergarten Children

ERIC Educational Resources Information Center

Miller, Douglas

1977-01-01

It was hypothesized that Piaget's argument on behalf of the reorganization of cognitive processes would gain empirical support from a color/form, matching similar objects problem for 52 6-year-olds from a variety of socioeconomic backgrounds. (Author/MS)

Clustering of color map pixels: an interactive approach

NASA Astrophysics Data System (ADS)

Moon, Yiu Sang; Luk, Franklin T.; Yuen, K. N.; Yeung, Hoi Wo

2003-12-01

The demand for digital maps continues to arise as mobile electronic devices become more popular nowadays. Instead of creating the entire map from void, we may convert a scanned paper map into a digital one. Color clustering is the very first step of the conversion process. Currently, most of the existing clustering algorithms are fully automatic. They are fast and efficient but may not work well in map conversion because of the numerous ambiguous issues associated with printed maps. Here we introduce two interactive approaches for color clustering on the map: color clustering with pre-calculated index colors (PCIC) and color clustering with pre-calculated color ranges (PCCR). We also introduce a memory model that could enhance and integrate different image processing techniques for fine-tuning the clustering results. Problems and examples of the algorithms are discussed in the paper.

[The effect of colored syringes and a colored sheet on the incidence of syringe swaps during anesthetic management].

PubMed

Hirabayashi, Yoshihiro; Kawakami, Takayuki; Suzuki, Hideo; Igarashi, Takashi; Saitoh, Kazuhiko; Seo, Norimasa

2005-09-01

Syringe swap is an important problem in anesthetic care, causing harm to patients. We examined the effect of colored syringe and a colored sheet on the incidence of syringe swaps during anesthetic management. We determined the color code. The blue-syringe contains local anesthetics; yellow-syringe, sympathomimetic drugs; and white-syringe with a red label fixed opposite the scale, muscle relaxants. The colored sheet displays the photographs of the syringe with drug name, dose and volume. The colored syringe and colored sheet were supplied for use from February 2004. We compared the incidence of syringe swaps during the period from February 2004 to January 2005 with that from February 2003 to January 2004. Although five syringe swaps were recorded from February 2003 to January 2004, in 5901 procedures, we encountered no syringe swaps from February 2004 to January 2005, in 6078 procedures. The colored syringe and colored sheet significantly decreased the incidence of syringe swaps during anesthetic management (P <0.05). The use of the sheet together with colored syringes can prevent syringe swaps during anesthesia.

Comparison of lossless compression techniques for prepress color images

NASA Astrophysics Data System (ADS)

Van Assche, Steven; Denecker, Koen N.; Philips, Wilfried R.; Lemahieu, Ignace L.

1998-12-01

In the pre-press industry color images have both a high spatial and a high color resolution. Such images require a considerable amount of storage space and impose long transmission times. Data compression is desired to reduce these storage and transmission problems. Because of the high quality requirements in the pre-press industry only lossless compression is acceptable. Most existing lossless compression schemes operate on gray-scale images. In this case the color components of color images must be compressed independently. However, higher compression ratios can be achieved by exploiting inter-color redundancies. In this paper we present a comparison of three state-of-the-art lossless compression techniques which exploit such color redundancies: IEP (Inter- color Error Prediction) and a KLT-based technique, which are both linear color decorrelation techniques, and Interframe CALIC, which uses a non-linear approach to color decorrelation. It is shown that these techniques are able to exploit color redundancies and that color decorrelation can be done effectively and efficiently. The linear color decorrelators provide a considerable coding gain (about 2 bpp) on some typical prepress images. The non-linear interframe CALIC predictor does not yield better results, but the full interframe CALIC technique does.

Computational efficiency improvements for image colorization

NASA Astrophysics Data System (ADS)

Yu, Chao; Sharma, Gaurav; Aly, Hussein

2013-03-01

We propose an efficient algorithm for colorization of greyscale images. As in prior work, colorization is posed as an optimization problem: a user specifies the color for a few scribbles drawn on the greyscale image and the color image is obtained by propagating color information from the scribbles to surrounding regions, while maximizing the local smoothness of colors. In this formulation, colorization is obtained by solving a large sparse linear system, which normally requires substantial computation and memory resources. Our algorithm improves the computational performance through three innovations over prior colorization implementations. First, the linear system is solved iteratively without explicitly constructing the sparse matrix, which significantly reduces the required memory. Second, we formulate each iteration in terms of integral images obtained by dynamic programming, reducing repetitive computation. Third, we use a coarseto- fine framework, where a lower resolution subsampled image is first colorized and this low resolution color image is upsampled to initialize the colorization process for the fine level. The improvements we develop provide significant speedup and memory savings compared to the conventional approach of solving the linear system directly using off-the-shelf sparse solvers, and allow us to colorize images with typical sizes encountered in realistic applications on typical commodity computing platforms.

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

NASA Astrophysics Data System (ADS)

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

2011-06-01

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

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

NASA Astrophysics Data System (ADS)

Kilminster, Ben

2004-02-01

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

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

NASA Astrophysics Data System (ADS)

Motegi, Kohei

2018-05-01

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

All-reflective optical target illumination system with high numerical aperture

DOEpatents

Sigler, Robert D.

1978-01-01

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

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

NASA Astrophysics Data System (ADS)

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

2009-08-01

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

The NLO jet vertex in the small-cone approximation for kt and cone algorithms

NASA Astrophysics Data System (ADS)

Colferai, D.; Niccoli, A.

2015-04-01

We determine the jet vertex for Mueller-Navelet jets and forward jets in the small-cone approximation for two particular choices of jet algoritms: the kt algorithm and the cone algorithm. These choices are motivated by the extensive use of such algorithms in the phenomenology of jets. The differences with the original calculations of the small-cone jet vertex by Ivanov and Papa, which is found to be equivalent to a formerly algorithm proposed by Furman, are shown at both analytic and numerical level, and turn out to be sizeable. A detailed numerical study of the error introduced by the small-cone approximation is also presented, for various observables of phenomenological interest. For values of the jet "radius" R = 0 .5, the use of the small-cone approximation amounts to an error of about 5% at the level of cross section, while it reduces to less than 2% for ratios of distributions such as those involved in the measure of the azimuthal decorrelation of dijets.

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

NASA Astrophysics Data System (ADS)

Belavin, Vladimir; Foda, Omar; Santachiara, Raoul

2015-10-01

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

Origami building blocks: Generic and special four-vertices

NASA Astrophysics Data System (ADS)

Waitukaitis, Scott; van Hecke, Martin

2016-02-01

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

Origami building blocks: Generic and special four-vertices.

PubMed

Waitukaitis, Scott; van Hecke, Martin

2016-02-01

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

A geometric construction of the Riemann scalar curvature in Regge calculus

NASA Astrophysics Data System (ADS)

McDonald, Jonathan R.; Miller, Warner A.

2008-10-01

The Riemann scalar curvature plays a central role in Einstein's geometric theory of gravity. We describe a new geometric construction of this scalar curvature invariant at an event (vertex) in a discrete spacetime geometry. This allows one to constructively measure the scalar curvature using only clocks and photons. Given recent interest in discrete pre-geometric models of quantum gravity, we believe is it ever so important to reconstruct the curvature scalar with respect to a finite number of communicating observers. This derivation makes use of a new fundamental lattice cell built from elements inherited from both the original simplicial (Delaunay) spacetime and its circumcentric dual (Voronoi) lattice. The orthogonality properties between these two lattices yield an expression for the vertex-based scalar curvature which is strikingly similar to the corresponding hinge-based expression in Regge calculus (deficit angle per unit Voronoi dual area). In particular, we show that the scalar curvature is simply a vertex-based weighted average of deficits per weighted average of dual areas.

Measuring the Scalar Curvature with Clocks and Photons: Voronoi-Delaunay Lattices in Regge Calculus

NASA Astrophysics Data System (ADS)

Miller, Warner; McDonald, Jonathan

2008-04-01

The Riemann scalar curvature plays a central role in Einstein's geometric theory of gravity. We describe a new geometric construction of this scalar curvature invariant at an event (vertex) in a discrete spacetime geometry. This allows one to constructively measure the scalar curvature using only clocks and photons. Given recent interest in discrete pre-geometric models of quantum gravity, we believe it is ever so important to reconstruct the curvature scalar with respect to a finite number of communicating observers. This derivation makes use of a fundamental lattice cell built from elements inherited from both the original simplicial (Delaunay) spacetime and its circumcentric dual (Voronoi) lattice. The orthogonality properties between these two lattices yield an expression for the vertex-based scalar curvature which is strikingly similar to the corresponding hinge-based expression in Regge Calculus (deficit angle per unit Voronoi dual area). In particular, we show that the scalar curvature is simply a vertex-based weighted average of deficits per weighted average of dual areas.

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.

Hue-preserving and saturation-improved color histogram equalization algorithm.

PubMed

Song, Ki Sun; Kang, Hee; Kang, Moon Gi

2016-06-01

In this paper, an algorithm is proposed to improve contrast and saturation without color degradation. The local histogram equalization (HE) method offers better performance than the global HE method, whereas the local HE method sometimes produces undesirable results due to the block-based processing. The proposed contrast-enhancement (CE) algorithm reflects the characteristics of the global HE method in the local HE method to avoid the artifacts, while global and local contrasts are enhanced. There are two ways to apply the proposed CE algorithm to color images. One is luminance processing methods, and the other one is each channel processing methods. However, these ways incur excessive or reduced saturation and color degradation problems. The proposed algorithm solves these problems by using channel adaptive equalization and similarity of ratios between the channels. Experimental results show that the proposed algorithm enhances contrast and saturation while preserving the hue and producing better performance than existing methods in terms of objective evaluation metrics.

Optical Interference Coatings Design Contest 2013: angle-independent color mirror and shortwave infrared/midwave infrared dichroic beam splitter.

PubMed

Hendrix, Karen; Kruschwitz, Jennifer D T; Keck, Jason

2014-02-01

An angle-independent color mirror and an infrared dichroic beam splitter were the subjects of a design contest held in conjunction with the 2013 Optical Interference Coatings topical meeting of the Optical Society of America. A total of 17 designers submitted 63 designs, 22 for Problem A and 41 for Problem B. The submissions were created through a wide spectrum of design approaches and optimization strategies. Michael Trubetskov and Weidong Shen won the first contest by submitting color mirror designs with a zero color difference (ΔE00) between normal incidence and all other incidence angles up to 60° as well as the thinnest design. Michael Trubetskov also won the second contest by submitting beam-splitter designs that met the required transmission while having the lowest mechanical coating stress and thinnest design. Fabien Lemarchand received the second-place finish for the beam-splitter design. The submitted designs are described and evaluated.

Many-core graph analytics using accelerated sparse linear algebra routines

NASA Astrophysics Data System (ADS)

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

2016-05-01

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

A Stochastic Model for Detecting Overlapping and Hierarchical Community Structure

PubMed Central

Cao, Xiaochun; Wang, Xiao; Jin, Di; Guo, Xiaojie; Tang, Xianchao

2015-01-01

Community detection is a fundamental problem in the analysis of complex networks. Recently, many researchers have concentrated on the detection of overlapping communities, where a vertex may belong to more than one community. However, most current methods require the number (or the size) of the communities as a priori information, which is usually unavailable in real-world networks. Thus, a practical algorithm should not only find the overlapping community structure, but also automatically determine the number of communities. Furthermore, it is preferable if this method is able to reveal the hierarchical structure of networks as well. In this work, we firstly propose a generative model that employs a nonnegative matrix factorization (NMF) formulization with a l2,1 norm regularization term, balanced by a resolution parameter. The NMF has the nature that provides overlapping community structure by assigning soft membership variables to each vertex; the l2,1 regularization term is a technique of group sparsity which can automatically determine the number of communities by penalizing too many nonempty communities; and hence the resolution parameter enables us to explore the hierarchical structure of networks. Thereafter, we derive the multiplicative update rule to learn the model parameters, and offer the proof of its correctness. Finally, we test our approach on a variety of synthetic and real-world networks, and compare it with some state-of-the-art algorithms. The results validate the superior performance of our new method. PMID:25822148

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.

Color vision in attention-deficit/hyperactivity disorder: a pilot visual evoked potential study.

PubMed

Kim, Soyeon; Banaschewski, Tobias; Tannock, Rosemary

2015-01-01

Individuals with attention-deficit/hyperactivity disorder (ADHD) are reported to manifest visual problems (including ophthalmological and color perception, particularly for blue-yellow stimuli), but findings are inconsistent. Accordingly, this study investigated visual function and color perception in adolescents with ADHD using color Visual Evoked Potentials (cVEP), which provides an objective measure of color perception. Thirty-one adolescents (aged 13-18), 16 with a confirmed diagnosis of ADHD, and 15 healthy peers, matched for age, gender, and IQ participated in the study. All underwent an ophthalmological exam, as well as electrophysiological testing color Visual Evoked Potentials (cVEP), which measured the latency and amplitude of the neural P1 response to chromatic (blue-yellow, red-green) and achromatic stimuli. No intergroup differences were found in the ophthalmological exam. However, significantly larger P1 amplitude was found for blue and yellow stimuli, but not red/green or achromatic stimuli, in the ADHD group (particularly in the medicated group) compared to controls. Larger amplitude in the P1 component for blue-yellow in the ADHD group compared to controls may account for the lack of difference in color perception tasks. We speculate that the larger amplitude for blue-yellow stimuli in early sensory processing (P1) might reflect a compensatory strategy for underlying problems including compromised retinal input of s-cones due to hypo-dopaminergic tone. Copyright © 2014 Spanish General Council of Optometry. Published by Elsevier Espana. All rights reserved.

The schemes and methods for producing of the visual security features used in the color hologram stereography

NASA Astrophysics Data System (ADS)

Lushnikov, D. S.; Zherdev, A. Y.; Odinokov, S. B.; Markin, V. V.; Smirnov, A. V.

2017-05-01

Visual security elements used in color holographic stereograms - three-dimensional colored security holograms - and methods their production is describes in this article. These visual security elements include color micro text, color-hidden image, the horizontal and vertical flip - flop effects by change color and image. The article also presents variants of optical systems that allow record the visual security elements as part of the holographic stereograms. The methods for solving of the optical problems arising in the recording visual security elements are presented. Also noted perception features of visual security elements for verification of security holograms by using these elements. The work was partially funded under the Agreement with the RF Ministry of Education and Science № 14.577.21.0197, grant RFMEFI57715X0197.

Progressive transmission of pseudo-color images. Appendix 1: Item 4. M.S. Thesis

NASA Technical Reports Server (NTRS)

Hadenfeldt, Andrew C.

1991-01-01

The transmission of digital images can require considerable channel bandwidth. The cost of obtaining such a channel can be prohibitive, or the channel might simply not be available. In this case, progressive transmission (PT) can be useful. PT presents the user with a coarse initial image approximation, and then proceeds to refine it. In this way, the user tends to receive information about the content of the image sooner than if a sequential transmission method is used. PT finds application in image data base browsing, teleconferencing, medical and other applications. A PT scheme is developed for use with a particular type of image data, the pseudo-color or color mapped image. Such images consist of a table of colors called a colormap, plus a 2-D array of index values which indicate which colormap entry is to be used to display a given pixel. This type of image presents some unique problems for a PT coder, and techniques for overcoming these problems are developed. A computer simulation of the color mapped PT scheme is developed to evaluate its performance. Results of simulation using several test images are presented.

Does sadness impair color perception? Flawed evidence and faulty methods.

PubMed

Holcombe, Alex O; Brown, Nicholas J L; Goodbourn, Patrick T; Etz, Alexander; Geukes, Sebastian

2016-01-01

In their 2015 paper, Thorstenson, Pazda, and Elliot offered evidence from two experiments that perception of colors on the blue-yellow axis was impaired if the participants had watched a sad movie clip, compared to participants who watched clips designed to induce a happy or neutral mood. Subsequently, these authors retracted their article, citing a mistake in their statistical analyses and a problem with the data in one of their experiments. Here, we discuss a number of other methodological problems with Thorstenson et al.'s experimental design, and also demonstrate that the problems with the data go beyond what these authors reported. We conclude that repeating one of the two experiments, with the minor revisions proposed by Thorstenson et al., will not be sufficient to address the problems with this work.

A procedure for standardization of color infrared film response

NASA Technical Reports Server (NTRS)

Lapado, R. L.; Ekstrand, R. E.

1973-01-01

Various problems with color infrared film used for remote sensing applications which relate to the instability or variability of the relative sensitivities of the dye layers within the film and the resultant variations in color balance are indicated. A procedure developed and utilized to optimize film response and to achieve more consistent results is described. The procedure establishes a sensitometric aim point with which all new batches of film are compared. Through the use of color compensation filters and change in basic exposure, the new film is exposed to produce imagery with the response characteristics of the aim curves.

Digital devices: big challenge in color management

NASA Astrophysics Data System (ADS)

Vauderwange, Oliver; Curticapean, Dan; Dreβler, Paul; Wozniak, Peter

2014-09-01

The paper will present how the students learn to find technical solutions in color management by using adequate digital devices and recognize the specific upcoming tasks in this area. Several issues, problems and their solutions will be discussed. The scientific background offer specific didactical solutions in this area of optics. Color management is the major item of this paper. Color management is a crucial responsibility for media engineers and designers. Print, screen and mobile applications must independently display the same colors. Predictability and consistency in the color representation are the aims of a color management system. This is only possible in a standardized and audited production workflow. Nowadays digital media have a fast-paced development process. An increasing number of different digital devices with different display sizes and display technologies are a great challenge for every color management system. The authors will present their experience in the field of color management. The design and development of a suitable learning environment with the required infrastructure is in the focus. The combination of theoretical and practical lectures creates a deeper understanding in the area of the digital color representation.

The Munsell Color System: a scientific compromise from the world of art.

PubMed

Cochrane, Sally

2014-09-01

Color systems make accurate color specification and matching possible in science, art, and industry by defining a coordinate system for all possible color perceptions. The Munsell Color System, developed by the artist Albert Henry Munsell in the early twentieth century, has influenced color science to this day. I trace the development of the Munsell Color System from its origins in the art world to its acceptance in the scientific community. Munsell's system was the first to accurately and quantitatively describe the psychological experience of color. By considering the problems that color posed for Munsell's art community and examining his diaries and published material, I conclude that Munsell arrived at his results by remaining agnostic as to the scientific definition of color, while retaining faith that color perceptions could be objectively quantified. I argue that Munsell was able to interest the scientific community in his work because color had become a controversial topic between physicists and psychologists. Parts of Munsell's system appealed to each field, making it a workable compromise. For contrast, I suggest that three contemporary scientists with whom Munsell had contact--Wilhelm Ostwald, Ogden Rood, and Edward Titchener--did not reach the same conclusions in their color systems because they started from scientific assumptions about the nature of color.

Hepatitis Diagnosis Using Facial Color Image

NASA Astrophysics Data System (ADS)

Liu, Mingjia; Guo, Zhenhua

Facial color diagnosis is an important diagnostic method in traditional Chinese medicine (TCM). However, due to its qualitative, subjective and experi-ence-based nature, traditional facial color diagnosis has a very limited application in clinical medicine. To circumvent the subjective and qualitative problems of facial color diagnosis of Traditional Chinese Medicine, in this paper, we present a novel computer aided facial color diagnosis method (CAFCDM). The method has three parts: face Image Database, Image Preprocessing Module and Diagnosis Engine. Face Image Database is carried out on a group of 116 patients affected by 2 kinds of liver diseases and 29 healthy volunteers. The quantitative color feature is extracted from facial images by using popular digital image processing techni-ques. Then, KNN classifier is employed to model the relationship between the quantitative color feature and diseases. The results show that the method can properly identify three groups: healthy, severe hepatitis with jaundice and severe hepatitis without jaundice with accuracy higher than 73%.

Cross-media color reproduction using the frequency-based spatial gamut mapping algorithm based on human color vision

NASA Astrophysics Data System (ADS)

Wu, Guangyuan; Niu, Shijun; Li, Xiaozhou; Hu, Guichun

2018-04-01

Due to the increasing globalization of printing industry, remoting proofing will become the inevitable development trend. Cross-media color reproduction will occur in different color gamuts using remote proofing technologies, which usually leads to the problem of incompatible color gamut. In this paper, to achieve equivalent color reproduction between a monitor and a printer, a frequency-based spatial gamut mapping algorithm is proposed for decreasing the loss of visual color information. The design of algorithm is based on the contrast sensitivity functions (CSF), which exploited CSF spatial filter to preserve luminance of the high spatial frequencies and chrominance of the low frequencies. First we show a general framework for how to apply CSF spatial filter in retention of relevant visual information. Then we compare the proposed framework with HPMINDE, CUSP, Bala's algorithm. The psychophysical experimental results indicated the good performance of the proposed algorithm.

The Visual Effects of Intraocular Colored Filters

PubMed Central

Hammond, Billy R.

2012-01-01

Modern life is associated with a myriad of visual problems, most notably refractive conditions such as myopia. Human ingenuity has addressed such problems using strategies such as spectacle lenses or surgical correction. There are other visual problems, however, that have been present throughout our evolutionary history and are not as easily solved by simply correcting refractive error. These problems include issues like glare disability and discomfort arising from intraocular scatter, photostress with the associated transient loss in vision that arises from short intense light exposures, or the ability to see objects in the distance through a veil of atmospheric haze. One likely biological solution to these more long-standing problems has been the use of colored intraocular filters. Many species, especially diurnal, incorporate chromophores from numerous sources (e.g., often plant pigments called carotenoids) into ocular tissues to improve visual performance outdoors. This review summarizes information on the utility of such filters focusing on chromatic filtering by humans. PMID:24278692

Chemical coloring on stainless steel by ultrasonic irradiation.

PubMed

Cheng, Zuohui; Xue, Yongqiang; Ju, Hongbin

2018-01-01

To solve the problems of high temperature and non-uniformity of coloring on stainless steel, a new chemical coloring process, applying ultrasonic irradiation to the traditional chemical coloring process, was developed in this paper. The effects of ultrasonic frequency and power density (sound intensity) on chemical coloring on stainless steel were studied. The uniformity of morphology and colors was observed with the help of polarizing microscope and scanning electron microscopy (SEM), and the surface compositions were characterized by X-ray photoelectric spectroscopy (XPS), meanwhile, the wear resistance and the corrosion resistance were investigated, and the effect mechanism of ultrasonic irradiation on chemical coloring was discussed. These results show that in the process of chemical coloring on stainless steel by ultrasonic irradiation, the film composition is the same as the traditional chemical coloring, and this method can significantly enhance the uniformity, the wear and corrosion resistances of the color film and accelerate the coloring rate which makes the coloring temperature reduced to 40°C. The effects of ultrasonic irradiation on the chemical coloring can be attributed to the coloring rate accelerated and the coloring temperature reduced by thermal-effect, the uniformity of coloring film improved by dispersion-effect, and the wear and corrosion resistances of coloring film enhanced by cavitation-effect. Ultrasonic irradiation not only has an extensive application prospect for chemical coloring on stainless steel but also provides an valuable reference for other chemical coloring. Copyright © 2017 Elsevier B.V. All rights reserved.

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

NASA Astrophysics Data System (ADS)

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

2018-06-01

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

Aspects of Complexity in Sleep Analysis

NASA Astrophysics Data System (ADS)

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

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

Geometry in the mechanics of origami

NASA Astrophysics Data System (ADS)

Dias, Marcelo A.; Santangelo, Christian D.

2012-02-01

We present a mechanical model for curved fold origami in which the bending energies of developable regions are balanced with a phenomenological energy for the crease. The latter energy comes into play as a source of geometric frustration, allowing us to study shape formation by prescribing crease patterns. For a single fold annular configuration, we show how geometry forces a symmetry breaking of the ground state by increasing the width of the ribbon. We extend our model to study multiple fold structures, where we derive geometrical constraints that can be written as recursive relations to build the surface from valley to mountain, and so on. We also suggest a mechanical model for single vertex folds, mapping this problem to an elastica on the sphere.

Extended bounds limiter for high-order finite-volume schemes on unstructured meshes

NASA Astrophysics Data System (ADS)

Tsoutsanis, Panagiotis

2018-06-01

This paper explores the impact of the definition of the bounds of the limiter proposed by Michalak and Ollivier-Gooch in [56] (2009), for higher-order Monotone-Upstream Central Scheme for Conservation Laws (MUSCL) numerical schemes on unstructured meshes in the finite-volume (FV) framework. A new modification of the limiter is proposed where the bounds are redefined by utilising all the spatial information provided by all the elements in the reconstruction stencil. Numerical results obtained on smooth and discontinuous test problems of the Euler equations on unstructured meshes, highlight that the newly proposed extended bounds limiter exhibits superior performance in terms of accuracy and mesh sensitivity compared to the cell-based or vertex-based bounds implementations.

A{sub n}{sup (1)} Toda solitons and the dressing symmetry

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

Belich, H.; Paunov, R.

We present an elementary derivation of the solitonlike solutions in the A{sub n}{sup (1)} Toda models which is an alternative to the previously used Hirota method. The solutions of the underlying linear problem corresponding to the N-solitons are calculated. This enables us to obtain explicit expression for the element which, by dressing group action, produces a generic soliton solution. In the particular example of monosolitons we suggest a relation to the vertex operator formalism, previously used by Olive, Turok, and Underwood. Our results can also be considered as generalization of the approach to the sine{endash}Gordon solitons, proposed by Babelon andmore » Bernard. {copyright} {ital 1997 American Institute of Physics.}« less

Circular Mixture Modeling of Color Distribution for Blind Stain Separation in Pathology Images.

PubMed

Li, Xingyu; Plataniotis, Konstantinos N

2017-01-01

In digital pathology, to address color variation and histological component colocalization in pathology images, stain decomposition is usually performed preceding spectral normalization and tissue component segmentation. This paper examines the problem of stain decomposition, which is a naturally nonnegative matrix factorization (NMF) problem in algebra, and introduces a systematical and analytical solution consisting of a circular color analysis module and an NMF-based computation module. Unlike the paradigm of existing stain decomposition algorithms where stain proportions are computed from estimated stain spectra using a matrix inverse operation directly, the introduced solution estimates stain spectra and stain depths via probabilistic reasoning individually. Since the proposed method pays extra attentions to achromatic pixels in color analysis and stain co-occurrence in pixel clustering, it achieves consistent and reliable stain decomposition with minimum decomposition residue. Particularly, aware of the periodic and angular nature of hue, we propose the use of a circular von Mises mixture model to analyze the hue distribution, and provide a complete color-based pixel soft-clustering solution to address color mixing introduced by stain overlap. This innovation combined with saturation-weighted computation makes our study effective for weak stains and broad-spectrum stains. Extensive experimentation on multiple public pathology datasets suggests that our approach outperforms state-of-the-art blind stain separation methods in terms of decomposition effectiveness.

Prediction of Pork Longissimus Lean Color Stability Using VIS/NIR

USDA-ARS?s Scientific Manuscript database

Insufficient case-life is a costly problem facing pork processors. To assess Visible and Near-Infrared (VIS/NIR) spectroscopy as a technology to sort pork loins according to lean color stability, center-cut pork loins (n = 1208) were selected from the boning lines of four large-scale pork processor...

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.