On the 2-Extendability of Planar Graphs

DTIC Science & Technology

1989-01-01

connectivity for n-extend- ability of regular graphs, 1988, submitted. [6] L. Lov~isz and M.D. Plummer, Matching Theory, Ann. Discrete Math . 29, North...Holland, Amsterdam, 1986. [7] M.D. Plummer, On n-extendable graphs, Discrete Math . 31, 1980, 201-210. [8] M.D. Plummer, A theorem on matchings in the...plane, Graph Theory in Memory of G.A. Dirac, Ann. Discrete Math . 41, North-Holland, Amsterdam, 1989, 347-354. [9] C. Thomassen, Girth in graphs, J

Inspection of aeronautical mechanical parts with a pan-tilt-zoom camera: an approach guided by the computer-aided design model

NASA Astrophysics Data System (ADS)

Viana, Ilisio; Orteu, Jean-José; Cornille, Nicolas; Bugarin, Florian

2015-11-01

We focus on quality control of mechanical parts in aeronautical context using a single pan-tilt-zoom (PTZ) camera and a computer-aided design (CAD) model of the mechanical part. We use the CAD model to create a theoretical image of the element to be checked, which is further matched with the sensed image of the element to be inspected, using a graph theory-based approach. The matching is carried out in two stages. First, the two images are used to create two attributed graphs representing the primitives (ellipses and line segments) in the images. In the second stage, the graphs are matched using a similarity function built from the primitive parameters. The similarity scores of the matching are injected in the edges of a bipartite graph. A best-match-search procedure in the bipartite graph guarantees the uniqueness of the match solution. The method achieves promising performance in tests with synthetic data including missing elements, displaced elements, size changes, and combinations of these cases. The results open good prospects for using the method with realistic data.

Exact and approximate graph matching using random walks.

PubMed

Gori, Marco; Maggini, Marco; Sarti, Lorenzo

2005-07-01

In this paper, we propose a general framework for graph matching which is suitable for different problems of pattern recognition. The pattern representation we assume is at the same time highly structured, like for classic syntactic and structural approaches, and of subsymbolic nature with real-valued features, like for connectionist and statistic approaches. We show that random walk based models, inspired by Google's PageRank, give rise to a spectral theory that nicely enhances the graph topological features at node level. As a straightforward consequence, we derive a polynomial algorithm for the classic graph isomorphism problem, under the restriction of dealing with Markovian spectrally distinguishable graphs (MSD), a class of graphs that does not seem to be easily reducible to others proposed in the literature. The experimental results that we found on different test-beds of the TC-15 graph database show that the defined MSD class "almost always" covers the database, and that the proposed algorithm is significantly more efficient than top scoring VF algorithm on the same data. Most interestingly, the proposed approach is very well-suited for dealing with partial and approximate graph matching problems, derived for instance from image retrieval tasks. We consider the objects of the COIL-100 visual collection and provide a graph-based representation, whose node's labels contain appropriate visual features. We show that the adoption of classic bipartite graph matching algorithms offers a straightforward generalization of the algorithm given for graph isomorphism and, finally, we report very promising experimental results on the COIL-100 visual collection.

Toughness and Matching Extension in Graphs,

DTIC Science & Technology

1986-05-01

New York, 1977. V. CHVATAL 1973a. Tough graphs and Hamiltonian circuits, Discrete Math . 5, 1973, 215- 228. 1973b. New directions in Hamiltonian...PLUMMER 1986. Matching Theory, Ann. Discrete Math ., North-Holland, Amsterdam, 1986 (to appear). M. D. PLUMMER 1980. On n-extendable graphs, Discrete ... Math . 31, 1980, 201-210. 1985. A theorem on matchings in the plane, Conference in memory of Gabriel Dirac, Ann. Discrete Math ., North-Holland, Amsterdam

Self-organizing maps for learning the edit costs in graph matching.

PubMed

Neuhaus, Michel; Bunke, Horst

2005-06-01

Although graph matching and graph edit distance computation have become areas of intensive research recently, the automatic inference of the cost of edit operations has remained an open problem. In the present paper, we address the issue of learning graph edit distance cost functions for numerically labeled graphs from a corpus of sample graphs. We propose a system of self-organizing maps (SOMs) that represent the distance measuring spaces of node and edge labels. Our learning process is based on the concept of self-organization. It adapts the edit costs in such a way that the similarity of graphs from the same class is increased, whereas the similarity of graphs from different classes decreases. The learning procedure is demonstrated on two different applications involving line drawing graphs and graphs representing diatoms, respectively.

Graph edit distance from spectral seriation.

PubMed

Robles-Kelly, Antonio; Hancock, Edwin R

2005-03-01

This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that they lack some of the formality and rigor of the computation of string edit distance. Hence, our aim is to convert graphs to string sequences so that string matching techniques can be used. To do this, we use a graph spectral seriation method to convert the adjacency matrix into a string or sequence order. We show how the serial ordering can be established using the leading eigenvector of the graph adjacency matrix. We pose the problem of graph-matching as a maximum a posteriori probability (MAP) alignment of the seriation sequences for pairs of graphs. This treatment leads to an expression in which the edit cost is the negative logarithm of the a posteriori sequence alignment probability. We compute the edit distance by finding the sequence of string edit operations which minimizes the cost of the path traversing the edit lattice. The edit costs are determined by the components of the leading eigenvectors of the adjacency matrix and by the edge densities of the graphs being matched. We demonstrate the utility of the edit distance on a number of graph clustering problems.

Determining similarity in histological images using graph-theoretic description and matching methods for content-based image retrieval in medical diagnostics.

PubMed

Sharma, Harshita; Alekseychuk, Alexander; Leskovsky, Peter; Hellwich, Olaf; Anand, R S; Zerbe, Norman; Hufnagl, Peter

2012-10-04

Computer-based analysis of digitalized histological images has been gaining increasing attention, due to their extensive use in research and routine practice. The article aims to contribute towards the description and retrieval of histological images by employing a structural method using graphs. Due to their expressive ability, graphs are considered as a powerful and versatile representation formalism and have obtained a growing consideration especially by the image processing and computer vision community. The article describes a novel method for determining similarity between histological images through graph-theoretic description and matching, for the purpose of content-based retrieval. A higher order (region-based) graph-based representation of breast biopsy images has been attained and a tree-search based inexact graph matching technique has been employed that facilitates the automatic retrieval of images structurally similar to a given image from large databases. The results obtained and evaluation performed demonstrate the effectiveness and superiority of graph-based image retrieval over a common histogram-based technique. The employed graph matching complexity has been reduced compared to the state-of-the-art optimal inexact matching methods by applying a pre-requisite criterion for matching of nodes and a sophisticated design of the estimation function, especially the prognosis function. The proposed method is suitable for the retrieval of similar histological images, as suggested by the experimental and evaluation results obtained in the study. It is intended for the use in Content Based Image Retrieval (CBIR)-requiring applications in the areas of medical diagnostics and research, and can also be generalized for retrieval of different types of complex images. The virtual slide(s) for this article can be found here: http://www.diagnosticpathology.diagnomx.eu/vs/1224798882787923.

Determining similarity in histological images using graph-theoretic description and matching methods for content-based image retrieval in medical diagnostics

PubMed Central

2012-01-01

Background Computer-based analysis of digitalized histological images has been gaining increasing attention, due to their extensive use in research and routine practice. The article aims to contribute towards the description and retrieval of histological images by employing a structural method using graphs. Due to their expressive ability, graphs are considered as a powerful and versatile representation formalism and have obtained a growing consideration especially by the image processing and computer vision community. Methods The article describes a novel method for determining similarity between histological images through graph-theoretic description and matching, for the purpose of content-based retrieval. A higher order (region-based) graph-based representation of breast biopsy images has been attained and a tree-search based inexact graph matching technique has been employed that facilitates the automatic retrieval of images structurally similar to a given image from large databases. Results The results obtained and evaluation performed demonstrate the effectiveness and superiority of graph-based image retrieval over a common histogram-based technique. The employed graph matching complexity has been reduced compared to the state-of-the-art optimal inexact matching methods by applying a pre-requisite criterion for matching of nodes and a sophisticated design of the estimation function, especially the prognosis function. Conclusion The proposed method is suitable for the retrieval of similar histological images, as suggested by the experimental and evaluation results obtained in the study. It is intended for the use in Content Based Image Retrieval (CBIR)-requiring applications in the areas of medical diagnostics and research, and can also be generalized for retrieval of different types of complex images. Virtual Slides The virtual slide(s) for this article can be found here: http://www.diagnosticpathology.diagnomx.eu/vs/1224798882787923. PMID:23035717

Content-based image retrieval by matching hierarchical attributed region adjacency graphs

NASA Astrophysics Data System (ADS)

Fischer, Benedikt; Thies, Christian J.; Guld, Mark O.; Lehmann, Thomas M.

2004-05-01

Content-based image retrieval requires a formal description of visual information. In medical applications, all relevant biological objects have to be represented by this description. Although color as the primary feature has proven successful in publicly available retrieval systems of general purpose, this description is not applicable to most medical images. Additionally, it has been shown that global features characterizing the whole image do not lead to acceptable results in the medical context or that they are only suitable for specific applications. For a general purpose content-based comparison of medical images, local, i.e. regional features that are collected on multiple scales must be used. A hierarchical attributed region adjacency graph (HARAG) provides such a representation and transfers image comparison to graph matching. However, building a HARAG from an image requires a restriction in size to be computationally feasible while at the same time all visually plausible information must be preserved. For this purpose, mechanisms for the reduction of the graph size are presented. Even with a reduced graph, the problem of graph matching remains NP-complete. In this paper, the Similarity Flooding approach and Hopfield-style neural networks are adapted from the graph matching community to the needs of HARAG comparison. Based on synthetic image material build from simple geometric objects, all visually similar regions were matched accordingly showing the framework's general applicability to content-based image retrieval of medical images.

Introduction and Terminology 2-Extendability in 3-Polytopes.

DTIC Science & Technology

1985-01-01

and D.A. Holton, On defect-d matchings in graphs, Discrete Math ., 13, 1975, 41-54. [LGH2] (-), Erratum: "On defect-d matchings, Discrete Mlath., 14...Matching Theory, Vol. 29, knn. Discrete Math ., North- Holland, Amsterdam, 1986. [Plell J. Plesnik, Connectivity of regular graphs and the existence of 1...Plu2] -- ), A theorem on mnatchings in the plane, Graph Theo~ry in Memory of G..4. Dirac, Ann. Discrete Math ., North-Holland. Amisterdarni. to appear

Matching Extension and the Genus of a Graph,

DTIC Science & Technology

1986-03-01

relationship between the genus and the cardinality of the maximum matchings of a graph, Discrete Math . 25, 1979, 149-156. O.ORE " 1967. The Four-Color...Ed.: W. T. Tutte, Academic Press, New York, 1969, 287-293. M.D. PLUMMER 1980. On n-extendable graph9, Discrete Math . 31, 1980, 201-210. 1985. A

Some Recent Results on Graph Matching,

DTIC Science & Technology

1987-06-01

V. CHVATAL, Tough graphs and Hamiltonian circuits, Discrete Math . 5, 1973, 215-228. [El] J. EDMONDS, Paths, trees and flowers, Canad. J. Math. 17...Theory, Ann. Discrete Math . 29, North-Holland, Amsterdam, 1986. [N] D. NADDEF, Rank of maximum matchings in a graph, Math. Programming 22, 52-70. [NP...Optimization, Ann. Discrete Math . 16, North-Holland, Amsterdam, 1982, 241-260. [P1] M.D. PLUMMER, On n-extendable graphs, Discrete Math . 31, 1980, 201-210

Charge recombination in the muon collider cooling channel

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

Fernow, R. C.; Palmer, R. B.

2012-12-21

The final stage of the ionization cooling channel for the muon collider must transversely recombine the positively and negatively charged bunches into a single beam before the muons can be accelerated. It is particularly important to minimize any emittance growth in this system since no further cooling takes place before the bunches are collided. We have found that emittance growth could be minimized by using symmetric pairs of bent solenoids and careful matching. We show that a practical design can be found that has transmission {approx}99%, emittance growth less than 0.1%, and minimal dispersion in the recombined bunches.

Ontology Matching Across Domains

DTIC Science & Technology

2010-05-01

matching include GMO [1], Anchor-Prompt [2], and Similarity Flooding [3]. GMO is an iterative structural matcher, which uses RDF bipartite graphs to...AFRL under contract# FA8750-09-C-0058. References [1] Hu, W., Jian, N., Qu, Y., Wang, Y., “ GMO : a graph matching for ontologies”, in: Proceedings of

A graph lattice approach to maintaining and learning dense collections of subgraphs as image features.

PubMed

Saund, Eric

2013-10-01

Effective object and scene classification and indexing depend on extraction of informative image features. This paper shows how large families of complex image features in the form of subgraphs can be built out of simpler ones through construction of a graph lattice—a hierarchy of related subgraphs linked in a lattice. Robustness is achieved by matching many overlapping and redundant subgraphs, which allows the use of inexpensive exact graph matching, instead of relying on expensive error-tolerant graph matching to a minimal set of ideal model graphs. Efficiency in exact matching is gained by exploitation of the graph lattice data structure. Additionally, the graph lattice enables methods for adaptively growing a feature space of subgraphs tailored to observed data. We develop the approach in the domain of rectilinear line art, specifically for the practical problem of document forms recognition. We are especially interested in methods that require only one or very few labeled training examples per category. We demonstrate two approaches to using the subgraph features for this purpose. Using a bag-of-words feature vector we achieve essentially single-instance learning on a benchmark forms database, following an unsupervised clustering stage. Further performance gains are achieved on a more difficult dataset using a feature voting method and feature selection procedure.

Matching of renewable source of energy generation graphs and electrical load in local energy system

NASA Astrophysics Data System (ADS)

Lezhniuk, Petro; Komar, Vyacheslav; Sobchuk, Dmytro; Kravchuk, Sergiy; Kacejko, Piotr; Zavidsky, Vladislav

2017-08-01

The paper contains the method of matching generation graph of photovoltaic electric stations and consumers. Characteristic feature of this method is the application of morphometric analysis for assessment of non-uniformity of the integrated graph of energy supply, optimal coefficients of current distribution, that enables by mean of refining the powers, transferring in accordance with the graph , to provide the decrease of electric energy losses in the grid and transport task, as the optimization tool.

A Robust False Matching Points Detection Method for Remote Sensing Image Registration

NASA Astrophysics Data System (ADS)

Shan, X. J.; Tang, P.

2015-04-01

Given the influences of illumination, imaging angle, and geometric distortion, among others, false matching points still occur in all image registration algorithms. Therefore, false matching points detection is an important step in remote sensing image registration. Random Sample Consensus (RANSAC) is typically used to detect false matching points. However, RANSAC method cannot detect all false matching points in some remote sensing images. Therefore, a robust false matching points detection method based on Knearest- neighbour (K-NN) graph (KGD) is proposed in this method to obtain robust and high accuracy result. The KGD method starts with the construction of the K-NN graph in one image. K-NN graph can be first generated for each matching points and its K nearest matching points. Local transformation model for each matching point is then obtained by using its K nearest matching points. The error of each matching point is computed by using its transformation model. Last, L matching points with largest error are identified false matching points and removed. This process is iterative until all errors are smaller than the given threshold. In addition, KGD method can be used in combination with other methods, such as RANSAC. Several remote sensing images with different resolutions and terrains are used in the experiment. We evaluate the performance of KGD method, RANSAC + KGD method, RANSAC, and Graph Transformation Matching (GTM). The experimental results demonstrate the superior performance of the KGD and RANSAC + KGD methods.

The Kirchhoff index and the matching number

NASA Astrophysics Data System (ADS)

Zhou, Bo; Trinajstić, Nenad

The Kirchhoff index of a connected (molecular) graph is the sum of the resistance-distances between all unordered pairs of vertices and may also be expressed by its Laplacian eigenvalues. We determine the minimum Kirchhoff index of connected (molecular) graphs in terms of the number of vertices and matching number and characterize the unique extremal graph. The results on the Kirchhoff index are compared with the corresponding results on the Wiener index.

Retina verification system based on biometric graph matching.

PubMed

Lajevardi, Seyed Mehdi; Arakala, Arathi; Davis, Stephen A; Horadam, Kathy J

2013-09-01

This paper presents an automatic retina verification framework based on the biometric graph matching (BGM) algorithm. The retinal vasculature is extracted using a family of matched filters in the frequency domain and morphological operators. Then, retinal templates are defined as formal spatial graphs derived from the retinal vasculature. The BGM algorithm, a noisy graph matching algorithm, robust to translation, non-linear distortion, and small rotations, is used to compare retinal templates. The BGM algorithm uses graph topology to define three distance measures between a pair of graphs, two of which are new. A support vector machine (SVM) classifier is used to distinguish between genuine and imposter comparisons. Using single as well as multiple graph measures, the classifier achieves complete separation on a training set of images from the VARIA database (60% of the data), equaling the state-of-the-art for retina verification. Because the available data set is small, kernel density estimation (KDE) of the genuine and imposter score distributions of the training set are used to measure performance of the BGM algorithm. In the one dimensional case, the KDE model is validated with the testing set. A 0 EER on testing shows that the KDE model is a good fit for the empirical distribution. For the multiple graph measures, a novel combination of the SVM boundary and the KDE model is used to obtain a fair comparison with the KDE model for the single measure. A clear benefit in using multiple graph measures over a single measure to distinguish genuine and imposter comparisons is demonstrated by a drop in theoretical error of between 60% and more than two orders of magnitude.

Statistically significant relational data mining :

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

Berry, Jonathan W.; Leung, Vitus Joseph; Phillips, Cynthia Ann

This report summarizes the work performed under the project (3z(BStatitically significant relational data mining.(3y (BThe goal of the project was to add more statistical rigor to the fairly ad hoc area of data mining on graphs. Our goal was to develop better algorithms and better ways to evaluate algorithm quality. We concetrated on algorithms for community detection, approximate pattern matching, and graph similarity measures. Approximate pattern matching involves finding an instance of a relatively small pattern, expressed with tolerance, in a large graph of data observed with uncertainty. This report gathers the abstracts and references for the eight refereed publicationsmore » that have appeared as part of this work. We then archive three pieces of research that have not yet been published. The first is theoretical and experimental evidence that a popular statistical measure for comparison of community assignments favors over-resolved communities over approximations to a ground truth. The second are statistically motivated methods for measuring the quality of an approximate match of a small pattern in a large graph. The third is a new probabilistic random graph model. Statisticians favor these models for graph analysis. The new local structure graph model overcomes some of the issues with popular models such as exponential random graph models and latent variable models.« less

High-order graph matching based feature selection for Alzheimer's disease identification.

PubMed

Liu, Feng; Suk, Heung-Il; Wee, Chong-Yaw; Chen, Huafu; Shen, Dinggang

2013-01-01

One of the main limitations of l1-norm feature selection is that it focuses on estimating the target vector for each sample individually without considering relations with other samples. However, it's believed that the geometrical relation among target vectors in the training set may provide useful information, and it would be natural to expect that the predicted vectors have similar geometric relations as the target vectors. To overcome these limitations, we formulate this as a graph-matching feature selection problem between a predicted graph and a target graph. In the predicted graph a node is represented by predicted vector that may describe regional gray matter volume or cortical thickness features, and in the target graph a node is represented by target vector that include class label and clinical scores. In particular, we devise new regularization terms in sparse representation to impose high-order graph matching between the target vectors and the predicted ones. Finally, the selected regional gray matter volume and cortical thickness features are fused in kernel space for classification. Using the ADNI dataset, we evaluate the effectiveness of the proposed method and obtain the accuracies of 92.17% and 81.57% in AD and MCI classification, respectively.

Quantum Communication Systems

DTIC Science & Technology

2008-03-15

numbers make the observation of non -Poissonian features easier, which calls for higher pump power and better mode matching of the pump beam , more...heralded two-photon NOON states, we rely on the local photon- bunching effect of two heralded single photons at a beam splitter , as sketched in Fig. 1. Two...heralded single photons are sent to separate input ports of a 50:50 beam splitter (BS1). The photons bunch at the beam splitter , exiting together from

Fast and accurate face recognition based on image compression

NASA Astrophysics Data System (ADS)

Zheng, Yufeng; Blasch, Erik

2017-05-01

Image compression is desired for many image-related applications especially for network-based applications with bandwidth and storage constraints. The face recognition community typical reports concentrate on the maximal compression rate that would not decrease the recognition accuracy. In general, the wavelet-based face recognition methods such as EBGM (elastic bunch graph matching) and FPB (face pattern byte) are of high performance but run slowly due to their high computation demands. The PCA (Principal Component Analysis) and LDA (Linear Discriminant Analysis) algorithms run fast but perform poorly in face recognition. In this paper, we propose a novel face recognition method based on standard image compression algorithm, which is termed as compression-based (CPB) face recognition. First, all gallery images are compressed by the selected compression algorithm. Second, a mixed image is formed with the probe and gallery images and then compressed. Third, a composite compression ratio (CCR) is computed with three compression ratios calculated from: probe, gallery and mixed images. Finally, the CCR values are compared and the largest CCR corresponds to the matched face. The time cost of each face matching is about the time of compressing the mixed face image. We tested the proposed CPB method on the "ASUMSS face database" (visible and thermal images) from 105 subjects. The face recognition accuracy with visible images is 94.76% when using JPEG compression. On the same face dataset, the accuracy of FPB algorithm was reported as 91.43%. The JPEG-compressionbased (JPEG-CPB) face recognition is standard and fast, which may be integrated into a real-time imaging device.

Graph rigidity, cyclic belief propagation, and point pattern matching.

PubMed

McAuley, Julian J; Caetano, Tibério S; Barbosa, Marconi S

2008-11-01

A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal graphical model. Its fundamental result is that the chordal graph in question is shown to be globally rigid, implying that exact inference provides the same matching solution as exact inference in a complete graphical model. This implies that the algorithm is optimal when there is no noise in the point patterns. In this paper, we present a new graph that is also globally rigid but has an advantage over the graph proposed in [1]: Its maximal clique size is smaller, rendering inference significantly more efficient. However, this graph is not chordal, and thus, standard Junction Tree algorithms cannot be directly applied. Nevertheless, we show that loopy belief propagation in such a graph converges to the optimal solution. This allows us to retain the optimality guarantee in the noiseless case, while substantially reducing both memory requirements and processing time. Our experimental results show that the accuracy of the proposed solution is indistinguishable from that in [1] when there is noise in the point patterns.

A memory-efficient data structure representing exact-match overlap graphs with application for next-generation DNA assembly.

PubMed

Dinh, Hieu; Rajasekaran, Sanguthevar

2011-07-15

Exact-match overlap graphs have been broadly used in the context of DNA assembly and the shortest super string problem where the number of strings n ranges from thousands to billions. The length ℓ of the strings is from 25 to 1000, depending on the DNA sequencing technologies. However, many DNA assemblers using overlap graphs suffer from the need for too much time and space in constructing the graphs. It is nearly impossible for these DNA assemblers to handle the huge amount of data produced by the next-generation sequencing technologies where the number n of strings could be several billions. If the overlap graph is explicitly stored, it would require Ω(n(2)) memory, which could be prohibitive in practice when n is greater than a hundred million. In this article, we propose a novel data structure using which the overlap graph can be compactly stored. This data structure requires only linear time to construct and and linear memory to store. For a given set of input strings (also called reads), we can informally define an exact-match overlap graph as follows. Each read is represented as a node in the graph and there is an edge between two nodes if the corresponding reads overlap sufficiently. A formal description follows. The maximal exact-match overlap of two strings x and y, denoted by ov(max)(x, y), is the longest string which is a suffix of x and a prefix of y. The exact-match overlap graph of n given strings of length ℓ is an edge-weighted graph in which each vertex is associated with a string and there is an edge (x, y) of weight ω=ℓ-|ov(max)(x, y)| if and only if ω ≤ λ, where |ov(max)(x, y)| is the length of ov(max)(x, y) and λ is a given threshold. In this article, we show that the exact-match overlap graphs can be represented by a compact data structure that can be stored using at most (2λ-1)(2⌈logn⌉+⌈logλ⌉)n bits with a guarantee that the basic operation of accessing an edge takes O(log λ) time. We also propose two algorithms for constructing the data structure for the exact-match overlap graph. The first algorithm runs in O(λℓnlogn) worse-case time and requires O(λ) extra memory. The second one runs in O(λℓn) time and requires O(n) extra memory. Our experimental results on a huge amount of simulated data from sequence assembly show that the data structure can be constructed efficiently in time and memory. Our DNA sequence assembler that incorporates the data structure is freely available on the web at http://www.engr.uconn.edu/~htd06001/assembler/leap.zip

Extending Matchings in Planar Graphs 4

DTIC Science & Technology

1989-01-01

Discrete Math ., 18, 1977, 213-216. [31 B. Grfianbaum, Convex Polytopes, Interscience Publishers, John Wiley & Sons, Lon- don, 1967. [4] D.A. Holton and...Kalamazoo, 1988), John Wiley & Sons, (to appear). [6] D.A. Holton, D. Lou and M.D. Plummer, On the 2-extendability of planar graphs, preprint, Discrete Math ., (to...81 L. Lovasz and M.D. Plummer, Matching Theory, Ann. Discrete Math . 29, North- Holland, Amsterdam, 1986. [9] M.D. Plummer, On n-extendable graphs

Emittance preservation in plasma-based accelerators with ion motion

DOE PAGES

Benedetti, C.; Schroeder, C. B.; Esarey, E.; ...

2017-11-01

In a plasma-accelerator-based linear collider, the density of matched, low-emittance, high-energy particle bunches required for collider applications can be orders of magnitude above the background ion density, leading to ion motion, perturbation of the focusing fields, and, hence, to beam emittance growth. By analyzing the response of the background ions to an ultrahigh density beam, analytical expressions, valid for nonrelativistic ion motion, are derived for the transverse wakefield and for the final (i.e., after saturation) bunch emittance. Analytical results are validated against numerical modeling. Initial beam distributions are derived that are equilibrium solutions, which require head-to-tail bunch shaping, enabling emittancemore » preservation with ion motion.« less

Poor textural image tie point matching via graph theory

NASA Astrophysics Data System (ADS)

Yuan, Xiuxiao; Chen, Shiyu; Yuan, Wei; Cai, Yang

2017-07-01

Feature matching aims to find corresponding points to serve as tie points between images. Robust matching is still a challenging task when input images are characterized by low contrast or contain repetitive patterns, occlusions, or homogeneous textures. In this paper, a novel feature matching algorithm based on graph theory is proposed. This algorithm integrates both geometric and radiometric constraints into an edge-weighted (EW) affinity tensor. Tie points are then obtained by high-order graph matching. Four pairs of poor textural images covering forests, deserts, bare lands, and urban areas are tested. For comparison, three state-of-the-art matching techniques, namely, scale-invariant feature transform (SIFT), speeded up robust features (SURF), and features from accelerated segment test (FAST), are also used. The experimental results show that the matching recall obtained by SIFT, SURF, and FAST varies from 0 to 35% in different types of poor textures. However, through the integration of both geometry and radiometry and the EW strategy, the recall obtained by the proposed algorithm is better than 50% in all four image pairs. The better matching recall improves the number of correct matches, dispersion, and positional accuracy.

Adaptive method for electron bunch profile prediction

DOE PAGES

Scheinker, Alexander; Gessner, Spencer

2015-10-15

We report on an experiment performed at the Facility for Advanced Accelerator Experimental Tests (FACET) at SLAC National Accelerator Laboratory, in which a new adaptive control algorithm, one with known, bounded update rates, despite operating on analytically unknown cost functions, was utilized in order to provide quasi-real-time bunch property estimates of the electron beam. Multiple parameters, such as arbitrary rf phase settings and other time-varying accelerator properties, were simultaneously tuned in order to match a simulated bunch energy spectrum with a measured energy spectrum. Thus, the simple adaptive scheme was digitally implemented using matlab and the experimental physics and industrialmore » control system. Finally, the main result is a nonintrusive, nondestructive, real-time diagnostic scheme for prediction of bunch profiles, as well as other beam parameters, the precise control of which are important for the plasma wakefield acceleration experiments being explored at FACET.« less

Adaptive method for electron bunch profile prediction

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

Scheinker, Alexander; Gessner, Spencer

2015-10-01

We report on an experiment performed at the Facility for Advanced Accelerator Experimental Tests (FACET) at SLAC National Accelerator Laboratory, in which a new adaptive control algorithm, one with known, bounded update rates, despite operating on analytically unknown cost functions, was utilized in order to provide quasi-real-time bunch property estimates of the electron beam. Multiple parameters, such as arbitrary rf phase settings and other time-varying accelerator properties, were simultaneously tuned in order to match a simulated bunch energy spectrum with a measured energy spectrum. The simple adaptive scheme was digitally implemented using matlab and the experimental physics and industrial controlmore » system. The main result is a nonintrusive, nondestructive, real-time diagnostic scheme for prediction of bunch profiles, as well as other beam parameters, the precise control of which are important for the plasma wakefield acceleration experiments being explored at FACET. © 2015 authors. Published by the American Physical Society.« less

Quantum Experiments and Graphs: Multiparty States as Coherent Superpositions of Perfect Matchings.

PubMed

Krenn, Mario; Gu, Xuemei; Zeilinger, Anton

2017-12-15

We show a surprising link between experimental setups to realize high-dimensional multipartite quantum states and graph theory. In these setups, the paths of photons are identified such that the photon-source information is never created. We find that each of these setups corresponds to an undirected graph, and every undirected graph corresponds to an experimental setup. Every term in the emerging quantum superposition corresponds to a perfect matching in the graph. Calculating the final quantum state is in the #P-complete complexity class, thus it cannot be done efficiently. To strengthen the link further, theorems from graph theory-such as Hall's marriage problem-are rephrased in the language of pair creation in quantum experiments. We show explicitly how this link allows one to answer questions about quantum experiments (such as which classes of entangled states can be created) with graph theoretical methods, and how to potentially simulate properties of graphs and networks with quantum experiments (such as critical exponents and phase transitions).

Quantum Experiments and Graphs: Multiparty States as Coherent Superpositions of Perfect Matchings

NASA Astrophysics Data System (ADS)

Krenn, Mario; Gu, Xuemei; Zeilinger, Anton

2017-12-01

We show a surprising link between experimental setups to realize high-dimensional multipartite quantum states and graph theory. In these setups, the paths of photons are identified such that the photon-source information is never created. We find that each of these setups corresponds to an undirected graph, and every undirected graph corresponds to an experimental setup. Every term in the emerging quantum superposition corresponds to a perfect matching in the graph. Calculating the final quantum state is in the #P-complete complexity class, thus it cannot be done efficiently. To strengthen the link further, theorems from graph theory—such as Hall's marriage problem—are rephrased in the language of pair creation in quantum experiments. We show explicitly how this link allows one to answer questions about quantum experiments (such as which classes of entangled states can be created) with graph theoretical methods, and how to potentially simulate properties of graphs and networks with quantum experiments (such as critical exponents and phase transitions).

Matched signal detection on graphs: Theory and application to brain imaging data classification.

PubMed

Hu, Chenhui; Sepulcre, Jorge; Johnson, Keith A; Fakhri, Georges E; Lu, Yue M; Li, Quanzheng

2016-01-15

Motivated by recent progress in signal processing on graphs, we have developed a matched signal detection (MSD) theory for signals with intrinsic structures described by weighted graphs. First, we regard graph Laplacian eigenvalues as frequencies of graph-signals and assume that the signal is in a subspace spanned by the first few graph Laplacian eigenvectors associated with lower eigenvalues. The conventional matched subspace detector can be applied to this case. Furthermore, we study signals that may not merely live in a subspace. Concretely, we consider signals with bounded variation on graphs and more general signals that are randomly drawn from a prior distribution. For bounded variation signals, the test is a weighted energy detector. For the random signals, the test statistic is the difference of signal variations on associated graphs, if a degenerate Gaussian distribution specified by the graph Laplacian is adopted. We evaluate the effectiveness of the MSD on graphs both with simulated and real data sets. Specifically, we apply MSD to the brain imaging data classification problem of Alzheimer's disease (AD) based on two independent data sets: 1) positron emission tomography data with Pittsburgh compound-B tracer of 30 AD and 40 normal control (NC) subjects, and 2) resting-state functional magnetic resonance imaging (R-fMRI) data of 30 early mild cognitive impairment and 20 NC subjects. Our results demonstrate that the MSD approach is able to outperform the traditional methods and help detect AD at an early stage, probably due to the success of exploiting the manifold structure of the data. Copyright © 2015. Published by Elsevier Inc.

Searching social networks for subgraph patterns

NASA Astrophysics Data System (ADS)

Ogaard, Kirk; Kase, Sue; Roy, Heather; Nagi, Rakesh; Sambhoos, Kedar; Sudit, Moises

2013-06-01

Software tools for Social Network Analysis (SNA) are being developed which support various types of analysis of social networks extracted from social media websites (e.g., Twitter). Once extracted and stored in a database such social networks are amenable to analysis by SNA software. This data analysis often involves searching for occurrences of various subgraph patterns (i.e., graphical representations of entities and relationships). The authors have developed the Graph Matching Toolkit (GMT) which provides an intuitive Graphical User Interface (GUI) for a heuristic graph matching algorithm called the Truncated Search Tree (TruST) algorithm. GMT is a visual interface for graph matching algorithms processing large social networks. GMT enables an analyst to draw a subgraph pattern by using a mouse to select categories and labels for nodes and links from drop-down menus. GMT then executes the TruST algorithm to find the top five occurrences of the subgraph pattern within the social network stored in the database. GMT was tested using a simulated counter-insurgency dataset consisting of cellular phone communications within a populated area of operations in Iraq. The results indicated GMT (when executing the TruST graph matching algorithm) is a time-efficient approach to searching large social networks. GMT's visual interface to a graph matching algorithm enables intelligence analysts to quickly analyze and summarize the large amounts of data necessary to produce actionable intelligence.

Fingerprint recognition system by use of graph matching

NASA Astrophysics Data System (ADS)

Shen, Wei; Shen, Jun; Zheng, Huicheng

2001-09-01

Fingerprint recognition is an important subject in biometrics to identify or verify persons by physiological characteristics, and has found wide applications in different domains. In the present paper, we present a finger recognition system that combines singular points and structures. The principal steps of processing in our system are: preprocessing and ridge segmentation, singular point extraction and selection, graph representation, and finger recognition by graphs matching. Our fingerprint recognition system is implemented and tested for many fingerprint images and the experimental result are satisfactory. Different techniques are used in our system, such as fast calculation of orientation field, local fuzzy dynamical thresholding, algebraic analysis of connections and fingerprints representation and matching by graphs. Wed find that for fingerprint database that is not very large, the recognition rate is very high even without using a prior coarse category classification. This system works well for both one-to-few and one-to-many problems.

Browsing schematics: Query-filtered graphs with context nodes

NASA Technical Reports Server (NTRS)

Ciccarelli, Eugene C.; Nardi, Bonnie A.

1988-01-01

The early results of a research project to create tools for building interfaces to intelligent systems on the NASA Space Station are reported. One such tool is the Schematic Browser which helps users engaged in engineering problem solving find and select schematics from among a large set. Users query for schematics with certain components, and the Schematic Browser presents a graph whose nodes represent the schematics with those components. The query greatly reduces the number of choices presented to the user, filtering the graph to a manageable size. Users can reformulate and refine the query serially until they locate the schematics of interest. To help users maintain orientation as they navigate a large body of data, the graph also includes nodes that are not matches but provide global and local context for the matching nodes. Context nodes include landmarks, ancestors, siblings, children and previous matches.

Graph-Based Object Class Discovery

NASA Astrophysics Data System (ADS)

Xia, Shengping; Hancock, Edwin R.

We are interested in the problem of discovering the set of object classes present in a database of images using a weakly supervised graph-based framework. Rather than making use of the ”Bag-of-Features (BoF)” approach widely used in current work on object recognition, we represent each image by a graph using a group of selected local invariant features. Using local feature matching and iterative Procrustes alignment, we perform graph matching and compute a similarity measure. Borrowing the idea of query expansion , we develop a similarity propagation based graph clustering (SPGC) method. Using this method class specific clusters of the graphs can be obtained. Such a cluster can be generally represented by using a higher level graph model whose vertices are the clustered graphs, and the edge weights are determined by the pairwise similarity measure. Experiments are performed on a dataset, in which the number of images increases from 1 to 50K and the number of objects increases from 1 to over 500. Some objects have been discovered with total recall and a precision 1 in a single cluster.

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

Beaudoin, B.; Haber, I.; Kishek, R. A.

An induction cell has successfully been demonstrated to longitudinally confine a space-charge dominated bunch for over a thousand turns (>11.52 km) in the University of Maryland Electron Ring [Haber et al., Nucl. Instrum. Methods Phys. Res. A 606, 64 (2009) and R. A. Kishek et al., Int. J. Mod. Phys. A 22, 3838 (2007)]. With the use of synchronized periodic focusing fields, the beam is confined for multiple turns overcoming the longitudinal space-charge forces. Experimental results show that an optimum longitudinal match is obtained when the focusing frequency for containment of the 0.52 mA beam is applied at every fifthmore » turn. Containment of the beam bunch is achievable at lower focusing frequencies, at the cost of a reduction in the transported charge from the lack of sufficient focusing. Containment is also obtainable, if the confinement fields overfocus the bunch, exciting multiple waves at the bunch ends, which propagate into the central region of the beam, distorting the overall constant current beam shape.« less

Match graph generation for symbolic indirect correlation

NASA Astrophysics Data System (ADS)

Lopresti, Daniel; Nagy, George; Joshi, Ashutosh

2006-01-01

Symbolic indirect correlation (SIC) is a new approach for bringing lexical context into the recognition of unsegmented signals that represent words or phrases in printed or spoken form. One way of viewing the SIC problem is to find the correspondence, if one exists, between two bipartite graphs, one representing the matching of the two lexical strings and the other representing the matching of the two signal strings. While perfect matching cannot be expected with real-world signals and while some degree of mismatch is allowed for in the second stage of SIC, such errors, if they are too numerous, can present a serious impediment to a successful implementation of the concept. In this paper, we describe a framework for evaluating the effectiveness of SIC match graph generation and examine the relatively simple, controlled cases of synthetic images of text strings typeset, both normally and in highly condensed fashion. We quantify and categorize the errors that arise, as well as present a variety of techniques we have developed to visualize the intermediate results of the SIC process.

Bunching at the kink: implications for spending responses to health insurance contracts

PubMed Central

Einav, Liran; Finkelstein, Amy

2017-01-01

A large literature in empirical public finance relies on “bunching” to identify a behavioral response to non-linear incentives and to translate this response into an economic object to be used counterfactually. We conduct this type of analysis in the context of prescription drug insurance for the elderly in Medicare Part D, where a kink in the individual’s budget set generates substantial bunching in annual drug expenditure around the famous “donut hole”. We show that different alternative economic models can match the basic bunching pattern, but have very different quantitative implications for the counterfactual spending response to alternative insurance contracts. These findings illustrate the importance of modeling choices in mapping a compelling reduced form pattern into an economic object of interest. PMID:28785121

Topological visual mapping in robotics.

PubMed

Romero, Anna; Cazorla, Miguel

2012-08-01

A key problem in robotics is the construction of a map from its environment. This map could be used in different tasks, like localization, recognition, obstacle avoidance, etc. Besides, the simultaneous location and mapping (SLAM) problem has had a lot of interest in the robotics community. This paper presents a new method for visual mapping, using topological instead of metric information. For that purpose, we propose prior image segmentation into regions in order to group the extracted invariant features in a graph so that each graph defines a single region of the image. Although others methods have been proposed for visual SLAM, our method is complete, in the sense that it makes all the process: it presents a new method for image matching; it defines a way to build the topological map; and it also defines a matching criterion for loop-closing. The matching process will take into account visual features and their structure using the graph transformation matching (GTM) algorithm, which allows us to process the matching and to remove out the outliers. Then, using this image comparison method, we propose an algorithm for constructing topological maps. During the experimentation phase, we will test the robustness of the method and its ability constructing topological maps. We have also introduced new hysteresis behavior in order to solve some problems found building the graph.

Graph Matching: Relax at Your Own Risk.

PubMed

Lyzinski, Vince; Fishkind, Donniell E; Fiori, Marcelo; Vogelstein, Joshua T; Priebe, Carey E; Sapiro, Guillermo

2016-01-01

Graph matching-aligning a pair of graphs to minimize their edge disagreements-has received wide-spread attention from both theoretical and applied communities over the past several decades, including combinatorics, computer vision, and connectomics. Its attention can be partially attributed to its computational difficulty. Although many heuristics have previously been proposed in the literature to approximately solve graph matching, very few have any theoretical support for their performance. A common technique is to relax the discrete problem to a continuous problem, therefore enabling practitioners to bring gradient-descent-type algorithms to bear. We prove that an indefinite relaxation (when solved exactly) almost always discovers the optimal permutation, while a common convex relaxation almost always fails to discover the optimal permutation. These theoretical results suggest that initializing the indefinite algorithm with the convex optimum might yield improved practical performance. Indeed, experimental results illuminate and corroborate these theoretical findings, demonstrating that excellent results are achieved in both benchmark and real data problems by amalgamating the two approaches.

Projected power iteration for network alignment

NASA Astrophysics Data System (ADS)

Onaran, Efe; Villar, Soledad

2017-08-01

The network alignment problem asks for the best correspondence between two given graphs, so that the largest possible number of edges are matched. This problem appears in many scientific problems (like the study of protein-protein interactions) and it is very closely related to the quadratic assignment problem which has graph isomorphism, traveling salesman and minimum bisection problems as particular cases. The graph matching problem is NP-hard in general. However, under some restrictive models for the graphs, algorithms can approximate the alignment efficiently. In that spirit the recent work by Feizi and collaborators introduce EigenAlign, a fast spectral method with convergence guarantees for Erd-s-Renyí graphs. In this work we propose the algorithm Projected Power Alignment, which is a projected power iteration version of EigenAlign. We numerically show it improves the recovery rates of EigenAlign and we describe the theory that may be used to provide performance guarantees for Projected Power Alignment.

Efficient structure from motion for oblique UAV images based on maximal spanning tree expansion

NASA Astrophysics Data System (ADS)

Jiang, San; Jiang, Wanshou

2017-10-01

The primary contribution of this paper is an efficient Structure from Motion (SfM) solution for oblique unmanned aerial vehicle (UAV) images. First, an algorithm, considering spatial relationship constraints between image footprints, is designed for match pair selection with the assistance of UAV flight control data and oblique camera mounting angles. Second, a topological connection network (TCN), represented by an undirected weighted graph, is constructed from initial match pairs, which encodes the overlap areas and intersection angles into edge weights. Then, an algorithm, termed MST-Expansion, is proposed to extract the match graph from the TCN, where the TCN is first simplified by a maximum spanning tree (MST). By further analysis of the local structure in the MST, expansion operations are performed on the vertices of the MST for match graph enhancement, which is achieved by introducing critical connections in the expansion directions. Finally, guided by the match graph, an efficient SfM is proposed. Under extensive analysis and comparison, its performance is verified by using three oblique UAV datasets captured with different multi-camera systems. Experimental results demonstrate that the efficiency of image matching is improved, with speedup ratios ranging from 19 to 35, and competitive orientation accuracy is achieved from both relative bundle adjustment (BA) without GCPs (Ground Control Points) and absolute BA with GCPs. At the same time, images in the three datasets are successfully oriented. For the orientation of oblique UAV images, the proposed method can be a more efficient solution.

Claw-Free Maximal Planar Graphs

DTIC Science & Technology

1989-01-01

1976, 212-223. 110] M.D. Plummer, On n-extendable graphs, Discrete Math . 31, 1980, 201-210. 1111 , A theorem on matchings in the plane, Graph Theory...in Memory of G.A. Dirac, Ann. Discrete Math . 41, North-Holland, Amsterdam, 1989, 347-354. 1121 N. Sbihi, Algorithme de recherche d’un stable de...cardinalitA maximum dans un graphe sans 6toile, Discrete Math . 29, 1980, 53-76. 1131 D. Sumner, On Tutte’s factorization theorem, Graphs and Combinatorics

A Phase Matching, Adiabatic Accelerator

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

Lemery, Francois; Flöttmann, Klaus; Kärtner, Franz

2017-05-01

Tabletop accelerators are a thing of the future. Reducing their size will require scaling down electromagnetic wavelengths; however, without correspondingly high field gradients, particles will be more susceptible to phase-slippage – especially at low energy. We investigate how an adiabatically-tapered dielectric-lined waveguide could maintain phase-matching between the accelerating mode and electron bunch. We benchmark our simple model with CST and implement it into ASTRA; finally we provide a first glimpse into the beam dynamics in a phase-matching accelerator.

On Parallel Push-Relabel based Algorithms for Bipartite Maximum Matching

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

Langguth, Johannes; Azad, Md Ariful; Halappanavar, Mahantesh

2014-07-01

We study multithreaded push-relabel based algorithms for computing maximum cardinality matching in bipartite graphs. Matching is a fundamental combinatorial (graph) problem with applications in a wide variety of problems in science and engineering. We are motivated by its use in the context of sparse linear solvers for computing maximum transversal of a matrix. We implement and test our algorithms on several multi-socket multicore systems and compare their performance to state-of-the-art augmenting path-based serial and parallel algorithms using a testset comprised of a wide range of real-world instances. Building on several heuristics for enhancing performance, we demonstrate good scaling for themore » parallel push-relabel algorithm. We show that it is comparable to the best augmenting path-based algorithms for bipartite matching. To the best of our knowledge, this is the first extensive study of multithreaded push-relabel based algorithms. In addition to a direct impact on the applications using matching, the proposed algorithmic techniques can be extended to preflow-push based algorithms for computing maximum flow in graphs.« less

Alignment of Tractograms As Graph Matching.

PubMed

Olivetti, Emanuele; Sharmin, Nusrat; Avesani, Paolo

2016-01-01

The white matter pathways of the brain can be reconstructed as 3D polylines, called streamlines, through the analysis of diffusion magnetic resonance imaging (dMRI) data. The whole set of streamlines is called tractogram and represents the structural connectome of the brain. In multiple applications, like group-analysis, segmentation, or atlasing, tractograms of different subjects need to be aligned. Typically, this is done with registration methods, that transform the tractograms in order to increase their similarity. In contrast with transformation-based registration methods, in this work we propose the concept of tractogram correspondence, whose aim is to find which streamline of one tractogram corresponds to which streamline in another tractogram, i.e., a map from one tractogram to another. As a further contribution, we propose to use the relational information of each streamline, i.e., its distances from the other streamlines in its own tractogram, as the building block to define the optimal correspondence. We provide an operational procedure to find the optimal correspondence through a combinatorial optimization problem and we discuss its similarity to the graph matching problem. In this work, we propose to represent tractograms as graphs and we adopt a recent inexact sub-graph matching algorithm to approximate the solution of the tractogram correspondence problem. On tractograms generated from the Human Connectome Project dataset, we report experimental evidence that tractogram correspondence, implemented as graph matching, provides much better alignment than affine registration and comparable if not better results than non-linear registration of volumes.

Characterization of pseudosingle bunch kick-and-cancel operational mode

DOE PAGES

Sun, C.; Robin, D. S.; Steier, C.; ...

2015-12-18

Pseudosingle-bunch kick-and-cancel (PSB-KAC) is a new operational mode at the Advanced Light Source of Lawrence Berkeley National Laboratory that provides full timing and repetition rate control for single x-ray pulse users while being fully transparent to other users of synchrotron radiation light. In this operational mode, a single electron bunch is periodically displaced from a main bunch train by a fast kicker magnet with a user-on-demand repetition rate, creating a single x-ray pulse to be matched to a typical laser excitation pulse rate. This operational mode can significantly improve the signal to noise ratio of single x-ray pulse experiments andmore » drastically reduce dose-induced sample damage rate. It greatly expands the capabilities of synchrotron light sources to carry out dynamics and time-of-flight experiments. In this paper, we carry out extensive characterizations of this PSB-KAC mode both numerically and experimentally. This includes the working principle of this mode, resonance conditions and beam stability, experimental setups, and diagnostic tools and measurements.« less

Empirical Determination of Pattern Match Confidence in Labeled Graphs

DTIC Science & Technology

2014-02-07

were explored; Erdős–Rényi [6] random graphs, Barabási–Albert preferential attachment graphs [2], and Watts– Strogatz [18] small world graphs. The ER...B. Erdos - Renyi Barabasi - Albert Gr ap h Ty pe Strogatz - Watts Direct Within 2 nodes Within 4 nodes Search Limit 1 10 100 1000 10000 100000 100...Barabási–Albert (BA, crosses) and Watts– Strogatz (WS, trian- gles) graphs were generated with sizes ranging from 50 to 2500 nodes, and labeled

FOCUSR: Feature Oriented Correspondence using Spectral Regularization–A Method for Precise Surface Matching

PubMed Central

Lombaert, Herve; Grady, Leo; Polimeni, Jonathan R.; Cheriet, Farida

2013-01-01

Existing methods for surface matching are limited by the trade-off between precision and computational efficiency. Here we present an improved algorithm for dense vertex-to-vertex correspondence that uses direct matching of features defined on a surface and improves it by using spectral correspondence as a regularization. This algorithm has the speed of both feature matching and spectral matching while exhibiting greatly improved precision (distance errors of 1.4%). The method, FOCUSR, incorporates implicitly such additional features to calculate the correspondence and relies on the smoothness of the lowest-frequency harmonics of a graph Laplacian to spatially regularize the features. In its simplest form, FOCUSR is an improved spectral correspondence method that nonrigidly deforms spectral embeddings. We provide here a full realization of spectral correspondence where virtually any feature can be used as additional information using weights on graph edges, but also on graph nodes and as extra embedded coordinates. As an example, the full power of FOCUSR is demonstrated in a real case scenario with the challenging task of brain surface matching across several individuals. Our results show that combining features and regularizing them in a spectral embedding greatly improves the matching precision (to a sub-millimeter level) while performing at much greater speed than existing methods. PMID:23868776

DOGMA: A Disk-Oriented Graph Matching Algorithm for RDF Databases

NASA Astrophysics Data System (ADS)

Bröcheler, Matthias; Pugliese, Andrea; Subrahmanian, V. S.

RDF is an increasingly important paradigm for the representation of information on the Web. As RDF databases increase in size to approach tens of millions of triples, and as sophisticated graph matching queries expressible in languages like SPARQL become increasingly important, scalability becomes an issue. To date, there is no graph-based indexing method for RDF data where the index was designed in a way that makes it disk-resident. There is therefore a growing need for indexes that can operate efficiently when the index itself resides on disk. In this paper, we first propose the DOGMA index for fast subgraph matching on disk and then develop a basic algorithm to answer queries over this index. This algorithm is then significantly sped up via an optimized algorithm that uses efficient (but correct) pruning strategies when combined with two different extensions of the index. We have implemented a preliminary system and tested it against four existing RDF database systems developed by others. Our experiments show that our algorithm performs very well compared to these systems, with orders of magnitude improvements for complex graph queries.

Metric learning with spectral graph convolutions on brain connectivity networks.

PubMed

Ktena, Sofia Ira; Parisot, Sarah; Ferrante, Enzo; Rajchl, Martin; Lee, Matthew; Glocker, Ben; Rueckert, Daniel

2018-04-01

Graph representations are often used to model structured data at an individual or population level and have numerous applications in pattern recognition problems. In the field of neuroscience, where such representations are commonly used to model structural or functional connectivity between a set of brain regions, graphs have proven to be of great importance. This is mainly due to the capability of revealing patterns related to brain development and disease, which were previously unknown. Evaluating similarity between these brain connectivity networks in a manner that accounts for the graph structure and is tailored for a particular application is, however, non-trivial. Most existing methods fail to accommodate the graph structure, discarding information that could be beneficial for further classification or regression analyses based on these similarities. We propose to learn a graph similarity metric using a siamese graph convolutional neural network (s-GCN) in a supervised setting. The proposed framework takes into consideration the graph structure for the evaluation of similarity between a pair of graphs, by employing spectral graph convolutions that allow the generalisation of traditional convolutions to irregular graphs and operates in the graph spectral domain. We apply the proposed model on two datasets: the challenging ABIDE database, which comprises functional MRI data of 403 patients with autism spectrum disorder (ASD) and 468 healthy controls aggregated from multiple acquisition sites, and a set of 2500 subjects from UK Biobank. We demonstrate the performance of the method for the tasks of classification between matching and non-matching graphs, as well as individual subject classification and manifold learning, showing that it leads to significantly improved results compared to traditional methods. Copyright © 2017 Elsevier Inc. All rights reserved.

Multiple Semantic Matching on Augmented N-partite Graph for Object Co-segmentation.

PubMed

Wang, Chuan; Zhang, Hua; Yang, Liang; Cao, Xiaochun; Xiong, Hongkai

2017-09-08

Recent methods for object co-segmentation focus on discovering single co-occurring relation of candidate regions representing the foreground of multiple images. However, region extraction based only on low and middle level information often occupies a large area of background without the help of semantic context. In addition, seeking single matching solution very likely leads to discover local parts of common objects. To cope with these deficiencies, we present a new object cosegmentation framework, which takes advantages of semantic information and globally explores multiple co-occurring matching cliques based on an N-partite graph structure. To this end, we first propose to incorporate candidate generation with semantic context. Based on the regions extracted from semantic segmentation of each image, we design a merging mechanism to hierarchically generate candidates with high semantic responses. Secondly, all candidates are taken into consideration to globally formulate multiple maximum weighted matching cliques, which complements the discovery of part of the common objects induced by a single clique. To facilitate the discovery of multiple matching cliques, an N-partite graph, which inherently excludes intralinks between candidates from the same image, is constructed to separate multiple cliques without additional constraints. Further, we augment the graph with an additional virtual node in each part to handle irrelevant matches when the similarity between two candidates is too small. Finally, with the explored multiple cliques, we statistically compute pixel-wise co-occurrence map for each image. Experimental results on two benchmark datasets, i.e., iCoseg and MSRC datasets, achieve desirable performance and demonstrate the effectiveness of our proposed framework.

Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting

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

Azad, Ariful; Buluc, Aydn; Pothen, Alex

It is difficult to obtain high performance when computing matchings on parallel processors because matching algorithms explicitly or implicitly search for paths in the graph, and when these paths become long, there is little concurrency. In spite of this limitation, we present a new algorithm and its shared-memory parallelization that achieves good performance and scalability in computing maximum cardinality matchings in bipartite graphs. This algorithm searches for augmenting paths via specialized breadth-first searches (BFS) from multiple source vertices, hence creating more parallelism than single source algorithms. Algorithms that employ multiple-source searches cannot discard a search tree once no augmenting pathmore » is discovered from the tree, unlike algorithms that rely on single-source searches. We describe a novel tree-grafting method that eliminates most of the redundant edge traversals resulting from this property of multiple-source searches. We also employ the recent direction-optimizing BFS algorithm as a subroutine to discover augmenting paths faster. Our algorithm compares favorably with the current best algorithms in terms of the number of edges traversed, the average augmenting path length, and the number of iterations. Here, we provide a proof of correctness for our algorithm. Our NUMA-aware implementation is scalable to 80 threads of an Intel multiprocessor and to 240 threads on an Intel Knights Corner coprocessor. On average, our parallel algorithm runs an order of magnitude faster than the fastest algorithms available. The performance improvement is more significant on graphs with small matching number.« less

Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting

DOE PAGES

Azad, Ariful; Buluc, Aydn; Pothen, Alex

2016-03-24

It is difficult to obtain high performance when computing matchings on parallel processors because matching algorithms explicitly or implicitly search for paths in the graph, and when these paths become long, there is little concurrency. In spite of this limitation, we present a new algorithm and its shared-memory parallelization that achieves good performance and scalability in computing maximum cardinality matchings in bipartite graphs. This algorithm searches for augmenting paths via specialized breadth-first searches (BFS) from multiple source vertices, hence creating more parallelism than single source algorithms. Algorithms that employ multiple-source searches cannot discard a search tree once no augmenting pathmore » is discovered from the tree, unlike algorithms that rely on single-source searches. We describe a novel tree-grafting method that eliminates most of the redundant edge traversals resulting from this property of multiple-source searches. We also employ the recent direction-optimizing BFS algorithm as a subroutine to discover augmenting paths faster. Our algorithm compares favorably with the current best algorithms in terms of the number of edges traversed, the average augmenting path length, and the number of iterations. Here, we provide a proof of correctness for our algorithm. Our NUMA-aware implementation is scalable to 80 threads of an Intel multiprocessor and to 240 threads on an Intel Knights Corner coprocessor. On average, our parallel algorithm runs an order of magnitude faster than the fastest algorithms available. The performance improvement is more significant on graphs with small matching number.« less

FPFH-based graph matching for 3D point cloud registration

NASA Astrophysics Data System (ADS)

Zhao, Jiapeng; Li, Chen; Tian, Lihua; Zhu, Jihua

2018-04-01

Correspondence detection is a vital step in point cloud registration and it can help getting a reliable initial alignment. In this paper, we put forward an advanced point feature-based graph matching algorithm to solve the initial alignment problem of rigid 3D point cloud registration with partial overlap. Specifically, Fast Point Feature Histograms are used to determine the initial possible correspondences firstly. Next, a new objective function is provided to make the graph matching more suitable for partially overlapping point cloud. The objective function is optimized by the simulated annealing algorithm for final group of correct correspondences. Finally, we present a novel set partitioning method which can transform the NP-hard optimization problem into a O(n3)-solvable one. Experiments on the Stanford and UWA public data sets indicates that our method can obtain better result in terms of both accuracy and time cost compared with other point cloud registration methods.

An image understanding system using attributed symbolic representation and inexact graph-matching

NASA Astrophysics Data System (ADS)

Eshera, M. A.; Fu, K.-S.

1986-09-01

A powerful image understanding system using a semantic-syntactic representation scheme consisting of attributed relational graphs (ARGs) is proposed for the analysis of the global information content of images. A multilayer graph transducer scheme performs the extraction of ARG representations from images, with ARG nodes representing the global image features, and the relations between features represented by the attributed branches between corresponding nodes. An efficient dynamic programming technique is employed to derive the distance between two ARGs and the inexact matching of their respective components. Noise, distortion and ambiguity in real-world images are handled through modeling in the transducer mapping rules and through the appropriate cost of error-transformation for the inexact matching of the representation. The system is demonstrated for the case of locating objects in a scene composed of complex overlapped objects, and the case of target detection in noisy and distorted synthetic aperture radar image.

Efficient Approximation Algorithms for Weighted $b$-Matching

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

Khan, Arif; Pothen, Alex; Mostofa Ali Patwary, Md.

2016-01-01

We describe a half-approximation algorithm, b-Suitor, for computing a b-Matching of maximum weight in a graph with weights on the edges. b-Matching is a generalization of the well-known Matching problem in graphs, where the objective is to choose a subset of M edges in the graph such that at most a specified number b(v) of edges in M are incident on each vertex v. Subject to this restriction we maximize the sum of the weights of the edges in M. We prove that the b-Suitor algorithm computes the same b-Matching as the one obtained by the greedy algorithm for themore » problem. We implement the algorithm on serial and shared-memory parallel processors, and compare its performance against a collection of approximation algorithms that have been proposed for the Matching problem. Our results show that the b-Suitor algorithm outperforms the Greedy and Locally Dominant edge algorithms by one to two orders of magnitude on a serial processor. The b-Suitor algorithm has a high degree of concurrency, and it scales well up to 240 threads on a shared memory multiprocessor. The b-Suitor algorithm outperforms the Locally Dominant edge algorithm by a factor of fourteen on 16 cores of an Intel Xeon multiprocessor.« less

Building dynamic population graph for accurate correspondence detection.

PubMed

Du, Shaoyi; Guo, Yanrong; Sanroma, Gerard; Ni, Dong; Wu, Guorong; Shen, Dinggang

2015-12-01

In medical imaging studies, there is an increasing trend for discovering the intrinsic anatomical difference across individual subjects in a dataset, such as hand images for skeletal bone age estimation. Pair-wise matching is often used to detect correspondences between each individual subject and a pre-selected model image with manually-placed landmarks. However, the large anatomical variability across individual subjects can easily compromise such pair-wise matching step. In this paper, we present a new framework to simultaneously detect correspondences among a population of individual subjects, by propagating all manually-placed landmarks from a small set of model images through a dynamically constructed image graph. Specifically, we first establish graph links between models and individual subjects according to pair-wise shape similarity (called as forward step). Next, we detect correspondences for the individual subjects with direct links to any of model images, which is achieved by a new multi-model correspondence detection approach based on our recently-published sparse point matching method. To correct those inaccurate correspondences, we further apply an error detection mechanism to automatically detect wrong correspondences and then update the image graph accordingly (called as backward step). After that, all subject images with detected correspondences are included into the set of model images, and the above two steps of graph expansion and error correction are repeated until accurate correspondences for all subject images are established. Evaluations on real hand X-ray images demonstrate that our proposed method using a dynamic graph construction approach can achieve much higher accuracy and robustness, when compared with the state-of-the-art pair-wise correspondence detection methods as well as a similar method but using static population graph. Copyright © 2015 Elsevier B.V. All rights reserved.

Model-based morphological segmentation and labeling of coronary angiograms.

PubMed

Haris, K; Efstratiadis, S N; Maglaveras, N; Pappas, C; Gourassas, J; Louridas, G

1999-10-01

A method for extraction and labeling of the coronary arterial tree (CAT) using minimal user supervision in single-view angiograms is proposed. The CAT structural description (skeleton and borders) is produced, along with quantitative information for the artery dimensions and assignment of coded labels, based on a given coronary artery model represented by a graph. The stages of the method are: 1) CAT tracking and detection; 2) artery skeleton and border estimation; 3) feature graph creation; and iv) artery labeling by graph matching. The approximate CAT centerline and borders are extracted by recursive tracking based on circular template analysis. The accurate skeleton and borders of each CAT segment are computed, based on morphological homotopy modification and watershed transform. The approximate centerline and borders are used for constructing the artery segment enclosing area (ASEA), where the defined skeleton and border curves are considered as markers. Using the marked ASEA, an artery gradient image is constructed where all the ASEA pixels (except the skeleton ones) are assigned the gradient magnitude of the original image. The artery gradient image markers are imposed as its unique regional minima by the homotopy modification method, the watershed transform is used for extracting the artery segment borders, and the feature graph is updated. Finally, given the created feature graph and the known model graph, a graph matching algorithm assigns the appropriate labels to the extracted CAT using weighted maximal cliques on the association graph corresponding to the two given graphs. Experimental results using clinical digitized coronary angiograms are presented.

Visual Odometry Based on Structural Matching of Local Invariant Features Using Stereo Camera Sensor

PubMed Central

Núñez, Pedro; Vázquez-Martín, Ricardo; Bandera, Antonio

2011-01-01

This paper describes a novel sensor system to estimate the motion of a stereo camera. Local invariant image features are matched between pairs of frames and linked into image trajectories at video rate, providing the so-called visual odometry, i.e., motion estimates from visual input alone. Our proposal conducts two matching sessions: the first one between sets of features associated to the images of the stereo pairs and the second one between sets of features associated to consecutive frames. With respect to previously proposed approaches, the main novelty of this proposal is that both matching algorithms are conducted by means of a fast matching algorithm which combines absolute and relative feature constraints. Finding the largest-valued set of mutually consistent matches is equivalent to finding the maximum-weighted clique on a graph. The stereo matching allows to represent the scene view as a graph which emerge from the features of the accepted clique. On the other hand, the frame-to-frame matching defines a graph whose vertices are features in 3D space. The efficiency of the approach is increased by minimizing the geometric and algebraic errors to estimate the final displacement of the stereo camera between consecutive acquired frames. The proposed approach has been tested for mobile robotics navigation purposes in real environments and using different features. Experimental results demonstrate the performance of the proposal, which could be applied in both industrial and service robot fields. PMID:22164016

Computing quality scores and uncertainty for approximate pattern matching in geospatial semantic graphs

DOE PAGES

Stracuzzi, David John; Brost, Randolph C.; Phillips, Cynthia A.; ...

2015-09-26

Geospatial semantic graphs provide a robust foundation for representing and analyzing remote sensor data. In particular, they support a variety of pattern search operations that capture the spatial and temporal relationships among the objects and events in the data. However, in the presence of large data corpora, even a carefully constructed search query may return a large number of unintended matches. This work considers the problem of calculating a quality score for each match to the query, given that the underlying data are uncertain. As a result, we present a preliminary evaluation of three methods for determining both match qualitymore » scores and associated uncertainty bounds, illustrated in the context of an example based on overhead imagery data.« less

Matching and Vertex Packing: How Hard Are They?

DTIC Science & Technology

1991-01-01

Theory, 29, Ann. Discrete Math ., North-Holland, Amsterdam, 1986. [2] M.D. Plummer, Matching theory - a sampler: from D~nes K~nig to the present...Ser. B, 28, 1980, 284-304. [20i N. Sbihi, Algorithme de recherche d’un stable de cardinalit6 maximum dans un graphe sans 6toile, Discrete Math ., 29...cliques and by finite families of graphs, Discrete Math ., 49, 1984, 45-59. [92] G. Cornu~jols, D. Hartvigsen and W.R. Pulleyblank, Packing subgraphs in

An Integrated Ransac and Graph Based Mismatch Elimination Approach for Wide-Baseline Image Matching

NASA Astrophysics Data System (ADS)

Hasheminasab, M.; Ebadi, H.; Sedaghat, A.

2015-12-01

In this paper we propose an integrated approach in order to increase the precision of feature point matching. Many different algorithms have been developed as to optimizing the short-baseline image matching while because of illumination differences and viewpoints changes, wide-baseline image matching is so difficult to handle. Fortunately, the recent developments in the automatic extraction of local invariant features make wide-baseline image matching possible. The matching algorithms which are based on local feature similarity principle, using feature descriptor as to establish correspondence between feature point sets. To date, the most remarkable descriptor is the scale-invariant feature transform (SIFT) descriptor , which is invariant to image rotation and scale, and it remains robust across a substantial range of affine distortion, presence of noise, and changes in illumination. The epipolar constraint based on RANSAC (random sample consensus) method is a conventional model for mismatch elimination, particularly in computer vision. Because only the distance from the epipolar line is considered, there are a few false matches in the selected matching results based on epipolar geometry and RANSAC. Aguilariu et al. proposed Graph Transformation Matching (GTM) algorithm to remove outliers which has some difficulties when the mismatched points surrounded by the same local neighbor structure. In this study to overcome these limitations, which mentioned above, a new three step matching scheme is presented where the SIFT algorithm is used to obtain initial corresponding point sets. In the second step, in order to reduce the outliers, RANSAC algorithm is applied. Finally, to remove the remained mismatches, based on the adjacent K-NN graph, the GTM is implemented. Four different close range image datasets with changes in viewpoint are utilized to evaluate the performance of the proposed method and the experimental results indicate its robustness and capability.

Plasma wakefield acceleration experiments at FACET II

NASA Astrophysics Data System (ADS)

Joshi, C.; Adli, E.; An, W.; Clayton, C. E.; Corde, S.; Gessner, S.; Hogan, M. J.; Litos, M.; Lu, W.; Marsh, K. A.; Mori, W. B.; Vafaei-Najafabadi, N.; O'shea, B.; Xu, Xinlu; White, G.; Yakimenko, V.

2018-03-01

During the past two decades of research, the ultra-relativistic beam-driven plasma wakefield accelerator (PWFA) concept has achieved many significant milestones. These include the demonstration of ultra-high gradient acceleration of electrons over meter-scale plasma accelerator structures, efficient acceleration of a narrow energy spread electron bunch at high-gradients, positron acceleration using wakes in uniform plasmas and in hollow plasma channels, and demonstrating that highly nonlinear wakes in the ‘blow-out regime’ have the electric field structure necessary for preserving the emittance of the accelerating bunch. A new 10 GeV electron beam facility, Facilities for Accelerator Science and Experimental Test (FACET) II, is currently under construction at SLAC National Accelerator Laboratory for the next generation of PWFA research and development. The FACET II beams will enable the simultaneous demonstration of substantial energy gain of a small emittance electron bunch while demonstrating an efficient transfer of energy from the drive to the trailing bunch. In this paper we first describe the capabilities of the FACET II facility. We then describe a series of PWFA experiments supported by numerical and particle-in-cell simulations designed to demonstrate plasma wake generation where the drive beam is nearly depleted of its energy, high efficiency acceleration of the trailing bunch while doubling its energy and ultimately, quantifying the emittance growth in a single stage of a PWFA that has optimally designed matching sections. We then briefly discuss other FACET II plasma-based experiments including in situ positron generation and acceleration, and several schemes that are promising for generating sub-micron emittance bunches that will ultimately be needed for both an early application of a PWFA and for a plasma-based future linear collider.

Plasma wakefield acceleration experiments at FACET II

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

Joshi, C.; Adli, E.; An, W.

During the past two decades of research, the ultra-relativistic beam-driven plasma wakefield accelerator (PWFA) concept has achieved many significant milestones. These include the demonstration of ultra-high gradient acceleration of electrons over meter-scale plasma accelerator structures, efficient acceleration of a narrow energy spread electron bunch at high-gradients, positron acceleration using wakes in uniform plasmas and in hollow plasma channels, and demonstrating that highly nonlinear wakes in the 'blow-out regime' have the electric field structure necessary for preserving the emittance of the accelerating bunch. A new 10 GeV electron beam facility, Facilities for Accelerator Science and Experimental Test (FACET) II, is currentlymore » under construction at SLAC National Accelerator Laboratory for the next generation of PWFA research and development. The FACET II beams will enable the simultaneous demonstration of substantial energy gain of a small emittance electron bunch while demonstrating an efficient transfer of energy from the drive to the trailing bunch. In this paper we first describe the capabilities of the FACET II facility. We then describe a series of PWFA experiments supported by numerical and particle-in-cell simulations designed to demonstrate plasma wake generation where the drive beam is nearly depleted of its energy, high efficiency acceleration of the trailing bunch while doubling its energy and ultimately, quantifying the emittance growth in a single stage of a PWFA that has optimally designed matching sections. Here, we briefly discuss other FACET II plasma-based experiments including in situ positron generation and acceleration, and several schemes that are promising for generating sub-micron emittance bunches that will ultimately be needed for both an early application of a PWFA and for a plasma-based future linear collider.« less

Plasma wakefield acceleration experiments at FACET II

DOE PAGES

Joshi, C.; Adli, E.; An, W.; ...

2018-01-12

During the past two decades of research, the ultra-relativistic beam-driven plasma wakefield accelerator (PWFA) concept has achieved many significant milestones. These include the demonstration of ultra-high gradient acceleration of electrons over meter-scale plasma accelerator structures, efficient acceleration of a narrow energy spread electron bunch at high-gradients, positron acceleration using wakes in uniform plasmas and in hollow plasma channels, and demonstrating that highly nonlinear wakes in the 'blow-out regime' have the electric field structure necessary for preserving the emittance of the accelerating bunch. A new 10 GeV electron beam facility, Facilities for Accelerator Science and Experimental Test (FACET) II, is currentlymore » under construction at SLAC National Accelerator Laboratory for the next generation of PWFA research and development. The FACET II beams will enable the simultaneous demonstration of substantial energy gain of a small emittance electron bunch while demonstrating an efficient transfer of energy from the drive to the trailing bunch. In this paper we first describe the capabilities of the FACET II facility. We then describe a series of PWFA experiments supported by numerical and particle-in-cell simulations designed to demonstrate plasma wake generation where the drive beam is nearly depleted of its energy, high efficiency acceleration of the trailing bunch while doubling its energy and ultimately, quantifying the emittance growth in a single stage of a PWFA that has optimally designed matching sections. Here, we briefly discuss other FACET II plasma-based experiments including in situ positron generation and acceleration, and several schemes that are promising for generating sub-micron emittance bunches that will ultimately be needed for both an early application of a PWFA and for a plasma-based future linear collider.« less

Analysis of the LSC microbunching instability in MaRIE linac reference design

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

Yampolsky, Nikolai

In this report we estimate the effect of the microbunching instability in the MaRIE XFEL linac. The reference design for the linac is described in a separate report. The parameters of the L1, L2, and L3 linacs as well as BC1 and BC2 bunch compressors were the same as in the referenced report. The beam dynamics was assumed to be linear along the accelerator (which is a reasonable assumption for estimating the effect of the microbunching instability). The parameters of the bunch also match the parameters described in the referenced report. Additionally, it was assumed that the beam radius ismore » equal to R = 100 m and does not change along linac. This assumption needs to be revisited at later studies. The beam dynamics during acceleration was accounted in the matrix formalism using a Matlab code. The input parameters for the linacs are: RF peak gradient, RF frequency, RF phase, linac length, and initial beam energy. The energy gain and the imposed chirp are calculated based on the RF parameters self-consistently. The bunch compressors are accounted in the matrix formalism as well. Each chicane is characterized by the beam energy and the R56 matrix element. It was confirmed that the linac and beam parameters described previously provide two-stage bunch compression with compression ratios of 10 and 20 resulting in the bunch of 3kA peak current.« less

Data Acquisition Based on Stable Matching of Bipartite Graph in Cooperative Vehicle–Infrastructure Systems †

PubMed Central

Tang, Xiaolan; Hong, Donghui; Chen, Wenlong

2017-01-01

Existing studies on data acquisition in vehicular networks often take the mobile vehicular nodes as data carriers. However, their autonomous movements, limited resources and security risks impact the quality of services. In this article, we propose a data acquisition model using stable matching of bipartite graph in cooperative vehicle-infrastructure systems, namely, DAS. Contents are distributed to roadside units, while vehicular nodes support supplementary storage. The original distribution problem is formulated as a stable matching problem of bipartite graph, where the data and the storage cells compose two sides of vertices. Regarding the factors relevant with the access ratio and delay, the preference rankings for contents and roadside units are calculated, respectively. With a multi-replica preprocessing algorithm to handle the potential one-to-many mapping, the matching problem is addressed in polynomial time. In addition, vehicular nodes carry and forward assistant contents to deliver the failed packets because of bandwidth competition. Furthermore, an incentive strategy is put forward to boost the vehicle cooperation and to achieve a fair bandwidth allocation at roadside units. Experiments show that DAS achieves a high access ratio and a small storage cost with an acceptable delay. PMID:28594359

Content based image retrieval for matching images of improvised explosive devices in which snake initialization is viewed as an inverse problem

NASA Astrophysics Data System (ADS)

Acton, Scott T.; Gilliam, Andrew D.; Li, Bing; Rossi, Adam

2008-02-01

Improvised explosive devices (IEDs) are common and lethal instruments of terrorism, and linking a terrorist entity to a specific device remains a difficult task. In the effort to identify persons associated with a given IED, we have implemented a specialized content based image retrieval system to search and classify IED imagery. The system makes two contributions to the art. First, we introduce a shape-based matching technique exploiting shape, color, and texture (wavelet) information, based on novel vector field convolution active contours and a novel active contour initialization method which treats coarse segmentation as an inverse problem. Second, we introduce a unique graph theoretic approach to match annotated printed circuit board images for which no schematic or connectivity information is available. The shape-based image retrieval method, in conjunction with the graph theoretic tool, provides an efficacious system for matching IED images. For circuit imagery, the basic retrieval mechanism has a precision of 82.1% and the graph based method has a precision of 98.1%. As of the fall of 2007, the working system has processed over 400,000 case images.

Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets

NASA Astrophysics Data System (ADS)

Hamilton, Kathleen E.; Humble, Travis S.

2017-04-01

Using quantum annealing to solve an optimization problem requires minor embedding a logic graph into a known hardware graph. In an effort to reduce the complexity of the minor embedding problem, we introduce the minor set cover (MSC) of a known graph G: a subset of graph minors which contain any remaining minor of the graph as a subgraph. Any graph that can be embedded into G will be embeddable into a member of the MSC. Focusing on embedding into the hardware graph of commercially available quantum annealers, we establish the MSC for a particular known virtual hardware, which is a complete bipartite graph. We show that the complete bipartite graph K_{N,N} has a MSC of N minors, from which K_{N+1} is identified as the largest clique minor of K_{N,N}. The case of determining the largest clique minor of hardware with faults is briefly discussed but remains an open question.

Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets

DOE PAGES

Hamilton, Kathleen E.; Humble, Travis S.

2017-02-23

Using quantum annealing to solve an optimization problem requires minor embedding a logic graph into a known hardware graph. We introduce the minor set cover (MSC) of a known graph GG : a subset of graph minors which contain any remaining minor of the graph as a subgraph, in an effort to reduce the complexity of the minor embedding problem. Any graph that can be embedded into GG will be embeddable into a member of the MSC. Focusing on embedding into the hardware graph of commercially available quantum annealers, we establish the MSC for a particular known virtual hardware, whichmore » is a complete bipartite graph. Furthermore, we show that the complete bipartite graph K N,N has a MSC of N minors, from which K N+1 is identified as the largest clique minor of K N,N. In the case of determining the largest clique minor of hardware with faults we briefly discussed this open question.« less

Graph configuration model based evaluation of the education-occupation match

PubMed Central

2018-01-01

To study education—occupation matchings we developed a bipartite network model of education to work transition and a graph configuration model based metric. We studied the career paths of 15 thousand Hungarian students based on the integrated database of the National Tax Administration, the National Health Insurance Fund, and the higher education information system of the Hungarian Government. A brief analysis of gender pay gap and the spatial distribution of over-education is presented to demonstrate the background of the research and the resulted open dataset. We highlighted the hierarchical and clustered structure of the career paths based on the multi-resolution analysis of the graph modularity. The results of the cluster analysis can support policymakers to fine-tune the fragmented program structure of higher education. PMID:29509783

Graph configuration model based evaluation of the education-occupation match.

PubMed

Gadar, Laszlo; Abonyi, Janos

2018-01-01

To study education-occupation matchings we developed a bipartite network model of education to work transition and a graph configuration model based metric. We studied the career paths of 15 thousand Hungarian students based on the integrated database of the National Tax Administration, the National Health Insurance Fund, and the higher education information system of the Hungarian Government. A brief analysis of gender pay gap and the spatial distribution of over-education is presented to demonstrate the background of the research and the resulted open dataset. We highlighted the hierarchical and clustered structure of the career paths based on the multi-resolution analysis of the graph modularity. The results of the cluster analysis can support policymakers to fine-tune the fragmented program structure of higher education.

1 / n Expansion for the Number of Matchings on Regular Graphs and Monomer-Dimer Entropy

NASA Astrophysics Data System (ADS)

Pernici, Mario

2017-08-01

Using a 1 / n expansion, that is an expansion in descending powers of n, for the number of matchings in regular graphs with 2 n vertices, we study the monomer-dimer entropy for two classes of graphs. We study the difference between the extensive monomer-dimer entropy of a random r-regular graph G (bipartite or not) with 2 n vertices and the average extensive entropy of r-regular graphs with 2 n vertices, in the limit n → ∞. We find a series expansion for it in the numbers of cycles; with probability 1 it converges for dimer density p < 1 and, for G bipartite, it diverges as |ln(1-p)| for p → 1. In the case of regular lattices, we similarly expand the difference between the specific monomer-dimer entropy on a lattice and the one on the Bethe lattice; we write down its Taylor expansion in powers of p through the order 10, expressed in terms of the number of totally reducible walks which are not tree-like. We prove through order 6 that its expansion coefficients in powers of p are non-negative.

Estimation of High-Dimensional Graphical Models Using Regularized Score Matching

PubMed Central

Lin, Lina; Drton, Mathias; Shojaie, Ali

2017-01-01

Graphical models are widely used to model stochastic dependences among large collections of variables. We introduce a new method of estimating undirected conditional independence graphs based on the score matching loss, introduced by Hyvärinen (2005), and subsequently extended in Hyvärinen (2007). The regularized score matching method we propose applies to settings with continuous observations and allows for computationally efficient treatment of possibly non-Gaussian exponential family models. In the well-explored Gaussian setting, regularized score matching avoids issues of asymmetry that arise when applying the technique of neighborhood selection, and compared to existing methods that directly yield symmetric estimates, the score matching approach has the advantage that the considered loss is quadratic and gives piecewise linear solution paths under ℓ1 regularization. Under suitable irrepresentability conditions, we show that ℓ1-regularized score matching is consistent for graph estimation in sparse high-dimensional settings. Through numerical experiments and an application to RNAseq data, we confirm that regularized score matching achieves state-of-the-art performance in the Gaussian case and provides a valuable tool for computationally efficient estimation in non-Gaussian graphical models. PMID:28638498

Resistance distance and Kirchhoff index in circulant graphs

NASA Astrophysics Data System (ADS)

Zhang, Heping; Yang, Yujun

The resistance distance rij between vertices i and j of a connected (molecular) graph G is computed as the effective resistance between nodes i and j in the corresponding network constructed from G by replacing each edge of G with a unit resistor. The Kirchhoff index Kf(G) is the sum of resistance distances between all pairs of vertices. In this work, closed-form formulae for Kirchhoff index and resistance distances of circulant graphs are derived in terms of Laplacian spectrum and eigenvectors. Special formulae are also given for four classes of circulant graphs (complete graphs, complete graphs minus a perfect matching, cycles, Möbius ladders Mp). In particular, the asymptotic behavior of Kf(Mp) as p ? ? is obtained, that is, Kf(Mp) grows as ⅙p3 as p ? ?.

Superpixel-based graph cuts for accurate stereo matching

NASA Astrophysics Data System (ADS)

Feng, Liting; Qin, Kaihuai

2017-06-01

Estimating the surface normal vector and disparity of a pixel simultaneously, also known as three-dimensional label method, has been widely used in recent continuous stereo matching problem to achieve sub-pixel accuracy. However, due to the infinite label space, it’s extremely hard to assign each pixel an appropriate label. In this paper, we present an accurate and efficient algorithm, integrating patchmatch with graph cuts, to approach this critical computational problem. Besides, to get robust and precise matching cost, we use a convolutional neural network to learn a similarity measure on small image patches. Compared with other MRF related methods, our method has several advantages: its sub-modular property ensures a sub-problem optimality which is easy to perform in parallel; graph cuts can simultaneously update multiple pixels, avoiding local minima caused by sequential optimizers like belief propagation; it uses segmentation results for better local expansion move; local propagation and randomization can easily generate the initial solution without using external methods. Middlebury experiments show that our method can get higher accuracy than other MRF-based algorithms.

Graph Matching for the Registration of Persistent Scatterers to Optical Oblique Imagery

NASA Astrophysics Data System (ADS)

Schack, L.; Soergel, U.; Heipke, C.

2016-06-01

Matching Persistent Scatterers (PS) to airborne optical imagery is one possibility to augment applications and deepen the understanding of SAR processing and products. While recently this data registration task was done with PS and optical nadir images the alternatively available optical oblique imagery is mostly neglected. Yet, the sensing geometry of oblique images is very similar in terms of viewing direction with respect to SAR.We exploit the additional information coming with these optical sensors to assign individual PS to single parts of buildings. The key idea is to incorporate topology information which is derived by grouping regularly aligned PS at facades and use it together with a geometry based measure in order to establish a consistent and meaningful matching result. We formulate this task as an optimization problem and derive a graph matching based algorithm with guaranteed convergence in order to solve it. Two exemplary case studies show the plausibility of the presented approach.

Labeled Graph Kernel for Behavior Analysis.

PubMed

Zhao, Ruiqi; Martinez, Aleix M

2016-08-01

Automatic behavior analysis from video is a major topic in many areas of research, including computer vision, multimedia, robotics, biology, cognitive science, social psychology, psychiatry, and linguistics. Two major problems are of interest when analyzing behavior. First, we wish to automatically categorize observed behaviors into a discrete set of classes (i.e., classification). For example, to determine word production from video sequences in sign language. Second, we wish to understand the relevance of each behavioral feature in achieving this classification (i.e., decoding). For instance, to know which behavior variables are used to discriminate between the words apple and onion in American Sign Language (ASL). The present paper proposes to model behavior using a labeled graph, where the nodes define behavioral features and the edges are labels specifying their order (e.g., before, overlaps, start). In this approach, classification reduces to a simple labeled graph matching. Unfortunately, the complexity of labeled graph matching grows exponentially with the number of categories we wish to represent. Here, we derive a graph kernel to quickly and accurately compute this graph similarity. This approach is very general and can be plugged into any kernel-based classifier. Specifically, we derive a Labeled Graph Support Vector Machine (LGSVM) and a Labeled Graph Logistic Regressor (LGLR) that can be readily employed to discriminate between many actions (e.g., sign language concepts). The derived approach can be readily used for decoding too, yielding invaluable information for the understanding of a problem (e.g., to know how to teach a sign language). The derived algorithms allow us to achieve higher accuracy results than those of state-of-the-art algorithms in a fraction of the time. We show experimental results on a variety of problems and datasets, including multimodal data.

A robust approach towards unknown transformation, regional adjacency graphs, multigraph matching, segmentation video frames from unnamed aerial vehicles (UAV)

NASA Astrophysics Data System (ADS)

Gohatre, Umakant Bhaskar; Patil, Venkat P.

2018-04-01

In computer vision application, the multiple object detection and tracking, in real-time operation is one of the important research field, that have gained a lot of attentions, in last few years for finding non stationary entities in the field of image sequence. The detection of object is advance towards following the moving object in video and then representation of object is step to track. The multiple object recognition proof is one of the testing assignment from detection multiple objects from video sequence. The picture enrollment has been for quite some time utilized as a reason for the location the detection of moving multiple objects. The technique of registration to discover correspondence between back to back casing sets in view of picture appearance under inflexible and relative change. The picture enrollment is not appropriate to deal with event occasion that can be result in potential missed objects. In this paper, for address such problems, designs propose novel approach. The divided video outlines utilizing area adjancy diagram of visual appearance and geometric properties. Then it performed between graph sequences by using multi graph matching, then getting matching region labeling by a proposed graph coloring algorithms which assign foreground label to respective region. The plan design is robust to unknown transformation with significant improvement in overall existing work which is related to moving multiple objects detection in real time parameters.

Relative Estimation of Water Content for Flat-Type Inductive-Based Oil Palm Fruit Maturity Sensor

PubMed Central

Misron, Norhisam; Aliteh, Nor Aziana; Harun, Noor Hasmiza; Tashiro, Kunihisa; Sato, Toshiro; Wakiwaka, Hiroyuki

2016-01-01

The paper aims to study the sensor that identifies the maturity of oil palm fruit bunches by using a flat-type inductive concept based on a resonant frequency technique. Conventionally, a human grader is used to inspect the ripeness of the oil palm fresh fruit bunch (FFB) which can be inconsistent and inaccurate. There are various new methods that are proposed with the intention to grade the ripeness of the oil palm FFB, but none has taken the inductive concept. In this study, the resonance frequency of the air coil is investigated. Samples of oil palm FFB are tested with frequencies ranging from 20 Hz to 10 MHz and the results obtained show a linear relationship between the graph of the resonance frequency (MHz) against time (Weeks). It is observed that the resonance frequencies obtained for Week 10 (pre-mature) and Week 18 (mature) are around 8.5 MHz and 9.8 MHz, respectively. These results are compared with the percentage of the moisture content. Hence, the inductive method of the oil palm fruit maturity sensor can be used to detect the change in water content for ripeness detection of the oil palm FFB. PMID:28036040

Relative Estimation of Water Content for Flat-Type Inductive-Based Oil Palm Fruit Maturity Sensor.

PubMed

Misron, Norhisam; Aliteh, Nor Aziana; Harun, Noor Hasmiza; Tashiro, Kunihisa; Sato, Toshiro; Wakiwaka, Hiroyuki

2016-12-28

The paper aims to study the sensor that identifies the maturity of oil palm fruit bunches by using a flat-type inductive concept based on a resonant frequency technique. Conventionally, a human grader is used to inspect the ripeness of the oil palm fresh fruit bunch (FFB) which can be inconsistent and inaccurate. There are various new methods that are proposed with the intention to grade the ripeness of the oil palm FFB, but none has taken the inductive concept. In this study, the resonance frequency of the air coil is investigated. Samples of oil palm FFB are tested with frequencies ranging from 20 Hz to 10 MHz and the results obtained show a linear relationship between the graph of the resonance frequency (MHz) against time (Weeks). It is observed that the resonance frequencies obtained for Week 10 (pre-mature) and Week 18 (mature) are around 8.5 MHz and 9.8 MHz, respectively. These results are compared with the percentage of the moisture content. Hence, the inductive method of the oil palm fruit maturity sensor can be used to detect the change in water content for ripeness detection of the oil palm FFB.

The SPARC_LAB femtosecond synchronization for electron and photon pulsed beams

NASA Astrophysics Data System (ADS)

Bellaveglia, M.; Gallo, A.; Piersanti, L.; Pompili, R.; Gatti, G.; Anania, M. P.; Petrarca, M.; Villa, F.; Chiadroni, E.; Biagioni, A.; Mostacci, A.

2015-05-01

The SPARC LAB complex hosts a 150 MeV electron photo-injector equipped with an undulator for FEL production (SPARC) together with a high power TW laser (FLAME). Recently the synchronization system reached the performance of < 100 fsRMS relative jitter between lasers, electron beam and RF accelerating fields. This matches the requirements for next future experiments: (i) the production of X-rays by means of Thomson scattering (first collisions achieved in 2014) and (ii) the particle driven PWFA experiment by means of multiple electron bunches. We report about the measurements taken during the machine operation using BAMs (Bunch Arrival Monitors) and EOS (Electro-Optical Sampling) system. A new R and D activity concerning the LWFA using the external injection of electron bunches in a plasma generated by the FLAME laser pulse is under design. The upgrade of the synchronization system is under way to guarantee the < 30 fs RMS jitter required specification. It foresees the transition from electrical to optical architecture that mainly affects the reference signal distribution and the time of arrival detection performances. The new system architecture is presented together with the related experimental data.

Predicting and Detecting Emerging Cyberattack Patterns Using StreamWorks

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

Chin, George; Choudhury, Sutanay; Feo, John T.

2014-06-30

The number and sophistication of cyberattacks on industries and governments have dramatically grown in recent years. To counter this movement, new advanced tools and techniques are needed to detect cyberattacks in their early stages such that defensive actions may be taken to avert or mitigate potential damage. From a cybersecurity analysis perspective, detecting cyberattacks may be cast as a problem of identifying patterns in computer network traffic. Logically and intuitively, these patterns may take on the form of a directed graph that conveys how an attack or intrusion propagates through the computers of a network. Such cyberattack graphs could providemore » cybersecurity analysts with powerful conceptual representations that are natural to express and analyze. We have been researching and developing graph-centric approaches and algorithms for dynamic cyberattack detection. The advanced dynamic graph algorithms we are developing will be packaged into a streaming network analysis framework known as StreamWorks. With StreamWorks, a scientist or analyst may detect and identify precursor events and patterns as they emerge in complex networks. This analysis framework is intended to be used in a dynamic environment where network data is streamed in and is appended to a large-scale dynamic graph. Specific graphical query patterns are decomposed and collected into a graph query library. The individual decomposed subpatterns in the library are continuously and efficiently matched against the dynamic graph as it evolves to identify and detect early, partial subgraph patterns. The scalable emerging subgraph pattern algorithms will match on both structural and semantic network properties.« less

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

PubMed

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

2017-01-01

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

Online graphic symbol recognition using neural network and ARG matching

NASA Astrophysics Data System (ADS)

Yang, Bing; Li, Changhua; Xie, Weixing

2001-09-01

This paper proposes a novel method for on-line recognition of line-based graphic symbol. The input strokes are usually warped into a cursive form due to the sundry drawing style, and classifying them is very difficult. To deal with this, an ART-2 neural network is used to classify the input strokes. It has the advantages of high recognition rate, less recognition time and forming classes in a self-organized manner. The symbol recognition is achieved by an Attribute Relational Graph (ARG) matching algorithm. The ARG is very efficient for representing complex objects, but computation cost is very high. To over come this, we suggest a fast graph matching algorithm using symbol structure information. The experimental results show that the proposed method is effective for recognition of symbols with hierarchical structure.

What Would a Graph Look Like in this Layout? A Machine Learning Approach to Large Graph Visualization.

PubMed

Kwon, Oh-Hyun; Crnovrsanin, Tarik; Ma, Kwan-Liu

2018-01-01

Using different methods for laying out a graph can lead to very different visual appearances, with which the viewer perceives different information. Selecting a "good" layout method is thus important for visualizing a graph. The selection can be highly subjective and dependent on the given task. A common approach to selecting a good layout is to use aesthetic criteria and visual inspection. However, fully calculating various layouts and their associated aesthetic metrics is computationally expensive. In this paper, we present a machine learning approach to large graph visualization based on computing the topological similarity of graphs using graph kernels. For a given graph, our approach can show what the graph would look like in different layouts and estimate their corresponding aesthetic metrics. An important contribution of our work is the development of a new framework to design graph kernels. Our experimental study shows that our estimation calculation is considerably faster than computing the actual layouts and their aesthetic metrics. Also, our graph kernels outperform the state-of-the-art ones in both time and accuracy. In addition, we conducted a user study to demonstrate that the topological similarity computed with our graph kernel matches perceptual similarity assessed by human users.

Simple graph models of information spread in finite populations

PubMed Central

Voorhees, Burton; Ryder, Bergerud

2015-01-01

We consider several classes of simple graphs as potential models for information diffusion in a structured population. These include biases cycles, dual circular flows, partial bipartite graphs and what we call ‘single-link’ graphs. In addition to fixation probabilities, we study structure parameters for these graphs, including eigenvalues of the Laplacian, conductances, communicability and expected hitting times. In several cases, values of these parameters are related, most strongly so for partial bipartite graphs. A measure of directional bias in cycles and circular flows arises from the non-zero eigenvalues of the antisymmetric part of the Laplacian and another measure is found for cycles as the value of the transition probability for which hitting times going in either direction of the cycle are equal. A generalization of circular flow graphs is used to illustrate the possibility of tuning edge weights to match pre-specified values for graph parameters; in particular, we show that generalizations of circular flows can be tuned to have fixation probabilities equal to the Moran probability for a complete graph by tuning vertex temperature profiles. Finally, single-link graphs are introduced as an example of a graph involving a bottleneck in the connection between two components and these are compared to the partial bipartite graphs. PMID:26064661

Linear bunchers and half-frequency bunching method

NASA Astrophysics Data System (ADS)

Tang, J. Y.; Jiang, J. Z.; Shi, A. M.; Yin, Z. K.; Wang, Y. F.

2000-12-01

A new buncher system consisting of two bunchers has been designed and constructed for HIRFL injector cyclotron, working at the SFC acceleration modes of H=1 and H=3, respectively. The bunchers use saw-tooth RF waveform, but with double-gap drift tube electrodes and single-gap grid electrodes, respectively. The special merit of the design is introduction of the half-frequency bunching mode, utilizing half of the cyclotron RF frequency. With this method, a perfect longitudinal match between the injector SFC and the main cyclotron SSC has been reached theoretically, compared to the original efficiency of 50% for most cases. Detailed studies have been made concerning space charge effects, longitudinal dispersions through the yoke hole and the spiral inflector, and non-linearity in both the RF waveform and the stray electric field of electrodes.

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

Braunstein, Samuel L.; Ghosh, Sibasish; Severini, Simone

We reconsider density matrices of graphs as defined in quant-ph/0406165. The density matrix of a graph is the combinatorial Laplacian of the graph normalized to have unit trace. We describe a simple combinatorial condition (the 'degree condition') to test the separability of density matrices of graphs. The condition is directly related to the Peres-Horodecki partial transposition condition. We prove that the degree condition is necessary for separability, and we conjecture that it is also sufficient. We prove special cases of the conjecture involving nearest-point graphs and perfect matchings. We observe that the degree condition appears to have a value beyondmore » the density matrices of graphs. In fact, we point out that circulant density matrices and other matrices constructed from groups always satisfy the condition and indeed are separable with respect to any split. We isolate a number of problems and delineate further generalizations.« less

Indexing Volumetric Shapes with Matching and Packing

PubMed Central

Koes, David Ryan; Camacho, Carlos J.

2014-01-01

We describe a novel algorithm for bulk-loading an index with high-dimensional data and apply it to the problem of volumetric shape matching. Our matching and packing algorithm is a general approach for packing data according to a similarity metric. First an approximate k-nearest neighbor graph is constructed using vantage-point initialization, an improvement to previous work that decreases construction time while improving the quality of approximation. Then graph matching is iteratively performed to pack related items closely together. The end result is a dense index with good performance. We define a new query specification for shape matching that uses minimum and maximum shape constraints to explicitly specify the spatial requirements of the desired shape. This specification provides a natural language for performing volumetric shape matching and is readily supported by the geometry-based similarity search (GSS) tree, an indexing structure that maintains explicit representations of volumetric shape. We describe our implementation of a GSS tree for volumetric shape matching and provide a comprehensive evaluation of parameter sensitivity, performance, and scalability. Compared to previous bulk-loading algorithms, we find that matching and packing can construct a GSS-tree index in the same amount of time that is denser, flatter, and better performing, with an observed average performance improvement of 2X. PMID:26085707

[Propensity score matching in SPSS].

PubMed

Huang, Fuqiang; DU, Chunlin; Sun, Menghui; Ning, Bing; Luo, Ying; An, Shengli

2015-11-01

To realize propensity score matching in PS Matching module of SPSS and interpret the analysis results. The R software and plug-in that could link with the corresponding versions of SPSS and propensity score matching package were installed. A PS matching module was added in the SPSS interface, and its use was demonstrated with test data. Score estimation and nearest neighbor matching was achieved with the PS matching module, and the results of qualitative and quantitative statistical description and evaluation were presented in the form of a graph matching. Propensity score matching can be accomplished conveniently using SPSS software.

THz-driven zero-slippage IFEL scheme for phase space manipulation

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

Curry, E.; Fabbri, S.; Musumeci, P.

In this paper, we describe an inverse free electron laser (IFEL) interaction driven by a near single-cycle THz pulse that is group velocity-matched to an electron bunch inside a waveguide, allowing for a sustained interaction in a magnetic undulator. We discuss the application of this guided-THz IFEL technique for compression of a relativistic electron bunch and synchronization with the external laser pulse used to generate the THz pulse via optical rectification, as well as a laser-driven THz streaking diagnostic with the potential for femtosecond scale temporal resolution. Initial measurements of the THz waveform via an electro-optic sampling based technique confirm the predicted reduction of the group velocity, using a curved parallel plate waveguide, as a function of the varying aperture size of the guide. We also present the design of a proof-of-principle experiment based on the bunch parameters available at the UCLA PEGASUS laboratory. With amore » $$10\\,\\mathrm{MV}\\,{{\\rm{m}}}^{-1}$$ THz peak field, our simulation model predicts compression of a $$6\\,\\mathrm{MeV}$$ $$100\\,\\mathrm{fs}$$ electron beam by nearly an order of magnitude and a significant reduction of its initial timing jitter.« less

THz-driven zero-slippage IFEL scheme for phase space manipulation

DOE PAGES

Curry, E.; Fabbri, S.; Musumeci, P.; ...

2016-11-24

In this paper, we describe an inverse free electron laser (IFEL) interaction driven by a near single-cycle THz pulse that is group velocity-matched to an electron bunch inside a waveguide, allowing for a sustained interaction in a magnetic undulator. We discuss the application of this guided-THz IFEL technique for compression of a relativistic electron bunch and synchronization with the external laser pulse used to generate the THz pulse via optical rectification, as well as a laser-driven THz streaking diagnostic with the potential for femtosecond scale temporal resolution. Initial measurements of the THz waveform via an electro-optic sampling based technique confirm the predicted reduction of the group velocity, using a curved parallel plate waveguide, as a function of the varying aperture size of the guide. We also present the design of a proof-of-principle experiment based on the bunch parameters available at the UCLA PEGASUS laboratory. With amore » $$10\\,\\mathrm{MV}\\,{{\\rm{m}}}^{-1}$$ THz peak field, our simulation model predicts compression of a $$6\\,\\mathrm{MeV}$$ $$100\\,\\mathrm{fs}$$ electron beam by nearly an order of magnitude and a significant reduction of its initial timing jitter.« less

Rights, Bunche, Rose and the "pipeline".

PubMed Central

Marks, Steven R.; Wilkinson-Lee, Ada M.

2006-01-01

We address education "pipelines" and their social ecology, drawing on the 1930's writing of Ralph J. Bunche, a Nobel peace maker whose war against systematic second-class education for the poor, minority and nonminority alike is nearly forgotten; and of the epidemiologist Geoffrey Rose, whose 1985 paper spotlighted the difficulty of shifting health status and risks in a "sick society. From the perspective of human rights and human development, we offer suggestions toward the paired "ends" of the pipeline: equality of opportunity for individuals, and equality of health for populations. We offer a national "to do" list to improve pipeline flow and then reconsider the merits of the "pipeline" metaphor, which neither matches the reality of lived education pathways nor supports notions of human rights, freedoms and capabilities, but rather reflects a commoditizing stance to free persons. PMID:17019927

Switch over to the high frequency rf systems near transition

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

Brennan, J.M.; Wei, J.

1988-01-01

The purpose of this note is to point out that since bunch narrowing naturally occurs in the acceleration process in the vicinity of transition, it should be possible to switch over to the high frequency system close to transition when the bunch has narrowed enough to fit directly into the high frequency bucket. The advantage of this approach is the simplicity, no extra components or gymnastics are required of the low frequency system. The disadvantage, of course, is for protons which do not go through transition. But on the other hand, there is no shortage of intensity for protons andmore » so it should be possible to keep the phase space area low for protons, and then matching to the high frequency bucket should be easily accomplished by adiabatic compression. 3 refs., 7 figs.« less

A hierarchical graph neuron scheme for real-time pattern recognition.

PubMed

Nasution, B B; Khan, A I

2008-02-01

The hierarchical graph neuron (HGN) implements a single cycle memorization and recall operation through a novel algorithmic design. The HGN is an improvement on the already published original graph neuron (GN) algorithm. In this improved approach, it recognizes incomplete/noisy patterns. It also resolves the crosstalk problem, which is identified in the previous publications, within closely matched patterns. To accomplish this, the HGN links multiple GN networks for filtering noise and crosstalk out of pattern data inputs. Intrinsically, the HGN is a lightweight in-network processing algorithm which does not require expensive floating point computations; hence, it is very suitable for real-time applications and tiny devices such as the wireless sensor networks. This paper describes that the HGN's pattern matching capability and the small response time remain insensitive to the increases in the number of stored patterns. Moreover, the HGN does not require definition of rules or setting of thresholds by the operator to achieve the desired results nor does it require heuristics entailing iterative operations for memorization and recall of patterns.

Native conflict awared layout decomposition in triple patterning lithography using bin-based library matching method

NASA Astrophysics Data System (ADS)

Ke, Xianhua; Jiang, Hao; Lv, Wen; Liu, Shiyuan

2016-03-01

Triple patterning (TP) lithography becomes a feasible technology for manufacturing as the feature size further scale down to sub 14/10 nm. In TP, a layout is decomposed into three masks followed with exposures and etches/freezing processes respectively. Previous works mostly focus on layout decomposition with minimal conflicts and stitches simultaneously. However, since any existence of native conflict will result in layout re-design/modification and reperforming the time-consuming decomposition, the effective method that can be aware of native conflicts (NCs) in layout is desirable. In this paper, a bin-based library matching method is proposed for NCs detection and layout decomposition. First, a layout is divided into bins and the corresponding conflict graph in each bin is constructed. Then, we match the conflict graph in a prebuilt colored library, and as a result the NCs can be located and highlighted quickly.

PERFORMANCE OF TWO LIQUID METAL TURBOPROP ENGINES UTILIZING A CIRCULATING FUEL REACTOR

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

Tiedemann, H.J.; Mathews, L.

1955-01-20

The performance of two all-nuclear turboprop engines utilizing the circulating fuel reactor with a fluoride fuel temperature of I500 deg F was investigated. Data are presented for off-match-point and modified match-point performances. Results are given in graph form. (M.C.G.)

VISAGE: Interactive Visual Graph Querying.

PubMed

Pienta, Robert; Navathe, Shamkant; Tamersoy, Acar; Tong, Hanghang; Endert, Alex; Chau, Duen Horng

2016-06-01

Extracting useful patterns from large network datasets has become a fundamental challenge in many domains. We present VISAGE, an interactive visual graph querying approach that empowers users to construct expressive queries, without writing complex code (e.g., finding money laundering rings of bankers and business owners). Our contributions are as follows: (1) we introduce graph autocomplete , an interactive approach that guides users to construct and refine queries, preventing over-specification; (2) VISAGE guides the construction of graph queries using a data-driven approach, enabling users to specify queries with varying levels of specificity, from concrete and detailed (e.g., query by example), to abstract (e.g., with "wildcard" nodes of any types), to purely structural matching; (3) a twelve-participant, within-subject user study demonstrates VISAGE's ease of use and the ability to construct graph queries significantly faster than using a conventional query language; (4) VISAGE works on real graphs with over 468K edges, achieving sub-second response times for common queries.

VISAGE: Interactive Visual Graph Querying

PubMed Central

Pienta, Robert; Navathe, Shamkant; Tamersoy, Acar; Tong, Hanghang; Endert, Alex; Chau, Duen Horng

2017-01-01

Extracting useful patterns from large network datasets has become a fundamental challenge in many domains. We present VISAGE, an interactive visual graph querying approach that empowers users to construct expressive queries, without writing complex code (e.g., finding money laundering rings of bankers and business owners). Our contributions are as follows: (1) we introduce graph autocomplete, an interactive approach that guides users to construct and refine queries, preventing over-specification; (2) VISAGE guides the construction of graph queries using a data-driven approach, enabling users to specify queries with varying levels of specificity, from concrete and detailed (e.g., query by example), to abstract (e.g., with “wildcard” nodes of any types), to purely structural matching; (3) a twelve-participant, within-subject user study demonstrates VISAGE’s ease of use and the ability to construct graph queries significantly faster than using a conventional query language; (4) VISAGE works on real graphs with over 468K edges, achieving sub-second response times for common queries. PMID:28553670

Graph pyramids for protein function prediction

PubMed Central

2015-01-01

Background Uncovering the hidden organizational characteristics and regularities among biological sequences is the key issue for detailed understanding of an underlying biological phenomenon. Thus pattern recognition from nucleic acid sequences is an important affair for protein function prediction. As proteins from the same family exhibit similar characteristics, homology based approaches predict protein functions via protein classification. But conventional classification approaches mostly rely on the global features by considering only strong protein similarity matches. This leads to significant loss of prediction accuracy. Methods Here we construct the Protein-Protein Similarity (PPS) network, which captures the subtle properties of protein families. The proposed method considers the local as well as the global features, by examining the interactions among 'weakly interacting proteins' in the PPS network and by using hierarchical graph analysis via the graph pyramid. Different underlying properties of the protein families are uncovered by operating the proposed graph based features at various pyramid levels. Results Experimental results on benchmark data sets show that the proposed hierarchical voting algorithm using graph pyramid helps to improve computational efficiency as well the protein classification accuracy. Quantitatively, among 14,086 test sequences, on an average the proposed method misclassified only 21.1 sequences whereas baseline BLAST score based global feature matching method misclassified 362.9 sequences. With each correctly classified test sequence, the fast incremental learning ability of the proposed method further enhances the training model. Thus it has achieved more than 96% protein classification accuracy using only 20% per class training data. PMID:26044522

Graph pyramids for protein function prediction.

PubMed

Sandhan, Tushar; Yoo, Youngjun; Choi, Jin; Kim, Sun

2015-01-01

Uncovering the hidden organizational characteristics and regularities among biological sequences is the key issue for detailed understanding of an underlying biological phenomenon. Thus pattern recognition from nucleic acid sequences is an important affair for protein function prediction. As proteins from the same family exhibit similar characteristics, homology based approaches predict protein functions via protein classification. But conventional classification approaches mostly rely on the global features by considering only strong protein similarity matches. This leads to significant loss of prediction accuracy. Here we construct the Protein-Protein Similarity (PPS) network, which captures the subtle properties of protein families. The proposed method considers the local as well as the global features, by examining the interactions among 'weakly interacting proteins' in the PPS network and by using hierarchical graph analysis via the graph pyramid. Different underlying properties of the protein families are uncovered by operating the proposed graph based features at various pyramid levels. Experimental results on benchmark data sets show that the proposed hierarchical voting algorithm using graph pyramid helps to improve computational efficiency as well the protein classification accuracy. Quantitatively, among 14,086 test sequences, on an average the proposed method misclassified only 21.1 sequences whereas baseline BLAST score based global feature matching method misclassified 362.9 sequences. With each correctly classified test sequence, the fast incremental learning ability of the proposed method further enhances the training model. Thus it has achieved more than 96% protein classification accuracy using only 20% per class training data.

A Graph-Centric Approach for Metagenome-Guided Peptide and Protein Identification in Metaproteomics

PubMed Central

Tang, Haixu; Li, Sujun; Ye, Yuzhen

2016-01-01

Metaproteomic studies adopt the common bottom-up proteomics approach to investigate the protein composition and the dynamics of protein expression in microbial communities. When matched metagenomic and/or metatranscriptomic data of the microbial communities are available, metaproteomic data analyses often employ a metagenome-guided approach, in which complete or fragmental protein-coding genes are first directly predicted from metagenomic (and/or metatranscriptomic) sequences or from their assemblies, and the resulting protein sequences are then used as the reference database for peptide/protein identification from MS/MS spectra. This approach is often limited because protein coding genes predicted from metagenomes are incomplete and fragmental. In this paper, we present a graph-centric approach to improving metagenome-guided peptide and protein identification in metaproteomics. Our method exploits the de Bruijn graph structure reported by metagenome assembly algorithms to generate a comprehensive database of protein sequences encoded in the community. We tested our method using several public metaproteomic datasets with matched metagenomic and metatranscriptomic sequencing data acquired from complex microbial communities in a biological wastewater treatment plant. The results showed that many more peptides and proteins can be identified when assembly graphs were utilized, improving the characterization of the proteins expressed in the microbial communities. The additional proteins we identified contribute to the characterization of important pathways such as those involved in degradation of chemical hazards. Our tools are released as open-source software on github at https://github.com/COL-IU/Graph2Pro. PMID:27918579

Enabling Graph Mining in RDF Triplestores using SPARQL for Holistic In-situ Graph Analysis

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

Lee, Sangkeun; Sukumar, Sreenivas R; Hong, Seokyong

The graph analysis is now considered as a promising technique to discover useful knowledge in data with a new perspective. We envi- sion that there are two dimensions of graph analysis: OnLine Graph Analytic Processing (OLGAP) and Graph Mining (GM) where each respectively focuses on subgraph pattern matching and automatic knowledge discovery in graph. Moreover, as these two dimensions aim to complementarily solve complex problems, holistic in-situ graph analysis which covers both OLGAP and GM in a single system is critical for minimizing the burdens of operating multiple graph systems and transferring intermediate result-sets between those systems. Nevertheless, most existingmore » graph analysis systems are only capable of one dimension of graph analysis. In this work, we take an approach to enabling GM capabilities (e.g., PageRank, connected-component analysis, node eccentricity, etc.) in RDF triplestores, which are originally developed to store RDF datasets and provide OLGAP capability. More specifically, to achieve our goal, we implemented six representative graph mining algorithms using SPARQL. The approach allows a wide range of available RDF data sets directly applicable for holistic graph analysis within a system. For validation of our approach, we evaluate performance of our implementations with nine real-world datasets and three different computing environments - a laptop computer, an Amazon EC2 instance, and a shared-memory Cray XMT2 URIKA-GD graph-processing appliance. The experimen- tal results show that our implementation can provide promising and scalable performance for real world graph analysis in all tested environments. The developed software is publicly available in an open-source project that we initiated.« less

Enabling Graph Mining in RDF Triplestores using SPARQL for Holistic In-situ Graph Analysis

DOE PAGES

Lee, Sangkeun; Sukumar, Sreenivas R; Hong, Seokyong; ...

2016-01-01

The graph analysis is now considered as a promising technique to discover useful knowledge in data with a new perspective. We envi- sion that there are two dimensions of graph analysis: OnLine Graph Analytic Processing (OLGAP) and Graph Mining (GM) where each respectively focuses on subgraph pattern matching and automatic knowledge discovery in graph. Moreover, as these two dimensions aim to complementarily solve complex problems, holistic in-situ graph analysis which covers both OLGAP and GM in a single system is critical for minimizing the burdens of operating multiple graph systems and transferring intermediate result-sets between those systems. Nevertheless, most existingmore » graph analysis systems are only capable of one dimension of graph analysis. In this work, we take an approach to enabling GM capabilities (e.g., PageRank, connected-component analysis, node eccentricity, etc.) in RDF triplestores, which are originally developed to store RDF datasets and provide OLGAP capability. More specifically, to achieve our goal, we implemented six representative graph mining algorithms using SPARQL. The approach allows a wide range of available RDF data sets directly applicable for holistic graph analysis within a system. For validation of our approach, we evaluate performance of our implementations with nine real-world datasets and three different computing environments - a laptop computer, an Amazon EC2 instance, and a shared-memory Cray XMT2 URIKA-GD graph-processing appliance. The experimen- tal results show that our implementation can provide promising and scalable performance for real world graph analysis in all tested environments. The developed software is publicly available in an open-source project that we initiated.« less

RoleSim and RoleMatch: Role-Based Similarity and Graph Matching

ERIC Educational Resources Information Center

Lee, Victor Eugene

2012-01-01

With the rise of the internet, mobile communications, electronic transactions, and personal broadcasting, the scale of connectedness has grown immensely. Not only can an individual interact with thousands and millions of others, but details about those interactions are being stored in databases, for later retrieval and analysis. Two key concepts…

Classification of ligand molecules in PDB with graph match-based structural superposition.

PubMed

Shionyu-Mitsuyama, Clara; Hijikata, Atsushi; Tsuji, Toshiyuki; Shirai, Tsuyoshi

2016-12-01

The fast heuristic graph match algorithm for small molecules, COMPLIG, was improved by adding a structural superposition process to verify the atom-atom matching. The modified method was used to classify the small molecule ligands in the Protein Data Bank (PDB) by their three-dimensional structures, and 16,660 types of ligands in the PDB were classified into 7561 clusters. In contrast, a classification by a previous method (without structure superposition) generated 3371 clusters from the same ligand set. The characteristic feature in the current classification system is the increased number of singleton clusters, which contained only one ligand molecule in a cluster. Inspections of the singletons in the current classification system but not in the previous one implied that the major factors for the isolation were differences in chirality, cyclic conformations, separation of substructures, and bond length. Comparisons between current and previous classification systems revealed that the superposition-based classification was effective in clustering functionally related ligands, such as drugs targeted to specific biological processes, owing to the strictness of the atom-atom matching.

X-rays only when you want them: optimized pump–probe experiments using pseudo-single-bunch operation

PubMed Central

Hertlein, M. P.; Scholl, A.; Cordones, A. A.; Lee, J. H.; Engelhorn, K.; Glover, T. E.; Barbrel, B.; Sun, C.; Steier, C.; Portmann, G.; Robin, D. S.

2015-01-01

Laser pump–X-ray probe experiments require control over the X-ray pulse pattern and timing. Here, the first use of pseudo-single-bunch mode at the Advanced Light Source in picosecond time-resolved X-ray absorption experiments on solutions and solids is reported. In this mode the X-ray repetition rate is fully adjustable from single shot to 500 kHz, allowing it to be matched to typical laser excitation pulse rates. Suppressing undesired X-ray pulses considerably reduces detector noise and improves signal to noise in time-resolved experiments. In addition, dose-induced sample damage is considerably reduced, easing experimental setup and allowing the investigation of less robust samples. Single-shot X-ray exposures of a streak camera detector using a conventional non-gated charge-coupled device (CCD) camera are also demonstrated. PMID:25931090

Electron injection and acceleration in the plasma bubble regime driven by an ultraintense laser pulse combined with using dense-plasma wall and block

NASA Astrophysics Data System (ADS)

Zhao, Xue-Yan; Xie, Bai-Song; Wu, Hai-Cheng; Zhang, Shan; Hong, Xue-Ren; Aimidula, Aimierding

2012-03-01

An optimizing and alternative scheme for electron injection and acceleration in the wake bubble driven by an ultraintense laser pulse is presented. In this scheme, the dense-plasma wall with an inner diameter matching the expected bubble size is placed along laser propagation direction. Meanwhile, a dense-plasma block dense-plasma is adhered inward transversely at some certain position of the wall. Particle-in-cell simulations are performed, which demonstrate that the block plays an important role in the first electron injection and acceleration. The result shows that a collimated electron bunch with a total number of about 4.04×108μm-1 can be generated and accelerated stably to 1.61 GeV peak energy with 2.6% energy spread. The block contributes about 50% to the accelerated electron injection bunch by tracing and sorting statistically the source.

Designing a Dielectric Laser Accelerator on a Chip

NASA Astrophysics Data System (ADS)

Niedermayer, Uwe; Boine-Frankenheim, Oliver; Egenolf, Thilo

2017-07-01

Dielectric Laser Acceleration (DLA) achieves gradients of more than 1GeV/m, which are among the highest in non-plasma accelerators. The long-term goal of the ACHIP collaboration is to provide relativistic (>1 MeV) electrons by means of a laser driven microchip accelerator. Examples of ’’slightly resonant” dielectric structures showing gradients in the range of 70% of the incident laser field (1 GV/m) for electrons with beta=0.32 and 200% for beta=0.91 are presented. We demonstrate the bunching and acceleration of low energy electrons in dedicated ballistic buncher and velocity matched grating structures. However, the design gradient of 500 MeV/m leads to rapid defocusing. Therefore we present a scheme to bunch the beam in stages, which does not only reduce the energy spread, but also the transverse defocusing. The designs are made with a dedicated homemade 6D particle tracking code.

X-rays only when you want them: Optimized pump–probe experiments using pseudo-single-bunch operation

DOE PAGES

Hertlein, M. P.; Scholl, A.; Cordones, A. A.; ...

2015-04-02

Laser pump–X-ray probe experiments require control over the X-ray pulse pattern and timing. Here, the first use of pseudo-single-bunch mode at the Advanced Light Source in picosecond time-resolved X-ray absorption experiments on solutions and solids is reported. In this mode the X-ray repetition rate is fully adjustable from single shot to 500 kHz, allowing it to be matched to typical laser excitation pulse rates. Suppressing undesired X-ray pulses considerably reduces detector noise and improves signal to noise in time-resolved experiments. In addition, dose-induced sample damage is considerably reduced, easing experimental setup and allowing the investigation of less robust samples. Single-shotmore » X-ray exposures of a streak camera detector using a conventional non-gated charge-coupled device (CCD) camera are also demonstrated.« less

A distributed query execution engine of big attributed graphs.

PubMed

Batarfi, Omar; Elshawi, Radwa; Fayoumi, Ayman; Barnawi, Ahmed; Sakr, Sherif

2016-01-01

A graph is a popular data model that has become pervasively used for modeling structural relationships between objects. In practice, in many real-world graphs, the graph vertices and edges need to be associated with descriptive attributes. Such type of graphs are referred to as attributed graphs. G-SPARQL has been proposed as an expressive language, with a centralized execution engine, for querying attributed graphs. G-SPARQL supports various types of graph querying operations including reachability, pattern matching and shortest path where any G-SPARQL query may include value-based predicates on the descriptive information (attributes) of the graph edges/vertices in addition to the structural predicates. In general, a main limitation of centralized systems is that their vertical scalability is always restricted by the physical limits of computer systems. This article describes the design, implementation in addition to the performance evaluation of DG-SPARQL, a distributed, hybrid and adaptive parallel execution engine of G-SPARQL queries. In this engine, the topology of the graph is distributed over the main memory of the underlying nodes while the graph data are maintained in a relational store which is replicated on the disk of each of the underlying nodes. DG-SPARQL evaluates parts of the query plan via SQL queries which are pushed to the underlying relational stores while other parts of the query plan, as necessary, are evaluated via indexless memory-based graph traversal algorithms. Our experimental evaluation shows the efficiency and the scalability of DG-SPARQL on querying massive attributed graph datasets in addition to its ability to outperform the performance of Apache Giraph, a popular distributed graph processing system, by orders of magnitudes.

Evaluation of Graph Pattern Matching Workloads in Graph Analysis Systems

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

Hong, Seokyong; Lee, Sangkeun; Lim, Seung-Hwan

2016-01-01

Graph analysis has emerged as a powerful method for data scientists to represent, integrate, query, and explore heterogeneous data sources. As a result, graph data management and mining became a popular area of research, and led to the development of plethora of systems in recent years. Unfortunately, the number of emerging graph analysis systems and the wide range of applications, coupled with a lack of apples-to-apples comparisons, make it difficult to understand the trade-offs between different systems and the graph operations for which they are designed. A fair comparison of these systems is a challenging task for the following reasons:more » multiple data models, non-standardized serialization formats, various query interfaces to users, and diverse environments they operate in. To address these key challenges, in this paper we present a new benchmark suite by extending the Lehigh University Benchmark (LUBM) to cover the most common capabilities of various graph analysis systems. We provide the design process of the benchmark, which generalizes the workflow for data scientists to conduct the desired graph analysis on different graph analysis systems. Equipped with this extended benchmark suite, we present performance comparison for nine subgraph pattern retrieval operations over six graph analysis systems, namely NetworkX, Neo4j, Jena, Titan, GraphX, and uRiKA. Through the proposed benchmark suite, this study reveals both quantitative and qualitative findings in (1) implications in loading data into each system; (2) challenges in describing graph patterns for each query interface; and (3) different sensitivity of each system to query selectivity. We envision that this study will pave the road for: (i) data scientists to select the suitable graph analysis systems, and (ii) data management system designers to advance graph analysis systems.« less

Enhancing SAMOS Data Access in DOMS via a Neo4j Property Graph Database.

NASA Astrophysics Data System (ADS)

Stallard, A. P.; Smith, S. R.; Elya, J. L.

2016-12-01

The Shipboard Automated Meteorological and Oceanographic System (SAMOS) initiative provides routine access to high-quality marine meteorological and near-surface oceanographic observations from research vessels. The Distributed Oceanographic Match-Up Service (DOMS) under development is a centralized service that allows researchers to easily match in situ and satellite oceanographic data from distributed sources to facilitate satellite calibration, validation, and retrieval algorithm development. The service currently uses Apache Solr as a backend search engine on each node in the distributed network. While Solr is a high-performance solution that facilitates creation and maintenance of indexed data, it is limited in the sense that its schema is fixed. The property graph model escapes this limitation by creating relationships between data objects. The authors will present the development of the SAMOS Neo4j property graph database including new search possibilities that take advantage of the property graph model, performance comparisons with Apache Solr, and a vision for graph databases as a storage tool for oceanographic data. The integration of the SAMOS Neo4j graph into DOMS will also be described. Currently, Neo4j contains spatial and temporal records from SAMOS which are modeled into a time tree and r-tree using Graph Aware and Spatial plugin tools for Neo4j. These extensions provide callable Java procedures within CYPHER (Neo4j's query language) that generate in-graph structures. Once generated, these structures can be queried using procedures from these libraries, or directly via CYPHER statements. Neo4j excels at performing relationship and path-based queries, which challenge relational-SQL databases because they require memory intensive joins due to the limitation of their design. Consider a user who wants to find records over several years, but only for specific months. If a traditional database only stores timestamps, this type of query would be complex and likely prohibitively slow. Using the time tree model, one can specify a path from the root to the data which restricts resolutions to certain timeframes (e.g., months). This query can be executed without joins, unions, or other compute-intensive operations, putting Neo4j at a computational advantage to the SQL database alternative.

Retroflex Versus Bunched in Treatment for Rhotic Misarticulation: Evidence From Ultrasound Biofeedback Intervention

PubMed Central

Byun, Tara McAllister; Hitchcock, Elaine R.; Swartz, Michelle T.

2014-01-01

Purpose To document the efficacy of ultrasound biofeedback treatment for misarticulation of the North American English rhotic in children. Because of limited progress in the first cohort, a series of two closely related studies was conducted in place of a single study. The studies differed primarily in the nature of tongue-shape targets (e.g., retroflex, bunched) cued during treatment. Method Eight participants received 8 weeks of individual ultrasound biofeedback treatment targeting rhotics. In Study 1, all 4 participants were cued to match a bunched tongue-shape target. In Study 2, participants received individualized cues aimed at eliciting the tongue shape most facilitative of perceptually correct rhotics. Results Participants in Study 1 showed only minimal treatment effects. In Study 2, all participants demonstrated improved production of rhotics in untreated words produced without biofeedback, with large to very large effect sizes. Conclusions The results of Study 2 indicate that with proper parameters of treatment, ultrasound biofeedback can be a highly effective intervention for children with persistent rhotic errors. In addition, qualitative comparison of Studies 1 and 2 suggests that treatment for the North American English rhotic should include opportunities to explore different tongue shapes, to find the most facilitative variant for each individual speaker. PMID:25088034

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.

MIMO: an efficient tool for molecular interaction maps overlap

PubMed Central

2013-01-01

Background Molecular pathways represent an ensemble of interactions occurring among molecules within the cell and between cells. The identification of similarities between molecular pathways across organisms and functions has a critical role in understanding complex biological processes. For the inference of such novel information, the comparison of molecular pathways requires to account for imperfect matches (flexibility) and to efficiently handle complex network topologies. To date, these characteristics are only partially available in tools designed to compare molecular interaction maps. Results Our approach MIMO (Molecular Interaction Maps Overlap) addresses the first problem by allowing the introduction of gaps and mismatches between query and template pathways and permits -when necessary- supervised queries incorporating a priori biological information. It then addresses the second issue by relying directly on the rich graph topology described in the Systems Biology Markup Language (SBML) standard, and uses multidigraphs to efficiently handle multiple queries on biological graph databases. The algorithm has been here successfully used to highlight the contact point between various human pathways in the Reactome database. Conclusions MIMO offers a flexible and efficient graph-matching tool for comparing complex biological pathways. PMID:23672344

Left ventricle segmentation via graph cut distribution matching.

PubMed

Ben Ayed, Ismail; Punithakumar, Kumaradevan; Li, Shuo; Islam, Ali; Chong, Jaron

2009-01-01

We present a discrete kernel density matching energy for segmenting the left ventricle cavity in cardiac magnetic resonance sequences. The energy and its graph cut optimization based on an original first-order approximation of the Bhattacharyya measure have not been proposed previously, and yield competitive results in nearly real-time. The algorithm seeks a region within each frame by optimization of two priors, one geometric (distance-based) and the other photometric, each measuring a distribution similarity between the region and a model learned from the first frame. Based on global rather than pixelwise information, the proposed algorithm does not require complex training and optimization with respect to geometric transformations. Unlike related active contour methods, it does not compute iterative updates of computationally expensive kernel densities. Furthermore, the proposed first-order analysis can be used for other intractable energies and, therefore, can lead to segmentation algorithms which share the flexibility of active contours and computational advantages of graph cuts. Quantitative evaluations over 2280 images acquired from 20 subjects demonstrated that the results correlate well with independent manual segmentations by an expert.

Automatic Assignment of Methyl-NMR Spectra of Supramolecular Machines Using Graph Theory.

PubMed

Pritišanac, Iva; Degiacomi, Matteo T; Alderson, T Reid; Carneiro, Marta G; Ab, Eiso; Siegal, Gregg; Baldwin, Andrew J

2017-07-19

Methyl groups are powerful probes for the analysis of structure, dynamics and function of supramolecular assemblies, using both solution- and solid-state NMR. Widespread application of the methodology has been limited due to the challenges associated with assigning spectral resonances to specific locations within a biomolecule. Here, we present Methyl Assignment by Graph Matching (MAGMA), for the automatic assignment of methyl resonances. A graph matching protocol examines all possibilities for each resonance in order to determine an exact assignment that includes a complete description of any ambiguity. MAGMA gives 100% accuracy in confident assignments when tested against both synthetic data, and 9 cross-validated examples using both solution- and solid-state NMR data. We show that this remarkable accuracy enables a user to distinguish between alternative protein structures. In a drug discovery application on HSP90, we show the method can rapidly and efficiently distinguish between possible ligand binding modes. By providing an exact and robust solution to methyl resonance assignment, MAGMA can facilitate significantly accelerated studies of supramolecular machines using methyl-based NMR spectroscopy.

Transformations of Mathematical and Stimulus Functions

PubMed Central

Ninness, Chris; Barnes-Holmes, Dermot; Rumph, Robin; McCuller, Glen; Ford, Angela M; Payne, Robert; Ninness, Sharon K; Smith, Ronald J; Ward, Todd A; Elliott, Marc P

2006-01-01

Following a pretest, 8 participants who were unfamiliar with algebraic and trigonometric functions received a brief presentation on the rectangular coordinate system. Next, they participated in a computer-interactive matching-to-sample procedure that trained formula-to-formula and formula-to-graph relations. Then, they were exposed to 40 novel formula-to-graph tests and 10 novel graph-to-formula tests. Seven of the 8 participants showed substantial improvement in identifying formula-to-graph relations; however, in the test of novel graph-to-formula relations, participants tended to select equations in their factored form. Next, we manipulated contextual cues in the form of rules regarding mathematical preferences. First, we informed participants that standard forms of equations were preferred over factored forms. In a subsequent test of 10 additional novel graph-to-formula relations, participants shifted their selections to favor equations in their standard form. This preference reversed during 10 more tests when financial reward was made contingent on correct identification of formulas in factored form. Formula preferences and transformation of novel mathematical and stimulus functions are discussed. PMID:17020211

A graph-based network-vulnerability analysis system

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

Swiler, L.P.; Phillips, C.; Gaylor, T.

1998-05-03

This paper presents a graph based approach to network vulnerability analysis. The method is flexible, allowing analysis of attacks from both outside and inside the network. It can analyze risks to a specific network asset, or examine the universe of possible consequences following a successful attack. The analysis system requires as input a database of common attacks, broken into atomic steps, specific network configuration and topology information, and an attacker profile. The attack information is matched with the network configuration information and an attacker profile to create a superset attack graph. Nodes identify a stage of attack, for example themore » class of machines the attacker has accessed and the user privilege level he or she has compromised. The arcs in the attack graph represent attacks or stages of attacks. By assigning probabilities of success on the arcs or costs representing level of effort for the attacker, various graph algorithms such as shortest path algorithms can identify the attack paths with the highest probability of success.« less

A graph-based network-vulnerability analysis system

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

Swiler, L.P.; Phillips, C.; Gaylor, T.

1998-01-01

This report presents a graph-based approach to network vulnerability analysis. The method is flexible, allowing analysis of attacks from both outside and inside the network. It can analyze risks to a specific network asset, or examine the universe of possible consequences following a successful attack. The analysis system requires as input a database of common attacks, broken into atomic steps, specific network configuration and topology information, and an attacker profile. The attack information is matched with the network configuration information and an attacker profile to create a superset attack graph. Nodes identify a stage of attack, for example the classmore » of machines the attacker has accessed and the user privilege level he or she has compromised. The arcs in the attack graph represent attacks or stages of attacks. By assigning probabilities of success on the arcs or costs representing level-of-effort for the attacker, various graph algorithms such as shortest-path algorithms can identify the attack paths with the highest probability of success.« less

A Set of Handwriting Features for Use in Automated Writer Identification.

PubMed

Miller, John J; Patterson, Robert Bradley; Gantz, Donald T; Saunders, Christopher P; Walch, Mark A; Buscaglia, JoAnn

2017-05-01

A writer's biometric identity can be characterized through the distribution of physical feature measurements ("writer's profile"); a graph-based system that facilitates the quantification of these features is described. To accomplish this quantification, handwriting is segmented into basic graphical forms ("graphemes"), which are "skeletonized" to yield the graphical topology of the handwritten segment. The graph-based matching algorithm compares the graphemes first by their graphical topology and then by their geometric features. Graphs derived from known writers can be compared against graphs extracted from unknown writings. The process is computationally intensive and relies heavily upon statistical pattern recognition algorithms. This article focuses on the quantification of these physical features and the construction of the associated pattern recognition methods for using the features to discriminate among writers. The graph-based system described in this article has been implemented in a highly accurate and approximately language-independent biometric recognition system of writers of cursive documents. © 2017 American Academy of Forensic Sciences.

Graph-Based Semantic Web Service Composition for Healthcare Data Integration.

PubMed

Arch-Int, Ngamnij; Arch-Int, Somjit; Sonsilphong, Suphachoke; Wanchai, Paweena

2017-01-01

Within the numerous and heterogeneous web services offered through different sources, automatic web services composition is the most convenient method for building complex business processes that permit invocation of multiple existing atomic services. The current solutions in functional web services composition lack autonomous queries of semantic matches within the parameters of web services, which are necessary in the composition of large-scale related services. In this paper, we propose a graph-based Semantic Web Services composition system consisting of two subsystems: management time and run time. The management-time subsystem is responsible for dependency graph preparation in which a dependency graph of related services is generated automatically according to the proposed semantic matchmaking rules. The run-time subsystem is responsible for discovering the potential web services and nonredundant web services composition of a user's query using a graph-based searching algorithm. The proposed approach was applied to healthcare data integration in different health organizations and was evaluated according to two aspects: execution time measurement and correctness measurement.

Graph-Based Semantic Web Service Composition for Healthcare Data Integration

PubMed Central

2017-01-01

Within the numerous and heterogeneous web services offered through different sources, automatic web services composition is the most convenient method for building complex business processes that permit invocation of multiple existing atomic services. The current solutions in functional web services composition lack autonomous queries of semantic matches within the parameters of web services, which are necessary in the composition of large-scale related services. In this paper, we propose a graph-based Semantic Web Services composition system consisting of two subsystems: management time and run time. The management-time subsystem is responsible for dependency graph preparation in which a dependency graph of related services is generated automatically according to the proposed semantic matchmaking rules. The run-time subsystem is responsible for discovering the potential web services and nonredundant web services composition of a user's query using a graph-based searching algorithm. The proposed approach was applied to healthcare data integration in different health organizations and was evaluated according to two aspects: execution time measurement and correctness measurement. PMID:29065602

Emittance growth due to static and radiative space charge forces in an electron bunch compressor

NASA Astrophysics Data System (ADS)

Talman, Richard; Malitsky, Nikolay; Stulle, Frank

2009-01-01

Evolution of short intense electron bunches passing through bunch-compressing beam lines is studied using the UAL (Unified Accelerator Libraries) string space charge formulation [R. Talman, Phys. Rev. ST Accel. Beams 7, 100701 (2004)PRABFM1098-440210.1103/PhysRevSTAB.7.100701; N. Malitsky and R. Talman, in Proceedings of the 9th European Particle Accelerator Conference, Lucerne, 2004 (EPS-AG, Lucerne, 2004); R. Talman, Accelerator X-Ray Sources (Wiley-VCH, Weinheim, 2006), Chap. 13]. Three major configurations are studied, with the first most important and studied in greatest detail (because actual experimental results are available and the same results have been simulated with other codes): (i) Experimental bunch compression results were obtained at CTF-II, the CERN test facility for the “Compact Linear Collider” using electrons of about 40 MeV. Previous simulations of these results have been performed (using TraFiC4* [A. Kabel , Nucl. Instrum. Methods Phys. Res., Sect. A 455, 185 (2000)NIMAER0168-900210.1016/S0168-9002(00)00729-4] and ELEGANT [M. Borland, Argonne National Laboratory Report No. LS-287, 2000]). All three simulations are in fair agreement with the data except that the UAL simulation predicts a substantial dependence of horizontal emittance γx on beam width (as controlled by the lattice βx function) at the compressor location. This is consistent with the experimental observations, but inconsistent with other simulations. Excellent agreement concerning dependence of bunch energy loss on bunch length and magnetic field strength [L. Groening , in Proceedings of the Particle Accelerator Conference, Chicago, IL, 2001 (IEEE, New York, 2001), http://groening.home.cern/groening/csr_00.htm] confirms our understanding of the role played by coherent synchrotron radiation (CSR). (ii) A controlled comparison is made between the predictions of the UAL code and those of CSRTrack [M. Dohlus and T. Limberg, in Proceedings of the 2004 FEL Conference, pp. 18-21, MOCOS05, available at http://www.JACoW.org], a code with similar capabilities. For this comparison an appropriately new, 50 MeV, “standard chicane” is introduced. Unlike CSRTrack (which neglects vertical forces) the present simulation shows substantial growth of vertical emittance. But “turning off” vertical forces in the UAL code (to match the CSRTrack treatment) brings the two codes into excellent agreement. (iii) Results are also obtained for 5 GeV electrons passing through a previously introduced “standard chicane” [Coherent Synchrotron Radiation, CSR Workshop, Berlin 2002, http://www.desy.de/csr] [of the sort needed for linear colliders and free electron lasers (FEL’s) currently under design or construction]. Relatively little emittance growth is predicted for typical bunch parameters at such high electron energy. Results are obtained for both round beams and ribbon beams (like those actually needed in practice). Little or no excess emittance growth is found for ribbon bunches compared to round bunches of the same charge and bunch width. The UAL string space charge formulation (like TraFic4 and CSRTrack) avoids the regularization step (subtracting the free-space space charge force) which is required (to remove divergence) in some methods. Also, by avoiding the need to calculate a retarded-time, four-dimensional field history, the computation time needed for realistic bunch evolution calculations is modest. Some theories of bunch dilution, because they ascribe emittance growth entirely to CSR, break down at low energy. In the present treatment, as well as CSR, all free-space Coulomb and magnetic space charge forces (but not image forces), and also the centrifugal space charge force (CSCF) are included. Charge-dependent beam steering due to CSCF, as observed recently by Beutner et al. [B. Beutner , in Proceedings of FEL Conference, BESSY, Berlin, Germany, 2006, MOPPH009], is also investigated.

Optimizing Approximate Weighted Matching on Nvidia Kepler K40

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

Naim, Md; Manne, Fredrik; Halappanavar, Mahantesh

Matching is a fundamental graph problem with numerous applications in science and engineering. While algorithms for computing optimal matchings are difficult to parallelize, approximation algorithms on the other hand generally compute high quality solutions and are amenable to parallelization. In this paper, we present efficient implementations of the current best algorithm for half-approximate weighted matching, the Suitor algorithm, on Nvidia Kepler K-40 platform. We develop four variants of the algorithm that exploit hardware features to address key challenges for a GPU implementation. We also experiment with different combinations of work assigned to a warp. Using an exhaustive set ofmore » $269$ inputs, we demonstrate that the new implementation outperforms the previous best GPU algorithm by $10$ to $$100\\times$$ for over $100$ instances, and from $100$ to $$1000\\times$$ for $15$ instances. We also demonstrate up to $$20\\times$$ speedup relative to $2$ threads, and up to $$5\\times$$ relative to $16$ threads on Intel Xeon platform with $16$ cores for the same algorithm. The new algorithms and implementations provided in this paper will have a direct impact on several applications that repeatedly use matching as a key compute kernel. Further, algorithm designs and insights provided in this paper will benefit other researchers implementing graph algorithms on modern GPU architectures.« less

Quasi-isochronous muon collection channels

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

Ankenbrandt, Charles M.; Neuffer, David; Johnson, Rolland P.

2015-04-26

Intense muon beams have many potential commercial and scientific applications, ranging from low-energy investigations of the basic properties of matter using spin resonance to large energy-frontier muon colliders. However, muons originate from a tertiary process that produces a diffuse swarm. To make useful beams, the swarm must be rapidly captured and cooled before the muons decay. In this STTR project a promising new concept for the collection and cooling of muon beams to increase their intensity and reduce their emittances was investigated, namely, the use of a nearly isochronous helical cooling channel (HCC) to facilitate capture of the muons intomore » RF bunches. The muon beam can then be cooled quickly and coalesced efficiently to optimize the luminosity of a muon collider, or could provide compressed muon beams for other applications. Optimal ways to integrate such a subsystem into the rest of a muon collection and cooling system, for collider and other applications, were developed by analysis and simulation. The application of quasi-isochronous helical cooling channels (QIHCC) for RF capture of muon beams was developed. Innovative design concepts for a channel incorporating straight solenoids, a matching section, and an HCC, including RF and absorber, were developed, and its subsystems were simulated. Additionally, a procedure that uses an HCC to combine bunches for a muon collider was invented and simulated. Difficult design aspects such as matching sections between subsystems and intensity-dependent effects were addressed. The bunch recombination procedure was developed into a complete design with 3-D simulations. Bright muon beams are needed for many commercial and scientific reasons. Potential commercial applications include low-dose radiography, muon catalyzed fusion, and the use of muon beams to screen cargo containers for homeland security. Scientific uses include low energy beams for rare process searches, muon spin resonance applications, muon beams for neutrino factories, and muon colliders as Higgs factories or energy-frontier discovery machines.« less

Analysis of Methods to Excite Head-Tail Motion Within the Cornell Electron Storage Ring

NASA Astrophysics Data System (ADS)

Gendler, Naomi; Billing, Mike; Shanks, Jim

The main accelerator complex at Cornell consists of two rings around which electrons and positrons move: the synchrotron, where the particles are accelerated to 5 GeV, and the Storage Ring, where the particles circulate a ta Þxed energy, guided by quadrupole and dipole magnets, with a steady energy due to a sinusoidal voltage source. Keeping the beam stable in the Storage Ring is crucial for its lifetime. A long-lasting, invariable beam means more accurate experiments, as well as brighter, more focused X-rays for use in the Cornell High Energy Synchrotron Source (CHESS). The stability of the electron and positron beams in the Cornell Electron Storage Ring (CESR) is important for the development of accelerators and for usage of the beam in X-ray science and accelerator physics. Bunch oscillations tend to enlarge the beam's cross section, making it less stable. We believe that one such oscillation is ``head-tail motion,'' where the bunch rocks back and forth on a pivot located at the central particle. In this project, we write a simulation of the bunch that induces head-tail motion with a vertical driver. We also excite this motion physically in the storage ring, and observe a deÞnite head-tail signal. In the experiment, we saw a deÞnite persistence of the drive-damp signal within a small band around the head-tail frequency, indicating that the head-tail frequency is a natural vertical mode of the bunch that was being excited. The signal seen in the experiment matched the signal seen in the simulation to within an order of magnitude.

A heuristic for efficient data distribution management in distributed simulation

NASA Astrophysics Data System (ADS)

Gupta, Pankaj; Guha, Ratan K.

2005-05-01

In this paper, we propose an algorithm for reducing the complexity of region matching and efficient multicasting in data distribution management component of High Level Architecture (HLA) Run Time Infrastructure (RTI). The current data distribution management (DDM) techniques rely on computing the intersection between the subscription and update regions. When a subscription region and an update region of different federates overlap, RTI establishes communication between the publisher and the subscriber. It subsequently routes the updates from the publisher to the subscriber. The proposed algorithm computes the update/subscription regions matching for dynamic allocation of multicast group. It provides new multicast routines that exploit the connectivity of federation by communicating updates regarding interactions and routes information only to those federates that require them. The region-matching problem in DDM reduces to clique-covering problem using the connections graph abstraction where the federations represent the vertices and the update/subscribe relations represent the edges. We develop an abstract model based on connection graph for data distribution management. Using this abstract model, we propose a heuristic for solving the region-matching problem of DDM. We also provide complexity analysis of the proposed heuristics.

Combinatorial Algorithms to Enable Computational Science and Engineering: Work from the CSCAPES Institute

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

Boman, Erik G.; Catalyurek, Umit V.; Chevalier, Cedric

2015-01-16

This final progress report summarizes the work accomplished at the Combinatorial Scientific Computing and Petascale Simulations Institute. We developed Zoltan, a parallel mesh partitioning library that made use of accurate hypergraph models to provide load balancing in mesh-based computations. We developed several graph coloring algorithms for computing Jacobian and Hessian matrices and organized them into a software package called ColPack. We developed parallel algorithms for graph coloring and graph matching problems, and also designed multi-scale graph algorithms. Three PhD students graduated, six more are continuing their PhD studies, and four postdoctoral scholars were advised. Six of these students and Fellowsmore » have joined DOE Labs (Sandia, Berkeley), as staff scientists or as postdoctoral scientists. We also organized the SIAM Workshop on Combinatorial Scientific Computing (CSC) in 2007, 2009, and 2011 to continue to foster the CSC community.« less

The random fractional matching problem

NASA Astrophysics Data System (ADS)

Lucibello, Carlo; Malatesta, Enrico M.; Parisi, Giorgio; Sicuro, Gabriele

2018-05-01

We consider two formulations of the random-link fractional matching problem, a relaxed version of the more standard random-link (integer) matching problem. In one formulation, we allow each node to be linked to itself in the optimal matching configuration. In the other one, on the contrary, such a link is forbidden. Both problems have the same asymptotic average optimal cost of the random-link matching problem on the complete graph. Using a replica approach and previous results of Wästlund (2010 Acta Mathematica 204 91–150), we analytically derive the finite-size corrections to the asymptotic optimal cost. We compare our results with numerical simulations and we discuss the main differences between random-link fractional matching problems and the random-link matching problem.

Using animated computer-generated text and graphics to depict the risks and benefits of medical treatment.

PubMed

Tait, Alan R; Voepel-Lewis, Terri; Brennan-Martinez, Colleen; McGonegal, Maureen; Levine, Robert

2012-11-01

Conventional print materials for presenting risks and benefits of treatment are often difficult to understand. This study was undertaken to evaluate and compare subjects' understanding and perceptions of risks and benefits presented using animated computerized text and graphics. Adult subjects were randomized to receive identical risk/benefit information regarding taking statins that was presented on an iPad (Apple Corp, Cupertino, Calif) in 1 of 4 different animated formats: text/numbers, pie chart, bar graph, and pictograph. Subjects completed a questionnaire regarding their preferences and perceptions of the message delivery together with their understanding of the information. Health literacy, numeracy, and need for cognition were measured using validated instruments. There were no differences in subject understanding based on the different formats. However, significantly more subjects preferred graphs (82.5%) compared with text (17.5%, P<.001). Specifically, subjects preferred pictographs (32.0%) and bar graphs (31.0%) over pie charts (19.5%) and text (17.5%). Subjects whose preference for message delivery matched their randomly assigned format (preference match) had significantly greater understanding and satisfaction compared with those assigned to something other than their preference. Results showed that computer-animated depictions of risks and benefits offer an effective means to describe medical risk/benefit statistics. That understanding and satisfaction were significantly better when the format matched the individual's preference for message delivery is important and reinforces the value of "tailoring" information to the individual's needs and preferences. Copyright © 2012 Elsevier Inc. All rights reserved.

Compton backscattered collimated x-ray source

DOEpatents

Ruth, R.D.; Huang, Z.

1998-10-20

A high-intensity, inexpensive and collimated x-ray source is disclosed for applications such as x-ray lithography is disclosed. An intense pulse from a high power laser, stored in a high-finesse resonator, repetitively collides nearly head-on with and Compton backscatters off a bunched electron beam, having relatively low energy and circulating in a compact storage ring. Both the laser and the electron beams are tightly focused and matched at the interaction region inside the optical resonator. The laser-electron interaction not only gives rise to x-rays at the desired wavelength, but also cools and stabilizes the electrons against intrabeam scattering and Coulomb repulsion with each other in the storage ring. This cooling provides a compact, intense bunch of electrons suitable for many applications. In particular, a sufficient amount of x-rays can be generated by this device to make it an excellent and flexible Compton backscattered x-ray (CBX) source for high throughput x-ray lithography and many other applications. 4 figs.

Compton backscattered collimated x-ray source

DOEpatents

Ruth, Ronald D.; Huang, Zhirong

1998-01-01

A high-intensity, inexpensive and collimated x-ray source for applications such as x-ray lithography is disclosed. An intense pulse from a high power laser, stored in a high-finesse resonator, repetitively collides nearly head-on with and Compton backscatters off a bunched electron beam, having relatively low energy and circulating in a compact storage ring. Both the laser and the electron beams are tightly focused and matched at the interaction region inside the optical resonator. The laser-electron interaction not only gives rise to x-rays at the desired wavelength, but also cools and stabilizes the electrons against intrabeam scattering and Coulomb repulsion with each other in the storage ring. This cooling provides a compact, intense bunch of electrons suitable for many applications. In particular, a sufficient amount of x-rays can be generated by this device to make it an excellent and flexible Compton backscattered x-ray (CBX) source for high throughput x-ray lithography and many other applications.

Compton backscattered collmated X-ray source

DOEpatents

Ruth, Ronald D.; Huang, Zhirong

2000-01-01

A high-intensity, inexpensive and collimated x-ray source for applications such as x-ray lithography is disclosed. An intense pulse from a high power laser, stored in a high-finesse resonator, repetitively collides nearly head-on with and Compton backscatters off a bunched electron beam, having relatively low energy and circulating in a compact storage ring. Both the laser and the electron beams are tightly focused and matched at the interaction region inside the optical resonator. The laser-electron interaction not only gives rise to x-rays at the desired wavelength, but also cools and stabilizes the electrons against intrabeam scattering and Coulomb repulsion with each other in the storage ring. This cooling provides a compact, intense bunch of electrons suitable for many applications. In particular, a sufficient amount of x-rays can be generated by this device to make it an excellent and flexible Compton backscattered x-ray (CBX) source for high throughput x-ray lithography and many other applications.

Figure-ground segmentation based on class-independent shape priors

NASA Astrophysics Data System (ADS)

Li, Yang; Liu, Yang; Liu, Guojun; Guo, Maozu

2018-01-01

We propose a method to generate figure-ground segmentation by incorporating shape priors into the graph-cuts algorithm. Given an image, we first obtain a linear representation of an image and then apply directional chamfer matching to generate class-independent, nonparametric shape priors, which provide shape clues for the graph-cuts algorithm. We then enforce shape priors in a graph-cuts energy function to produce object segmentation. In contrast to previous segmentation methods, the proposed method shares shape knowledge for different semantic classes and does not require class-specific model training. Therefore, the approach obtains high-quality segmentation for objects. We experimentally validate that the proposed method outperforms previous approaches using the challenging PASCAL VOC 2010/2012 and Berkeley (BSD300) segmentation datasets.

Neural coding in graphs of bidirectional associative memories.

PubMed

Bouchain, A David; Palm, Günther

2012-01-24

In the last years we have developed large neural network models for the realization of complex cognitive tasks in a neural network architecture that resembles the network of the cerebral cortex. We have used networks of several cortical modules that contain two populations of neurons (one excitatory, one inhibitory). The excitatory populations in these so-called "cortical networks" are organized as a graph of Bidirectional Associative Memories (BAMs), where edges of the graph correspond to BAMs connecting two neural modules and nodes of the graph correspond to excitatory populations with associative feedback connections (and inhibitory interneurons). The neural code in each of these modules consists essentially of the firing pattern of the excitatory population, where mainly it is the subset of active neurons that codes the contents to be represented. The overall activity can be used to distinguish different properties of the patterns that are represented which we need to distinguish and control when performing complex tasks like language understanding with these cortical networks. The most important pattern properties or situations are: exactly fitting or matching input, incomplete information or partially matching pattern, superposition of several patterns, conflicting information, and new information that is to be learned. We show simple simulations of these situations in one area or module and discuss how to distinguish these situations based on the overall internal activation of the module. This article is part of a Special Issue entitled "Neural Coding". Copyright © 2011 Elsevier B.V. All rights reserved.

Graph-matching based CTA.

PubMed

Maksimov, Dmitry; Hesser, Jürgen; Brockmann, Carolin; Jochum, Susanne; Dietz, Tiina; Schnitzer, Andreas; Düber, Christoph; Schoenberg, Stefan O; Diehl, Steffen

2009-12-01

Separating bone, calcification, and vessels in computer tomography angiography (CTA) allows for a detailed diagnosis of vessel stenosis. This paper presents a new, graph-based technique that solves this difficult problem with high accuracy. The approach requires one native data set and one that is contrast enhanced. On each data set, an attributed level-graph is derived and both graphs are matched by dynamic programming to differentiate between bone, on one hand side, and vessel/calcification on the other hand side. Lumen and calcified regions are then separated by a profile technique. Evaluation is based on data from vessels of pelvis and lower extremities of elderly patients. Due to substantial calcification and motion of patients between and during the acquisitions, the underlying approach is tested on a class of difficult cases. Analysis requires 3-5 min on a Pentium IV 3 GHz for a 700 MByte data set. Among 37 patients, our approach correctly identifies all three components in 80% of cases correctly compared to visual control. Critical inconsistencies with visual inspection were found in 6% of all cases; 70% of these inconsistencies are due to small vessels that have 1) a diameter near the resolution of the CT and 2) are passing next to bony structures. All other remaining deviations are found in an incorrect handling of the iliac artery since the slice thickness is near the diameter of this vessel and since the orientation is not in cranio-caudal direction. Increasing resolution is thus expected to solve many the aforementioned difficulties.

Precision Control of the Electron Longitudinal Bunch Shape Using an Emittance-Exchange Beam Line

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

Ha, Gwanghui; Cho, Moo -Hyun; Namkung, W.

2017-03-09

Here, we report on the experimental generation of relativistic electron bunches with a tunable longitudinal bunch shape. A longitudinal bunch-shaping (LBS) beam line, consisting of a transverse mask followed by a transverse-to-longitudinal emittance exchange (EEX) beam line, is used to tailor the longitudinal bunch shape (or current profile) of the electron bunch. The mask shapes the bunch’s horizontal profile, and the EEX beam line converts it to a corresponding longitudinal profile. The Argonne wakefield accelerator rf photoinjector delivers electron bunches into a LBS beam line to generate a variety of longitudinal bunch shapes. The quality of the longitudinal bunch shapemore » is limited by various perturbations in the exchange process. We develop a simple method, based on the incident slope of the bunch, to significantly suppress the perturbations.« less

Test-retest reliability of fMRI-based graph theoretical properties during working memory, emotion processing, and resting state.

PubMed

Cao, Hengyi; Plichta, Michael M; Schäfer, Axel; Haddad, Leila; Grimm, Oliver; Schneider, Michael; Esslinger, Christine; Kirsch, Peter; Meyer-Lindenberg, Andreas; Tost, Heike

2014-01-01

The investigation of the brain connectome with functional magnetic resonance imaging (fMRI) and graph theory analyses has recently gained much popularity, but little is known about the robustness of these properties, in particular those derived from active fMRI tasks. Here, we studied the test-retest reliability of brain graphs calculated from 26 healthy participants with three established fMRI experiments (n-back working memory, emotional face-matching, resting state) and two parcellation schemes for node definition (AAL atlas, functional atlas proposed by Power et al.). We compared the intra-class correlation coefficients (ICCs) of five different data processing strategies and demonstrated a superior reliability of task-regression methods with condition-specific regressors. The between-task comparison revealed significantly higher ICCs for resting state relative to the active tasks, and a superiority of the n-back task relative to the face-matching task for global and local network properties. While the mean ICCs were typically lower for the active tasks, overall fair to good reliabilities were detected for global and local connectivity properties, and for the n-back task with both atlases, smallworldness. For all three tasks and atlases, low mean ICCs were seen for the local network properties. However, node-specific good reliabilities were detected for node degree in regions known to be critical for the challenged functions (resting-state: default-mode network nodes, n-back: fronto-parietal nodes, face-matching: limbic nodes). Between-atlas comparison demonstrated significantly higher reliabilities for the functional parcellations for global and local network properties. Our findings can inform the choice of processing strategies, brain atlases and outcome properties for fMRI studies using active tasks, graph theory methods, and within-subject designs, in particular future pharmaco-fMRI studies. © 2013 Elsevier Inc. All rights reserved.

Phase modulation of the bucket stops bunch oscillations at the Fermilab Tevatron

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

Tan, C.Y.; Burov, A.; /Fermilab

2012-04-02

Bunches in the Tevatron are known to exhibit longitudinal oscillations which persist indefinitely. These oscillations are colloquially called 'dancing bunches.' Although the dancing proton bunches do not cause single bunch emittance growth or beam loss at injection, they lead to bunch lengthening at collisions. In Tevatron operations, a longitudinal damper has been built which stops this dance and damps out coupled bunch modes. Recent theoretical work predicts that the dance can also be stopped by an appropriate change in the bunch distribution. This paper describes the Tevatron experiments which support this theory.

Electron Beam Instrumentation Techniques Using Coherent Radiation

NASA Astrophysics Data System (ADS)

Wang, D. X.

1997-05-01

In recent years, there has been increasing interest in short electron bunches for different applications such as short wavelength FELs, linear colliders, advanced accelerators such as laser or plasma wakefield accelerators, and Compton backscattering X-ray sources. A short bunch length is needed to meet various requirements such as high peak current, low momentum spread, high luminosity, small ratio of bunch length to plasma wavelength, or accurate timing. Meanwhile, much progress has been made on photoinjectors and different magnetic and RF bunching schemes to produce very short bunches. Measurement of those short bunches becomes essential to develop, characterize, and operate such demanding machines. Conventionally, bunch duration of short electron bunches is measured by transverse RF deflecting cavities or streak camera. With such devices it becomes very challenging to measure bunch length down to a few hundred femtoseconds. Many frequency domain techniques have been recently developed, based on a relation between bunch profile and coherent radiation spectrum. These techniques provide excellent performance for short bunches. In this paper, coherent radiation and its applications to bunch length measurement will be discussed. A strategy for bunch length control at Jefferson Lab will be presented, which includes a noninvasive coherent synchrotron radiation (CSR) monitor, a zero-phasing technique used to calibrate the CSR detector, and phase transfer measurement used to correct RF phase drifts.

Acceleration of a trailing positron bunch in a plasma wakefield accelerator

DOE PAGES

Doche, A.; Beekman, C.; Corde, S.; ...

2017-10-27

High gradients of energy gain and high energy efficiency are necessary parameters for compact, cost-efficient and high-energy particle colliders. Plasma Wakefield Accelerators (PWFA) offer both, making them attractive candidates for next-generation colliders. Here in these devices, a charge-density plasma wave is excited by an ultra-relativistic bunch of charged particles (the drive bunch). The energy in the wave can be extracted by a second bunch (the trailing bunch), as this bunch propagates in the wake of the drive bunch. While a trailing electron bunch was accelerated in a plasma with more than a gigaelectronvolt of energy gain, accelerating a trailing positronmore » bunch in a plasma is much more challenging as the plasma response can be asymmetric for positrons and electrons. We report the demonstration of the energy gain by a distinct trailing positron bunch in a plasma wakefield accelerator, spanning nonlinear to quasi-linear regimes, and unveil the beam loading process underlying the accelerator energy efficiency. A positron bunch is used to drive the plasma wake in the experiment, though the quasi-linear wake structure could as easily be formed by an electron bunch or a laser driver. Finally, the results thus mark the first acceleration of a distinct positron bunch in plasma-based particle accelerators.« less

Acceleration of a trailing positron bunch in a plasma wakefield accelerator

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

Doche, A.; Beekman, C.; Corde, S.

High gradients of energy gain and high energy efficiency are necessary parameters for compact, cost-efficient and high-energy particle colliders. Plasma Wakefield Accelerators (PWFA) offer both, making them attractive candidates for next-generation colliders. Here in these devices, a charge-density plasma wave is excited by an ultra-relativistic bunch of charged particles (the drive bunch). The energy in the wave can be extracted by a second bunch (the trailing bunch), as this bunch propagates in the wake of the drive bunch. While a trailing electron bunch was accelerated in a plasma with more than a gigaelectronvolt of energy gain, accelerating a trailing positronmore » bunch in a plasma is much more challenging as the plasma response can be asymmetric for positrons and electrons. We report the demonstration of the energy gain by a distinct trailing positron bunch in a plasma wakefield accelerator, spanning nonlinear to quasi-linear regimes, and unveil the beam loading process underlying the accelerator energy efficiency. A positron bunch is used to drive the plasma wake in the experiment, though the quasi-linear wake structure could as easily be formed by an electron bunch or a laser driver. Finally, the results thus mark the first acceleration of a distinct positron bunch in plasma-based particle accelerators.« less

Application of constrained deconvolution technique for reconstruction of electron bunch profile with strongly non-Gaussian shape

NASA Astrophysics Data System (ADS)

Geloni, G.; Saldin, E. L.; Schneidmiller, E. A.; Yurkov, M. V.

2004-08-01

An effective and practical technique based on the detection of the coherent synchrotron radiation (CSR) spectrum can be used to characterize the profile function of ultra-short bunches. The CSR spectrum measurement has an important limitation: no spectral phase information is available, and the complete profile function cannot be obtained in general. In this paper we propose to use constrained deconvolution method for bunch profile reconstruction based on a priori-known information about formation of the electron bunch. Application of the method is illustrated with practically important example of a bunch formed in a single bunch-compressor. Downstream of the bunch compressor the bunch charge distribution is strongly non-Gaussian with a narrow leading peak and a long tail. The longitudinal bunch distribution is derived by measuring the bunch tail constant with a streak camera and by using a priory available information about profile function.

Propagation of Plasma Bunches through a Transverse Magnetic Barrier

NASA Astrophysics Data System (ADS)

Bishaev, A. M.; Gavrikov, M. B.; Kozintseva, M. V.; Savel'ev, V. V.

2018-01-01

The injection of a plasma bunch into a multipolar trap can be applied to fill the trap with a plasma. The injection of the bunch into a tokamak-like trap can be considered an additional means for controlling the processes of plasma heating and fuel delivery to the central zone of a thermonuclear reactor. In both cases, the bunch is injected normally to the magnetic field of the trap. It has been shown theoretically, experimentally, and by numerical simulation that the depth of plasma bunch penetration into the magnetic field varies in direct proportion to the bunch energy and in inverse proportion to the magnetic pressure and the cross-sectional area of the plasma bunch. The data of this work allow researchers to estimate the values of plasma bunch parameters at which the bunch will be trapped. As a result, the process of plasma bunch trapping has been optimized.

Generation and Analysis of Subpicosecond Double Electron Bunch at the Brookhaven Accelerator Test Facility

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

Babzien, M.; Kusche, K.; Yakimenko, V.

2011-08-09

Two compressed electron beam bunches from a single 60-MeV bunch have been generated in a reproducible manner during compression in the magnetic chicane - 'dog leg' arrangement at ATF. Measurements indicate they have comparable bunch lengths ({approx}100-200 fs) and are separated in energy by {approx}1.8 MeV with the higher-energy bunch preceding the lower-energy bunch by 0.5-1 ps. Some simulation results for analyzing the double-bunch formation process are also presented.

Neuro-symbolic representation learning on biological knowledge graphs.

PubMed

Alshahrani, Mona; Khan, Mohammad Asif; Maddouri, Omar; Kinjo, Akira R; Queralt-Rosinach, Núria; Hoehndorf, Robert

2017-09-01

Biological data and knowledge bases increasingly rely on Semantic Web technologies and the use of knowledge graphs for data integration, retrieval and federated queries. In the past years, feature learning methods that are applicable to graph-structured data are becoming available, but have not yet widely been applied and evaluated on structured biological knowledge. Results: We develop a novel method for feature learning on biological knowledge graphs. Our method combines symbolic methods, in particular knowledge representation using symbolic logic and automated reasoning, with neural networks to generate embeddings of nodes that encode for related information within knowledge graphs. Through the use of symbolic logic, these embeddings contain both explicit and implicit information. We apply these embeddings to the prediction of edges in the knowledge graph representing problems of function prediction, finding candidate genes of diseases, protein-protein interactions, or drug target relations, and demonstrate performance that matches and sometimes outperforms traditional approaches based on manually crafted features. Our method can be applied to any biological knowledge graph, and will thereby open up the increasing amount of Semantic Web based knowledge bases in biology to use in machine learning and data analytics. https://github.com/bio-ontology-research-group/walking-rdf-and-owl. robert.hoehndorf@kaust.edu.sa. Supplementary data are available at Bioinformatics online. © The Author(s) 2017. Published by Oxford University Press.

Solving the Secondary Structure Matching Problem in Cryo-EM De Novo Modeling Using a Constrained K-Shortest Path Graph Algorithm.

PubMed

Al Nasr, Kamal; Ranjan, Desh; Zubair, Mohammad; Chen, Lin; He, Jing

2014-01-01

Electron cryomicroscopy is becoming a major experimental technique in solving the structures of large molecular assemblies. More and more three-dimensional images have been obtained at the medium resolutions between 5 and 10 Å. At this resolution range, major α-helices can be detected as cylindrical sticks and β-sheets can be detected as plain-like regions. A critical question in de novo modeling from cryo-EM images is to determine the match between the detected secondary structures from the image and those on the protein sequence. We formulate this matching problem into a constrained graph problem and present an O(Δ(2)N(2)2(N)) algorithm to this NP-Hard problem. The algorithm incorporates the dynamic programming approach into a constrained K-shortest path algorithm. Our method, DP-TOSS, has been tested using α-proteins with maximum 33 helices and α-β proteins up to five helices and 12 β-strands. The correct match was ranked within the top 35 for 19 of the 20 α-proteins and all nine α-β proteins tested. The results demonstrate that DP-TOSS improves accuracy, time and memory space in deriving the topologies of the secondary structure elements for proteins with a large number of secondary structures and a complex skeleton.

Sub-fs electron bunch generation with sub-10-fs bunch arrival-time jitter via bunch slicing in a magnetic chicane

NASA Astrophysics Data System (ADS)

Zhu, J.; Assmann, R. W.; Dohlus, M.; Dorda, U.; Marchetti, B.

2016-05-01

The generation of ultrashort electron bunches with ultrasmall bunch arrival-time jitter is of vital importance for laser-plasma wakefield acceleration with external injection. We study the production of 100-MeV electron bunches with bunch durations of subfemtosecond (fs) and bunch arrival-time jitters of less than 10 fs, in an S-band photoinjector by using a weak magnetic chicane with a slit collimator. The beam dynamics inside the chicane is simulated by using two codes with different self-force models. The first code separates the self-force into a three-dimensional (3D) quasistatic space-charge model and a one-dimensional coherent synchrotron radiation (CSR) model, while the other one starts from the first principle with a so-called 3D sub-bunch method. The simulations indicate that the CSR effect dominates the horizontal emittance growth and the 1D CSR model underestimates the final bunch duration and emittance because of the very large transverse-to-longitudinal aspect ratio of the sub-fs bunch. Particularly, the CSR effect is also strongly affected by the vertical bunch size. Due to the coupling between the horizontal and longitudinal phase spaces, the bunch duration at the entrance of the last dipole magnet of the chicane is still significantly longer than that at the exit of the chicane, which considerably mitigates the impact of space charge and CSR effects on the beam quality. Exploiting this effect, a bunch charge of up to 4.8 pC in a sub-fs bunch could be simulated. In addition, we analytically and numerically investigate the impact of different jitter sources on the bunch arrival-time jitter downstream of the chicane, and define the tolerance budgets assuming realistic values of the stability of the linac for different bunch charges and compression schemes.

IDEAS.

ERIC Educational Resources Information Center

Young, Sharon L.

1991-01-01

Presented are activities that focus on gathering, using, and interpreting data about fingerprints as a basis for integrating mathematics and science. Patterns, classification, logical reasoning, and mathematical relationships are explored by making graphs, classifying fingerprints, and matching identical fingerprints. A parent-involvement activity…

Beam tuning and bunch length measurement in the bunch compression operation at the cERL

NASA Astrophysics Data System (ADS)

Honda, Y.; Shimada, M.; Miyajima, T.; Hotei, T.; Nakamura, N.; Kato, R.; Obina, T.; Takai, R.; Harada, K.; Ueda, A.

2017-12-01

Realization of a short bunch beam by manipulating the longitudinal phase space distribution with a finite longitudinal dispersion following an off-crest acceleration is a widely used technique. The technique was applied in a compact test accelerator of an energy-recovery linac scheme for compressing the bunch length at the return loop. A diagnostic system utilizing coherent transition radiation was developed for the beam tuning and for estimating the bunch length. By scanning the beam parameters, we experimentally found the best condition for the bunch compression. The RMS bunch length of 250 ±50 fs was obtained at a bunch charge of 2 pC. This result confirmed the design and the tuning procedure of the bunch compression operation for the future energy-recovery linac (ERL).

Spin polarisation of tt¯γγ production at NLO+PS with GoSam interfaced to MadGraph5_aMC@NLO

DOE PAGES

van Deurzen, Hans; Frederix, Rikkert; Hirschi, Valentin; ...

2016-04-22

Here, we present an interface between the multipurpose Monte Carlo tool MadGraph5_aMC@NLO and the automated amplitude generator GoSam. As a first application of this novel framework, we compute the NLO corrections to pp→ tt¯H and pp→ tt¯γγ matched to a parton shower. In the phenomenological analyses of these processes, we focus our attention on observables which are sensitive to the polarisation of the top quarks.

Spin polarisation of tt¯γγ production at NLO+PS with GoSam interfaced to MadGraph5_aMC@NLO

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

van Deurzen, Hans; Frederix, Rikkert; Hirschi, Valentin

Here, we present an interface between the multipurpose Monte Carlo tool MadGraph5_aMC@NLO and the automated amplitude generator GoSam. As a first application of this novel framework, we compute the NLO corrections to pp→ tt¯H and pp→ tt¯γγ matched to a parton shower. In the phenomenological analyses of these processes, we focus our attention on observables which are sensitive to the polarisation of the top quarks.

Observation of electron cloud instabilities and emittance dilution at the Cornell electron-positron Storage ring Test Accelerator

DOE PAGES

Holtzapple, R. L.; Billing, M. G.; Campbell, R. C.; ...

2016-04-11

Electron cloud related emittance dilution and instabilities of bunch trains limit the performance of high intensity circular colliders. One of the key goals of the Cornell electron-positron storage ring Test Accelerator (CesrTA) research program is to improve our understanding of how the electron cloud alters the dynamics of bunches within the train. Single bunch beam diagnostics have been developed to measure the beam spectra, vertical beam size, two important dynamical effects of beams interacting with the electron cloud, for bunch trains on a turn-by-turn basis. Experiments have been performed at CesrTA to probe the interaction of the electron cloud withmore » stored positron bunch trains. The purpose of these experiments was to characterize the dependence of beam-electron cloud interactions on the machine parameters such as bunch spacing, vertical chromaticity, and bunch current. The beam dynamics of the stored beam, in the presence of the electron cloud, was quantified using: 1) a gated beam position monitor (BPM) and spectrum analyzer to measure the bunch-by-bunch frequency spectrum of the bunch trains, 2) an x-ray beam size monitor to record the bunch-by-bunch, turn-by-turn vertical size of each bunch within the trains. In this study we report on the observations from these experiments and analyze the effects of the electron cloud on the stability of bunches in a train under many different operational conditions.« less

Observation of Electron Cloud Instabilities and Emittance Dilution at the Cornell Electron-Positron Storage Ring Test Accelerator

NASA Astrophysics Data System (ADS)

Holtzapple, R. L.; Billing, M. G.; Campbell, R. C.; Dugan, G. F.; Flanagan, J.; McArdle, K. E.; Miller, M. I.; Palmer, M. A.; Ramirez, G. A.; Sonnad, K. G.; Totten, M. M.; Tucker, S. L.; Williams, H. A.

2016-04-01

Electron cloud related emittance dilution and instabilities of bunch trains limit the performance of high intensity circular colliders. One of the key goals of the Cornell electron-positron storage ring Test Accelerator (CesrTA) research program is to improve our understanding of how the electron cloud alters the dynamics of bunches within the train. Single bunch beam diagnotics have been developed to measure the beam spectra, vertical beam size, two important dynamical effects of beams interacting with the electron cloud, for bunch trains on a turn-by-turn basis. Experiments have been performed at CesrTA to probe the interaction of the electron cloud with stored positron bunch trains. The purpose of these experiments was to characterize the dependence of beam-electron cloud interactions on the machine parameters such as bunch spacing, vertical chromaticity, and bunch current. The beam dynamics of the stored beam, in the presence of the electron cloud, was quantified using: 1) a gated beam position monitor (BPM) and spectrum analyzer to measure the bunch-by-bunch frequency spectrum of the bunch trains; 2) an x-ray beam size monitor to record the bunch-by-bunch, turn-by-turn vertical size of each bunch within the trains. In this paper we report on the observations from these experiments and analyze the effects of the electron cloud on the stability of bunches in a train under many different operational conditions.

A graph-based system for network-vulnerability analysis

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

Swiler, L.P.; Phillips, C.

1998-06-01

This paper presents a graph-based approach to network vulnerability analysis. The method is flexible, allowing analysis of attacks from both outside and inside the network. It can analyze risks to a specific network asset, or examine the universe of possible consequences following a successful attack. The graph-based tool can identify the set of attack paths that have a high probability of success (or a low effort cost) for the attacker. The system could be used to test the effectiveness of making configuration changes, implementing an intrusion detection system, etc. The analysis system requires as input a database of common attacks,more » broken into atomic steps, specific network configuration and topology information, and an attacker profile. The attack information is matched with the network configuration information and an attacker profile to create a superset attack graph. Nodes identify a stage of attack, for example the class of machines the attacker has accessed and the user privilege level he or she has compromised. The arcs in the attack graph represent attacks or stages of attacks. By assigning probabilities of success on the arcs or costs representing level-of-effort for the attacker, various graph algorithms such as shortest-path algorithms can identify the attack paths with the highest probability of success.« less

Dynamic extension of the Simulation Problem Analysis Kernel (SPANK)

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

Sowell, E.F.; Buhl, W.F.

1988-07-15

The Simulation Problem Analysis Kernel (SPANK) is an object-oriented simulation environment for general simulation purposes. Among its unique features is use of the directed graph as the primary data structure, rather than the matrix. This allows straightforward use of graph algorithms for matching variables and equations, and reducing the problem graph for efficient numerical solution. The original prototype implementation demonstrated the principles for systems of algebraic equations, allowing simulation of steady-state, nonlinear systems (Sowell 1986). This paper describes how the same principles can be extended to include dynamic objects, allowing simulation of general dynamic systems. The theory is developed andmore » an implementation is described. An example is taken from the field of building energy system simulation. 2 refs., 9 figs.« less

Lattice and beam optics design for suppression of CSR-induced emittance growth at the KEK-ERL test facility

NASA Astrophysics Data System (ADS)

Shimada, M.; Yokoya, K.; Suwada, T.; Enomoto, A.

2007-06-01

The lattice and beam optics of the arc section of the KEK-ERL test facility, having an energy of 200 MeV, were optimized to efficiently suppress emittance growth based on a simulation using a particle-tracking method taking coherent synchrotron radiation effects into account. The lattice optimization in the arc section was performed under two conditions: a high-current mode with a bunch charge of 76.9 pC without bunch compression, and a short-bunch mode with bunch compression, producing a final bunch length of around 0.1 ps. The simulation results showed that, in the high-current mode, emittance growth was efficiently suppressed by keeping a root-mean-square (rms) bunch length of 1 ps at a bunch charge of 76.9 pC, and in the short-bunch mode, emittance growth was kept within permissible limits with a maximum allowable bunch charge of 23.1 pC at an rms bunch length of 0.1 ps.

Registration of 3D spectral OCT volumes combining ICP with a graph-based approach

NASA Astrophysics Data System (ADS)

Niemeijer, Meindert; Lee, Kyungmoo; Garvin, Mona K.; Abràmoff, Michael D.; Sonka, Milan

2012-02-01

The introduction of spectral Optical Coherence Tomography (OCT) scanners has enabled acquisition of high resolution, 3D cross-sectional volumetric images of the retina. 3D-OCT is used to detect and manage eye diseases such as glaucoma and age-related macular degeneration. To follow-up patients over time, image registration is a vital tool to enable more precise, quantitative comparison of disease states. In this work we present a 3D registrationmethod based on a two-step approach. In the first step we register both scans in the XY domain using an Iterative Closest Point (ICP) based algorithm. This algorithm is applied to vessel segmentations obtained from the projection image of each scan. The distance minimized in the ICP algorithm includes measurements of the vessel orientation and vessel width to allow for a more robust match. In the second step, a graph-based method is applied to find the optimal translation along the depth axis of the individual A-scans in the volume to match both scans. The cost image used to construct the graph is based on the mean squared error (MSE) between matching A-scans in both images at different translations. We have applied this method to the registration of Optic Nerve Head (ONH) centered 3D-OCT scans of the same patient. First, 10 3D-OCT scans of 5 eyes with glaucoma imaged in vivo were registered for a qualitative evaluation of the algorithm performance. Then, 17 OCT data set pairs of 17 eyes with known deformation were used for quantitative assessment of the method's robustness.

On Bipartite Graphs Trees and Their Partial Vertex Covers.

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

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

2015-03-01

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

A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs

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

Choudhury, Sutanay; Holder, Larry; Chin, George

2015-05-27

Cyber security is one of the most significant technical challenges in current times. Detecting adversarial activities, prevention of theft of intellectual properties and customer data is a high priority for corporations and government agencies around the world. Cyber defenders need to analyze massive-scale, high-resolution network flows to identify, categorize, and mitigate attacks involving networks spanning institutional and national boundaries. Many of the cyber attacks can be described as subgraph patterns, with prominent examples being insider infiltrations (path queries), denial of service (parallel paths) and malicious spreads (tree queries). This motivates us to explore subgraph matching on streaming graphs in amore » continuous setting. The novelty of our work lies in using the subgraph distributional statistics collected from the streaming graph to determine the query processing strategy. We introduce a ``Lazy Search" algorithm where the search strategy is decided on a vertex-to-vertex basis depending on the likelihood of a match in the vertex neighborhood. We also propose a metric named ``Relative Selectivity" that is used to select between different query processing strategies. Our experiments performed on real online news, network traffic stream and a synthetic social network benchmark demonstrate 10-100x speedups over non-incremental, selectivity agnostic approaches.« less

Optimizing Search and Ranking in Folksonomy Systems by Exploiting Context Information

NASA Astrophysics Data System (ADS)

Abel, Fabian; Henze, Nicola; Krause, Daniel

Tagging systems enable users to annotate resources with freely chosen keywords. The evolving bunch of tag assignments is called folksonomy and there exist already some approaches that exploit folksonomies to improve resource retrieval. In this paper, we analyze and compare graph-based ranking algorithms: FolkRank and SocialPageRank. We enhance these algorithms by exploiting the context of tags, and evaluate the results on the GroupMe! dataset. In GroupMe!, users can organize and maintain arbitrary Web resources in self-defined groups. When users annotate resources in GroupMe!, this can be interpreted in context of a certain group. The grouping activity itself is easy for users to perform. However, it delivers valuable semantic information about resources and their context. We present GRank that uses the context information to improve and optimize the detection of relevant search results, and compare different strategies for ranking result lists in folksonomy systems.

A Multi-Scale Settlement Matching Algorithm Based on ARG

NASA Astrophysics Data System (ADS)

Yue, Han; Zhu, Xinyan; Chen, Di; Liu, Lingjia

2016-06-01

Homonymous entity matching is an important part of multi-source spatial data integration, automatic updating and change detection. Considering the low accuracy of existing matching methods in dealing with matching multi-scale settlement data, an algorithm based on Attributed Relational Graph (ARG) is proposed. The algorithm firstly divides two settlement scenes at different scales into blocks by small-scale road network and constructs local ARGs in each block. Then, ascertains candidate sets by merging procedures and obtains the optimal matching pairs by comparing the similarity of ARGs iteratively. Finally, the corresponding relations between settlements at large and small scales are identified. At the end of this article, a demonstration is presented and the results indicate that the proposed algorithm is capable of handling sophisticated cases.

High-Precision Phenotyping of Grape Bunch Architecture Using Fast 3D Sensor and Automation.

PubMed

Rist, Florian; Herzog, Katja; Mack, Jenny; Richter, Robert; Steinhage, Volker; Töpfer, Reinhard

2018-03-02

Wine growers prefer cultivars with looser bunch architecture because of the decreased risk for bunch rot. As a consequence, grapevine breeders have to select seedlings and new cultivars with regard to appropriate bunch traits. Bunch architecture is a mosaic of different single traits which makes phenotyping labor-intensive and time-consuming. In the present study, a fast and high-precision phenotyping pipeline was developed. The optical sensor Artec Spider 3D scanner (Artec 3D, L-1466, Luxembourg) was used to generate dense 3D point clouds of grapevine bunches under lab conditions and an automated analysis software called 3D-Bunch-Tool was developed to extract different single 3D bunch traits, i.e., the number of berries, berry diameter, single berry volume, total volume of berries, convex hull volume of grapes, bunch width and bunch length. The method was validated on whole bunches of different grapevine cultivars and phenotypic variable breeding material. Reliable phenotypic data were obtained which show high significant correlations (up to r² = 0.95 for berry number) compared to ground truth data. Moreover, it was shown that the Artec Spider can be used directly in the field where achieved data show comparable precision with regard to the lab application. This non-invasive and non-contact field application facilitates the first high-precision phenotyping pipeline based on 3D bunch traits in large plant sets.

Non-rigid image registration using graph-cuts.

PubMed

Tang, Tommy W H; Chung, Albert C S

2007-01-01

Non-rigid image registration is an ill-posed yet challenging problem due to its supernormal high degree of freedoms and inherent requirement of smoothness. Graph-cuts method is a powerful combinatorial optimization tool which has been successfully applied into image segmentation and stereo matching. Under some specific constraints, graph-cuts method yields either a global minimum or a local minimum in a strong sense. Thus, it is interesting to see the effects of using graph-cuts in non-rigid image registration. In this paper, we formulate non-rigid image registration as a discrete labeling problem. Each pixel in the source image is assigned a displacement label (which is a vector) indicating which position in the floating image it is spatially corresponding to. A smoothness constraint based on first derivative is used to penalize sharp changes in displacement labels across pixels. The whole system can be optimized by using the graph-cuts method via alpha-expansions. We compare 2D and 3D registration results of our method with two state-of-the-art approaches. It is found that our method is more robust to different challenging non-rigid registration cases with higher registration accuracy.

Counting in Lattices: Combinatorial Problems from Statistical Mechanics.

NASA Astrophysics Data System (ADS)

Randall, Dana Jill

In this thesis we consider two classical combinatorial problems arising in statistical mechanics: counting matchings and self-avoiding walks in lattice graphs. The first problem arises in the study of the thermodynamical properties of monomers and dimers (diatomic molecules) in crystals. Fisher, Kasteleyn and Temperley discovered an elegant technique to exactly count the number of perfect matchings in two dimensional lattices, but it is not applicable for matchings of arbitrary size, or in higher dimensional lattices. We present the first efficient approximation algorithm for computing the number of matchings of any size in any periodic lattice in arbitrary dimension. The algorithm is based on Monte Carlo simulation of a suitable Markov chain and has rigorously derived performance guarantees that do not rely on any assumptions. In addition, we show that these results generalize to counting matchings in any graph which is the Cayley graph of a finite group. The second problem is counting self-avoiding walks in lattices. This problem arises in the study of the thermodynamics of long polymer chains in dilute solution. While there are a number of Monte Carlo algorithms used to count self -avoiding walks in practice, these are heuristic and their correctness relies on unproven conjectures. In contrast, we present an efficient algorithm which relies on a single, widely-believed conjecture that is simpler than preceding assumptions and, more importantly, is one which the algorithm itself can test. Thus our algorithm is reliable, in the sense that it either outputs answers that are guaranteed, with high probability, to be correct, or finds a counterexample to the conjecture. In either case we know we can trust our results and the algorithm is guaranteed to run in polynomial time. This is the first algorithm for counting self-avoiding walks in which the error bounds are rigorously controlled. This work was supported in part by an AT&T graduate fellowship, a University of California dissertation year fellowship and Esprit working group "RAND". Part of this work was done while visiting ICSI and the University of Edinburgh.

Layout of bunch compressor for Beijing XFEL test facility

NASA Astrophysics Data System (ADS)

Zhu, Xiongwei; Du, Yingchao; He, Xiaozhong; Yang, Yufeng

2006-10-01

In this paper, we describe the layout of the bunch compressor for the Beijing XFEL test facility (BTF). Our bunch compressor setup is different from the usual one due to the space limit. The compensation X-BAND cavity and the first bunch compressor are separate in distance. The electron bunch is decelerated first and then accelerated to enter the first bunch compressor. The simulation result shows that our setup works well, and the nonlinear term is well compensated. Also, we present the result about the CSR emittance dilution study. Finally, we develop a program to study microbunch instability in the second BTF bunch compressor.

Generation and measurement of velocity bunched ultrashort bunch of pC charge

NASA Astrophysics Data System (ADS)

Lu, X. H.; Tang, C. X.; Li, R. K.; To, H.; Andonian, G.; Musumeci, P.

2015-03-01

In this paper, we discuss the velocity compression in a short rf linac of an electron bunch from a rf photoinjector operated in the blowout regime. Particle tracking simulations shows that with a beam charge of 2 pC an ultrashort bunch duration of 16 fs can be obtained at a tight longitudinal focus downstream of the linac. A simplified coherent transition radiation (CTR) spectrum method is developed to enable the measurement of ultrashort (sub-50 fs) bunches at low bunch energy (5 MeV) and low bunch charges (<10 pC ). In this method, the ratio of the radiation energy selected by two narrow bandwidth filters is used to estimate the bunch length. The contribution to the coherent form factor of the large transverse size of the bunch suppresses the radiation signal significantly and is included in the analysis. The experiment was performed at the UCLA Pegasus photoinjector laboratory. The measurement results show bunches of sub-40 fs with 2 pC of charge well consistent with the simulation using actual experimental conditions. These results open the way to the generation of ultrashort bunches with time-duration below 10 fs once some of the limitations of the setup (rf phase jitter, amplitude instability and low field in the gun limited by breakdown) are corrected.

Theoretical analysis and simulation study of the deep overcompression mode of velocity bunching for a comblike electron bunch train

NASA Astrophysics Data System (ADS)

Wang, Dan; Yan, Lixin; Du, YingChao; Huang, Wenhui; Gai, Wei; Tang, Chuanxiang

2018-02-01

Premodulated comblike electron bunch trains are used in a wide range of research fields, such as for wakefield-based particle acceleration and tunable radiation sources. We propose an optimized compression scheme for bunch trains in which a traveling wave accelerator tube and a downstream drift segment are together used as a compressor. When the phase injected into the accelerator tube for the bunch train is set to ≪-10 0 ° , velocity bunching occurs in a deep overcompression mode, which reverses the phase space and maintains a velocity difference within the injected beam, thereby giving rise to a compressed comblike electron bunch train after a few-meter-long drift segment; we call this the deep overcompression scheme. The main benefits of this scheme are the relatively large phase acceptance and the uniformity of compression for the bunch train. The comblike bunch train generated via this scheme is widely tunable: For the two-bunch case, the energy and time spacings can be continuously adjusted from +1 to -1 MeV and from 13 to 3 ps, respectively, by varying the injected phase of the bunch train from -22 0 ° to -14 0 ° . Both theoretical analysis and beam dynamics simulations are presented to study the properties of the deep overcompression scheme.

Reconstruction and simplification of urban scene models based on oblique images

NASA Astrophysics Data System (ADS)

Liu, J.; Guo, B.

2014-08-01

We describe a multi-view stereo reconstruction and simplification algorithms for urban scene models based on oblique images. The complexity, diversity, and density within the urban scene, it increases the difficulty to build the city models using the oblique images. But there are a lot of flat surfaces existing in the urban scene. One of our key contributions is that a dense matching algorithm based on Self-Adaptive Patch in view of the urban scene is proposed. The basic idea of matching propagating based on Self-Adaptive Patch is to build patches centred by seed points which are already matched. The extent and shape of the patches can adapt to the objects of urban scene automatically: when the surface is flat, the extent of the patch would become bigger; while the surface is very rough, the extent of the patch would become smaller. The other contribution is that the mesh generated by Graph Cuts is 2-manifold surface satisfied the half edge data structure. It is solved by clustering and re-marking tetrahedrons in s-t graph. The purpose of getting 2- manifold surface is to simply the mesh by edge collapse algorithm which can preserve and stand out the features of buildings.

Spatio-Semantic Comparison of Large 3d City Models in Citygml Using a Graph Database

NASA Astrophysics Data System (ADS)

Nguyen, S. H.; Yao, Z.; Kolbe, T. H.

2017-10-01

A city may have multiple CityGML documents recorded at different times or surveyed by different users. To analyse the city's evolution over a given period of time, as well as to update or edit the city model without negating modifications made by other users, it is of utmost importance to first compare, detect and locate spatio-semantic changes between CityGML datasets. This is however difficult due to the fact that CityGML elements belong to a complex hierarchical structure containing multi-level deep associations, which can basically be considered as a graph. Moreover, CityGML allows multiple syntactic ways to define an object leading to syntactic ambiguities in the exchange format. Furthermore, CityGML is capable of including not only 3D urban objects' graphical appearances but also their semantic properties. Since to date, no known algorithm is capable of detecting spatio-semantic changes in CityGML documents, a frequent approach is to replace the older models completely with the newer ones, which not only costs computational resources, but also loses track of collaborative and chronological changes. Thus, this research proposes an approach capable of comparing two arbitrarily large-sized CityGML documents on both semantic and geometric level. Detected deviations are then attached to their respective sources and can easily be retrieved on demand. As a result, updating a 3D city model using this approach is much more efficient as only real changes are committed. To achieve this, the research employs a graph database as the main data structure for storing and processing CityGML datasets in three major steps: mapping, matching and updating. The mapping process transforms input CityGML documents into respective graph representations. The matching process compares these graphs and attaches edit operations on the fly. Found changes can then be executed using the Web Feature Service (WFS), the standard interface for updating geographical features across the web.

Representation mutations from standard genetic codes

NASA Astrophysics Data System (ADS)

Aisah, I.; Suyudi, M.; Carnia, E.; Suhendi; Supriatna, A. K.

2018-03-01

Graph is widely used in everyday life especially to describe model problem and describe it concretely and clearly. In addition graph is also used to facilitate solve various kinds of problems that are difficult to be solved by calculation. In Biology, graph can be used to describe the process of protein synthesis in DNA. Protein has an important role for DNA (deoxyribonucleic acid) or RNA (ribonucleic acid). Proteins are composed of amino acids. In this study, amino acids are related to genetics, especially the genetic code. The genetic code is also known as the triplet or codon code which is a three-letter arrangement of DNA nitrogen base. The bases are adenine (A), thymine (T), guanine (G) and cytosine (C). While on RNA thymine (T) is replaced with Urasil (U). The set of all Nitrogen bases in RNA is denoted by N = {C U, A, G}. This codon works at the time of protein synthesis inside the cell. This codon also encodes the stop signal as a sign of the stop of protein synthesis process. This paper will examine the process of protein synthesis through mathematical studies and present it in three-dimensional space or graph. The study begins by analysing the set of all codons denoted by NNN such that to obtain geometric representations. At this stage there is a matching between the sets of all nitrogen bases N with Z 2 × Z 2; C=(\\overline{0},\\overline{0}),{{U}}=(\\overline{0},\\overline{1}),{{A}}=(\\overline{1},\\overline{0}),{{G}}=(\\overline{1},\\overline{1}). By matching the algebraic structure will be obtained such as group, group Klein-4,Quotien group etc. With the help of Geogebra software, the set of all codons denoted by NNN can be presented in a three-dimensional space as a multicube NNN and also can be represented as a graph, so that can easily see relationship between the codon.

Visual traffic jam analysis based on trajectory data.

PubMed

Wang, Zuchao; Lu, Min; Yuan, Xiaoru; Zhang, Junping; van de Wetering, Huub

2013-12-01

In this work, we present an interactive system for visual analysis of urban traffic congestion based on GPS trajectories. For these trajectories we develop strategies to extract and derive traffic jam information. After cleaning the trajectories, they are matched to a road network. Subsequently, traffic speed on each road segment is computed and traffic jam events are automatically detected. Spatially and temporally related events are concatenated in, so-called, traffic jam propagation graphs. These graphs form a high-level description of a traffic jam and its propagation in time and space. Our system provides multiple views for visually exploring and analyzing the traffic condition of a large city as a whole, on the level of propagation graphs, and on road segment level. Case studies with 24 days of taxi GPS trajectories collected in Beijing demonstrate the effectiveness of our system.

Staging optics considerations for a plasma wakefield acceleration linear collider

NASA Astrophysics Data System (ADS)

Lindstrøm, C. A.; Adli, E.; Allen, J. M.; Delahaye, J. P.; Hogan, M. J.; Joshi, C.; Muggli, P.; Raubenheimer, T. O.; Yakimenko, V.

2016-09-01

Plasma wakefield acceleration offers acceleration gradients of several GeV/m, ideal for a next-generation linear collider. The beam optics requirements between plasma cells include injection and extraction of drive beams, matching the main beam beta functions into the next cell, canceling dispersion as well as constraining bunch lengthening and chromaticity. To maintain a high effective acceleration gradient, this must be accomplished in the shortest distance possible. A working example is presented, using novel methods to correct chromaticity, as well as scaling laws for a high energy regime.

Generation and measurement of velocity bunched ultrashort bunch of pC charge

DOE PAGES

Lu, X.  H.; Tang, C.  X.; Li, R.  K.; ...

2015-03-01

In this paper, we discuss the velocity compression in a short rf linac of an electron bunch from a rf photoinjector operated in the blowout regime. Particle tracking simulations shows that with a beam charge of 2 pC an ultrashort bunch duration of 16 fs can be obtained at a tight longitudinal focus downstream of the linac. A simplified coherent transition radiation (CTR) spectrum method is developed to enable the measurement of ultrashort (sub-50 fs) bunches at low bunch energy (5 MeV) and low bunch charges (<10 pC). In this method, the ratio of the radiation energy selected by twomore » narrow bandwidth filters is used to estimate the bunch length. The contribution to the coherent form factor of the large transverse size of the bunch suppresses the radiation signal significantly and is included in the analysis. The experiment was performed at the UCLA Pegasus photoinjector laboratory. The measurement results show bunches of sub-40 fs with 2 pC of charge well consistent with the simulation using actual experimental conditions. These results open the way to the generation of ultrashort bunches with time-duration below 10 fs once some of the limitations of the setup (rf phase jitter, amplitude instability and low field in the gun limited by breakdown) are corrected.« less

Drosophila bunched integrates opposing DPP and EGF signals to set the operculum boundary.

PubMed

Dobens, L L; Peterson, J S; Treisman, J; Raftery, L A

2000-02-01

The Drosophila BMP homolog DPP can function as a morphogen, inducing multiple cell fates across a developmental field. However, it is unknown how graded levels of extracellular DPP are interpreted to organize a sharp boundary between different fates. Here we show that opposing DPP and EGF signals set the boundary for an ovarian follicle cell fate. First, DPP regulates gene expression in the follicle cells that will create the operculum of the eggshell. DPP induces expression of the enhancer trap reporter A359 and represses expression of bunched, which encodes a protein similar to the mammalian transcription factor TSC-22. Second, DPP signaling indirectly regulates A359 expression in these cells by downregulating expression of bunched. Reduced bunched function restores A359 expression in cells that lack the Smad protein MAD; ectopic expression of BUNCHED suppresses A359 expression in this region. Importantly, reduction of bunched function leads to an expansion of the operculum and loss of the collar at its boundary. Third, EGF signaling upregulates expression of bunched. We previously demonstrated that the bunched expression pattern requires the EGF receptor ligand GURKEN. Here we show that activated EGF receptor is sufficient to induce ectopic bunched expression. Thus, the balance of DPP and EGF signals sets the boundary of bunched expression. We propose that the juxtaposition of cells with high and low BUNCHED activity organizes a sharp boundary for the operculum fate.

A New Approach for Semantic Web Matching

NASA Astrophysics Data System (ADS)

Zamanifar, Kamran; Heidary, Golsa; Nematbakhsh, Naser; Mardukhi, Farhad

In this work we propose a new approach for semantic web matching to improve the performance of Web Service replacement. Because in automatic systems we should ensure the self-healing, self-configuration, self-optimization and self-management, all services should be always available and if one of them crashes, it should be replaced with the most similar one. Candidate services are advertised in Universal Description, Discovery and Integration (UDDI) all in Web Ontology Language (OWL). By the help of bipartite graph, we did the matching between the crashed service and a Candidate one. Then we chose the best service, which had the maximum rate of matching. In fact we compare two services' functionalities and capabilities to see how much they match. We found that the best way for matching two web services, is comparing the functionalities of them.

RF kicker cavity to increase control in common transport lines

DOEpatents

Douglas, David R.; Ament, Lucas J. P.

2017-04-18

A method of controlling e-beam transport where electron bunches with different characteristics travel through the same beam pipe. An RF kicker cavity is added at the beginning of the common transport pipe or at various locations along the common transport path to achieve independent control of different bunch types. RF energy is applied by the kicker cavity kicks some portion of the electron bunches, separating the bunches in phase space to allow independent control via optics, or separating bunches into different beam pipes. The RF kicker cavity is operated at a specific frequency to enable kicking of different types of bunches in different directions. The phase of the cavity is set such that the selected type of bunch passes through the cavity when the RF field is at a node, leaving that type of bunch unaffected. Beam optics may be added downstream of the kicker cavity to cause a further separation in phase space.

A novel source of MeV positron bunches driven by energetic protons for PAS application

NASA Astrophysics Data System (ADS)

Tan, Zongquan; Xu, Wenzhen; Liu, Yanfen; Xiao, Ran; Kong, Wei; Ye, Bangjiao

2014-11-01

This paper proposes a novel methodology of MeV positrons generation for PAS application. Feasibility of this proposal analyzed by G4Beamline and Transport have shown reasonable success. Using 2 Hz, 1.6 GeV, 100 ns and 1.5 μC/bunch proton bunches for bombarding a graphite target, about 100 ns e+ bunches are generated. Quasi-monochromatic positrons in the range of 1-10 MeV included in these bunches have a flux of >107/s, peak brightness of 1014/s. A magnetic-confinement beamline is utilized to transport the positrons and a "Fast Beam Chopper" is unprecedentedly extended to chop those relativistic bunches. The positron beam can be finally characterized by the energy range of 1-10 MeV and bunch width from one hundred ps up to 1 ns. Such ultrashort bunches can be useful in tomography-type positron annihilation spectroscopy (PAS) as well as other applications.

Automatic classification of protein structures relying on similarities between alignments

PubMed Central

2012-01-01

Background Identification of protein structural cores requires isolation of sets of proteins all sharing a same subset of structural motifs. In the context of an ever growing number of available 3D protein structures, standard and automatic clustering algorithms require adaptations so as to allow for efficient identification of such sets of proteins. Results When considering a pair of 3D structures, they are stated as similar or not according to the local similarities of their matching substructures in a structural alignment. This binary relation can be represented in a graph of similarities where a node represents a 3D protein structure and an edge states that two 3D protein structures are similar. Therefore, classifying proteins into structural families can be viewed as a graph clustering task. Unfortunately, because such a graph encodes only pairwise similarity information, clustering algorithms may include in the same cluster a subset of 3D structures that do not share a common substructure. In order to overcome this drawback we first define a ternary similarity on a triple of 3D structures as a constraint to be satisfied by the graph of similarities. Such a ternary constraint takes into account similarities between pairwise alignments, so as to ensure that the three involved protein structures do have some common substructure. We propose hereunder a modification algorithm that eliminates edges from the original graph of similarities and gives a reduced graph in which no ternary constraints are violated. Our approach is then first to build a graph of similarities, then to reduce the graph according to the modification algorithm, and finally to apply to the reduced graph a standard graph clustering algorithm. Such method was used for classifying ASTRAL-40 non-redundant protein domains, identifying significant pairwise similarities with Yakusa, a program devised for rapid 3D structure alignments. Conclusions We show that filtering similarities prior to standard graph based clustering process by applying ternary similarity constraints i) improves the separation of proteins of different classes and consequently ii) improves the classification quality of standard graph based clustering algorithms according to the reference classification SCOP. PMID:22974051

Color and Contour Based Identification of Stem of Coconut Bunch

NASA Astrophysics Data System (ADS)

Kannan Megalingam, Rajesh; Manoharan, Sakthiprasad K.; Reddy, Rajesh G.; Sriteja, Gone; Kashyap, Ashwin

2017-08-01

Vision is the key component of Artificial Intelligence and Automated Robotics. Sensors or Cameras are the sight organs for a robot. Only through this, they are able to locate themselves or identify the shape of a regular or an irregular object. This paper presents the method of Identification of an object based on color and contour recognition using a camera through digital image processing techniques for robotic applications. In order to identify the contour, shape matching technique is used, which takes the input data from the database provided, and uses it to identify the contour by checking for shape match. The shape match is based on the idea of iterating through each contour of the threshold image. The color is identified on HSV Scale, by approximating the desired range of values from the database. HSV data along with iteration is used for identifying a quadrilateral, which is our required contour. This algorithm could also be used in a non-deterministic plane, which only uses HSV values exclusively.

Towards Attosecond High-Energy Electron Bunches: Controlling Self-Injection in Laser-Wakefield Accelerators Through Plasma-Density Modulation

NASA Astrophysics Data System (ADS)

Tooley, M. P.; Ersfeld, B.; Yoffe, S. R.; Noble, A.; Brunetti, E.; Sheng, Z. M.; Islam, M. R.; Jaroszynski, D. A.

2017-07-01

Self-injection in a laser-plasma wakefield accelerator is usually achieved by increasing the laser intensity until the threshold for injection is exceeded. Alternatively, the velocity of the bubble accelerating structure can be controlled using plasma density ramps, reducing the electron velocity required for injection. We present a model describing self-injection in the short-bunch regime for arbitrary changes in the plasma density. We derive the threshold condition for injection due to a plasma density gradient, which is confirmed using particle-in-cell simulations that demonstrate injection of subfemtosecond bunches. It is shown that the bunch charge, bunch length, and separation of bunches in a bunch train can be controlled by tailoring the plasma density profile.

Stability condition for the drive bunch in a collinear wakefield accelerator

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

Baturin, S. S.; Zholents, A.

The beam breakup instability of the drive bunch in the structure-based collinear wakefield accelerator is considered and a stabilizing method is proposed. The method includes using the specially designed beam focusing channel, applying the energy chirp along the electron bunch, and keeping energy chirp constant during the drive bunch deceleration. A stability condition is derived that defines the limit on the accelerating field for the witness bunch.

Transformer ratio saturation in a beam-driven wakefield accelerator

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

Farmer, J. P.; Martorelli, R.; Pukhov, A.

We show that for beam-driven wakefield acceleration, the linearly ramped, equally spaced train of bunches typically considered to optimise the transformer ratio only works for flat-top bunches. Through theory and simulation, we explain that this behaviour is due to the unique properties of the plasma response to a flat-top density profile. Calculations of the optimal scaling for a train of Gaussian bunches show diminishing returns with increasing bunch number, tending towards saturation. For a periodic bunch train, a transformer ratio of 23 was achieved for 50 bunches, rising to 40 for a fully optimised beam.

Halloween High Jinks.

ERIC Educational Resources Information Center

Andrews, Doreen; And Others

1992-01-01

Presents a collection of fall and Halloween activities for elementary students, including pumpkin poetry, batty bulletin boards (graphing), vegetable variety art, old time radio mysteries, paper doll Halloween safety, career dress-up day, imaginative Halloween writing, and matching animals with foods they eat. A student page offers a Dracula…

Classification of ligand molecules in PDB with fast heuristic graph match algorithm COMPLIG.

PubMed

Saito, Mihoko; Takemura, Naomi; Shirai, Tsuyoshi

2012-12-14

A fast heuristic graph-matching algorithm, COMPLIG, was devised to classify the small-molecule ligands in the Protein Data Bank (PDB), which are currently not properly classified on structure basis. By concurrently classifying proteins and ligands, we determined the most appropriate parameter for categorizing ligands to be more than 60% identity of atoms and bonds between molecules, and we classified 11,585 types of ligands into 1946 clusters. Although the large clusters were composed of nucleotides or amino acids, a significant presence of drug compounds was also observed. Application of the system to classify the natural ligand status of human proteins in the current database suggested that, at most, 37% of the experimental structures of human proteins were in complex with natural ligands. However, protein homology- and/or ligand similarity-based modeling was implied to provide models of natural interactions for an additional 28% of the total, which might be used to increase the knowledge of intrinsic protein-metabolite interactions. Copyright © 2012 Elsevier Ltd. All rights reserved.

Efficient Generation of Dancing Animation Synchronizing with Music Based on Meta Motion Graphs

NASA Astrophysics Data System (ADS)

Xu, Jianfeng; Takagi, Koichi; Sakazawa, Shigeyuki

This paper presents a system for automatic generation of dancing animation that is synchronized with a piece of music by re-using motion capture data. Basically, the dancing motion is synthesized according to the rhythm and intensity features of music. For this purpose, we propose a novel meta motion graph structure to embed the necessary features including both rhythm and intensity, which is constructed on the motion capture database beforehand. In this paper, we consider two scenarios for non-streaming music and streaming music, where global search and local search are required respectively. In the case of the former, once a piece of music is input, the efficient dynamic programming algorithm can be employed to globally search a best path in the meta motion graph, where an objective function is properly designed by measuring the quality of beat synchronization, intensity matching, and motion smoothness. In the case of the latter, the input music is stored in a buffer in a streaming mode, then an efficient search method is presented for a certain amount of music data (called a segment) in the buffer with the same objective function, resulting in a segment-based search approach. For streaming applications, we define an additional property in the above meta motion graph to deal with the unpredictable future music, which guarantees that there is some motion to match the unknown remaining music. A user study with totally 60 subjects demonstrates that our system outperforms the stat-of-the-art techniques in both scenarios. Furthermore, our system improves the synthesis speed greatly (maximal speedup is more than 500 times), which is essential for mobile applications. We have implemented our system on commercially available smart phones and confirmed that it works well on these mobile phones.

Structure-Based Low-Rank Model With Graph Nuclear Norm Regularization for Noise Removal.

PubMed

Ge, Qi; Jing, Xiao-Yuan; Wu, Fei; Wei, Zhi-Hui; Xiao, Liang; Shao, Wen-Ze; Yue, Dong; Li, Hai-Bo

2017-07-01

Nonlocal image representation methods, including group-based sparse coding and block-matching 3-D filtering, have shown their great performance in application to low-level tasks. The nonlocal prior is extracted from each group consisting of patches with similar intensities. Grouping patches based on intensity similarity, however, gives rise to disturbance and inaccuracy in estimation of the true images. To address this problem, we propose a structure-based low-rank model with graph nuclear norm regularization. We exploit the local manifold structure inside a patch and group the patches by the distance metric of manifold structure. With the manifold structure information, a graph nuclear norm regularization is established and incorporated into a low-rank approximation model. We then prove that the graph-based regularization is equivalent to a weighted nuclear norm and the proposed model can be solved by a weighted singular-value thresholding algorithm. Extensive experiments on additive white Gaussian noise removal and mixed noise removal demonstrate that the proposed method achieves a better performance than several state-of-the-art algorithms.

A fuzzy pattern matching method based on graph kernel for lithography hotspot detection

NASA Astrophysics Data System (ADS)

Nitta, Izumi; Kanazawa, Yuzi; Ishida, Tsutomu; Banno, Koji

2017-03-01

In advanced technology nodes, lithography hotspot detection has become one of the most significant issues in design for manufacturability. Recently, machine learning based lithography hotspot detection has been widely investigated, but it has trade-off between detection accuracy and false alarm. To apply machine learning based technique to the physical verification phase, designers require minimizing undetected hotspots to avoid yield degradation. They also need a ranking of similar known patterns with a detected hotspot to prioritize layout pattern to be corrected. To achieve high detection accuracy and to prioritize detected hotspots, we propose a novel lithography hotspot detection method using Delaunay triangulation and graph kernel based machine learning. Delaunay triangulation extracts features of hotspot patterns where polygons locate irregularly and closely one another, and graph kernel expresses inner structure of graphs. Additionally, our method provides similarity between two patterns and creates a list of similar training patterns with a detected hotspot. Experiments results on ICCAD 2012 benchmarks show that our method achieves high accuracy with allowable range of false alarm. We also show the ranking of the similar known patterns with a detected hotspot.

MATCH: An Atom- Typing Toolset for Molecular Mechanics Force Fields

PubMed Central

Yesselman, Joseph D.; Price, Daniel J.; Knight, Jennifer L.; Brooks, Charles L.

2011-01-01

We introduce a toolset of program libraries collectively titled MATCH (Multipurpose Atom-Typer for CHARMM) for the automated assignment of atom types and force field parameters for molecular mechanics simulation of organic molecules. The toolset includes utilities for the conversion from multiple chemical structure file formats into a molecular graph. A general chemical pattern-matching engine using this graph has been implemented whereby assignment of molecular mechanics atom types, charges and force field parameters is achieved by comparison against a customizable list of chemical fragments. While initially designed to complement the CHARMM simulation package and force fields by generating the necessary input topology and atom-type data files, MATCH can be expanded to any force field and program, and has core functionality that makes it extendable to other applications such as fragment-based property prediction. In the present work, we demonstrate the accurate construction of atomic parameters of molecules within each force field included in CHARMM36 through exhaustive cross validation studies illustrating that bond increment rules derived from one force field can be transferred to another. In addition, using leave-one-out substitution it is shown that it is also possible to substitute missing intra and intermolecular parameters with ones included in a force field to complete the parameterization of novel molecules. Finally, to demonstrate the robustness of MATCH and the coverage of chemical space offered by the recent CHARMM CGENFF force field (Vanommeslaeghe, et al., JCC., 2010, 31, 671–690), one million molecules from the PubChem database of small molecules are typed, parameterized and minimized. PMID:22042689

Measuring Primary Students' Graph Interpretation Skills Via a Performance Assessment: A case study in instrument development

NASA Astrophysics Data System (ADS)

Peterman, Karen; Cranston, Kayla A.; Pryor, Marie; Kermish-Allen, Ruth

2015-11-01

This case study was conducted within the context of a place-based education project that was implemented with primary school students in the USA. The authors and participating teachers created a performance assessment of standards-aligned tasks to examine 6-10-year-old students' graph interpretation skills as part of an exploratory research project. Fifty-five students participated in a performance assessment interview at the beginning and end of a place-based investigation. Two forms of the assessment were created and counterbalanced within class at pre and post. In situ scoring was conducted such that responses were scored as correct versus incorrect during the assessment's administration. Criterion validity analysis demonstrated an age-level progression in student scores. Tests of discriminant validity showed that the instrument detected variability in interpretation skills across each of three graph types (line, bar, dot plot). Convergent validity was established by correlating in situ scores with those from the Graph Interpretation Scoring Rubric. Students' proficiency with interpreting different types of graphs matched expectations based on age and the standards-based progression of graphs across primary school grades. The assessment tasks were also effective at detecting pre-post gains in students' interpretation of line graphs and dot plots after the place-based project. The results of the case study are discussed in relation to the common challenges associated with performance assessment. Implications are presented in relation to the need for authentic and performance-based instructional and assessment tasks to respond to the Common Core State Standards and the Next Generation Science Standards.

Measuring short electron bunch lengths using coherent smith-purcell radiation

DOEpatents

Nguyen, Dinh C.

1999-01-01

A method is provided for directly determining the length of sub-picosecond electron bunches. A metallic grating is formed with a groove spacing greater than a length expected for the electron bunches. The electron bunches are passed over the metallic grating to generate coherent and incoherent Smith-Purcell radiation. The angular distribution of the coherent Smith-Purcell radiation is then mapped to directly deduce the length of the electron bunches.

Measuring short electron bunch lengths using coherent Smith-Purcell radiation

DOEpatents

Nguyen, D.C.

1999-03-30

A method is provided for directly determining the length of sub-picosecond electron bunches. A metallic grating is formed with a groove spacing greater than a length expected for the electron bunches. The electron bunches are passed over the metallic grating to generate coherent and incoherent Smith-Purcell radiation. The angular distribution of the coherent Smith-Purcell radiation is then mapped to directly deduce the length of the electron bunches. 8 figs.

Luminosity geometric reduction factor from colliding bunches with different lengths

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

Verdu-Andres, S.

In the interaction point of the future electron-Ion collider eRHIC, the electron beam bunches are at least one order of magnitude shorter than the proton beam bunches. With the introduction of a crossing angle, the actual number of collisions resulting from the bunch collision gets reduced. Here we derive the expression for the luminosity geometric reduction factor when the bunches of the two incoming beams are not equal.

Performance of children with developmental dyslexia on high and low topological entropy artificial grammar learning task.

PubMed

Katan, Pesia; Kahta, Shani; Sasson, Ayelet; Schiff, Rachel

2017-07-01

Graph complexity as measured by topological entropy has been previously shown to affect performance on artificial grammar learning tasks among typically developing children. The aim of this study was to examine the effect of graph complexity on implicit sequential learning among children with developmental dyslexia. Our goal was to determine whether children's performance depends on the complexity level of the grammar system learned. We conducted two artificial grammar learning experiments that compared performance of children with developmental dyslexia with that of age- and reading level-matched controls. Experiment 1 was a high topological entropy artificial grammar learning task that aimed to establish implicit learning phenomena in children with developmental dyslexia using previously published experimental conditions. Experiment 2 is a lower topological entropy variant of that task. Results indicated that given a high topological entropy grammar system, children with developmental dyslexia who were similar to the reading age-matched control group had substantial difficulty in performing the task as compared to typically developing children, who exhibited intact implicit learning of the grammar. On the other hand, when tested on a lower topological entropy grammar system, all groups performed above chance level, indicating that children with developmental dyslexia were able to identify rules from a given grammar system. The results reinforced the significance of graph complexity when experimenting with artificial grammar learning tasks, particularly with dyslexic participants.

A transverse bunch by bunch feedback system for Pohang Light Source upgrade

NASA Astrophysics Data System (ADS)

Lee, E.-H.; Kim, D.-T.; Huang, J.-Y.; Shin, S.; Nakamura, T.; Kobayashi, K.

2014-12-01

The Pohang Light Source upgrade (PLS-II) project has successfully upgraded the Pohang Light Source (PLS). The main goals of the PLS-II project are to increase the beam energy to 3 GeV, increase the number of insertion devices by a factor of two (20 IDs), increase the beam current to 400 mA, and at the same time reduce the beam emittance to below 10 nm by using the existing PLS tunnel and injection system. Among 20 insertion devices, 10 narrow gap in-vacuum undulators are in operation now and two more in-vacuum undulators are to be installed later. Since these narrow gap in-vacuum undulators are most likely to produce coupled bunch instability by the resistive wall impedance and limit the stored beam current, a bunch by bunch feedback system is implemented to suppress coupled bunch instability in the PLS-II. This paper describes the scheme and performance of the PLS-II bunch by bunch feedback system.

Human body segmentation via data-driven graph cut.

PubMed

Li, Shifeng; Lu, Huchuan; Shao, Xingqing

2014-11-01

Human body segmentation is a challenging and important problem in computer vision. Existing methods usually entail a time-consuming training phase for prior knowledge learning with complex shape matching for body segmentation. In this paper, we propose a data-driven method that integrates top-down body pose information and bottom-up low-level visual cues for segmenting humans in static images within the graph cut framework. The key idea of our approach is first to exploit human kinematics to search for body part candidates via dynamic programming for high-level evidence. Then, by using the body parts classifiers, obtaining bottom-up cues of human body distribution for low-level evidence. All the evidence collected from top-down and bottom-up procedures are integrated in a graph cut framework for human body segmentation. Qualitative and quantitative experiment results demonstrate the merits of the proposed method in segmenting human bodies with arbitrary poses from cluttered backgrounds.

Deciding Termination for Ancestor Match- Bounded String Rewriting Systems

NASA Technical Reports Server (NTRS)

Geser, Alfons; Hofbauer, Dieter; Waldmann, Johannes

2005-01-01

Termination of a string rewriting system can be characterized by termination on suitable recursively defined languages. This kind of termination criteria has been criticized for its lack of automation. In an earlier paper we have shown how to construct an automated termination criterion if the recursion is aligned with the rewrite relation. We have demonstrated the technique with Dershowitz's forward closure criterion. In this paper we show that a different approach is suitable when the recursion is aligned with the inverse of the rewrite relation. We apply this idea to Kurth's ancestor graphs and obtain ancestor match-bounded string rewriting systems. Termination is shown to be decidable for this class. The resulting method improves upon those based on match-boundedness or inverse match-boundedness.

Sequential control of step-bunching during graphene growth on SiC (0001)

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

Bao, Jianfeng; Kusunoki, Michiko; Yasui, Osamu

2016-08-22

We have investigated the relation between the step-bunching and graphene growth phenomena on an SiC substrate. We found that only a minimum amount of step-bunching occurred during the graphene growth process with a high heating rate. On the other hand, a large amount of step-bunching occurred using a slow heating process. These results indicated that we can control the degree of step-bunching during graphene growth by controlling the heating rate. We also found that graphene coverage suppressed step bunching, which is an effective methodology not only in the graphene technology but also in the SiC-based power electronics.

Femtosecond electron bunches, source and characterization

NASA Astrophysics Data System (ADS)

Thongbai, C.; Kusoljariyakul, K.; Rimjaem, S.; Rhodes, M. W.; Saisut, J.; Thamboon, P.; Wichaisirimongkol, P.; Vilaithong, T.

2008-03-01

A femtosecond electron source has been developed at the Fast Neutron Research Facility (FNRF), Chiang Mai University, Thailand. So far, it has produced electron bunches as short as σ z˜180 fs with (1-6)×10 8 electrons per microbunch. The system consists of an RF-gun with a thermionic cathode, an alpha-magnet as a magnetic bunch compressor, and a linear accelerator as a post acceleration section. Coherent transition radiation emitted at wavelengths equal to and longer than the bunch length is used in a Michelson interferometer to determine the bunch length by autocorrelation technique. The experimental setup and results of the bunch length measurement are described.

The Potential-Well Distortion Effect and Coherent Instabilities of Electron Bunches in Storage Rings

NASA Astrophysics Data System (ADS)

Korchuganov, V. N.; Smygacheva, A. S.; Fomin, E. A.

2018-05-01

The effect of electromagnetic interaction between electron bunches and the vacuum chamber of a storage ring on the longitudinal motion of bunches is studied. Specifically, the potential-well distortion effect and the so-called coherent instabilities of coupled bunches are considered. An approximate analytical solution for the frequencies of incoherent oscillations of bunches distributed arbitrarily within the ring is obtained for a distorted potential well. A new approach to determining frequencies of coherent oscillations and an approximate analytical relation for estimating the stability of a system of bunches as a function of their distribution in the accelerator orbit are presented.

7 CFR 51.886 - Tolerances.

Code of Federal Regulations, 2010 CFR

2010-01-01

... institutional (A) For clusters/bunches failing to meet color requirements 10. (B) For clusters/bunches failing to meet requirements for minimum diameter of berries 10. (C) For offsize clusters/bunches 4. (D) For clusters/bunches and berries failing to meet the remaining requirements for the grade 8. Including in (D...

Attraction Toward the Model and Model's Competence as Determinants of Adult Imitative Behavior

ERIC Educational Resources Information Center

Baron, Robert A.

1970-01-01

Suggests that adults are quicker to learn to match the performance of a model similar to themselves in attitude if he is competent. Similarity of the model interferes with rate of learning if he is incompetent. Tables, graph, and bibliography. (RW)

Simulation of 6 to 3 to 1 merge and squeeze of Au77+ bunches in AGS

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

Gardner, C. J.

2016-05-09

In order to increase the intensity per Au77+ bunch at AGS extraction, a 6 to 3 to 1 merge scheme was developed and implemented by K. Zeno during the 2016 RHIC run. For this scheme, 12 Booster loads, each consisting of a single bunch, are delivered to AGS per AGS magnetic cycle. The bunch from Booster is itself the result of a 4 to 2 to 1 merge which is carried out on a flat porch during the Booster magnetic cycle. Each Booster bunch is injected into a harmonic 24 bucket on the AGS injection porch. In order to fitmore » into the buckets and allow for the AGS injection kicker rise time, the bunch width must be reduced by exciting quadrupole oscillations just before extraction from Booster. The bunches are injected into two groups of six adjacent harmonic 24 buckets. In each group the 6 bunches are merged into 3 by bringing on RF harmonic 12 while reducing harmonic 24. This is a straightforward 2 to 1 merge (in which two adjacent bunches are merged into one). One ends up with two groups of three adjacent bunches sitting in harmonic 12 buckets. These bunches are accelerated to an intermediate porch for further merging. Doing the merge on a porch that sits above injection energy helps reduce losses that are believed to be due to the space-charge force acting on the bunched particles. (The 6 to 3 merge is done on the injection porch because the harmonic 24 frequency on the intermediate porch would be too high for the AGS RF cavities.) On the intermediate porch each group of 3 bunches is merged into one by bringing on RF harmonics 8 and 4 and then reducing harmonics 12 and 8. One ends up with 2 bunches, each the result of a 6 to 3 to 1 merge and each sitting in a harmonic 4 bucket. This puts 6 Booster loads into each bunch. Each merged bunch needs to be squeezed into a harmonic 12 bucket for subsequent acceleration. This is done by again bringing on harmonic 8 and then harmonic 12. Results of simulations of the 6 to 3 to 1 merge and the subsequent squeeze into harmonic 12 buckets are presented in this note. In particular, they provide a benchmark for what can be achieved with the available RF voltages.« less

Longitudinal Beam Diagnostics for the ILC Injectors and Bunch Compressors

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

Piot, Philippe; Bracke, Adam; Demir, Veysel

2010-12-01

We present a diagnostics suite and analyze techniques for setting up the longitudinal beam dynamics in ILC e⁻ injectors and e⁺ and e⁻ bunch compressors. Techniques to measure the first order moments and recover the first order longitudinal transfer map of the injector's intricate bunching scheme are presented. Coherent transition radiation diagnostics needed to measure and monitor the bunch length downstream of the ~5 GeV bunch compressor are investigated using a vector diffraction model.

Double-pulse THz radiation bursts from laser-plasma acceleration

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

Bosch, R. A.

2006-11-15

A model is presented for coherent THz radiation produced when an electron bunch undergoes laser-plasma acceleration and then exits axially from a plasma column. Radiation produced when the bunch is accelerated is superimposed with transition radiation from the bunch exiting the plasma. Computations give a double-pulse burst of radiation comparable to recent observations. The duration of each pulse very nearly equals the electron bunch length, while the time separation between pulses is proportional to the distance between the points where the bunch is accelerated and where it exits the plasma. The relative magnitude of the two pulses depends upon bymore » the radius of the plasma column. Thus, the radiation bursts may be useful in diagnosing the electron bunch length, the location of the bunch's acceleration, and the plasma radius.« less

Micro-Bunched Beam Production at FAST for Narrow Band THz Generation Using a Slit-Mask

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

Hyun, J.; Crawford, D.; Edstrom Jr, D.

We discuss simulations and experiments on creating micro-bunch beams for generating narrow band THz radiation at the Fermilab Accelerator Science and Technology (FAST) facility. The low-energy electron beamline at FAST consists of a photoinjector-based RF gun, two Lband superconducting accelerating cavities, a chicane, and a beam dump. The electron bunches are lengthened with cavity phases set off-crest for better longitudinal separation and then micro-bunched with a slit-mask installed in the chicane. We carried out the experiments with 30 MeV electron beams and detected signals of the micro-bunching using a skew quadrupole magnet in the chicane. In this paper, the detailsmore » of micro-bunch beam production, the detection of micro-bunching and comparison with simulations are described.« less

Multiple bunch HOM evaluation for ERL cavities

DOE PAGES

Xu, Chen; Ben-Zvi, I.; Blaskiewicz, Michael M.; ...

2017-06-15

In this paper we investigate the effect of the bunch pattern in a linac on the Higher Order Mode (HOM) power generation. The future ERL-based electron–ion collider eRHIC at BNL is used as an illustrative example. This ERL has multiple high current Superconducting Radiofrequency (SRF) 5-cell cavities. The HOM power generated when a single bunch traverses the cavity is estimated by the corresponding loss factor. Multiple re-circulations through the Energy Recovery Linac (ERL) create a specific bunch pattern. In this case the loss factor can be different than the single bunch loss factor. HOM power can vary dramatically when themore » ERL bunch pattern changes. The HOM power generation can be surveyed in the time and frequency domains. We estimate the average HOM power in a 5-cell cavity with different ERL bunch patterns.« less

Multiple bunch HOM evaluation for ERL cavities

NASA Astrophysics Data System (ADS)

Xu, Chen; Ben-Zvi, I.; Blaskiewicz, Michael M.; Hao, Yue; Ptitsyn, Vadim

2017-09-01

In this work we investigate the effect of the bunch pattern in a linac on the Higher Order Mode (HOM) power generation. The future ERL-based electron-ion collider eRHIC at BNL is used as an illustrative example. This ERL has multiple high current Superconducting Radiofrequency (SRF) 5-cell cavities. The HOM power generated when a single bunch traverses the cavity is estimated by the corresponding loss factor. Multiple re-circulations through the Energy Recovery Linac (ERL) create a specific bunch pattern. In this case the loss factor can be different than the single bunch loss factor. HOM power can vary dramatically when the ERL bunch pattern changes. The HOM power generation can be surveyed in the time and frequency domains. We estimate the average HOM power in a 5-cell cavity with different ERL bunch patterns.

Multiple bunch HOM evaluation for ERL cavities

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

Xu, Chen; Ben-Zvi, I.; Blaskiewicz, Michael M.

In this paper we investigate the effect of the bunch pattern in a linac on the Higher Order Mode (HOM) power generation. The future ERL-based electron–ion collider eRHIC at BNL is used as an illustrative example. This ERL has multiple high current Superconducting Radiofrequency (SRF) 5-cell cavities. The HOM power generated when a single bunch traverses the cavity is estimated by the corresponding loss factor. Multiple re-circulations through the Energy Recovery Linac (ERL) create a specific bunch pattern. In this case the loss factor can be different than the single bunch loss factor. HOM power can vary dramatically when themore » ERL bunch pattern changes. The HOM power generation can be surveyed in the time and frequency domains. We estimate the average HOM power in a 5-cell cavity with different ERL bunch patterns.« less

Bunch Splitting Simulations for the JLEIC Ion Collider Ring

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

Satogata, Todd J.; Gamage, Randika

2016-05-01

We describe the bunch splitting strategies for the proposed JLEIC ion collider ring at Jefferson Lab. This complex requires an unprecedented 9:6832 bunch splitting, performed in several stages. We outline the problem and current results, optimized with ESME including general parameterization of 1:2 bunch splitting for JLEIC parameters.

A graph-based approach for the retrieval of multi-modality medical images.

PubMed

Kumar, Ashnil; Kim, Jinman; Wen, Lingfeng; Fulham, Michael; Feng, Dagan

2014-02-01

In this paper, we address the retrieval of multi-modality medical volumes, which consist of two different imaging modalities, acquired sequentially, from the same scanner. One such example, positron emission tomography and computed tomography (PET-CT), provides physicians with complementary functional and anatomical features as well as spatial relationships and has led to improved cancer diagnosis, localisation, and staging. The challenge of multi-modality volume retrieval for cancer patients lies in representing the complementary geometric and topologic attributes between tumours and organs. These attributes and relationships, which are used for tumour staging and classification, can be formulated as a graph. It has been demonstrated that graph-based methods have high accuracy for retrieval by spatial similarity. However, naïvely representing all relationships on a complete graph obscures the structure of the tumour-anatomy relationships. We propose a new graph structure derived from complete graphs that structurally constrains the edges connected to tumour vertices based upon the spatial proximity of tumours and organs. This enables retrieval on the basis of tumour localisation. We also present a similarity matching algorithm that accounts for different feature sets for graph elements from different imaging modalities. Our method emphasises the relationships between a tumour and related organs, while still modelling patient-specific anatomical variations. Constraining tumours to related anatomical structures improves the discrimination potential of graphs, making it easier to retrieve similar images based on tumour location. We evaluated our retrieval methodology on a dataset of clinical PET-CT volumes. Our results showed that our method enabled the retrieval of multi-modality images using spatial features. Our graph-based retrieval algorithm achieved a higher precision than several other retrieval techniques: gray-level histograms as well as state-of-the-art methods such as visual words using the scale- invariant feature transform (SIFT) and relational matrices representing the spatial arrangements of objects. Copyright © 2013 Elsevier B.V. All rights reserved.

Beam dynamics performances and applications of a low-energy electron-beam magnetic bunch compressor

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

Prokop, C. R.; Piot, P.; Carlsten, B. E.

2013-08-01

Many front-end applications of electron linear accelerators rely on the production of temporally compressed bunches. The shortening of electron bunches is often realized with magnetic bunch compressors located in high-energy sections of accelerators. Magnetic compression is subject to collective effects including space charge and self interaction via coherent synchrotron radiation. In this paper we explore the application of magnetic compression to low-energy (~40MeV), high-charge (nC) electron bunches with low normalized transverse emittances (<5@mm).

Probabilistic fusion of stereo with color and contrast for bilayer segmentation.

PubMed

Kolmogorov, Vladimir; Criminisi, Antonio; Blake, Andrew; Cross, Geoffrey; Rother, Carsten

2006-09-01

This paper describes models and algorithms for the real-time segmentation of foreground from background layers in stereo video sequences. Automatic separation of layers from color/contrast or from stereo alone is known to be error-prone. Here, color, contrast, and stereo matching information are fused to infer layers accurately and efficiently. The first algorithm, Layered Dynamic Programming (LDP), solves stereo in an extended six-state space that represents both foreground/background layers and occluded regions. The stereo-match likelihood is then fused with a contrast-sensitive color model that is learned on-the-fly and stereo disparities are obtained by dynamic programming. The second algorithm, Layered Graph Cut (LGC), does not directly solve stereo. Instead, the stereo match likelihood is marginalized over disparities to evaluate foreground and background hypotheses and then fused with a contrast-sensitive color model like the one used in LDP. Segmentation is solved efficiently by ternary graph cut. Both algorithms are evaluated with respect to ground truth data and found to have similar performance, substantially better than either stereo or color/ contrast alone. However, their characteristics with respect to computational efficiency are rather different. The algorithms are demonstrated in the application of background substitution and shown to give good quality composite video output.

Demonstration of a real-time interferometer as a bunch-length monitor in a high-current electron beam accelerator.

PubMed

Thangaraj, J; Andonian, G; Thurman-Keup, R; Ruan, J; Johnson, A S; Lumpkin, A; Santucci, J; Maxwell, T; Murokh, A; Ruelas, M; Ovodenko, A

2012-04-01

A real-time interferometer (RTI) has been developed to monitor the bunch length of an electron beam in an accelerator. The RTI employs spatial autocorrelation, reflective optics, and a fast response pyro-detector array to obtain a real-time autocorrelation trace of the coherent radiation from an electron beam thus providing the possibility of online bunch-length diagnostics. A complete RTI system has been commissioned at the A0 photoinjector facility to measure sub-mm bunches at 13 MeV. Bunch length variation (FWHM) between 0.8 ps (~0.24 mm) and 1.5 ps (~0.45 mm) has been measured and compared with a Martin-Puplett interferometer and a streak camera. The comparisons show that RTI is a viable, complementary bunch length diagnostic for sub-mm electron bunches. © 2012 American Institute of Physics

Demonstration of a real-time interferometer as a bunch-lenght monitor in a high-current electron beam accelerator

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

Thangaraj, J.; Thurman-Keup, R.; Ruan, J.

2012-03-01

A real-time interferometer (RTI) has been developed to monitor the bunch length of an electron beam in an accelerator. The RTI employs spatial autocorrelation, reflective optics, and a fast response pyro-detector array to obtain a real-time autocorrelation trace of the coherent radiation from an electron beam thus providing the possibility of online bunch-length diagnostics. A complete RTI system has been commissioned at the A0 photoinjector facility to measure sub-mm bunches at 13 MeV. Bunch length variation (FWHM) between 0.8 ps (-0.24 mm) and 1.5 ps (-0.45 mm) has been measured and compared with a Martin-Puplett interferometer and a streak camera.more » The comparisons show that RTI is a viable, complementary bunch length diagnostic for sub-mm electron bunches.« less

Demonstration of a real-time interferometer as a bunch-length monitor in a high-current electron beam accelerator

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

Thangaraj, J.; Thurman-Keup, R.; Ruan, J.

2012-04-15

A real-time interferometer (RTI) has been developed to monitor the bunch length of an electron beam in an accelerator. The RTI employs spatial autocorrelation, reflective optics, and a fast response pyro-detector array to obtain a real-time autocorrelation trace of the coherent radiation from an electron beam thus providing the possibility of online bunch-length diagnostics. A complete RTI system has been commissioned at the A0 photoinjector facility to measure sub-mm bunches at 13 MeV. Bunch length variation (FWHM) between 0.8 ps ({approx}0.24 mm) and 1.5 ps ({approx}0.45 mm) has been measured and compared with a Martin-Puplett interferometer and a streak camera.more » The comparisons show that RTI is a viable, complementary bunch length diagnostic for sub-mm electron bunches.« less

Interaction of an ultrarelativistic electron bunch train with a W-band accelerating structure: High power and high gradient

DOE PAGES

Wang, D.; Antipov, S.; Jing, C.; ...

2016-02-05

Electron beam interaction with high frequency structures (beyond microwave regime) has a great impact on future high energy frontier machines. We report on the generation of multimegawatt pulsed rf power at 91 GHz in a planar metallic accelerating structure driven by an ultrarelativistic electron bunch train. This slow-wave wakefield device can also be used for high gradient acceleration of electrons with a stable rf phase and amplitude which are controlled by manipulation of the bunch train. To achieve precise control of the rf pulse properties, a two-beam wakefield interferometry method was developed in which the rf pulse, due to themore » interference of the wakefields from the two bunches, was measured as a function of bunch separation. As a result, measurements of the energy change of a trailing electron bunch as a function of the bunch separation confirmed the interferometry method.« less

Modeling Two-Stage Bunch Compression With Wakefields: Macroscopic Properties And Microbunching Instability

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

Bosch, R.A.; Kleman, K.J.; /Wisconsin U., SRC

2011-09-08

In a two-stage compression and acceleration system, where each stage compresses a chirped bunch in a magnetic chicane, wakefields affect high-current bunches. The longitudinal wakes affect the macroscopic energy and current profiles of the compressed bunch and cause microbunching at short wavelengths. For macroscopic wavelengths, impedance formulas and tracking simulations show that the wakefields can be dominated by the resistive impedance of coherent edge radiation. For this case, we calculate the minimum initial bunch length that can be compressed without producing an upright tail in phase space and associated current spike. Formulas are also obtained for the jitter in themore » bunch arrival time downstream of the compressors that results from the bunch-to-bunch variation of current, energy, and chirp. Microbunching may occur at short wavelengths where the longitudinal space-charge wakes dominate or at longer wavelengths dominated by edge radiation. We model this range of wavelengths with frequency-dependent impedance before and after each stage of compression. The growth of current and energy modulations is described by analytic gain formulas that agree with simulations.« less

Wake loss and energy spread factor of the LEReC Booster cavity caused by short range wake field

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

Xiao, Binping; Blaskiewicz, Michael; Fedotov, Alexei

LEReC project uses a DC photoemission gun with multi-alkali (CsK 2Sb or NaK 2Sb) cathode [1]. To get 24 mm “flat-top” distribution, 32 Gaussian laser bunches with 0.6 mm rms length are stacked together with 0.75 mm distance [2]. In this case one cannot simply use a 1 cm rms length Gaussian/step/delta bunch for short range wake field simulation since a 0.6 mm bunch contains frequency much higher than the 1 cm bunch. A short range wake field simulation was done using CST Particle Studio™ with 0.6 mm rms Gaussian bunch at the speed of light, and this result wasmore » compared with the result for 1 cm rms Gaussian bunch in Figure 1, from where one notice that the wake potential for the 0.6 mm bunch is ~10 times higher than that of the 1 cm bunch. The wake potential of the 0.6 mm bunch, as well as the charge distribution, was then “shift and stack” every 0.75 mm, the normalized results are shown in Figure 2. The wake loss factor (WLF) is the integration of the product of wake potential and normalized bunch charge, and the energy spread factor (ESF) is the rms deviation from the average energy loss. It is calculated by summing the weighted squares of the differences and taking the square root of the sum. These two factors were then divided by β 2 for 1.6 MV beam energy. The wake loss factor is at 0.86 V/pC and energy spread factor is at 0.54 V/pC rms. With 100 pC electron bunch, the energy spread inter-bunch is 54 V rms.« less

Difference between BPM reading one bunch and the average of multi-bunch in Booster

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

Xi Yang

2004-08-18

Differences caused by BPM reading one bunch and multi-bunch average need to be well understood before the beam parameters, such as the synchrotron tune, betatron tune, and chromaticity, are extracted from those BPM data. It is easy to perform such a study using numerical simulation other than modifying the BPM electronics.

Nonclassical Properties of Q-Deformed Superposition Light Field State

NASA Technical Reports Server (NTRS)

Ren, Min; Shenggui, Wang; Ma, Aiqun; Jiang, Zhuohong

1996-01-01

In this paper, the squeezing effect, the bunching effect and the anti-bunching effect of the superposition light field state which involving q-deformation vacuum state and q-Glauber coherent state are studied, the controllable q-parameter of the squeezing effect, the bunching effect and the anti-bunching effect of q-deformed superposition light field state are obtained.

The Case: Bunche-Da Vinci Learning Partnership Academy

ERIC Educational Resources Information Center

Eisenberg, Nicole; Winters, Lynn; Alkin, Marvin C.

2005-01-01

The Bunche-Da Vinci case described in this article presents a situation at Bunche Elementary School that four theorists were asked to address in their evaluation designs (see EJ791771, EJ719772, EJ791773, and EJ792694). The Bunche-Da Vinci Learning Partnership Academy, an elementary school located between an urban port city and a historically…

Density of bunches of native bluebunch wheatgrass and alien crested wheatgrass

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

Rickard, W.H.

The density of bunches of bluebunch wheatgrass in a natural undisturbed stand averaged 3.28 per m/sup 2/ as compared to 2.96 per m/sup 2/ for a nearby stand of crested wheatgrass that was planted 30 years ago. Bunch density was similar in both stands indicating that spacing is a response to an environment deficient in soil water. Bunches of crested wheatgrass on the average weighed 3.5 times more than bunches of bluebunch wheatgrass and they also produced a greater weight of seedheads.

Identifying patients with Alzheimer's disease using resting-state fMRI and graph theory.

PubMed

Khazaee, Ali; Ebrahimzadeh, Ata; Babajani-Feremi, Abbas

2015-11-01

Study of brain network on the basis of resting-state functional magnetic resonance imaging (fMRI) has provided promising results to investigate changes in connectivity among different brain regions because of diseases. Graph theory can efficiently characterize different aspects of the brain network by calculating measures of integration and segregation. In this study, we combine graph theoretical approaches with advanced machine learning methods to study functional brain network alteration in patients with Alzheimer's disease (AD). Support vector machine (SVM) was used to explore the ability of graph measures in diagnosis of AD. We applied our method on the resting-state fMRI data of twenty patients with AD and twenty age and gender matched healthy subjects. The data were preprocessed and each subject's graph was constructed by parcellation of the whole brain into 90 distinct regions using the automated anatomical labeling (AAL) atlas. The graph measures were then calculated and used as the discriminating features. Extracted network-based features were fed to different feature selection algorithms to choose most significant features. In addition to the machine learning approach, statistical analysis was performed on connectivity matrices to find altered connectivity patterns in patients with AD. Using the selected features, we were able to accurately classify patients with AD from healthy subjects with accuracy of 100%. Results of this study show that pattern recognition and graph of brain network, on the basis of the resting state fMRI data, can efficiently assist in the diagnosis of AD. Classification based on the resting-state fMRI can be used as a non-invasive and automatic tool to diagnosis of Alzheimer's disease. Copyright © 2015 International Federation of Clinical Neurophysiology. All rights reserved.

High intensity single bunch operation with heavy periodic transient beam loading in wide band rf cavities

NASA Astrophysics Data System (ADS)

Tamura, Fumihiko; Hotchi, Hideaki; Schnase, Alexander; Yoshii, Masahito; Yamamoto, Masanobu; Ohmori, Chihiro; Nomura, Masahiro; Toda, Makoto; Shimada, Taihei; Hasegawa, Katsushi; Hara, Keigo

2015-09-01

The rapid cycling synchrotron (RCS) in the Japan Proton Accelerator Research Complex (J-PARC) was originally designed to accelerate two high intensity bunches, while some of neutron experiments in the materials and life science experimental facility and a muon experiment using main ring beams require a single bunch operation mode, in which one of the two rf buckets is filled and the other is empty. The beam intensity in the single bunch operation has been limited by longitudinal beam losses due to the rf bucket distortions by the wake voltage of the odd harmonics (h =1 ,3 ,5 ) in the wide band magnetic alloy cavities. We installed an additional rf feedforward system to compensate the wake voltages of the odd harmonics (h =1 ,3 ,5 ). The additional system has a similar structure as the existing feedforward system for the even harmonics (h =2 ,4 ,6 ). We describe the function of the feedforward system for the odd harmonics, the commissioning methodology, and the commissioning results. The longitudinal beam losses during the single bunch acceleration disappeared with feedforward for the odd harmonics. We also confirmed that the beam quality in the single bunch acceleration are similar to that of the normal operation with two bunches. Thus, high intensity single bunch acceleration at the intensity of 2.3 ×1013 protons per bunch has been achieved in the J-PARC RCS. This article is a follow-up of our previous article, Phys. Rev. ST Accel. Beams 14, 051004 (2011). The feedforward system extension for single bunch operation was successful.

Temporal profile monitor based on electro-optic spatial decoding for low-energy bunches

NASA Astrophysics Data System (ADS)

Wang, Wei; Du, Yingchao; Yan, Lixin; Chi, Zhijun; Zhang, Zhen; Hua, Jianfei; Huang, Wenhui; Tang, Chuanxiang; Li, Ming

2017-11-01

The measurement of electron bunch temporal profile is one of the key diagnostics in accelerators, especially for ultrashort bunches. The electro-optic (EO) technique enables the precise longitudinal characterization of bunch electric field in a single-shot and nondestructive way, which can simultaneously obtain and analyze the time jitter between the electron bunch and the synchronized laser. An EO monitor based on spatial decoding for temporal profile measurement and timing jitter recoding has recently been demonstrated and analyzed in depth for low-energy bunches at the Tsinghua Thomson scattering X-ray source. A detailed description of the experimental setup and measurement results are presented in this paper. An EO signal as short as 82 fs (rms) is observed with 100 μ m gallium phosphide for a 40 MeV electron bunch, and the corresponding length is 106 fs (rms) with 300 μ m zinc telluride. Owing to the field-opening angle, we propose a method to eliminate the influence of energy factor for bunches with low energy, resulting in a bunch length of ˜60 fs (rms). The monitor is also successfully applied to measure time jitter with approximately 10 fs accuracy. The experiment environment is proved to be the main source of the slow drift, which is removed using feedback control. Consequently, the rms time jitter decreases from 430 fs to 320 fs.

Determination of sugars composition in abscission zone of oil palm fruit

NASA Astrophysics Data System (ADS)

Thang, Y. M.; Ariffin, A. A.; Appleton, D. R.; Asis, A. J.; Mokhtar, M. N.; Yunus, R.

2017-06-01

Fresh oil palm fruit bunches (FFB) arriving at a palm oil mill are graded manually and randomly for ripeness classification by counting the number of empty fruit sockets (EFS) found in each bunch before processing. FFBs with at least ten EFS are classified as ripe bunch, FFBs with less than ten EFS are classified as under-ripe, while bunches without any EFS are classified as unripe. The aim of the present study is to determine the composition of sugars in the abscission of these three groups of FFBs by monitoring their sugars composition. The bunches were grouped according to the number of empty fruit sockets: (i) nil; (ii) 1-9; (iii) ≥10 as unripe, under-ripe and ripe bunches, respectively. Non-structural, structural and water-soluble sugars extracted from the abscission zone were analyzed. The principal component analysis (PCA) based on various sugars compositions revealed some natural clustering among the samples. Bunches with more than one empty fruit sockets were distinguished from the others using glucose, sucrose and oligomers. In conclusion, analysis of sugars composition of the abscission zone could potentially be used as a chemical marker to differentiate those bunches at different stages of ripeness.

Solid Catalyst Nanoparticles derived from Oil-Palm Empty Fruit Bunches (OP-EFB) as a Renewable Catalyst for Biodiesel Production

NASA Astrophysics Data System (ADS)

Husin, H.; Asnawi, T. M.; Firdaus, A.; Husaini, H.; Ibrahim, I.; Hasfita, F.

2018-05-01

Solid nanocatalyst derived from oil-palm empty fruit bunches (OP-EFB) fiber was successfully synthesized and its application for biodiesel production was investigated. The OPEFB was treated by burning, milling and heating methods to generate ashes in a nanoparticle size. The nanoparticle palm-bunch ash was characterized by scanning electron microscopy (SEM) and x-ray diffraction (XRD). The effects of the calcination temperature and catalyst amounts for transesterification reactions were investigated. XRD analysis of palm bunch ash exhibited that the highest composition of peaks characteristic were potassium oxide (K2O). SEM analysis showed that the nano palm bunch ash have a particle size ranging of 150-400 nm. The highest conversion of palm-oil to biodiesel reach to 97.90% was observed by using of palm bunch ash nanocatalyst which heated at 600°C, 3 h reaction time and 1% catalyst amount. Reusability of palm bunch ash catalysts was also examined. It was found that of its high active sites, reusable solid catalyst was obtained by just heating of palm bunch ash. It has a capability to reduce not only the amount of catalyst consumption but also reduce the reaction time of transesterification process.

Electron dynamics in high energy density plasma bunch generation driven by intense picosecond laser pulse

NASA Astrophysics Data System (ADS)

Li, M.; Yuan, T.; Xu, Y. X.; Luo, S. N.

2018-05-01

When an intense picosecond laser pulse is loaded upon a dense plasma, a high energy density plasma bunch, including electron bunch and ion bunch, can be generated in the target. We simulate this process through one-dimensional particle-in-cell simulation and find that the electron bunch generation is mainly due to a local high energy density electron sphere originated in the plasma skin layer. Once generated the sphere rapidly expands to compress the surrounding electrons and induce high density electron layer, coupled with that, hot electrons are efficiently triggered in the local sphere and traveling in the whole target. Under the compressions of light pressure, forward-running and backward-running hot electrons, a high energy density electron bunch generates. The bunch energy density is as high as TJ/m3 order of magnitude in our conditions, which is significant in laser driven dynamic high pressure generation and may find applications in high energy density physics.

Adaptation of pancreatic islet cyto-architecture during development

NASA Astrophysics Data System (ADS)

Striegel, Deborah A.; Hara, Manami; Periwal, Vipul

2016-04-01

Plasma glucose in mammals is regulated by hormones secreted by the islets of Langerhans embedded in the exocrine pancreas. Islets consist of endocrine cells, primarily α, β, and δ cells, which secrete glucagon, insulin, and somatostatin, respectively. β cells form irregular locally connected clusters within islets that act in concert to secrete insulin upon glucose stimulation. Varying demands and available nutrients during development produce changes in the local connectivity of β cells in an islet. We showed in earlier work that graph theory provides a framework for the quantification of the seemingly stochastic cyto-architecture of β cells in an islet. To quantify the dynamics of endocrine connectivity during development requires a framework for characterizing changes in the probability distribution on the space of possible graphs, essentially a Fokker-Planck formalism on graphs. With large-scale imaging data for hundreds of thousands of islets containing millions of cells from human specimens, we show that this dynamics can be determined quantitatively. Requiring that rearrangement and cell addition processes match the observed dynamic developmental changes in quantitative topological graph characteristics strongly constrained possible processes. Our results suggest that there is a transient shift in preferred connectivity for β cells between 1-35 weeks and 12-24 months.

Change of Brain Functional Connectivity in Patients With Spinal Cord Injury: Graph Theory Based Approach.

PubMed

Min, Yu-Sun; Chang, Yongmin; Park, Jang Woo; Lee, Jong-Min; Cha, Jungho; Yang, Jin-Ju; Kim, Chul-Hyun; Hwang, Jong-Moon; Yoo, Ji-Na; Jung, Tae-Du

2015-06-01

To investigate the global functional reorganization of the brain following spinal cord injury with graph theory based approach by creating whole brain functional connectivity networks from resting state-functional magnetic resonance imaging (rs-fMRI), characterizing the reorganization of these networks using graph theoretical metrics and to compare these metrics between patients with spinal cord injury (SCI) and age-matched controls. Twenty patients with incomplete cervical SCI (14 males, 6 females; age, 55±14.1 years) and 20 healthy subjects (10 males, 10 females; age, 52.9±13.6 years) participated in this study. To analyze the characteristics of the whole brain network constructed with functional connectivity using rs-fMRI, graph theoretical measures were calculated including clustering coefficient, characteristic path length, global efficiency and small-worldness. Clustering coefficient, global efficiency and small-worldness did not show any difference between controls and SCIs in all density ranges. The normalized characteristic path length to random network was higher in SCI patients than in controls and reached statistical significance at 12%-13% of density (p<0.05, uncorrected). The graph theoretical approach in brain functional connectivity might be helpful to reveal the information processing after SCI. These findings imply that patients with SCI can build on preserved competent brain control. Further analyses, such as topological rearrangement and hub region identification, will be needed for better understanding of neuroplasticity in patients with SCI.

Expert system validation in prolog

NASA Technical Reports Server (NTRS)

Stock, Todd; Stachowitz, Rolf; Chang, Chin-Liang; Combs, Jacqueline

1988-01-01

An overview of the Expert System Validation Assistant (EVA) is being implemented in Prolog at the Lockheed AI Center. Prolog was chosen to facilitate rapid prototyping of the structure and logic checkers and since February 1987, we have implemented code to check for irrelevance, subsumption, duplication, deadends, unreachability, and cycles. The architecture chosen is extremely flexible and expansible, yet concise and complementary with the normal interactive style of Prolog. The foundation of the system is in the connection graph representation. Rules and facts are modeled as nodes in the graph and arcs indicate common patterns between rules. The basic activity of the validation system is then a traversal of the connection graph, searching for various patterns the system recognizes as erroneous. To aid in specifying these patterns, a metalanguage is developed, providing the user with the basic facilities required to reason about the expert system. Using the metalanguage, the user can, for example, give the Prolog inference engine the goal of finding inconsistent conclusions among the rules, and Prolog will search the graph intantiations which can match the definition of inconsistency. Examples of code for some of the checkers are provided and the algorithms explained. Technical highlights include automatic construction of a connection graph, demonstration of the use of metalanguage, the A* algorithm modified to detect all unique cycles, general-purpose stacks in Prolog, and a general-purpose database browser with pattern completion.

Brain gray matter structural network in myotonic dystrophy type 1.

PubMed

Sugiyama, Atsuhiko; Sone, Daichi; Sato, Noriko; Kimura, Yukio; Ota, Miho; Maikusa, Norihide; Maekawa, Tomoko; Enokizono, Mikako; Mori-Yoshimura, Madoka; Ohya, Yasushi; Kuwabara, Satoshi; Matsuda, Hiroshi

2017-01-01

This study aimed to investigate abnormalities in structural covariance network constructed from gray matter volume in myotonic dystrophy type 1 (DM1) patients by using graph theoretical analysis for further clarification of the underlying mechanisms of central nervous system involvement. Twenty-eight DM1 patients (4 childhood onset, 10 juvenile onset, 14 adult onset), excluding three cases from 31 consecutive patients who underwent magnetic resonance imaging in a certain period, and 28 age- and sex- matched healthy control subjects were included in this study. The normalized gray matter images of both groups were subjected to voxel based morphometry (VBM) and Graph Analysis Toolbox for graph theoretical analysis. VBM revealed extensive gray matter atrophy in DM1 patients, including cortical and subcortical structures. On graph theoretical analysis, there were no significant differences between DM1 and control groups in terms of the global measures of connectivity. Betweenness centrality was increased in several regions including the left fusiform gyrus, whereas it was decreased in the right striatum. The absence of significant differences between the groups in global network measurements on graph theoretical analysis is consistent with the fact that the general cognitive function is preserved in DM1 patients. In DM1 patients, increased connectivity in the left fusiform gyrus and decreased connectivity in the right striatum might be associated with impairment in face perception and theory of mind, and schizotypal-paranoid personality traits, respectively.

New Transverse Bunch-by-Bunch Feedback System at TLS

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

Hu, K. H.; Kuo, C. H.; Hsu, S. Y.

2007-01-19

An FPGA based transverse bunch-by-bunch feedback system was implemented and commissioned to replace the existing analog transverse feedback system in order to suppress more effectively multi-bunch instabilities caused by the resistive wall of the vacuum chamber, cavity-like structures and ions related instability. This system replaces existing analog transverse feedback system to enlarge the tunability of the working point. Lower chromaticity is possible with feedback system that is very helpful for injection efficiency improvement. Top-up and high current operation is benefit for this upgrade. One feedback loop suppresses horizontal and vertical multi-bunch instabilities simultaneously. The clean and simple structure makes themore » system simple and reliable. This study also presents the preliminary result of commissioning the new transverse feedback system.« less

Bunch of restless vector solitons in a fiber laser with SESAM.

PubMed

Zhao, L M; Tang, D Y; Zhang, H; Wu, X

2009-05-11

We report on the experimental observation of a novel form of vector soliton interaction in a fiber laser mode-locked with SESAM. Several vector solitons bunch in the cavity and move as a unit with the cavity repetition rate. However, inside the bunch the vector solitons make repeatedly contractive and repulsive motions, resembling the contraction and extension of a spring. The number of vector solitons in the bunch is controllable by changing the pump power. In addition, polarization rotation locking and period doubling bifurcation of the vector soliton bunch are also experimentally observed.

Temporal Electron-bunch Shaping from a Photoinjector for Advanced Accelerator Applications

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

Lemery, Francois; Piot, Philippe

2014-07-01

Advanced-accelerator applications often require the production of bunches with shaped temporal distributions. An example of sought-after shape is a linearly-ramped current profile that can be improve the transformer ratio in beam-driven acceleration, or produce energy-modulated pulse for, e.g., the subsequent generation of THz radiation. Typically,  such a shaping is achieved by manipulating ultra-relativistic electron bunches. In this contribution we discuss the possibility of shaping the bunch via photoemission and demonstrate using particle-in-cell simulations the production of MeV electron bunches with quasi-ramped current profile.

THz based electron bunch length monitoring at the quasi-cw SRF accelerator ELBE

NASA Astrophysics Data System (ADS)

Green, Bertram; Kovalev, Sergey; Fisher, Alan; Bauer, Christian; Kuntzsch, Michael; Lehnert, Ulf; Schurig, Rico; Goltz, Torsten; Michel, Peter; Stojanovic, Nikola; Gensch, Michael

2014-03-01

In the past few years the quasi-cw SRF electron accelerator ELBE has been upgraded so that it now allows to compress electron bunches to the sub-picosecond regime. The actual optimization and control of the electron bunch form represents one of the largest challenges of the coming years. In particular with respect to the midterm goal to utilize the ultra-short electron bunches for Laser-Thomson scattering experiments or high field THz experiments. Current developments of THz based electron bunch diagnostic are discussed and an outlook into future developments is given.

A method for independent component graph analysis of resting-state fMRI.

PubMed

Ribeiro de Paula, Demetrius; Ziegler, Erik; Abeyasinghe, Pubuditha M; Das, Tushar K; Cavaliere, Carlo; Aiello, Marco; Heine, Lizette; di Perri, Carol; Demertzi, Athena; Noirhomme, Quentin; Charland-Verville, Vanessa; Vanhaudenhuyse, Audrey; Stender, Johan; Gomez, Francisco; Tshibanda, Jean-Flory L; Laureys, Steven; Owen, Adrian M; Soddu, Andrea

2017-03-01

Independent component analysis (ICA) has been extensively used for reducing task-free BOLD fMRI recordings into spatial maps and their associated time-courses. The spatially identified independent components can be considered as intrinsic connectivity networks (ICNs) of non-contiguous regions. To date, the spatial patterns of the networks have been analyzed with techniques developed for volumetric data. Here, we detail a graph building technique that allows these ICNs to be analyzed with graph theory. First, ICA was performed at the single-subject level in 15 healthy volunteers using a 3T MRI scanner. The identification of nine networks was performed by a multiple-template matching procedure and a subsequent component classification based on the network "neuronal" properties. Second, for each of the identified networks, the nodes were defined as 1,015 anatomically parcellated regions. Third, between-node functional connectivity was established by building edge weights for each networks. Group-level graph analysis was finally performed for each network and compared to the classical network. Network graph comparison between the classically constructed network and the nine networks showed significant differences in the auditory and visual medial networks with regard to the average degree and the number of edges, while the visual lateral network showed a significant difference in the small-worldness. This novel approach permits us to take advantage of the well-recognized power of ICA in BOLD signal decomposition and, at the same time, to make use of well-established graph measures to evaluate connectivity differences. Moreover, by providing a graph for each separate network, it can offer the possibility to extract graph measures in a specific way for each network. This increased specificity could be relevant for studying pathological brain activity or altered states of consciousness as induced by anesthesia or sleep, where specific networks are known to be altered in different strength.

A cost-effective assay for antioxidant using simple cotton thread combining paper based device with mobile phone detection.

PubMed

Sateanchok, Suphasinee; Wangkarn, Sunanta; Saenjum, Chalermpong; Grudpan, Kate

2018-01-15

A cost-effective assay for antioxidant using simple cotton thread combining paper based device with mobile phone detection has been investigated. Standard and sample solutions flow along a bunch of cotton thread treated with sodium hydroxide via microfluidic behaviors without external pumping. The analyte solution reacts with the reagents that have been immobilized on the paper strip fixed at the end of the cotton bunch. The developed platforms were used for the assays of total phenolic content and antioxidant capacity by employing Folin-Ciocalteu and 2, 2-diphenyl-1-picryhydrazyl (DPPH) respectively. Simple detection can be made by employing a mobile phone camera (iPhone 4S) with Image J or Photoshop for image processing and evaluation. Gallic acid was used as a reference standard in this work, as its polyphenol structures can be found in many plants. The total phenolic content is expressed as gallic acid equivalents (GAE) (mg/g material). Inhibition capacity is calculated by the equation: % I = [(I o - I s )/ I o ] × 100, where I s is the relative magenta intensity (CMYK mode) of sample, and I o the relative magenta intensity of DPPH•. IC 50 inhibition can be estimated from the graph and can be used for the antioxidant capacity consideration. Applications to the assay green tea samples were demonstrated. The total phenolic contents in the green tea samples were found to be 48-105mg/g, with %RSD of less than 10 for that of higher 50 GAE mg/g and IC 50 values of the samples studied were 25-50mg/L. The results obtained by the developed methods agree with that of the standard methods. Copyright © 2017 Elsevier B.V. All rights reserved.

Efficient Synthesis of Graph Methods: a Dynamically Scheduled Architecture

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

Minutoli, Marco; Castellana, Vito G.; Tumeo, Antonino

RDF databases naturally map to a graph representation and employ languages, such as SPARQL, that implements queries as graph pattern matching routines. Graph methods exhibit an irregular behavior: they present unpredictable, fine-grained data accesses, and are synchronization inten- sive. Graph data structures expose large amounts of dy- namic parallelism, but are difficult to partition without gen- erating load unbalance. In this paper, we present a novel ar- chitecture to improve the synthesis of graph methods. Our design addresses the issues of these algorithms with two com- ponents: a Dynamic Task Scheduler (DTS), which reduces load unbalance and maximize resource utilization,more » and a Hi- erarchical Memory Interface controller (HMI), which pro- vides support for concurrent memory operations on multi- ported/multi-banked shared memories. We evaluate our ap- proach by generating the accelerators for a set of SPARQL queries from the Lehigh University Benchmark (LUBM). We first analyze the load unbalance of these queries, showing that execution time among tasks can differ even of order of magnitudes. We then synthesize the queries and com- pare the performance of the resulting accelerators against the current state of the art. Experimental results show that our solution provides a speedup over the serial implementa- tion close to the theoretical maximum and a speedup up to 3.45 over a baseline parallel implementation. We conclude our study by exploring the design space to achieve maximum memory channels utilization. The best design used at least three of the four memory channels for more than 90% of the execution time.« less

Small-world bias of correlation networks: From brain to climate

NASA Astrophysics Data System (ADS)

Hlinka, Jaroslav; Hartman, David; Jajcay, Nikola; Tomeček, David; Tintěra, Jaroslav; Paluš, Milan

2017-03-01

Complex systems are commonly characterized by the properties of their graph representation. Dynamical complex systems are then typically represented by a graph of temporal dependencies between time series of state variables of their subunits. It has been shown recently that graphs constructed in this way tend to have relatively clustered structure, potentially leading to spurious detection of small-world properties even in the case of systems with no or randomly distributed true interactions. However, the strength of this bias depends heavily on a range of parameters and its relevance for real-world data has not yet been established. In this work, we assess the relevance of the bias using two examples of multivariate time series recorded in natural complex systems. The first is the time series of local brain activity as measured by functional magnetic resonance imaging in resting healthy human subjects, and the second is the time series of average monthly surface air temperature coming from a large reanalysis of climatological data over the period 1948-2012. In both cases, the clustering in the thresholded correlation graph is substantially higher compared with a realization of a density-matched random graph, while the shortest paths are relatively short, showing thus distinguishing features of small-world structure. However, comparable or even stronger small-world properties were reproduced in correlation graphs of model processes with randomly scrambled interconnections. This suggests that the small-world properties of the correlation matrices of these real-world systems indeed do not reflect genuinely the properties of the underlying interaction structure, but rather result from the inherent properties of correlation matrix.

Small-world bias of correlation networks: From brain to climate.

PubMed

Hlinka, Jaroslav; Hartman, David; Jajcay, Nikola; Tomeček, David; Tintěra, Jaroslav; Paluš, Milan

2017-03-01

Complex systems are commonly characterized by the properties of their graph representation. Dynamical complex systems are then typically represented by a graph of temporal dependencies between time series of state variables of their subunits. It has been shown recently that graphs constructed in this way tend to have relatively clustered structure, potentially leading to spurious detection of small-world properties even in the case of systems with no or randomly distributed true interactions. However, the strength of this bias depends heavily on a range of parameters and its relevance for real-world data has not yet been established. In this work, we assess the relevance of the bias using two examples of multivariate time series recorded in natural complex systems. The first is the time series of local brain activity as measured by functional magnetic resonance imaging in resting healthy human subjects, and the second is the time series of average monthly surface air temperature coming from a large reanalysis of climatological data over the period 1948-2012. In both cases, the clustering in the thresholded correlation graph is substantially higher compared with a realization of a density-matched random graph, while the shortest paths are relatively short, showing thus distinguishing features of small-world structure. However, comparable or even stronger small-world properties were reproduced in correlation graphs of model processes with randomly scrambled interconnections. This suggests that the small-world properties of the correlation matrices of these real-world systems indeed do not reflect genuinely the properties of the underlying interaction structure, but rather result from the inherent properties of correlation matrix.

Theoretical and numerical analyses of a slit-masked chicane for modulated bunch generation

DOE PAGES

Zhu, Xiaofang; Broemmelsiek, Daniel R.; Shin, Young -Min; ...

2015-10-28

Density modulations on electron beams can improve machine performance of beam-driven accelerators and FELs with resonance beam-wave coupling. The beam modulation is studied with a masked chicane by the analytic model and simulations with the beam parameters of the Fermilab Accelerator Science and Technology (FAST) facility. With the chicane design parameters (bending angle of 18o, bending radius of 0.95 m and R 56 ~ –0.19 m) and a nominal beam of 3 ps bunch length, the analytic model showed that a slit-mask with slit period 900 μ m and aperture width 300 μ m induces a modulation of bunch-to-bunch spacingmore » ~ 100 μ m to the bunch with 2.4% correlated energy spread. With the designed slit mask and a 3 ps bunch, particle-in-cell (PIC) simulations, including nonlinear energy distributions, space charge force, and coherent synchrotron radiation (CSR) effect, also result in beam modulation with bunch-to-bunch distance around 100 μ m and a corresponding modulation frequency of 3 THz. The beam modulation has been extensively examined with three different beam conditions, 2.25 ps (0.25 nC), 3.25 ps (1 nC), and 4.75 ps (3.2 nC), by tracking code Elegant. The simulation analysis indicates that the sliced beam by the slit-mask with 3 ~ 6% correlated energy spread has modulation lengths about 187 μ m (0.25 nC), 270 μ m (1 nC) and 325 μ m (3.2 nC). As a result, the theoretical and numerical data proved the capability of the designed masked chicane in producing modulated bunch train with micro-bunch length around 100 fs.« less

Theoretical and numerical analyses of a slit-masked chicane for modulated bunch generation

NASA Astrophysics Data System (ADS)

Zhu, X.; Broemmelsiek, D. R.; Shin, Y.-M.

2015-10-01

Density modulations on electron beams can improve machine performance of beam-driven accelerators and FELs with resonance beam-wave coupling. The beam modulation is studied with a masked chicane by the analytic model and simulations with the beam parameters of the Fermilab Accelerator Science and Technology (FAST) facility. With the chicane design parameters (bending angle of 18o, bending radius of 0.95 m and R56 ~ -0.19 m) and a nominal beam of 3 ps bunch length, the analytic model showed that a slit-mask with slit period 900 μ m and aperture width 300 μ m induces a modulation of bunch-to-bunch spacing ~ 100 μ m to the bunch with 2.4% correlated energy spread. With the designed slit mask and a 3 ps bunch, particle-in-cell (PIC) simulations, including nonlinear energy distributions, space charge force, and coherent synchrotron radiation (CSR) effect, also result in beam modulation with bunch-to-bunch distance around 100 μ m and a corresponding modulation frequency of 3 THz. The beam modulation has been extensively examined with three different beam conditions, 2.25 ps (0.25 nC), 3.25 ps (1 nC), and 4.75 ps (3.2 nC), by tracking code Elegant. The simulation analysis indicates that the sliced beam by the slit-mask with 3 ~ 6% correlated energy spread has modulation lengths about 187 μ m (0.25 nC), 270 μ m (1 nC) and 325 μ m (3.2 nC). The theoretical and numerical data proved the capability of the designed masked chicane in producing modulated bunch train with micro-bunch length around 100 fs.

Optical Diagnostics for Plasma-based Particle Accelerators

NASA Astrophysics Data System (ADS)

Muggli, Patric

2009-05-01

One of the challenges for plasma-based particle accelerators is to measure the spatio-temporal characteristics of the accelerated particle bunch. ``Optical'' diagnostics are particularly interesting and useful because of the large number of techniques that exits to determine the properties of photon pulses. The accelerated bunch can produce photons pulses that carry information about its characteristics for example through synchrotron radiation in a magnet, Cherenkov radiation in a gas, and transition radiation (TR) at the boundary between two media with different dielectric constants. Depending on the wavelength of the emission when compared to the particle bunch length, the radiation can be incoherent or coherent. Incoherent TR in the optical range (or OTR) is useful to measure the transverse spatial characteristics of the beam, such as charge distribution and size. Coherent TR (or CTR) carries information about the bunch length that can in principle be retrieved by standard auto-correlation or interferometric techniques, as well as by spectral measurements. A measurement of the total CTR energy emitted by bunches with constant charge can also be used as a shot-to-shot measurement for the relative bunch length as the CTR energy is proportional to the square of the bunch population and inversely proportional to its length (for a fixed distribution). Spectral interferometry can also yield the spacing between bunches in the case where multiple bunches are trapped in subsequent buckets of the plasma wave. Cherenkov radiation can be used as an energy threshold diagnostic for low energy particles. Cherenkov, synchrotron and transition radiation can be used in a dispersive section of the beam line to measure the bunch energy spectrum. The application of these diagnostics to plasma-based particle accelerators, with emphasis on the beam-driven, plasma wakefield accelerator (PWFA) at the SLAC National Accelerator Laboratory will be discussed.

Attosecond electron bunches from a nanofiber driven by Laguerre-Gaussian laser pulses.

PubMed

Hu, Li-Xiang; Yu, Tong-Pu; Sheng, Zheng-Ming; Vieira, Jorge; Zou, De-Bin; Yin, Yan; McKenna, Paul; Shao, Fu-Qiu

2018-05-08

Generation of attosecond bunches of energetic electrons offers significant potential from ultrafast physics to novel radiation sources. However, it is still a great challenge to stably produce such electron beams with lasers, since the typical subfemtosecond electron bunches from laser-plasma interactions either carry low beam charge, or propagate for only several tens of femtoseconds. Here we propose an all-optical scheme for generating dense attosecond electron bunches via the interaction of an intense Laguerre-Gaussian (LG) laser pulse with a nanofiber. The dense bunch train results from the unique field structure of a circularly polarized LG laser pulse, enabling each bunch to be phase-locked and accelerated forward with low divergence, high beam charge and large beam-angular-momentum. This paves the way for wide applications in various fields, e.g., ultrabrilliant attosecond x/γ-ray emission.

The Network Structure of Human Personality According to the NEO-PI-R: Matching Network Community Structure to Factor Structure

PubMed Central

Goekoop, Rutger; Goekoop, Jaap G.; Scholte, H. Steven

2012-01-01

Introduction Human personality is described preferentially in terms of factors (dimensions) found using factor analysis. An alternative and highly related method is network analysis, which may have several advantages over factor analytic methods. Aim To directly compare the ability of network community detection (NCD) and principal component factor analysis (PCA) to examine modularity in multidimensional datasets such as the neuroticism-extraversion-openness personality inventory revised (NEO-PI-R). Methods 434 healthy subjects were tested on the NEO-PI-R. PCA was performed to extract factor structures (FS) of the current dataset using both item scores and facet scores. Correlational network graphs were constructed from univariate correlation matrices of interactions between both items and facets. These networks were pruned in a link-by-link fashion while calculating the network community structure (NCS) of each resulting network using the Wakita Tsurumi clustering algorithm. NCSs were matched against FS and networks of best matches were kept for further analysis. Results At facet level, NCS showed a best match (96.2%) with a ‘confirmatory’ 5-FS. At item level, NCS showed a best match (80%) with the standard 5-FS and involved a total of 6 network clusters. Lesser matches were found with ‘confirmatory’ 5-FS and ‘exploratory’ 6-FS of the current dataset. Network analysis did not identify facets as a separate level of organization in between items and clusters. A small-world network structure was found in both item- and facet level networks. Conclusion We present the first optimized network graph of personality traits according to the NEO-PI-R: a ‘Personality Web’. Such a web may represent the possible routes that subjects can take during personality development. NCD outperforms PCA by producing plausible modularity at item level in non-standard datasets, and can identify the key roles of individual items and clusters in the network. PMID:23284713

The network structure of human personality according to the NEO-PI-R: matching network community structure to factor structure.

PubMed

Goekoop, Rutger; Goekoop, Jaap G; Scholte, H Steven

2012-01-01

Human personality is described preferentially in terms of factors (dimensions) found using factor analysis. An alternative and highly related method is network analysis, which may have several advantages over factor analytic methods. To directly compare the ability of network community detection (NCD) and principal component factor analysis (PCA) to examine modularity in multidimensional datasets such as the neuroticism-extraversion-openness personality inventory revised (NEO-PI-R). 434 healthy subjects were tested on the NEO-PI-R. PCA was performed to extract factor structures (FS) of the current dataset using both item scores and facet scores. Correlational network graphs were constructed from univariate correlation matrices of interactions between both items and facets. These networks were pruned in a link-by-link fashion while calculating the network community structure (NCS) of each resulting network using the Wakita Tsurumi clustering algorithm. NCSs were matched against FS and networks of best matches were kept for further analysis. At facet level, NCS showed a best match (96.2%) with a 'confirmatory' 5-FS. At item level, NCS showed a best match (80%) with the standard 5-FS and involved a total of 6 network clusters. Lesser matches were found with 'confirmatory' 5-FS and 'exploratory' 6-FS of the current dataset. Network analysis did not identify facets as a separate level of organization in between items and clusters. A small-world network structure was found in both item- and facet level networks. We present the first optimized network graph of personality traits according to the NEO-PI-R: a 'Personality Web'. Such a web may represent the possible routes that subjects can take during personality development. NCD outperforms PCA by producing plausible modularity at item level in non-standard datasets, and can identify the key roles of individual items and clusters in the network.

Unapparent Information Revelation: Text Mining for Counterterrorism

NASA Astrophysics Data System (ADS)

Srihari, Rohini K.

Unapparent information revelation (UIR) is a special case of text mining that focuses on detecting possible links between concepts across multiple text documents by generating an evidence trail explaining the connection. A traditional search involving, for example, two or more person names will attempt to find documents mentioning both these individuals. This research focuses on a different interpretation of such a query: what is the best evidence trail across documents that explains a connection between these individuals? For example, all may be good golfers. A generalization of this task involves query terms representing general concepts (e.g. indictment, foreign policy). Previous approaches to this problem have focused on graph mining involving hyperlinked documents, and link analysis exploiting named entities. A new robust framework is presented, based on (i) generating concept chain graphs, a hybrid content representation, (ii) performing graph matching to select candidate subgraphs, and (iii) subsequently using graphical models to validate hypotheses using ranked evidence trails. We adapt the DUC data set for cross-document summarization to evaluate evidence trails generated by this approach

Superconducting Cavity Development for Free Electron Lasers.

DTIC Science & Technology

1986-06-30

effects have been modeled extensively using the code PARMELA, including finite space charge . The conflict is resolved through the use of harmonically...depends on the specifics of how the whole accelerator is run, i.e., bunch length, interpulse spacing , macrobunch length, charge per bunch, external...this indicates that the bunch length should be as long as possible. 2.4 OPTIMUM BUNCH LENGTH 20 Although wakefield, HOM excitation and space charge

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

Summers, D. J.; Hart, T. L.; Acosta, J. G.

We propose a novel scheme for final muon ionization cooling with quadrupole doublets followed by emittance exchange in vacuum to achieve the small beam sizes needed by a muon collider. A flat muon beam with a series of quadrupole doublet half cells appears to provide the strong focusing required for final cooling. Each quadrupole doublet has a low beta region occupied by a dense, low Z absorber. After final cooling, normalized transverse, longitudinal, and angular momentum emittances of 0.100, 2.5, and 0.200 mm-rad are exchanged into 0.025, 70, and 0.0 mm-rad. A skew quadrupole triplet transforms a round muon bunchmore » with modest angular momentum into a flat bunch with no angular momentum. Thin electrostatic septa efficiently slice the flat bunch into 17 parts. The 17 bunches are interleaved into a 3.7 meter long train with RF deflector cavities. Snap bunch coalescence combines the muon bunch train longitudinally in a 21 GeV ring in 55 µs, one quarter of a synchrotron oscillation period. A linear long wavelength RF bucket gives each bunch a different energy causing the bunches to drift in the ring until they merge into one bunch and can be captured in a short wavelength RF bucket with a 13% muon decay loss and a packing fraction as high as 87 %.« less

Capture, acceleration and bunching rf systems for the MEIC booster and storage rings

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

Wang, Shaoheng; Guo, Jiquan; Lin, Fanglei

2015-09-01

The Medium-energy Electron Ion Collider (MEIC), proposed by Jefferson Lab, consists of a series of accelerators. The electron collider ring accepts electrons from CEBAF at energies from 3 to 12 GeV. Protons and ions are delivered to a booster and captured in a long bunch before being ramped and transferred to the ion collider ring. The ion collider ring accelerates a small number of long ion bunches to colliding energy before they are re-bunched into a high frequency train of very short bunches for colliding. Two sets of low frequency RF systems are needed for the long ion bunch energymore » ramping in the booster and ion collider ring. Another two sets of high frequency RF cavities are needed for re-bunching in the ion collider ring and compensating synchrotron radiation energy loss in the electron collider ring. The requirements from energy ramping, ion beam bunching, electron beam energy compensation, collective effects, beam loading and feedback capability, RF power capability, etc. are presented. The preliminary designs of these RF systems are presented. Concepts for the baseline cavity and RF station configurations are described, as well as some options that may allow more flexible injection and acceleration schemes.« less

Bunch Length Measurements at the JLab FEL Using Coherent Transition and Synchrotron Radiation

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

Pavel Evtushenko; James Coleman; Kevin Jordan

2006-05-01

The JLab FEL is routinely operated with sub-picosecond bunches. The short bunch length is important for high gain of the FEL. Coherent transition radiation has been used for the bunch length measurements for many years [1]. This diagnostic can be used only in the pulsed beam mode. It is our goal to run the FEL with CW beam and a 74.85 MHz micropulse repetition rate, which, with the 135 pC nominal bunch charge corresponds to the beam average current of 10 mA. Hence it is very desirable to have the possibility of making bunch length measurements when running CW beammore » with any micropulse frequency. We use a Fourier transform infrared (FTIR) interferometer, which is essentially a Michelson interferometer, to measure the spectrum of the coherent synchrotron radiation generated in the last dipole of the magnetic bunch compressor upstream of the FEL wiggler. This noninvasive diagnostic provides bunch length measurements for CW beam operation at any micropulse frequency. We also compare the measurements made with the help of the FTIR interferometer with data obtained using the Martin-Puplett interferometer [1]. Results of the two diagnostics agree within 15 %. Here we present a description of the experimental setup, data evaluation procedure and results of the beam measurements.« less

Bunch Length Measurements at the JLab FEL Using Coherent Transition and Synchrotron Radiation

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

Evtushenko, P.; Coleman, J.; Jordan, K.

2006-11-20

The JLab FEL is routinely operated with sub-picosecond bunches. The short bunch length is important for high gain of the FEL. Coherent transition radiation has been used for the bunch length measurements for many years. This diagnostic can be used only in the pulsed beam mode. It is our goal to run the FEL with CW beam and a 74.85 MHz micropulse repetition rate, which, with the 135 pC nominal bunch charge corresponds to the beam average current of 10 mA, Hence it is very desirable to have the possibility of making bunch length measurements when running CW beam withmore » any micropulse frequency. We use a Fourier transform infrared (FTIR) interferometer, which is essentially a Michelson interferometer, to measure the spectrum of the coherent synchrotron radiation generated in the last dipole of the magnetic bunch compressor upstream of the FEL wiggler. This noninvasive diagnostic provides bunch length measurements for CW beam operation at any micropulse frequency. We also compare the measurements made with the help of the FTIR interferometer with data obtained using the Martin-Puplett interferometer. Results of the two diagnostics agree within 15 %. Here we present a description of the experimental setup, data evaluation procedure and results of the beam measurements.« less

Electron cooling of a bunched ion beam in a storage ring

NASA Astrophysics Data System (ADS)

Zhao, He; Mao, Lijun; Yang, Jiancheng; Xia, Jiawen; Yang, Xiaodong; Li, Jie; Tang, Meitang; Shen, Guodong; Ma, Xiaoming; Wu, Bo; Wang, Geng; Ruan, Shuang; Wang, Kedong; Dong, Ziqiang

2018-02-01

A combination of electron cooling and rf system is an effective method to compress the beam bunch length in storage rings. A simulation code based on multiparticle tracking was developed to calculate the bunched ion beam cooling process, in which the electron cooling, intrabeam scattering (IBS), ion beam space-charge field, transverse and synchrotron motion are considered. Meanwhile, bunched ion beam cooling experiments have been carried out in the main cooling storage ring (CSRm) of the Heavy Ion Research Facility in Lanzhou, to investigate the minimum bunch length obtained by the cooling method, and study the dependence of the minimum bunch length on beam and machine parameters. The experiments show comparable results to those from simulation. Based on these simulations and experiments, we established an analytical model to describe the limitation of the bunch length of the cooled ion beam. It is observed that the IBS effect is dominant for low intensity beams, and the space-charge effect is much more important for high intensity beams. Moreover, the particles will not be bunched for much higher intensity beam. The experimental results in CSRm show a good agreement with the analytical model in the IBS dominated regime. The simulation work offers us comparable results to those from the analytical model both in IBS dominated and space-charge dominated regimes.

Coherent Terahertz Smith Purcell radiation from beam bunching

NASA Astrophysics Data System (ADS)

Shi, Zongjun; Yang, Ziqiang; Liang, Zheng; Lan, Feng; Liu, Wenxin; Gao, Xi; Li, D.

2007-08-01

This paper presents a possible method to produce beam bunching and obtain coherent Terahertz (THz) Smith-Purcell (SP) radiation. A model of two-section rectangular grating is proposed. In the first section with a flat conducting roof, a continuous beam is bunched by using an 88.5 GHz input signal. In the second section without metal roof, the coherent THz SP radiation is stimulated by the bunched beam interacting with the grating. The particle-in-cell (PIC) simulations show that the beam is bunched at the downstream of the first section. The strongest radiation is observed at 120° with the frequency of 266.5 GHz in the second section.

Temporal characterization of ultrashort linearly chirped electron bunches generated from a laser wakefield accelerator

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

Zhang, C. J.; Hua, J. F.; Wan, Y.

A new method for diagnosing the temporal characteristics of ultrashort electron bunches with linear energy chirp generated from a laser wakefield accelerator is described. When the ionization-injected bunch interacts with the back of the drive laser, it is deflected and stretched along the direction of the electric field of the laser. Upon exiting the plasma, if the bunch goes through a narrow slit in front of the dipole magnet that disperses the electrons in the plane of the laser polarization, it can form a series of bunchlets that have different energies but are separated by half a laser wavelength. Sincemore » only the electrons that are undeflected by the laser go through the slit, the energy spectrum of the bunch is modulated. By analyzing the modulated energy spectrum, the shots where the bunch has a linear energy chirp can be recognized. Consequently, the energy chirp and beam current profile of those bunches can be reconstructed. Lastly, this method is demonstrated through particle-in-cell simulations and experiment.« less

Self-consistent Simulations and Analysis of the Coupled-Bunch Instability for Arbitrary Multi-Bunch Configurations

DOE PAGES

Bassi, Gabriele; Blednykh, Alexei; Smalyuk, Victor

2016-02-24

A novel algorithm for self-consistent simulations of long-range wakefield effects has been developed and applied to the study of both longitudinal and transverse coupled-bunch instabilities at NSLS-II. The algorithm is implemented in the new parallel tracking code space (self-consistent parallel algorithm for collective effects) discussed in the paper. The code is applicable for accurate beam dynamics simulations in cases where both bunch-to-bunch and intrabunch motions need to be taken into account, such as chromatic head-tail effects on the coupled-bunch instability of a beam with a nonuniform filling pattern, or multibunch and single-bunch effects of a passive higher-harmonic cavity. The numericalmore » simulations have been compared with analytical studies. For a beam with an arbitrary filling pattern, intensity-dependent complex frequency shifts have been derived starting from a system of coupled Vlasov equations. The analytical formulas and numerical simulations confirm that the analysis is reduced to the formulation of an eigenvalue problem based on the known formulas of the complex frequency shifts for the uniform filling pattern case.« less

Bucket shaking stops bunch dancing in Tevatron

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

Burov, A.; Tan, C.Y.; /Fermilab

2011-03-01

Bunches in Tevatron are known to be longitudinally unstable: their collective oscillations, also called dancing bunches, persist without any signs of decay. Typically, a damper is used to stop these oscillations, but recently, it was theoretically predicted that the oscillations can be stabilized by means of small bucket shaking. Dedicated measurements in Tevatron have shown that this method does stop the dancing. According to predictions of Refs. [2,3], the flattening of the bunch distribution at low amplitudes should make the bunch more stable against LLD. An experiment has been devised to flatten the distribution by modulating the RF phase atmore » the low-amplitude synchrotron frequency for a few degrees of amplitude. These beam studies show that stabilisation really happens. After several consecutive shakings, the dancing disappears and the resulting bunch profile becomes smoother at the top. Although not shown in this report, sometimes a little divot forms at the centre of the distribution. These experiments confirm that resonant RF shaking flattens the bunch distribution at low amplitudes, and the dancing stops.« less

Method and means for measurement and control of pulsed charged beams

DOEpatents

Lewis, R.N.

A beam of bunches of charged particles is controlled by generating a signal in response to the passage of a bunch and adding to that signal a phase-flipped reference signal. The sum is amplified, detected, and applied to a synchronous detector to obtain a comparison of the phase of the reference signal with the phase of the signal responsive to the bunch. The comparison provides an error signal to control bunching.

Spatial configuration of a plasma bunch formed under gyromagnetic resonance in a magnetic mirror trap

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

Andreev, V. V.; Novitskii, A. A.; Umnov, A. M.

2016-06-15

The spatial configuration of a relativistic plasma bunch generated under the gyromagnetic autoresonance and confined in a magnetic mirror trap has been studied experimentally and numerically. The characteristics of bremsstrahlung generated by the plasma bunch from the gas and chamber walls were investigated using X-ray spectroscopy and radiometry, which made it possible to determine the localization of the bunch and analyze the dynamics of its confinement.

Longitudinal dynamics of twin electron bunches in the Linac Coherent Light Source

DOE PAGES

Zhang, Zhen; Ding, Yuantao; Marinelli, Agostino; ...

2015-03-02

The recent development of two-color x-ray free-electron lasers, as well as the successful demonstration of high-gradient witness bunch acceleration in a plasma, have generated strong interest in electron bunch trains, where two or more electron bunches are generated, accelerated and compressed in the same accelerating bucket. In this paper we give a detailed analysis of a twin-bunch technique in a high-energy linac. This method allows the generation of two electron bunches with high peak current and independent control of time delay and energy separation. We find that the wakefields in the accelerator structures play an important role in the twin-bunchmore » compression, and through analysis show that they can be used to extend the available time delay range. As a result, based on the theoretical model and simulations we propose several methods to achieve larger time delay.« less

Coherent-Radiation Spectroscopy of Few-Femtosecond Electron Bunches Using a Middle-Infrared Prism Spectrometer

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

Maxwell, T. J.; Behrens, C.; Ding, Y.

2013-10-28

Modern, high-brightness electron beams such as those from plasma wakefield accelerators and free-electron laser linacs continue the drive to ever-shorter bunch durations. In low-charge operation ( ~ 20 pC ), bunches shorter than 10 fs are reported at the Linac Coherent Light Source (LCLS). Though suffering from a loss of phase information, spectral diagnostics remain appealing as compact, low-cost bunch duration monitors suitable for deployment in beam dynamics studies and operations instrumentation. Progress in middle-infrared (MIR) imaging has led to the development of a single-shot, MIR prism spectrometer to characterize the corresponding LCLS coherent beam radiation power spectrum for few-femtosecondmore » scale bunch length monitoring. In this Letter, we report on the spectrometer installation as well as the temporal reconstruction of 3 to 60 fs-long LCLS electron bunch profiles using single-shot coherent transition radiation spectra.« less

Enhanced dense attosecond electron bunch generation by irradiating an intense laser on a cone target

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

Hu, Li-Xiang; Yu, Tong-Pu, E-mail: tongpu@nudt.edu.cn; Shao, Fu-Qiu

By using two-dimensional particle-in-cell simulations, we demonstrate enhanced spatially periodic attosecond electron bunches generation with an average density of about 10n{sub c} and cut-off energy up to 380 MeV. These bunches are acquired from the interaction of an ultra-short ultra-intense laser pulse with a cone target. The laser oscillating field pulls out the cone surface electrons periodically and accelerates them forward via laser pondermotive force. The inner cone wall can effectively guide these bunches and lead to their stable propagation in the cone, resulting in overdense energetic attosecond electron generation. We also consider the influence of laser and cone target parametersmore » on the bunch properties. It indicates that the attosecond electron bunch acceleration and propagation could be significantly enhanced without evident divergency by attaching a plasma capillary to the original cone tip.« less

BEAM DYNAMICS ANALYSIS FOR THE ULTRA-FAST KICKER IN CIRCULAR COOLER RING OF JLEIC

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

Huang, Yulu; Wang, Haipeng; Rimmer, Robert A.

An ultra-fast kicker system consisting of four quarter wavelength resonator based deflecting cavities was developed that simultaneously resonates at 10 subharmonic modes of the 476.3MHz bunch repetition frequency. Thus every 10th bunch in the bunch train will experience a transverse kick while all the other bunches are undisturbed. This fast kicker is being developed for the Energy Recovery Linac (ERL) based electron Circular Cooler Ring (CCR) in the proposed Jefferson Lab Electron Ion Collider (JLEIC, previously MEIC). The electron bunches can be reused 10-30 turns thus the beam current in the ERL can be reduced to 1/10 - 1/30 (150mAmore » - 50mA) of the cooling bunch current (1.5A). In this paper, several methods to synthesize such a kicker waveform and the comparison made by the beam dynamics tracking in Elegant will be discussed.« less

Method for maximizing the brightness of the bunches in a particle injector by converting a highly space-charged beam to a relativistic and emittance-dominated beam

DOEpatents

Hannon, Fay

2016-08-02

A method for maximizing the brightness of the bunches in a particle injector by converting a highly space-charged beam to a relativistic and emittance-dominated beam. The method includes 1) determining the bunch charge and the initial kinetic energy of the highly space-charge dominated input beam; 2) applying the bunch charge and initial kinetic energy properties of the highly space-charge dominated input beam to determine the number of accelerator cavities required to accelerate the bunches to relativistic speed; 3) providing the required number of accelerator cavities; and 4) setting the gradient of the radio frequency (RF) cavities; and 5) operating the phase of the accelerator cavities between -90 and zero degrees of the sinusoid of phase to simultaneously accelerate and bunch the charged particles to maximize brightness, and until the beam is relativistic and emittance-dominated.

Coherent radiation characteristics of modulated electron bunch formed in stack of two plates

NASA Astrophysics Data System (ADS)

Gevorgyan, H. L.; Gevorgian, L. A.

2017-07-01

The present article is devoted to the radiation from the electron bunch with modulated density passes through the stack consisting of two plates with different thicknesses and electrodynamic properties. The new elegant expression for the frequency-angular distribution of transition radiation is obtained. Using the existence of resonant frequency at which the longitudinal form-factor of bunch not suppresses radiation coherence and choosing parameters for the stack of plates, one can also avoid suppression of the radiation coherence by transverse form-factor of bunch. The radiation from a bunch with modulated density in the process SASE (self-amplified spontaneous emission) FEL can be partially coherent at a resonant frequency. Then the intense sub monochromatic beam of X-ray photons is formed. On the other hand one can define an important parameter of the bunch density modulation depth which is unknown to this day.

Study on Handing Process and Quality Degradation of Oil Palm Fresh Fruit Bunches (FFB)

NASA Astrophysics Data System (ADS)

Mat Sharif, Zainon Binti; Taib, Norhasnina Binti Mohd; Yusof, Mohd Sallehuddin Bin; Rahim, Mohammad Zulafif Bin; Tobi, Abdul Latif Bin Mohd; Othman, Mohd Syafiq Bin

2017-05-01

The main objective of this study is to determine the relationship between quality of oil palm fresh fruit bunches (FFB) and handling processes. The study employs exploratory and descriptive design, with quantitative approach and purposive sampling using self-administrated questionnaires, were obtained from 30 smallholder respondents from the Southern Region, Peninsular Malaysia. The study reveals that there was a convincing relationship between quality of oil palm fresh fruit bunches (FFB) and handling processes. The main handling process factors influencing quality of oil palm fresh fruit bunches (FFB) were harvesting activity and handling at the plantation area. As a result, it can be deduced that the handling process factors variable explains 82.80% of the variance that reflects the quality of oil palm fresh fruit bunches (FFB). The overall findings reveal that the handling process factors do play a significant role in the quality of oil palm fresh fruit bunches (FFB).

High peak power THz source for ultrafast electron diffraction

NASA Astrophysics Data System (ADS)

Liu, Shengguang

2018-01-01

Terahertz (THz) science and technology have already become the research highlight at present. In this paper, we put forward a device setup to carry out ultrafast fundamental research. A photocathode RF gun generates electron bunches with ˜MeV energy, ˜ps bunch width and about 25pC charge. The electron bunches inject the designed wiggler, the coherent radiation at THz spectrum emits from these bunches and increases rapidly until the saturation at ˜MW within a short wiggler. THz pulses can be used as pump to stimulate an ultra-short excitation in some kind of sample. Those electron bunches out of wiggler can be handled into bunches with ˜1pC change, small beam spot and energy spread to be probe. Because the pump and probe comes from the same electron source, synchronization between pump and probe is inherent. The whole facility can be compacted on a tabletop.

Model-based occluded object recognition using Petri nets

NASA Astrophysics Data System (ADS)

Zhou, Chuan; Hura, Gurdeep S.

1998-09-01

This paper discusses the use of Petri nets to model the process of the object matching between an image and a model under different 2D geometric transformations. This transformation finds its applications in sensor-based robot control, flexible manufacturing system and industrial inspection, etc. A description approach for object structure is presented by its topological structure relation called Point-Line Relation Structure (PLRS). It has been shown how Petri nets can be used to model the matching process, and an optimal or near optimal matching can be obtained by tracking the reachability graph of the net. The experiment result shows that object can be successfully identified and located under 2D transformation such as translations, rotations, scale changes and distortions due to object occluded partially.

Focusing and transport of high-intensity multi-MeV proton bunches from a compact laser-driven source

NASA Astrophysics Data System (ADS)

Busold, S.; Schumacher, D.; Deppert, O.; Brabetz, C.; Frydrych, S.; Kroll, F.; Joost, M.; Al-Omari, H.; Blažević, A.; Zielbauer, B.; Hofmann, I.; Bagnoud, V.; Cowan, T. E.; Roth, M.

2013-10-01

Laser ion acceleration provides for compact, high-intensity ion sources in the multi-MeV range. Using a pulsed high-field solenoid, for the first time high-intensity laser-accelerated proton bunches could be selected from the continuous exponential spectrum and delivered to large distances, containing more than 109 particles in a narrow energy interval around a central energy of 9.4 MeV and showing ≤30mrad envelope divergence. The bunches of only a few nanoseconds bunch duration were characterized 2.2 m behind the laser-plasma source with respect to arrival time, energy width, and intensity as well as spatial and temporal bunch profile.

Using Wikipedia and Conceptual Graph Structures to Generate Questions for Academic Writing Support

ERIC Educational Resources Information Center

Liu, Ming; Calvo, R. A.; Aditomo, A.; Pizzato, L. A.

2012-01-01

In this paper, we present a novel approach for semiautomatic question generation to support academic writing. Our system first extracts key phrases from students' literature review papers. Each key phrase is matched with a Wikipedia article and classified into one of five abstract concept categories: Research Field, Technology, System, Term, and…

Mapping the Network of Neuropsychological Impairment in Children with Autism Spectrum Disorder: A Graph Theoretical Analysis

ERIC Educational Resources Information Center

Ibrahim, George M.; Morgan, Benjamin R.; Vogan, Vanessa M.; Leung, Rachel C.; Anagnostou, Evdokia; Taylor, Margot J.

2016-01-01

Children with autism spectrum disorder (ASD) exhibit social-communicative impairments. Less is known about the neuropsychological profile of ASD, although cognitive and neuropsychological deficits are evident. We modelled neuropsychological function in 20 children with ASD and 20 sex, age and IQ matched typically-developing controls (ages 7-14) as…

An Efficient Algorithm for Partitioning and Authenticating Problem-Solutions of eLeaming Contents

ERIC Educational Resources Information Center

Dewan, Jahangir; Chowdhury, Morshed; Batten, Lynn

2013-01-01

Content authenticity and correctness is one of the important challenges in eLearning as there can be many solutions to one specific problem in cyber space. Therefore, the authors feel it is necessary to map problems to solutions using graph partition and weighted bipartite matching. This article proposes an efficient algorithm to partition…

Bunch mode specific rate corrections for PILATUS3 detectors

DOE PAGES

Trueb, P.; Dejoie, C.; Kobas, M.; ...

2015-04-09

PILATUS X-ray detectors are in operation at many synchrotron beamlines around the world. This article reports on the characterization of the new PILATUS3 detector generation at high count rates. As for all counting detectors, the measured intensities have to be corrected for the dead-time of the counting mechanism at high photon fluxes. The large number of different bunch modes at these synchrotrons as well as the wide range of detector settings presents a challenge for providing accurate corrections. To avoid the intricate measurement of the count rate behaviour for every bunch mode, a Monte Carlo simulation of the counting mechanismmore » has been implemented, which is able to predict the corrections for arbitrary bunch modes and a wide range of detector settings. This article compares the simulated results with experimental data acquired at different synchrotrons. It is found that the usage of bunch mode specific corrections based on this simulation improves the accuracy of the measured intensities by up to 40% for high photon rates and highly structured bunch modes. For less structured bunch modes, the instant retrigger technology of PILATUS3 detectors substantially reduces the dependency of the rate correction on the bunch mode. The acquired data also demonstrate that the instant retrigger technology allows for data acquisition up to 15 million photons per second per pixel.« less

Potential secondary inoculum sources of Botrytis cinerea and their influence on bunch rot development in dry Mediterranean climate vineyards.

PubMed

Calvo-Garrido, Carlos; Usall, Josep; Viñas, Inmaculada; Elmer, Philip Ag; Cases, Elena; Teixidó, Neus

2014-06-01

Epidemiological studies have described the life cycle of B. cinerea in vineyards. However, there is a lack of information on the several infection pathways and the quantitative relationships between secondary inoculum and bunch rot at harvest. Over two seasons, different spray programmes were used to determine key phenological stages for bunch rot development. Secondary inoculum sources within the bunch were also studied. The relative importance of flowering was evidenced in the given conditions, as treatments that included two fungicide applications at flowering were the most effective. In 2010, under conducive meteorological conditions for B. cinerea development after veraison, an extra application provided significantly higher control. Infections of necrotic tissues inside the bunch and latent infections developed mainly during flowering, while very low quantities of B. cinerea conidia were recovered from the fruit surface at veraison. Regression analysis correlated the incidence of latent infections and B. cinerea incidence on calyptras and aborted fruits at veraison with incidence of Botrytis bunch rot at harvest, presenting R2 = 0.95 for the overall regression model. This work points out key phenological stages during the season for bunch rot and B. cinerea secondary inoculum development and relates quantitatively inoculum sources at veraison to bunch rot at harvest. Recommendations for field applications of antibotrytic products are also suggested. © 2013 Society of Chemical Industry.

Matching next-to-leading order predictions to parton showers in supersymmetric QCD

DOE PAGES

Degrande, Céline; Fuks, Benjamin; Hirschi, Valentin; ...

2016-02-03

We present a fully automated framework based on the FeynRules and MadGraph5_aMC@NLO programs that allows for accurate simulations of supersymmetric QCD processes at the LHC. Starting directly from a model Lagrangian that features squark and gluino interactions, event generation is achieved at the next-to-leading order in QCD, matching short-distance events to parton showers and including the subsequent decay of the produced supersymmetric particles. As an application, we study the impact of higher-order corrections in gluino pair-production in a simplified benchmark scenario inspired by current gluino LHC searches.

Independence polynomial and matching polynomial of the Koch network

NASA Astrophysics Data System (ADS)

Liao, Yunhua; Xie, Xiaoliang

2015-11-01

The lattice gas model and the monomer-dimer model are two classical models in statistical mechanics. It is well known that the partition functions of these two models are associated with the independence polynomial and the matching polynomial in graph theory, respectively. Both polynomials have been shown to belong to the “#P-complete” class, which indicate the problems are computationally “intractable”. We consider these two polynomials of the Koch networks which are scale-free with small-world effects. Explicit recurrences are derived, and explicit formulae are presented for the number of independent sets of a certain type.

Matching next-to-leading order predictions to parton showers in supersymmetric QCD

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

Degrande, Céline; Fuks, Benjamin; Hirschi, Valentin

We present a fully automated framework based on the FeynRules and MadGraph5_aMC@NLO programs that allows for accurate simulations of supersymmetric QCD processes at the LHC. Starting directly from a model Lagrangian that features squark and gluino interactions, event generation is achieved at the next-to-leading order in QCD, matching short-distance events to parton showers and including the subsequent decay of the produced supersymmetric particles. As an application, we study the impact of higher-order corrections in gluino pair-production in a simplified benchmark scenario inspired by current gluino LHC searches.

Use of a corrugated beam pipe as a passive deflector for bunch length measurements

NASA Astrophysics Data System (ADS)

Seok, Jimin; Chung, Moses; Kang, Heung-Sik; Min, Chang-Ki; Na, Donghyun

2018-02-01

We report the experimental demonstration of bunch length measurements using a corrugated metallic beam pipe as a passive deflector. The corrugated beam pipe has been adopted for reducing longitudinal chirping after the bunch compressors in several XFEL facilities worldwide. In the meantime, there have been attempts to measure the electron bunch's longitudinal current profile using the dipole wakefields generated in the corrugated pipe. Nevertheless, the bunch shape reconstructed from the nonlinearly deflected beam suffers from significant distortion, particularly near the head of the bunch. In this paper, we introduce an iterative process to improve the resolution of the bunch shape reconstruction. The astra and elegant simulations have been performed for pencil beam and cigar beam cases, in order to verify the effectiveness of the reconstruction process. To overcome the undesirable effects of transverse beam spreads, a measurement scheme involving both the corrugated beam pipe and the spectrometer magnet has been employed, both of which do not require a dedicated (and likely very expensive) rf system. A proof-of-principle experiment was carried out at Pohang Accelerator Laboratory (PAL) Injector Test Facility (ITF), and its results are discussed together with a comparison with the rf deflector measurement.

Theoretical analysis and simulation of the influence of self-bunching effects and longitudinal space charge effects on the propagation of keV electron bunch produced by a novel S-band Micro-Pulse electron Gun

NASA Astrophysics Data System (ADS)

Zhao, Jifei; Lu, Xiangyang; Zhou, Kui; Yang, Ziqin; Yang, Deyu; Luo, Xing; Tan, Weiwei; Yang, Yujia

2016-06-01

As an important electron source, Micro-Pulse electron Gun (MPG) which is qualified for producing high average current, short pulse, low emittance electron bunches steadily holds promise to use as an electron source of Coherent Smith-Purcell Radiation (CSPR), Free Electron Laser (FEL). The stable output of S-band MPG has been achieved in many labs. To establish reliable foundation for the future application of it, the propagation of picosecond electron bunch produced by MPG should be studied in detail. In this article, the MPG which was working on the rising stage of total effective Secondary Electron Yield (SEY) curve was introduced. The self-bunching mechanism was discussed in depth both in the multipacting amplifying state and the steady working state. The bunch length broadening induced by the longitudinal space-charge (SC) effects was investigated by different theoretical models in different regions. The 2D PIC codes MAGIC and beam dynamic codes TraceWin simulations were also performed in the propagation. The result shows an excellent agreement between the simulation and the theoretical analysis for bunch length evolution.

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

Pfeffer, H.; Saewert, G.

This paper reports on a 6 kV modulator built and installed at Fermilab to drive the electron gun anode for the Tevatron Electron Lens (TEL). The TEL was built with the intention of shifting the individual (anti)proton bunch tunes to even out the tune spread among all 36 bunches with the desire of improving Tevatron integrated luminosity. This modulator is essentially a 6 kV arbitrary waveform generator that enables the TEL to define the electron beam intensity on a bunch-by-bunch basis. A voltage waveform is constructed having a 7 μs duration that corresponds to the tune shift requirements of amore » 12-bunch (anti)proton beam pulse train. This waveform is played out for any one or all three bunch trains in the Tevatron. The programmed waveform voltages transition to different levels at time intervals corresponding to the 395 ns bunch spacing. In addition, complex voltage waveforms can be played out at a sustained rate of 143 kHz over the full 6 kV output range. This paper describes the novel design of the inductive adder topology employing five transformers. It describes the design aspects that minimize switching losses for this multi-kilovolt, high repetition rate and high duty factor application.« less

Bunch Length Measurements at JLab FEL

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

P. Evtushenko; J. L. Coleman; K. Jordan

2006-09-01

The JLab FEL is routinely operated with sub-picosecond bunches. The short bunch length is important for high gain of the FEL. Coherent transition radiation has been used for the bunch length measurements for many years. This diagnostic can be used only in the pulsed beam mode. It is our goal to run FEL with CW beam and 74.85 MHz micropulse repetition rate. Hence it is very desirable to have the possibility of doing the bunch length measurements when running CW beam with any micropulse frequency. We use a Fourier transform infrared interferometer, which is essentially a Michelson interferometer, to measuremore » the spectrum of the coherent synchrotron radiation generated in the last dipole of the magnetic bunch compressor upstream of the FEL wiggler. This noninvasive diagnostic provides the bunch length measurements for CW beam operation at any micropulse frequency. We also compare the measurements made with the help of the FTIR interferometer with the data obtained by the Martin-Puplett interferometer. Results of the two diagnostics are usually agree within 15%. Here we present a description of the experimental setup, data evaluation procedure and results of the beam measurements.« less

The Edge-Disjoint Path Problem on Random Graphs by Message-Passing.

PubMed

Altarelli, Fabrizio; Braunstein, Alfredo; Dall'Asta, Luca; De Bacco, Caterina; Franz, Silvio

2015-01-01

We present a message-passing algorithm to solve a series of edge-disjoint path problems on graphs based on the zero-temperature cavity equations. Edge-disjoint paths problems are important in the general context of routing, that can be defined by incorporating under a unique framework both traffic optimization and total path length minimization. The computation of the cavity equations can be performed efficiently by exploiting a mapping of a generalized edge-disjoint path problem on a star graph onto a weighted maximum matching problem. We perform extensive numerical simulations on random graphs of various types to test the performance both in terms of path length minimization and maximization of the number of accommodated paths. In addition, we test the performance on benchmark instances on various graphs by comparison with state-of-the-art algorithms and results found in the literature. Our message-passing algorithm always outperforms the others in terms of the number of accommodated paths when considering non trivial instances (otherwise it gives the same trivial results). Remarkably, the largest improvement in performance with respect to the other methods employed is found in the case of benchmarks with meshes, where the validity hypothesis behind message-passing is expected to worsen. In these cases, even though the exact message-passing equations do not converge, by introducing a reinforcement parameter to force convergence towards a sub optimal solution, we were able to always outperform the other algorithms with a peak of 27% performance improvement in terms of accommodated paths. On random graphs, we numerically observe two separated regimes: one in which all paths can be accommodated and one in which this is not possible. We also investigate the behavior of both the number of paths to be accommodated and their minimum total length.

The Edge-Disjoint Path Problem on Random Graphs by Message-Passing

PubMed Central

2015-01-01

We present a message-passing algorithm to solve a series of edge-disjoint path problems on graphs based on the zero-temperature cavity equations. Edge-disjoint paths problems are important in the general context of routing, that can be defined by incorporating under a unique framework both traffic optimization and total path length minimization. The computation of the cavity equations can be performed efficiently by exploiting a mapping of a generalized edge-disjoint path problem on a star graph onto a weighted maximum matching problem. We perform extensive numerical simulations on random graphs of various types to test the performance both in terms of path length minimization and maximization of the number of accommodated paths. In addition, we test the performance on benchmark instances on various graphs by comparison with state-of-the-art algorithms and results found in the literature. Our message-passing algorithm always outperforms the others in terms of the number of accommodated paths when considering non trivial instances (otherwise it gives the same trivial results). Remarkably, the largest improvement in performance with respect to the other methods employed is found in the case of benchmarks with meshes, where the validity hypothesis behind message-passing is expected to worsen. In these cases, even though the exact message-passing equations do not converge, by introducing a reinforcement parameter to force convergence towards a sub optimal solution, we were able to always outperform the other algorithms with a peak of 27% performance improvement in terms of accommodated paths. On random graphs, we numerically observe two separated regimes: one in which all paths can be accommodated and one in which this is not possible. We also investigate the behavior of both the number of paths to be accommodated and their minimum total length. PMID:26710102

Flexible pulse delay control up to picosecond for high-intensity twin electron bunches

DOE PAGES

Zhang, Zhen; Ding, Yuantao; Emma, Paul; ...

2015-09-10

Two closely spaced electron bunches have attracted strong interest due to their applications in two color X-ray free-electron lasers as well as witness bunch acceleration in plasmas and dielectric structures. In this paper, we propose a new scheme of delay system to vary the time delay up to several picoseconds while not affecting the bunch compression. Numerical simulations based on the Linac Coherent Light Source are performed to demonstrate the feasibility of this method.

Bunch-Kaufman factorization for real symmetric indefinite banded matrices

NASA Technical Reports Server (NTRS)

Jones, Mark T.; Patrick, Merrell L.

1989-01-01

The Bunch-Kaufman algorithm for factoring symmetric indefinite matrices was rejected for banded matrices because it destroys the banded structure of the matrix. Herein, it is shown that for a subclass of real symmetric matrices which arise in solving the generalized eigenvalue problem using Lanczos's method, the Bunch-Kaufman algorithm does not result in major destruction of the bandwidth. Space time complexities of the algorithm are given and used to show that the Bunch-Kaufman algorithm is a significant improvement over LU factorization.

Plasma-driven ultrashort bunch diagnostics

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

Dornmair, I.; Schroeder, C. B.; Floettmann, K.

2016-06-10

Ultrashort electron bunches are crucial for an increasing number of applications, however, diagnosing their longitudinal phase space remains a challenge. We propose a new method that harnesses the strong electric fields present in a laser driven plasma wakefield. By transversely displacing driver laser and witness bunch, a streaking field is applied to the bunch. This field maps the time information to a transverse momentum change and, consequently, to a change of transverse position. We illustrate our method with simulations where we achieve a time resolution in the attosecond range.

A Functional Analytic Approach To Computer-Interactive Mathematics

PubMed Central

2005-01-01

Following a pretest, 11 participants who were naive with regard to various algebraic and trigonometric transformations received an introductory lecture regarding the fundamentals of the rectangular coordinate system. Following the lecture, they took part in a computer-interactive matching-to-sample procedure in which they received training on particular formula-to-formula and formula-to-graph relations as these formulas pertain to reflections and vertical and horizontal shifts. In training A-B, standard formulas served as samples and factored formulas served as comparisons. In training B-C, factored formulas served as samples and graphs served as comparisons. Subsequently, the program assessed for mutually entailed B-A and C-B relations as well as combinatorially entailed C-A and A-C relations. After all participants demonstrated mutual entailment and combinatorial entailment, we employed a test of novel relations to assess 40 different and complex variations of the original training formulas and their respective graphs. Six of 10 participants who completed training demonstrated perfect or near-perfect performance in identifying novel formula-to-graph relations. Three of the 4 participants who made more than three incorrect responses during the assessment of novel relations showed some commonality among their error patterns. Derived transfer of stimulus control using mathematical relations is discussed. PMID:15898471

Graph theory network function in Parkinson's disease assessed with electroencephalography.

PubMed

Utianski, Rene L; Caviness, John N; van Straaten, Elisabeth C W; Beach, Thomas G; Dugger, Brittany N; Shill, Holly A; Driver-Dunckley, Erika D; Sabbagh, Marwan N; Mehta, Shyamal; Adler, Charles H; Hentz, Joseph G

2016-05-01

To determine what differences exist in graph theory network measures derived from electroencephalography (EEG), between Parkinson's disease (PD) patients who are cognitively normal (PD-CN) and matched healthy controls; and between PD-CN and PD dementia (PD-D). EEG recordings were analyzed via graph theory network analysis to quantify changes in global efficiency and local integration. This included minimal spanning tree analysis. T-tests and correlations were used to assess differences between groups and assess the relationship with cognitive performance. Network measures showed increased local integration across all frequency bands between control and PD-CN; in contrast, decreased local integration occurred in PD-D when compared to PD-CN in the alpha1 frequency band. Differences found in PD-MCI mirrored PD-D. Correlations were found between network measures and assessments of global cognitive performance in PD. Our results reveal distinct patterns of band and network measure type alteration and breakdown for PD, as well as with cognitive decline in PD. These patterns suggest specific ways that interaction between cortical areas becomes abnormal and contributes to PD symptoms at various stages. Graph theory analysis by EEG suggests that network alteration and breakdown are robust attributes of PD cortical dysfunction pathophysiology. Copyright © 2016 International Federation of Clinical Neurophysiology. Published by Elsevier Ireland Ltd. All rights reserved.

A functional analytic approach to computer-interactive mathematics.

PubMed

Ninness, Chris; Rumph, Robin; McCuller, Glen; Harrison, Carol; Ford, Angela M; Ninness, Sharon K

2005-01-01

Following a pretest, 11 participants who were naive with regard to various algebraic and trigonometric transformations received an introductory lecture regarding the fundamentals of the rectangular coordinate system. Following the lecture, they took part in a computer-interactive matching-to-sample procedure in which they received training on particular formula-to-formula and formula-to-graph relations as these formulas pertain to reflections and vertical and horizontal shifts. In training A-B, standard formulas served as samples and factored formulas served as comparisons. In training B-C, factored formulas served as samples and graphs served as comparisons. Subsequently, the program assessed for mutually entailed B-A and C-B relations as well as combinatorially entailed C-A and A-C relations. After all participants demonstrated mutual entailment and combinatorial entailment, we employed a test of novel relations to assess 40 different and complex variations of the original training formulas and their respective graphs. Six of 10 participants who completed training demonstrated perfect or near-perfect performance in identifying novel formula-to-graph relations. Three of the 4 participants who made more than three incorrect responses during the assessment of novel relations showed some commonality among their error patterns. Derived transfer of stimulus control using mathematical relations is discussed.

Variability and performance evaluation of introgressed Nigerian dura x Deli dura oil palm progenies.

PubMed

Noh, A; Rafii, M Y; Mohd Din, A; Kushairi, A; Norziha, A; Rajanaidu, N; Latif, M A; Malek, M A

2014-04-03

Twelve introgressed oil palm (Elaeis guineensis) progenies of Nigerian dura x Deli dura were evaluated for bunch yield, yield attributes, bunch quality components and vegetative characters at the Malaysian Palm Oil Board Research Station, in Keratong, Pahang, Malaysia. Analysis of variance revealed significant to highly significant genotypic differences, indicating sufficient genetic variability among the progenies for bunch yield and its attributes, vegetative characters and bunch quality components, except fruit to bunch ratio. Fresh fruit bunch yield ranged from 167 kg·palm(-1)·year(-1) in PK1330 to 212 kg·palm(-1)·year(-1) in PK1351, with a mean yield of 192 kg·palm(-1)·year(-1). Among the progeny, PK1313 had the highest oil to bunch ratio (19.36%), due to its high mesocarp to fruit ratio, fruit to bunch ratio and low shell to fruit ratio. Among the progenies, PK1313 produced the highest oil yield of 31.4 kg·palm(-1)·year(-1), due to a high mesocarp to fruit ratio (61.2%) and a low shell to fruit ratio (30.7%), coupled with high fruit to bunch ratio (65.6%). PK1330 was found promising for selection, as it had desirable vegetative characters, including smaller petiole cross section (27.15 cm2), short rachis length (4.83 m), short palm height (1.85 m), and the lowest leaf number (164.6), as these vegetative characters are prerequisites for selecting palms for high density planting and high yield per hectare. The genetic variability among the progenies was found to be high, indicating ample scope for further breeding, followed by selection.

Design of a high-bunch-charge 112-MHz superconducting RF photoemission electron source

NASA Astrophysics Data System (ADS)

Xin, T.; Brutus, J. C.; Belomestnykh, Sergey A.; Ben-Zvi, I.; Boulware, C. H.; Grimm, T. L.; Hayes, T.; Litvinenko, Vladimir N.; Mernick, K.; Narayan, G.; Orfin, P.; Pinayev, I.; Rao, T.; Severino, F.; Skaritka, J.; Smith, K.; Than, R.; Tuozzolo, J.; Wang, E.; Xiao, B.; Xie, H.; Zaltsman, A.

2016-09-01

High-bunch-charge photoemission electron-sources operating in a continuous wave (CW) mode are required for many advanced applications of particle accelerators, such as electron coolers for hadron beams, electron-ion colliders, and free-electron lasers. Superconducting RF (SRF) has several advantages over other electron-gun technologies in CW mode as it offers higher acceleration rate and potentially can generate higher bunch charges and average beam currents. A 112 MHz SRF electron photoinjector (gun) was developed at Brookhaven National Laboratory to produce high-brightness and high-bunch-charge bunches for the coherent electron cooling proof-of-principle experiment. The gun utilizes a quarter-wave resonator geometry for assuring beam dynamics and uses high quantum efficiency multi-alkali photocathodes for generating electrons.

Wake excited in plasma by an ultrarelativistic pointlike bunch

DOE PAGES

Stupakov, G.; Breizman, B.; Khudik, V.; ...

2016-10-05

We study propagation of a relativistic electron bunch through a cold plasma assuming that the transverse and longitudinal dimensions of the bunch are much smaller than the plasma collisionless skin depth. Treating the bunch as a point charge and assuming that its charge is small, we derive a simplified system of equations for the plasma electrons and show that, through a simple rescaling of variables, the bunch charge can be eliminated from the equations. The equations demonstrate an ion cavity formed behind the driver. They are solved numerically and the scaling of the cavity parameters with the driver charge ismore » obtained. As a result, a numerical solution for the case of a positively charged driver is also found.« less

Observation of High Transformer Ratio of Shaped Bunch Generated by an Emittance-Exchange Beam Line.

PubMed

Gao, Q; Ha, G; Jing, C; Antipov, S P; Power, J G; Conde, M; Gai, W; Chen, H; Shi, J; Wisniewski, E E; Doran, D S; Liu, W; Whiteford, C E; Zholents, A; Piot, P; Baturin, S S

2018-03-16

Collinear wakefield acceleration has been long established as a method capable of generating ultrahigh acceleration gradients. Because of the success on this front, recently, more efforts have shifted towards developing methods to raise the transformer ratio (TR). This figure of merit is defined as the ratio of the peak acceleration field behind the drive bunch to the peak deceleration field inside the drive bunch. TR is always less than 2 for temporally symmetric drive bunch distributions and therefore recent efforts have focused on generating asymmetric distributions to overcome this limitation. In this Letter, we report on using the emittance-exchange method to generate a shaped drive bunch to experimentally demonstrate a TR≈5 in a dielectric wakefield accelerator.

Longitudinal emittance measurements in the Booster and AGS during the 2014 RHIC gold run

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

Zeno, K.

2014-08-18

This note describes longitudinal emittance measurements that were made in the Booster and AGS during the 2014 RHIC Gold run. It also contains an overview of the longitudinal aspects of their setup during this run. Each bunch intended for RHIC is composed of beam from 4 Booster cycles, and there are two of them per AGS cycle. For each of the 8 Booster cycles required to produce the 2 bunches in the AGS, a beam pulse from EVIS is injected into the Booster and captured in four h=4 buckets. Then those bunches are accelerated to a porch where they aremore » merged into 2 bunches and then into 1 bunch.« less

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

Balbekov, V.

Theoretical analysis of e-cloud instability in the Fermilab Recycler is represented in the paper. The e-cloud in strong magnetic field is treated as a set of immovable snakes each being initiated by some proton bunch. It is shown that the instability arises because of injection errors of the bunches which increase in time and from bunch to bunch along the batch being amplified by the e-cloud electric field. The particular attention is given to nonlinear additions to the cloud field. It is shown that the nonlinearity is the main factor which restricts growth of the bunch amplitude. Possible role ofmore » the field free parts of the Recycler id discussed as well. Results of calculations are compared with experimental data demonstrating good correlation.« less

Observation of coherent Smith-Purcell and transition radiation driven by single bunch and micro-bunched electron beams

NASA Astrophysics Data System (ADS)

Liang, Yifan; Du, Yingchao; Su, Xiaolu; Wang, Dan; Yan, Lixin; Tian, Qili; Zhou, Zheng; Wang, Dong; Huang, Wenhui; Gai, Wei; Tang, Chuanxiang; Konoplev, I. V.; Zhang, H.; Doucas, G.

2018-01-01

Generation of coherent Smith-Purcell (cSPr) and transition/diffraction radiation using a single bunch or a pre-modulated relativistic electron beam is one of the growing research areas aiming at the development of radiation sources and beam diagnostics for accelerators. We report the results of comparative experimental studies of terahertz radiation generation by an electron bunch and micro-bunched electron beams and the spectral properties of the coherent transition and SP radiation. The properties of cSPr spectra are investigated and discussed, and excitations of the fundamental and second harmonics of cSPr and their dependence on the beam-grating separation are shown. The experimental and theoretical results are compared, and good agreement is demonstrated.

Bunch-by-bunch detection of coherent transverse modes from digitized single-bpm signals in the Tevatron

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

Stancari, G.; Valishev, A.; Semenov, A.

2010-05-01

A system was developed for bunch-by-bunch detection of transverse proton and antiproton coherent oscillations based on the signal from a single beam-position monitor (BPM) located in a region of the ring with large amplitude functions. The signal is digitized over a large number of turns and Fourier-analyzed offline with a dedicated algorithm. To enhance the signal, the beam is excited with band-limited noise for about one second, and this was shown not to significantly affect the circulating beams even at high luminosity. The system is used to measure betatron tunes of individual bunches and to study beam-beam effects. In particular,more » it is one of the main diagnostic tools in an ongoing study of nonlinear beam-beam compensation studies with Gaussian electron lenses. We present the design and operation of this tool, together with results obtained with proton and antiproton bunches.« less

Overtaking collision effects in a cw double-pass proton linac

DOE PAGES

Tao, Yue; Qiang, Ji; Hwang, Kilean

2017-12-22

The recirculating superconducting proton linac has the advantage of reducing the number of cavities in the accelerator and the corresponding construction and operational costs. Beam dynamics simulations were done recently in a double-pass recirculating proton linac using a single proton beam bunch. For continuous wave (cw) operation, the high-energy proton bunch during the second pass through the linac will overtake and collide with the low-energy bunch during the first pass at a number of locations of the linac. These collisions might cause proton bunch emittance growth and beam quality degradation. Here, we study the collisional effects due to Coulomb space-chargemore » forces between the high-energy bunch and the low-energy bunch. Our results suggest that these effects on the proton beam quality would be small and might not cause significant emittance growth or beam blowup through the linac. A 10 mA, 500 MeV cw double-pass proton linac is feasible without using extra hardware for phase synchronization.« less

Simple method for generating adjustable trains of picosecond electron bunches

NASA Astrophysics Data System (ADS)

Muggli, P.; Allen, B.; Yakimenko, V. E.; Park, J.; Babzien, M.; Kusche, K. P.; Kimura, W. D.

2010-05-01

A simple, passive method for producing an adjustable train of picosecond electron bunches is demonstrated. The key component of this method is an electron beam mask consisting of an array of parallel wires that selectively spoils the beam emittance. This mask is positioned in a high magnetic dispersion, low beta-function region of the beam line. The incoming electron beam striking the mask has a time/energy correlation that corresponds to a time/position correlation at the mask location. The mask pattern is transformed into a time pattern or train of bunches when the dispersion is brought back to zero downstream of the mask. Results are presented of a proof-of-principle experiment demonstrating this novel technique that was performed at the Brookhaven National Laboratory Accelerator Test Facility. This technique allows for easy tailoring of the bunch train for a particular application, including varying the bunch width and spacing, and enabling the generation of a trailing witness bunch.

Overtaking collision effects in a cw double-pass proton linac

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

Tao, Yue; Qiang, Ji; Hwang, Kilean

The recirculating superconducting proton linac has the advantage of reducing the number of cavities in the accelerator and the corresponding construction and operational costs. Beam dynamics simulations were done recently in a double-pass recirculating proton linac using a single proton beam bunch. For continuous wave (cw) operation, the high-energy proton bunch during the second pass through the linac will overtake and collide with the low-energy bunch during the first pass at a number of locations of the linac. These collisions might cause proton bunch emittance growth and beam quality degradation. Here, we study the collisional effects due to Coulomb space-chargemore » forces between the high-energy bunch and the low-energy bunch. Our results suggest that these effects on the proton beam quality would be small and might not cause significant emittance growth or beam blowup through the linac. A 10 mA, 500 MeV cw double-pass proton linac is feasible without using extra hardware for phase synchronization.« less

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

Fox, John

A 4.2 GS/sec. beam excitation system with accelerator synchronization and power stages is described. The system is capable of playing unique samples (32 samples/bunch) for 15,000 turns on selected bunch(es) in the SPS in syn- chronism with the injection and acceleration cycle. The purpose of the system is to excite internal modes of single-bunch vertical motion, and study the bunch dynamics in the presence of developing Electron cloud or TMCI effects. The system includes a synchronized master oscillator, SPS timing functions, an FPGA based arbitrary waveform generator, 4.2 GS/sec. D/A system and four 80W 20-1000 MHz amplifiers driving a taperedmore » stripline pickup/kicker. A software GUI allows specification of various modulation signals, selection of bunches and turns to excite, while a remote control interface allows simple control/monitoring of the RF power stages located in the tunnel. The successful use of this system for SPS MD measurements in 2011 is a vital proof-of-principle for wideband feedback using similar functions to correct the beam motion.« less

Integration of prior knowledge into dense image matching for video surveillance

NASA Astrophysics Data System (ADS)

Menze, M.; Heipke, C.

2014-08-01

Three-dimensional information from dense image matching is a valuable input for a broad range of vision applications. While reliable approaches exist for dedicated stereo setups they do not easily generalize to more challenging camera configurations. In the context of video surveillance the typically large spatial extent of the region of interest and repetitive structures in the scene render the application of dense image matching a challenging task. In this paper we present an approach that derives strong prior knowledge from a planar approximation of the scene. This information is integrated into a graph-cut based image matching framework that treats the assignment of optimal disparity values as a labelling task. Introducing the planar prior heavily reduces ambiguities together with the search space and increases computational efficiency. The results provide a proof of concept of the proposed approach. It allows the reconstruction of dense point clouds in more general surveillance camera setups with wider stereo baselines.

Comparison of Point Matching Techniques for Road Network Matching

NASA Astrophysics Data System (ADS)

Hackeloeer, A.; Klasing, K.; Krisp, J. M.; Meng, L.

2013-05-01

Map conflation investigates the unique identification of geographical entities across different maps depicting the same geographic region. It involves a matching process which aims to find commonalities between geographic features. A specific subdomain of conflation called Road Network Matching establishes correspondences between road networks of different maps on multiple layers of abstraction, ranging from elementary point locations to high-level structures such as road segments or even subgraphs derived from the induced graph of a road network. The process of identifying points located on different maps by means of geometrical, topological and semantical information is called point matching. This paper provides an overview of various techniques for point matching, which is a fundamental requirement for subsequent matching steps focusing on complex high-level entities in geospatial networks. Common point matching approaches as well as certain combinations of these are described, classified and evaluated. Furthermore, a novel similarity metric called the Exact Angular Index is introduced, which considers both topological and geometrical aspects. The results offer a basis for further research on a bottom-up matching process for complex map features, which must rely upon findings derived from suitable point matching algorithms. In the context of Road Network Matching, reliable point matches provide an immediate starting point for finding matches between line segments describing the geometry and topology of road networks, which may in turn be used for performing a structural high-level matching on the network level.

Application of Quality Function Deployment (QFD) method and kano model to redesign fresh fruit bunches sorting tool

NASA Astrophysics Data System (ADS)

Anizar; Siregar, I.; Yahya, I.; Yesika, N.

2018-02-01

The activity of lowering fresh fruit bunches (FFB) from truck to sorting floor is performed manually by workers using a sorting tool. Previously, the sorting tool used is a pointed iron bar with a T-shaped handle. Changes made to the sorting tool causes several complaints on worker and affect the time to lower the fruit. The purpose of this article is to obtain the design of an FFB sorting tool that suits the needs of these workers by applying the Quality Function Deployment (QFD) and Kano Model methods. Both of the two methods will be integrated to find the design that matches workers’ image and psychological feeling. The main parameters are to obtain the customer requirements of the palm fruit loading workers, to find the most important technical characteristics and critical part affecting the quality of the FFB sorting tool. The customer requirements of the palm loading workers are the following : the color of the coating paint is gray, the bar material is made of stainless pipe, the main grip coating material is made of grip, the tip material is made of the spring steel, the additional grip is made of rubber and the handle is of triangular shape.

Pattern matching through Chaos Game Representation: bridging numerical and discrete data structures for biological sequence analysis

PubMed Central

2012-01-01

Background Chaos Game Representation (CGR) is an iterated function that bijectively maps discrete sequences into a continuous domain. As a result, discrete sequences can be object of statistical and topological analyses otherwise reserved to numerical systems. Characteristically, CGR coordinates of substrings sharing an L-long suffix will be located within 2-L distance of each other. In the two decades since its original proposal, CGR has been generalized beyond its original focus on genomic sequences and has been successfully applied to a wide range of problems in bioinformatics. This report explores the possibility that it can be further extended to approach algorithms that rely on discrete, graph-based representations. Results The exploratory analysis described here consisted of selecting foundational string problems and refactoring them using CGR-based algorithms. We found that CGR can take the role of suffix trees and emulate sophisticated string algorithms, efficiently solving exact and approximate string matching problems such as finding all palindromes and tandem repeats, and matching with mismatches. The common feature of these problems is that they use longest common extension (LCE) queries as subtasks of their procedures, which we show to have a constant time solution with CGR. Additionally, we show that CGR can be used as a rolling hash function within the Rabin-Karp algorithm. Conclusions The analysis of biological sequences relies on algorithmic foundations facing mounting challenges, both logistic (performance) and analytical (lack of unifying mathematical framework). CGR is found to provide the latter and to promise the former: graph-based data structures for sequence analysis operations are entailed by numerical-based data structures produced by CGR maps, providing a unifying analytical framework for a diversity of pattern matching problems. PMID:22551152

Large Eddy Simulation of Turbulent Combustion

DTIC Science & Technology

2005-10-01

a new method to automatically generate skeletal kinetic mechanisms for surrogate fuels, using the directed relation graph method with error...propagation, was developed. These mechanisms are guaranteed to match results obtained using detailed chemistry within a user- defined accuracy for any...specified target. They can be combined together to produce adequate chemical models for surrogate fuels. A library containing skeletal mechanisms of various

Automatic Online Educational Game Content Creation by Identifying Similar Chinese Characters with Radical Extraction and Graph Matching Algorithms

ERIC Educational Resources Information Center

Lai, Jason Kwong-Hung; Leung, Howard; Hu, Zhi-Hui; Tang, Jeff K. T.; Xu, Yun

2010-01-01

One of the difficulties in learning Chinese characters is distinguishing similar characters. This can cause misunderstanding and miscommunication in daily life. Thus, it is important for students learning the Chinese language to be able to distinguish similar characters and understand their proper usage. In this paper, the authors propose a game…

Operational experience on the generation and control of high brightness electron bunch trains at SPARC-LAB

NASA Astrophysics Data System (ADS)

Mostacci, A.; Alesini, D.; Anania, M. P.; Bacci, A.; Bellaveglia, M.; Biagioni, A.; Cardelli, F.; Castellano, Michele; Chiadroni, Enrica; Cianchi, Alessandro; Croia, M.; Di Giovenale, Domenico; Di Pirro, Giampiero; Ferrario, Massimo; Filippi, Francesco; Gallo, Alessandro; Gatti, Giancarlo; Giribono, Anna; Innocenti, L.; Marocchino, A.; Petrarca, M.; Piersanti, L.; Pioli, S.; Pompili, Riccardo; Romeo, Stefano; Rossi, Andrea Renato; Shpakov, V.; Scifo, J.; Vaccarezza, Cristina; Villa, Fabio; Weiwei, L.

2015-05-01

Sub-picosecond, high-brightness electron bunch trains are routinely produced at SPARC-LAB via the velocity bunching technique. Such bunch trains can be used to drive multi-color Free Electron Lasers (FELs) and plasma wake field accelerators. In this paper we present recent results at SPARC-LAB on the generation of such beams, highlighting the key points of our scheme. We will discuss also the on-going machine upgrades to allow driving FELs with plasma accelerated beams or with short electron pulses at an increased energy.

Simulated Performance of the Wisconsin Superconducting Electron Gun

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

R.A. Bosch, K.J. Kleman, R.A. Legg

2012-07-01

The Wisconsin superconducting electron gun is modeled with multiparticle tracking simulations using the ASTRA and GPT codes. To specify the construction of the emittance-compensation solenoid, we studied the dependence of the output bunch's emittance upon the solenoid's strength and field errors. We also evaluated the dependence of the output bunch's emittance upon the bunch's initial emittance and the size of the laser spot on the photocathode. The results suggest that a 200-pC bunch with an emittance of about one mm-mrad can be produced for a free-electron laser.

A THz Spectroscopy System Based on Coherent Radiation from Ultrashort Electron Bunches

NASA Astrophysics Data System (ADS)

Saisut, J.; Rimjaem, S.; Thongbai, C.

2018-05-01

A spectroscopy system will be discussed for coherent THz transition radiation emitted from short electron bunches, which are generated from a system consisting of an RF gun with a thermionic cathode, an alpha-magnet as a magnetic bunch compressor, and a linear accelerator for post-acceleration. The THz radiation is generated as backward transition radiation when electron bunches pass through an aluminum foil. The emitted THz transition radiation, which is coherent at wavelengths equal to and longer than the electron bunch length, is coupled to a Michelson interferometer. The performance of the spectroscopy system employing a Michelson interferometer is discussed. The radiation power spectra under different conditions are presented. As an example, the optical constant of a silicon wafer can be obtained using the dispersive Fourier transform spectroscopy (DFTS) technique.

Upstream gyrophase bunched ions - A mechanism for creation at the bow shock and the growth of velocity space structure through gyrophase mixing

NASA Technical Reports Server (NTRS)

Gurgiolo, C.; Parks, G. K.; Mauk, G. H.

1983-01-01

The conditions necessary for the production of gyrophase bunched ions at the bow shock are developed. The conditions are applied to the reflection mechanism presented by Paschmann et al. (1980), showing that when in their model a portion of the incident parallel velocity is converted into reflected perpendicular velocity, the reflected particles are gyrophase bunched. The growth of velocity space structure in the gyrophase bunched distribution through gyrophase mixing is also explored. The structure is found to be similar to that reported in diffuse and dispersed ion events. This together with the close correlation of the observation of gyrophase bunched ions with diffuse and dispersed ions has led us to speculate that these two populations may be closely related.

Construction and performance of the magnetic bunch compressor for the THz facility at Chiang Mai University

NASA Astrophysics Data System (ADS)

Saisut, J.; Kusoljariyakul, K.; Rimjaem, S.; Kangrang, N.; Wichaisirimongkol, P.; Thamboon, P.; Rhodes, M. W.; Thongbai, C.

2011-05-01

The Plasma and Beam Physics Research Facility at Chiang Mai University has established a THz facility to focus on the study of ultra-short electron pulses. Short electron bunches can be generated from a system that consists of a radio-frequency (RF) gun with a thermionic cathode, an alpha magnet as a magnetic bunch compressor, and a linear accelerator as a post-acceleration section. The alpha magnet is a conventional and simple instrument for low-energy electron bunch compression. With the alpha magnet constructed in-house, several hundred femtosecond electron bunches for THz radiation production can be generated from the thermionic RF gun. The construction and performance of the alpha magnet, as well as some experimental results, are presented in this paper.

Spherical nanocrystalline cellulose (NCC) from oil palm empty fruit bunch pulp via ultrasound assisted hydrolysis.

PubMed

Zianor Azrina, Z A; Beg, M Dalour H; Rosli, M Y; Ramli, Ridzuan; Junadi, Norhafzan; Alam, A K M Moshiul

2017-04-15

Nanocrystalline cellulose (NCC) was isolated from oil palm empty fruit bunch pulp (EFBP) using ultrasound assisted acid hydrolysis. The obtained NCC was analysed using FESEM, XRD, FTIR, and TGA, and compared with raw empty fruit bunch fibre (REFB), empty fruit bunch pulp (EFBP), and treated empty fruit bunch pulp (TEFBP). Based on FESEM analysis, it was found that NCC has a spherical shaped after acid hydrolysis with the assistance of ultrasound. This situation was different compared to previous studies that obtained rod-like shaped of NCC. Furthermore, the crystallinity of NCC is higher compared to REFB and EFBP. According to thermal stability, the NCC obtained shows remarkable sign of high thermal stability compared to REFB and EFBP. Copyright © 2017 Elsevier Ltd. All rights reserved.

Femtosecond timing-jitter between photo-cathode laser and ultra-short electron bunches by means of hybrid compression

NASA Astrophysics Data System (ADS)

Pompili, R.; Anania, M. P.; Bellaveglia, M.; Biagioni, A.; Castorina, G.; Chiadroni, E.; Cianchi, A.; Croia, M.; Di Giovenale, D.; Ferrario, M.; Filippi, F.; Gallo, A.; Gatti, G.; Giorgianni, F.; Giribono, A.; Li, W.; Lupi, S.; Mostacci, A.; Petrarca, M.; Piersanti, L.; Di Pirro, G.; Romeo, S.; Scifo, J.; Shpakov, V.; Vaccarezza, C.; Villa, F.

2016-08-01

The generation of ultra-short electron bunches with ultra-low timing-jitter relative to the photo-cathode (PC) laser has been experimentally proved for the first time at the SPARC_LAB test-facility (INFN-LNF, Frascati) exploiting a two-stage hybrid compression scheme. The first stage employs RF-based compression (velocity-bunching), which shortens the bunch and imprints an energy chirp on it. The second stage is performed in a non-isochronous dogleg line, where the compression is completed resulting in a final bunch duration below 90 fs (rms). At the same time, the beam arrival timing-jitter with respect to the PC laser has been measured to be lower than 20 fs (rms). The reported results have been validated with numerical simulations.

Generation of short electron bunches by a laser pulse crossing a sharp boundary of inhomogeneous plasma

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

Kuznetsov, S. V., E-mail: svk-IVTAN@yandex.ru

The formation of short electron bunches during the passage of a laser pulse of relativistic intensity through a sharp boundary of semi-bounded plasma has been analytically studied. It is shown in one-dimensional geometry that one physical mechanism that is responsible for the generation of electron bunches is their self-injection into the wake field of a laser pulse, which occurs due to the mixing of electrons during the action of the laser pulse on plasma. Simple analytic relationships are obtained that can be used for estimating the length and charge of an electron bunch and the spread of electron energies inmore » the bunch. The results of the analytical investigation are confirmed by data from numerical simulations.« less

Growth habit and surface morphology of L-arginine phosphate monohydrate single crystals

NASA Astrophysics Data System (ADS)

Sangwal, K.; Veintemillas-Verdaguer, S.; Torrent-Burgués, J.

1995-10-01

The results of a study of the growth habit and the surface topography of L-arginine phosphate monohydrate (LAP) single crystals as a function of supersaturation are described and discussed. Apart from a change in the growth habit with supersaturation, it was observed that most of the as-grown faces of LAP exhibit isolated growth hillocks and macrohillocks and parallel bunched layers and that the formation of bunched layers is pronounced on faces showing macrohillocks. Observations of bunching of growth layers emitted by macrohillocks on the {100} faces revealed that, for the onset of bunching close to a macrospiral, there is a characteristic threshold distance whose value depends on the interstep distance and supersaturation, but is independent of step height. The theoretical habit of LAP deduced from PBC analysis showed that all faces exhibiting growth hillocks and macrohillocks are F faces. Analysis of the results on bunch formation revealed that growth of LAP takes place by the direct integration of growth entities at the growth steps, that the bunching is facilitated by an increasing value of the activation energy for their integration, and that the observed dependencies of threshold distance on interstep distance, supersaturation and step height are qualitatively in agreement with van der Eerden and Müller-Krumbhaar's theory of bunch formation.

Simulation of emission and propagation of coherent synchrotron radiation wave fronts using the methods of wave optics

NASA Astrophysics Data System (ADS)

Chubar, O.

2006-09-01

The paper describes methods of efficient calculation of spontaneous synchrotron radiation (SR) by relativistic electrons in storage rings, and propagation of this radiation through optical elements and drift spaces of beamlines, using the principles of wave optics. In addition to the SR from one electron, incoherent and coherent synchrotron radiation (CSR) emitted by electron bunches is treated. CPU-efficient CSR calculation method taking into account 6D phase space distribution of electrons in a bunch is proposed. The properties of CSR emitted by electron bunches with small longitudinal and large transverse size are studied numerically (such situation can be realized in storage rings e.g. by transverse deflection of the electron bunches in special RF cavities). It is shown that if the transverse size of a bunch is much larger than the diffraction limit for single-electron SR at a given wavelength - it affects the angular distribution of the CSR at this wavelength and reduces the coherent flux. Nevertheless, for transverse bunch dimensions up to several millimeters and the longitudinal bunch size smaller than hundred micrometers, the resulting CSR flux in the far infrared spectral range is still many orders of magnitude higher than the flux of incoherent SR.

Extremely short relativistic-electron-bunch generation in the laser wakefield via novel bunch injection scheme

NASA Astrophysics Data System (ADS)

Khachatryan, A. G.; van Goor, F. A.; Boller, K.-J.; Reitsma, A. J.; Jaroszynski, D. A.

2004-12-01

Recently a new electron-bunch injection scheme for the laser wakefield accelerator has been proposed [

A 6 kV arbitrary waveform generator for the Tevatron Electron Lens

DOE PAGES

Pfeffer, H.; Saewert, G.

2011-11-09

This paper reports on a 6 kV modulator built and installed at Fermilab to drive the electron gun anode for the Tevatron Electron Lens (TEL). The TEL was built with the intention of shifting the individual (anti)proton bunch tunes to even out the tune spread among all 36 bunches with the desire of improving Tevatron integrated luminosity. This modulator is essentially a 6 kV arbitrary waveform generator that enables the TEL to define the electron beam intensity on a bunch-by-bunch basis. A voltage waveform is constructed having a 7 μs duration that corresponds to the tune shift requirements of amore » 12-bunch (anti)proton beam pulse train. This waveform is played out for any one or all three bunch trains in the Tevatron. The programmed waveform voltages transition to different levels at time intervals corresponding to the 395 ns bunch spacing. In addition, complex voltage waveforms can be played out at a sustained rate of 143 kHz over the full 6 kV output range. This paper describes the novel design of the inductive adder topology employing five transformers. It describes the design aspects that minimize switching losses for this multi-kilovolt, high repetition rate and high duty factor application.« less

Linearization of the longitudinal phase space without higher harmonic field

NASA Astrophysics Data System (ADS)

Zeitler, Benno; Floettmann, Klaus; Grüner, Florian

2015-12-01

Accelerator applications like free-electron lasers, time-resolved electron diffraction, and advanced accelerator concepts like plasma acceleration desire bunches of ever shorter longitudinal extent. However, apart from space charge repulsion, the internal bunch structure and its development along the beam line can limit the achievable compression due to nonlinear phase space correlations. In order to improve such a limited longitudinal focus, a correction by properly linearizing the phase space is required. At large scale facilities like Flash at Desy or the European Xfel, a higher harmonic cavity is installed for this purpose. In this paper, another method is described and evaluated: Expanding the beam after the electron source enables a higher order correction of the longitudinal focus by a subsequent accelerating cavity which is operated at the same frequency as the electron gun. The elaboration of this idea presented here is based on a ballistic bunching scheme, but can be extended to bunch compression based on magnetic chicanes. The core of this article is an analytic model describing this approach, which is verified by simulations, predicting possible bunch length below 1 fs at low bunch charge. Minimizing the energy spread down to σE/E <1 0-5 while keeping the bunch long is another interesting possibility, which finds applications, e.g., in time resolved transmission electron microscopy concepts.

Theoretical analysis and simulation of the influence of self-bunching effects and longitudinal space charge effects on the propagation of keV electron bunch produced by a novel S-band Micro-Pulse electron Gun

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

Zhao, Jifei; Lu, Xiangyang, E-mail: xylu@pku.edu.cn; Yang, Ziqin

As an important electron source, Micro-Pulse electron Gun (MPG) which is qualified for producing high average current, short pulse, low emittance electron bunches steadily holds promise to use as an electron source of Coherent Smith-Purcell Radiation (CSPR), Free Electron Laser (FEL). The stable output of S-band MPG has been achieved in many labs. To establish reliable foundation for the future application of it, the propagation of picosecond electron bunch produced by MPG should be studied in detail. In this article, the MPG which was working on the rising stage of total effective Secondary Electron Yield (SEY) curve was introduced. Themore » self-bunching mechanism was discussed in depth both in the multipacting amplifying state and the steady working state. The bunch length broadening induced by the longitudinal space-charge (SC) effects was investigated by different theoretical models in different regions. The 2D PIC codes MAGIC and beam dynamic codes TraceWin simulations were also performed in the propagation. The result shows an excellent agreement between the simulation and the theoretical analysis for bunch length evolution.« less

Stereo matching using census cost over cross window and segmentation-based disparity refinement

NASA Astrophysics Data System (ADS)

Li, Qingwu; Ni, Jinyan; Ma, Yunpeng; Xu, Jinxin

2018-03-01

Stereo matching is a vital requirement for many applications, such as three-dimensional (3-D) reconstruction, robot navigation, object detection, and industrial measurement. To improve the practicability of stereo matching, a method using census cost over cross window and segmentation-based disparity refinement is proposed. First, a cross window is obtained using distance difference and intensity similarity in binocular images. Census cost over the cross window and color cost are combined as the matching cost, which is aggregated by the guided filter. Then, winner-takes-all strategy is used to calculate the initial disparities. Second, a graph-based segmentation method is combined with color and edge information to achieve moderate under-segmentation. The segmented regions are classified into reliable regions and unreliable regions by consistency checking. Finally, the two regions are optimized by plane fitting and propagation, respectively, to match the ambiguous pixels. The experimental results are on Middlebury Stereo Datasets, which show that the proposed method has good performance in occluded and discontinuous regions, and it obtains smoother disparity maps with a lower average matching error rate compared with other algorithms.

Study of Nonlinear Dynamics of Intense Charged Particle Beams in the Paul Trap Simulator Experiment

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

Wang, Hua

The Paul Trap Simulator Experiment (PTSX) is a compact laboratory device that simulates the nonlinear dynamics of intense charged particle beams propagating over a large distance in an alternating-gradient magnetic transport system. The radial quadrupole electric eld forces on the charged particles in the Paul Trap are analogous to the radial forces on the charged particles in the quadrupole magnetic transport system. The amplitude of oscillating voltage applied to the cylindrical electrodes in PTSX is equivalent to the quadrupole magnetic eld gradient in accelerators. The temporal periodicity in PTSX corresponds to the spatial periodicity in magnetic transport system. This thesismore » focuses on investigations of envelope instabilities and collective mode excitations, properties of high-intensity beams with significant space-charge effects, random noise-induced beam degradation and a laser-induced-fluorescence diagnostic. To better understand the nonlinear dynamics of the charged particle beams, it is critical to understand the collective processes of the charged particles. Charged particle beams support a variety of collective modes, among which the quadrupole mode and the dipole mode are of the greatest interest. We used quadrupole and dipole perturbations to excite the quadrupole and dipole mode respectively and study the effects of those collective modes on the charge bunch. The experimental and particle-in-cell (PIC) simulation results both show that when the frequency and the spatial structure of the external perturbation are matched with the corresponding collective mode, that mode will be excited to a large amplitude and resonates strongly with the external perturbation, usually causing expansion of the charge bunch and loss of particles. Machine imperfections are inevitable for accelerator systems, and we use random noise to simulate the effects of machine imperfection on the charged particle beams. The random noise can be Fourier decomposed into various frequency components and experimental results show that when the random noise has a large frequency component that matches a certain collective mode, the mode will also be excited and cause heating of the charge bunch. It is also noted that by rearranging the order of the random noise, the adverse effects of the random noise may be eliminated. As a non-destructive diagnostic method, a laser-induced- fluorescence (LIF) diagnostic is developed to study the transverse dynamics of the charged particle beams. The accompanying barium ion source and dye laser system are developed and tested.« less

Mild traumatic brain injury: graph-model characterization of brain networks for episodic memory.

PubMed

Tsirka, Vasso; Simos, Panagiotis G; Vakis, Antonios; Kanatsouli, Kassiani; Vourkas, Michael; Erimaki, Sofia; Pachou, Ellie; Stam, Cornelis Jan; Micheloyannis, Sifis

2011-02-01

Episodic memory is among the cognitive functions that can be affected in the acute phase following mild traumatic brain injury (MTBI). The present study used EEG recordings to evaluate global synchronization and network organization of rhythmic activity during the encoding and recognition phases of an episodic memory task varying in stimulus type (kaleidoscope images, pictures, words, and pseudowords). Synchronization of oscillatory activity was assessed using a linear and nonlinear connectivity estimator and network analyses were performed using algorithms derived from graph theory. Twenty five MTBI patients (tested within days post-injury) and healthy volunteers were closely matched on demographic variables, verbal ability, psychological status variables, as well as on overall task performance. Patients demonstrated sub-optimal network organization, as reflected by changes in graph parameters in the theta and alpha bands during both encoding and recognition. There were no group differences in spectral energy during task performance or on network parameters during a control condition (rest). Evidence of less optimally organized functional networks during memory tasks was more prominent for pictorial than for verbal stimuli. Copyright © 2010 Elsevier B.V. All rights reserved.

IBS and expected luminosity performance for RHIC beams at top energy with 56 MHz SRF cavity

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

Fedotov,A.

The purpose of RF system in RHIC is to capture injected bunches, accelerate them to the top energy, and store bunches at the top energy for many hours. The accelerating RF system operates at harmonic number h=360 of the particle revolution frequency f=78.196 kHz, which corresponds to 28.15MHz. The storage RF system accepts the shortened bunches at top energy and provides longitudinal focusing to keep these bunches short during the store time (collision mode). The storage system operates at harmonic number h=7x360=2520, which corresponds to an RF frequency of 197.05 MHz [1]. Recently, an upgrade of storage RF system withmore » a superconducting 56 MHz cavity was proposed [2]. This upgrade will provide significant increase in the acceptance of storage RF bucket. Presently, the short bunch length for collisions is obtained via RF gymnastics with bunch rotation (called re-bucketing), because the length of 197MHz bucket of 5 nsec is too short to accommodate long bunches otherwise. However, due to bucket non-linearity and hardware complications some increase in the longitudinal emittance occurs during re-bucketing. The 56MHz cavity will produce sufficiently short bunches which would allow one to operate without re-bucketing procedure. This Note summarizes simulation of beam evolution due to Intra-beam scattering (IBS) for beam parameters expected with the 56 MHz SRF cavity upgrade. Expected luminosity improvement is shown both for Au ions at 100 GeV/nucleon and for protons at 250 GeV.« less

[A retrieval method of drug molecules based on graph collapsing].

PubMed

Qu, J W; Lv, X Q; Liu, Z M; Liao, Y; Sun, P H; Wang, B; Tang, Z

2018-04-18

To establish a compact and efficient hypergraph representation and a graph-similarity-based retrieval method of molecules to achieve effective and efficient medicine information retrieval. Chemical structural formula (CSF) was a primary search target as a unique and precise identifier for each compound at the molecular level in the research field of medicine information retrieval. To retrieve medicine information effectively and efficiently, a complete workflow of the graph-based CSF retrieval system was introduced. This system accepted the photos taken from smartphones and the sketches drawn on tablet personal computers as CSF inputs, and formalized the CSFs with the corresponding graphs. Then this paper proposed a compact and efficient hypergraph representation for molecules on the basis of analyzing factors that directly affected the efficiency of graph matching. According to the characteristics of CSFs, a hierarchical collapsing method combining graph isomorphism and frequent subgraph mining was adopted. There was yet a fundamental challenge, subgraph overlapping during the collapsing procedure, which hindered the method from establishing the correct compact hypergraph of an original CSF graph. Therefore, a graph-isomorphism-based algorithm was proposed to select dominant acyclic subgraphs on the basis of overlapping analysis. Finally, the spatial similarity among graphical CSFs was evaluated by multi-dimensional measures of similarity. To evaluate the performance of the proposed method, the proposed system was firstly compared with Wikipedia Chemical Structure Explorer (WCSE), the state-of-the-art system that allowed CSF similarity searching within Wikipedia molecules dataset, on retrieval accuracy. The system achieved higher values on mean average precision, discounted cumulative gain, rank-biased precision, and expected reciprocal rank than WCSE from the top-2 to the top-10 retrieved results. Specifically, the system achieved 10%, 1.41, 6.42%, and 1.32% higher than WCSE on these metrics for top-10 retrieval results, respectively. Moreover, several retrieval cases were presented to intuitively compare with WCSE. The results of the above comparative study demonstrated that the proposed method outperformed the existing method with regard to accuracy and effectiveness. This paper proposes a graph-similarity-based retrieval approach for medicine information. To obtain satisfactory retrieval results, an isomorphism-based algorithm is proposed for dominant subgraph selection based on the subgraph overlapping analysis, as well as an effective and efficient hypergraph representation of molecules. Experiment results demonstrate the effectiveness of the proposed approach.

Drive Beam Shaping and Witness Bunch Generation for the Plasma Wakefield Accelerator

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

England, R. J.; Frederico, J.; Hogan, M. J.

2010-11-04

High transformer ratio operation of the plasma wake field accelerator requires a tailored drive beam current profile followed by a short witness bunch. We discuss techniques for generating the requisite dual bunches and for obtaining the desired drive beam profile, with emphasis on the FACET experiment at SLAC National Accelerator Laboratory.

Single bunch transverse instability in a circular accelerator with chromaticity and space charge

DOE PAGES

Balbekov, V.

2015-10-21

The transverse instability of a bunch in a circular accelerator is elaborated in this paper. A new tree-modes model is proposed and developed to describe the most unstable modes of the bunch. This simple and flexible model includes chromaticity and space charge, and can be used with any bunch and wake forms. The dispersion equation for the bunch eigentunes is obtained in form of a third-order algebraic equation. The known head-tail and TMCI modes appear as the limiting cases which are distinctly bounded at zero chromaticity only. It is shown that the instability parameters depend only slightly on the bunchmore » model but they are rather sensitive to the wake shape. In particular, space charge effects are investigated in the paper and it is shown that their influence depends on sign of wake field enhancing the bunch stability if the wake is negative. In addition, the resistive wall wake is considered in detail including a comparison of single and collective effects. A comparison of the results with earlier publications is carried out.« less

Driver-witness electron beam acceleration in dielectric mm-scale capillaries

NASA Astrophysics Data System (ADS)

Lekomtsev, K.; Aryshev, A.; Tishchenko, A. A.; Shevelev, M.; Lyapin, A.; Boogert, S.; Karataev, P.; Terunuma, N.; Urakawa, J.

2018-05-01

We investigated a corrugated mm-scale capillary as a compact accelerating structure in the driver-witness acceleration scheme, and suggested a methodology to measure the acceleration of the witness bunch. The accelerating fields produced by the driver bunch and the energy spread of the witness bunch in a corrugated capillary and in a capillary with a constant inner radius were measured and simulated for both on-axis and off-axis beam propagation. Our simulations predicted a change in the accelerating field structure for the corrugated capillary. Also, an approximately twofold increase of the witness bunch energy gain on the first accelerating cycle was expected for both capillaries for the off-axis beam propagation. These results were confirmed in the experiment, and the maximum measured acceleration of 170 keV /m at 20 pC driver beam charge was achieved for off-axis beam propagation. The driver bunch showed an increase in energy spread of up to 11%, depending on the capillary geometry and beam propagation, with a suppression of the longitudinal energy spread in the witness bunch of up to 15%.

Concept of a tunable source of coherent THz radiation driven by a plasma modulated electron beam

NASA Astrophysics Data System (ADS)

Zhang, H.; Konoplev, I. V.; Doucas, G.; Smith, J.

2018-04-01

We have carried out numerical studies which consider the modulation of a picosecond long relativistic electron beam in a plasma channel and the generation of a micro-bunched train. The subsequent propagation of the micro-bunched beam in the vacuum area was also investigated. The same numerical model was then used to simulate the radiation arising from the interaction of the micro-bunched beam with a metallic grating. The dependence of the radiation spectrum on the parameters of the micro-bunched beam has been studied and the tunability of the radiation by the variation of the micro-bunch spacing has been demonstrated. The micro-bunch spacing can be changed easily by altering the plasma density without changing the beam energy or current. Using the results of these studies, we develop a conceptual design of a tunable source of coherent terahertz (THz) radiation driven by a plasma modulated beam. Such a source would be a potential and useful alternative to conventional vacuum THz tubes and THz free-electron laser sources.

Study of Uneven Fills to Cure the Coupled-Bunch Instability in SRRC

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

Chao, Alex W.

2002-08-12

The performance of the 1.5-GeV storage ring light source TLS in SRRC has been limited by a longitudinal coupled-bunch beam instability. To improve the performance of the TLS, the beam instability has to be suppressed. One possible way considered for the TLS to suppress its coupled-bunch instability uses uneven filling patterns according to the theory of Prabhakar[1]. By knowing the harmful high-order-modes (HOMs), a special filling pattern can be designed to utilize either mode coupling or Landau damping to cure beam instability. In TLS the HOMs are contributed from the Doris RF cavity installed in the storage ring. The HOMsmore » of a 3-D Doris cavity was numerically analyzed. Filling patterns with equal bunch current according to theory had been calculated to cure the most harmful HOM. A longitudinal particle tracking program was used to simulate the coupled-bunch beam instability with both the uniform filling and the special designed filling. Filling pattern with unequal bunch current was also studied. The results of the simulation were discussed and compared to the theory.« less

Independent component analysis applied to long bunch beams in the Los Alamos Proton Storage Ring

NASA Astrophysics Data System (ADS)

Kolski, Jeffrey S.; Macek, Robert J.; McCrady, Rodney C.; Pang, Xiaoying

2012-11-01

Independent component analysis (ICA) is a powerful blind source separation (BSS) method. Compared to the typical BSS method, principal component analysis, ICA is more robust to noise, coupling, and nonlinearity. The conventional ICA application to turn-by-turn position data from multiple beam position monitors (BPMs) yields information about cross-BPM correlations. With this scheme, multi-BPM ICA has been used to measure the transverse betatron phase and amplitude functions, dispersion function, linear coupling, sextupole strength, and nonlinear beam dynamics. We apply ICA in a new way to slices along the bunch revealing correlations of particle motion within the beam bunch. We digitize beam signals of the long bunch at the Los Alamos Proton Storage Ring with a single device (BPM or fast current monitor) for an entire injection-extraction cycle. ICA of the digitized beam signals results in source signals, which we identify to describe varying betatron motion along the bunch, locations of transverse resonances along the bunch, measurement noise, characteristic frequencies of the digitizing oscilloscopes, and longitudinal beam structure.

Models construction for acetone-butanol-ethanol fermentations with acetate/butyrate consecutively feeding by graph theory.

PubMed

Li, Zhigang; Shi, Zhongping; Li, Xin

2014-05-01

Several fermentations with consecutively feeding of acetate/butyrate were conducted in a 7 L fermentor and the results indicated that exogenous acetate/butyrate enhanced solvents productivities by 47.1% and 39.2% respectively, and changed butyrate/acetate ratios greatly. Then extracellular butyrate/acetate ratios were utilized for calculation of acids rates and the results revealed that acetate and butyrate formation pathways were almost blocked by corresponding acids feeding. In addition, models for acetate/butyrate feeding fermentations were constructed by graph theory based on calculation results and relevant reports. Solvents concentrations and butanol/acetone ratios of these fermentations were also calculated and the results of models calculation matched fermentation data accurately which demonstrated that models were constructed in a reasonable way. Copyright © 2014 Elsevier Ltd. All rights reserved.

Attributed community mining using joint general non-negative matrix factorization with graph Laplacian

NASA Astrophysics Data System (ADS)

Chen, Zigang; Li, Lixiang; Peng, Haipeng; Liu, Yuhong; Yang, Yixian

2018-04-01

Community mining for complex social networks with link and attribute information plays an important role according to different application needs. In this paper, based on our proposed general non-negative matrix factorization (GNMF) algorithm without dimension matching constraints in our previous work, we propose the joint GNMF with graph Laplacian (LJGNMF) to implement community mining of complex social networks with link and attribute information according to different application needs. Theoretical derivation result shows that the proposed LJGNMF is fully compatible with previous methods of integrating traditional NMF and symmetric NMF. In addition, experimental results show that the proposed LJGNMF can meet the needs of different community minings by adjusting its parameters, and the effect is better than traditional NMF in the community vertices attributes entropy.

Design of a high-bunch-charge 112-MHz superconducting RF photoemission electron source

DOE PAGES

Xin, T.; Brutus, J. C.; Belomestnykh, Sergey A.; ...

2016-09-01

High-bunch-charge photoemission electron-sources operating in a continuous wave (CW) mode are required for many advanced applications of particle accelerators, such as electron coolers for hadron beams, electron-ion colliders, and free-electron lasers (FELs). Superconducting RF (SRF) has several advantages over other electron-gun technologies in CW mode as it offers higher acceleration rate and potentially can generate higher bunch charges and average beam currents. A 112 MHz SRF electron photoinjector (gun) was developed at Brookhaven National Laboratory (BNL) to produce high-brightness and high-bunch-charge bunches for the Coherent electron Cooling Proof-of-Principle (CeC PoP) experiment. Lastly, the gun utilizes a quarter-wave resonator (QWR) geometrymore » for assuring beam dynamics, and uses high quantum efficiency (QE) multi-alkali photocathodes for generating electrons.« less

Potential applications of the dielectric wakefield accelerators in the SINBAD facility at DESY

NASA Astrophysics Data System (ADS)

Nie, Y. C.; Assmann, R.; Dorda, U.; Marchetti, B.; Weikum, M.; Zhu, J.; Hüning, M.

2016-09-01

Short, high-brightness relativistic electron bunches can drive ultra-high wakefields in the dielectric wakefield accelerators (DWFAs). This effect can be used to generate high power THz coherent Cherenkov radiation, accelerate a witness bunch with gradient two or three orders of magnitude larger than that in the conventional RF linear accelerators, introduce energy modulation within the driving bunch itself, etc. The paper studies potential applications of the DWFAs in the SINBAD facility at DESY. The simulations show that the ultra-short relativistic bunches from the SINBAD injector ARES can excite accelerating wakefields with peak amplitudes as high as GV/m at THz frequencies in proper DWFA structures. In addition, it illustrates that the DWFA structure can serve as a dechirper to compensate the correlated energy spread of the bunches accelerated by the laser plasma wakefield accelerator.

DIAGNOSTICS OF BNL ERL

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

POZDEYEV,E.; BEN-ZVI, I.; CAMERON, P.

2007-06-25

The ERL Prototype project is currently under development at the Brookhaven National Laboratory. The ERL is expected to demonstrate energy recovery of high-intensity beams with a current of up to a few hundred milliamps, while preserving the emittance of bunches with a charge of a few nanocoulombs produced by a high-current SRF gun. To successfully accomplish this task the machine will include beam diagnostics that will be used for accurate characterization of the three dimensional beam phase space at the injection and recirculation energies, transverse and longitudinal beam matching, orbit alignment, beam current measurement, and machine protection. This paper outlinesmore » requirements on the ERL diagnostics and describes its setup and modes of operation.« less

Interaction of an ion bunch with a plasma slab

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

Krasovitskiy, V. B., E-mail: krasovit@mail.ru; Turikov, V. A.

2016-11-15

Charge neutralization of a short ion bunch passing through a plasma slab is studied by means of numerical simulation. It is shown that a fraction of plasma electrons are trapped by the bunch under the action of the collective charge separation field. The accelerated electrons generated in this process excite beam−plasma instability, thereby violating the trapping conditions. The process of electron trapping is also strongly affected by the high-frequency electric field caused by plasma oscillations at the slab boundaries. It is examined how the degree of charge neutralization depends on the parameters of the bunch and plasma slab.

Resistive wall wakefields of short bunches at cryogenic temperatures

DOE PAGES

Stupakov, G.; Bane, K. L. F.; Emma, P.; ...

2015-03-19

In this study, we present calculations of the longitudinal wakefields at cryogenic temperatures for extremely short bunches, characteristic for modern x-ray free electron lasers. The calculations are based on the equations for the surface impedance in the regime of the anomalous skin effect in metals. This paper extends and complements an earlier analysis of B. Podobedov, Phys. Rev. ST Accel. Beams 12, 044401 (2009). into the region of very high frequencies associated with bunch lengths in the micron range. We study in detail the case of a rectangular bunch distribution for parameters of interest of LCLS-II with a superconducting undulator.

Compression of subrelativistic space-charge-dominated electron bunches for single-shot femtosecond electron diffraction.

PubMed

van Oudheusden, T; Pasmans, P L E M; van der Geer, S B; de Loos, M J; van der Wiel, M J; Luiten, O J

2010-12-31

We demonstrate the compression of 95 keV, space-charge-dominated electron bunches to sub-100 fs durations. These bunches have sufficient charge (200 fC) and are of sufficient quality to capture a diffraction pattern with a single shot, which we demonstrate by a diffraction experiment on a polycrystalline gold foil. Compression is realized by means of velocity bunching by inverting the positive space-charge-induced velocity chirp. This inversion is induced by the oscillatory longitudinal electric field of a 3 GHz radio-frequency cavity. The arrival time jitter is measured to be 80 fs.

Longitudinal bunch dynamics study with coherent synchrotron radiation

NASA Astrophysics Data System (ADS)

Billinghurst, B. E.; Bergstrom, J. C.; Baribeau, C.; Batten, T.; May, T. E.; Vogt, J. M.; Wurtz, W. A.

2016-02-01

An electron bunch circulating in a storage ring constitutes a dynamical system with both longitudinal and transverse degrees of freedom. Through a self-interaction with the wakefields created by the bunch, certain of these degrees may get excited, defining a set of eigenmodes analogous to a spectroscopic series. The present study focuses on the longitudinal modes of a single bunch. The excitation of a mode appears as an amplitude modulation at the mode frequency of the coherent synchrotron radiation (CSR) emitted by the bunch. The modulations are superimposed on a much larger continuum from CSR emission in the continuous mode. A given eigenmode is classified by the integer m which is the ratio of the mode frequency to the synchrotron frequency. The present measurements extend up to m =8 and focus on the region near the instability thresholds. At threshold the modes are excited sequentially, resembling a staircase when the mode frequencies are plotted as a function of bunch length or synchrotron frequency. Adjacent modes are observed to coexist at the boundaries between the modes. An energy-independent correlation is observed between the threshold current for an instability and the corresponding zero-current bunch length. Measurements were made at five beam energies between 1.0 and 2.9 GeV at the Canadian Light Source. The CSR was measured in the time domain using an unbiased Schottky diode spanning 50-75 GHz.

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

Effectiveness of Vertex Nomination via Seeded Graph Matching to Find Bijections Between Similar Networks

DTIC Science & Technology

2018-02-01

similar methodology as the author’s example was conducted to prepare this dataset for processing via the SGM algorithm. Since and ′ are...TECHNICAL MEMORANDUM APPROVED FOR PUBLIC RELEASE; DISTRIBUTION UNLIMITED STINFO COPY AIR FORCE RESEARCH LABORATORY...PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) Air Force Research Laboratory/RIEA 525 Brooks Road Rome NY 13441-4505 8. PERFORMING ORGANIZATION REPORT NUMBER

Combating WMD Journal. Issue 6, Fall/Winter 2010

DTIC Science & Technology

2010-12-31

Editorial Board prior to publication. Submit articles in Microsoft Word without automatic features, include photographs , graphs, tables, etc. as...presenters as many in attendance were unlikely to be swayed and in some cases the meet- ings turned into adversarial shouting matches. 19 These...Solar Superstorm, http://science.nasa.gov/ science-news/science-at- nasa /2003/23oct_superstorm/ 8. Pfeffer, Robert, The Need to Re- define

On the degree conjecture for separability of multipartite quantum states

NASA Astrophysics Data System (ADS)

Hassan, Ali Saif M.; Joag, Pramod S.

2008-01-01

We settle the so-called degree conjecture for the separability of multipartite quantum states, which are normalized graph Laplacians, first given by Braunstein et al. [Phys. Rev. A 73, 012320 (2006)]. The conjecture states that a multipartite quantum state is separable if and only if the degree matrix of the graph associated with the state is equal to the degree matrix of the partial transpose of this graph. We call this statement to be the strong form of the conjecture. In its weak version, the conjecture requires only the necessity, that is, if the state is separable, the corresponding degree matrices match. We prove the strong form of the conjecture for pure multipartite quantum states using the modified tensor product of graphs defined by Hassan and Joag [J. Phys. A 40, 10251 (2007)], as both necessary and sufficient condition for separability. Based on this proof, we give a polynomial-time algorithm for completely factorizing any pure multipartite quantum state. By polynomial-time algorithm, we mean that the execution time of this algorithm increases as a polynomial in m, where m is the number of parts of the quantum system. We give a counterexample to show that the conjecture fails, in general, even in its weak form, for multipartite mixed states. Finally, we prove this conjecture, in its weak form, for a class of multipartite mixed states, giving only a necessary condition for separability.

On Quantifying Diffusion of Health Information on Twitter.

PubMed

Bakal, Gokhan; Kavuluru, Ramakanth

2017-02-01

With the increasing use of digital technologies, online social networks are emerging as major means of communication. Recently, social networks such as Facebook and Twitter are also being used by consumers, care providers (physicians, hospitals), and government agencies to share health related information. The asymmetric user network and the short message size have made Twitter particularly popular for propagating health related content on the Web. Besides tweeting on their own, users can choose to retweet particular tweets from other users (even if they do not follow them on Twitter.) Thus, a tweet can diffuse through the Twitter network via the follower-friend connections. In this paper, we report results of a pilot study we conducted to quantitatively assess how health related tweets diffuse in the directed follower-friend Twitter graph through the retweeting activity. Our effort includes (1). development of a retweet collection and Twitter retweet graph formation framework and (2). a preliminary analysis of retweet graphs and associated diffusion metrics for health tweets. Given the ambiguous nature (due to polysemy and sarcasm) of health relatedness of tweets collected with keyword based matches, our initial study is limited to ≈ 200 health related tweets (which were manually verified to be on health topics) each with at least 25 retweets. To our knowledge, this is first attempt to study health information diffusion on Twitter through retweet graph analysis.

GAT: a graph-theoretical analysis toolbox for analyzing between-group differences in large-scale structural and functional brain networks.

PubMed

Hosseini, S M Hadi; Hoeft, Fumiko; Kesler, Shelli R

2012-01-01

In recent years, graph theoretical analyses of neuroimaging data have increased our understanding of the organization of large-scale structural and functional brain networks. However, tools for pipeline application of graph theory for analyzing topology of brain networks is still lacking. In this report, we describe the development of a graph-analysis toolbox (GAT) that facilitates analysis and comparison of structural and functional network brain networks. GAT provides a graphical user interface (GUI) that facilitates construction and analysis of brain networks, comparison of regional and global topological properties between networks, analysis of network hub and modules, and analysis of resilience of the networks to random failure and targeted attacks. Area under a curve (AUC) and functional data analyses (FDA), in conjunction with permutation testing, is employed for testing the differences in network topologies; analyses that are less sensitive to the thresholding process. We demonstrated the capabilities of GAT by investigating the differences in the organization of regional gray-matter correlation networks in survivors of acute lymphoblastic leukemia (ALL) and healthy matched Controls (CON). The results revealed an alteration in small-world characteristics of the brain networks in the ALL survivors; an observation that confirm our hypothesis suggesting widespread neurobiological injury in ALL survivors. Along with demonstration of the capabilities of the GAT, this is the first report of altered large-scale structural brain networks in ALL survivors.

Multi-gigaelectronvolt acceleration of positrons in a self-loaded plasma wakefield.

PubMed

Corde, S; Adli, E; Allen, J M; An, W; Clarke, C I; Clayton, C E; Delahaye, J P; Frederico, J; Gessner, S; Green, S Z; Hogan, M J; Joshi, C; Lipkowitz, N; Litos, M; Lu, W; Marsh, K A; Mori, W B; Schmeltz, M; Vafaei-Najafabadi, N; Walz, D; Yakimenko, V; Yocky, G

2015-08-27

Electrical breakdown sets a limit on the kinetic energy that particles in a conventional radio-frequency accelerator can reach. New accelerator concepts must be developed to achieve higher energies and to make future particle colliders more compact and affordable. The plasma wakefield accelerator (PWFA) embodies one such concept, in which the electric field of a plasma wake excited by a bunch of charged particles (such as electrons) is used to accelerate a trailing bunch of particles. To apply plasma acceleration to electron-positron colliders, it is imperative that both the electrons and their antimatter counterpart, the positrons, are efficiently accelerated at high fields using plasmas. Although substantial progress has recently been reported on high-field, high-efficiency acceleration of electrons in a PWFA powered by an electron bunch, such an electron-driven wake is unsuitable for the acceleration and focusing of a positron bunch. Here we demonstrate a new regime of PWFAs where particles in the front of a single positron bunch transfer their energy to a substantial number of those in the rear of the same bunch by exciting a wakefield in the plasma. In the process, the accelerating field is altered--'self-loaded'--so that about a billion positrons gain five gigaelectronvolts of energy with a narrow energy spread over a distance of just 1.3 metres. They extract about 30 per cent of the wake's energy and form a spectrally distinct bunch with a root-mean-square energy spread as low as 1.8 per cent. This ability to transfer energy efficiently from the front to the rear within a single positron bunch makes the PWFA scheme very attractive as an energy booster to an electron-positron collider.

Evolution of dense spatially modulated electron bunches

NASA Astrophysics Data System (ADS)

Balal, N.; Bratman, V. L.; Friedman, A.

2018-03-01

An analytical theory describing the dynamics of relativistic moving 1D electron pulses (layers) with the density modulation affected by a space charge has been revised and generalized for its application to the formation of dense picosecond bunches from linear accelerators with laser-driven photo injectors, and its good agreement with General Particle Tracer simulations has been demonstrated. Evolution of quasi-one-dimensional bunches (disks), for which the derived formulas predict longitudinal expansion, is compared with that for thin and long electron cylinders (threads), for which the excitation of non-linear waves with density spikes was found earlier by Musumeci et al. [Phys. Rev. Lett. 106(18), 184801 (2011)] and Musumeci et al. [Phys. Rev. Spec. Top. -Accel. Beams 16(10), 100701 (2013)]. Both types of bunches can be used for efficiency enhancement of THz sources based on the Doppler frequency up-shifted coherent spontaneous radiation of electrons. Despite the strong Coulomb repulsion, the periodicity of a preliminary modulation in dense 1D layers persists during their expansion in the most interesting case of a relatively small change in particle energy. However, the period of modulation increases and its amplitude decreases in time. In the case of a large change in electron energy, the uniformity of periodicity is broken due to different relativistic changes in longitudinal scales along the bunch: the "period" of modulation decreases and its amplitude increases from the rear to the front boundary. Nevertheless, the use of relatively long electron bunches with a proper preliminary spatial modulation of density can provide a significantly higher power and a narrower spectrum of coherent spontaneous radiation of dense bunches than in the case of initially short single bunches with the same charge.

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

Edstrom Jr., D.; et al.

The low-energy section of the photoinjector-based electron linear accelerator at the Fermilab Accelerator Science & Technology (FAST) facility was recently commissioned to an energy of 50 MeV. This linear accelerator relies primarily upon pulsed SRF acceleration and an optional bunch compressor to produce a stable beam within a large operational regime in terms of bunch charge, total average charge, bunch length, and beam energy. Various instrumentation was used to characterize fundamental properties of the electron beam including the intensity, stability, emittance, and bunch length. While much of this instrumentation was commissioned in a 20 MeV running period prior, some (includingmore » a new Martin- Puplett interferometer) was in development or pending installation at that time. All instrumentation has since been recommissioned over the wide operational range of beam energies up to 50 MeV, intensities up to 4 nC/pulse, and bunch structures from ~1 ps to more than 50 ps in length.« less

Electron bunch structure in energy recovery linac with high-voltage dc photoelectron gun

NASA Astrophysics Data System (ADS)

Saveliev, Y. M.; Jackson, F.; Jones, J. K.; McKenzie, J. W.

2016-09-01

The internal structure of electron bunches generated in an injector line with a dc photoelectron gun is investigated. Experiments were conducted on the ALICE (accelerators and lasers in combined experiments) energy recovery linac at Daresbury Laboratory. At a relatively low dc gun voltage of 230 kV, the bunch normally consisted of two beamlets with different electron energies, as well as transverse and longitudinal characteristics. The beamlets are formed at the head and the tail of the bunch. At a higher gun voltage of 325 kV, the beam substructure is much less pronounced and could be observed only at nonoptimal injector settings. Experiments and computer simulations demonstrated that the bunch structure develops during the initial beam acceleration in the superconducting rf booster cavity and can be alleviated either by increasing the gun voltage to the highest possible level or by controlling the beam acceleration from the gun voltage in the first accelerating structure.

Beam dynamics in THz dielectric-loaded waveguides for the AXSIS project

NASA Astrophysics Data System (ADS)

Vinatier, T.; Assmann, R. W.; Dorda, U.; Lemery, F.; Marchetti, B.

2017-07-01

In this paper, we investigate with ASTRA simulations the beam dynamics in dielectric-loaded waveguides driven by THz pulses, used as linac structure for the AXSIS project. We show that the bunch properties at the linac exit are very sensitive to the phase velocity of the THz pulse and are limited by the strong phase slippage of the bunch respective to it. We also show that the bunch properties are optimized when low frequencies (< 300 GHz) are used inside the linac, and that the longitudinal focal point can be put several tens of cm away from the linac exit thanks to ballistic bunching. However, a strong asymmetry in the bunch transverse sizes remains for which a solution is still to be found. Work supported by the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013)/ERC Grant Agreement n. 609920.

Collective electron driven linac for high energy physics

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

Seeman, J.T.

1983-08-01

A linac design is presented in which an intense ultrarelativistic electron bunch is used to excite fields in a series of cavities and accelerate charged particles. The intense electron bunch is generated in a simple storage ring to have the required transverse and longitudinal dimensions. The bunch is then transferred to the linac. The linac structure can be inexpensively constructed of spacers and washers. The fields in the cells resulting from the bunch passage are calculated using the program BCI. The results show that certain particles within the driving bunch and also trailing particles of any sign charge can bemore » accelerated. With existing electron storage rings, accelerating gradients greater than 16 MV/m are possible. Examples of two accelerators are given: a 30 GeV electron/positron accelerator useful as an injector for a high energy storage ring and 2) a 110 GeV per beam electron-positron collider.« less

Modeling Multi-Bunch X-band Photoinjector Challenges

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

Marsh, R A; Anderson, S G; Gibson, D J

An X-band test station is being developed at LLNL to investigate accelerator optimization for future upgrades to mono-energetic gamma-ray technology at LLNL. The test station will consist of a 5.5 cell X-band rf photoinjector, single accelerator section, and beam diagnostics. Of critical import to the functioning of the LLNL X-band system with multiple electron bunches is the performance of the photoinjector. In depth modeling of the Mark 1 LLNL/SLAC X-band rf photoinjector performance will be presented addressing important challenges that must be addressed in order to fabricate a multi-bunch Mark 2 photoinjector. Emittance performance is evaluated under different nominal electronmore » bunch parameters using electrostatic codes such as PARMELA. Wake potential is analyzed using electromagnetic time domain simulations using the ACE3P code T3P. Plans for multi-bunch experiments and implementation of photoinjector advances for the Mark 2 design will also be discussed.« less

Following an electron bunch for free electron laser

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

None

2012-01-01

A video artist's ultra-slow-motion impression of an APEX-style electron gun firing a continuous train of electron bunches into a superconducting linear accelerator (in reality this would happen a million times a second). As they approach the speed of light the bunches contract, maintaining beam quality. After acceleration, the electron bunches are diverted into one or more undulators, the key components of free electron lasers. Oscillating back and forth in the changing magnetic field, they create beams of structured x-ray pulses. Before entering the experimental areas the electron bunches are diverted to a beam dump. (Animation created by Illumina Visual, http://www.illuminavisual.com/,more » for Lawrence Berkeley National Laboratory. Music for this excerpt, "Feeling Dark (Behind The Mask)" is by 7OOP3D http://ccmixter.org/files/7OOP3D/29126 and is licensed under a Creative Commons license: http://creativecommons.org/licenses/by-nc/3.0/)« less

Development of bunch shape monitor for high-intensity beam on the China ADS proton LINAC Injector II

NASA Astrophysics Data System (ADS)

Zhu, Guangyu; Wu, Junxia; Du, Ze; Zhang, Yong; Xue, Zongheng; Xie, Hongming; Wei, Yuan; Jing, Long; Jia, Huan

2018-05-01

The development, performance, and testing of the longitudinal bunch shape monitor, namely, the Fast Faraday Cup (FFC), are presented in this paper. The FFC is an invasive instrument controlled by a stepper motor, and its principle of operation is based on a strip line structure. The longitudinal bunch shape was determined by sampling a small part of the beam hitting the strip line through a 1-mm hole. The rise time of the detector reached 24 ps. To accommodate experiments that utilize high-intensity beams, the materials of the bunch shape monitor were chosen to sustain high temperatures. Water cooling was also integrated in the detector system to enhance heat transfer and prevent thermal damage. We also present an analysis of the heating caused by the beam. The bunch shape monitor has been installed and commissioned at the China ADS proton LINAC Injector II.

Compact double-bunch x-ray free electron lasers for fresh bunch self-seeding and harmonic lasing

DOE PAGES

Emma, C.; Feng, Y.; Nguyen, D. C.; ...

2017-03-03

This study presents a novel method to improve the longitudinal coherence, efficiency and maximum photon energy of x-ray free electron lasers (XFELs). The method is equivalent to having two separate concatenated XFELs. The first uses one bunch of electrons to reach the saturation regime, generating a high power self-amplified spontaneous emission x-ray pulse at the fundamental and third harmonic. The x-ray pulse is filtered through an attenuator/monochromator and seeds a different electron bunch in the second FEL, using the fundamental and/or third harmonic as an input signal. In our method we combine the two XFELs operating with two bunches, separatedmore » by one or more rf cycles, in the same linear accelerator. We discuss the advantages and applications of the proposed system for present and future XFELs.« less

Adaptive Discrete Hypergraph Matching.

PubMed

Yan, Junchi; Li, Changsheng; Li, Yin; Cao, Guitao

2018-02-01

This paper addresses the problem of hypergraph matching using higher-order affinity information. We propose a solver that iteratively updates the solution in the discrete domain by linear assignment approximation. The proposed method is guaranteed to converge to a stationary discrete solution and avoids the annealing procedure and ad-hoc post binarization step that are required in several previous methods. Specifically, we start with a simple iterative discrete gradient assignment solver. This solver can be trapped in an -circle sequence under moderate conditions, where is the order of the graph matching problem. We then devise an adaptive relaxation mechanism to jump out this degenerating case and show that the resulting new path will converge to a fixed solution in the discrete domain. The proposed method is tested on both synthetic and real-world benchmarks. The experimental results corroborate the efficacy of our method.

Fast Object Motion Estimation Based on Dynamic Stixels.

PubMed

Morales, Néstor; Morell, Antonio; Toledo, Jonay; Acosta, Leopoldo

2016-07-28

The stixel world is a simplification of the world in which obstacles are represented as vertical instances, called stixels, standing on a surface assumed to be planar. In this paper, previous approaches for stixel tracking are extended using a two-level scheme. In the first level, stixels are tracked by matching them between frames using a bipartite graph in which edges represent a matching cost function. Then, stixels are clustered into sets representing objects in the environment. These objects are matched based on the number of stixels paired inside them. Furthermore, a faster, but less accurate approach is proposed in which only the second level is used. Several configurations of our method are compared to an existing state-of-the-art approach to show how our methodology outperforms it in several areas, including an improvement in the quality of the depth reconstruction.

Factoring symmetric indefinite matrices on high-performance architectures

NASA Technical Reports Server (NTRS)

Jones, Mark T.; Patrick, Merrell L.

1990-01-01

The Bunch-Kaufman algorithm is the method of choice for factoring symmetric indefinite matrices in many applications. However, the Bunch-Kaufman algorithm does not take advantage of high-performance architectures such as the Cray Y-MP. Three new algorithms, based on Bunch-Kaufman factorization, that take advantage of such architectures are described. Results from an implementation of the third algorithm are presented.

Efficiency of feedbacks for suppression of transverse instabilities of bunched beams

DOE PAGES

Burov, Alexey

2016-08-05

Which gain and phase have to be set for a bunch-by-bunch transverse damper, and at which chromaticity it is better to stay? Furthermore, these questions are considered for three models: the two-particle model with possible quadrupole wake, the author's Nested Head-Tail Vlasov solver with a broadband impedance, and the same with the LHC impedance model.

A Proposal to Build Evaluation Capacity at the Bunche-Da Vinci Learning Partnership Academy

ERIC Educational Resources Information Center

King, Jean A.

2005-01-01

The author describes potential evaluation capacity-building activities in contrast to the specifics of an evaluation design. Her response to the case of the Bunche-Da Vinci Learning Partnership Academy is developed in three parts: (1) an initial framing of the Bunche-Da Vinci situation; (2) what should be done before signing a contract; and (3)…

A Value-Engaged Approach for Evaluating the Bunche-Da Vinci Learning Academy

ERIC Educational Resources Information Center

Greene, Jennifer C.

2005-01-01

In 2001, the Bunche Academy was chosen by its district to join in partnership with the Da Vinci Learning Corporation to embark on an ambitious whole-school reform initiative, especially designed by the corporation for low-performing schools. In this chapter, the author describes how, as illustrated in the Bunche-Da Vinci Learning Academy context,…

7 CFR 51.884 - U.S. No. 1 Table.

Code of Federal Regulations, 2013 CFR

2013-01-01

... Grades § 51.884 U.S. No. 1 Table. “U.S. No. 1 Table” consists of bunches of well developed grapes of one...) Mold; (2) Decay. (f) Berries not damaged by: (1) Any other cause. (g) Bunches not damaged by: (1) Shot...: Exclusive of shot berries and dried berries, 75 percent, by count, of the berries on each bunch shall have...

7 CFR 51.884 - U.S. No. 1 Table.

Code of Federal Regulations, 2014 CFR

2014-01-01

... Grades § 51.884 U.S. No. 1 Table. “U.S. No. 1 Table” consists of bunches of well developed grapes of one...) Mold; (2) Decay. (f) Berries not damaged by: (1) Any other cause. (g) Bunches not damaged by: (1) Shot...: Exclusive of shot berries and dried berries, 75 percent, by count, of the berries on each bunch shall have...

A preliminary design of the collinear dielectric wakefield accelerator

NASA Astrophysics Data System (ADS)

Zholents, A.; Gai, W.; Doran, S.; Lindberg, R.; Power, J. G.; Strelnikov, N.; Sun, Y.; Trakhtenberg, E.; Vasserman, I.; Jing, C.; Kanareykin, A.; Li, Y.; Gao, Q.; Shchegolkov, D. Y.; Simakov, E. I.

2016-09-01

A preliminary design of the multi-meter long collinear dielectric wakefield accelerator that achieves a highly efficient transfer of the drive bunch energy to the wakefields and to the witness bunch is considered. It is made from 0.5 m long accelerator modules containing a vacuum chamber with dielectric-lined walls, a quadrupole wiggler, an rf coupler, and BPM assembly. The single bunch breakup instability is a major limiting factor for accelerator efficiency, and the BNS damping is applied to obtain the stable multi-meter long propagation of a drive bunch. Numerical simulations using a 6D particle tracking computer code are performed and tolerances to various errors are defined.

Observation of coherently enhanced tunable narrow-band terahertz transition radiation from a relativistic sub-picosecond electron bunch train

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

Piot, P.; Maxwell, T. J.; Accelerator Physics Center, Fermi National Accelerator Laboratory, Batavia, Illinois 60510

2011-06-27

We experimentally demonstrate the production of narrow-band ({delta}f/f{approx_equal}20% at f{approx_equal}0.5THz) transition radiation with tunable frequency over [0.37, 0.86] THz. The radiation is produced as a train of sub-picosecond relativistic electron bunches transits at the vacuum-aluminum interface of an aluminum converter screen. The bunch train is generated via a transverse-to-longitudinal phase space exchange technique. We also show a possible application of modulated beams to extend the dynamical range of a popular bunch length diagnostic technique based on the spectral analysis of coherent radiation.

Observation of superradiant synchrotron radiation in the terahertz region

NASA Astrophysics Data System (ADS)

Billinghurst, B. E.; Bergstrom, J. C.; Dallin, L.; de Jong, M.; May, T. E.; Vogt, J. M.; Wurtz, W. A.

2013-06-01

We report the first high-resolution measurement of superradiance, using coherent synchrotron radiation in the terahertz region from the Canadian Light Source synchrotron and a Michelson interferometer with a nominal frequency resolution of 0.00096cm-1. Superradiance arises when a high degree of phase coherence exists between the radiation fields of the individual electron bunches, and manifests itself as a series of narrow spectral peaks at harmonics of the bunch frequency. We observe an enhancement factor of 16 at the spectral peaks, limited by the interferometer resolution. The spectral distribution and relative amplitudes of the superradiant peaks are modified by altering the pattern of bunches along the bunch train.

Efficient Computation of Coherent Synchrotron Radiation Taking into Account 6D Phase Space Distribution of Emitting Electrons

NASA Astrophysics Data System (ADS)

Chubar, O.; Couprie, M.-E.

2007-01-01

CPU-efficient method for calculation of the frequency domain electric field of Coherent Synchrotron Radiation (CSR) taking into account 6D phase space distribution of electrons in a bunch is proposed. As an application example, calculation results of the CSR emitted by an electron bunch with small longitudinal and large transverse sizes are presented. Such situation can be realized in storage rings or ERLs by transverse deflection of the electron bunches in special crab-type RF cavities, i.e. using the technique proposed for the generation of femtosecond X-ray pulses (A. Zholents et. al., 1999). The computation, performed for the parameters of the SOLEIL storage ring, shows that if the transverse size of electron bunch is larger than the diffraction limit for single-electron SR at a given wavelength — this affects the angular distribution of the CSR at this wavelength and reduces the coherent flux. Nevertheless, for transverse bunch dimensions up to several millimeters and a longitudinal bunch size smaller than hundred micrometers, the resulting CSR flux in the far infrared spectral range is still many orders of magnitude higher than the flux of incoherent SR, and therefore can be considered for practical use.

Steps in Solution Growth: Revised Gibbs-Thomson Law, Turbulence and Morphological Stability

NASA Technical Reports Server (NTRS)

Chernov, A. A.; Rashkovich, L. N.; Vekilov, P. G.

2004-01-01

Two groups of new phenomena revealed by AFM and high resolution optical interferometry on crystal faces growing from solutions will be discussed. 1. Spacing between strongly polygonized spiral steps with low less than 10(exp -2) kink density on lysozyme and K- biphtalate do not follow the Burton-cabrera-Frank theory. The critical length of the yet immobile first Short step segment adjacent to a pinning defect (dislocation, stacking fault) is many times longer than that following from the step free energy. The low-kink density steps are typical of many growth conditions and materials, including low temperature gas phase epitaxy and MBE. 2. The step bunching pattern on the approx. 1 cm long { 110) KDP face growing from the turbulent solution flow (Re (triple bonds) 10(exp 4), solution flow rate approx. 1 m/s) suggests that the step bunch height does not increase infinitely as the bunch path on the crystal face rises, as is usually observed on large KDP crystals. The mechanism controlling the maximal bunch width and height is based on the drag of the solution depleted by the step bunch down thc solution stream. It includes splitting, coagulation and interlacing of bunches

Simulation of Mirror Distortion in Free-Electron LASER Oscillators

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

H. Freund; S. V. Benson; Michelle D. Shinn

2006-09-01

The JLab FEL is routinely operated with sub-picosecond bunches. The short bunch length is important for high gain of the FEL. Coherent transition radiation has been used for the bunch length measurements for many years. This diagnostic can be used only in the pulsed beam mode. It is our goal to run FEL with CW beam and 74.85 MHz micropulse repetition rate. Hence it is very desirable to have the possibility of doing the bunch length measurements when running CW beam with any micropulse frequency. We use a Fourier transform infrared interferometer, which is essentially a Michelson interferometer, to measuremore » the spectrum of the coherent synchrotron radiation generated in the last dipole of the magnetic bunch compressor upstream of the FEL wiggler. This noninvasive diagnostic provides the bunch length measurements for CW beam operation at any micropulse frequency. We also compare the measurements made with the help of the FTIR interferometer with the data obtained by the Martin-Puplett interferometer. Results of the two diagnostics are usually agree within 15%. Here we present a description of the experimental setup, data evaluation procedure and results of the beam measurements.« less

Step Bunching: Influence of Impurities and Solution Flow

NASA Technical Reports Server (NTRS)

Chernov, A. A.; Vekilov, P. G.; Coriell, S. R.; Murray, B. T.; McFadden, G. B.

1999-01-01

Step bunching results in striations even at relatively early stages of its development and in inclusions of mother liquor at the later stages. Therefore, eliminating step bunching is crucial for high crystal perfection. At least 5 major effects causing and influencing step bunching are known: (1) Basic morphological instability of stepped interfaces. It is caused by concentration gradient in the solution normal to the face and by the redistribution of solute tangentially to the interface which redistribution enhances occasional perturbations in step density due to various types of noise; (2) Aggravation of the above basic instability by solution flowing tangentially to the face in the same directions as the steps or stabilization of equidistant step train if these flows are antiparallel; (3) Enhanced bunching at supersaturation where step velocity v increases with relative supersaturation s much faster than linear. This v(s) dependence is believed to be associated with impurities. The impurities of which adsorption time is comparable with the time needed to deposit one lattice layer may also be responsible for bunching; (4) Very intensive solution flow stabilizes growing interface even at parallel solution and step flows; (5) Macrosteps were observed to nucleate at crystal corners and edges. Numerical simulation, assuming step-step interactions via surface diffusion also show that step bunching may be induced by random step nucleation at the facet edge and by discontinuity in the step density (a ridge) somewhere in the middle of a face. The corresponding bunching patterns produce the ones observed in experiment. The nature of step bunching generated at the corners and edges and by dislocation step sources, as well as the also relative importance and interrelations between mechanisms 1-5 is not clear, both from experimental and theoretical standpoints. Furthermore, several laws controlling the evolution of existing step bunches have been suggested, though unambiguous conclusions are still missing. Addressing these issues is the major goal of the present project. The theory addressing the above problem, experimental methods, several figures which include: (1) the spatial wave numbers at which the system is neutrally stable as a function of growth velocity for linear kinetics and supersaturation for nonlinear kinetics; (2) a schematic of the experiment of lysozyme crystal growing under conditions of natural convection; (3) fluctuations in time, t, of the normal growth rate, R(t), vicinal slope, p(t) and Fourier Spectra of R(t), discussions and conclusions are presented.

Laser-driven dielectric electron accelerator for radiobiology researches

NASA Astrophysics Data System (ADS)

Koyama, Kazuyoshi; Matsumura, Yosuke; Uesaka, Mitsuru; Yoshida, Mitsuhiro; Natsui, Takuya; Aimierding, Aimidula

2013-05-01

In order to estimate the health risk associated with a low dose radiation, the fundamental process of the radiation effects in a living cell must be understood. It is desired that an electron bunch or photon pulse precisely knock a cell nucleus and DNA. The required electron energy and electronic charge of the bunch are several tens keV to 1 MeV and 0.1 fC to 1 fC, respectively. The smaller beam size than micron is better for the precise observation. Since the laser-driven dielectric electron accelerator seems to suite for the compact micro-beam source, a phase-modulation-masked-type laser-driven dielectric accelerator was studied. Although the preliminary analysis made a conclusion that a grating period and an electron speed must satisfy the matching condition of LG/λ = v/c, a deformation of a wavefront in a pillar of the grating relaxed the matching condition and enabled the slow electron to be accelerated. The simulation results by using the free FDTD code, Meep, showed that the low energy electron of 20 keV felt the acceleration field strength of 20 MV/m and gradually felt higher field as the speed was increased. Finally the ultra relativistic electron felt the field strength of 600 MV/m. The Meep code also showed that a length of the accelerator to get energy of 1 MeV was 3.8 mm, the required laser power and energy were 11 GW and 350 mJ, respectively. Restrictions on the laser was eased by adopting sequential laser pulses. If the accelerator is illuminated by sequential N pulses, the pulse power, pulse width and the pulse energy are reduced to 1/N, 1/N and 1/N2, respectively. The required laser power per pulse is estimated to be 2.2 GW when ten pairs of sequential laser pulse is irradiated.

Studies on the S-band bunching system with the Hybrid Bunching-accelerating Structure

NASA Astrophysics Data System (ADS)

Pei, Shi-Lun; Gao, Bin

2018-04-01

Generally, a standard bunching system is composed of a standing-wave (SW) pre-buncher (PB), a traveling-wave (TW) buncher (B) and a standard accelerating structure. In the industrial area, the bunching system is usually simplified by eliminating the PB and integrating the B and the standard accelerating structure together to form a β-varied accelerating structure. The beam capturing efficiency for this kind of simplified system is often worse than that for the standard one. The hybrid buncher (HB) has been proved to be a successful attempt to reduce the cost but preserve the beam quality as much as possible. Here we propose to exclusively simplify the standard bunching system by integrating the PB, the B and the standard accelerating structure together to form a Hybrid Bunching-accelerating Structure (HBaS). Compared to the standard bunching system, the one based on the HBaS is more compact, and the cost is lowered to the largest extent. With almost the same beam transportation efficiency (∼70%) from the electron gun to the linac exit, the peak-to-peak (p-to-p) beam energy spread and the 1 σ emittance of the linac with the HBaS are ∼20% and ∼60% bigger than those of the linac based on the split PB/B/standard accelerating structure system. Nonetheless, the proposed HBaS can be widely applied in the industrial linacs to greatly increase the beam capturing efficiency without fairly increasing the construction cost.

Development of a bunch-by-bunch longitudinal feedback system with a wide dynamic range for the HIGS facility

NASA Astrophysics Data System (ADS)

Wu, W. Z.; Kim, Y.; Li, J. Y.; Teytelman, D.; Busch, M.; Wang, P.; Swift, G.; Park, I. S.; Ko, I. S.; Wu, Y. K.

2011-03-01

Electron beam coupled-bunch instabilities can limit and degrade the performance of storage ring based light sources. A longitudinal feedback system has been developed for the Duke storage ring to suppress multi-bunch beam instabilities which prevent stable, high-current operation of the storage ring based free-electron lasers (FELs) and an FEL driven Compton gamma source, the high intensity gamma-ray source (HIGS) at Duke University. In this work, we report the development of a state-of-the-art second generation longitudinal feedback system which employs a field programmable gate array (FPGA) based processor, and a broadband, high shunt-impedance kicker cavity. With two inputs and two outputs, the kicker cavity was designed with a resonant frequency of 937 MHz, a bandwidth of 97 MHz, and a shunt impedance of 1530 Ω. We also developed an S-matrix based technique to fully characterize the performance of the kicker cavity in the cold test. This longitudinal feedback system has been commissioned and optimized to stabilize high-current electron beams with a wide range of electron beam energies (250 MeV to 1.15 GeV) and a number of electron beam bunch modes, including the single-bunch mode and all possible symmetric bunch modes. This feedback system has become a critical instrument to ensure stable, high-flux operation of HIGS to produce nearly monochromatic, highly polarized Compton gamma-ray beams.

Multiobjective optimization design of an rf gun based electron diffraction beam line

NASA Astrophysics Data System (ADS)

Gulliford, Colwyn; Bartnik, Adam; Bazarov, Ivan; Maxson, Jared

2017-03-01

Multiobjective genetic algorithm optimizations of a single-shot ultrafast electron diffraction beam line comprised of a 100 MV /m 1.6-cell normal conducting rf (NCRF) gun, as well as a nine-cell 2 π /3 bunching cavity placed between two solenoids, have been performed. These include optimization of the normalized transverse emittance as a function of bunch charge, as well as optimization of the transverse coherence length as a function of the rms bunch length of the beam at the sample location for a fixed charge of 1 06 electrons. Analysis of the resulting solutions is discussed in terms of the relevant scaling laws, and a detailed description of one of the resulting solutions from the coherence length optimizations is given. For a charge of 1 06 electrons and final beam sizes of σx≥25 μ m and σt≈5 fs , we found a relative coherence length of Lc ,x/σx≈0.07 using direct optimization of the coherence length. Additionally, based on optimizations of the emittance as a function of final bunch length, we estimate the relative coherence length for bunch lengths of 30 and 100 fs to be roughly 0.1 and 0.2 nm /μ m , respectively. Finally, using the scaling of the optimal emittance with bunch charge, for a charge of 1 05 electrons, we estimate relative coherence lengths of 0.3, 0.5, and 0.92 nm /μ m for final bunch lengths of 5, 30 and 100 fs, respectively.

Exploiting graph kernels for high performance biomedical relation extraction.

PubMed

Panyam, Nagesh C; Verspoor, Karin; Cohn, Trevor; Ramamohanarao, Kotagiri

2018-01-30

Relation extraction from biomedical publications is an important task in the area of semantic mining of text. Kernel methods for supervised relation extraction are often preferred over manual feature engineering methods, when classifying highly ordered structures such as trees and graphs obtained from syntactic parsing of a sentence. Tree kernels such as the Subset Tree Kernel and Partial Tree Kernel have been shown to be effective for classifying constituency parse trees and basic dependency parse graphs of a sentence. Graph kernels such as the All Path Graph kernel (APG) and Approximate Subgraph Matching (ASM) kernel have been shown to be suitable for classifying general graphs with cycles, such as the enhanced dependency parse graph of a sentence. In this work, we present a high performance Chemical-Induced Disease (CID) relation extraction system. We present a comparative study of kernel methods for the CID task and also extend our study to the Protein-Protein Interaction (PPI) extraction task, an important biomedical relation extraction task. We discuss novel modifications to the ASM kernel to boost its performance and a method to apply graph kernels for extracting relations expressed in multiple sentences. Our system for CID relation extraction attains an F-score of 60%, without using external knowledge sources or task specific heuristic or rules. In comparison, the state of the art Chemical-Disease Relation Extraction system achieves an F-score of 56% using an ensemble of multiple machine learning methods, which is then boosted to 61% with a rule based system employing task specific post processing rules. For the CID task, graph kernels outperform tree kernels substantially, and the best performance is obtained with APG kernel that attains an F-score of 60%, followed by the ASM kernel at 57%. The performance difference between the ASM and APG kernels for CID sentence level relation extraction is not significant. In our evaluation of ASM for the PPI task, ASM performed better than APG kernel for the BioInfer dataset, in the Area Under Curve (AUC) measure (74% vs 69%). However, for all the other PPI datasets, namely AIMed, HPRD50, IEPA and LLL, ASM is substantially outperformed by the APG kernel in F-score and AUC measures. We demonstrate a high performance Chemical Induced Disease relation extraction, without employing external knowledge sources or task specific heuristics. Our work shows that graph kernels are effective in extracting relations that are expressed in multiple sentences. We also show that the graph kernels, namely the ASM and APG kernels, substantially outperform the tree kernels. Among the graph kernels, we showed the ASM kernel as effective for biomedical relation extraction, with comparable performance to the APG kernel for datasets such as the CID-sentence level relation extraction and BioInfer in PPI. Overall, the APG kernel is shown to be significantly more accurate than the ASM kernel, achieving better performance on most datasets.

Predicting bunching costs for the Radio Horse 9 winch

Treesearch

Chris B. LeDoux; Bruce W. Kling; Patrice A. Harou; Patrice A. Harou

1987-01-01

Data from field studies and a prebunching cost simulator have been assembled and converted into a general equation that can be used to estimate the prebunching cost of the Radio Horse 9 winch. The methods can be used to estimate prebunching cost for bunching under the skyline corridor for swinging with cable systems, for bunching to skid trail edge to be picked up by a...

Automated crystallographic ligand building using the medial axis transform of an electron-density isosurface.

PubMed

Aishima, Jun; Russel, Daniel S; Guibas, Leonidas J; Adams, Paul D; Brunger, Axel T

2005-10-01

Automatic fitting methods that build molecules into electron-density maps usually fail below 3.5 A resolution. As a first step towards addressing this problem, an algorithm has been developed using an approximation of the medial axis to simplify an electron-density isosurface. This approximation captures the central axis of the isosurface with a graph which is then matched against a graph of the molecular model. One of the first applications of the medial axis to X-ray crystallography is presented here. When applied to ligand fitting, the method performs at least as well as methods based on selecting peaks in electron-density maps. Generalization of the method to recognition of common features across multiple contour levels could lead to powerful automatic fitting methods that perform well even at low resolution.

DENBRAN: A basic program for a significance test for multivariate normality of clusters from branching patterns in dendrograms

NASA Astrophysics Data System (ADS)

Sneath, P. H. A.

A BASIC program is presented for significance tests to determine whether a dendrogram is derived from clustering of points that belong to a single multivariate normal distribution. The significance tests are based on statistics of the Kolmogorov—Smirnov type, obtained by comparing the observed cumulative graph of branch levels with a graph for the hypothesis of multivariate normality. The program also permits testing whether the dendrogram could be from a cluster of lower dimensionality due to character correlations. The program makes provision for three similarity coefficients, (1) Euclidean distances, (2) squared Euclidean distances, and (3) Simple Matching Coefficients, and for five cluster methods (1) WPGMA, (2) UPGMA, (3) Single Linkage (or Minimum Spanning Trees), (4) Complete Linkage, and (5) Ward's Increase in Sums of Squares. The program is entitled DENBRAN.

Gabor Jets for Clutter Rejection in Infrared Imagery

DTIC Science & Technology

2004-12-01

application of a suitable model like Gabor Jets in facial recognition is well motivated by the observation that some low level, spatial-frequency...set. This is a simplified form of the Gabor Jet procedure and will not require any elastic graph matching procedures used in facial recognition . Another...motivation for employing Gabor jets as a post processing clutter rejecter is attributed to the great deal of research in facial recognition , invariant

Applications of Graph-Theoretic Tests to Online Change Detection

DTIC Science & Technology

2014-05-09

NUMBER 5f. WORK UNIT NUMBER 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) AND ADDRESS(ES) 8. PERFORMING ORGANIZATION REPORT ...assessment, crime investigation, and environmental field analysis. Our work offers a new tool for change detection that can be employed in real- time in very...this paper such MSTs and bipartite matchings. Ruth (2009) reports run times for MNBM ensembles created using Derigs’ (1998) algorithm on the order of

Design of a flexible component gathering algorithm for converting cell-based models to graph representations for use in evolutionary search

PubMed Central

2014-01-01

Background The ability of science to produce experimental data has outpaced the ability to effectively visualize and integrate the data into a conceptual framework that can further higher order understanding. Multidimensional and shape-based observational data of regenerative biology presents a particularly daunting challenge in this regard. Large amounts of data are available in regenerative biology, but little progress has been made in understanding how organisms such as planaria robustly achieve and maintain body form. An example of this kind of data can be found in a new repository (PlanformDB) that encodes descriptions of planaria experiments and morphological outcomes using a graph formalism. Results We are developing a model discovery framework that uses a cell-based modeling platform combined with evolutionary search to automatically search for and identify plausible mechanisms for the biological behavior described in PlanformDB. To automate the evolutionary search we developed a way to compare the output of the modeling platform to the morphological descriptions stored in PlanformDB. We used a flexible connected component algorithm to create a graph representation of the virtual worm from the robust, cell-based simulation data. These graphs can then be validated and compared with target data from PlanformDB using the well-known graph-edit distance calculation, which provides a quantitative metric of similarity between graphs. The graph edit distance calculation was integrated into a fitness function that was able to guide automated searches for unbiased models of planarian regeneration. We present a cell-based model of planarian that can regenerate anatomical regions following bisection of the organism, and show that the automated model discovery framework is capable of searching for and finding models of planarian regeneration that match experimental data stored in PlanformDB. Conclusion The work presented here, including our algorithm for converting cell-based models into graphs for comparison with data stored in an external data repository, has made feasible the automated development, training, and validation of computational models using morphology-based data. This work is part of an ongoing project to automate the search process, which will greatly expand our ability to identify, consider, and test biological mechanisms in the field of regenerative biology. PMID:24917489

A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs

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

Choudhury, Sutanay; Holder, Larry; Chin, George

2015-02-02

Cyber security is one of the most significant technical challenges in current times. Detecting adversarial activities, prevention of theft of intellectual properties and customer data is a high priority for corporations and government agencies around the world. Cyber defenders need to analyze massive-scale, high-resolution network flows to identify, categorize, and mitigate attacks involving net- works spanning institutional and national boundaries. Many of the cyber attacks can be described as subgraph patterns, with promi- nent examples being insider infiltrations (path queries), denial of service (parallel paths) and malicious spreads (tree queries). This motivates us to explore subgraph matching on streaming graphsmore » in a continuous setting. The novelty of our work lies in using the subgraph distributional statistics collected from the streaming graph to determine the query processing strategy. We introduce a “Lazy Search" algorithm where the search strategy is decided on a vertex-to-vertex basis depending on the likelihood of a match in the vertex neighborhood. We also propose a metric named “Relative Selectivity" that is used to se- lect between different query processing strategies. Our experiments performed on real online news, network traffic stream and a syn- thetic social network benchmark demonstrate 10-100x speedups over selectivity agnostic approaches.« less

Sampling ARG of multiple populations under complex configurations of subdivision and admixture.

PubMed

Carrieri, Anna Paola; Utro, Filippo; Parida, Laxmi

2016-04-01

Simulating complex evolution scenarios of multiple populations is an important task for answering many basic questions relating to population genomics. Apart from the population samples, the underlying Ancestral Recombinations Graph (ARG) is an additional important means in hypothesis checking and reconstruction studies. Furthermore, complex simulations require a plethora of interdependent parameters making even the scenario-specification highly non-trivial. We present an algorithm SimRA that simulates generic multiple population evolution model with admixture. It is based on random graphs that improve dramatically in time and space requirements of the classical algorithm of single populations.Using the underlying random graphs model, we also derive closed forms of expected values of the ARG characteristics i.e., height of the graph, number of recombinations, number of mutations and population diversity in terms of its defining parameters. This is crucial in aiding the user to specify meaningful parameters for the complex scenario simulations, not through trial-and-error based on raw compute power but intelligent parameter estimation. To the best of our knowledge this is the first time closed form expressions have been computed for the ARG properties. We show that the expected values closely match the empirical values through simulations.Finally, we demonstrate that SimRA produces the ARG in compact forms without compromising any accuracy. We demonstrate the compactness and accuracy through extensive experiments. SimRA (Simulation based on Random graph Algorithms) source, executable, user manual and sample input-output sets are available for downloading at: https://github.com/ComputationalGenomics/SimRA CONTACT: : parida@us.ibm.com Supplementary data are available at Bioinformatics online. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Impaired cerebral blood flow networks in temporal lobe epilepsy with hippocampal sclerosis: A graph theoretical approach.

PubMed

Sone, Daichi; Matsuda, Hiroshi; Ota, Miho; Maikusa, Norihide; Kimura, Yukio; Sumida, Kaoru; Yokoyama, Kota; Imabayashi, Etsuko; Watanabe, Masako; Watanabe, Yutaka; Okazaki, Mitsutoshi; Sato, Noriko

2016-09-01

Graph theory is an emerging method to investigate brain networks. Altered cerebral blood flow (CBF) has frequently been reported in temporal lobe epilepsy (TLE), but graph theoretical findings of CBF are poorly understood. Here, we explored graph theoretical networks of CBF in TLE using arterial spin labeling imaging. We recruited patients with TLE and unilateral hippocampal sclerosis (HS) (19 patients with left TLE, and 21 with right TLE) and 20 gender- and age-matched healthy control subjects. We obtained all participants' CBF maps using pseudo-continuous arterial spin labeling and analyzed them using the Graph Analysis Toolbox (GAT) software program. As a result, compared to the controls, the patients with left TLE showed a significantly low clustering coefficient (p=0.024), local efficiency (p=0.001), global efficiency (p=0.010), and high transitivity (p=0.015), whereas the patients with right TLE showed significantly high assortativity (p=0.046) and transitivity (p=0.011). The group with right TLE also had high characteristic path length values (p=0.085), low global efficiency (p=0.078), and low resilience to targeted attack (p=0.101) at a trend level. Lower normalized clustering coefficient (p=0.081) in the left TLE and higher normalized characteristic path length (p=0.089) in the right TLE were found also at a trend level. Both the patients with left and right TLE showed significantly decreased clustering in similar areas, i.e., the cingulate gyri, precuneus, and occipital lobe. Our findings revealed differing left-right network metrics in which an inefficient CBF network in left TLE and vulnerability to irritation in right TLE are suggested. The left-right common finding of regional decreased clustering might reflect impaired default-mode networks in TLE. Copyright © 2016 Elsevier Inc. All rights reserved.

Knowledge-based understanding of aerial surveillance video

NASA Astrophysics Data System (ADS)

Cheng, Hui; Butler, Darren

2006-05-01

Aerial surveillance has long been used by the military to locate, monitor and track the enemy. Recently, its scope has expanded to include law enforcement activities, disaster management and commercial applications. With the ever-growing amount of aerial surveillance video acquired daily, there is an urgent need for extracting actionable intelligence in a timely manner. Furthermore, to support high-level video understanding, this analysis needs to go beyond current approaches and consider the relationships, motivations and intentions of the objects in the scene. In this paper we propose a system for interpreting aerial surveillance videos that automatically generates a succinct but meaningful description of the observed regions, objects and events. For a given video, the semantics of important regions and objects, and the relationships between them, are summarised into a semantic concept graph. From this, a textual description is derived that provides new search and indexing options for aerial video and enables the fusion of aerial video with other information modalities, such as human intelligence, reports and signal intelligence. Using a Mixture-of-Experts video segmentation algorithm an aerial video is first decomposed into regions and objects with predefined semantic meanings. The objects are then tracked and coerced into a semantic concept graph and the graph is summarized spatially, temporally and semantically using ontology guided sub-graph matching and re-writing. The system exploits domain specific knowledge and uses a reasoning engine to verify and correct the classes, identities and semantic relationships between the objects. This approach is advantageous because misclassifications lead to knowledge contradictions and hence they can be easily detected and intelligently corrected. In addition, the graph representation highlights events and anomalies that a low-level analysis would overlook.

Noncontiguous atom matching structural similarity function.

PubMed

Teixeira, Ana L; Falcao, Andre O

2013-10-28

Measuring similarity between molecules is a fundamental problem in cheminformatics. Given that similar molecules tend to have similar physical, chemical, and biological properties, the notion of molecular similarity plays an important role in the exploration of molecular data sets, query-retrieval in molecular databases, and in structure-property/activity modeling. Various methods to define structural similarity between molecules are available in the literature, but so far none has been used with consistent and reliable results for all situations. We propose a new similarity method based on atom alignment for the analysis of structural similarity between molecules. This method is based on the comparison of the bonding profiles of atoms on comparable molecules, including features that are seldom found in other structural or graph matching approaches like chirality or double bond stereoisomerism. The similarity measure is then defined on the annotated molecular graph, based on an iterative directed graph similarity procedure and optimal atom alignment between atoms using a pairwise matching algorithm. With the proposed approach the similarities detected are more intuitively understood because similar atoms in the molecules are explicitly shown. This noncontiguous atom matching structural similarity method (NAMS) was tested and compared with one of the most widely used similarity methods (fingerprint-based similarity) using three difficult data sets with different characteristics. Despite having a higher computational cost, the method performed well being able to distinguish either different or very similar hydrocarbons that were indistinguishable using a fingerprint-based approach. NAMS also verified the similarity principle using a data set of structurally similar steroids with differences in the binding affinity to the corticosteroid binding globulin receptor by showing that pairs of steroids with a high degree of similarity (>80%) tend to have smaller differences in the absolute value of binding activity. Using a highly diverse set of compounds with information about the monoamine oxidase inhibition level, the method was also able to recover a significantly higher average fraction of active compounds when the seed is active for different cutoff threshold values of similarity. Particularly, for the cutoff threshold values of 86%, 93%, and 96.5%, NAMS was able to recover a fraction of actives of 0.57, 0.63, and 0.83, respectively, while the fingerprint-based approach was able to recover a fraction of actives of 0.41, 0.40, and 0.39, respectively. NAMS is made available freely for the whole community in a simple Web based tool as well as the Python source code at http://nams.lasige.di.fc.ul.pt/.

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

Awida, Mohamed; Chen, Alex; Khabiboulline, Timergali

High intensity proton particle accelerators that supports several simultaneous physics experiments requires sharing the beam. A bunch by bunch beam chopper system located after the Radio Frequency Quadrupole (RFQ) is required in this case to structure the beam in the proper bunch format required by the several experiments. The unused beam will need to be kicked out of the beam path and is disposed in a beam dumb. In this paper, we report on the RF modeling results of a proposed helical kicker. Two beam kickers constitutes the proposed chopper. The beam sequence is formed by kicking in or outmore » the beam bunches from the streamline. The chopper was developed for Project X Injection Experiment (PXIE).« less

Bunch evolution study in optimization of MeV ultrafast electron diffraction

NASA Astrophysics Data System (ADS)

Lu, Xian-Hai; Du, Ying-Chao; Huang, Wen-Hui; Tang, Chuan-Xiang

2014-12-01

Megaelectronvolt ultrafast electron diffraction (UED) is a promising detection tool for ultrafast processes. The quality of diffraction image is determined by the transverse evolution of the probe bunch. In this paper, we study the contributing terms of the emittance and space charge effects to the bunch evolution in the MeV UED scheme, employing a mean-field model with an ellipsoidal distribution as well as particle tracking simulation. The small transverse dimension of the drive laser is found to be critical to improve the reciprocal resolution, exploiting both smaller emittance and larger transverse bunch size before the solenoid. The degradation of the reciprocal spatial resolution caused by the space charge effects should be carefully controlled.

Electron diffraction using ultrafast electron bunches from a laser-wakefield accelerator at kHz repetition rate

NASA Astrophysics Data System (ADS)

He, Z.-H.; Thomas, A. G. R.; Beaurepaire, B.; Nees, J. A.; Hou, B.; Malka, V.; Krushelnick, K.; Faure, J.

2013-02-01

We show that electron bunches in the 50-100 keV range can be produced from a laser wakefield accelerator using 10 mJ, 35 fs laser pulses operating at 0.5 kHz. It is shown that using a solenoid magnetic lens, the electron bunch distribution can be shaped. The resulting transverse and longitudinal coherence is suitable for producing diffraction images from a polycrystalline 10 nm aluminum foil. The high repetition rate, the stability of the electron source, and the fact that its uncorrelated bunch duration is below 100 fs make this approach promising for the development of sub-100 fs ultrafast electron diffraction experiments.

AWAKE readiness for the study of the seeded self-modulation of a 400 GeV proton bunch

NASA Astrophysics Data System (ADS)

Muggli, P.; Adli, E.; Apsimon, R.; Asmus, F.; Baartman, R.; Bachmann, A.-M.; Barros Marin, M.; Batsch, F.; Bauche, J.; Berglyd Olsen, V. K.; Bernardini, M.; Biskup, B.; Blanco Vinuela, E.; Boccardi, A.; Bogey, T.; Bohl, T.; Bracco, C.; Braunmuller, F.; Burger, S.; Burt, G.; Bustamante, S.; Buttenschön, B.; Butterworth, A.; Caldwell, A.; Cascella, M.; Chevallay, E.; Chung, M.; Damerau, H.; Deacon, L.; Dexter, A.; Dirksen, P.; Doebert, S.; Farmer, J.; Fedosseev, V.; Feniet, T.; Fior, G.; Fiorito, R.; Fonseca, R.; Friebel, F.; Gander, P.; Gessner, S.; Gorgisyan, I.; Gorn, A. A.; Grulke, O.; Gschwendtner, E.; Guerrero, A.; Hansen, J.; Hessler, C.; Hofle, W.; Holloway, J.; Hüther, M.; Ibison, M.; Islam, M. R.; Jensen, L.; Jolly, S.; Kasim, M.; Keeble, F.; Kim, S.-Y.; Kraus, F.; Lasheen, A.; Lefevre, T.; LeGodec, G.; Li, Y.; Liu, S.; Lopes, N.; Lotov, K. V.; Martyanov, M.; Mazzoni, S.; Medina Godoy, D.; Mete, O.; Minakov, V. A.; Mompo, R.; Moody, J.; Moreira, M. T.; Mitchell, J.; Mutin, C.; Norreys, P.; Öz, E.; Ozturk, E.; Pauw, W.; Pardons, A.; Pasquino, C.; Pepitone, K.; Petrenko, A.; Pitmann, S.; Plyushchev, G.; Pukhov, A.; Rieger, K.; Ruhl, H.; Schmidt, J.; Shalimova, I. A.; Shaposhnikova, E.; Sherwood, P.; Silva, L.; Sosedkin, A. P.; Speroni, R.; Spitsyn, R. I.; Szczurek, K.; Thomas, J.; Tuev, P. V.; Turner, M.; Verzilov, V.; Vieira, J.; Vincke, H.; Welsch, C. P.; Williamson, B.; Wing, M.; Xia, G.; Zhang, H.; AWAKE Collaboration

2018-01-01

AWAKE is a proton-driven plasma wakefield acceleration experiment. We show that the experimental setup briefly described here is ready for systematic study of the seeded self-modulation of the 400 GeV proton bunch in the 10 m long rubidium plasma with density adjustable from 1 to 10× {10}14 cm-3. We show that the short laser pulse used for ionization of the rubidium vapor propagates all the way along the column, suggesting full ionization of the vapor. We show that ionization occurs along the proton bunch, at the laser time and that the plasma that follows affects the proton bunch.

Observation of the Self-Modulation Instability via Time-Resolved Measurements

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

Gross, M.; Engel, J.; Good, J.

Self-modulation of an electron beam in a plasma has been observed. The propagation of a long (several plasma wavelengths) electron bunch in an overdense plasma resulted in the production of multiple bunches via the self-modulation instability. Using a combination of a radio-frequency deflector and a dipole spectrometer, the time and energy structure of the self-modulated beam was measured. The longitudinal phase space measurement showed the modulation of a long electron bunch into three bunches with an approximatelymore » $$200\\text{ }\\text{ }\\mathrm{keV}/c$$ amplitude momentum modulation. Demonstrating this effect is a breakthrough for proton-driven plasma accelerator schemes aiming to utilize the same physical effect.« less

Observation of the Self-Modulation Instability via Time-Resolved Measurements

DOE PAGES

Gross, M.; Engel, J.; Good, J.; ...

2018-04-06

Self-modulation of an electron beam in a plasma has been observed. The propagation of a long (several plasma wavelengths) electron bunch in an overdense plasma resulted in the production of multiple bunches via the self-modulation instability. Using a combination of a radio-frequency deflector and a dipole spectrometer, the time and energy structure of the self-modulated beam was measured. The longitudinal phase space measurement showed the modulation of a long electron bunch into three bunches with an approximatelymore » $$200\\text{ }\\text{ }\\mathrm{keV}/c$$ amplitude momentum modulation. Demonstrating this effect is a breakthrough for proton-driven plasma accelerator schemes aiming to utilize the same physical effect.« less

Formation and acceleration of uniformly filled ellipsoidal electron bunches obtained via space-charge-driven expansion from a cesium-telluride photocathode

NASA Astrophysics Data System (ADS)

Piot, P.; Sun, Y.-E.; Maxwell, T. J.; Ruan, J.; Secchi, E.; Thangaraj, J. C. T.

2013-01-01

We report the experimental generation, acceleration, and characterization of a uniformly filled electron bunch obtained via space-charge-driven expansion (often referred to as “blow-out regime”) in an L-band (1.3-GHz) radiofrequency photoinjector. The beam is photoemitted from a cesium-telluride semiconductor photocathode using a short (<200fs) ultraviolet laser pulse. The produced electron bunches are characterized with conventional diagnostics and the signatures of their ellipsoidal character are observed. We especially demonstrate the production of ellipsoidal bunches with charges up to ˜0.5nC corresponding to a ˜20-fold increase compared to previous experiments with metallic photocathodes.

The simultaneous generation of soliton bunches and Q-switched-like pulses in a partially mode-locked fiber laser with a graphene saturable absorber

NASA Astrophysics Data System (ADS)

Wang, Zhenhong; Wang, Zhi; Liu, Yan-ge; He, Ruijing; Wang, Guangdou; Yang, Guang; Han, Simeng

2018-05-01

We experimentally report the coexistence of soliton bunches and Q-switched-like pulses in a partially mode-locked fiber laser with a microfiber-based graphene saturable absorber. The soliton bunches, like isolated spikes with extreme amplitude and ultrashort duration, randomly generate in the background of the Q-switched-like pulses. The soliton bunches have some pulse envelopes in which pulses operate at a fundamental repetition rate in the temporal domain. Further investigation shows that the composite pulses are highly correlated with the noise-like pulses. Our work can make a further contribution to enrich the understanding of the nonlinear dynamics in fiber lasers.

Secondary-structure matching (SSM), a new tool for fast protein structure alignment in three dimensions.

PubMed

Krissinel, E; Henrick, K

2004-12-01

The present paper describes the SSM algorithm of protein structure comparison in three dimensions, which includes an original procedure of matching graphs built on the protein's secondary-structure elements, followed by an iterative three-dimensional alignment of protein backbone Calpha atoms. The SSM results are compared with those obtained from other protein comparison servers, and the advantages and disadvantages of different scores that are used for structure recognition are discussed. A new score, balancing the r.m.s.d. and alignment length Nalign, is proposed. It is found that different servers agree reasonably well on the new score, while showing considerable differences in r.m.s.d. and Nalign.

Disconnection of network hubs and cognitive impairment after traumatic brain injury.

PubMed

Fagerholm, Erik D; Hellyer, Peter J; Scott, Gregory; Leech, Robert; Sharp, David J

2015-06-01

Traumatic brain injury affects brain connectivity by producing traumatic axonal injury. This disrupts the function of large-scale networks that support cognition. The best way to describe this relationship is unclear, but one elegant approach is to view networks as graphs. Brain regions become nodes in the graph, and white matter tracts the connections. The overall effect of an injury can then be estimated by calculating graph metrics of network structure and function. Here we test which graph metrics best predict the presence of traumatic axonal injury, as well as which are most highly associated with cognitive impairment. A comprehensive range of graph metrics was calculated from structural connectivity measures for 52 patients with traumatic brain injury, 21 of whom had microbleed evidence of traumatic axonal injury, and 25 age-matched controls. White matter connections between 165 grey matter brain regions were defined using tractography, and structural connectivity matrices calculated from skeletonized diffusion tensor imaging data. This technique estimates injury at the centre of tract, but is insensitive to damage at tract edges. Graph metrics were calculated from the resulting connectivity matrices and machine-learning techniques used to select the metrics that best predicted the presence of traumatic brain injury. In addition, we used regularization and variable selection via the elastic net to predict patient behaviour on tests of information processing speed, executive function and associative memory. Support vector machines trained with graph metrics of white matter connectivity matrices from the microbleed group were able to identify patients with a history of traumatic brain injury with 93.4% accuracy, a result robust to different ways of sampling the data. Graph metrics were significantly associated with cognitive performance: information processing speed (R(2) = 0.64), executive function (R(2) = 0.56) and associative memory (R(2) = 0.25). These results were then replicated in a separate group of patients without microbleeds. The most influential graph metrics were betweenness centrality and eigenvector centrality, which provide measures of the extent to which a given brain region connects other regions in the network. Reductions in betweenness centrality and eigenvector centrality were particularly evident within hub regions including the cingulate cortex and caudate. Our results demonstrate that betweenness centrality and eigenvector centrality are reduced within network hubs, due to the impact of traumatic axonal injury on network connections. The dominance of betweenness centrality and eigenvector centrality suggests that cognitive impairment after traumatic brain injury results from the disconnection of network hubs by traumatic axonal injury. © The Author (2015). Published by Oxford University Press on behalf of the Guarantors of Brain.

Characteristics of GeV Electron Bunches Accelerated by Intense Lasers in Vacuum

NASA Astrophysics Data System (ADS)

Wang, P. X.; Ho, Y. K.; Kong, Q.; Yuan, X. Q.; Cao, N.; Feng, L.

This paper studies the characteristics of GeV electron bunches driven by ultra-intense lasers in vacuum based on the mechanism of capture and violent acceleration scenario [CAS, see, e.g. J. X. Wang et al., Phys. Rev. E58, 6575 (1998)], which shows an interesting prospect of becoming a new principle of laser-driven accelerators. It has been found that the accelerated GeV electron bunch is a macro-pulse composed of a lot of micro-pulses, which is analogous to the structure of the bunches produced by conventional linacs. The macro-pulse corresponds to the duration of the laser pulse while the micro-pulse corresponds to the periodicity of the laser wave. Therefore, provided that the incoming electron bunch with comparable sizes as that of the laser pulse synchronously impinges on the laser pulse, the total fraction of electrons captured and accelerated to GeV energy can reach more than 20%. These results demonstrate that the mechanisms of CAS is a relatively effective accelerator mechanism.

Operational experience with nanocoulomb bunch charges in the Cornell photoinjector

DOE PAGES

Bartnik, Adam; Gulliford, Colwyn; Bazarov, Ivan; ...

2015-08-19

Characterization of 9–9.5 MeV electron beams produced in the dc-gun based Cornell photoinjector is given for bunch charges ranging from 20 pC to 2 nC. Comparison of the measured emittances and longitudinal current profiles to optimized 3D space charge simulations yields excellent agreement for bunch charges up to 1 nC when the measured laser distribution is used to generate initial particle distributions in simulation. Analysis of the scaling of the measured emittance with bunch charge shows that the emittance scales roughly as the square root of the bunch charge up to 300 pC, above which the trend becomes linear. Furthermore,more » these measurements demonstrate that the Cornell photoinjector can produce cathode emittance dominated beams meeting the emittance and peak current specifications for next generation free electron lasers operating at high repetition rate. In addition, the 1 and 2 nC results are relevant to the electron ion collider community.« less

Determination of the Biological Efficiency and Antioxidant Potential of Lingzhi or Reishi Medicinal Mushroom, Ganoderma lucidum (Agaricomycetes), Cultivated Using Different Agro-Wastes in Malaysia.

PubMed

Sudheer, Surya; Alzorqi, Ibrahim; Ali, Asgar; Cheng, Poh Guat; Siddiqui, Yasmeen; Manickam, Sivakumar

2018-01-01

This study investigates the cultivation of Ganoderma lucidum using different agricultural biomasses from Malaysia. Five different combinations of rubber wood sawdust, empty fruit bunch fiber, and mesocarp fiber from oil palm, alone and in combination, were used to cultivate G. lucidum. Although all the substrate combinations worked well to grow the mushroom, the highest biological efficiency was obtained from the combination of empty fruit bunch fiber with sawdust. A total yield of 27% was obtained from empty fruit bunch fiber with sawdust, followed by sawdust (26%), empty fruit bunch fiber (19%), mesocarp fiber with sawdust (19%), and mesocarp fiber (16%). The quality of mushrooms was proved by proximate analysis and detection of phenolic compounds and flavonoids. The antioxidant activity verified by DPPH, ferric-reducing ability of plasma, and ABTS analyses revealed that the empty fruit bunch fiber with sawdust had higher activity than the other substrates.

Millimeter wave coherent synchrotron radiation in a compact electron storage ring

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

Murphy, J.B.; Blum, E.; Heese, R.

1998-01-01

Installation of a 2,856 MHz RF system into the XLS compact electron storage ring would allow the generation of millimeter wave coherent synchrotron radiation. Operating at 150 MeV, one could produce bunches containing on the order of 2 {times} 10{sup 7} electrons with a bunch length {sigma}{sub L0} = 0.3 mm, resulting in coherent emission at wavelengths above 0.8 mm. The characteristics of the source and the emitted radiation are discussed. In the case of 100 mrad horizontal collection angle, the average power radiated in the wavelength band 1 mm {le} {lambda} {le} 2 mm is 0.3 mW for singlemore » bunch operation and 24 mW for 80 bunch operation. The peak power in a single pulse of a few picosecond duration is on the order of one watt. By reducing the momentum compaction, the bunch length could be reduced to {sigma}{sub L0} = 0.15 mm, resulting in coherent synchrotron radiation down to 500 {micro}m.« less

Scanning Synchronization of Colliding Bunches for MEIC Project

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

Derbenev, Yaroslav S.; Popov, V. P.; Chernousov, Yu D.

2015-09-01

Synchronization of colliding beams is one of the major issues of an electron-ion collider (EIC) design because of sensitivity of ion revolution frequency to beam energy. A conventional solution for this trouble is insertion of bent chicanes in the arcs space. In our report we consider a method to provide space coincidence of encountering bunches in the crab-crossing orbits Interaction Region (IR) while repetition rates of two beams do not coincide. The method utilizes pair of fast kickers realizing a bypass for the electron bunches as the way to equalize positions of the colliding bunches at the Interaction Point (IP).more » A dipole-mode warm or SRF cavities fed by the magnetron transmitters are used as fast kickers, allowing a broad-band phase and amplitude control. The proposed scanning synchronization method implies stabilization of luminosity at a maximum via a feedback loop. This synchronization method is evaluated as perspective for the Medium Energy Electron-Ion collider (MEIC) project of JLab with its very high bunch repetition rate.« less

Colossal photon bunching in quasiparticle-mediated nanodiamond cathodoluminescence

NASA Astrophysics Data System (ADS)

Feldman, Matthew A.; Dumitrescu, Eugene F.; Bridges, Denzel; Chisholm, Matthew F.; Davidson, Roderick B.; Evans, Philip G.; Hachtel, Jordan A.; Hu, Anming; Pooser, Raphael C.; Haglund, Richard F.; Lawrie, Benjamin J.

2018-02-01

Nanoscale control over the second-order photon correlation function g(2 )(τ ) is critical to emerging research in nonlinear nanophotonics and integrated quantum information science. Here we report on quasiparticle control of photon bunching with g(2 )(0 ) >45 in the cathodoluminescence of nanodiamond nitrogen vacancy (NV0) centers excited by a converged electron beam in an aberration-corrected scanning transmission electron microscope. Plasmon-mediated NV0 cathodoluminescence exhibits a 16-fold increase in luminescence intensity correlated with a threefold reduction in photon bunching compared with that of uncoupled NV0 centers. This effect is ascribed to the excitation of single temporally uncorrelated NV0 centers by single surface plasmon polaritons. Spectrally resolved Hanbury Brown-Twiss interferometry is employed to demonstrate that the bunching is mediated by the NV0 phonon sidebands, while no observable bunching is detected at the zero-phonon line. The data are consistent with fast phonon-mediated recombination dynamics, a conclusion substantiated by agreement between Bayesian regression and Monte Carlo models of superthermal NV0 luminescence.

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

Bassi, Gabriele; Blednykh, Alexei; Smalyuk, Victor

A novel algorithm for self-consistent simulations of long-range wakefield effects has been developed and applied to the study of both longitudinal and transverse coupled-bunch instabilities at NSLS-II. The algorithm is implemented in the new parallel tracking code space (self-consistent parallel algorithm for collective effects) discussed in the paper. The code is applicable for accurate beam dynamics simulations in cases where both bunch-to-bunch and intrabunch motions need to be taken into account, such as chromatic head-tail effects on the coupled-bunch instability of a beam with a nonuniform filling pattern, or multibunch and single-bunch effects of a passive higher-harmonic cavity. The numericalmore » simulations have been compared with analytical studies. For a beam with an arbitrary filling pattern, intensity-dependent complex frequency shifts have been derived starting from a system of coupled Vlasov equations. The analytical formulas and numerical simulations confirm that the analysis is reduced to the formulation of an eigenvalue problem based on the known formulas of the complex frequency shifts for the uniform filling pattern case.« less

Initial Observations of Micropulse Elongation of Electron Beams in a SCRF Accelerator

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

Lumpkin, A. H.; Thurman-Keup, R.; Edstrom Jr., D.

2016-10-09

Commissioning at the SCRF accelerator at the Fermilab Accelerator Science and Technology (FAST) Facility has included the implementation of a versatile bunch-length monitor located after the 4-dipole chicane bunch compressor for electron beam energies of 20-50 MeV and integrated charges in excess of 10 nC. The team has initially used a Hamamatsu C5680 synchroscan streak camera to assess the effects of space charge on the electron beam bunch lengths. An Al-coated Si screen was used to generate optical transition radiation (OTR) resulting from the beam’s interaction with the screen. The chicane bypass beamline allowed the measurements of the bunch lengthmore » without the compression stage at the downstream beamline location using OTR and the streak camera. We have observed electron beam bunch lengths from 5 to 16 ps (sigma) for micropulse charges of 60 pC to 800 pC, respectively. We also report a compressed sub-ps micropulse case.« less

Overview and analysis of the 2016 Gold Run in the Booster and AGS

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

Zeno, K.

2016-09-16

Run 16 differed from preceding Au runs in that during most of it a 12:6:2 merge was employed in the AGS instead of an 8:4:2 merge. This was done to provide higher bunch intensities for RHIC. Since the approach to providing higher bunch intensities is, and has been, to merge more Booster bunches of the same intensity into one final bunch, detailing the longitudinal aspects of this setup seems quite relevant. So, aside from providing an overview of the Au portion of Run 16, this note also contains a series of emittance measurements in the Booster and AGS. Comparisons ofmore » these to similar measurements in previous runs are also made in hopes of gaining a better understanding of what factors contribute to the emittance of a bunch at AGS extraction. The note also tries to provide some context in which to understand the various merge schemes and describes a potential 8 to 1 type merge.« less

Trains of electron micro-bunches in plasma wake-field acceleration

NASA Astrophysics Data System (ADS)

Lécz, Zsolt; Andreev, Alexander; Konoplev, Ivan; Seryi, Andrei; Smith, Jonathan

2018-07-01

Plasma-based charged particle accelerators have been intensively investigated in the past three decades due to their capability to open up new horizons in accelerator science and particle physics yielding electric field accelerating gradient more than three orders of magnitudes higher than in conventional devices. At the current stage the most advanced and reliable mechanism for accelerating electrons is based on the propagation of an intense laser pulse or a relativistic electron beam in a low density gaseous target. In this paper we concentrate on the electron beam-driven plasma wake-field acceleration and demonstrate using 3D PiC simulations that a train of electron micro-bunches with ∼10 fs period can be generated behind the driving beam propagating in a density down-ramp. We will discuss the conditions and properties of the micro-bunches generated aiming at understanding and study of multi-bunch mechanism of injection. It is show that the periodicity and duration of micro-bunches can be controlled by adjusting the plasma density gradient and driving beam charge.

Protein and peptide cross sections and mass spectra in an electrostatic ion beam trap

NASA Astrophysics Data System (ADS)

Fradkin, Z.; Strasser, D.; Heber, O.; Rappaport, M. L.; Sharon, M.; Thomson, B. A.; Rahinov, I.; Toker, Y.; Zajfman, D.

2017-05-01

Among the advantages of an electrostatic ion beam trap (EIBT), which is based on purely electrostatic fields, are mass-unlimited trapping and ease of operation. We have developed a new system that couples an electrospray ion source to an EIBT. Between the source and EIBT there is a Paul trap in which the ions are accumulated before being extracted and accelerated. After the ion bunch has entered the EIBT, the ions are trapped by rapidly raising the voltages on the entrance mirror. The oscillations of the bunch are detected by amplifying the charge induced on a pickup ring in the center of the trap, the ion mass being directly proportional to the square of the oscillation period. The trapping of biomolecules in the RF-bunching mode of the EIBT is used for measurement of mass spectra and collision cross sections. Coalescence of bunches of ions of nearby mass in the self-bunching mode is also demonstrated.

Effects of energy chirp on bunch length measurement in linear accelerator beams

NASA Astrophysics Data System (ADS)

Sabato, L.; Arpaia, P.; Giribono, A.; Liccardo, A.; Mostacci, A.; Palumbo, L.; Vaccarezza, C.; Variola, A.

2017-08-01

The effects of assumptions about bunch properties on the accuracy of the measurement method of the bunch length based on radio frequency deflectors (RFDs) in electron linear accelerators (LINACs) are investigated. In particular, when the electron bunch at the RFD has a non-negligible energy chirp (i.e. a correlation between the longitudinal positions and energies of the particle), the measurement is affected by a deterministic intrinsic error, which is directly related to the RFD phase offset. A case study on this effect in the electron LINAC of a gamma beam source at the Extreme Light Infrastructure-Nuclear Physics (ELI-NP) is reported. The relative error is estimated by using an electron generation and tracking (ELEGANT) code to define the reference measurements of the bunch length. The relative error is proved to increase linearly with the RFD phase offset. In particular, for an offset of {{7}\\circ} , corresponding to a vertical centroid offset at a screen of about 1 mm, the relative error is 4.5%.

Shielded transient self-interaction of a bunch entering a circle from a straight path

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

Li, R.; Bohn, C.L.; Bisognano, J.J.

1997-08-01

Recent developments in electron-gun and injector technologies enable production of short (mm-length), high-charge (nC-regime) bunches. In this parameter regime, the curvature effect on the bunch self-interaction, by way of coherent synchrotron radiation (CSR) and space-charge forces as the beam traverses magnet bends, may cause serious emittance degradation. In this paper, the authors study an electron bunch orbiting between two infinite, parallel conducting plates. The bunch moves on a trajectory from a straight path to a circular orbit and begins radiating. Transient effects, arising from CSR and space-charge forces generated from source particles both on the bend and on the straightmore » path prior to the bend, are analyzed using Lienard-Wiechert fields, and their overall net effect is obtained. The influence of the plates on the transients is contrasted to their shielding of the steady-state radiated power. Results for emittance degradation induced by this self-interaction are also presented.« less

Ion Emittance Growth Due to Focusing Modulation from Slipping Electron Bunch

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

Wang, G.

2015-02-17

Low energy RHIC operation has to be operated at an energy ranging from γ = 4.1 to γ = 10. The energy variation causes the change of revolution frequency. While the rf system for the circulating ion will operate at an exact harmonic of the revolution frequency (h=60 for 4.5 MHz rf and h=360 for 28 MHz rf.), the superconducting rf system for the cooling electron beam does not have a frequency tuning range that is wide enough to cover the required changes of revolution frequency. As a result, electron bunches will sit at different locations along the ion bunchmore » from turn to turn, i.e. the slipping of the electron bunch with respect to the circulating ion bunch. At cooling section, ions see a coherent focusing force due to the electrons’ space charge, which differs from turn to turn due to the slipping. We will try to estimate how this irregular focusing affects the transverse emittance of the ion bunch.« less

State orthogonality, boson bunching parameter and bosonic enhancement factor

NASA Astrophysics Data System (ADS)

Marchewka, Avi; Granot, Er'el

2016-04-01

It is emphasized that the bunching parameter β ≡ p B / p D , i.e. the ratio between the probability to measure two bosons and two distinguishable particles at the same state, is a constant of motion and depends only on the overlap between the initial wavefunctions. This ratio is equal to β = 2 / (1 + I 2), where I is the overlap integral between the initial wavefunctions. That is, only when the initial wavefunctions are orthogonal this ratio is equal to 2, however, this bunching ratio can be reduced to 1, when the two wavefunctions are identical. This simple equation explains the experimental evidences of a beam splitter. A straightforward conclusion is that by measuring the local bunching parameter β (at any point in space and time) it is possible to evaluate a global parameter I (the overlap between the initial wavefunctions). The bunching parameter is then generalized to arbitrary number of particles, and in an analogy to the two-particles scenario, the well-known bosonic enhancement appears only when all states are orthogonal.

Application accelerator system having bunch control

DOEpatents

Wang, Dunxiong; Krafft, Geoffrey Arthur

1999-01-01

An application accelerator system for monitoring the gain of a free electron laser. Coherent Synchrotron Radiation (CSR) detection techniques are used with a bunch length monitor for ultra short, picosec to several tens of femtosec, electron bunches. The monitor employs an application accelerator, a coherent radiation production device, an optical or beam chopping device, an infrared radiation collection device, a narrow-banding filter, an infrared detection device, and a control.

Coherent emission from a bunched electron beam: superradiance and stimulated-superradiance in a uniform and tapered wiggler FEL

NASA Astrophysics Data System (ADS)

Gover, A.; Ianconescu, R.; Friedman, A.; Emma, C.; Musumeci, P.

2017-09-01

We outline fundamental coherent radiation processes from a charge particles beam: Spontaneous Superradiance (SR), Stimulated Superradiance (ST-SR), and in the context of undulator radiation: Tapering-Enhanced Superradiance (TES) and Tapering-Enhanced Stimulated Superradiance Amplification (TESSA). Both single bunch and periodic bunching (in phasor and spectral Fourier frequency formulations) are considered in a model of radiation mode expansion.

Atomic force microscopic study of step bunching and macrostep formation during the growth of L-arginine phosphate monohydrate single crystals

NASA Astrophysics Data System (ADS)

Sangwal, K.; Torrent-Burgues, J.; Sanz, F.; Gorostiza, P.

1997-02-01

The experimental results of the formation of step bunches and macrosteps on the {100} face of L-arginine phosphate monohydrate crystals grown from aqueous solutions at different supersaturations studied by using atomic force microscopy are described and discussed. It was observed that (1) the step height does not remain constant with increasing time but fluctuates within a particular range of heights, which depends on the region of step bunches, (2) the maximum height and the slope of bunched steps increases with growth time as well as supersaturation used for growth, and that (3) the slope of steps of relatively small heights is usually low with a value of about 8° and does not depend on the region of formation of step bunches, but the slope of steps of large heights is up to 21°. Analysis of the experimental results showed that (1) at a particular value of supersaturation the ratio of the average step height to the average step spacing is a constant, suggesting that growth of the {100} face of L-arginine phosphate monohydrate crystals occurs by direct integration of growth entities to growth steps, and that (2) the formation of step bunches and macrosteps follows the dynamic theory of faceting, advanced by Vlachos et al.

Superthermal photon bunching in terms of simple probability distributions

NASA Astrophysics Data System (ADS)

Lettau, T.; Leymann, H. A. M.; Melcher, B.; Wiersig, J.

2018-05-01

We analyze the second-order photon autocorrelation function g(2 ) with respect to the photon probability distribution and discuss the generic features of a distribution that results in superthermal photon bunching [g(2 )(0 ) >2 ]. Superthermal photon bunching has been reported for a number of optical microcavity systems that exhibit processes such as superradiance or mode competition. We show that a superthermal photon number distribution cannot be constructed from the principle of maximum entropy if only the intensity and the second-order autocorrelation are given. However, for bimodal systems, an unbiased superthermal distribution can be constructed from second-order correlations and the intensities alone. Our findings suggest modeling superthermal single-mode distributions by a mixture of a thermal and a lasinglike state and thus reveal a generic mechanism in the photon probability distribution responsible for creating superthermal photon bunching. We relate our general considerations to a physical system, i.e., a (single-emitter) bimodal laser, and show that its statistics can be approximated and understood within our proposed model. Furthermore, the excellent agreement of the statistics of the bimodal laser and our model reveals that the bimodal laser is an ideal source of bunched photons, in the sense that it can generate statistics that contain no other features but the superthermal bunching.

Learning context-sensitive shape similarity by graph transduction.

PubMed

Bai, Xiang; Yang, Xingwei; Latecki, Longin Jan; Liu, Wenyu; Tu, Zhuowen

2010-05-01

Shape similarity and shape retrieval are very important topics in computer vision. The recent progress in this domain has been mostly driven by designing smart shape descriptors for providing better similarity measure between pairs of shapes. In this paper, we provide a new perspective to this problem by considering the existing shapes as a group, and study their similarity measures to the query shape in a graph structure. Our method is general and can be built on top of any existing shape similarity measure. For a given similarity measure, a new similarity is learned through graph transduction. The new similarity is learned iteratively so that the neighbors of a given shape influence its final similarity to the query. The basic idea here is related to PageRank ranking, which forms a foundation of Google Web search. The presented experimental results demonstrate that the proposed approach yields significant improvements over the state-of-art shape matching algorithms. We obtained a retrieval rate of 91.61 percent on the MPEG-7 data set, which is the highest ever reported in the literature. Moreover, the learned similarity by the proposed method also achieves promising improvements on both shape classification and shape clustering.

Applying graphs and complex networks to football metric interpretation.

PubMed

Arriaza-Ardiles, E; Martín-González, J M; Zuniga, M D; Sánchez-Flores, J; de Saa, Y; García-Manso, J M

2018-02-01

This work presents a methodology for analysing the interactions between players in a football team, from the point of view of graph theory and complex networks. We model the complex network of passing interactions between players of a same team in 32 official matches of the Liga de Fútbol Profesional (Spain), using a passing/reception graph. This methodology allows us to understand the play structure of the team, by analysing the offensive phases of game-play. We utilise two different strategies for characterising the contribution of the players to the team: the clustering coefficient, and centrality metrics (closeness and betweenness). We show the application of this methodology by analyzing the performance of a professional Spanish team according to these metrics and the distribution of passing/reception in the field. Keeping in mind the dynamic nature of collective sports, in the future we will incorporate metrics which allows us to analyse the performance of the team also according to the circumstances of game-play and to different contextual variables such as, the utilisation of the field space, the time, and the ball, according to specific tactical situations. Copyright © 2017 Elsevier B.V. All rights reserved.

Digitally Controlled Four Harmonic Buncher for FSU LINAC

NASA Astrophysics Data System (ADS)

Moerland, Daniel S.; Wiedenhoever, Ingo; Baby, Lagy T.; Caussyn, David; Spingler, David

2012-03-01

Florida State University's John D. Fox Superconducting Accelerator Laboratory is operating a Tandem-Linac system for heavy ion beams at energies of 5-10 MeV/u. Recently, the accelerator has been used as the driver for the radioactive beam facility RESOLUT, which poses new demands on its high-intensity performance and time-resolution. These demands motivated us to optimize the RF bunching system and to switch the bunch frequency from 48.5 to 12.125 MHz. We installed a four-harmonic resonant transformer to create 3-4 kV potential oscillations across a pair of wire-mesh grids. This setup is modulating the energy of the beam injected into the tandem accelerator, with the aim to create short bunches of beam particles. Asawtooth-like wave-form is created using the Fourier series method, by combining the basis sinusoidal wave of 12.125MHz and its 3 higher order harmonics, in a manner similar to the systems used at ATLAS [1] and other RF-accelerators. A new aspect of our setup is the use of a digital 1GHz function generator, which allows us to optimize and stabilize the synthesized waveform. The control system was realized using labview and integrated into the recently updated controls of the accelerator. We characterize the bunching quality achievedand discuss the optimization of the bunching wave-form. The bunching system has been successfully used in a number of Linac-experiments performed during 2011.[4pt][1] S. Sharamentov, J. Bogaty, B.E. Clifft, R. Pardo, UPGRADE OF THE ATLAS POSITIVE ION INJECTOR BUNCHING SYSTEM, Proceedings of 2005 Particle Accelerator Conference, Knoxville, Tennessee

Detectors for low energy electron cooling in RHIC

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

Carlier, F. S.

Low-energy operation of RHIC is of particular interest to study the location of a possible critical point in the QCD phase diagram. The performance of RHIC at energies equal to or lower than 10 GV/nucleon is limited by nonlinearities, Intra-BeamScattering (IBS) processes and space-charge effects. To successfully address the luminosity and ion store lifetime limitations imposed by IBS, the method of electron cooling has been envisaged. During electron cooling processes electrons are injected along with the ion beam at the nominal ion bunch velocities. The velocity spread of the ion beam is reduced in all planes through Coulomb interactions betweenmore » the cold electron beam and the ion beam. The electron cooling system proposed for RHIC will be the first of its kind to use bunched beams for the delivery of the electron bunches, and will therefore be accompanied by the necessary challenges. The designed electron cooler will be located in IP2. The electron bunches will be accelerated by a linac before being injected along side the ion beams. Thirty consecutive electron bunches will be injected to overlap with a single ion bunch. They will first cool the yellow beam before being extracted, turned by 180-degrees, and reinjected into the blue beam for cooling. As such, both the yellow and blue beams will be cooled by the same ion bunches. This will pose considerable challenges to ensure proper electron beam quality to cool the second ion beam. Furthermore, no ondulator will be used in the electron cooler so radiative recombination between the ions and the electrons will occur.« less

Self-bunching electron guns

NASA Astrophysics Data System (ADS)

Mako, Frederick M.; Len, L. K.

1999-05-01

We report on three electron gun projects that are aimed at power tube and injector applications. The purpose of the work is to develop robust electron guns which produce self-bunched, high-current-density beams. We have demonstrated, in a microwave cavity, self-bunching, cold electron emission, long life, and tolerance to contamination. The cold process is based on secondary electron emission. FMT has studied using simulation codes the resonant bunching process which gives rise to high current densities (0.01-5 kA/cm2), high charge bunches (up to 500 nC/bunch), and short pulses (1-100 ps) for frequencies from 1 to 12 GHz. The beam pulse width is nominally ˜5% of the rf period. The first project is the L-Band Micro-Pulse Gun (MPG). Measurements show ˜40 ps long micro-bunches at ˜20 A/cm2 without contamination due to air exposure. Lifetime testing has been carried out for about 18 months operating at 1.25 GHz for almost 24 hours per day at a repetition rate of 300 Hz and 5 μs-long macro-pulses. Approximately 5.8×1013 micro-bunches or 62,000 coulombs have passed through this gun and it is still working fine. The second project, the S-Band MPG, is now operational. It is functioning at a frequency of 2.85 GHz, a repetition rate of 30 Hz, with a 2 μs-long macro-pulse. It produces about 45 A in the macro-pulse. The third project is a 34.2 GHz frequency-multiplied source driven by an X-Band MPG. A point design was performed at an rf output power of 150 MW at 34.2 GHz. The resulting system efficiency is 53% and the gain is 60 dB. The system efficiency includes the input cavity efficiency, input driver efficiency (a 50 MW klystron at 11.4 GHz), output cavity efficiency, and the post-acceleration efficiency.

Photogrammetric 3D reconstruction using mobile imaging

NASA Astrophysics Data System (ADS)

Fritsch, Dieter; Syll, Miguel

2015-03-01

In our paper we demonstrate the development of an Android Application (AndroidSfM) for photogrammetric 3D reconstruction that works on smartphones and tablets likewise. The photos are taken with mobile devices, and can thereafter directly be calibrated using standard calibration algorithms of photogrammetry and computer vision, on that device. Due to still limited computing resources on mobile devices, a client-server handshake using Dropbox transfers the photos to the sever to run AndroidSfM for the pose estimation of all photos by Structure-from-Motion and, thereafter, uses the oriented bunch of photos for dense point cloud estimation by dense image matching algorithms. The result is transferred back to the mobile device for visualization and ad-hoc on-screen measurements.

Comparing Phylogenetic Trees by Matching Nodes Using the Transfer Distance Between Partitions

PubMed Central

Giaro, Krzysztof

2017-01-01

Abstract Ability to quantify dissimilarity of different phylogenetic trees describing the relationship between the same group of taxa is required in various types of phylogenetic studies. For example, such metrics are used to assess the quality of phylogeny construction methods, to define optimization criteria in supertree building algorithms, or to find horizontal gene transfer (HGT) events. Among the set of metrics described so far in the literature, the most commonly used seems to be the Robinson–Foulds distance. In this article, we define a new metric for rooted trees—the Matching Pair (MP) distance. The MP metric uses the concept of the minimum-weight perfect matching in a complete bipartite graph constructed from partitions of all pairs of leaves of the compared phylogenetic trees. We analyze the properties of the MP metric and present computational experiments showing its potential applicability in tasks related to finding the HGT events. PMID:28177699

Comparing Phylogenetic Trees by Matching Nodes Using the Transfer Distance Between Partitions.

PubMed

Bogdanowicz, Damian; Giaro, Krzysztof

2017-05-01

Ability to quantify dissimilarity of different phylogenetic trees describing the relationship between the same group of taxa is required in various types of phylogenetic studies. For example, such metrics are used to assess the quality of phylogeny construction methods, to define optimization criteria in supertree building algorithms, or to find horizontal gene transfer (HGT) events. Among the set of metrics described so far in the literature, the most commonly used seems to be the Robinson-Foulds distance. In this article, we define a new metric for rooted trees-the Matching Pair (MP) distance. The MP metric uses the concept of the minimum-weight perfect matching in a complete bipartite graph constructed from partitions of all pairs of leaves of the compared phylogenetic trees. We analyze the properties of the MP metric and present computational experiments showing its potential applicability in tasks related to finding the HGT events.

Accelerating the Mining of Influential Nodes in Complex Networks through Community Detection

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

Halappanavar, Mahantesh; Sathanur, Arun V.; Nandi, Apurba

Computing the set of influential nodes with a given size to ensure maximal spread of influence on a complex network is a challenging problem impacting multiple applications. A rigorous approach to influence maximization involves utilization of optimization routines that comes with a high computational cost. In this work, we propose to exploit the existence of communities in complex networks to accelerate the mining of influential seeds. We provide intuitive reasoning to explain why our approach should be able to provide speedups without significantly degrading the extent of the spread of influence when compared to the case of influence maximization withoutmore » using the community information. Additionally, we have parallelized the complete workflow by leveraging an existing parallel implementation of the Louvain community detection algorithm. We then conduct a series of experiments on a dataset with three representative graphs to first verify our implementation and then demonstrate the speedups. Our method achieves speedups ranging from 3x - 28x for graphs with small number of communities while nearly matching or even exceeding the activation performance on the entire graph. Complexity analysis reveals that dramatic speedups are possible for larger graphs that contain a correspondingly larger number of communities. In addition to the speedups obtained from the utilization of the community structure, scalability results show up to 6.3x speedup on 20 cores relative to the baseline run on 2 cores. Finally, current limitations of the approach are outlined along with the planned next steps.« less

On the degree conjecture for separability of multipartite quantum states

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

Hassan, Ali Saif M.; Joag, Pramod S.

2008-01-15

We settle the so-called degree conjecture for the separability of multipartite quantum states, which are normalized graph Laplacians, first given by Braunstein et al. [Phys. Rev. A 73, 012320 (2006)]. The conjecture states that a multipartite quantum state is separable if and only if the degree matrix of the graph associated with the state is equal to the degree matrix of the partial transpose of this graph. We call this statement to be the strong form of the conjecture. In its weak version, the conjecture requires only the necessity, that is, if the state is separable, the corresponding degree matricesmore » match. We prove the strong form of the conjecture for pure multipartite quantum states using the modified tensor product of graphs defined by Hassan and Joag [J. Phys. A 40, 10251 (2007)], as both necessary and sufficient condition for separability. Based on this proof, we give a polynomial-time algorithm for completely factorizing any pure multipartite quantum state. By polynomial-time algorithm, we mean that the execution time of this algorithm increases as a polynomial in m, where m is the number of parts of the quantum system. We give a counterexample to show that the conjecture fails, in general, even in its weak form, for multipartite mixed states. Finally, we prove this conjecture, in its weak form, for a class of multipartite mixed states, giving only a necessary condition for separability.« less

Inertial stratification of an expanding highly ionized multicomponent plasma bunch

NASA Astrophysics Data System (ADS)

Kozhenkova, O. A.; Motorin, A. A.; Stupitskii, E. L.

2013-09-01

The initial composition of a four-component plasma bunch of a high specific energy has been determined, as well as its characteristics during the process of expansion. It is shown that the interaction of particles under a high energy is of the Coulomb character and this interaction is unable to ensure the same velocity of components with different atomic masses right from the very beginning of bunch expansion, leading to their radical stratification.

Application accelerator system having bunch control

DOEpatents

Wang, D.; Krafft, G.A.

1999-06-22

An application accelerator system for monitoring the gain of a free electron laser is disclosed. Coherent Synchrotron Radiation (CSR) detection techniques are used with a bunch length monitor for ultra short, picosec to several tens of femtosec, electron bunches. The monitor employs an application accelerator, a coherent radiation production device, an optical or beam chopping device, an infrared radiation collection device, a narrow-banding filter, an infrared detection device, and a control. 1 fig.

Analysis of multibunch free electron laser operation

NASA Astrophysics Data System (ADS)

Hellert, Thorsten; Decking, Winfried; Branlard, Julien

2017-09-01

At the SASE-FEL user facilities FLASH and European XFEL, superconducting TESLA type cavities are used for acceleration of the driving electron bunches. The high achievable duty cycle allows for operating with long bunch trains, hence considerably increasing the efficiency of the machine. However, multibunch free electron lasers (FEL) operation requires longitudinal and transverse stability within the bunch train. The purpose of this work is to investigate the intra-bunch-train transverse dynamics at FLASH and European XFEL. Key relationships of superconducting rf cavity operation and the resulting impact on the intrabunch-train trajectory variation are described. The observed trajectory variation during multibunch user runs at FLASH is analyzed and related to both, intrabunch-train variations of the rf and the following impact on the multibunch FEL performance.

Formation of space-charge bunches in a multivelocity-electron-beam-based microwave oscillator with a cathode unshielded from the magnetic field

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

Kalinin, Yu. A.; Starodubov, A. V.; Fokin, A. S., E-mail: alexander1989fokin@mail.ru

The influence of the magnitude and configuration of the magnetic field on the parameters of electron bunches formed in a multivelocity electron beam is analyzed. It is shown that the use of a cathode unshielded from the magnetic field and a nonuniform magnetic field increasing along the drift space enables the formation of compact electron bunches. The ratio between the current density in such bunches and the beam current density at the entrance to the drift space reaches 10{sup 6}, which results in a substantial broadening of the output microwave spectrum due to an increase in the amplitudes of themore » higher harmonics of the fundamental frequency.« less

Multi-Disciplinary Techniques for Understanding Time-Varying Space-Based Imagery.

DTIC Science & Technology

1985-05-10

problem, and I V WY" 3 discuss the impgrtage of this work to Air Force technology and to related Air Force programs. Section 1.5 provides a summary of...development of new algorithms and their realization in a hybrid optical/digital architecture. However, devices and architectures being developed in related ...and relate these representntions to object and surface contour properties of the scene. The techniques studied included Probabilistic Graph Matching

Run 16 Tandem gold performance in the injectors and possible improvement with AGS type 6:3:1 bunch merge in the Booster

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

Zeno, Keith

2016-10-21

During Run 16 the Tandem was used as the Gold pre-injector for a brief time so that RHIC could continue running while EBIS was down for repairs. Given the time constraints, the setup was largely derived from the EBIS Au setup. The EBIS Au setup used a 4:2:1 bunch merge in the Booster and a 12:6:2 bunch merge in the AGS.1 This note will describe the Tandem Au setup and compare it to that used for EBIS Au. The bunch merge in the Booster for Tandem Au did not work well, and it seems likely that the performance would’ve beenmore » significantly better if it did. An AGS type 6:3:1 merge in the Booster is described which might improve matters.2 Somewhat speculative estimates for the AGS bunch intensity and emittance, if that merge were successful in reducing the Booster extraction emittance to EBIS Au levels, are also given for several potential setups. Using 6 Booster loads from the Tandem, the AGS bunch intensity at extraction reached about 2.5e9 ions with a longitudinal emittance (ε) of about 0.59 eV·s/n.3 Using 12 Booster loads from EBIS, the peak bunch intensity and ε was about 3.1e9 ions and 0.75 eV·s/n, respectively. A 6.4 sec supercycle was used for both at the time, but the Tandem Au supercycle (barring any potential issues with Tandem) could probably have been reduced to about 4.6 sec.« less

Marathon: An Open Source Software Library for the Analysis of Markov-Chain Monte Carlo Algorithms

PubMed Central

Rechner, Steffen; Berger, Annabell

2016-01-01

We present the software library marathon, which is designed to support the analysis of sampling algorithms that are based on the Markov-Chain Monte Carlo principle. The main application of this library is the computation of properties of so-called state graphs, which represent the structure of Markov chains. We demonstrate applications and the usefulness of marathon by investigating the quality of several bounding methods on four well-known Markov chains for sampling perfect matchings and bipartite graphs. In a set of experiments, we compute the total mixing time and several of its bounds for a large number of input instances. We find that the upper bound gained by the famous canonical path method is often several magnitudes larger than the total mixing time and deteriorates with growing input size. In contrast, the spectral bound is found to be a precise approximation of the total mixing time. PMID:26824442

Method and tool for network vulnerability analysis

DOEpatents

Swiler, Laura Painton [Albuquerque, NM; Phillips, Cynthia A [Albuquerque, NM

2006-03-14

A computer system analysis tool and method that will allow for qualitative and quantitative assessment of security attributes and vulnerabilities in systems including computer networks. The invention is based on generation of attack graphs wherein each node represents a possible attack state and each edge represents a change in state caused by a single action taken by an attacker or unwitting assistant. Edges are weighted using metrics such as attacker effort, likelihood of attack success, or time to succeed. Generation of an attack graph is accomplished by matching information about attack requirements (specified in "attack templates") to information about computer system configuration (contained in a configuration file that can be updated to reflect system changes occurring during the course of an attack) and assumed attacker capabilities (reflected in "attacker profiles"). High risk attack paths, which correspond to those considered suited to application of attack countermeasures given limited resources for applying countermeasures, are identified by finding "epsilon optimal paths."

ELECTRON CLOUD OBSERVATIONS AND CURES IN RHIC

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

FISCHER,W.; BLASKIEWICZ, M.; HUANG, H.

Since 2001 RHIC has experienced electron cloud effects, which have limited the beam intensity. These include dynamic pressure rises - including pressure instabilities, tune shifts, a reduction of the stability threshold for bunches crossing the transition energy, and possibly incoherent emittance growth. We summarize the main observations in operation and dedicated experiments, as well as countermeasures including baking, NEG coated warm beam pipes, solenoids, bunch patterns, anti-grazing rings, pre-pumped cold beam pipes, scrubbing, and operation with long bunches.

Bunch length measurement at the Fermilab A0 photoinjector using a Martin-Puplett interferometer

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

Thurman-Keup, Randy; Fliller, Raymond Patrick; Kazakevich, Grigory

2008-05-01

We present preliminary measurements of the electron bunch lengths at the Fermilab A0 Photoinjector using a Martin-Puplett interferometer on loan from DESY. The photoinjector provides a relatively wide range of bunch lengths through laser pulse width adjustment and compression of the beam using a magnetic chicane. We present comparisons of data with simulations that account for diffraction distortions in the signal and discuss future plans for improving the measurement.

Destructive interferences results in bosons anti bunching: refining Feynman's argument

NASA Astrophysics Data System (ADS)

Marchewka, Avi; Granot, Er'el

2014-09-01

The effect of boson bunching is frequently mentioned and discussed in the literature. This effect is the manifestation of bosons tendency to "travel" in clusters. One of the core arguments for boson bunching was formulated by Feynman in his well-known lecture series and has been frequently used ever since. By comparing the scattering probabilities of two bosons and of two distinguishable particles, he concluded: "We have the result that it is twice as likely to find two identical Bose particles scattered into the same state as you would calculate assuming the particles were different" [R.P. Feynman, R.B. Leighton, M. Sands, The Feynman Lectures on Physics: Quantum mechanics (Addison-Wesley, 1965)]. This argument was rooted in the scientific community (see for example [C. Cohen-Tannoudji, B. Diu, F. Laloë, Quantum Mechanics (John Wiley & Sons, Paris, 1977); W. Pauli, Exclusion Principle and Quantum Mechanics, Nobel Lecture (1946)]), however, while this sentence is completely valid, as is proved in [C. Cohen-Tannoudji, B. Diu, F. Laloë, Quantum Mechanics (John Wiley & Sons, Paris, 1977)], it is not a synonym of bunching. In fact, as it is shown in this paper, wherever one of the wavefunctions has a zero, bosons can anti-bunch and fermions can bunch. It should be stressed that zeros in the wavefunctions are ubiquitous in Quantum Mechanics and therefore the effect should be common. Several scenarios are suggested to witness the effect.

A tunable electron beam source using trapping of electrons in a density down-ramp in laser wakefield acceleration.

PubMed

Ekerfelt, Henrik; Hansson, Martin; Gallardo González, Isabel; Davoine, Xavier; Lundh, Olle

2017-09-25

One challenge in the development of laser wakefield accelerators is to demonstrate sufficient control and reproducibility of the parameters of the generated bunches of accelerated electrons. Here we report on a numerical study, where we demonstrate that trapping using density down-ramps allows for tuning of several electron bunch parameters by varying the properties of the density down-ramp. We show that the electron bunch length is determined by the difference in density before and after the ramp. Furthermore, the transverse emittance of the bunch is controlled by the steepness of the ramp. Finally, the amount of trapped charge depends both on the density difference and on the steepness of the ramp. We emphasize that both parameters of the density ramp are feasible to vary experimentally. We therefore conclude that this tunable electron accelerator makes it suitable for a wide range of applications, from those requiring short pulse length and low emittance, such as the free-electron lasers, to those requiring high-charge, large-emittance bunches to maximize betatron X-ray generation.

Natural Fiber Cut Machine Semi-Automatic Linear Motion System for Empty Fiber Bunches: Re-designing for Local Use

NASA Astrophysics Data System (ADS)

Asfarizal; Kasim, Anwar; Gunawarman; Santosa

2017-12-01

Empty Palm bunches of fiber is local ingredient in Indonesia that easy to obtain. Empty Palm bunches of fiber can be obtained from the palm oil industry such as in West Pasaman. The character of the empty Palm bunches of fiber that is strong and pliable has high-potential for particle board. To transform the large quantities of fiber become particles in size 0-10 mm requires a specially designed cut machine. Therefore, the machine is designed in two-stage system that is mechanical system, structure and cutting knife. Components that have been made, assembled and then tested to reveal the ability of the machine to cut. The results showed that the straight back and forth motion cut machine is able to cut out the empty oil palm bunches of fiber with a length 0-1 cm, 2 cm, 8 cm and the surface of the cut is not stringy. The cutting capacity is at a length of 2 cm in the result 24.4 (kg/h) and 8 cm obtained results of up to 84 (kg/h)

Comparing the effect on the AGS longitudinal emittance of gold ions from the BtA stripping foil with and without a Booster Bunch Merge

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

Zeno, K.

The aim of this note to better understand the effect of merging the Gold bunches in the Booster into one on the resulting AGS longitudinal emittance as compared to not merging them. The reason it matters whether they are merged or not is because they pass through a stripping foil in the BtA line. Data was taken last run (Run 17) for the case where the bunches are not merged, and it will be compared with data from cases where the bunches are merged. Previous data from Tandem operation will also be considered. There are two main pieces to thismore » puzzle. The first is the ε growth associated with the energy spread due to ‘energy straggling’ in the BtA stripping foil and the second is the effective ε growth associated with the energy loss that occurs while passing through the foil. Both of these effects depend on whether or not the Booster bunches have been merged into one.« less

The CERN Large Hadron Collider as a tool to study high-energy density matter.

PubMed

Tahir, N A; Kain, V; Schmidt, R; Shutov, A; Lomonosov, I V; Gryaznov, V; Piriz, A R; Temporal, M; Hoffmann, D H H; Fortov, V E

2005-04-08

The Large Hadron Collider (LHC) at CERN will generate two extremely powerful 7 TeV proton beams. Each beam will consist of 2808 bunches with an intensity per bunch of 1.15x10(11) protons so that the total number of protons in one beam will be about 3x10(14) and the total energy will be 362 MJ. Each bunch will have a duration of 0.5 ns and two successive bunches will be separated by 25 ns, while the power distribution in the radial direction will be Gaussian with a standard deviation, sigma=0.2 mm. The total duration of the beam will be about 89 mus. Using a 2D hydrodynamic code, we have carried out numerical simulations of the thermodynamic and hydrodynamic response of a solid copper target that is irradiated with one of the LHC beams. These calculations show that only the first few hundred proton bunches will deposit a high specific energy of 400 kJ/g that will induce exotic states of high energy density in matter.

Generation and Characterization of Electron Bunches with Ramped Current Profiles in a Dual-Frequency Superconducting Linear Accelerator

DOE PAGES

Piot, P.; Behrens, C.; Gerth, C.; ...

2011-09-07

We report on the successful experimental generation of electron bunches with ramped current profiles. The technique relies on impressing nonlinear correlations in the longitudinal phase space using a superconducing radiofrequency linear accelerator operating at two frequencies and a current-enhancing dispersive section. The produced {approx} 700-MeV bunches have peak currents of the order of a kilo-Ampere. Data taken for various accelerator settings demonstrate the versatility of the method and in particular its ability to produce current profiles that have a quasi-linear dependency on the longitudinal (temporal) coordinate. The measured bunch parameters are shown, via numerical simulations, to produce gigavolt-per-meter peak acceleratingmore » electric fields with transformer ratios larger than 2 in dielectric-lined waveguides.« less

Beam dynamics issues in linear colliders

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

Seeman, J.T.

1989-06-01

The primary goal of present and future linear colliders is to maximize the integrated luminosity for the experimental program. Beam dynamics plays a central role in the maximization of integrated luminosity. It is the major issue in the production of small beam sizes and low experimental backgrounds and is also an important factor in the production of particle numbers, in the acceleration process, and in the number of bunches. The beam dynamics effects on bunches which are extracted from the damping rings, accelerated in the linac, collimated, momentum analyzed, and finally delivered to the final focus are reviewed. The effectsmore » of bunch compression, transverse and longitudinal wakefields, BNS damping, energy definition, dispersion, emittance, bunch aspect ratio, feedback, and stability are all important. 11 refs., 1 tab.« less

Method and apparatus for control of coherent synchrotron radiation effects during recirculation with bunch compression

DOEpatents

Douglas, David R; Tennant, Christopher

2015-11-10

A modulated-bending recirculating system that avoids CSR-driven breakdown in emittance compensation by redistributing the bending along the beamline. The modulated-bending recirculating system includes a) larger angles of bending in initial FODO cells, thereby enhancing the impact of CSR early on in the beam line while the bunch is long, and 2) a decreased bending angle in the final FODO cells, reducing the effect of CSR while the bunch is short. The invention describes a method for controlling the effects of CSR during recirculation and bunch compression including a) correcting chromatic aberrations, b) correcting lattice and CSR-induced curvature in the longitudinal phase space by compensating T.sub.566, and c) using lattice perturbations to compensate obvious linear correlations x-dp/p and x'-dp/p.

Bunching phase and constraints on echo enabled harmonic generation

NASA Astrophysics Data System (ADS)

Hemsing, E.

2018-05-01

A simple mathematical description is developed for the bunching spectrum in echo enabled harmonic generation (EEHG) that incorporates the effect of additional electron beam energy modulations. Under common assumptions, they are shown to contribute purely through the phase of the longitudinal bunching factor, which allows the spectral moments of the bunching to be calculated directly from the known energy modulations. In particular, the second moment (spectral bandwidth) serves as simple constraint on the amplitude of the energy modulations to maintain a transform-limited seed. We show that, in general, the impact on the spectrum of energy distortions that develop between the EEHG chicanes scales like the harmonic number compared to distortions that occur upstream. This may limit the parameters that will allow EEHG to reach short wavelengths in high brightness FELs.

Effects of the quadrupole wakefields in a passive streaker

DOE PAGES

Craievich, Paolo; Lutman, Alberto A.

2016-10-05

A novel method based on transverse wakefields has been recently proposed to characterize the temporal profile of a relativistic electron bunch. The electron bunch is streaked by the interaction with the transverse wakefield excited when the electrons travel off-axis in a device called the passive streaker. Furthermore, for the large transverse off-axis offsets required to effectively streak the electron bunch, higher order modes can be excited. The time-dependent quadrupole wakefield of the dielectric-lined structure can cause a significant enlargement of the transverse profile at the screen. Consequently, the measurement resolution is decreased also at the bunch tail. We report onmore » how the temporal profile can be effectively reconstructed also including the defocusing effect for a given transverse beam distribution at the passive streaker.« less

Time domain analysis of coherent terahertz synchrotron radiation

NASA Astrophysics Data System (ADS)

Hübers, H.-W.; Semenov, A.; Holldack, K.; Schade, U.; Wüstefeld, G.; Gol'tsman, G.

2005-10-01

The time structure of coherent terahertz synchrotron radiation at the electron storage ring of the Berliner Elektronensynchrotron und Speicherring Gesellschaft has been analyzed with a fast superconducting hot-electron bolometer. The emission from a single bunch of electrons was found to last ˜1500ps at frequencies around 0.4THz, which is much longer than the length of an electron bunch in the time domain (˜5ps). It is suggested that this is caused by multiple reflections at the walls of the beam line. The quadratic increase of the power with the number of electrons in the bunch as predicted for coherent synchrotron radiation and the transition from stable to bursting radiation were determined from a single storage ring fill pattern of bunches with different populations.

Generation and characterization of electron bunches with ramped current profiles in a dual-frequency superconducting linear accelerator.

PubMed

Piot, P; Behrens, C; Gerth, C; Dohlus, M; Lemery, F; Mihalcea, D; Stoltz, P; Vogt, M

2012-01-20

We report on the successful experimental generation of electron bunches with ramped current profiles. The technique relies on impressing nonlinear correlations in the longitudinal phase space using a superconducing radio frequency linear accelerator operating at two frequencies and a current-enhancing dispersive section. The produced ~700-MeV bunches have peak currents of the order of a kilo-Ampère. Data taken for various accelerator settings demonstrate the versatility of the method and, in particular, its ability to produce current profiles that have a quasilinear dependency on the longitudinal (temporal) coordinate. The measured bunch parameters are shown, via numerical simulations, to produce gigavolt-per-meter peak accelerating electric fields with transformer ratios larger than 2 in dielectric-lined waveguides. © 2012 American Physical Society

METHOD AND APPARATUS FOR INJECTING AND TRAPPING ELECTRONS IN A MAGNETIC FIELD

DOEpatents

Christofilos, N.C.

1962-05-29

An apparatus is designed for the manipulation of electrons in an exially symmetric magnetic field region and may be employed to trap electrons in such a field by directing an electron beam into a gradientially intensified field region therein to form an annular electron moving axially in the field and along a decreasing field gradient. Dissipative loop circuits such as resistive loops are disposed along at least the decreasing field gradient so as to be inductively coupled to the electron bunch so as to extract energy of the electron bunch and provide a braking force effective to reduce the velocity of the bunch. Accordingly, the electron bunch upon entering a lower intensity magnetic field region is retained therein since the electrons no longer possess sufficient energy to escape. (AEC)

Challenges and Plans for the Proton Injectors

NASA Astrophysics Data System (ADS)

Garoby, R.

The flexibility of the LHC injectors combined with multiple longitudinal beam gymnastics have significantly contributed to the excellent performance of the LHC during its first run, delivering beam with twice the ultimate brightness with 50 ns bunch spacing. To meet the requirements of the High Luminosity LHC, 25 ns bunch spacing is required, the intensity per bunch at injection has to double and brightness shall almost triple. Extensive hardware modifications or additions are therefore necessary in all accelerators of the injector complex, as well as new beam gymnastics.

Modelling and measurements of bunch profiles at the LHC

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

Papadopoulou, S.; Antoniou, F.; Argyropoulos, T.

The bunch profiles in the LHC are often observed to be non-Gaussian, both at Flat Bottom (FB) and Flat Top (FT) energies. Especially at FT, an evolution of the tail population in time is observed. In this respect, the Monte-Carlo Software for IBS and Radiation effects (SIRE) is used to track different types of beam distributions. The impact of the distribution shape on the evolution of bunch characteristics is studied. The results are compared with observations from the LHC Run 2 data.

SDIA: A dynamic situation driven information fusion algorithm for cloud environment

NASA Astrophysics Data System (ADS)

Guo, Shuhang; Wang, Tong; Wang, Jian

2017-09-01

Information fusion is an important issue in information integration domain. In order to form an extensive information fusion technology under the complex and diverse situations, a new information fusion algorithm is proposed. Firstly, a fuzzy evaluation model of tag utility was proposed that can be used to count the tag entropy. Secondly, a ubiquitous situation tag tree model is proposed to define multidimensional structure of information situation. Thirdly, the similarity matching between the situation models is classified into three types: the tree inclusion, the tree embedding, and the tree compatibility. Next, in order to reduce the time complexity of the tree compatible matching algorithm, a fast and ordered tree matching algorithm is proposed based on the node entropy, which is used to support the information fusion by ubiquitous situation. Since the algorithm revolve from the graph theory of disordered tree matching algorithm, it can improve the information fusion present recall rate and precision rate in the situation. The information fusion algorithm is compared with the star and the random tree matching algorithm, and the difference between the three algorithms is analyzed in the view of isomorphism, which proves the innovation and applicability of the algorithm.

SIMULATIONS OF TRANSVERSE STACKING IN THE NSLS-II BOOSTER

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

Fliller III, R.; Shaftan, T.

2011-03-28

The NSLS-II injection system consists of a 200 MeV linac and a 3 GeV booster. The linac needs to deliver 15 nC in 80 - 150 bunches to the booster every minute to achieve current stability goals in the storage ring. This is a very stringent requirement that has not been demonstrated at an operating light source. We have developed a scheme to transversely stack two bunch trains in the NSLS-II booster in order to alleviate the charge requirements on the linac. This scheme has been outlined previously. In this paper we show particle tracking simulations of the tracking scheme.more » We show simulations of the booster ramp with a stacked beam for a variety of lattice errors and injected beam parameters. In all cases the performance of the proposed stacking method is sufficient to reduce the required charge from the linac. For this reason the injection system of the NSLS-II booster is being designed to include this feature. The NSLS-II injection system consists of a 200 MeV linac and a 3 GeV booster. The injectors must provide 7.5nC in bunch trains 80-150 bunches long every minute for top off operation of the storage ring. Top off then requires that the linac deliver 15nC of charge once losses in the injector chain are taken into consideration. This is a very stringent requirement that has not been demonstrated at an operating light source. For this reason we have developed a method to transversely stack two bunch trains in the booster while maintaining the charge transport efficiency. This stacking scheme has been discussed previously. In this paper we show the simulations of the booster ramp with a single bunch train in the booster. Then we give a brief overview of the stacking scheme. Following, we show the results of stacking two bunch trains in the booster with varying beam emittances and train separations. The behavior of the beam through the ramp is examined showing that it is possible to stack two bunch trains in the booster.« less

Roosevelt Hot Springs, Utah FORGE Stress Logging Data

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

McLennan, John

This spreadsheet consist of data and graphs from deep well 58-32 stress testing from 6900 - 7500 ft depth. Measured stress data were used to correct logging predictions of in situ stress. Stress plots shows pore pressure (measured during the injection testing), the total vertical in situ stress (determined from the density logging) and the total maximum and minimum horizontal stresses. The horizontal stresses were determined from the DSI (Dipole Sonic Imager) and corrected to match the direct measurements.

Optimizing graph-based patterns to extract biomedical events from the literature

PubMed Central

2015-01-01

In BioNLP-ST 2013 We participated in the BioNLP 2013 shared tasks on event extraction. Our extraction method is based on the search for an approximate subgraph isomorphism between key context dependencies of events and graphs of input sentences. Our system was able to address both the GENIA (GE) task focusing on 13 molecular biology related event types and the Cancer Genetics (CG) task targeting a challenging group of 40 cancer biology related event types with varying arguments concerning 18 kinds of biological entities. In addition to adapting our system to the two tasks, we also attempted to integrate semantics into the graph matching scheme using a distributional similarity model for more events, and evaluated the event extraction impact of using paths of all possible lengths as key context dependencies beyond using only the shortest paths in our system. We achieved a 46.38% F-score in the CG task (ranking 3rd) and a 48.93% F-score in the GE task (ranking 4th). After BioNLP-ST 2013 We explored three ways to further extend our event extraction system in our previously published work: (1) We allow non-essential nodes to be skipped, and incorporated a node skipping penalty into the subgraph distance function of our approximate subgraph matching algorithm. (2) Instead of assigning a unified subgraph distance threshold to all patterns of an event type, we learned a customized threshold for each pattern. (3) We implemented the well-known Empirical Risk Minimization (ERM) principle to optimize the event pattern set by balancing prediction errors on training data against regularization. When evaluated on the official GE task test data, these extensions help to improve the extraction precision from 62% to 65%. However, the overall F-score stays equivalent to the previous performance due to a 1% drop in recall. PMID:26551594

Calculations of the conditions for bunch leakage in the Los Alamos proton storage ring

NASA Astrophysics Data System (ADS)

Neuffer, D.; Ohmori, C.

1994-04-01

Observations are consistent with the possibility of an "ep" instability in the Los Alamos Proton Storage Ring (PSR) with both bunched and unbunched beam. The instability requires electrons to be trapped within the beam, and calculations have shown that such trapping requires leakage of beam into the interbunch gap. Observationally, leakage of beam into the gap appears necessary for the onset of the instability. In this paper we present results of studies of the longitudinal beam dynamics at PSR parameters. The studies indicate that the combined effects of the rf buncher, longitudinal space charge, and injection mismatch are sufficient to cause the observed bunch leakage. Simulation results are presented and compared with PSR observations. Variations of PSR performance parameters are considered, and methods of improving bunch confinement are suggested and studied.

Successful Beam-Beam Tuneshift Compensation

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

Bishofberger, Kip Aaron

2005-01-01

The performance of synchrotron colliders has been limited by the beam-beam limit, a maximum tuneshift that colliding bunches could sustain. Due to bunch-to-bunch tune variation and intra-bunch tune spread, larger tuneshifts produce severe emittance growth. Breaking through this constraint has been viewed as impossible for several decades. This dissertation introduces the physics of ultra-relativistic synchrotrons and low-energy electron beams, with emphasis placed on the limits of the Tevatron and the needs of a tuneshift-compensation device. A detailed analysis of the Tevatron Electron Lens (T EL) is given, comparing theoretical models to experimental data whenever possible. Finally, results of Tevatron operationsmore » with inclusion of the T EL are presented and analyzed. It is shown that the T EL provides a way to shatter the previously inescapable beam-beam limit.« less

Asymmetric linear efficiency and bunching mechanisms of TM modes for electron cyclotron maser

NASA Astrophysics Data System (ADS)

Chang, T. H.; Huang, W. C.; Yao, H. Y.; Hung, C. L.; Chen, W. C.; Su, B. Y.

2017-02-01

This study examines the transverse magnetic (TM) waveguide modes, which have long been considered as the unsuitable ones for the operation of the electron cyclotron maser. The beam-wave coupling strength of the TM modes, as expected, is found to be relatively weak as compared with that of the transverse electric (TE) waveguide modes. Unlike TE modes, surprisingly, the linear behavior of the TM modes depends on the sign of the wave number kz. The negative kz has a much stronger linear efficiency than that of the positive kz. The bunching mechanism analysis further exhibits that the azimuthal bunching and axial bunching do not compete but cooperate with each other for the backward-wave operation (negative kz). The current findings are encouraging and imply that TM modes might be advantageous to the gyrotron backward-wave oscillators.

Transverse mode coupling instability threshold with space charge and different wakefields

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

Balbekov, V.

Transverse mode coupling instability of a bunch with space charge and wake field is considered in frameworks of the boxcar model. Eigenfunctions of the bunch without wake are used as the basis for solution of the equations with the wake field included. Dispersion equation for the bunch eigentunes is obtained in the form of an infinite continued fraction. It is shown that influence of space charge on the instability essentially depends on the wake sign. In particular, threshold of the negative wake increases in absolute value until the space charge tune shift is rather small, and goes to zero atmore » higher space charge. The explanation of this behavior is developed by analysis of the bunch spectrum. As a result, a comparison of the results with published articles is represented.« less

Transverse mode coupling instability threshold with space charge and different wakefields

DOE PAGES

Balbekov, V.

2017-03-10

Transverse mode coupling instability of a bunch with space charge and wake field is considered in frameworks of the boxcar model. Eigenfunctions of the bunch without wake are used as the basis for solution of the equations with the wake field included. Dispersion equation for the bunch eigentunes is obtained in the form of an infinite continued fraction. It is shown that influence of space charge on the instability essentially depends on the wake sign. In particular, threshold of the negative wake increases in absolute value until the space charge tune shift is rather small, and goes to zero atmore » higher space charge. The explanation of this behavior is developed by analysis of the bunch spectrum. As a result, a comparison of the results with published articles is represented.« less

Analysis of coupled-bunch instabilities for the NSLS-II storage ring with a 500MHz 7-cell PETRA-III cavity

DOE PAGES

Bassi, G.; Blednykh, A.; Cheng, W.; ...

2015-12-11

We present the NSLS-II storage ring that is designed to operate with superconducting RF-cavities with the aim to store an average current of 500 mA distributed in 1080 bunches, with a gap in the uniform filling for ion clearing. At the early stage of the commissioning (phase 1), characterized by a bare lattice without damping wigglers and without Landau cavities, a normal conducting 7-cell PETRA-III RF-cavity structure has been installed with the goal to store an average current of 25 mA. In this paper we discuss our analysis of coupled-bunch instabilities driven by the Higher Order Modes (HOMs) of themore » 7-cell PETRA-III RF-cavity. As a cure of the instabilities, we apply a well-known scheme based on a proper detuning of the HOMs frequencies based upon cavity temperature change, and the use of the beneficial effect of the slow head–tail damping at positive chromaticity to increase the transverse coupled-bunch instability thresholds. In addition, we discuss measurements of coupled-bunch instabilities observed during the phase 1 commissioning of the NSLS-II storage ring. In our analysis we rely, in the longitudinal case, on the theory of coupled-bunch instability for uniform fillings, while in the transverse case we complement our studies with numerical simulations with OASIS, a novel parallel particle tracking code for self-consistent simulations of collective effects driven by short and long-range wakefields.« less

Coherent Synchrotron Radiation for Rotational Spectroscopy: Application to the Rotational Spectrum of Propynal in the 200-750 GHz Range

NASA Astrophysics Data System (ADS)

Barros, J.; Roy, P.; Appadoo, D.; Naughton, D. Mc; Robertson, E.; Manceron, L.

2013-06-01

In storage rings, short electron bunches can produce an intense THz radiation called Coherent Synchrotron Radiation (CSR). The flux of this emission between 250 and 750 GHz (in the mW range, up the 10000 times the regular synchrotron emission) is very advantageous for broad band absorption spectroscopy, using interferometric techniques. This source is, however, inherently difficult to stabilize, and intensity fluctuations lead to artifacts on the FT-based measurements, which strongly limit the use of CSR in particular for high-resolution measurements. At SOLEIL however, by screening different currents and bunch lengths, we defined stable CSR conditions for which the signal-to-noise ratio (S/N) allows for measurements at high resolution. Moreover, we developed an artifact correction system, based on a simultaneous detection of the input and the output signals of the interferometer, which allows to further improve the S/N. For this purpose, the optics and electronics of two bolometers were matched. The stable CSR combined with this ingenious technique allowed us to record for the first time high-resolution FT spectra in the sub-THz range, with a S/N of 100 in a few hours. This enables many applications such as broadband rotational spectra in the THz range, studies of molecules with low frequency torsional modes, absolute intensities determinations, or studies of unstable species. Results obtained on Propynal illustrate these possibilities and enabled to improve significantly the ground state spectroscopic constants.

Injector Design for a Model Electron Ring at the University of Maryland

NASA Astrophysics Data System (ADS)

Godlove, T.; Bernal, S.; Deng, J. J.; Li, Y.; Reiser, M.; Wang, J. G.; Zou, Y.

1997-05-01

A model electron recirculator is being developed at the University of Maryland. It employs a 10-keV, space-charge-dominated beam injected into a 1.8-m radius ring equipped with a strong-focusing lattice based on printed-circuit quadrupoles and dipoles. The motivation and general features are described in separate papers. Here we describe the design for injecting a single-turn bunch into the ring. The system includes a low-emittance e-gun, matching section, pulsed dipole and Panofsky quadrupole. The dipole at the injection point must deflect the beam -10^circ during entry and +10^circ after entry, with about 25 ns transition time. The Panofsky quadrupole must be off during entry and on for subsequent laps, with a similar rise time.

Adjustment Costs, Firm Responses, and Micro vs. Macro Labor Supply Elasticities: Evidence from Danish Tax Records*

PubMed Central

Chetty, Raj; Friedman, John N.; Olsen, Tore; Pistaferri, Luigi

2011-01-01

We show that the effects of taxes on labor supply are shaped by interactions between adjustment costs for workers and hours constraints set by firms. We develop a model in which firms post job offers characterized by an hours requirement and workers pay search costs to find jobs. We present evidence supporting three predictions of this model by analyzing bunching at kinks using Danish tax records. First, larger kinks generate larger taxable income elasticities. Second, kinks that apply to a larger group of workers generate larger elasticities. Third, the distribution of job offers is tailored to match workers' aggregate tax preferences in equilibrium. Our results suggest that macro elasticities may be substantially larger than the estimates obtained using standard microeconometric methods. PMID:21836746

Ontology Design of Influential People Identification Using Centrality

NASA Astrophysics Data System (ADS)

Maulana Awangga, Rolly; Yusril, Muhammad; Setyawan, Helmi

2018-04-01

Identifying influential people as a node in a graph theory commonly calculated by social network analysis. The social network data has the user as node and edge as relation forming a friend relation graph. This research is conducting different meaning of every nodes relation in the social network. Ontology was perfect match science to describe the social network data as conceptual and domain. Ontology gives essential relationship in a social network more than a current graph. Ontology proposed as a standard for knowledge representation for the semantic web by World Wide Web Consortium. The formal data representation use Resource Description Framework (RDF) and Web Ontology Language (OWL) which is strategic for Open Knowledge-Based website data. Ontology used in the semantic description for a relationship in the social network, it is open to developing semantic based relationship ontology by adding and modifying various and different relationship to have influential people as a conclusion. This research proposes a model using OWL and RDF for influential people identification in the social network. The study use degree centrality, between ness centrality, and closeness centrality measurement for data validation. As a conclusion, influential people identification in Facebook can use proposed Ontology model in the Group, Photos, Photo Tag, Friends, Events and Works data.

A two-step method for retrieving the longitudinal profile of an electron bunch from its coherent radiation

NASA Astrophysics Data System (ADS)

Pelliccia, Daniele; Sen, Tanaji

2014-11-01

The coherent radiation emitted by an electron bunch provides a diagnostic signal that can be used to estimate its longitudinal distribution. Commonly only the amplitude of the intensity spectrum can be measured and the associated phase must be calculated to obtain the bunch profile. Very recently an iterative method was proposed to retrieve this phase. However ambiguities associated with non-uniqueness of the solution are always present in the phase retrieval procedure. Here we present a method to overcome the ambiguity problem by first performing multiple independent runs of the phase retrieval procedure and then second, sorting the good solutions by means of cross-correlation analysis. Results obtained with simulated bunches of various shapes and experimental measured spectra are presented, discussed and compared with the established Kramers-Kronig method. It is shown that even when the effect of the ambiguities is strong, as is the case for a double peak in the profile, the cross-correlation post-processing is able to filter out unwanted solutions. We show that, unlike the Kramers-Kronig method, the combined approach presented is able to faithfully reconstruct complicated bunch profiles.

LIGHT - from laser ion acceleration to future applications

NASA Astrophysics Data System (ADS)

Roth, Markus; Light Collaboration

2013-10-01

Creation of high intensity multi-MeV ion bunches by high power lasers became a reliable tool during the last 15 years. The laser plasma source provides for TV/m accelerating field gradients and initially sub-ps bunch lengths. However, the large envelope divergence and the continuous exponential energy spectrum are substential drawbacks for many possible applications. To face this problem, the LIGHT collaboration was founded (Laser Ion Generation, Handling and Transport). The collaboration consists of several university groups and research centers, namely TU Darmstadt, JWGU Frankfurt, HI Jena, HZDR Dresden and GSI Darmstadt. The central goal is building a test beamline for merging laser ion acceleration with conventional accelerator infrastructure at the GSI facility. In the latest experiments, low divergent proton bunches with a central energy of up to 10 MeV and containing >109 particles could be provided at up to 2.2 m behind the plasma source, using a pulsed solenoid. In a next step, a radiofrequency cavity will be added to the beamline for phase rotation of these bunches, giving access to sub-ns bunch lengths and reaching highest intensities. An overview of the LIGHT objectives and the recent experimental results will be given. This work was supported by HIC4FAIR.

Transparent lattice characterization with gated turn-by-turn data of diagnostic bunch train

NASA Astrophysics Data System (ADS)

Li, Yongjun; Cheng, Weixing; Ha, Kiman; Rainer, Robert

2017-11-01

Methods of characterization of a storage ring's lattice have traditionally been intrusive to routine operations. More importantly, the lattice seen by particles can drift with the beam current due to collective effects. To circumvent this, we have developed a novel approach for dynamically characterizing a storage ring's lattice that is transparent to operations. Our approach adopts a dedicated filling pattern which has a short, separate diagnostic bunch train (DBT). Through the use of a bunch-by-bunch feedback system, the DBT can be selectively excited on demand. Gated functionality of a beam position monitor system is capable of collecting turn-by-turn data of the DBT, from which the lattice can then be characterized after excitation. As the DBT comprises only about one percent of the total operational bunches, the effects of its excitation are negligible to users. This approach allows us to localize the distributed quadrupolar wakefields generated in the storage ring vacuum chamber during beam accumulation. While effectively transparent to operations, our approach enables us to dynamically control the beta beat and phase beat, and unobtrusively optimize performance of the National Synchrotron Light Source-II accelerator during routine operations.

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

Evtushenko, Pavel E.; Klopf, John M.

Frequency domain measurements with Martin-Puplett interferometer is one of a few techniques capable of bunch length measurements at the level of ~ 100 fs. As the bunch length becomes shorter, it is important to know and be able to measure the limitations of the instrument in terms of shortest measurable bunch length. In this paper we describe an experiment using a blackbody source with the modified Martin-Puplett interferometer that is routine- ly used for bunch length measurements at the JLab FEL, as a way to estimate the shortest, measurable bunch length. The limitation comes from high frequency cut-off of themore » wire-grid polarizer currently used and is estimated to be 50 fs RMS. The measurements are made with the same Golay cell detector that is used for beam measure- ments. We demonstrate that, even though the blackbody source is many orders of magnitude less bright than the coherent transition or synchrotron radiation, it can be used for the measurements and gives a very good signal to noise ratio in combination with lock-in detection. We also compare the measurements made in air and in vacuum to characterize the very strong effect of the atmospheric absorption.« less

Experimental evidence of ion-induced instabilities in the NSLS-II storage ring

DOE PAGES

Cheng, Weixing; Li, Yongjun; Podobedov, Boris

2017-03-12

Fast ion instability has been identified as one of the most prominent instabilities in the recently constructed NSLS-II storage ring at Brookhaven National Laboratory. At a relatively low beam current (~ 25 mA) multi-bunch fills, ion-induced instabilities have already been observed during the early stages of machine commissioning. At present user operation with 250 mA in ~1000 bunches, the fast ion still remains the dominant instability, even after months of vacuum conditioning at high current. Ion-induced dipole motions of the electron beam have been suppressed using the transverse bunch-by-bunch (BxB) feedback system. However other adverse effects of this instability, suchmore » as the vertical beam size increase along the bunch train cannot be cured by the feedback system. Therefore, to achieve the NSLS-II design current of 500 mA while maintaining a small vertical beam emittance, it is important to further understand the fast ion instability and develop mitigation techniques. This paper reports on a series of ion-instability observations at various fill patterns and beam currents using start-of-art NSLS-II diagnostic tools.« less

Experimental evidence of ion-induced instabilities in the NSLS-II storage ring

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

Cheng, Weixing; Li, Yongjun; Podobedov, Boris

Fast ion instability has been identified as one of the most prominent instabilities in the recently constructed NSLS-II storage ring at Brookhaven National Laboratory. At a relatively low beam current (~ 25 mA) multi-bunch fills, ion-induced instabilities have already been observed during the early stages of machine commissioning. At present user operation with 250 mA in ~1000 bunches, the fast ion still remains the dominant instability, even after months of vacuum conditioning at high current. Ion-induced dipole motions of the electron beam have been suppressed using the transverse bunch-by-bunch (BxB) feedback system. However other adverse effects of this instability, suchmore » as the vertical beam size increase along the bunch train cannot be cured by the feedback system. Therefore, to achieve the NSLS-II design current of 500 mA while maintaining a small vertical beam emittance, it is important to further understand the fast ion instability and develop mitigation techniques. This paper reports on a series of ion-instability observations at various fill patterns and beam currents using start-of-art NSLS-II diagnostic tools.« less