Science.gov

Sample records for parallel direct search

  1. Parallel solver for trajectory optimization search directions

    NASA Technical Reports Server (NTRS)

    Psiaki, M. L.; Park, K. H.

    1992-01-01

    A key algorithmic element of a real-time trajectory optimization hardware/software implementation is presented, the search step solver. This is one piece of an algorithm whose overall goal is to make nonlinear trajectory optimization fast enough to provide real-time commands during guidance of a vehicle such as an aeromaneuvering orbiter or the National Aerospace Plane. Many methods of nonlinear programming require the solution of a quadratic program (QP) at each iteration to determine the search step. In the trajectory optimization case, the QP has a special dynamic programming structure. The algorithm exploits this special structure with a divide- and conquer type of parallel implementation. The algorithm solves a (p.N)-stage problem on N processors in O(p + log2 N) operations. The algorithm yields a factor of 8 speed-up over the fastest known serial algorithm when solving a 1024-stage test problem on 32 processors.

  2. Efficiency of parallel direct optimization.

    PubMed

    Janies, D A; Wheeler, W C

    2001-03-01

    Tremendous progress has been made at the level of sequential computation in phylogenetics. However, little attention has been paid to parallel computation. Parallel computing is particularly suited to phylogenetics because of the many ways large computational problems can be broken into parts that can be analyzed concurrently. In this paper, we investigate the scaling factors and efficiency of random addition and tree refinement strategies using the direct optimization software, POY, on a small (10 slave processors) and a large (256 slave processors) cluster of networked PCs running LINUX. These algorithms were tested on several data sets composed of DNA and morphology ranging from 40 to 500 taxa. Various algorithms in POY show fundamentally different properties within and between clusters. All algorithms are efficient on the small cluster for the 40-taxon data set. On the large cluster, multibuilding exhibits excellent parallel efficiency, whereas parallel building is inefficient. These results are independent of data set size. Branch swapping in parallel shows excellent speed-up for 16 slave processors on the large cluster. However, there is no appreciable speed-up for branch swapping with the further addition of slave processors (>16). This result is independent of data set size. Ratcheting in parallel is efficient with the addition of up to 32 processors in the large cluster. This result is independent of data set size. PMID:12240679

  3. Efficiency of parallel direct optimization

    NASA Technical Reports Server (NTRS)

    Janies, D. A.; Wheeler, W. C.

    2001-01-01

    Tremendous progress has been made at the level of sequential computation in phylogenetics. However, little attention has been paid to parallel computation. Parallel computing is particularly suited to phylogenetics because of the many ways large computational problems can be broken into parts that can be analyzed concurrently. In this paper, we investigate the scaling factors and efficiency of random addition and tree refinement strategies using the direct optimization software, POY, on a small (10 slave processors) and a large (256 slave processors) cluster of networked PCs running LINUX. These algorithms were tested on several data sets composed of DNA and morphology ranging from 40 to 500 taxa. Various algorithms in POY show fundamentally different properties within and between clusters. All algorithms are efficient on the small cluster for the 40-taxon data set. On the large cluster, multibuilding exhibits excellent parallel efficiency, whereas parallel building is inefficient. These results are independent of data set size. Branch swapping in parallel shows excellent speed-up for 16 slave processors on the large cluster. However, there is no appreciable speed-up for branch swapping with the further addition of slave processors (>16). This result is independent of data set size. Ratcheting in parallel is efficient with the addition of up to 32 processors in the large cluster. This result is independent of data set size. c2001 The Willi Hennig Society.

  4. Hybrid Optimization Parallel Search PACKage

    SciTech Connect

    2009-11-10

    HOPSPACK is open source software for solving optimization problems without derivatives. Application problems may have a fully nonlinear objective function, bound constraints, and linear and nonlinear constraints. Problem variables may be continuous, integer-valued, or a mixture of both. The software provides a framework that supports any derivative-free type of solver algorithm. Through the framework, solvers request parallel function evaluation, which may use MPI (multiple machines) or multithreading (multiple processors/cores on one machine). The framework provides a Cache and Pending Cache of saved evaluations that reduces execution time and facilitates restarts. Solvers can dynamically create other algorithms to solve subproblems, a useful technique for handling multiple start points and integer-valued variables. HOPSPACK ships with the Generating Set Search (GSS) algorithm, developed at Sandia as part of the APPSPACK open source software project.

  5. Hybrid Optimization Parallel Search PACKage

    Energy Science and Technology Software Center (ESTSC)

    2009-11-10

    HOPSPACK is open source software for solving optimization problems without derivatives. Application problems may have a fully nonlinear objective function, bound constraints, and linear and nonlinear constraints. Problem variables may be continuous, integer-valued, or a mixture of both. The software provides a framework that supports any derivative-free type of solver algorithm. Through the framework, solvers request parallel function evaluation, which may use MPI (multiple machines) or multithreading (multiple processors/cores on one machine). The framework providesmore »a Cache and Pending Cache of saved evaluations that reduces execution time and facilitates restarts. Solvers can dynamically create other algorithms to solve subproblems, a useful technique for handling multiple start points and integer-valued variables. HOPSPACK ships with the Generating Set Search (GSS) algorithm, developed at Sandia as part of the APPSPACK open source software project.« less

  6. Circuit Optimization Using Efficient Parallel Pattern Search 

    E-print Network

    Narasimhan, Srinath S.

    2011-08-08

    evaluations and difficulty in getting explicit sensitivity information make these problems intractable to standard optimization methods. We propose to explore the recently developed asynchronous parallel pattern search (APPS) method for efficient driver size...

  7. Parallelizing alternating direction implicit solver on GPUs

    Technology Transfer Automated Retrieval System (TEKTRAN)

    We present a parallel Alternating Direction Implicit (ADI) solver on GPUs. Our implementation significantly improves existing implementations in two aspects. First, we address the scalability issue of existing Parallel Cyclic Reduction (PCR) implementations by eliminating their hardware resource con...

  8. Parallelized direct execution simulation of message-passing parallel programs

    NASA Technical Reports Server (NTRS)

    Dickens, Phillip M.; Heidelberger, Philip; Nicol, David M.

    1994-01-01

    As massively parallel computers proliferate, there is growing interest in findings ways by which performance of massively parallel codes can be efficiently predicted. This problem arises in diverse contexts such as parallelizing computers, parallel performance monitoring, and parallel algorithm development. In this paper we describe one solution where one directly executes the application code, but uses a discrete-event simulator to model details of the presumed parallel machine such as operating system and communication network behavior. Because this approach is computationally expensive, we are interested in its own parallelization specifically the parallelization of the discrete-event simulator. We describe methods suitable for parallelized direct execution simulation of message-passing parallel programs, and report on the performance of such a system, Large Application Parallel Simulation Environment (LAPSE), we have built on the Intel Paragon. On all codes measured to date, LAPSE predicts performance well typically within 10 percent relative error. Depending on the nature of the application code, we have observed low slowdowns (relative to natively executing code) and high relative speedups using up to 64 processors.

  9. Asynchronous parallel pattern search for nonlinear optimization

    SciTech Connect

    P. D. Hough; T. G. Kolda; V. J. Torczon

    2000-01-01

    Parallel pattern search (PPS) can be quite useful for engineering optimization problems characterized by a small number of variables (say 10--50) and by expensive objective function evaluations such as complex simulations that take from minutes to hours to run. However, PPS, which was originally designed for execution on homogeneous and tightly-coupled parallel machine, is not well suited to the more heterogeneous, loosely-coupled, and even fault-prone parallel systems available today. Specifically, PPS is hindered by synchronization penalties and cannot recover in the event of a failure. The authors introduce a new asynchronous and fault tolerant parallel pattern search (AAPS) method and demonstrate its effectiveness on both simple test problems as well as some engineering optimization problems

  10. HOPSPACK: Hybrid Optimization Parallel Search Package.

    SciTech Connect

    Gray, Genetha A.; Kolda, Tamara G.; Griffin, Joshua; Taddy, Matt; Martinez-Canales, Monica

    2008-12-01

    In this paper, we describe the technical details of HOPSPACK (Hybrid Optimization Parallel SearchPackage), a new software platform which facilitates combining multiple optimization routines into asingle, tightly-coupled, hybrid algorithm that supports parallel function evaluations. The frameworkis designed such that existing optimization source code can be easily incorporated with minimalcode modification. By maintaining the integrity of each individual solver, the strengths and codesophistication of the original optimization package are retained and exploited.4

  11. Parallel Mechanisms for Visual Search in Zebrafish

    PubMed Central

    Proulx, Michael J.; Parker, Matthew O.; Tahir, Yasser; Brennan, Caroline H.

    2014-01-01

    Parallel visual search mechanisms have been reported previously only in mammals and birds, and not animals lacking an expanded telencephalon such as bees. Here we report the first evidence for parallel visual search in fish using a choice task where the fish had to find a target amongst an increasing number of distractors. Following two-choice discrimination training, zebrafish were presented with the original stimulus within an increasing array of distractor stimuli. We found that zebrafish exhibit no significant change in accuracy and approach latency as the number of distractors increased, providing evidence of parallel processing. This evidence challenges theories of vertebrate neural architecture and the importance of an expanded telencephalon for the evolution of executive function. PMID:25353168

  12. Parallel search of strongly ordered game trees

    SciTech Connect

    Marsland, T.A.; Campbell, M.

    1982-12-01

    The alpha-beta algorithm forms the basis of many programs that search game trees. A number of methods have been designed to improve the utility of the sequential version of this algorithm, especially for use in game-playing programs. These enhancements are based on the observation that alpha beta is most effective when the best move in each position is considered early in the search. Trees that have this so-called strong ordering property are not only of practical importance but possess characteristics that can be exploited in both sequential and parallel environments. This paper draws upon experiences gained during the development of programs which search chess game trees. Over the past decade major enhancements of the alpha beta algorithm have been developed by people building game-playing programs, and many of these methods will be surveyed and compared here. The balance of the paper contains a study of contemporary methods for searching chess game trees in parallel, using an arbitrary number of independent processors. To make efficient use of these processors, one must have a clear understanding of the basic properties of the trees actually traversed when alpha-beta cutoffs occur. This paper provides such insights and concludes with a brief description of a refinement to a standard parallel search algorithm for this problem. 33 references.

  13. Parallel depth first search. Part I. Implementation

    SciTech Connect

    Rao, V.N.; Kumar, V.

    1987-12-01

    This paper presents a parallel formation of depth-first search which retains the storage efficiency of sequential depth-first search and can be mapped on to any MIMD architecture. To study its effectiveness it has been implemented to solve the 15-puzzle problem on three commercially available multiprocessors - Sequent Balance 21,000, the Intel Hypercube and BBN Butterfly. The authors have been able to achieve fairly linear speedup on Sequent up to 30 processors (the maximum configuration available) and on the Intel Hypercube and BBN Butterfly up to 128 processors (the maximum configurations available). Many researchers considered the ring architecture to be quite suitable for parallel depth-first search. Their experimental results show that hypercube and shared-memory architectures are significantly better. At the heart of their parallel formulation is a dynamic work distribution scheme that divides the work between different processors. The effectiveness of the parallel formulation is strongly influenced by the work distribution scheme and architectural features such as presence/absence of shared memory, the diameter of the network, relative speed of the communication network, etc. In a companion paper, they analyze the effectiveness of different load-balancing schemes and architectures, and also present new improved work distribution schemes.

  14. Direct dark matter searches review

    NASA Astrophysics Data System (ADS)

    Gascon, Jules

    2015-05-01

    Direct Dark Matter Searches are experiments looking for the energetic recoils due to the scattering of Weakly Interacting Massive Particles (WIMPs) from our galactic halo on nuclei in a terrestrial target. The principles of these type of searches is described, and the status and results of the leading experiments in that field are presented, as well as their prospects in the coming years.

  15. Asynchronous parallel generating set search for linearly-constrained optimization.

    SciTech Connect

    Kolda, Tamara G.; Griffin, Joshua; Lewis, Robert Michael

    2007-04-01

    We describe an asynchronous parallel derivative-free algorithm for linearly-constrained optimization. Generating set search (GSS) is the basis of ourmethod. At each iteration, a GSS algorithm computes a set of search directionsand corresponding trial points and then evaluates the objective function valueat each trial point. Asynchronous versions of the algorithm have been developedin the unconstrained and bound-constrained cases which allow the iterations tocontinue (and new trial points to be generated and evaluated) as soon as anyother trial point completes. This enables better utilization of parallel resourcesand a reduction in overall runtime, especially for problems where the objec-tive function takes minutes or hours to compute. For linearly-constrained GSS,the convergence theory requires that the set of search directions conform to the3 nearby boundary. The complexity of developing the asynchronous algorithm forthe linearly-constrained case has to do with maintaining a suitable set of searchdirections as the search progresses and is the focus of this research. We describeour implementation in detail, including how to avoid function evaluations bycaching function values and using approximate look-ups. We test our imple-mentation on every CUTEr test problem with general linear constraints and upto 1000 variables. Without tuning to individual problems, our implementationwas able to solve 95% of the test problems with 10 or fewer variables, 75%of the problems with 11-100 variables, and nearly half of the problems with100-1000 variables. To the best of our knowledge, these are the best resultsthat have ever been achieved with a derivative-free method. Our asynchronousparallel implementation is freely available as part of the APPSPACK software.4

  16. Direct search for dark matter

    SciTech Connect

    Yoo, Jonghee; /Fermilab

    2009-12-01

    Dark matter is hypothetical matter which does not interact with electromagnetic radiation. The existence of dark matter is only inferred from gravitational effects of astrophysical observations to explain the missing mass component of the Universe. Weakly Interacting Massive Particles are currently the most popular candidate to explain the missing mass component. I review the current status of experimental searches of dark matter through direct detection using terrestrial detectors.

  17. Methods for Parallelizing Search Paths in Phrasing

    E-print Network

    Marcken, Carl de

    1994-01-01

    Many search problems are commonly solved with combinatoric algorithms that unnecessarily duplicate and serialize work at considerable computational expense. There are techniques available that can eliminate redundant ...

  18. SCALABLE ALGORITHMS FOR PARALLEL TREE SEARCH

    E-print Network

    Ralphs, Ted

    Wang for the under- standing and support. Although my parents are in China, I feel they are here Emily Xu, who always competes with me to play games on the laptop that I used to write this thesis. You . . . . . . . . . . . . . . . . . 18 1.4 Parallel Computing . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 1

  19. Parallel and Serial Processes in Visual Search

    ERIC Educational Resources Information Center

    Thornton, Thomas L.; Gilden, David L.

    2007-01-01

    A long-standing issue in the study of how people acquire visual information centers around the scheduling and deployment of attentional resources: Is the process serial, or is it parallel? A substantial empirical effort has been dedicated to resolving this issue. However, the results remain largely inconclusive because the methodologies that have…

  20. Seth Lemons (UNH) Parallel Best-First Search: Optimal and Suboptimal Solutions 1 / 39 Parallel Best-First Search: Optimal and Suboptimal Solutions

    E-print Network

    Ruml, Wheeler

    Seth Lemons (UNH) Parallel Best-First Search: Optimal and Suboptimal Solutions ­ 1 / 39 Parallel Best-First Search: Optimal and Suboptimal Solutions Ethan Burns, Seth Lemons, Wheeler Ruml Rong Zhou Lemons (UNH) Parallel Best-First Search: Optimal and Suboptimal Solutions ­ 2 / 39 Now we

  1. Automatic Generation of Directive-Based Parallel Programs for Shared Memory Parallel Systems

    NASA Technical Reports Server (NTRS)

    Jin, Hao-Qiang; Yan, Jerry; Frumkin, Michael

    2000-01-01

    The shared-memory programming model is a very effective way to achieve parallelism on shared memory parallel computers. As great progress was made in hardware and software technologies, performance of parallel programs with compiler directives has demonstrated large improvement. The introduction of OpenMP directives, the industrial standard for shared-memory programming, has minimized the issue of portability. Due to its ease of programming and its good performance, the technique has become very popular. In this study, we have extended CAPTools, a computer-aided parallelization toolkit, to automatically generate directive-based, OpenMP, parallel programs. We outline techniques used in the implementation of the tool and present test results on the NAS parallel benchmarks and ARC3D, a CFD application. This work demonstrates the great potential of using computer-aided tools to quickly port parallel programs and also achieve good performance.

  2. Direct Detection Searches for WIMPs

    NASA Astrophysics Data System (ADS)

    Cabrera, Blas

    2014-03-01

    We have seen remarkable progress in direct detection searches for dark matter in the form of weakly interacting particles or WIMPs. Existing experiments using diverse technologies have set convincing limits for WIMPs under the spin independent interaction framework and have ruled out much of the phase space suggested by supersymmetric models. Liquid xenon experiments have provided the best limits for masses above 6 GeV/c2, with cryogenic detectors and bubble chambers setting the best limits for lighter mass WIMPs. In tension with the liquid xenon experiments are hints of signals and a claimed detection in the light WIMP mass sector. A number of theoretical ideas are consistent with light mass WIMPs, and a general approach, which probes all possible interactions between WIMPs and nucleons, stresses the need for a variety of target nuclei with the lowest possible thresholds to broadly cover the possibilities. As discussed extensively in P5 meetings, the down selection process for the second generation experiments (G2) will determine the progress over the next decade. As a community, we have asked the agencies for significant additional funds to be identified so that several G2 experiments can move forward and R&D on others continue. We need to continue this important search aggressively until we find WIMPs or reach the natural floor where the solar and atmospheric neutrinos become an irreducible background.

  3. Multi-directional local search

    PubMed Central

    Tricoire, Fabien

    2012-01-01

    This paper introduces multi-directional local search, a metaheuristic for multi-objective optimization. We first motivate the method and present an algorithmic framework for it. We then apply it to several known multi-objective problems such as the multi-objective multi-dimensional knapsack problem, the bi-objective set packing problem and the bi-objective orienteering problem. Experimental results show that our method systematically provides solution sets of comparable quality with state-of-the-art methods applied to benchmark instances of these problems, within reasonable CPU effort. We conclude that the proposed algorithmic framework is a viable option when solving multi-objective optimization problems. PMID:25140071

  4. Parallel visual search and rapid animal detection in natural scenes

    E-print Network

    Parallel visual search and rapid animal detection in natural scenes Centre de Recherche Cerveau et, Giessen, GermanyKarl R. Gegenfurtner Human observers are capable of detecting animals within novel natural scenes with remarkable speed and accuracy. Recent studies found human response times to be as fast as 120

  5. A parallelization of the row-searching algorithm

    NASA Astrophysics Data System (ADS)

    Yaici, Malika; Khaled, Hayet; Khaled, Zakia; Bentahar, Athmane

    2012-11-01

    The problem dealt in this paper concerns the parallelization of the row-searching algorithm which allows the search for linearly dependant rows on a given matrix and its implementation on MPI (Message Passing Interface) environment. This algorithm is largely used in control theory and more specifically in solving the famous diophantine equation. An introduction to the diophantine equation is presented, then two parallelization approaches of the algorithm are detailed. The first distributes a set of rows on processes (processors) and the second makes a distribution per blocks. The sequential algorithm and its two parallel forms are implemented using MPI routines, then modelled using UML (Unified Modelling Language) and finally evaluated using algorithmic complexity.

  6. Directional Dark Matter Search and Velocity Distribution

    E-print Network

    Keiko I. Nagao

    2014-12-14

    Directional detection of dark matter is the next generation experiment, which is expected to have better back ground rejection efficiency than conventional direct search. Another intriguing possibility of the experiment by means of the directional information is measurement the velocity distribution of dark matter. Especially, it will be potent to figure out whether the velocity distribution is anisotropic. Supposing three distribution models, we discuss the possibility in one of the directional dark matter searches, nuclear emulsion detector.

  7. APHID: Asynchronous Parallel Game-Tree Search Mark G. Brockington and Jonathan Schaeffer

    E-print Network

    Schaeffer, Jonathan

    APHID: Asynchronous Parallel Game-Tree Search Mark G. Brockington and Jonathan Schaeffer Department Head: APHID: Asynchronous Parallel Game-Tree Search Send Proofs To: Jonathan Schaeffer 615 General in determining the minimax value. APHID, a new asynchronous parallel game-tree search algorithm, is presented

  8. Parallel Breadth-First Search on Distributed Memory Systems

    SciTech Connect

    Computational Research Division; Buluc, Aydin; Madduri, Kamesh

    2011-04-15

    Data-intensive, graph-based computations are pervasive in several scientific applications, and are known to to be quite challenging to implement on distributed memory systems. In this work, we explore the design space of parallel algorithms for Breadth-First Search (BFS), a key subroutine in several graph algorithms. We present two highly-tuned par- allel approaches for BFS on large parallel systems: a level-synchronous strategy that relies on a simple vertex-based partitioning of the graph, and a two-dimensional sparse matrix- partitioning-based approach that mitigates parallel commu- nication overhead. For both approaches, we also present hybrid versions with intra-node multithreading. Our novel hybrid two-dimensional algorithm reduces communication times by up to a factor of 3.5, relative to a common vertex based approach. Our experimental study identifies execu- tion regimes in which these approaches will be competitive, and we demonstrate extremely high performance on lead- ing distributed-memory parallel systems. For instance, for a 40,000-core parallel execution on Hopper, an AMD Magny- Cours based system, we achieve a BFS performance rate of 17.8 billion edge visits per second on an undirected graph of 4.3 billion vertices and 68.7 billion edges with skewed degree distribution.

  9. DIRECT using local search on surrogates

    E-print Network

    Stryk, Oskar von

    DIRECT using local search on surrogates Technical Report March 20, 2011 Thomas Hemker , Christian of a brute force start, is extended by an inner loop using a surrogate based optimization method. The local search on the surrogate function determines better candidates for sampling than the hypercube center

  10. Asynchronous parallel generating set search for linearly-constrained optimization.

    SciTech Connect

    Lewis, Robert Michael; Griffin, Joshua D.; Kolda, Tamara Gibson

    2006-08-01

    Generating set search (GSS) is a family of direct search methods that encompasses generalized pattern search and related methods. We describe an algorithm for asynchronous linearly-constrained GSS, which has some complexities that make it different from both the asynchronous bound-constrained case as well as the synchronous linearly-constrained case. The algorithm has been implemented in the APPSPACK software framework and we present results from an extensive numerical study using CUTEr test problems. We discuss the results, both positive and negative, and conclude that GSS is a reliable method for solving small-to-medium sized linearly-constrained optimization problems without derivatives.

  11. Series-parallel method of direct solar array regulation

    NASA Technical Reports Server (NTRS)

    Gooder, S. T.

    1976-01-01

    A 40 watt experimental solar array was directly regulated by shorting out appropriate combinations of series and parallel segments of a solar array. Regulation switches were employed to control the array at various set-point voltages between 25 and 40 volts. Regulation to within + or - 0.5 volt was obtained over a range of solar array temperatures and illumination levels as an active load was varied from open circuit to maximum available power. A fourfold reduction in regulation switch power dissipation was achieved with series-parallel regulation as compared to the usual series-only switching for direct solar array regulation.

  12. Optimal directed searches for continuous gravitational waves

    E-print Network

    Ming, Jing; Papa, Maria Alessandra; Aulbert, Carsten; Fehrmann, Henning

    2015-01-01

    Wide parameter space searches for long lived continuous gravitational wave signals are computationally limited. It is therefore critically important that available computational resources are used rationally. In this paper we consider directed searches, i.e. targets for which the sky position is known accurately but the frequency and spindown parameters are completely unknown. Given a list of such potential astrophysical targets, we therefore need to prioritize. On which target(s) should we spend scarce computing resources? What parameter space region in frequency and spindown should we search? Finally, what is the optimal search set-up that we should use? In this paper we present a general framework that allows to solve all three of these problems. This framework is based on maximizing the probability of making a detection subject to a constraint on the maximum available computational cost. We illustrate the method for a simplified problem.

  13. Optimal directed searches for continuous gravitational waves

    E-print Network

    Jing Ming; Badri Krishnan; Maria Alessandra Papa; Carsten Aulbert; Henning Fehrmann

    2015-10-09

    Wide parameter space searches for long lived continuous gravitational wave signals are computationally limited. It is therefore critically important that available computational resources are used rationally. In this paper we consider directed searches, i.e. targets for which the sky position is known accurately but the frequency and spindown parameters are completely unknown. Given a list of such potential astrophysical targets, we therefore need to prioritize. On which target(s) should we spend scarce computing resources? What parameter space region in frequency and spindown should we search? Finally, what is the optimal search set-up that we should use? In this paper we present a general framework that allows to solve all three of these problems. This framework is based on maximizing the probability of making a detection subject to a constraint on the maximum available computational cost. We illustrate the method for a simplified problem.

  14. Search for overlapped communities by parallel genetic algorithms

    E-print Network

    Vincenza Carchiolo; Alessandro Longheu; Michele Malgeri; Giuseppe Mangioni

    2009-12-07

    In the last decade the broad scope of complex networks has led to a rapid progress. In this area a particular interest has the study of community structures. The analysis of this type of structure requires the formalization of the intuitive concept of community and the definition of indices of goodness for the obtained results. A lot of algorithms has been presented to reach this goal. In particular, an interesting problem is the search of overlapped communities and it is field seems very interesting a solution based on the use of genetic algorithms. The approach discusses in this paper is based on a parallel implementation of a genetic algorithm and shows the performance benefits of this solution.

  15. Hadamard NMR spectroscopy for two-dimensional quantum information processing and parallel search algorithms

    E-print Network

    T. Gopinath; Anil Kumar

    2006-09-08

    Hadamard spectroscopy has earlier been used to speed-up multi-dimensional NMR experiments. In this work we speed-up the two-dimensional quantum computing scheme, by using Hadamard spectroscopy in the indirect dimension, resulting in a scheme which is faster and requires the Fourier transformation only in the direct dimension. Two and three qubit quantum gates are implemented with an extra observer qubit. We also use one-dimensional Hadamard spectroscopy for binary information storage by spatial encoding and implementation of a parallel search algorithm.

  16. Hadamard NMR spectroscopy for two-dimensional quantum information processing and parallel search algorithms

    E-print Network

    Gopinath, T; Kumar, Anil

    2006-01-01

    Hadamard spectroscopy has earlier been used to speed-up multi-dimensional NMR experiments. In this work we speed-up the two-dimensional quantum computing scheme, by using Hadamard spectroscopy in the indirect dimension, resulting in a scheme which is faster and requires the Fourier transformation only in the direct dimension. Two and three qubit quantum gates are implemented with an extra observer qubit. We also use one-dimensional Hadamard spectroscopy for binary information storage by spatial encoding and implementation of a parallel search algorithm.

  17. Direct searches for dark matter: recent results.

    PubMed

    Rosenberg, L J

    1998-01-01

    There is abundant evidence for large amounts of unseen matter in the universe. This dark matter, by its very nature, couples feebly to ordinary matter and is correspondingly difficult to detect. Nonetheless, several experiments are now underway with the sensitivity required to detect directly galactic halo dark matter through their interactions with matter and radiation. These experiments divide into two broad classes: searches for weakly interacting massive particles (WIMPs) and searches for axions. There exists a very strong theoretical bias for supposing that supersymmetry (SUSY) is a correct description of nature. WIMPs are predicted by this SUSY theory and have the required properties to be dark matter. These WIMPs are detected from the byproducts of their occasional recoil against nucleons. There are efforts around the world to detect these rare recoils. The WIMP part of this overview focuses on the cryogenic dark matter search (CDMS) underway in California. Axions, another favored dark matter candidate, are predicted to arise from a minimal extension of the standard model that explains the absence of the expected large CP violating effects in strong interactions. Axions can, in the presence of a large magnetic field, turn into microwave photons. It is the slight excess of photons above noise that signals the axion. Axion searches are underway in California and Japan. The axion part of this overview focuses on the California effort. Brevity does not allow me to discuss other WIMP and axion searches, likewise for accelerator and satellite based searches; I apologize for their omission. PMID:9419325

  18. Panel on future directions in parallel computer architecture

    SciTech Connect

    VanTilborg, A.M. )

    1989-06-01

    One of the program highlights of the 15th Annual International Symposium on Computer Architecture, held May 30 - June 2, 1988 in Honolulu, was a panel session on future directions in parallel computer architecture. The panel was organized and chaired by the author, and was comprised of Prof. Jack Dennis (NASA Ames Research Institute for Advanced Computer Science), Prof. H.T. Kung (Carnegie Mellon), and Dr. Burton Smith (Tera Computer Company). The objective of the panel was to identify the likely trajectory of future parallel computer system progress, particularly from the sandpoint of marketplace acceptance. Approximately 250 attendees participated in the session, in which each panelist began with a ten minute viewgraph explanation of his views, followed by an open and sometimes lively exchange with the audience and fellow panelists. The session ran for ninety minutes.

  19. Fencing direct memory access data transfers in a parallel active messaging interface of a parallel computer

    DOEpatents

    Blocksome, Michael A; Mamidala, Amith R

    2014-02-11

    Fencing direct memory access (`DMA`) data transfers in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI including data communications endpoints, each endpoint including specifications of a client, a context, and a task, the endpoints coupled for data communications through the PAMI and through DMA controllers operatively coupled to segments of shared random access memory through which the DMA controllers deliver data communications deterministically, including initiating execution through the PAMI of an ordered sequence of active DMA instructions for DMA data transfers between two endpoints, effecting deterministic DMA data transfers through a DMA controller and a segment of shared memory; and executing through the PAMI, with no FENCE accounting for DMA data transfers, an active FENCE instruction, the FENCE instruction completing execution only after completion of all DMA instructions initiated prior to execution of the FENCE instruction for DMA data transfers between the two endpoints.

  20. Fencing direct memory access data transfers in a parallel active messaging interface of a parallel computer

    DOEpatents

    Blocksome, Michael A.; Mamidala, Amith R.

    2013-09-03

    Fencing direct memory access (`DMA`) data transfers in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI including data communications endpoints, each endpoint including specifications of a client, a context, and a task, the endpoints coupled for data communications through the PAMI and through DMA controllers operatively coupled to segments of shared random access memory through which the DMA controllers deliver data communications deterministically, including initiating execution through the PAMI of an ordered sequence of active DMA instructions for DMA data transfers between two endpoints, effecting deterministic DMA data transfers through a DMA controller and a segment of shared memory; and executing through the PAMI, with no FENCE accounting for DMA data transfers, an active FENCE instruction, the FENCE instruction completing execution only after completion of all DMA instructions initiated prior to execution of the FENCE instruction for DMA data transfers between the two endpoints.

  1. Direct drive digital servo press with high parallel control

    NASA Astrophysics Data System (ADS)

    Murata, Chikara; Yabe, Jun; Endou, Junichi; Hasegawa, Kiyoshi

    2013-12-01

    Direct drive digital servo press has been developed as the university-industry joint research and development since 1998. On the basis of this result, 4-axes direct drive digital servo press has been developed and in the market on April of 2002. This servo press is composed of 1 slide supported by 4 ball screws and each axis has linearscale measuring the position of each axis with high accuracy less than ?m order level. Each axis is controlled independently by servo motor and feedback system. This system can keep high level parallelism and high accuracy even with high eccentric load. Furthermore the 'full stroke full power' is obtained by using ball screws. Using these features, new various types of press forming and stamping have been obtained by development and production. The new stamping and forming methods are introduced and 'manufacturing' need strategy of press forming with high added value and also the future direction of press forming are also introduced.

  2. Indirect and direct search for dark matter

    NASA Astrophysics Data System (ADS)

    Klasen, M.; Pohl, M.; Sigl, G.

    2015-11-01

    The majority of the matter in the universe is still unidentified and under investigation by both direct and indirect means. Many experiments searching for the recoil of dark-matter particles off target nuclei in underground laboratories have established increasingly strong constraints on the mass and scattering cross sections of weakly interacting particles, and some have even seen hints at a possible signal. Other experiments search for a possible mixing of photons with light scalar or pseudo-scalar particles that could also constitute dark matter. Furthermore, annihilation or decay of dark matter can contribute to charged cosmic rays, photons at all energies, and neutrinos. Many existing and future ground-based and satellite experiments are sensitive to such signals. Finally, data from the Large Hadron Collider at CERN are scrutinized for missing energy as a signature of new weakly interacting particles that may be related to dark matter. In this review article we summarize the status of the field with an emphasis on the complementarity between direct detection in dedicated laboratory experiments, indirect detection in the cosmic radiation, and searches at particle accelerators.

  3. A directed search for extraterrestrial laser signals

    NASA Technical Reports Server (NTRS)

    Betz, A.

    1991-01-01

    The focus of NASA's Search for Extraterrestrial Intelligence (SETI) Program is on microwave frequencies, where receivers have the best sensitivities for the detection of narrowband signals. Such receivers, when coupled to existing radio telescopes, form an optimal system for broad area searches over the sky. For a directed search, however, such as toward specific stars, calculations show that infrared wavelengths can be equally as effective as radio wavelengths for establishing an interstellar communication link. This is true because infrared telescopes have higher directivities (gains) that effectively compensate for the lower sensitivities of infrared receivers. The result is that, for a given level of transmitted power, the signal to noise ratio for communications is equally as good at infrared and radio wavelengths. It should also be noted that the overall sensitivities of both receiver systems are quite close to their respective fundamental limits: background thermal noise for the radio frequency system and quantum noise for the infrared receiver. Consequently, the choice of an optimum communication frequency may well be determined more by the achievable power levels of transmitters rather than the ultimate sensitivities of receivers at any specific frequency. In the infrared, CO2 laser transmitters with power levels greater than 1 MW can already be built on Earth. For a slightly more advanced civilization, a similar but enormously more powerful laser may be possible using a planetary atmosphere rich in CO2. Because of these possibilities and our own ignorance of what is really the optimum search frequency, a search for narrowband signals at infrared frequencies should be a part of a balanced SETI Program. Detection of narrowband infrared signals is best done with a heterodyne receiver functionally identical to a microwave spectral line receiver. We have built such a receiver for the detection of CO2 laser radiation at wavelengths near 10 microns. The spectrometer uses a high-speed HgCdTe diode as the photomixer and a small CO2 laser as the local oscillator. Output signals in the intermediate frequency range 0.1-2.6 GHz are processed by a 1000-channel acousto-optic signal processor. The receiver is being used on a 1.5-m telescope on Mt. Wilson to survey a selected sample of 150 nearby stars. The current status of the work is discussed along with future project plans.

  4. Nonlinearly-constrained optimization using asynchronous parallel generating set search.

    SciTech Connect

    Griffin, Joshua D.; Kolda, Tamara Gibson

    2007-05-01

    Many optimization problems in computational science and engineering (CS&E) are characterized by expensive objective and/or constraint function evaluations paired with a lack of derivative information. Direct search methods such as generating set search (GSS) are well understood and efficient for derivative-free optimization of unconstrained and linearly-constrained problems. This paper addresses the more difficult problem of general nonlinear programming where derivatives for objective or constraint functions are unavailable, which is the case for many CS&E applications. We focus on penalty methods that use GSS to solve the linearly-constrained problems, comparing different penalty functions. A classical choice for penalizing constraint violations is {ell}{sub 2}{sup 2}, the squared {ell}{sub 2} norm, which has advantages for derivative-based optimization methods. In our numerical tests, however, we show that exact penalty functions based on the {ell}{sub 1}, {ell}{sub 2}, and {ell}{sub {infinity}} norms converge to good approximate solutions more quickly and thus are attractive alternatives. Unfortunately, exact penalty functions are discontinuous and consequently introduce theoretical problems that degrade the final solution accuracy, so we also consider smoothed variants. Smoothed-exact penalty functions are theoretically attractive because they retain the differentiability of the original problem. Numerically, they are a compromise between exact and {ell}{sub 2}{sup 2}, i.e., they converge to a good solution somewhat quickly without sacrificing much solution accuracy. Moreover, the smoothing is parameterized and can potentially be adjusted to balance the two considerations. Since many CS&E optimization problems are characterized by expensive function evaluations, reducing the number of function evaluations is paramount, and the results of this paper show that exact and smoothed-exact penalty functions are well-suited to this task.

  5. Quantum search by parallel eigenvalue adiabatic passage D. Daems,1,* S. Gurin,2,

    E-print Network

    Cerf, Nicolas

    Quantum search by parallel eigenvalue adiabatic passage D. Daems,1,* S. Guérin,2, and N. J. Cerf1 1 is based on the use of parallel eigenvalues. This allows us to obtain nonadiabatic losses paradigm of quantum computation 3 , which is imple- mented through gates embedded in a quantum circuit

  6. Direct Dark Matter Search with XENON100

    E-print Network

    S. E. A. Orrigo; for the XENON Collaboration

    2015-01-14

    The XENON100 experiment is the second phase of the XENON program for the direct detection of the dark matter in the universe. The XENON100 detector is a two-phase Time Projection Chamber filled with 161 kg of ultra pure liquid xenon. The results from 224.6 live days of dark matter search with XENON100 are presented. No evidence for dark matter in the form of WIMPs is found, excluding spin-independent WIMP-nucleon scattering cross sections above 2 $\\times$ 10$^{-45}$ cm$^2$ for a 55 GeV/c$^2$ WIMP at 90% confidence level (C.L.). The most stringent limit is established on the spin-dependent WIMP-neutron interaction for WIMP masses above 6 GeV/c$^2$, with a minimum cross section of 3.5 $\\times$ 10$^{-40}$ cm$^2$ (90% C.L.) for a 45 GeV/c$^2$ WIMP. The same dataset is used to search for axions and axion-like-particles. The best limits to date are set on the axion-electron coupling constant for solar axions, $g_{Ae}$ < 7.7 $\\times$ 10$^{-12}$ (90% C.L.), and for axion-like-particles, $g_{Ae}$ < 1 $\\times$ 10$^{-12}$ (90% C.L.) for masses between 5 and 10 keV/c$^2$.

  7. Direct Dark Matter Search with XENON100

    E-print Network

    Orrigo, S E A

    2015-01-01

    The XENON100 experiment is the second phase of the XENON program for the direct detection of the dark matter in the universe. The XENON100 detector is a two-phase Time Projection Chamber filled with 161 kg of ultra pure liquid xenon. The results from 224.6 live days of dark matter search with XENON100 are presented. No evidence for dark matter in the form of WIMPs is found, excluding spin-independent WIMP-nucleon scattering cross sections above 2 $\\times$ 10$^{-45}$ cm$^2$ for a 55 GeV/c$^2$ WIMP at 90% confidence level (C.L.). The most stringent limit is established on the spin-dependent WIMP-neutron interaction for WIMP masses above 6 GeV/c$^2$, with a minimum cross section of 3.5 $\\times$ 10$^{-40}$ cm$^2$ (90% C.L.) for a 45 GeV/c$^2$ WIMP. The same dataset is used to search for axions and axion-like-particles. The best limits to date are set on the axion-electron coupling constant for solar axions, $g_{Ae}$ < 7.7 $\\times$ 10$^{-12}$ (90% C.L.), and for axion-like-particles, $g_{Ae}$ < 1 $\\times$ 10...

  8. Theoretical Bounds of Direct Binary Search Halftoning.

    PubMed

    Liao, Jan-Ray

    2015-11-01

    Direct binary search (DBS) produces the images of the best quality among half-toning algorithms. The reason is that it minimizes the total squared perceived error instead of using heuristic approaches. The search for the optimal solution involves two operations: (1) toggle and (2) swap. Both operations try to find the binary states for each pixel to minimize the total squared perceived error. This error energy minimization leads to a conjecture that the absolute value of the filtered error after DBS converges is bounded by half of the peak value of the autocorrelation filter. However, a proof of the bound's existence has not yet been found. In this paper, we present a proof that shows the bound existed as conjectured under the condition that at least one swap occurs after toggle converges. The theoretical analysis also indicates that a swap with a pixel further away from the center of the autocorrelation filter results in a tighter bound. Therefore, we propose a new DBS algorithm which considers toggle and swap separately, and the swap operations are considered in the order from the edge to the center of the filter. Experimental results show that the new algorithm is more efficient than the previous algorithm and can produce half-toned images of the same quality as the previous algorithm. PMID:26111393

  9. PNBA*: A Parallel Bidirectional Heuristic Search Algorithm Luis Henrique Oliveira Rios1

    E-print Network

    Chaimowicz, Luiz

    PNBA*: A Parallel Bidirectional Heuristic Search Algorithm Luis Henrique Oliveira Rios1 , Luiz Chaimowicz1 1 Departamento de Ci^encia da Computac¸~ao Universidade Federal de Minas Gerais (UFMG) ­ Belo Horizonte, MG ­ Brasil {lhrios,chaimo}@dcc.ufmg.br Abstract. A* (A-star) is a heuristic search algorithm

  10. The APHID Parallel Search Algorithm Mark G. Brockington and Jonathan Schaeffer

    E-print Network

    Schaeffer, Jonathan

    The APHID Parallel Search Algorithm Mark G. Brockington and Jonathan Schaeffer Department@cs.ualberta.ca Abstract This paper introduces the APHID (Asynchronous Par- allel Hierarchical Iterative Deepening) game-tree search algorithm. APHID represents a departure from the ap- proaches used in practice. Instead

  11. When the Lowest Energy Does Not Induce Native Structures: Parallel Minimization of Multi-Energy Values by Hybridizing Searching Intelligences

    PubMed Central

    Lü, Qiang; Xia, Xiao-Yan; Chen, Rong; Miao, Da-Jun; Chen, Sha-Sha; Quan, Li-Jun; Li, Hai-Ou

    2012-01-01

    Background Protein structure prediction (PSP), which is usually modeled as a computational optimization problem, remains one of the biggest challenges in computational biology. PSP encounters two difficult obstacles: the inaccurate energy function problem and the searching problem. Even if the lowest energy has been luckily found by the searching procedure, the correct protein structures are not guaranteed to obtain. Results A general parallel metaheuristic approach is presented to tackle the above two problems. Multi-energy functions are employed to simultaneously guide the parallel searching threads. Searching trajectories are in fact controlled by the parameters of heuristic algorithms. The parallel approach allows the parameters to be perturbed during the searching threads are running in parallel, while each thread is searching the lowest energy value determined by an individual energy function. By hybridizing the intelligences of parallel ant colonies and Monte Carlo Metropolis search, this paper demonstrates an implementation of our parallel approach for PSP. 16 classical instances were tested to show that the parallel approach is competitive for solving PSP problem. Conclusions This parallel approach combines various sources of both searching intelligences and energy functions, and thus predicts protein conformations with good quality jointly determined by all the parallel searching threads and energy functions. It provides a framework to combine different searching intelligence embedded in heuristic algorithms. It also constructs a container to hybridize different not-so-accurate objective functions which are usually derived from the domain expertise. PMID:23028708

  12. GRAPES: A Software for Parallel Searching on Biological Graphs Targeting Multi-Core Architectures

    PubMed Central

    Bombieri, Nicola; Pulvirenti, Alfredo; Ferro, Alfredo; Shasha, Dennis

    2013-01-01

    Biological applications, from genomics to ecology, deal with graphs that represents the structure of interactions. Analyzing such data requires searching for subgraphs in collections of graphs. This task is computationally expensive. Even though multicore architectures, from commodity computers to more advanced symmetric multiprocessing (SMP), offer scalable computing power, currently published software implementations for indexing and graph matching are fundamentally sequential. As a consequence, such software implementations (i) do not fully exploit available parallel computing power and (ii) they do not scale with respect to the size of graphs in the database. We present GRAPES, software for parallel searching on databases of large biological graphs. GRAPES implements a parallel version of well-established graph searching algorithms, and introduces new strategies which naturally lead to a faster parallel searching system especially for large graphs. GRAPES decomposes graphs into subcomponents that can be efficiently searched in parallel. We show the performance of GRAPES on representative biological datasets containing antiviral chemical compounds, DNA, RNA, proteins, protein contact maps and protein interactions networks. PMID:24167551

  13. Dark Matter: Connecting LHC searches to direct detection

    E-print Network

    Andreas Crivellin; Martin Hoferichter; Massimiliano Procura; Lewis C. Tunstall

    2015-05-09

    In these proceedings we review the interplay between LHC searches for dark matter and direct detection experiments. For this purpose we consider two prime examples: the effective field theory (EFT) approach and the minimal supersymmetric standard model (MSSM). In the EFT scenario we show that for operators which do not enter directly direct detection at tree-level, but only via loop effects, LHC searches give complementary constraints. In the MSSM stop and Higgs exchange contribute to the direct detection amplitude. Therefore, LHC searches for supersymmetric particles and heavy Higgses place constraints on the same parameter space as direct detection.

  14. Directions in parallel programming: HPF, shared virtual memory and object parallelism in pC++

    NASA Technical Reports Server (NTRS)

    Bodin, Francois; Priol, Thierry; Mehrotra, Piyush; Gannon, Dennis

    1994-01-01

    Fortran and C++ are the dominant programming languages used in scientific computation. Consequently, extensions to these languages are the most popular for programming massively parallel computers. We discuss two such approaches to parallel Fortran and one approach to C++. The High Performance Fortran Forum has designed HPF with the intent of supporting data parallelism on Fortran 90 applications. HPF works by asking the user to help the compiler distribute and align the data structures with the distributed memory modules in the system. Fortran-S takes a different approach in which the data distribution is managed by the operating system and the user provides annotations to indicate parallel control regions. In the case of C++, we look at pC++ which is based on a concurrent aggregate parallel model.

  15. Parallel state-space search for a first solution with consistent linear speedups

    SciTech Connect

    Kale, L.V.; Saletore, V.A. )

    1989-01-01

    Consider the problem of exploring a large state-space for a goal state. Although many such states may exist in the state-space, finding any one state satisfying the requirements is sufficient. All the methods known until now for conducting such search in parallel using multiprocessors fail to provide consistent linear speedups over sequential execution. The speedups vary between sub-linear speedups over sequential execution. The speedup, giving rise to speedup anomalies reported in literature. The authors present a prioritizing strategy which yields consistent speedups that are close to P with P processors, and that monotonically increase with the addition of processors. It achieves this by keeping the total number of nodes expanded during parallel search very close to that in a sequential search. In addition, the strategy requires substantially smaller memory over other methods. The performance of this strategy is demonstrated on a multiprocessor with several state-space search problems.

  16. Parallel Multi-Swarm Optimization Framework for Search Problems in Water Distribution Systems

    E-print Network

    Parallel Multi-Swarm Optimization Framework for Search Problems in Water Distribution Systems Sarat concurrent particle swarms is developed and applied to water distribution problems. Details of the enabling characterization problems for two water distribution networks with 1,834 and 12,457 nodes respectively. 1

  17. Searching for Backbones An Efficient Parallel Algorithm for Finding Groundstates in Spin Glass Models

    E-print Network

    Schneider, Johannes Josef

    , one usually finds structures which are common to all solutions. Thus, one can assume is iterated until all optimization runs end at the same solution. INTRODUCTION Spin glasses are unorderedSearching for Backbones ­ An Efficient Parallel Algorithm for Finding Groundstates in Spin Glass

  18. Performance analysis of parallel branch and bound search with the hypercube architecture

    NASA Technical Reports Server (NTRS)

    Mraz, Richard T.

    1987-01-01

    With the availability of commercial parallel computers, researchers are examining new classes of problems which might benefit from parallel computing. This paper presents results of an investigation of the class of search intensive problems. The specific problem discussed is the Least-Cost Branch and Bound search method of deadline job scheduling. The object-oriented design methodology was used to map the problem into a parallel solution. While the initial design was good for a prototype, the best performance resulted from fine-tuning the algorithm for a specific computer. The experiments analyze the computation time, the speed up over a VAX 11/785, and the load balance of the problem when using loosely coupled multiprocessor system based on the hypercube architecture.

  19. A direct method for string to deterministic finite automaton conversion for fast text searching

    SciTech Connect

    Berlin, G.J.

    1991-12-31

    This paper describes a simple technique for generating a minimum state deterministic finite automation (DFA) directly from a restricted set of regular expressions. The resulting DFA is used for string searches that do not alter the target text and require only a single pass through the input. The technique is used for very fast, mixed or same case, single or multiple string searches. The technique is also capable of directly converting multiple strings with wild card character specifiers by constructing parallel DFAs. Construction of the automation is performed in a time proportional to the length of the regular expression. Algorithms are given for construction of the automatons and recognizers. Although the regular expression to DFA parser does not support all classes of regular expressions, it supports a sufficient subset to make it useful for the most commonly encountered text searching functions.

  20. A direct method for string to deterministic finite automaton conversion for fast text searching

    SciTech Connect

    Berlin, G.J.

    1991-01-01

    This paper describes a simple technique for generating a minimum state deterministic finite automation (DFA) directly from a restricted set of regular expressions. The resulting DFA is used for string searches that do not alter the target text and require only a single pass through the input. The technique is used for very fast, mixed or same case, single or multiple string searches. The technique is also capable of directly converting multiple strings with wild card character specifiers by constructing parallel DFAs. Construction of the automation is performed in a time proportional to the length of the regular expression. Algorithms are given for construction of the automatons and recognizers. Although the regular expression to DFA parser does not support all classes of regular expressions, it supports a sufficient subset to make it useful for the most commonly encountered text searching functions.

  1. Integrating structure- and ligand-based virtual screening: comparison of individual, parallel, and fused molecular docking and similarity search calculations on multiple targets.

    PubMed

    Tan, Lu; Geppert, Hanna; Sisay, Mihiret T; Gütschow, Michael; Bajorath, Jürgen

    2008-10-01

    Similarity searching is often used to preselect compounds for docking, thereby decreasing the size of screening databases. However, integrated structure- and ligand-based screening schemes are rare at present. Docking and similarity search calculations using 2D fingerprints were carried out in a comparative manner on nine target enzymes, for which significant numbers of diverse inhibitors could be obtained. In the absence of knowledge-based docking constraints and target-directed parameter optimisation, fingerprint searching displayed a clear preference over docking calculations. Alternative combinations of docking and similarity search results were investigated and found to further increase compound recall of individual methods in a number of instances. When the results of similarity searching and docking were combined, parallel selection of candidate compounds from individual rankings was generally superior to rank fusion. We suggest that complementary results from docking and similarity searching can be captured by integrated compound selection schemes. PMID:18651695

  2. Direct-pNFS: Scalable, transparent, and versatile access to parallel file systems

    E-print Network

    Honeyman, Peter

    platforms. Distributed file access protocols such as NFS [5] and CIFS [6] bridge the interop- erability gapDirect-pNFS: Scalable, transparent, and versatile access to parallel file systems Dean Hildebrand as well as a scalable and agile name space. While parallel file systems give high I/O throughput

  3. Directed search for continuous gravitational waves from the Galactic center

    E-print Network

    Aggarwal, Nancy

    We present the results of a directed search for continuous gravitational waves from unknown, isolated neutron stars in the Galactic center region, performed on two years of data from LIGO’s fifth science run from two LIGO ...

  4. Directional Dark Matter Searches with Carbon Nanotubes

    E-print Network

    L. M. Capparelli; G. Cavoto; D. Mazzilli; A. D. Polosa

    2015-12-05

    A new solution to the problem of dark matter directional detection might come from the use of large arrays of aligned carbon nanotubes. We calculate the expected rate of carbon ions channeled in single-wall nanotubes once extracted by the scattering with a massive dark matter particle. Depending on its initial kinematic conditions, the ejected Carbon ion may be channeled in the nanotube array or stop in the bulk. The orientation of the array with respect to the direction of motion of the Sun has an appreciable effect on the channeling probability. This provides the required anisotropic response for a directional detector.

  5. Directional Dark Matter Searches with Carbon Nanotubes

    E-print Network

    L. M. Capparelli; G. Cavoto; D. Mazzilli; A. D. Polosa

    2015-08-26

    A new solution to the problem of dark matter directional detection might come from the use of large arrays of aligned carbon nanotubes. We calculate the expected rate of carbon ions channeled in single-wall nanotubes once extracted by the scattering with a massive dark matter particle. Depending on its initial kinematic conditions, the ejected Carbon ion may be channeled in the nanotube array or stop in the bulk. The orientation of the array with respect to the direction of motion of the Sun has an appreciable effect on the channeling probability. This provides the required anisotropic response for a directional detector.

  6. Directional dark matter searches with carbon nanotubes

    NASA Astrophysics Data System (ADS)

    Capparelli, L. M.; Cavoto, G.; Mazzilli, D.; Polosa, A. D.

    2015-09-01

    A new solution to the problem of dark matter directional detection might come from the use of large arrays of aligned carbon nanotubes. We calculate the expected rate of carbon ions channeled in single-wall nanotubes once extracted by the scattering with a massive dark matter particle. Depending on its initial kinematic conditions, the ejected carbon ion may be channeled in the nanotube array or stop in the bulk. The orientation of the array with respect to the direction of motion of the Sun has an appreciable effect on the channeling probability. This provides the required anisotropic response for a directional detector.

  7. PARALIGN: rapid and sensitive sequence similarity searches powered by parallel computing technology.

    PubMed

    Saebø, Per Eystein; Andersen, Sten Morten; Myrseth, Jon; Laerdahl, Jon K; Rognes, Torbjørn

    2005-07-01

    PARALIGN is a rapid and sensitive similarity search tool for the identification of distantly related sequences in both nucleotide and amino acid sequence databases. Two algorithms are implemented, accelerated Smith-Waterman and ParAlign. The ParAlign algorithm is similar to Smith-Waterman in sensitivity, while as quick as BLAST for protein searches. A form of parallel computing technology known as multimedia technology that is available in modern processors, but rarely used by other bioinformatics software, has been exploited to achieve the high speed. The software is also designed to run efficiently on computer clusters using the message-passing interface standard. A public search service powered by a large computer cluster has been set-up and is freely available at www.paralign.org, where the major public databases can be searched. The software can also be downloaded free of charge for academic use. PMID:15980529

  8. A direct search for Dirac magnetic monopoles

    E-print Network

    Mulhearn, Michael James

    2005-01-01

    Magnetic monopoles are highly ionizing and curve in the direction of the magnetic field. A new dedicated magnetic monopole trigger at CDF, which requires large light pulses in the scintillators of the time-of-flight system, ...

  9. Direct detection searches for axion dark matter

    NASA Astrophysics Data System (ADS)

    Rybka, Gray

    2014-09-01

    The axion is both a compelling dark matter candidate and provides an elegant solution to the strong CP problem. The axion haloscope technique has the potential to detect dark matter axions. ADMX (the Axion Dark Matter eXperiment) is an implementation of the axion haloscope technique, and has undergone a series of sensitivity-improving upgrades. With the impending addition of a dilution refrigerator, ADMX is poised to search a large region of plausible dark matter axion masses. Meanwhile, a number of other axion experimental techniques are being considered to explore other axion masses relevant to dark matter.

  10. Parallel repetition for entangled k-player games via fast quantum search

    E-print Network

    Kai-Min Chung; Xiaodi Wu; Henry Yuen

    2015-04-06

    We present two parallel repetition theorems for the entangled value of multi-player, one-round free games (games where the inputs come from a product distribution). Our first theorem shows that for a $k$-player free game $G$ with entangled value $\\mathrm{val}^*(G) = 1 - \\epsilon$, the $n$-fold repetition of $G$ has entangled value $\\mathrm{val}^*(G^{\\otimes n})$ at most $(1 - \\epsilon^{3/2})^{\\Omega(n/sk^4)}$, where $s$ is the answer length of any player. In contrast, the best known parallel repetition theorem for the classical value of two-player free games is $\\mathrm{val}(G^{\\otimes n}) \\leq (1 - \\epsilon^2)^{\\Omega(n/s)}$, due to Barak, et al. (RANDOM 2009). This suggests the possibility of a separation between the behavior of entangled and classical free games under parallel repetition. Our second theorem handles the broader class of free games $G$ where the players can output (possibly entangled) quantum states. For such games, the repeated entangled value is upper bounded by $(1 - \\epsilon^2)^{\\Omega(n/sk^2)}$. We also show that the dependence of the exponent on $k$ is necessary: we exhibit a $k$-player free game $G$ and $n \\geq 1$ such that $\\mathrm{val}^*(G^{\\otimes n}) \\geq \\mathrm{val}^*(G)^{n/k}$. Our analysis exploits the novel connection between communication protocols and quantum parallel repetition, first explored by Chailloux and Scarpa (ICALP 2014). We demonstrate that better communication protocols yield better parallel repetition theorems: our first theorem crucially uses a quantum search protocol by Aaronson and Ambainis, which gives a quadratic speed-up for distributed search problems. Finally, our results apply to a broader class of games than were previously considered before; in particular, we obtain the first parallel repetition theorem for entangled games involving more than two players, and for games involving quantum outputs.

  11. Simulating a Direction-Finder Search for an ELT

    NASA Technical Reports Server (NTRS)

    Bream, Bruce

    2005-01-01

    A computer program simulates the operation of direction-finding equipment engaged in a search for an emergency locator transmitter (ELT) aboard an aircraft that has crashed. The simulated equipment is patterned after the equipment used by the Civil Air Patrol to search for missing aircraft. The program is designed to be used for training in radio direction-finding and/or searching for missing aircraft without incurring the expense and risk of using real aircraft and ground search resources. The program places a hidden ELT on a map and enables the user to search for the location of the ELT by moving a 14 NASA Tech Briefs, March 2005 small aircraft image around the map while observing signal-strength and direction readings on a simulated direction- finding locator instrument. As the simulated aircraft is turned and moved on the map, the program updates the readings on the direction-finding instrument to reflect the current position and heading of the aircraft relative to the location of the ELT. The software is distributed in a zip file that contains an installation program. The software runs on the Microsoft Windows 9x, NT, and XP operating systems.

  12. Two Quantum Direct Communication Protocols Based on Quantum Search Algorithm

    NASA Astrophysics Data System (ADS)

    Xu, Shu-Jiang; Chen, Xiu-Bo; Wang, Lian-Hai; Niu, Xin-Xin; Yang, Yi-Xian

    2015-07-01

    Based on the properties of two-qubit Grover's quantum search algorithm, we propose two quantum direct communication protocols, including a deterministic secure quantum communication and a quantum secure direct communication protocol. Secret messages can be directly sent from the sender to the receiver by using two-qubit unitary operations and the single photon measurement with one of the proposed protocols. Theoretical analysis shows that the security of the proposed protocols can be highly ensured.

  13. Fencing network direct memory access data transfers in a parallel active messaging interface of a parallel computer

    DOEpatents

    Blocksome, Michael A.; Mamidala, Amith R.

    2015-07-07

    Fencing direct memory access (`DMA`) data transfers in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI including data communications endpoints, each endpoint including specifications of a client, a context, and a task, the endpoints coupled for data communications through the PAMI and through DMA controllers operatively coupled to a deterministic data communications network through which the DMA controllers deliver data communications deterministically, including initiating execution through the PAMI of an ordered sequence of active DMA instructions for DMA data transfers between two endpoints, effecting deterministic DMA data transfers through a DMA controller and the deterministic data communications network; and executing through the PAMI, with no FENCE accounting for DMA data transfers, an active FENCE instruction, the FENCE instruction completing execution only after completion of all DMA instructions initiated prior to execution of the FENCE instruction for DMA data transfers between the two endpoints.

  14. Fencing network direct memory access data transfers in a parallel active messaging interface of a parallel computer

    DOEpatents

    Blocksome, Michael A.; Mamidala, Amith R.

    2015-07-14

    Fencing direct memory access (`DMA`) data transfers in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI including data communications endpoints, each endpoint including specifications of a client, a context, and a task, the endpoints coupled for data communications through the PAMI and through DMA controllers operatively coupled to a deterministic data communications network through which the DMA controllers deliver data communications deterministically, including initiating execution through the PAMI of an ordered sequence of active DMA instructions for DMA data transfers between two endpoints, effecting deterministic DMA data transfers through a DMA controller and the deterministic data communications network; and executing through the PAMI, with no FENCE accounting for DMA data transfers, an active FENCE instruction, the FENCE instruction completing execution only after completion of all DMA instructions initiated prior to execution of the FENCE instruction for DMA data transfers between the two endpoints.

  15. Predicted rates for direct WIMP searches

    E-print Network

    J. D. Vergados

    2012-01-26

    The differential event rate for direct detection of dark matter, both the time averaged and the modulated one due to the motion of the Earth, are discussed. The calculations focus on relatively light cold dark matter candidates (WIMP) and low energy transfers. It is shown that for some WIMP masses the modulation amplitude may change sign. This effect can be exploited to yield information about the mass of the dark matter candidate.

  16. Direct Search for Low Mass Dark Matter Particles with CCDs

    DOE PAGESBeta

    Barreto, J.; Cease, H.; Diehl, H. T.; Estrada, J.; Flaugher, B.; Harrison, N.; Jones, J.; Kilminster, B.; Molina, J.; Smith, J.; et al

    2012-05-15

    A direct dark matter search is performed using fully-depleted high-resistivity CCD detectors. Due to their low electronic readout noise (RMS ~7 eV) these devices operate with a very low detection threshold of 40 eV, making the search for dark matter particles with low masses (~5 GeV) possible. The results of an engineering run performed in a shallow underground site are presented, demonstrating the potential of this technology in the low mass region.

  17. Parallel Best-First Search: The Role of Abstraction Ethan Burns and Sofia Lemons and Wheeler Ruml

    E-print Network

    Ruml, Wheeler

    Parallel Best-First Search: The Role of Abstraction Ethan Burns and Sofia Lemons and Wheeler Ruml Department of Computer Science University of New Hampshire Durham, NH 03824 USA eaburns, sofia.lemons, ruml

  18. A Direct Search for Dirac Magnetic Monopoles

    SciTech Connect

    Mulhearn, Michael James

    2004-10-01

    Magnetic monopoles are highly ionizing and curve in the direction of the magnetic field. A new dedicated magnetic monopole trigger at CDF, which requires large light pulses in the scintillators of the time-of-flight system, remains highly efficient to monopoles while consuming a tiny fraction of the available trigger bandwidth. A specialized offline reconstruction checks the central drift chamber for large dE/dx tracks which do not curve in the plane perpendicular to the magnetic field. We observed zero monopole candidate events in 35.7 pb{sup -1} of proton-antiproton collisions at {radical}s = 1.96 TeV. This implies a monopole production cross section limit {sigma} < 0.2 pb for monopoles with mass between 100 and 700 GeV, and, for a Drell-Yan like pair production mechanism, a mass limit m > 360 GeV.

  19. Evidence for parallel consolidation of motion direction and orientation into visual short-term memory.

    PubMed

    Rideaux, Reuben; Apthorp, Deborah; Edwards, Mark

    2015-09-01

    Recent findings have suggested the capacity to consolidate multiple items into visual short-term memory in parallel varies as a function of the type of information. That is, while color can be consolidated in parallel (JEP:HPP 2012, 429-438), evidence suggests that orientation cannot (APP 2013, 415-425). Here we investigated the capacity to consolidate multiple motion directions in parallel and re-examined this capacity using orientation. This was achieved by using a matching task to determine the shortest exposure duration necessary to consolidate a single item, then examining whether two items, presented simultaneously, could be consolidated in that time. The results show that parallel consolidation of direction and orientation information is possible. Additionally, we demonstrate the importance of adequate separation between intervals used to define items along a feature dimension when attempting to consolidate in parallel, suggesting that when multiple items are consolidated in parallel, as opposed to serially, the resolution of representations suffer. That is, performance is markedly poorer for parallel consolidation, compared to serial, when items are more similar, which is likely a result of low resolution representations being mistaken as neighboring items during the matching stage of the task. Finally, consistent with this interpretation, we showed that facilitation of spatial attention mitigates this affect, indicating that the deterioration of item resolution during parallel consolidation likely occurs during the encoding stage. Together, these results suggest that the variation in parallel consolidation efficiency observed for different features may, at least partially, be a result of the size of the feature perceptual space, i.e. the resolution at which features are processed relative to the size of their physical dimension. Meeting abstract presented at VSS 2015. PMID:26326644

  20. Potency-directed similarity searching using support vector machines.

    PubMed

    Wassermann, Anne M; Heikamp, Kathrin; Bajorath, Jürgen

    2011-01-01

    Support vector machine modeling has become increasingly popular in chemoinformatics. Recently, several advanced support vector machine applications have been reported including, among others, multitask learning for ligand-target prediction. Here, we introduce another support vector machine approach to add compound potency information to similarity searching and enrich database selection sets with potent hits. For this purpose, we introduce a structure-activity kernel function and a potency-oriented support vector machine linear combination approach. Using fingerprint descriptors, potency-directed support vector machine searching has been successfully applied to four high-throughput screening data sets, and different support vector machine strategies have been compared. For potency-balanced compound reference sets, potency-directed support vector machine searching meets or exceeds recall rates of standard support vector machine calculations but detects many more potent hits. PMID:21114788

  1. Topology search of 3-DOF translational parallel manipulators with three identical limbs for leg mechanisms

    NASA Astrophysics Data System (ADS)

    Wang, Mingfeng; Ceccarelli, Marco

    2015-07-01

    Three-degree of freedom(3-DOF) translational parallel manipulators(TPMs) have been widely studied both in industry and academia in the past decades. However, most architectures of 3-DOF TPMs are created mainly on designers' intuition, empirical knowledge, or associative reasoning and the topology synthesis researches of 3-DOF TPMs are still limited. In order to find out the atlas of designs for 3-DOF TPMs, a topology search is presented for enumeration of 3-DOF TPMs whose limbs can be modeled as 5-DOF serial chains. The proposed topology search of 3-DOF TPMs is aimed to overcome the sensitivities of the design solution of a 3-DOF TPM for a LARM leg mechanism in a biped robot. The topology search, which is based on the concept of generation and specialization in graph theory, is reported as a step-by-step procedure with desired specifications, principle and rules of generalization, design requirements and constraints, and algorithm of number synthesis. In order to obtain new feasible designs for a chosen example and to limit the search domain under general considerations, one topological generalized kinematic chain is chosen to be specialized. An atlas of new feasible designs is obtained and analyzed for a specific solution as leg mechanisms. The proposed methodology provides a topology search for 3-DOF TPMs for leg mechanisms, but it can be also expanded for other applications and tasks.

  2. Integrating Direct CP Search and CP-based Column Generation

    E-print Network

    Panagiotis, Stamatopoulos

    Integrating Direct CP Search and CP-based Column Generation for the Airline Crew Assignment Problem,takisg@di.uoa.gr Abstract. We introduce a hybrid approach integrating CP-based Col- umn Generation and pure CP methods of methods from CP and OR results in an algorithm that overcomes the inherent weaknesses of each approach

  3. Direct searches for Dark Matter Particles: WIMPs and axions

    E-print Network

    Igor G. Irastorza

    2005-09-18

    WIMPs and axions are the two best motivated candidates to compose the Dark Matter of the Universe. An important number of experimental groups are developing and using different techniques for their direct detection. An updated review of current searches is done, emphasizing latest results

  4. Worst Case Complexity of Direct Search under Convexity M. Dodangeh

    E-print Network

    Vicente, Luís Nunes

    -search methods (of directional type), meaning making Department of Mathematics, University of Coimbra, 3001-501 Coimbra, Portugal (dodangeh@mat.uc.pt). Support for this author was provided by FCT under the scholarship SFRH/BD/51168/2010. CMUC, Department of Mathematics, University of Coimbra, 3001-501 Coimbra, Portugal

  5. Status of Indirect (and Direct) Dark Matter searches

    E-print Network

    Cirelli, Marco

    2015-01-01

    This article summarizes the status of Indirect and Direct searches for Dark Matter, with a special focus and a critical look on the former. It is the write-up of a rapporteur talk given at the 34th International Cosmic Ray Conference (ICRC 2015) in The Hague, The Netherlands.

  6. Speeding Up Learning in Real-time Search through Parallel Computing Vinicius Marques Luiz Chaimowicz Renato Ferreira

    E-print Network

    Chaimowicz, Luiz

    Speeding Up Learning in Real-time Search through Parallel Computing Vinicius Marques Luiz Chaimowicz Renato Ferreira Departamento de Ci^encia da Computac¸~ao Universidade Federal de Minas Gerais, Brazil {allonman,chaimo,renato}@dcc.ufmg.br Abstract Real-time search algorithms solve the problem

  7. Internal bremsstrahlung signatures in light of direct dark matter searches

    SciTech Connect

    Garny, Mathias; Ibarra, Alejandro; Pato, Miguel; Vogl, Stefan E-mail: ibarra@tum.de E-mail: stefan.vogl@tum.de

    2013-12-01

    Although proposed long ago, the search for internal bremsstrahlung signatures has only recently been made possible by the excellent energy resolution of ground-based and satellite-borne gamma-ray instruments. Here, we investigate thoroughly the current status of internal bremsstrahlung searches in light of the results of direct dark matter searches and in the framework of a minimal mass-degenerate scenario consisting of a Majorana dark matter particle that couples to a fermion and a scalar via a Yukawa coupling. The upper limits on the annihilation cross section set by Fermi-LAT and H.E.S.S. extend uninterrupted from tens of GeV up to tens of TeV and are rather insensitive to the mass degeneracy in the particle physics model. In contrast, direct searches are best in the moderate to low mass splitting regime, where XENON100 limits overshadow Fermi-LAT and H.E.S.S. up to TeV masses if dark matter couples to one of the light quarks. In our minimal scenario we examine carefully the prospects for GAMMA-400, CTA and XENON1T, all planned to come online in the near future, and find that: (a) CTA and XENON1T are fully complementary, with CTA most sensitive to multi-TeV masses and mass splittings around 10%, and XENON1T probing best small mass splittings up to TeV masses; and (b) current constraints from XENON100 already preclude the observation of any spectral feature with GAMMA-400 in spite of its impressive energy resolution, unless dark matter does not couple predominantly to light quarks. Finally, we point out that, unlike for direct searches, the possibility of detecting thermal relics in upcoming internal bremsstrahlung searches requires, depending on the concrete scenario, boost factors larger than 5–10.

  8. Internal bremsstrahlung signatures in light of direct dark matter searches

    E-print Network

    Mathias Garny; Alejandro Ibarra; Miguel Pato; Stefan Vogl

    2013-12-23

    Although proposed long ago, the search for internal bremsstrahlung signatures has only recently been made possible by the excellent energy resolution of ground-based and satellite-borne gamma-ray instruments. Here, we investigate thoroughly the current status of internal bremsstrahlung searches in light of the results of direct dark matter searches and in the framework of a minimal mass-degenerate scenario consisting of a Majorana dark matter particle that couples to a fermion and a scalar via a Yukawa coupling. The upper limits on the annihilation cross section set by Fermi-LAT and H.E.S.S. extend uninterrupted from tens of GeV up to tens of TeV and are rather insensitive to the mass degeneracy in the particle physics model. In contrast, direct searches are best in the moderate to low mass splitting regime, where XENON100 limits overshadow Fermi-LAT and H.E.S.S. up to TeV masses if dark matter couples to one of the light quarks. In our minimal scenario we examine carefully the prospects for GAMMA-400, CTA and XENON1T, all planned to come online in the near future, and find that: (a) CTA and XENON1T are fully complementary, with CTA most sensitive to multi-TeV masses and mass splittings around 10%, and XENON1T probing best small mass splittings up to TeV masses; and (b) current constraints from XENON100 already preclude the observation of any spectral feature with GAMMA-400 in spite of its impressive energy resolution, unless dark matter does not couple predominantly to light quarks. Finally, we point out that, unlike for direct searches, the possibility of detecting thermal relics in upcoming internal bremsstrahlung searches requires, depending on the concrete scenario, boost factors larger than 5-10.

  9. Direct searches for dark matter: Recent?results

    PubMed Central

    Rosenberg, Leslie J.

    1998-01-01

    There is abundant evidence for large amounts of unseen matter in the universe. This dark matter, by its very nature, couples feebly to ordinary matter and is correspondingly difficult to detect. Nonetheless, several experiments are now underway with the sensitivity required to detect directly galactic halo dark matter through their interactions with matter and radiation. These experiments divide into two broad classes: searches for weakly interacting massive particles (WIMPs) and searches for axions. There exists a very strong theoretical bias for supposing that supersymmetry (SUSY) is a correct description of nature. WIMPs are predicted by this SUSY theory and have the required properties to be dark matter. These WIMPs are detected from the byproducts of their occasional recoil against nucleons. There are efforts around the world to detect these rare recoils. The WIMP part of this overview focuses on the cryogenic dark matter search (CDMS) underway in California. Axions, another favored dark matter candidate, are predicted to arise from a minimal extension of the standard model that explains the absence of the expected large CP violating effects in strong interactions. Axions can, in the presence of a large magnetic field, turn into microwave photons. It is the slight excess of photons above noise that signals the axion. Axion searches are underway in California and Japan. The axion part of this overview focuses on the California effort. Brevity does not allow me to discuss other WIMP and axion searches, likewise for accelerator and satellite based searches; I apologize for their omission. PMID:9419325

  10. Parallel implementation of 3D protein structure similarity searches using a GPU and the CUDA.

    PubMed

    Mrozek, Dariusz; Bro?ek, Mi?osz; Ma?ysiak-Mrozek, Bo?ena

    2014-02-01

    Searching for similar 3D protein structures is one of the primary processes employed in the field of structural bioinformatics. However, the computational complexity of this process means that it is constantly necessary to search for new methods that can perform such a process faster and more efficiently. Finding molecular substructures that complex protein structures have in common is still a challenging task, especially when entire databases containing tens or even hundreds of thousands of protein structures must be scanned. Graphics processing units (GPUs) and general purpose graphics processing units (GPGPUs) can perform many time-consuming and computationally demanding processes much more quickly than a classical CPU can. In this paper, we describe the GPU-based implementation of the CASSERT algorithm for 3D protein structure similarity searching. This algorithm is based on the two-phase alignment of protein structures when matching fragments of the compared proteins. The GPU (GeForce GTX 560Ti: 384 cores, 2GB RAM) implementation of CASSERT ("GPU-CASSERT") parallelizes both alignment phases and yields an average 180-fold increase in speed over its CPU-based, single-core implementation on an Intel Xeon E5620 (2.40GHz, 4 cores). In this paper, we show that massive parallelization of the 3D structure similarity search process on many-core GPU devices can reduce the execution time of the process, allowing it to be performed in real time. GPU-CASSERT is available at: http://zti.polsl.pl/dmrozek/science/gpucassert/cassert.htm. PMID:24481593

  11. J. Parallel Distrib. Comput. 7980 (2015) 315 Contents lists available at ScienceDirect

    E-print Network

    Melbourne, University of

    2015-01-01

    . Parallel Distrib. Comput. journal homepage: www.elsevier.com/locate/jpdc Big Data computing and clouds directions for Cloud-based analytics and Big Data. a r t i c l e i n f o Article history: Received 25 October Keywords: Big Data Cloud computing Analytics Data management a b s t r a c t This paper discusses

  12. Parallel electric fields in the upward current region of the aurora: Indirect and direct observations

    E-print Network

    Carlson, Charles W.

    Parallel electric fields in the upward current region of the aurora: Indirect and direct current region of the aurora focusing on the structure of electric fields at the boundary between account of the electric fields in the upward current region of the aurora as observed by the Fast Auroral

  13. Directed Search for Continuous Gravitational Waves from the Galactic Center

    NASA Technical Reports Server (NTRS)

    Blackburn, Lindy L.; Camp, Jordan B.; Kanner, J. B.; Gehrels, Neil; Graff, Philip B.; Aasi, J.; Abadie, J.; Abbott, R.; Abbott, T.; Abernathy, M. R..; Accadia, T.; Adams, C.; Adams, T.; Adhikari, R. X.; Affeldt, C.; Agathos, M.; Aggarwal, N.; Aguiar, O. D.; Ajith, P.; Allen, B.; Ceron, E. Amador; Amariutei, D.; Anderson, R. A.; Anderson, S. B.; Anderson, W. G.

    2013-01-01

    We present the results of a directed search for continuous gravitational waves from unknown, isolated neutron stars in the Galactic center region, performed on two years of data from LIGO's fifth science run from two LIGO detectors. The search uses a semicoherent approach, analyzing coherently 630 segments, each spanning 11.5 hours, and then incoherently combining the results of the single segments. It covers gravitational wave frequencies in a range from 78 to 496 Hz and a frequency-dependent range of first-order spindown values down to -7.86x10(exp -8) Hz/s at the highest frequency. No gravitational waves were detected. The 90% confidence upper limits on the gravitational wave amplitude of sources at the Galactic center are approx. 3.35x 10(exp -25) for frequencies near 150 Hz. These upper limits are the most constraining to date for a large-parameter-space search for continuous gravitational wave signals.

  14. Directed search for continuous gravitational waves from the Galactic center

    NASA Astrophysics Data System (ADS)

    Aasi, J.; Abadie, J.; Abbott, B. P.; Abbott, R.; Abbott, T.; Abernathy, M. R.; Accadia, T.; Acernese, F.; Adams, C.; Adams, T.; Adhikari, R. X.; Affeldt, C.; Agathos, M.; Aggarwal, N.; Aguiar, O. D.; Ajith, P.; Allen, B.; Allocca, A.; Amador Ceron, E.; Amariutei, D.; Anderson, R. A.; Anderson, S. B.; Anderson, W. G.; Arai, K.; Araya, M. C.; Arceneaux, C.; Areeda, J.; Ast, S.; Aston, S. M.; Astone, P.; Aufmuth, P.; Aulbert, C.; Austin, L.; Aylott, B. E.; Babak, S.; Baker, P. T.; Ballardin, G.; Ballmer, S. W.; Barayoga, J. C.; Barker, D.; Barnum, S. H.; Barone, F.; Barr, B.; Barsotti, L.; Barsuglia, M.; Barton, M. A.; Bartos, I.; Bassiri, R.; Basti, A.; Batch, J.; Bauchrowitz, J.; Bauer, Th. S.; Bebronne, M.; Behnke, B.; Bejger, M.; Beker, M. G.; Bell, A. S.; Bell, C.; Belopolski, I.; Bergmann, G.; Berliner, J. M.; Bertolini, A.; Bessis, D.; Betzwieser, J.; Beyersdorf, P. T.; Bhadbhade, T.; Bilenko, I. A.; Billingsley, G.; Birch, J.; Bitossi, M.; Bizouard, M. A.; Black, E.; Blackburn, J. K.; Blackburn, L.; Blair, D.; Blom, M.; Bock, O.; Bodiya, T. P.; Boer, M.; Bogan, C.; Bond, C.; Bondu, F.; Bonelli, L.; Bonnand, R.; Bork, R.; Born, M.; Bose, S.; Bosi, L.; Bowers, J.; Bradaschia, C.; Brady, P. R.; Braginsky, V. B.; Branchesi, M.; Brannen, C. A.; Brau, J. E.; Breyer, J.; Briant, T.; Bridges, D. O.; Brillet, A.; Brinkmann, M.; Brisson, V.; Britzger, M.; Brooks, A. F.; Brown, D. A.; Brown, D. D.; Brückner, F.; Bulik, T.; Bulten, H. J.; Buonanno, A.; Buskulic, D.; Buy, C.; Byer, R. L.; Cadonati, L.; Cagnoli, G.; Calderón Bustillo, J.; Calloni, E.; Camp, J. B.; Campsie, P.; Cannon, K. C.; Canuel, B.; Cao, J.; Capano, C. D.; Carbognani, F.; Carbone, L.; Caride, S.; Castiglia, A.; Caudill, S.; Cavaglià, M.; Cavalier, F.; Cavalieri, R.; Cella, G.; Cepeda, C.; Cesarini, E.; Chakraborty, R.; Chalermsongsak, T.; Chao, S.; Charlton, P.; Chassande-Mottin, E.; Chen, X.; Chen, Y.; Chincarini, A.; Chiummo, A.; Cho, H. S.; Chow, J.; Christensen, N.; Chu, Q.; Chua, S. S. Y.; Chung, S.; Ciani, G.; Clara, F.; Clark, D. E.; Clark, J. A.; Cleva, F.; Coccia, E.; Cohadon, P.-F.; Colla, A.; Colombini, M.; Constancio, M., Jr.; Conte, A.; Conte, R.; Cook, D.; Corbitt, T. R.; Cordier, M.; Cornish, N.; Corsi, A.; Costa, C. A.; Coughlin, M. W.; Coulon, J.-P.; Countryman, S.; Couvares, P.; Coward, D. M.; Cowart, M.; Coyne, D. C.; Craig, K.; Creighton, J. D. E.; Creighton, T. D.; Crowder, S. G.; Cumming, A.; Cunningham, L.; Cuoco, E.; Dahl, K.; Dal Canton, T.; Damjanic, M.; Danilishin, S. L.; D'Antonio, S.; Danzmann, K.; Dattilo, V.; Daudert, B.; Daveloza, H.; Davier, M.; Davies, G. S.; Daw, E. J.; Day, R.; Dayanga, T.; De Rosa, R.; Debreczeni, G.; Degallaix, J.; Del Pozzo, W.; Deleeuw, E.; Deléglise, S.; Denker, T.; Dent, T.; Dereli, H.; Dergachev, V.; DeRosa, R.; DeSalvo, R.; Dhurandhar, S.; Di Fiore, L.; Di Lieto, A.; Di Palma, I.; Di Virgilio, A.; Díaz, M.; Dietz, A.; Dmitry, K.; Donovan, F.; Dooley, K. L.; Doravari, S.; Drago, M.; Drever, R. W. P.; Driggers, J. C.; Du, Z.; Dumas, J.-C.; Dwyer, S.; Eberle, T.; Edwards, M.; Effler, A.; Ehrens, P.; Eichholz, J.; Eikenberry, S. S.; Endr?czi, G.; Essick, R.; Etzel, T.; Evans, K.; Evans, M.; Evans, T.; Factourovich, M.; Fafone, V.; Fairhurst, S.; Fang, Q.; Farr, B.; Farr, W.; Favata, M.; Fazi, D.; Fehrmann, H.; Feldbaum, D.; Ferrante, I.; Ferrini, F.; Fidecaro, F.; Finn, L. S.; Fiori, I.; Fisher, R.; Flaminio, R.; Foley, E.; Foley, S.; Forsi, E.; Forte, L. A.; Fotopoulos, N.; Fournier, J.-D.; Franco, S.; Frasca, S.; Frasconi, F.; Frede, M.; Frei, M.; Frei, Z.; Freise, A.; Frey, R.; Fricke, T. T.; Fritschel, P.; Frolov, V. V.; Fujimoto, M.-K.; Fulda, P.; Fyffe, M.; Gair, J.; Gammaitoni, L.; Garcia, J.; Garufi, F.; Gehrels, N.; Gemme, G.; Genin, E.; Gennai, A.; Gergely, L.; Ghosh, S.; Giaime, J. A.; Giampanis, S.; Giardina, K. D.; Giazotto, A.; Gil-Casanova, S.; Gill, C.; Gleason, J.; Goetz, E.; Goetz, R.; Gondan, L.; González, G.; Gordon, N.; Gorodetsky, M. L.; Gossan, S.; Goßler, S.; Gouaty, R.; Graef, C.; Graff, P. B.; Granata, M.; Grant, A.; Gras, S.; Gray, C.; Greenhalgh, R. J. S.; Gretarsson, A. M.; Griffo, C.; Grote, H.; Grover, K.; Grunewald, S.; Guidi, G. M.; Guido, C.; Gushwa, K. E.; Gustafson, E. K.; Gustafson, R.; Hall, B.; Hall, E.; Hammer, D.; Hammond, G.; Hanke, M.; Hanks, J.; Hanna, C.; Hanson, J.; Harms, J.; Harry, G. M.; Harry, I. W.; Harstad, E. D.; Hartman, M. T.; Haughian, K.; Hayama, K.; Heefner, J.; Heidmann, A.; Heintze, M.; Heitmann, H.; Hello, P.; Hemming, G.; Hendry, M.; Heng, I. S.; Heptonstall, A. W.; Heurs, M.; Hild, S.; Hoak, D.; Hodge, K. A.; Holt, K.; Holtrop, M.; Hong, T.; Hooper, S.; Horrom, T.; Hosken, D. J.; Hough, J.; Howell, E. J.; Hu, Y.; Hua, Z.; Huang, V.; Huerta, E. A.; Hughey, B.; Husa, S.; Huttner, S. H.; Huynh, M.; Huynh-Dinh, T.; Iafrate, J.; Ingram, D. R.

    2013-11-01

    We present the results of a directed search for continuous gravitational waves from unknown, isolated neutron stars in the Galactic center region, performed on two years of data from LIGO’s fifth science run from two LIGO detectors. The search uses a semicoherent approach, analyzing coherently 630 segments, each spanning 11.5 hours, and then incoherently combining the results of the single segments. It covers gravitational wave frequencies in a range from 78 to 496 Hz and a frequency-dependent range of first-order spindown values down to -7.86×10-8Hz/s at the highest frequency. No gravitational waves were detected. The 90% confidence upper limits on the gravitational wave amplitude of sources at the Galactic center are ˜3.35×10-25 for frequencies near 150 Hz. These upper limits are the most constraining to date for a large-parameter-space search for continuous gravitational wave signals.

  15. Tidal streams from axion miniclusters and direct axion searches

    E-print Network

    Peter Tinyakov; Igor Tkachev; Konstantin Zioutas

    2015-12-09

    In some axion dark matter models a dominant fraction of axions resides in dense small-scale substructures, axion miniclusters. A fraction of these substructures is disrupted and forms tidal streams where the axion density may still be an order of magnitude larger than the average. We discuss implications of these streams for the direct axion searches. We estimate the fraction of disrupted miniclusters and the parameters of the resulting streams, and find that stream-crossing events would occur at a rate of about $1/(20 {\\rm yr})$ for 2-3 days, during which the signal in axion detectors would be amplified by a factor $\\sim 10$. These estimates suggest that the effect of the tidal disruption of axion miniclusters may be important for direct axion searches and deserves a more thorough study.

  16. A direct-execution parallel architecture for the Advanced Continuous Simulation Language (ACSL)

    NASA Technical Reports Server (NTRS)

    Carroll, Chester C.; Owen, Jeffrey E.

    1988-01-01

    A direct-execution parallel architecture for the Advanced Continuous Simulation Language (ACSL) is presented which overcomes the traditional disadvantages of simulations executed on a digital computer. The incorporation of parallel processing allows the mapping of simulations into a digital computer to be done in the same inherently parallel manner as they are currently mapped onto an analog computer. The direct-execution format maximizes the efficiency of the executed code since the need for a high level language compiler is eliminated. Resolution is greatly increased over that which is available with an analog computer without the sacrifice in execution speed normally expected with digitial computer simulations. Although this report covers all aspects of the new architecture, key emphasis is placed on the processing element configuration and the microprogramming of the ACLS constructs. The execution times for all ACLS constructs are computed using a model of a processing element based on the AMD 29000 CPU and the AMD 29027 FPU. The increase in execution speed provided by parallel processing is exemplified by comparing the derived execution times of two ACSL programs with the execution times for the same programs executed on a similar sequential architecture.

  17. Direct kinematics solution architectures for industrial robot manipulators: Bit-serial versus parallel

    NASA Technical Reports Server (NTRS)

    Lee, J.; Kim, K.

    1991-01-01

    A Very Large Scale Integration (VLSI) architecture for robot direct kinematic computation suitable for industrial robot manipulators was investigated. The Denavit-Hartenberg transformations are reviewed to exploit a proper processing element, namely an augmented CORDIC. Specifically, two distinct implementations are elaborated on, such as the bit-serial and parallel. Performance of each scheme is analyzed with respect to the time to compute one location of the end-effector of a 6-links manipulator, and the number of transistors required.

  18. SUPREM-DSMC: A New Scalable, Parallel, Reacting, Multidimensional Direct Simulation Monte Carlo Flow Code

    NASA Technical Reports Server (NTRS)

    Campbell, David; Wysong, Ingrid; Kaplan, Carolyn; Mott, David; Wadsworth, Dean; VanGilder, Douglas

    2000-01-01

    An AFRL/NRL team has recently been selected to develop a scalable, parallel, reacting, multidimensional (SUPREM) Direct Simulation Monte Carlo (DSMC) code for the DoD user community under the High Performance Computing Modernization Office (HPCMO) Common High Performance Computing Software Support Initiative (CHSSI). This paper will introduce the JANNAF Exhaust Plume community to this three-year development effort and present the overall goals, schedule, and current status of this new code.

  19. Parallel spatial direct numerical simulations on the Intel iPSC/860 hypercube

    NASA Technical Reports Server (NTRS)

    Joslin, Ronald D.; Zubair, Mohammad

    1993-01-01

    The implementation and performance of a parallel spatial direct numerical simulation (PSDNS) approach on the Intel iPSC/860 hypercube is documented. The direct numerical simulation approach is used to compute spatially evolving disturbances associated with the laminar-to-turbulent transition in boundary-layer flows. The feasibility of using the PSDNS on the hypercube to perform transition studies is examined. The results indicate that the direct numerical simulation approach can effectively be parallelized on a distributed-memory parallel machine. By increasing the number of processors nearly ideal linear speedups are achieved with nonoptimized routines; slower than linear speedups are achieved with optimized (machine dependent library) routines. This slower than linear speedup results because the Fast Fourier Transform (FFT) routine dominates the computational cost and because the routine indicates less than ideal speedups. However with the machine-dependent routines the total computational cost decreases by a factor of 4 to 5 compared with standard FORTRAN routines. The computational cost increases linearly with spanwise wall-normal and streamwise grid refinements. The hypercube with 32 processors was estimated to require approximately twice the amount of Cray supercomputer single processor time to complete a comparable simulation; however it is estimated that a subgrid-scale model which reduces the required number of grid points and becomes a large-eddy simulation (PSLES) would reduce the computational cost and memory requirements by a factor of 10 over the PSDNS. This PSLES implementation would enable transition simulations on the hypercube at a reasonable computational cost.

  20. Information processing in parallel through directionally resolved molecular polarization components in coherent multidimensional spectroscopy.

    PubMed

    Yan, Tian-Min; Fresch, Barbara; Levine, R D; Remacle, F

    2015-08-14

    We propose that information processing can be implemented by measuring the directional components of the macroscopic polarization of an ensemble of molecules subject to a sequence of laser pulses. We describe the logic operation theoretically and demonstrate it by simulations. The measurement of integrated stimulated emission in different phase matching spatial directions provides a logic decomposition of a function that is the discrete analog of an integral transform. The logic operation is reversible and all the possible outputs are computed in parallel for all sets of possible multivalued inputs. The number of logic variables of the function is the number of laser pulses used in sequence. The logic function that is computed depends on the chosen chromophoric molecular complex and on its interactions with the solvent and on the two time intervals between the three pulses and the pulse strengths and polarizations. The outputs are the homodyne detected values of the polarization components that are measured in the allowed phase matching macroscopic directions, kl, kl=?iliki where ki is the propagation direction of the ith pulse and {li} is a set of integers that encodes the multivalued inputs. Parallelism is inherently implemented because all the partial polarizations that define the outputs are processed simultaneously. The outputs, which are read directly on the macroscopic level, can be multivalued because the high dynamical range of partial polarization measurements by nonlinear coherent spectroscopy allows for fine binning of the signals. The outputs are uniquely related to the inputs so that the logic is reversible. PMID:26277126

  1. Information processing in parallel through directionally resolved molecular polarization components in coherent multidimensional spectroscopy

    NASA Astrophysics Data System (ADS)

    Yan, Tian-Min; Fresch, Barbara; Levine, R. D.; Remacle, F.

    2015-08-01

    We propose that information processing can be implemented by measuring the directional components of the macroscopic polarization of an ensemble of molecules subject to a sequence of laser pulses. We describe the logic operation theoretically and demonstrate it by simulations. The measurement of integrated stimulated emission in different phase matching spatial directions provides a logic decomposition of a function that is the discrete analog of an integral transform. The logic operation is reversible and all the possible outputs are computed in parallel for all sets of possible multivalued inputs. The number of logic variables of the function is the number of laser pulses used in sequence. The logic function that is computed depends on the chosen chromophoric molecular complex and on its interactions with the solvent and on the two time intervals between the three pulses and the pulse strengths and polarizations. The outputs are the homodyne detected values of the polarization components that are measured in the allowed phase matching macroscopic directions, kl, k l = ? i l i k i where ki is the propagation direction of the ith pulse and {li} is a set of integers that encodes the multivalued inputs. Parallelism is inherently implemented because all the partial polarizations that define the outputs are processed simultaneously. The outputs, which are read directly on the macroscopic level, can be multivalued because the high dynamical range of partial polarization measurements by nonlinear coherent spectroscopy allows for fine binning of the signals. The outputs are uniquely related to the inputs so that the logic is reversible.

  2. A direct search for energetic electrons produced by laboratory sparks

    NASA Astrophysics Data System (ADS)

    Carlson, B. E.; Kochkin, P.; van Deursen, A. P. J.; Hansen, R.; Gjesteland, T.; Ostgaard, N.

    2012-04-01

    High-voltage sparks in the lab unexpectedly emit x-rays with energies up to several hundred keV. These x-rays have been observed repeatedly and can only be produced by bremsstrahlung, impling the presence of a population of energetic electrons. Such energetic electron and x-ray production may be important for the physics of streamers, spark discharges, and lightning, and has been suggested as directly related to the production of terrestrial gamma-ray flashes. We present the results of the first direct search for energetic electrons produced by a lab spark. Small electrically-isolated scintillators are placed at various locations near the spark gap of a 2 MV Marx generator and the resulting signals are recorded. We present results on the spatial, temporal, and statistical variability of signals produced by energetic electrons and compare our results to predictions of energetic electron production from the literature.

  3. An Automated Directed Spectral Search Methodology for Small Target Detection

    NASA Astrophysics Data System (ADS)

    Grossman, Stanley I.

    Much of the current efforts in remote sensing tackle macro-level problems such as determining the extent of wheat in a field, the general health of vegetation or the extent of mineral deposits in an area. However, for many of the remaining remote sensing challenges being studied currently, such as border protection, drug smuggling, treaty verification, and the war on terror, most targets are very small in nature - a vehicle or even a person. While in typical macro-level problems the objective vegetation is in the scene, for small target detection problems it is not usually known if the desired small target even exists in the scene, never mind finding it in abundance. The ability to find specific small targets, such as vehicles, typifies this problem. Complicating the analyst's life, the growing number of available sensors is generating mountains of imagery outstripping the analysts' ability to visually peruse them. This work presents the important factors influencing spectral exploitation using multispectral data and suggests a different approach to small target detection. The methodology of directed search is presented, including the use of scene-modeled spectral libraries, various search algorithms, and traditional statistical and ROC curve analysis. The work suggests a new metric to calibrate analysis labeled the analytic sweet spot as well as an estimation method for identifying the sweet spot threshold for an image. It also suggests a new visualization aid for highlighting the target in its entirety called nearest neighbor inflation (NNI). It brings these all together to propose that these additions to the target detection arena allow for the construction of a fully automated target detection scheme. This dissertation next details experiments to support the hypothesis that the optimum detection threshold is the analytic sweet spot and that the estimation method adequately predicts it. Experimental results and analysis are presented for the proposed directed search techniques of spectral image based small target detection. It offers evidence of the functionality of the NNI visualization and also provides evidence that the increased spectral dimensionality of the 8-band Worldview-2 datasets provides noteworthy improvement in results over traditional 4-band multispectral datasets. The final experiment presents the results from a prototype fully automated target detection scheme in support of the overarching premise. This work establishes the analytic sweet spot as the optimum threshold defined as the point where error detection rate curves -- false detections vs. missing detections -- cross. At this point the errors are minimized while the detection rate is maximized. It then demonstrates that taking the first moment statistic of the histogram of calculated target detection values from a detection search with test threshold set arbitrarily high will estimate the analytic sweet spot for that image. It also demonstrates that directed search techniques -- when utilized with appropriate scene-specific modeled signatures and atmospheric compensations -- perform at least as well as in-scene search techniques 88% of the time and grossly under-performing only 11% of the time; the in-scene only performs as well or better 50% of the time. It further demonstrates the clear advantage increased multispectral dimensionality brings to detection searches improving performance in 50% of the cases while performing at least as well 72% of the time. Lastly, it presents evidence that a fully automated prototype performs as anticipated laying the groundwork for further research into fully automated processes for small target detection.

  4. Direct and Inverse Kinematics of a Novel Tip-Tilt-Piston Parallel Manipulator

    NASA Technical Reports Server (NTRS)

    Tahmasebi, Farhad

    2004-01-01

    Closed-form direct and inverse kinematics of a new three degree-of-freedom (DOF) parallel manipulator with inextensible limbs and base-mounted actuators are presented. The manipulator has higher resolution and precision than the existing three DOF mechanisms with extensible limbs. Since all of the manipulator actuators are base-mounted; higher payload capacity, smaller actuator sizes, and lower power dissipation can be obtained. The manipulator is suitable for alignment applications where only tip, tilt, and piston motions are significant. The direct kinematics of the manipulator is reduced to solving an eighth-degree polynomial in the square of tangent of half-angle between one of the limbs and the base plane. Hence, there are at most 16 assembly configurations for the manipulator. In addition, it is shown that the 16 solutions are eight pairs of reflected configurations with respect to the base plane. Numerical examples for the direct and inverse kinematics of the manipulator are also presented.

  5. Direct Dark Matter Searches with CDMS and XENON

    E-print Network

    Kaixuan Ni; Laura Baudis

    2006-11-09

    The Cryogenic Dark Matter Search (CDMS) and XENON experiments aim to directly detect dark matter in the form of weakly interacting massive particles (WIMPs) via their elastic scattering on the target nuclei. The experiments use different techniques to suppress background event rates to the minimum, and at the same time, to achieve a high WIMP detection rate. The operation of cryogenic Ge and Si crystals of the CDMS-II experiment in the Soudan mine yielded the most stringent spin-independent WIMP-nucleon cross-section (~10^{-43} cm^2) at a WIMP mass of 60 GeV/c^2. The two-phase xenon detector of the XENON10 experiment is currently taking data in the Gran Sasso underground lab and promising preliminary results were recently reported. Both experiments are expected to increase their WIMP sensitivity by a one order of magnitude in the scheduled science runs for 2007.

  6. Direct Dark Matter Search with XMASS-I

    E-print Network

    ,

    2015-01-01

    XMASS-I uses single phase liquid xenon technology for aiming at the direct detection of dark matter. The detector observes only scintillation light by 2 inch 642 PMTs which are placed in sphere shape around an active volume. With its large mass target and high photoelectron yield, we conducted a search for dark matter by annual modulation with 832 kg $\\times$ 359.2 days exposure of data. We find no modulation signal in the data so that we set an upper limit 4.3$\\times10^{-41} \\rm{cm}^{2} $ at WIMP mass of 8 GeV/$c^{2}$ which excluded an interpreted DAMA/LIBRA allowed region.

  7. Direct dark matter searches - Test of the Big Bounce Cosmology

    E-print Network

    Cheung, Yeuk-Kwan E

    2014-01-01

    We consider the possibility of using dark matter particle's mass and its interaction cross section as a smoking gun signal of the existence of a Big Bounce at the early stage in the evolution of our currently observed universe. A study of dark matter production in the pre-bounce contraction and the post bounce expansion epochs of this universe reveals a new venue for achieving the observed relic abundance of our present universe, in which a significantly smaller amount of dark matter with a smaller cross section is produced and the information about the bounce universe evolution is preserved by the out-of-thermal-equilibrium process. Once the value of dark matter mass and interaction cross section are obtained by direct detection in laboratories, this alternative route becomes a signature prediction of the bounce universe scenario. This leads us to consider a scalar dark matter candidate, which if it is light, has important implications on dark matter searches.

  8. Direct Dark Matter Search with XMASS-I

    E-print Network

    Masaki Yamashita for the XMASS collaboration

    2015-11-24

    XMASS-I uses single phase liquid xenon technology for aiming at the direct detection of dark matter. The detector observes only scintillation light by 2 inch 642 PMTs which are placed in sphere shape around an active volume. With its large mass target and high photoelectron yield, we conducted a search for dark matter by annual modulation with 832 kg $\\times$ 359.2 days exposure of data. We find no modulation signal in the data so that we set an upper limit 4.3$\\times10^{-41} \\rm{cm}^{2} $ at WIMP mass of 8 GeV/$c^{2}$ which excluded an interpreted DAMA/LIBRA allowed region.

  9. Direct Search for Dark Matter with DarkSide

    NASA Astrophysics Data System (ADS)

    Agnes, P.; Alexander, T.; Alton, A.; Arisaka, K.; Back, H. O.; Baldin, B.; Biery, K.; Bonfini, G.; Bossa, M.; Brigatti, A.; Brodsky, J.; Budano, F.; Cadonati, L.; Calaprice, F.; Canci, N.; Candela, A.; Cao, H.; Cariello, M.; Cavalcante, P.; Chavarria, A.; Chepurnov, A.; Cocco, A. G.; Crippa, L.; D'Angelo, D.; D'Incecco, M.; Davini, S.; De Deo, M.; Derbin, A.; Devoto, A.; Di Eusanio, F.; Di Pietro, G.; Edkins, E.; Empl, A.; Fan, A.; Fiorillo, G.; Fomenko, K.; Forster, G.; Franco, D.; Gabriele, F.; Galbiati, C.; Goretti, A.; Grandi, L.; Gromov, M.; Guan, M. Y.; Guardincerri, Y.; Hackett, B.; Herner, K.; Hungerford, E. V.; Ianni, Al; Ianni, An; Jollet, C.; Keeter, K.; Kendziora, C.; Kidner, S.; Kobychev, V.; Koh, G.; Korablev, D.; Korga, G.; Kurlej, A.; Li, P. X.; Loer, B.; Lombardi, P.; Love, C.; Ludhova, L.; Luitz, S.; Ma, Y. Q.; Machulin, I.; Mandarano, A.; Mari, S.; Maricic, J.; Marini, L.; Martoff, C. J.; Meregaglia, A.; Meroni, E.; Meyers, P. D.; Milincic, R.; Montanari, D.; Montuschi, M.; Monzani, M. E.; Mosteiro, P.; Mount, B.; Muratova, V.; Musico, P.; Nelson, A.; Odrowski, S.; Okounkova, M.; Orsini, M.; Ortica, F.; Pagani, L.; Pallavicini, M.; Pantic, E.; Papp, L.; Parmeggiano, S.; Parsells, R.; Pelczar, K.; Pelliccia, N.; Perasso, S.; Pocar, A.; Pordes, S.; Pugachev, D.; Qian, H.; Randle, K.; Ranucci, G.; Razeto, A.; Reinhold, B.; Renshaw, A.; Romani, A.; Rossi, B.; Rossi, N.; Rountree, S. D.; Sablone, D.; Saggese, P.; Saldanha, R.; Sands, W.; Sangiorgio, S.; Segreto, E.; Semenov, D.; Shields, E.; Skorokhvatov, M.; Smirnov, O.; Sotnikov, A.; Stanford, C.; Suvorov, Y.; Tartaglia, R.; Tatarowicz, J.; Testera, G.; Tonazzo, A.; Unzhakov, E.; Vogelaar, R. B.; Wada, M.; Walker, S.; Wang, H.; Wang, Y.; Watson, A.; Westerdale, S.; Wojcik, M.; Wright, A.; Xiang, X.; Xu, J.; Yang, C. G.; Yoo, J.; Zavatarelli, S.; Zec, A.; Zhu, C.; Zuzel, G.

    2015-11-01

    The DarkSide experiment is designed for the direct detection of Dark Matter with a double phase liquid Argon TPC operating underground at Laboratori Nazionali del Gran Sasso. The TPC is placed inside a 30 tons liquid organic scintillator sphere, acting as a neutron veto, which is in turn installed inside a 1 kt water Cherenkov detector. The current detector is running since November 2013 with a 50 kg atmospheric Argon fill and we report here the first null results of a Dark Matter search for a (1422 ± 67) kg.d exposure. This result correspond to a 90% CL upper limit on the WIMP-nucleon cross section of 6.1 × 10-44 cm2 (for a WIMP mass of 100 GeV/c2) and it's currently the most sensitive limit obtained with an Argon target.

  10. Direct and Indirect Searches for Top-Higgs FCNC Couplings

    E-print Network

    Hoda Hesari; Hamzeh Khanpour; Mojtaba Mohammadi Najafabadi

    2015-11-05

    Large top quark flavor changing through neutral currents is expected by many extensions of the standard model. Direct and indirect searches for flavor changing neutral currents (FCNC) in the top quark decays to an up type quark (up,charm) and a Higgs boson are presented. We show that the presence of top-Higgs FCNC couplings affects the neutron electric dipole moment through the contribution to the up quark electric dipole moment significantly. We find that the future bounds on the neutron and top quark electric dipole moments allows to probe the $Br(t\\rightarrow qH)$ down to $6.62\\times 10^{-7}$. The constraint on the top-Higgs FCNC coupling using the electroweak precision observables of $Z\\rightarrow c\\bar{c}$ decay is also updated. We further probe the observability of the top-Higgs FCNC couplings through the process e$^-$e$^+ \\rightarrow t (\\rightarrow \\ell \

  11. Direct WIMP searches with XENON100 and XENON1T

    NASA Astrophysics Data System (ADS)

    Alfredo Davide, Ferella

    2015-05-01

    The XENON100 experiment is the second phase of the XENON direct Dark Matter search program. It consists of an ultra-low background double phase (liquid-gas) xenon filled time projection chamber with a total mass of 161 kg (62 in the target region and 99 in the active shield), installed at the Laboratori Nazionali del Gran Sasso (LNGS). Here the results from the 224.6 live days of data taken between March 2011 and April 2012 are reported. The experiment set one of the most stringent limits on the WIMP-nucleon spin-independent cross section to date (2 × 10-45 cm2 for a 55 Gev/c2 WIMP mass at 90 % confidence level) and the most stringent on the spin-dependent WIMP-neutron interaction (3.5 × 10-40 for a 45 GeV/c2 WIMP mass). With the same dataset, XENON100 excludes also solar axion coupling to electrons at gAe > 7.7 × 10-12 for a mass of mAxion <1 keV/c2 and galactic axion couplings by gAe > 1 × 10-12 at a mass range of mAxion = 5-10 keV/c2 (both 90 % C.L.). Moreover an absolute spectral comparison between simulated and measured nuclear recoil distributions of light and charge signals from a 241AmBe source demonstrates a high level of detector and systematics understanding. Finally, the third generation of the XENON experiments, XENON1T, is the first tonne scale direct WIMP search experiment currently under construction. The commissioning phase of XENON1T is expected to start in early 2015 followed, a few months after, by the first science run. The experiment will reach sensitivities on the WIMP-nucleon spin-independent cross section down to 2 ×10-47 cm2 after two years of data taking.

  12. A DIRECT METHOD TO DETERMINE THE PARALLEL MEAN FREE PATH OF SOLAR ENERGETIC PARTICLES WITH ADIABATIC FOCUSING

    SciTech Connect

    He, H.-Q.; Wan, W. E-mail: wanw@mail.iggcas.ac.cn

    2012-03-01

    The parallel mean free path of solar energetic particles (SEPs), which is determined by physical properties of SEPs as well as those of solar wind, is a very important parameter in space physics to study the transport of charged energetic particles in the heliosphere, especially for space weather forecasting. In space weather practice, it is necessary to find a quick approach to obtain the parallel mean free path of SEPs for a solar event. In addition, the adiabatic focusing effect caused by a spatially varying mean magnetic field in the solar system is important to the transport processes of SEPs. Recently, Shalchi presented an analytical description of the parallel diffusion coefficient with adiabatic focusing. Based on Shalchi's results, in this paper we provide a direct analytical formula as a function of parameters concerning the physical properties of SEPs and solar wind to directly and quickly determine the parallel mean free path of SEPs with adiabatic focusing. Since all of the quantities in the analytical formula can be directly observed by spacecraft, this direct method would be a very useful tool in space weather research. As applications of the direct method, we investigate the inherent relations between the parallel mean free path and various parameters concerning physical properties of SEPs and solar wind. Comparisons of parallel mean free paths with and without adiabatic focusing are also presented.

  13. Parallel direct laser writing of micro-optical and photonic structures using spatial light modulator

    NASA Astrophysics Data System (ADS)

    Yang, Liang; El-Tamer, Ayman; Hinze, Ulf; Li, Jiawen; Hu, Yanlei; Huang, Wenhao; Chu, Jiaru; Chichkov, Boris N.

    2015-07-01

    Two-photon polymerization (2PP) is a powerful tool for direct laser writing of micro-optical and photonic structures due to its flexibility in 3D structuring and sub-micrometer resolution. However, it can be time consuming to fabricate arrays of micro-optical devices and complex photonic structures. In this study, we propose to use predefined patterns (PPs) for parallel 2PP processing. A PP contains a multiple focal spot pattern optimized for the fabrication of certain microstructures. PP can be created by holographic laser beam modulation with a spatial light modulator (SLM). The quantity and position of the multiple foci can be flexibly and precisely controlled by predesigned computer generated holograms (CGHs). With these specially designed PPs, parallel fabrication of arbitrary distributed microlens arrays and 3D photonic structures is demonstrated. This method significantly improves throughput and flexibility of the 2PP technique and can be used for mass production of functional devices in micro-optics and photonics.

  14. Parallel computing of a digital hologram and particle searching for microdigital-holographic particle-tracking velocimetry

    SciTech Connect

    Satake, Shin-ichi; Kanamori, Hiroyuki; Kunugi, Tomoaki; Sato, Kazuho; Ito, Tomoyoshi; Yamamoto, Keisuke

    2007-02-01

    We have developed a parallel algorithm for microdigital-holographic particle-tracking velocimetry. The algorithm is used in (1) numerical reconstruction of a particle image computer using a digital hologram, and (2) searching for particles. The numerical reconstruction from the digital hologram makes use of the Fresnel diffraction equation and the FFT (fast Fourier transform),whereas the particle search algorithm looks for local maximum graduation in a reconstruction field represented by a 3D matrix. To achieve high performance computing for both calculations (reconstruction and particle search), two memory partitions are allocated to the 3D matrix. In this matrix, the reconstruction part consists of horizontally placed 2D memory partitions on the x-y plane for the FFT, whereas, the particle search part consists of vertically placed 2D memory partitions set along the z axes.Consequently, the scalability can be obtained for the proportion of processor elements,where the benchmarks are carried out for parallel computation by a SGI Altix machine.

  15. Massively Parallel Phase-Field Simulations for Ternary Eutectic Directional Solidification

    E-print Network

    Bauer, Martin; Steinmetz, Philipp; Jainta, Marcus; Berghoff, Marco; Schornbaum, Florian; Godenschwager, Christian; Köstler, Harald; Nestler, Britta; Rüde, Ulrich

    2015-01-01

    Microstructures forming during ternary eutectic directional solidification processes have significant influence on the macroscopic mechanical properties of metal alloys. For a realistic simulation, we use the well established thermodynamically consistent phase-field method and improve it with a new grand potential formulation to couple the concentration evolution. This extension is very compute intensive due to a temperature dependent diffusive concentration. We significantly extend previous simulations that have used simpler phase-field models or were performed on smaller domain sizes. The new method has been implemented within the massively parallel HPC framework waLBerla that is designed to exploit current supercomputers efficiently. We apply various optimization techniques, including buffering techniques, explicit SIMD kernel vectorization, and communication hiding. Simulations utilizing up to 262,144 cores have been run on three different supercomputing architectures and weak scalability results are show...

  16. Direct dark matter searches - Test of the Big Bounce Cosmology

    E-print Network

    Yeuk-Kwan E. Cheung; J. D. Vergados

    2014-10-29

    We consider the possibility of using dark matter particle's mass and its interaction cross section as a smoking gun signal of the existence of a Big Bounce at the early stage in the evolution of our currently observed universe. A study of dark matter production in the pre-bounce contraction and the post bounce expansion epochs of this universe reveals a new venue for achieving the observed relic abundance of our present universe. Specifically, it predicts a characteristic relation governing a dark matter mass and interaction cross section and a factor of $1/2$ in thermally averaged cross section, as compared to the non-thermal production in standard cosmology, is needed for creating enough dark matter particle to satisfy the currently observed relic abundance because dark matter is being created during the pre-bounce contraction, in addition to the post-bounce expansion. As the production rate is lower than the Hubble expansion rate information of the bounce universe evolution is preserved. Therefore once the value of dark matter mass and interaction cross section are obtained by direct detection in laboratories, this alternative route becomes a signature prediction of the bounce universe scenario. This leads us to consider a scalar dark matter candidate, which if it is light, has important implications on dark matter searches.

  17. Direct Searches for Scalar Leptoquarks at the Run II Tevatron

    SciTech Connect

    Ryan, Daniel E

    2004-11-01

    This dissertation sets new limits on the mass of the scalar leptoquark from direct searches carried out at the Run II CDF detector using data from March 2001 to October 2003. The data analyzed has a total time-integrated measured luminosity of 198 pb{sup -1} of p{bar p} collisions with {radical}s = 1.96 TeV. Leptoquarks are assumed to be pair-produced and to decay into a lepton and a quark of the same generation. They consider two possible leptoquark decays: (1) {beta} = BR(LQ {yields} {mu}q) = 1.0, and (2) {beta} = BR(LQ {yields} {mu}q) = 0.5. For the {beta} = 1 channel, they focus on the signature represented by two isolated high-p{sub T} muons and two isolated high-p{sub T} jets. For the {beta} = 1/2 channel, they focus on the signature represented by one isolated high-p{sub T} muon, large missing transverse energy, and two isolated high-p{sub T} jets. No leptoquark signal is experimentally detected for either signature. Using the next to leading order theoretical cross section for scalar leptoquark production in p{bar p} collisions [1], they set new mass limits on second generation scalar leptoquarks. They exclude the existence of second generation scalar leptoquarks with masses below 221(175) GeV/c{sup 2} for the {beta} = 1(1/2) channels.

  18. Direct Imaging Searches with the Apodizing Phase Plate Coronagraph

    NASA Astrophysics Data System (ADS)

    Kenworthy, M.; Meshkat, T.; Otten, , G.; Codona, J.

    2014-03-01

    The sensitivity of direct imaging searches for extrasolar planets is limited by the presence of diffraction rings from the primary star. Coronagraphs are angular filters that minimise these diffraction structures whilst allowing light from faint companions to shine through. The Apodizing Phase Plate (APP; Kenworthy 2007) coronagraph is a simple pupil plane optic that suppresses diffraction over a 180 degree region around each star simultaneously, providing easy beam switching observations and requiring no time consuming optical alignment at the telescope. We will present our results on using the APP at the Very Large Telescope in surveys for extrasolar planets around A/F and debris disk hosting stars in the L' band (3.8 microns) in the Southern Hemisphere, where we reach a contrast of 12 magnitudes at 0.5 arcseconds (Meshkat 2013). In Leiden, we are also developing the next generation of broadband achromatic coronagraphs that can simultaneously image both sides of the star using Vector APPs (Snik 2012, Otten 2012). Recent laboratory results showing the potential of this technology for future ELTs will also be presented.

  19. Sampling optimization for printer characterization by direct search.

    PubMed

    Bianco, Simone; Schettini, Raimondo

    2012-12-01

    Printer characterization usually requires many printer inputs and corresponding color measurements of the printed outputs. In this brief, a sampling optimization for printer characterization on the basis of direct search is proposed to maintain high color accuracy with a reduction in the number of characterization samples required. The proposed method is able to match a given level of color accuracy requiring, on average, a characterization set cardinality which is almost one-fourth of that required by the uniform sampling, while the best method in the state of the art needs almost one-third. The number of characterization samples required can be further reduced if the proposed algorithm is coupled with a sequential optimization method that refines the sample values in the device-independent color space. The proposed sampling optimization method is extended to deal with multiple substrates simultaneously, giving statistically better colorimetric accuracy (at the ? = 0.05 significance level) than sampling optimization techniques in the state of the art optimized for each individual substrate, thus allowing use of a single set of characterization samples for multiple substrates. PMID:22868573

  20. Job Search as Goal-Directed Behavior: Objectives and Methods

    ERIC Educational Resources Information Center

    Van Hoye, Greet; Saks, Alan M.

    2008-01-01

    This study investigated the relationship between job search objectives (finding a new job/turnover, staying aware of job alternatives, developing a professional network, and obtaining leverage against an employer) and job search methods (looking at job ads, visiting job sites, networking, contacting employment agencies, contacting employers, and…

  1. Direct Dark Matter Search with the XENON100 Experiment

    NASA Astrophysics Data System (ADS)

    Mei, Yuan

    Dark matter, a non-luminous, non-baryonic matter, is thought to constitute 23 % of the matter-energy components in the universe today. Except for its gravitational effects, the existence of dark matter has never been confirmed by any other means and its nature remains unknown. If a hypothetical Weakly Interacting Massive Particle (WIMP) were in thermal equilibrium in the early universe, it could have a relic abundance close to that of dark matter today, which provides a promising particle candidate of dark matter. Minimal Super-Symmetric extensions to the standard model predicts a stable particle with mass in the range 10 GeV/c2 to 1000 GeV/c2, and spin-independent cross-section with ordinary matter nucleon sigmax < 1 x 10--43 cm2. The XENON100 experiment deploys a Dual Phase Liquid Xenon Time Projection Chamber (LXeTPC) of 62 kg liquid xenon as its sensitive volume, to detect scintillation (S1) and ionization (S2) signals from WIMP dark matter particles directly scattering off xenon nuclei. The detector is located underground at Laboratori Nazionali del Gran Sasso (LNGS) in central Italy. 1.4 km of rock (3.7 km water equivalent) reduces the cosmic muon background by a factor of 106. The event-by-event 3D positioning capability of TPC allows volume fiducialization. With the self-shielding power of liquid xenon, as well as a 99 kg liquid xenon active veto, the electromagnetic radiation background is greatly suppressed. By utilizing the difference of (S2/S1) between electronic recoil and nuclear recoil, the expected WIMP signature, a small nuclear recoil energy deposition, could be discriminated from electronic recoil background with high efficiency. XENON100 achieved the lowest background rate (< 2.2 x 10--2 events/kg/day/keV) in the dark matter search region (< 40 keV) among all direct dark matter detectors. With 11.2 days of data, XENON100 already sets the world's best spin-independent WIMP-nucleon cross-section limit of 2.7 x 10--44 cm2 at WIMP mass 50 GeV/c 2. With 100.9 days of data, XENON100 excludes WIMP-nucleon cross-section above 7.0 x 10--45 cm2 for a WIMP mass of 50 GeV/c2 at 90% confidence level.

  2. The Direct Imaging Search of Exoplanets from Ground and Space

    NASA Astrophysics Data System (ADS)

    Dou, Jiangpei; Ren, Deqing; Zhu, Yongtian

    2015-08-01

    Exoplanets search is one of the hottest topics in both modern astronomy and public domain. Until now over 1990 exoplanets have been confirmed mostly by the indirect radial velocity and transiting approaches, yielding several important physical information such as masses and radius. The study of the physics of planet formation and evolution will focus on giant planets through the direct imaging.However, the direct imaging of exoplanets remains challenging, due to the large flux ratio difference and the nearby angular distance. In recent years, the extreme adaptive optics (Ex-AO) coronagraphic instrumentation has been proposed and developed on 8-meter class telescopes, which is optimized for the high-contrast imaging observation from ground, for the giant exoplanets and other faint stellar companions. Gemini Planet Imager (GPI) has recently come to its first light, with a development period over 10 years. The contrast level has been pushed to 10-6. Due to the space limitation or this or other reasons, none professional adaptive optics is available for most of current 3~4 meter class telescopes, which will limit its observation power to some extent, especially in the research of high-contrast imaging of exoplanets.In this presentation, we will report the latest observation results by using our Extreme Adaptive Optics (Ex-AO) as a visiting instrument for high-contrast imaging on ESO’s 3.58-meter NTT telescope at LSO, and on 3.5-meter ARC telescope at Apache Point Observatory, respectively. It has demonstrated the Ex-AO can be used for the scientific research of exoplanets and brown dwarfs. With a update of the currect configuration with critical hardware, the dedicated instrument called as EDICT for imaging research of young giant exoplanets will be presented. Meanwhile, we have fully demonstrated in the lab a contrast on the order of 10-9 in a large detection area, which is a critical technique for future Earth-like exoplanets imaging space missions. And a space program of JEEEDIS will also be presented in this talk.

  3. Parallel Programming for High-Performance Applications

    E-print Network

    Bal, Henri E.

    for many parallel applications #12;History · 1950s: first ideas (see Gill's quote) · 1967 first parallel processing for LOFAR telescope ­ Example: searching pulsars is extremely difficult, need to guess the direction, distance, and rotation frequency ­ Prepares for SKA telescope (2018) · 10-100 x global internet

  4. Searching for Bayesian Network Structures in the Space of Restricted Acyclic Partially Directed Graphs

    E-print Network

    Acid, S; 10.1613/jair.1061

    2011-01-01

    Although many algorithms have been designed to construct Bayesian network structures using different approaches and principles, they all employ only two methods: those based on independence criteria, and those based on a scoring function and a search procedure (although some methods combine the two). Within the score+search paradigm, the dominant approach uses local search methods in the space of directed acyclic graphs (DAGs), where the usual choices for defining the elementary modifications (local changes) that can be applied are arc addition, arc deletion, and arc reversal. In this paper, we propose a new local search method that uses a different search space, and which takes account of the concept of equivalence between network structures: restricted acyclic partially directed graphs (RPDAGs). In this way, the number of different configurations of the search space is reduced, thus improving efficiency. Moreover, although the final result must necessarily be a local optimum given the nature of the search m...

  5. Direct numerical simulation of instabilities in parallel flow with spherical roughness elements

    NASA Technical Reports Server (NTRS)

    Deanna, R. G.

    1992-01-01

    Results from a direct numerical simulation of laminar flow over a flat surface with spherical roughness elements using a spectral-element method are given. The numerical simulation approximates roughness as a cellular pattern of identical spheres protruding from a smooth wall. Periodic boundary conditions on the domain's horizontal faces simulate an infinite array of roughness elements extending in the streamwise and spanwise directions, which implies the parallel-flow assumption, and results in a closed domain. A body force, designed to yield the horizontal Blasius velocity in the absence of roughness, sustains the flow. Instabilities above a critical Reynolds number reveal negligible oscillations in the recirculation regions behind each sphere and in the free stream, high-amplitude oscillations in the layer directly above the spheres, and a mean profile with an inflection point near the sphere's crest. The inflection point yields an unstable layer above the roughness (where U''(y) is less than 0) and a stable region within the roughness (where U''(y) is greater than 0). Evidently, the instability begins when the low-momentum or wake region behind an element, being the region most affected by disturbances (purely numerical in this case), goes unstable and moves. In compressible flow with periodic boundaries, this motion sends disturbances to all regions of the domain. In the unstable layer just above the inflection point, the disturbances grow while being carried downstream with a propagation speed equal to the local mean velocity; they do not grow amid the low energy region near the roughness patch. The most amplified disturbance eventually arrives at the next roughness element downstream, perturbing its wake and inducing a global response at a frequency governed by the streamwise spacing between spheres and the mean velocity of the most amplified layer.

  6. Direct numerical simulation of instabilities in parallel flow with spherical roughness elements

    NASA Astrophysics Data System (ADS)

    Deanna, R. G.

    1992-08-01

    Results from a direct numerical simulation of laminar flow over a flat surface with spherical roughness elements using a spectral-element method are given. The numerical simulation approximates roughness as a cellular pattern of identical spheres protruding from a smooth wall. Periodic boundary conditions on the domain's horizontal faces simulate an infinite array of roughness elements extending in the streamwise and spanwise directions, which implies the parallel-flow assumption, and results in a closed domain. A body force, designed to yield the horizontal Blasius velocity in the absence of roughness, sustains the flow. Instabilities above a critical Reynolds number reveal negligible oscillations in the recirculation regions behind each sphere and in the free stream, high-amplitude oscillations in the layer directly above the spheres, and a mean profile with an inflection point near the sphere's crest. The inflection point yields an unstable layer above the roughness (where U''(y) is less than 0) and a stable region within the roughness (where U''(y) is greater than 0). Evidently, the instability begins when the low-momentum or wake region behind an element, being the region most affected by disturbances (purely numerical in this case), goes unstable and moves. In compressible flow with periodic boundaries, this motion sends disturbances to all regions of the domain. In the unstable layer just above the inflection point, the disturbances grow while being carried downstream with a propagation speed equal to the local mean velocity; they do not grow amid the low energy region near the roughness patch. The most amplified disturbance eventually arrives at the next roughness element downstream, perturbing its wake and inducing a global response at a frequency governed by the streamwise spacing between spheres and the mean velocity of the most amplified layer.

  7. The Perfect Search Engine Is Not Enough: A Study of Orienteering Behavior in Directed Search

    E-print Network

    that investigated how people performed personally motivated searches in their email, in their files, and on the Web people currently have with search tools. However, even when a person knows exactly what they are looking to build the best possible search tool, we conducted an observational study of people performing personally

  8. Characterising dark matter searches at colliders and direct detection experiments: Vector mediators

    DOE PAGESBeta

    Buchmueller, Oliver; Dolan, Matthew J.; Malik, Sarah A.; McCabe, Christopher

    2015-01-09

    We introduce a Minimal Simplified Dark Matter (MSDM) framework to quantitatively characterise dark matter (DM) searches at the LHC. We study two MSDM models where the DM is a Dirac fermion which interacts with a vector and axial-vector mediator. The models are characterised by four parameters: mDM, Mmed , gDM and gq, the DM and mediator masses, and the mediator couplings to DM and quarks respectively. The MSDM models accurately capture the full event kinematics, and the dependence on all masses and couplings can be systematically studied. The interpretation of mono-jet searches in this framework can be used to establishmore »an equal-footing comparison with direct detection experiments. For theories with a vector mediator, LHC mono-jet searches possess better sensitivity than direct detection searches for light DM masses (?5 GeV). For axial-vector mediators, LHC and direct detection searches generally probe orthogonal directions in the parameter space. We explore the projected limits of these searches from the ultimate reach of the LHC and multi-ton xenon direct detection experiments, and find that the complementarity of the searches remains. In conclusion, we provide a comparison of limits in the MSDM and effective field theory (EFT) frameworks to highlight the deficiencies of the EFT framework, particularly when exploring the complementarity of mono-jet and direct detection searches.« less

  9. Characterising dark matter searches at colliders and direct detection experiments: Vector mediators

    SciTech Connect

    Buchmueller, Oliver; Dolan, Matthew J.; Malik, Sarah A.; McCabe, Christopher

    2015-01-09

    We introduce a Minimal Simplified Dark Matter (MSDM) framework to quantitatively characterise dark matter (DM) searches at the LHC. We study two MSDM models where the DM is a Dirac fermion which interacts with a vector and axial-vector mediator. The models are characterised by four parameters: mDM, Mmed , gDM and gq, the DM and mediator masses, and the mediator couplings to DM and quarks respectively. The MSDM models accurately capture the full event kinematics, and the dependence on all masses and couplings can be systematically studied. The interpretation of mono-jet searches in this framework can be used to establish an equal-footing comparison with direct detection experiments. For theories with a vector mediator, LHC mono-jet searches possess better sensitivity than direct detection searches for light DM masses (?5 GeV). For axial-vector mediators, LHC and direct detection searches generally probe orthogonal directions in the parameter space. We explore the projected limits of these searches from the ultimate reach of the LHC and multi-ton xenon direct detection experiments, and find that the complementarity of the searches remains. In conclusion, we provide a comparison of limits in the MSDM and effective field theory (EFT) frameworks to highlight the deficiencies of the EFT framework, particularly when exploring the complementarity of mono-jet and direct detection searches.

  10. Characterising Dark Matter Searches at Collider and Direct Detection Experiments: Vector Mediators

    DOE PAGESBeta

    Buchmueller, Oliver; Dolan, Matthew J.; Malik, Sarah A.; McCabe, Christopher

    2015-01-09

    We introduce a Minimal Simplified Dark Matter (MSDM) framework to quantitatively characterise dark matter (DM) searches at the LHC. We study two MSDM models where the DM is a Dirac fermion which interacts with a vector and axial-vector mediator. The models are characterised by four parameters: m DM , M med , g DM and g q, the DM and mediator masses, and the mediator couplings to DM and quarks respectively. The MSDM models accurately capture the full event kinematics, and the dependence on all masses and couplings can be systematically studied. The interpretation of mono-jet searches in this frameworkmore »can be used to establish an equal-footing comparison with direct detection experiments. For theories with a vector mediator, LHC mono-jet searches possess better sensitivity than direct detection searches for light DM masses (?5 GeV). For axial-vector mediators, LHC and direct detection searches generally probe orthogonal directions in the parameter space. We explore the projected limits of these searches from the ultimate reach of the LHC and multi-ton xenon direct detection experiments, and find that the complementarity of the searches remains. Finally, we provide a comparison of limits in the MSDM and effective field theory (EFT) frameworks to highlight the deficiencies of the EFT framework, particularly when exploring the complementarity of mono-jet and direct detection searches.« less

  11. Characterising dark matter searches at colliders and direct detection experiments: vector mediators

    NASA Astrophysics Data System (ADS)

    Buchmueller, Oliver; Dolan, Matthew J.; Malik, Sarah A.; McCabe, Christopher

    2015-01-01

    We introduce a Minimal Simplified Dark Matter (MSDM) framework to quantitatively characterise dark matter (DM) searches at the LHC. We study two MSDM models where the DM is a Dirac fermion which interacts with a vector and axial-vector mediator. The models are characterised by four parameters: m DM , M med , g DM and g q, the DM and mediator masses, and the mediator couplings to DM and quarks respectively. The MSDM models accurately capture the full event kinematics, and the dependence on all masses and couplings can be systematically studied. The interpretation of mono-jet searches in this framework can be used to establish an equal-footing comparison with direct detection experiments. For theories with a vector mediator, LHC mono-jet searches possess better sensitivity than direct detection searches for light DM masses (?5 GeV). For axial-vector mediators, LHC and direct detection searches generally probe orthogonal directions in the parameter space. We explore the projected limits of these searches from the ultimate reach of the LHC and multi-ton xenon direct detection experiments, and find that the complementarity of the searches remains. Finally, we provide a comparison of limits in the MSDM and effective field theory (EFT) frameworks to highlight the deficiencies of the EFT framework, particularly when exploring the complementarity of mono-jet and direct detection searches.

  12. SIMPLE-icity in Direct Dark Matter Searches

    SciTech Connect

    Giuliani, F.; Morlat, T.; Ramos, A. R.; Girard, T. A.; Felizardo da Costa, M.; Marques, J. G.; Martins, R. C.; Miley, Harry S.; Limagne, D.; Waysand, G.

    2007-11-01

    SIMPLE is the European WIMP search based on Superheated Droplet Detectors (SDDs). An SDD consists of an emulsion of metastable liquid droplets in an organic gel, each of which operates on the same principle of the bubble chamber.

  13. Behavior of the reflection function of a plane-parallel medium for directions of incidence and reflection tending to horizontal directions

    E-print Network

    J. W. Hovenier D. M. Stam

    2008-09-22

    The atmospheres of (exo) planets and moons, as well as reflection nebulae, contain in general independently scattering particles in random orientation and are often supposed to be plane-parallel. Relations are presented for the (bidirectional) reflection function and several related functions of such a medium in case the directions of incidence and reflection both tend to horizontal directions. The results are quite general. The medium may be semi-infinite or finite, with or without a reflecting surface underneath, and vertically homogeneous or inhomogeneous. Some approximative formulae for the reflection function of a plane-parallel medium with independently scattering particles in random orientation, including Lambert's law, may be very inaccurate if the directions of incidence and reflection are both nearly horizontal.

  14. Search based software engineering for software product line engineering: a survey and directions for future work

    E-print Network

    Harman, Mark

    Search based software engineering for software product line engineering: a survey and directions on Search Based Software Engineering (SBSE) for Software Product Lines (SPLs). We have attempted techniques to problems in software product line engineering. Having surveyed the recent explo- sion in SBSE

  15. A NEW SEARCH FOR DIRECT CP VIOLATION IN HYPERON DECAYS K. S. NELSON

    E-print Network

    Fermilab Experiment E871

    A NEW SEARCH FOR DIRECT CP VIOLATION IN HYPERON DECAYS K. S. NELSON Dept. of Physics, University of Virginia, 205 McCormick Rd., Charlottesville, Virginia, USA Representing the HyperCP Collaboration The HyperCP experiment 1 (Fermilab E871) is performing a search for CP violation in \\Xi and \\Lambda hyperon

  16. Some Comments on Possible Preferred Directions for the SETI Search

    E-print Network

    Nussinov, Shmuel

    2009-01-01

    The search for extraterrestrial intelligence by looking for signals from advanced technological civilizations has been ongoing for some decades. We suggest that it could possibly be made more efficient by focusing on stars from which the solar system can be observed via mini-eclipsings of the Sun by transiting planets.

  17. Massively Parallel A* Search on a GPU: Appendix Yichao Zhou Jianyang Zeng

    E-print Network

    Zeng, Jianyang "Michael"

    DUPLICATION DETECTION A2 Node Duplication Detection A2.1 Parallel Cuckoo Hashing The lookup operations of traditional cuckoo hashing can be performed in constant time in the worst case. We only need to check whether procedure in the cuckoo hashing scheme using two tables with hash functions h1(x) and h2(x), respectively: 1

  18. Targeted parallel sequencing of the Musa species: searching for an alternative model system for polyploidy studies

    Technology Transfer Automated Retrieval System (TEKTRAN)

    Modern day genomics holds the promise of solving the complexities of basic plant sciences, and of catalyzing practical advances in plant breeding. While contiguous, "base perfect" deep sequencing is a key module of any genome project, recent advances in parallel next generation sequencing technologi...

  19. A Formal Model for Detecting Parallel Key Search Attacks Graham Steel and Judicael Courant

    E-print Network

    Doyen, Laurent

    -proof hardware security modules (HSMs), for example, have security APIs which control access the secure hardware module and the host machine [8, 9, 6]. However, previous work has not taken parallel key a number of security APIs, designed to regulate access to tamper resistant hardware devices. However

  20. Neutrinoless double beta decay and direct searches for neutrino mass

    E-print Network

    Craig Aalseth; Henning Back; Loretta Dauwe; David Dean; Guido Drexlin; Yuri Efremenko; Hiro Ejiri; Steven Elliott; Jon Engel; Brian Fujikawa; Reyco Henning; G. W. Hoffmann; Karol Lang; Kevin Lesko; Tadafumi Kishimoto; Harry Miley; Rick Norman; Silvia Pascoli; Serguey Petcov; Andreas Piepke; Werner Rodejohann; David Saltzberg; Sean Sutton; Petr Vogel; Ray Warner; John Wilkerson; Lincoln Wolfenstein

    2004-12-21

    Study of the neutrinoless double beta decay and searches for the manifestation of the neutrino mass in ordinary beta decay are the main sources of information about the absolute neutrino mass scale, and the only practical source of information about the charge conjugation properties of the neutrinos. Thus, these studies have a unique role in the plans for better understanding of the whole fast expanding field of neutrino physics.

  1. Parallel computation of GA search for the artery shape determinants with CFD

    NASA Astrophysics Data System (ADS)

    Himeno, M.; Noda, S.; Fukasaku, K.; Himeno, R.

    2010-06-01

    We studied which factors play important role to determine the shape of arteries at the carotid artery bifurcation by performing multi-objective optimization with computation fluid dynamics (CFD) and the genetic algorithm (GA). To perform it, the most difficult problem is how to reduce turn-around time of the GA optimization with 3D unsteady computation of blood flow. We devised two levels of parallel computation method with the following features: level 1: parallel CFD computation with appropriate number of cores; level 2: parallel jobs generated by "master", which finds quickly available job cue and dispatches jobs, to reduce turn-around time. As a result, the turn-around time of one GA trial, which would have taken 462 days with one core, was reduced to less than two days on RIKEN supercomputer system, RICC, with 8192 cores. We performed a multi-objective optimization to minimize the maximum mean WSS and to minimize the sum of circumference for four different shapes and obtained a set of trade-off solutions for each shape. In addition, we found that the carotid bulb has the feature of the minimum local mean WSS and minimum local radius. We confirmed that our method is effective for examining determinants of artery shapes.

  2. Direct observation of TALE protein dynamics reveals a two-state search mechanism

    PubMed Central

    Cuculis, Luke; Abil, Zhanar; Zhao, Huimin; Schroeder, Charles M.

    2015-01-01

    Transcription activator-like effector (TALE) proteins are a class of programmable DNA-binding proteins for which the fundamental mechanisms governing the search process are not fully understood. Here we use single-molecule techniques to directly observe TALE search dynamics along DNA templates. We find that TALE proteins are capable of rapid diffusion along DNA using a combination of sliding and hopping behaviour, which suggests that the TALE search process is governed in part by facilitated diffusion. We also observe that TALE proteins exhibit two distinct modes of action during the search process—a search state and a recognition state—facilitated by different subdomains in monomeric TALE proteins. Using TALE truncation mutants, we further demonstrate that the N-terminal region of TALEs is required for the initial non-specific binding and subsequent rapid search along DNA, whereas the central repeat domain is required for transitioning into the site-specific recognition state. PMID:26027871

  3. Direct observation of TALE protein dynamics reveals a two-state search mechanism

    NASA Astrophysics Data System (ADS)

    Cuculis, Luke; Abil, Zhanar; Zhao, Huimin; Schroeder, Charles M.

    2015-06-01

    Transcription activator-like effector (TALE) proteins are a class of programmable DNA-binding proteins for which the fundamental mechanisms governing the search process are not fully understood. Here we use single-molecule techniques to directly observe TALE search dynamics along DNA templates. We find that TALE proteins are capable of rapid diffusion along DNA using a combination of sliding and hopping behaviour, which suggests that the TALE search process is governed in part by facilitated diffusion. We also observe that TALE proteins exhibit two distinct modes of action during the search process--a search state and a recognition state--facilitated by different subdomains in monomeric TALE proteins. Using TALE truncation mutants, we further demonstrate that the N-terminal region of TALEs is required for the initial non-specific binding and subsequent rapid search along DNA, whereas the central repeat domain is required for transitioning into the site-specific recognition state.

  4. An efficient parallel algorithm for O(N^2) direct summation method and its variations on distributed-memory parallel machines

    E-print Network

    Junichiro Makino

    2001-08-27

    We present a novel, highly efficient algorithm to parallelize O(N^2) direct summation method for N-body problems with individual timesteps on distributed-memory parallel machines such as Beowulf clusters. Previously known algorithms, in which all processors have complete copies of the N-body system, has the serious problem that the communication-computation ratio increases as we increase the number of processors, since the communication cost is independent of the number of processors. In the new algorithm, p processors are organized as a $\\sqrt{p}\\times \\sqrt{p}$ two-dimensional array. Each processor has $N/\\sqrt{p}$ particles, but the data are distributed in such a way that complete system is presented if we look at any row or column consisting of $\\sqrt{p}$ processors. In this algorithm, the communication cost scales as $N /\\sqrt{p}$, while the calculation cost scales as $N^2/p$. Thus, we can use a much larger number of processors without losing efficiency compared to what was practical with previously known algorithms.

  5. Parallel effects of memory set activation and search on timing and working memory capacity

    PubMed Central

    Schweickert, Richard; Fortin, Claudette; Xi, Zhuangzhuang; Viau-Quesnel, Charles

    2014-01-01

    Accurately estimating a time interval is required in everyday activities such as driving or cooking. Estimating time is relatively easy, provided a person attends to it. But a brief shift of attention to another task usually interferes with timing. Most processes carried out concurrently with timing interfere with it. Curiously, some do not. Literature on a few processes suggests a general proposition, the Timing and Complex-Span Hypothesis: A process interferes with concurrent timing if and only if process performance is related to complex span. Complex-span is the number of items correctly recalled in order, when each item presented for study is followed by a brief activity. Literature on task switching, visual search, memory search, word generation and mental time travel supports the hypothesis. Previous work found that another process, activation of a memory set in long term memory, is not related to complex-span. If the Timing and Complex-Span Hypothesis is true, activation should not interfere with concurrent timing in dual-task conditions. We tested such activation in single-task memory search task conditions and in dual-task conditions where memory search was executed with concurrent timing. In Experiment 1, activating a memory set increased reaction time, with no significant effect on time production. In Experiment 2, set size and memory set activation were manipulated. Activation and set size had a puzzling interaction for time productions, perhaps due to difficult conditions, leading us to use a related but easier task in Experiment 3. In Experiment 3 increasing set size lengthened time production, but memory activation had no significant effect. Results here and in previous literature on the whole support the Timing and Complex-Span Hypotheses. Results also support a sequential organization of activation and search of memory. This organization predicts activation and set size have additive effects on reaction time and multiplicative effects on percent correct, which was found. PMID:25120502

  6. CDF/PHYS/BOTTOM/CDFR/6989 Measurement of Partial Widths and Search for Direct CP Violation

    E-print Network

    Quigg, Chris

    CDF/PHYS/BOTTOM/CDFR/6989 Draft 2.0 Measurement of Partial Widths and Search for Direct CP present a measurement of relative partial widths and decay rate CP asym- metries in K K + and #25; #25;- cant direct CP violation is observed and we measure: (D 0 ! K K + )=(D 0 ! K #25; + ) = 0:0996 #6; 0

  7. Earthquake Location, Direct, Global-Search Methods E 2449 Earthquake Location,

    E-print Network

    Earthquake Location, Direct, Global-Search Methods E 2449 Earthquake Location, Direct, Global Kingdom Article Outline Glossary Definition of the Subject Introduction The Earthquake Location Problem or temporal av- erage of some characteristic of an earthquake, such as surface shaking intensity or moment

  8. Improving Search Task Performance Using Subtle Gaze Direction Ann McNamara

    E-print Network

    Grimm, Cindy

    --Display algorithms; Keywords: eye-tracking, psychophysics, gaze direction, lumi- nance 1 Introduction HumansImproving Search Task Performance Using Subtle Gaze Direction Ann McNamara Saint Louis University: From left to right: distribution of fixation time under normal viewing conditions, using Subtle Gaze

  9. Scalability of Parallel Spatial Direct Numerical Simulations on Intel Hypercube and IBM SP1 and SP2

    NASA Technical Reports Server (NTRS)

    Joslin, Ronald D.; Hanebutte, Ulf R.; Zubair, Mohammad

    1995-01-01

    The implementation and performance of a parallel spatial direct numerical simulation (PSDNS) approach on the Intel iPSC/860 hypercube and IBM SP1 and SP2 parallel computers is documented. Spatially evolving disturbances associated with the laminar-to-turbulent transition in boundary-layer flows are computed with the PSDNS code. The feasibility of using the PSDNS to perform transition studies on these computers is examined. The results indicate that PSDNS approach can effectively be parallelized on a distributed-memory parallel machine by remapping the distributed data structure during the course of the calculation. Scalability information is provided to estimate computational costs to match the actual costs relative to changes in the number of grid points. By increasing the number of processors, slower than linear speedups are achieved with optimized (machine-dependent library) routines. This slower than linear speedup results because the computational cost is dominated by FFT routine, which yields less than ideal speedups. By using appropriate compile options and optimized library routines on the SP1, the serial code achieves 52-56 M ops on a single node of the SP1 (45 percent of theoretical peak performance). The actual performance of the PSDNS code on the SP1 is evaluated with a "real world" simulation that consists of 1.7 million grid points. One time step of this simulation is calculated on eight nodes of the SP1 in the same time as required by a Cray Y/MP supercomputer. For the same simulation, 32-nodes of the SP1 and SP2 are required to reach the performance of a Cray C-90. A 32 node SP1 (SP2) configuration is 2.9 (4.6) times faster than a Cray Y/MP for this simulation, while the hypercube is roughly 2 times slower than the Y/MP for this application. KEY WORDS: Spatial direct numerical simulations; incompressible viscous flows; spectral methods; finite differences; parallel computing.

  10. Lick Observatory Optical SETI: targeted search and new directions.

    PubMed

    Stone, R P S; Wright, S A; Drake, F; Muñoz, M; Treffers, R; Werthimer, D

    2005-10-01

    Lick Observatory's Optical SETI (search for extraterrestrial intelligence) program has been in regular operation for 4.5 years. We have observed 4,605 stars of spectral types F-M within 200 light-years of Earth. Occasionally, we have appended objects of special interest, such as stars with known planetary systems. We have observed 14 candidate signals ("triple coincidences"), all but one of which are explained by transient local difficulties. Additional observations of the remaining candidate have failed to confirm arriving pulse events. We now plan to proceed in a more economical manner by operating in an unattended drift scan mode. Between operational and equipment modifications, efficiency will more than double. PMID:16225433

  11. J. Parallel Distrib. Comput. 69 (2009) 180196 Contents lists available at ScienceDirect

    E-print Network

    Koyuturk, Mehmet

    2009-01-01

    transceivers (tag readers). RFID tags store information using a small integrated circuit and communicate using. Parallel Distrib. Comput. journal homepage: www.elsevier.com/locate/jpdc Efficient tag detection in RFID 2008 Accepted 22 June 2008 Available online 8 July 2008 Keywords: RFID systems Tag coverage Reader

  12. J. Parallel Distrib. Comput. 68 (2008) 10541069 Contents lists available at ScienceDirect

    E-print Network

    Candan, Selçuk

    2008-01-01

    e i n f o Article history: Received 25 August 2006 Received in revised form 26 March 2008 Accepted 7. Parallel Distrib. Comput. journal homepage: www.elsevier.com/locate/jpdc Distributed XML processing: Theory message payload are processed by various PASS-nodes in tandem or simultaneously. The non-blocking, non-wasteful

  13. J. Parallel Distrib. Comput. 71 (2011) 13881399 Contents lists available at ScienceDirect

    E-print Network

    Melbourne, University of

    2011-01-01

    , The University of Melbourne, Australia b Rensselaer Polytechnic Institute, USA a r t i c l e i n f o Article. Parallel Distrib. Comput. journal homepage: www.elsevier.com/locate/jpdc Use of run time predictions resources from multi- ple clusters that would be otherwise wasted due to fragmenta- tion in scheduling

  14. J. Parallel Distrib. Comput. 71 (2011) 10851097 Contents lists available at ScienceDirect

    E-print Network

    Wu, Jie

    2011-01-01

    . Parallel Distrib. Comput. journal homepage: www.elsevier.com/locate/jpdc Capability information: A cost Department of Computer & Information Sciences, Temple University, Philadelphia, PA 19122, USA a r t i c l e i n f o Article history: Received 23 July 2010 Received in revised form 10 February 2011 Accepted 8

  15. Massively parallel computing and the search for jets and black holes at the LHC

    NASA Astrophysics Data System (ADS)

    Halyo, V.; LeGresley, P.; Lujan, P.

    2014-04-01

    Massively parallel computing at the LHC could be the next leap necessary to reach an era of new discoveries at the LHC after the Higgs discovery. Scientific computing is a critical component of the LHC experiment, including operation, trigger, LHC computing GRID, simulation, and analysis. One way to improve the physics reach of the LHC is to take advantage of the flexibility of the trigger system by integrating coprocessors based on Graphics Processing Units (GPUs) or the Many Integrated Core (MIC) architecture into its server farm. This cutting edge technology provides not only the means to accelerate existing algorithms, but also the opportunity to develop new algorithms that select events in the trigger that previously would have evaded detection. In this paper we describe new algorithms that would allow us to select in the trigger new topological signatures that include non-prompt jet and black hole-like objects in the silicon tracker.

  16. A Case Study of Parallel I/O for Biological Sequence Search on Linux Clusters Yifeng Zhu, Hong Jiang, Xiao Qin and David Swanson

    E-print Network

    Zhu, Yifeng

    1 A Case Study of Parallel I/O for Biological Sequence Search on Linux Clusters Yifeng Zhu, Hong servers is highly imbalanced. The I/O resource contention due to the sharing of server nodes by multiple applications in a cluster has been shown to degrade the performance of the original tool and the variation

  17. Search for Exoplanets around Young Stellar Objects by Direct Imaging

    NASA Astrophysics Data System (ADS)

    Uyama, Taichi; Tamura, Motohide; Hashimoto, Jun; Kuzuhara, Masayuki

    2015-12-01

    SEEDS project, exploring exoplanets and protoplanetary disks with Subaru/HiCIAO, has observed about 500 stars by Direct Imaging from 2009 Dec to 2015 Apr. Among these targets we explore around Young Stellar Objects (YSOs; age ? 10Myr) which often have the protoplanetary disks where planets are being formed in order to detect young exoplanets and to understand the formation process. We analyzed 66 YSOs (about 100 data in total) with LOCI data reduction. We will report the results (companion candidates and detection limit) of our exploration.

  18. Search for a direction in the forest of Lyman-?

    NASA Astrophysics Data System (ADS)

    Hazra, Dhiraj Kumar; Shafieloo, Arman

    2015-11-01

    We report the first test of isotropy of the Universe using the Lyman-? forest data from the high redshift quasars (z>2) (the signal from the matter dominated epoch) from SDSS-III BOSS-DR9 datasets. Using some specified data cuts, we obtain the probability distribution function (PDF) of the Lyman-? forest transmitted flux and use the statistical moments of the PDF to address the isotropy of the Universe. In an isotropic Universe one would expect the transmitted flux to have consistent statistical characteristics in different parts of the sky. We trisect the total survey area of 3275 deg2 along the galactic latitude and using quadrant convention. We also make three subdivisions in the data for three different signal-to-noise-ratios (SNR). Finally we obtain and compare the statistical moments in the mean redshifts of 2.3, 2.6 and 2.9. We find, that the moments from all patches overall agree at all redshifts and at all SNRs. Since Lyman-? transmitted flux directly maps the neutral hydrogen distribution in the inter galactic medium (IGM), our results indicate, within the limited survey area and sensitivity of the data, the distribution of the neutral hydrogen in the Universe is consistent with isotropic distribution. Increase in survey area and larger amount of data are needed to perform this isotropy test in a bigger domain and different directions in the sky.

  19. Higgs Coupling Measurements and Direct Searches as Complementary Probes of the pMSSM

    E-print Network

    M. Cahill-Rowley; J. Hewett; A. Ismail; T. Rizzo

    2014-07-25

    The parameter space of the MSSM can be probed via many avenues, such as by pre- cision measurements of the couplings of the ~126 GeV Higgs boson, as well as the direct searches for SUSY partners. We examine the connection between these two collider observables at the LHC and ILC in the 19/20-parameter p(henomenological)MSSM. Within this scenario, we address two questions: (i) How will potentially null direct searches for SUSY at the LHC influence the predicted properties of the lightest SUSY Higgs boson? (ii) What can be learned about the properties of the superpartners from precision measurements of the Higgs boson couplings? In this paper, we examine these questions by employing three different large sets of pMSSM models with either the neutralino or gravitino being the LSP. We make use of the ATLAS direct SUSY searches at the 7/8 TeV LHC as well as expected results from 14 TeV operations, and the anticipated precision measurements of the Higgs Boson couplings at the 14 TeV LHC and at the ILC. We demonstrate that the future Higgs coupling determinations can deeply probe the pMSSM parameter space and, in particular, can observe the effects of models that are projected to evade the direct searches at the 14 TeV LHC with 3 inverse ab of integrated luminosity. In addition, we compare the reach of the Higgs coupling determinations to the direct heavy Higgs searches in the MA - tan beta plane and show that they cover orthogonal regions. This analysis demonstrates the complementarity of the direct and indirect approaches in searching for Supersymmetry, and the importance of precision studies of the properties of the Higgs Boson.

  20. Direct Search Methods on Parallel Machines 28 ment of Mathematical Sciences, Rice University, Houston, Texas 772511892.

    E-print Network

    Torczon, Virginia

    --168. [8] G. F. Froment and K. B. Bischoff, Chemical Reactor Analysis and Design, John Wiley & Sons, 1979 Transactions on Mathematical Software, 7 (1981), pp. 17--41. [13] S. G. Nash and A. Sofer, Block truncated

  1. Microwave Experiments Simulating Quantum Search and Directed Transport in Artificial Graphene

    NASA Astrophysics Data System (ADS)

    Böhm, Julian; Bellec, Matthieu; Mortessagne, Fabrice; Kuhl, Ulrich; Barkhofen, Sonja; Gehler, Stefan; Stöckmann, Hans-Jürgen; Foulger, Iain; Gnutzmann, Sven; Tanner, Gregor

    2015-03-01

    A series of quantum search algorithms have been proposed recently providing an algebraic speedup compared to classical search algorithms from N to ?{N } , where N is the number of items in the search space. In particular, devising searches on regular lattices has become popular in extending Grover's original algorithm to spatial searching. Working in a tight-binding setup, it could be demonstrated, theoretically, that a search is possible in the physically relevant dimensions 2 and 3 if the lattice spectrum possesses Dirac points. We present here a proof of principle experiment implementing wave search algorithms and directed wave transport in a graphene lattice arrangement. The idea is based on bringing localized search states into resonance with an extended lattice state in an energy region of low spectral density—namely, at or near the Dirac point. The experiment is implemented using classical waves in a microwave setup containing weakly coupled dielectric resonators placed in a honeycomb arrangement, i.e., artificial graphene. Furthermore, we investigate the scaling behavior experimentally using linear chains.

  2. WIMP dark matter direct-detection searches in noble gases

    NASA Astrophysics Data System (ADS)

    Baudis, Laura

    2014-09-01

    Cosmological observations and the dynamics of the Milky Way provide ample evidence for an invisible and dominant mass component. This so-called dark matter could be made of new, colour and charge neutral particles, which were non-relativistic when they decoupled from ordinary matter in the early universe. Such weakly interacting massive particles (WIMPs) are predicted to have a non-zero coupling to baryons and could be detected via their collisions with atomic nuclei in ultra-low background, deep underground detectors. Among these, detectors based on liquefied noble gases have demonstrated tremendous discovery potential over the last decade. After briefly introducing the phenomenology of direct dark matter detection, I will review the main properties of liquefied argon and xenon as WIMP targets and discuss sources of background. I will then describe existing and planned argon and xenon detectors that employ the so-called single- and dual-phase detection techniques, addressing their complementarity and science reach.

  3. The Great Beyond: Higher Dimensions, Parallel Universes and the Extraordinary Search for a Theory of Everything

    NASA Astrophysics Data System (ADS)

    Halpern, Paul

    2005-08-01

    Praise for The Great Beyond "A marvelous book-very clear, very readable. A brilliant introduction to the math and physics of higher dimensions, from Flatland to superstrings. Its greatest strength is a wealth of fascinating historical narrative and anecdote. I enjoyed it enormously." -Ian Stewart, author of Flatterland "A remarkable journey from Plato's cave to the farthest reaches of human thought and scientific knowledge. This mind-boggling book allows readers to dream strange visions of hyperspace, chase light waves, explore Klein's quantum odyssey and Kaluza's cocoon, leap through parallel universes, and grasp the very essence of conscience and cosmos. Buy this book and feed your head." -Clifford Pickover, author of A Passion for Mathematics "Halpern looks with a bemused eye at the wildest ideas currently afoot in physics. He takes us into the personal world of those who relish and explore seemingly outlandish notions, and does it with a light, engaging style." -Gregory Benford, author of Foundation's Fear "An informative, stimulating, and thoughtful presentation at the very frontiers of contemporary physics. It is quite on a par with Brian Greene's The Elegant Universe or his more recent The Fabric of the Cosmos, and as such, deserves to receive wide non-specialist coverage among an intelligent, curious, thinking public." -Professor E. Sheldon, Contemporary Physics

  4. Waveform inversion for 3-D earth structure using the Direct Solution Method implemented on vector-parallel supercomputer

    NASA Astrophysics Data System (ADS)

    Hara, Tatsuhiko

    2004-08-01

    We implement the Direct Solution Method (DSM) on a vector-parallel supercomputer and show that it is possible to significantly improve its computational efficiency through parallel computing. We apply the parallel DSM calculation to waveform inversion of long period (250-500 s) surface wave data for three-dimensional (3-D) S-wave velocity structure in the upper and uppermost lower mantle. We use a spherical harmonic expansion to represent lateral variation with the maximum angular degree 16. We find significant low velocities under south Pacific hot spots in the transition zone. This is consistent with other seismological studies conducted in the Superplume project, which suggests deep roots of these hot spots. We also perform simultaneous waveform inversion for 3-D S-wave velocity and Q structure. Since resolution for Q is not good, we develop a new technique in which power spectra are used as data for inversion. We find good correlation between long wavelength patterns of Vs and Q in the transition zone such as high Vs and high Q under the western Pacific.

  5. Formalizing dependency directed backtracking and explanation based learning in refinement search

    SciTech Connect

    Kambhampati, S.

    1996-12-31

    The ideas of dependency directed backtracking (DDB) and explanation based learning (EBL) have developed independently in constraint satisfaction, planning and problem solving communities. In this paper, I formalize and unify these ideas under the task-independent framework of refinement search, which can model the search strategies used in both planning and constraint satisfaction. I show that both DDB and EBL depend upon the common theory of explaining search failures, and regressing them to higher levels of the search tree. The relevant issues of importance include (a) how the failures are explained and (b) how many failure explanations are remembered. This task-independent understanding of DDB and EBL helps support cross-fertilization of ideas among Constraint Satisfaction, Planning and Explanation-Based Learning communities.

  6. Gravitational Focusing and Substructure Effects on the Rate Modulation in Direct Dark Matter Searches

    E-print Network

    Eugenio Del Nobile; Graciela B. Gelmini; Samuel J. Witte

    2015-07-27

    We study how gravitational focusing (GF) of dark matter by the Sun affects the annual and biannual modulation of the expected signal in non-directional direct dark matter searches, in the presence of dark matter substructure in the local dark halo. We consider the Sagittarius stream and a possible dark disk, and show that GF suppresses some, but not all, of the distinguishing features that would characterize substructure of the dark halo were GF neglected.

  7. Gravitational focusing and substructure effects on the rate modulation in direct dark matter searches

    NASA Astrophysics Data System (ADS)

    Del Nobile, Eugenio; Gelmini, Graciela B.; Witte, Samuel J.

    2015-08-01

    We study how gravitational focusing (GF) of dark matter by the Sun affects the annual and biannual modulation of the expected signal in non-directional direct dark matter searches, in the presence of dark matter substructure in the local dark halo. We consider the Sagittarius stream and a possible dark disk, and show that GF suppresses some, but not all, of the distinguishing features that would characterize substructure of the dark halo were GF neglected.

  8. Gravitational Focusing and Substructure Effects on the Rate Modulation in Direct Dark Matter Searches

    E-print Network

    Del Nobile, Eugenio; Witte, Samuel J

    2015-01-01

    We study how gravitational focusing (GF) of dark matter by the Sun affects the annual and biannual modulation of the expected signal in non-directional direct dark matter searches, in the presence of dark matter substructure in the local dark halo. We consider the Sagittarius stream and a possible dark disk, and show that GF suppresses some, but not all, of the distinguishing features that would characterize substructure of the dark halo were GF neglected.

  9. Directed search for gravitational waves from Scorpius X-1 with initial LIGO data

    E-print Network

    Aasi, J.

    We present results of a search for continuously emitted gravitational radiation, directed at the brightest low-mass x-ray binary, Scorpius X-1. Our semicoherent analysis covers 10 days of LIGO S5 data ranging from 50–550 Hz, ...

  10. Using Two Different Self-Directed Search (SDS) Interpretive Materials: Implications for Career Assessment

    ERIC Educational Resources Information Center

    Dozier, V. Casey; Sampson, James P.; Reardon, Robert C.

    2013-01-01

    John Holland's Self-Directed Search (SDS) is a career assessment that consists of several booklets designed to be self-scored and self-administered. It simulates what a practitioner and an individual might do together in a career counseling session (e.g., review preferred activities and occupations; review competencies, abilities and possible…

  11. Using the Self-Directed Search: Career Explorer with High-Risk Middle School Students

    ERIC Educational Resources Information Center

    Osborn, Debra S.; Reardon, Robert C.

    2006-01-01

    The Self-Directed Search: Career Explorer was used with 98 (95% African American) high-risk middle school students as part of 14 structured career groups based on Cognitive Information Processing theory. Results and implications are presented on the outcomes of this program.

  12. Twin Similarities in Holland Types as Shown by Scores on the Self-Directed Search

    ERIC Educational Resources Information Center

    Chauvin, Ida; McDaniel, Janelle R.; Miller, Mark J.; King, James M.; Eddlemon, Ondie L. M.

    2012-01-01

    This study examined the degree of similarity between scores on the Self-Directed Search from one set of identical twins. Predictably, a high congruence score was found. Results from a biographical sheet are discussed as well as implications of the results for career counselors.

  13. Reference Directed Indexing: Redeeming Relevance for Subject Search in Citation Indexes

    E-print Network

    Bradshaw, Shannon

    Reference Directed Indexing: Redeeming Relevance for Subject Search in Citation Indexes Shannon-bradshaw@uiowa.edu Abstract. Citation indexes are valuable tools for research, in part be- cause they provide a means new work within that space. Citation indexes such as CiteSeer [13] have proven extremely useful

  14. Computer versus Counselor Interpretation of Interest Inventories: The Case of the Self-Directed Search.

    ERIC Educational Resources Information Center

    Gati, Itamar; Blumberg, Dani

    1991-01-01

    Examined interpretations of 100 career counselee's responses to Self-Directed Search (SDS). Found that agreement between scales identified as relevant was as high as agreement among counselors, insignificant correlations between counselors' judgments of counselee's degree of interest crystallization and Holland's (1985) measure of consistency, and…

  15. Effects of Diurnal Modulation in Direct Cold Dark Matter Searches. the Experiment in Sierra Grande

    E-print Network

    Gregorio, D E D; Huck, H; Macchiavelli, A O; Gil, S; Collar, J I

    1993-01-01

    Contains a summary, current status and prospects for the direct detection of cold dark matter using diurnal modulation effects as presented at the ELAF 93, Mar del Plata Argentina. The potential advantages of using the Earth as an absorber to produce diurnal modulation effects in cold dark matter searches are given along with some estimates of counting rates.

  16. Interpreting Self-Directed Search Profiles: Validity of the "Rule of Eight"

    ERIC Educational Resources Information Center

    Glavin, Kevin W.; Savickas, Mark L.

    2011-01-01

    Based on the standard error of measurement, Holland (1985) suggested the "rule of eight" for determining the meaningfulness of differences between two summary scores on the Self Directed Search. The present study empirically examined the rule's validity for practice. The participants were 2397 (1497 females and 900 males) undergraduate students…

  17. The Birmingham parallel genetic algorithm and its application to the direct DFT global optimisation of IrN (N = 10-20) clusters

    NASA Astrophysics Data System (ADS)

    Davis, Jack B. A.; Shayeghi, Armin; Horswell, Sarah L.; Johnston, Roy L.

    2015-08-01

    A new open-source parallel genetic algorithm, the Birmingham parallel genetic algorithm, is introduced for the direct density functional theory global optimisation of metallic nanoparticles. The program utilises a pool genetic algorithm methodology for the efficient use of massively parallel computational resources. The scaling capability of the Birmingham parallel genetic algorithm is demonstrated through its application to the global optimisation of iridium clusters with 10 to 20 atoms, a catalytically important system with interesting size-specific effects. This is the first study of its type on Iridium clusters of this size and the parallel algorithm is shown to be capable of scaling beyond previous size restrictions and accurately characterising the structures of these larger system sizes. By globally optimising the system directly at the density functional level of theory, the code captures the cubic structures commonly found in sub-nanometre sized Ir clusters.A new open-source parallel genetic algorithm, the Birmingham parallel genetic algorithm, is introduced for the direct density functional theory global optimisation of metallic nanoparticles. The program utilises a pool genetic algorithm methodology for the efficient use of massively parallel computational resources. The scaling capability of the Birmingham parallel genetic algorithm is demonstrated through its application to the global optimisation of iridium clusters with 10 to 20 atoms, a catalytically important system with interesting size-specific effects. This is the first study of its type on Iridium clusters of this size and the parallel algorithm is shown to be capable of scaling beyond previous size restrictions and accurately characterising the structures of these larger system sizes. By globally optimising the system directly at the density functional level of theory, the code captures the cubic structures commonly found in sub-nanometre sized Ir clusters. Electronic supplementary information (ESI) available. See DOI: 10.1039/C5NR03774C

  18. Density matrix search using direct inversion in the iterative subspace as a linear scaling alternative to diagonalization in

    E-print Network

    Schlegel, H. Bernhard

    Density matrix search using direct inversion in the iterative subspace as a linear scaling of the key bottlenecks. Density matrix search methods provide an efficient linear scaling approach gradient density matrix search CG-DMS method is a successful implementation of this approach

  19. Flux pinning properties in GdBCO coated conductors containing columnar defects with splay plane parallel to current direction

    NASA Astrophysics Data System (ADS)

    Furuki, Y.; Sueyoshi, T.; Kai, T.; Iwanaga, Y.; Fujiyoshi, T.; Ishikawa, N.

    2015-11-01

    In order to reveal the influence of crossing angle of one-dimensional pinning centers on angular dependence of critical current density Jc, heavy-ion irradiation was performed to introduce columnar defects (CDs) crossing at ±?i relative to the c-axis into GdBCO coated conductors, where the splay plane consisting of the two directions of CDs is parallel to the current flow direction. For the sample containing CDs with ?i = ±15°, a single and sharp peak was observed around B || c in the angular dependence of Jc. When the crossing angle was extended to ±45°, the single Jc-peak became broader, which was a gently-sloping mountain-like shape centered at B || c. For ?i = ± 75°, on the other hand, a quite different behavior of Jc from the other irradiated samples was observed, which was analogous to the angular dependence of Jc typical of three dimensional pinning centers.

  20. Electro-optic directed XOR logic circuits based on parallel-cascaded micro-ring resonators.

    PubMed

    Tian, Yonghui; Zhao, Yongpeng; Chen, Wenjie; Guo, Anqi; Li, Dezhao; Zhao, Guolin; Liu, Zilong; Xiao, Huifu; Liu, Guipeng; Yang, Jianhong

    2015-10-01

    We report an electro-optic photonic integrated circuit which can perform the exclusive (XOR) logic operation based on two silicon parallel-cascaded microring resonators (MRRs) fabricated on the silicon-on-insulator (SOI) platform. PIN diodes embedded around MRRs are employed to achieve the carrier injection modulation. Two electrical pulse sequences regarded as two operands of operations are applied to PIN diodes to modulate two MRRs through the free carrier dispersion effect. The final operation result of two operands is output at the Output port in the form of light. The scattering matrix method is employed to establish numerical model of the device, and numerical simulator SG-framework is used to simulate the electrical characteristics of the PIN diodes. XOR operation with the speed of 100Mbps is demonstrated successfully. PMID:26480148

  1. Chaining direct memory access data transfer operations for compute nodes in a parallel computer

    DOEpatents

    Archer, Charles J. (Rochester, MN); Blocksome, Michael A. (Rochester, MN)

    2010-09-28

    Methods, systems, and products are disclosed for chaining DMA data transfer operations for compute nodes in a parallel computer that include: receiving, by an origin DMA engine on an origin node in an origin injection FIFO buffer for the origin DMA engine, a RGET data descriptor specifying a DMA transfer operation data descriptor on the origin node and a second RGET data descriptor on the origin node, the second RGET data descriptor specifying a target RGET data descriptor on the target node, the target RGET data descriptor specifying an additional DMA transfer operation data descriptor on the origin node; creating, by the origin DMA engine, an RGET packet in dependence upon the RGET data descriptor, the RGET packet containing the DMA transfer operation data descriptor and the second RGET data descriptor; and transferring, by the origin DMA engine to a target DMA engine on the target node, the RGET packet.

  2. Oscillation modes of direct current microdischarges with parallel-plate geometry

    SciTech Connect

    Stefanovic, Ilija; Kuschel, Thomas; Winter, Joerg; Skoro, Nikola; Maric, Dragana; Petrovic, Zoran Lj

    2011-10-15

    Two different oscillation modes in microdischarge with parallel-plate geometry have been observed: relaxation oscillations with frequency range between 1.23 and 2.1 kHz and free-running oscillations with 7 kHz frequency. The oscillation modes are induced by increasing power supply voltage or discharge current. For a given power supply voltage, there is a spontaneous transition from one to other oscillation mode and vice versa. Before the transition from relaxation to free-running oscillations, the spontaneous increase of oscillation frequency of relaxation oscillations form 1.3 kHz to 2.1 kHz is measured. Fourier transform spectra of relaxation oscillations reveal chaotic behavior of microdischarges. Volt-ampere (V-A) characteristics associated with relaxation oscillations describes periodical transition between low current, diffuse discharge, and normal glow. However, free-running oscillations appear in subnormal glow only.

  3. Self-pacing direct memory access data transfer operations for compute nodes in a parallel computer

    DOEpatents

    Blocksome, Michael A

    2015-02-17

    Methods, apparatus, and products are disclosed for self-pacing DMA data transfer operations for nodes in a parallel computer that include: transferring, by an origin DMA on an origin node, a RTS message to a target node, the RTS message specifying an message on the origin node for transfer to the target node; receiving, in an origin injection FIFO for the origin DMA from a target DMA on the target node in response to transferring the RTS message, a target RGET descriptor followed by a DMA transfer operation descriptor, the DMA descriptor for transmitting a message portion to the target node, the target RGET descriptor specifying an origin RGET descriptor on the origin node that specifies an additional DMA descriptor for transmitting an additional message portion to the target node; processing, by the origin DMA, the target RGET descriptor; and processing, by the origin DMA, the DMA transfer operation descriptor.

  4. Search for direct CP-violation in singly-Cabibbo suppressed D+- --> K+ K- pi+- decays

    E-print Network

    BaBar Collaboration; J. P. Lees; V. Poireau; V. Tisserand; J. Garra Tico; E. Grauges; A. Palano; G. Eigen; B. Stugu; D. N. Brown; L. T. Kerth; Yu. G. Kolomensky; G. Lynch; H. Koch; T. Schroeder; D. J. Asgeirsson; C. Hearty; T. S. Mattison; J. A. McKenna; R. Y. So; A. Khan; V. E. Blinov; A. R. Buzykaev; V. P. Druzhinin; V. B. Golubev; E. A. Kravchenko; A. P. Onuchin; S. I. Serednyakov; Yu. I. Skovpen; E. P. Solodov; K. Yu. Todyshev; A. N. Yushkov; M. Bondioli; D. Kirkby; A. J. Lankford; M. Mandelkern; H. Atmacan; J. W. Gary; F. Liu; O. Long; G. M. Vitug; C. Campagnari; T. M. Hong; D. Kovalskyi; J. D. Richman; C. A. West; A. M. Eisner; J. Kroseberg; W. S. Lockman; A. J. Martinez; B. A. Schumm; A. Seiden; D. S. Chao; C. H. Cheng; B. Echenard; K. T. Flood; D. G. Hitlin; P. Ongmongkolkul; F. C. Porter; A. Y. Rakitin; R. Andreassen; Z. Huard; B. T. Meadows; M. D. Sokoloff; L. Sun; P. C. Bloom; W. T. Ford; A. Gaz; U. Nauenberg; J. G. Smith; S. R. Wagner; R. Ayad; W. H. Toki; B. Spaan; K. R. Schubert; R. Schwierz; D. Bernard; M. Verderi; P. J. Clark; S. Playfer; D. Bettoni; C. Bozzi; R. Calabrese; G. Cibinetto; E. Fioravanti; I. Garzia; E. Luppi; L. Piemontese; V. Santoro; R. Baldini-Ferroli; A. Calcaterra; R. de Sangro; G. Finocchiaro; P. Patteri; M. Piccolo; M. Rama; A. Zallo; R. Contri; E. Guido; M. Lo Vetere; M. R. Monge; S. Passaggio; C. Patrignani; E. Robutti; B. Bhuyan; V. Prasad; C. L. Lee; M. Morii; A. J. Edwards; A. Adametz; U. Uwer; H. M. Lacker; T. Lueck; P. D. Dauncey; U. Mallik; C. Chen; J. Cochran; W. T. Meyer; S. Prell; A. E. Rubin; A. V. Gritsan; Z. J. Guo; N. Arnaud; M. Davier; D. Derkach; G. Grosdidier; F. Le Diberder; A. M. Lutz; B. Malaescu; P. Roudeau; M. H. Schune; A. Stocchi; G. Wormser; D. J. Lange; D. M. Wright; C. A. Chavez; J. P. Coleman; J. R. Fry; E. Gabathuler; D. E. Hutchcroft; D. J. Payne; C. Touramanis; A. J. Bevan; F. Di Lodovico; R. Sacco; M. Sigamani; G. Cowan; D. N. Brown; C. L. Davis; A. G. Denig; M. Fritsch; W. Gradl; K. Griessinger; A. Hafner; E. Prencipe; R. J. Barlow; G. Jackson; G. D. Lafferty; E. Behn; R. Cenci; B. Hamilton; A. Jawahery; D. A. Roberts; C. Dallapiccola; R. Cowan; D. Dujmic; G. Sciolla; R. Cheaib; D. Lindemann; P. M. Patel; S. H. Robertson; P. Biassoni; N. Neri; F. Palombo; S. Stracka; L. Cremaldi; R. Godang; R. Kroeger; P. Sonnek; D. J. Summers; X. Nguyen; M. Simard; P. Taras; G. De Nardo; D. Monorchio; G. Onorato; C. Sciacca; M. Martinelli; G. Raven; C. P. Jessop; J. M. LoSecco; W. F. Wang; K. Honscheid; R. Kass; J. Brau; R. Frey; N. B. Sinev; D. Strom; E. Torrence; E. Feltresi; N. Gagliardi; M. Margoni; M. Morandin; M. Posocco; M. Rotondo; G. Simi; F. Simonetto; R. Stroili; S. Akar; E. Ben-Haim; M. Bomben; G. R. Bonneaud; H. Briand; G. Calderini; J. Chauveau; O. Hamon; Ph. Leruste; G. Marchiori; J. Ocariz; S. Sitt; M. Biasini; E. Manoni; S. Pacetti; A. Rossi; C. Angelini; G. Batignani; S. Bettarini; M. Carpinelli; G. Casarosa; A. Cervelli; F. Forti; M. A. Giorgi; A. Lusiani; B. Oberhof; E. Paoloni; A. Perez; G. Rizzo; J. J. Walsh; D. Lopes Pegna; J. Olsen; A. J. S. Smith; A. V. Telnov; F. Anulli; R. Faccini; F. Ferrarotto; F. Ferroni; M. Gaspero; L. Li Gioi; M. A. Mazzoni; G. Piredda; C. Bunger; O. Grunberg; T. Hartmann; T. Leddig; C. Voss; R. Waldi; T. Adye; E. O. Olaiya; F. F. Wilson; S. Emery; G. Hamel de Monchenault; G. Vasseur; Ch. Yeche; D. Aston; D. J. Bard; R. Bartoldus; J. F. Benitez; C. Cartaro; M. R. Convery; J. Dorfan; G. P. Dubois-Felsmann; W. Dunwoodie; M. Ebert; R. C. Field; M. Franco Sevilla; B. G. Fulsom; A. M. Gabareen; M. T. Graham; P. Grenier; C. Hast; W. R. Innes; M. H. Kelsey; P. Kim; M. L. Kocian; D. W. G. S. Leith; P. Lewis; B. Lindquist; S. Luitz; V. Luth; H. L. Lynch; D. B. MacFarlane; D. R. Muller; H. Neal; S. Nelson; M. Perl; T. Pulliam; B. N. Ratcliff; A. Roodman; A. A. Salnikov; R. H. Schindler; A. Snyder; D. Su; M. K. Sullivan; J. Va'vra; A. P. Wagner; W. J. Wisniewski; M. Wittgen; D. H. Wright; H. W. Wulsin; C. C. Young; V. Ziegler; W. Park; M. V. Purohit; R. M. White; J. R. Wilson; A. Randle-Conde; S. J. Sekula; M. Bellis; P. R. Burchat; T. S. Miyashita; E. M. T. Puccio; M. S. Alam; J. A. Ernst; R. Gorodeisky; N. Guttman; D. R. Peimer; A. Soffer; P. Lund; S. M. Spanier; J. L. Ritchie; A. M. Ruland; R. F. Schwitters; B. C. Wray; J. M. Izen; X. C. Lou; F. Bianchi; D. Gamba; S. Zambito; L. Lanceri; L. Vitale; F. Martinez-Vidal; A. Oyanguren; P. Villanueva-Perez; H. Ahmed; J. Albert; Sw. Banerjee; F. U. Bernlochner; H. H. F. Choi; G. J. King; R. Kowalewski; M. J. Lewczuk; I. M. Nugent; J. M. Roney; R. J. Sobie; N. Tasneem; T. J. Gershon; P. F. Harrison; T. E. Latham; H. R. Band; S. Dasu; Y. Pan; R. Prepost; S. L. Wu

    2013-02-21

    We report on a search for direct CP asymmetry in the singly Cabibbo-suppressed decay D+- --> K+ K- pi+- using a data sample of 476 fb-1 accumulated with the BaBar detector running at and just below the Y(4S) resonance. The CP-violating decay rate asymmetry A_CP is determined to be (0.35 +- 0.30 +- 0.15)%. Model-dependent and model-independent Dalitz plot analysis techniques are used to search for CP-violating asymmetries in the various intermediate states.

  5. A Disk-Based Parallel Implementation for Direct Condensation of Large Permutation Modules

    E-print Network

    Mueller, Jürgen

    * * Eric Robinson J"urgen M"uller Gene Cooperman College of Computer Science tivadar@ccs.neu.edu juergen.mueller@ gene@ccs.neu.edu math A more recent research direction [* *6, 22] looked at using I.1.2 [Symbolic and Algebraic Manipulation

  6. Influence of massively parallel e-beam direct-write pixel size on electron proximity correction

    NASA Astrophysics Data System (ADS)

    Lin, S. J.; Chen, P. S.; Shin, J. J.; Wang, W. C.; Lin, Burn J.

    2011-04-01

    Massively E-beam maskless lithography (MEBML2) is one of the potential solutions for 32-nm half-pitch and beyond. In the past, its relatively low throughput restricted EBDW development to mostly mask making, small volume wafer production and prototyping. Recently the production worthy ML2 approaches, >10,000 e-beams writing in parallel, have been proposed by MAPPER, KLA and IMS. These approaches use raster scan in pattern writing. Hence the bitmap is certainly the final data format. The bitmap format used to have huge data volume with fine pixel size to maintain the CD accuracy after electron proximity correction (EPC). Data handling becomes necessary, especially on data transmission rate. The aggregated data transmission rate would be up to 1963 Tera bits per second (bps) for a 10 WPH tool using 1-nm pixel size and 1-bit gray level. It needs 19,630 fibers each transmitting 10 Gbps. The data rate per beam would be >20 Gbps in 10,000-beam MEBML2. Hence data reduction using bigger pixel size to achieve sub-nm EPC accuracy is crucial for reducing the fiber number to the beam number. In this paper, the writing-error-enhanced-factor to quantitatively characterize the impact of CD accuracy by various total blur in resist is reported; and we propose the vernier pattern to verify sub-nm CD accuracy and the in-house dithering raster method to achieve sub-0.2-nm CD accuracy using multiple-nm pixel sizes, which could reduce the need of the aggregated data rate to 11%, 33%, 44% and 79% of 1963 Tbps on 22-nm, 16-nm, 11-nm, 8-nm node respectively.

  7. Solar power satellite rectenna design study: Directional receiving elements and parallel-series combining analysis

    NASA Technical Reports Server (NTRS)

    Gutmann, R. J.; Borrego, J. M.

    1978-01-01

    Rectenna conversion efficiencies (RF to dc) approximating 85 percent were demonstrated on a small scale, clearly indicating the feasibility and potential of efficiency of microwave power to dc. The overall cost estimates of the solar power satellite indicate that the baseline rectenna subsystem will be between 25 to 40 percent of the system cost. The directional receiving elements and element extensions were studied, along with power combining evaluation and evaluation extensions.

  8. Directional Search for Isospin-Violating Dark Matter with Nuclear Emulsion

    E-print Network

    Keiko I. Nagao; Tatsuhiro Naka

    2012-05-22

    Some of direct dark matter searches reported not only positive signals but also annual modulation of the signal event. However, the parameter spaces have been excluded by other experiments. Isospin violating dark matter solves the contradiction by supposing different coupling to proton and neutron. We study the possibility to test the favored parameter region by isospin violating dark matter model with the future detector of dark matter using the nuclear emulsion. Since the nuclear emulsion detector has directional sensitivity, the detector is expected to examine whether the annual modulations observed other experiments is caused by dark matter or background signals.

  9. Advancing predictive models for particulate formation in turbulent flames via massively parallel direct numerical simulations

    PubMed Central

    Bisetti, Fabrizio; Attili, Antonio; Pitsch, Heinz

    2014-01-01

    Combustion of fossil fuels is likely to continue for the near future due to the growing trends in energy consumption worldwide. The increase in efficiency and the reduction of pollutant emissions from combustion devices are pivotal to achieving meaningful levels of carbon abatement as part of the ongoing climate change efforts. Computational fluid dynamics featuring adequate combustion models will play an increasingly important role in the design of more efficient and cleaner industrial burners, internal combustion engines, and combustors for stationary power generation and aircraft propulsion. Today, turbulent combustion modelling is hindered severely by the lack of data that are accurate and sufficiently complete to assess and remedy model deficiencies effectively. In particular, the formation of pollutants is a complex, nonlinear and multi-scale process characterized by the interaction of molecular and turbulent mixing with a multitude of chemical reactions with disparate time scales. The use of direct numerical simulation (DNS) featuring a state of the art description of the underlying chemistry and physical processes has contributed greatly to combustion model development in recent years. In this paper, the analysis of the intricate evolution of soot formation in turbulent flames demonstrates how DNS databases are used to illuminate relevant physico-chemical mechanisms and to identify modelling needs. PMID:25024412

  10. Applicability of preparative overpressured layer chromatography and direct bioautography in search of antibacterial chamomile compounds.

    PubMed

    Móricz, Agnes M; Ott, Péter G; Alberti, Agnes; Böszörményi, Andrea; Lemberkovics, Eva; Szoke, Eva; Kéry, Agnes; Mincsovics, Emil

    2013-01-01

    In situ sample preparation and preparative overpressured layer chromatography (OPLC) fractionation on a 0.5 mm thick adsorbent layer of chamomile flower methanol extract prepurified by conventional gravitation accelerated column chromatography were applied in searching for bioactive components. Sample cleanup in situ on the adsorbent layer subsequent to sample application was performed using mobile phase flow in the opposite direction (the input and output of the eluent was exchanged). The antibacterial effect of the fractions obtained from the stepwise gradient OPLC separation with the flow in the normal direction was evaluated by direct bioautography against two Gram-negative bacteria: the luminescence gene tagged plant pathogenic Pseudomonas syringae pv. maculicola, and the naturally luminescent marine bacterium Vibrio fischeri. The fractions having strong activity were analyzed by SPME-GC/MS and HPLC/MS/MS. Mainly essential oil components, coumarins, flavonoids, phenolic acids, and fatty acids were tentatively identified in the fractions. PMID:24645496

  11. Adaptive particle-based pore-level modeling of incompressible fluid flow in porous media: a direct and parallel approach

    NASA Astrophysics Data System (ADS)

    Ovaysi, S.; Piri, M.

    2009-12-01

    We present a three-dimensional fully dynamic parallel particle-based model for direct pore-level simulation of incompressible viscous fluid flow in disordered porous media. The model was developed from scratch and is capable of simulating flow directly in three-dimensional high-resolution microtomography images of naturally occurring or man-made porous systems. It reads the images as input where the position of the solid walls are given. The entire medium, i.e., solid and fluid, is then discretized using particles. The model is based on Moving Particle Semi-implicit (MPS) technique. We modify this technique in order to improve its stability. The model handles highly irregular fluid-solid boundaries effectively. It takes into account viscous pressure drop in addition to the gravity forces. It conserves mass and can automatically detect any false connectivity with fluid particles in the neighboring pores and throats. It includes a sophisticated algorithm to automatically split and merge particles to maintain hydraulic connectivity of extremely narrow conduits. Furthermore, it uses novel methods to handle particle inconsistencies and open boundaries. To handle the computational load, we present a fully parallel version of the model that runs on distributed memory computer clusters and exhibits excellent scalability. The model is used to simulate unsteady-state flow problems under different conditions starting from straight noncircular capillary tubes with different cross-sectional shapes, i.e., circular/elliptical, square/rectangular and triangular cross-sections. We compare the predicted dimensionless hydraulic conductances with the data available in the literature and observe an excellent agreement. We then test the scalability of our parallel model with two samples of an artificial sandstone, samples A and B, with different volumes and different distributions (non-uniform and uniform) of solid particles among the processors. An excellent linear scalability is obtained for sample B that has more uniform distribution of solid particles leading to a superior load balancing. The model is then used to simulate fluid flow directly in REV size three-dimensional x-ray images of a naturally occurring sandstone. We analyze the quality and consistency of the predicted flow behavior and calculate absolute permeability, which compares well with the available network modeling and Lattice-Boltzmann permeabilities available in the literature for the same sandstone. We show that the model conserves mass very well and is stable computationally even at very narrow fluid conduits. The transient- and the steady-state fluid flow patterns are presented as well as the steady-state flow rates to compute absolute permeability. Furthermore, we discuss the vital role of our adaptive particle resolution scheme in preserving the original pore connectivity of the samples and their narrow channels through splitting and merging of fluid particles.

  12. A comparison of directed search target detection versus in-scene target detection in Worldview-2 datasets

    NASA Astrophysics Data System (ADS)

    Grossman, S.

    2015-05-01

    Since the events of September 11, 2001, the intelligence focus has moved from large order-of-battle targets to small targets of opportunity. Additionally, the business community has discovered the use of remotely sensed data to anticipate demand and derive data on their competition. This requires the finer spectral and spatial fidelity now available to recognize those targets. This work hypothesizes that directed searches using calibrated data perform at least as well as inscene manually intensive target detection searches. It uses calibrated Worldview-2 multispectral images with NEF generated signatures and standard detection algorithms to compare bespoke directed search capabilities against ENVI™ in-scene search capabilities. Multiple execution runs are performed at increasing thresholds to generate detection rates. These rates are plotted and statistically analyzed. While individual head-to-head comparison results vary, 88% of the directed searches performed at least as well as in-scene searches with 50% clearly outperforming in-scene methods. The results strongly support the premise that directed searches perform at least as well as comparable in-scene searches.

  13. Bi-directional search for bugs: A tool for accelerating knowledge acquisition for equation-based tutoring systems

    E-print Network

    VanLehn, Kurt

    Bi-directional search for bugs: A tool for accelerating knowledge acquisition for equation. This paper focuses on a novel and particularly powerful tool that uses bidirectional search to locate bugs in terms of the ontology. Fig. 2 illustrates a problem named "isobaric expansion of water" which would

  14. Search for direct CP violation in singly Cabibbo-suppressed D±?K+K-?± decays

    NASA Astrophysics Data System (ADS)

    Lees, J. P.; Poireau, V.; Tisserand, V.; Garra Tico, J.; Grauges, E.; Palano, A.; Eigen, G.; Stugu, B.; Brown, D. N.; Kerth, L. T.; Kolomensky, Yu. G.; Lynch, G.; Koch, H.; Schroeder, T.; Asgeirsson, D. J.; Hearty, C.; Mattison, T. S.; McKenna, J. A.; So, R. Y.; Khan, A.; Blinov, V. E.; Buzykaev, A. R.; Druzhinin, V. P.; Golubev, V. B.; Kravchenko, E. A.; Onuchin, A. P.; Serednyakov, S. I.; Skovpen, Yu. I.; Solodov, E. P.; Todyshev, K. Yu.; Yushkov, A. N.; Bondioli, M.; Kirkby, D.; Lankford, A. J.; Mandelkern, M.; Atmacan, H.; Gary, J. W.; Liu, F.; Long, O.; Vitug, G. M.; Campagnari, C.; Hong, T. M.; Kovalskyi, D.; Richman, J. D.; West, C. A.; Eisner, A. M.; Kroseberg, J.; Lockman, W. S.; Martinez, A. J.; Schumm, B. A.; Seiden, A.; Chao, D. S.; Cheng, C. H.; Echenard, B.; Flood, K. T.; Hitlin, D. G.; Ongmongkolkul, P.; Porter, F. C.; Rakitin, A. Y.; Andreassen, R.; Huard, Z.; Meadows, B. T.; Sokoloff, M. D.; Sun, L.; Bloom, P. C.; Ford, W. T.; Gaz, A.; Nauenberg, U.; Smith, J. G.; Wagner, S. R.; Ayad, R.; Toki, W. H.; Spaan, B.; Schubert, K. R.; Schwierz, R.; Bernard, D.; Verderi, M.; Clark, P. J.; Playfer, S.; Bettoni, D.; Bozzi, C.; Calabrese, R.; Cibinetto, G.; Fioravanti, E.; Garzia, I.; Luppi, E.; Piemontese, L.; Santoro, V.; Baldini-Ferroli, R.; Calcaterra, A.; de Sangro, R.; Finocchiaro, G.; Patteri, P.; Peruzzi, I. M.; Piccolo, M.; Rama, M.; Zallo, A.; Contri, R.; Guido, E.; Lo Vetere, M.; Monge, M. R.; Passaggio, S.; Patrignani, C.; Robutti, E.; Bhuyan, B.; Prasad, V.; Lee, C. L.; Morii, M.; Edwards, A. J.; Adametz, A.; Uwer, U.; Lacker, H. M.; Lueck, T.; Dauncey, P. D.; Mallik, U.; Chen, C.; Cochran, J.; Meyer, W. T.; Prell, S.; Rubin, A. E.; Gritsan, A. V.; Guo, Z. J.; Arnaud, N.; Davier, M.; Derkach, D.; Grosdidier, G.; Le Diberder, F.; Lutz, A. M.; Malaescu, B.; Roudeau, P.; Schune, M. H.; Stocchi, A.; Wormser, G.; Lange, D. J.; Wright, D. M.; Chavez, C. A.; Coleman, J. P.; Fry, J. R.; Gabathuler, E.; Hutchcroft, D. E.; Payne, D. J.; Touramanis, C.; Bevan, A. J.; Di Lodovico, F.; Sacco, R.; Sigamani, M.; Cowan, G.; Brown, D. N.; Davis, C. L.; Denig, A. G.; Fritsch, M.; Gradl, W.; Griessinger, K.; Hafner, A.; Prencipe, E.; Barlow, R. J.; Jackson, G.; Lafferty, G. D.; Behn, E.; Cenci, R.; Hamilton, B.; Jawahery, A.; Roberts, D. A.; Dallapiccola, C.; Cowan, R.; Dujmic, D.; Sciolla, G.; Cheaib, R.; Lindemann, D.; Patel, P. M.; Robertson, S. H.; Biassoni, P.; Neri, N.; Palombo, F.; Stracka, S.; Cremaldi, L.; Godang, R.; Kroeger, R.; Sonnek, P.; Summers, D. J.; Nguyen, X.; Simard, M.; Taras, P.; De Nardo, G.; Monorchio, D.; Onorato, G.; Sciacca, C.; Martinelli, M.; Raven, G.; Jessop, C. P.; LoSecco, J. M.; Wang, W. F.; Honscheid, K.; Kass, R.; Brau, J.; Frey, R.; Sinev, N. B.; Strom, D.; Torrence, E.; Feltresi, E.; Gagliardi, N.; Margoni, M.; Morandin, M.; Posocco, M.; Rotondo, M.; Simi, G.; Simonetto, F.; Stroili, R.; Akar, S.; Ben-Haim, E.; Bomben, M.; Bonneaud, G. R.; Briand, H.; Calderini, G.; Chauveau, J.; Hamon, O.; Leruste, Ph.; Marchiori, G.; Ocariz, J.; Sitt, S.; Biasini, M.; Manoni, E.; Pacetti, S.; Rossi, A.; Angelini, C.; Batignani, G.; Bettarini, S.; Carpinelli, M.; Casarosa, G.; Cervelli, A.; Forti, F.; Giorgi, M. A.; Lusiani, A.; Oberhof, B.; Paoloni, E.; Perez, A.; Rizzo, G.; Walsh, J. J.; Lopes Pegna, D.; Olsen, J.; Smith, A. J. S.; Telnov, A. V.; Anulli, F.; Faccini, R.; Ferrarotto, F.; Ferroni, F.; Gaspero, M.; Li Gioi, L.; Mazzoni, M. A.; Piredda, G.; Bünger, C.; Grünberg, O.; Hartmann, T.; Leddig, T.; Voß, C.; Waldi, R.; Adye, T.; Olaiya, E. O.; Wilson, F. F.; Emery, S.; Hamel de Monchenault, G.; Vasseur, G.; Yèche, Ch.; Aston, D.; Bard, D. J.; Bartoldus, R.; Benitez, J. F.; Cartaro, C.; Convery, M. R.; Dorfan, J.; Dubois-Felsmann, G. P.; Dunwoodie, W.; Ebert, M.; Field, R. C.; Franco Sevilla, M.; Fulsom, B. G.; Gabareen, A. M.; Graham, M. T.; Grenier, P.; Hast, C.; Innes, W. R.; Kelsey, M. H.; Kim, P.; Kocian, M. L.; Leith, D. W. G. S.; Lewis, P.; Lindquist, B.; Luitz, S.; Luth, V.; Lynch, H. L.; MacFarlane, D. B.; Muller, D. R.; Neal, H.; Nelson, S.; Perl, M.; Pulliam, T.; Ratcliff, B. N.; Roodman, A.; Salnikov, A. A.; Schindler, R. H.; Snyder, A.; Su, D.; Sullivan, M. K.; Va'vra, J.; Wagner, A. P.; Wisniewski, W. J.; Wittgen, M.; Wright, D. H.; Wulsin, H. W.; Young, C. C.; Ziegler, V.; Park, W.; Purohit, M. V.; White, R. M.; Wilson, J. R.; Randle-Conde, A.; Sekula, S. J.; Bellis, M.; Burchat, P. R.; Miyashita, T. S.; Puccio, E. M. T.; Alam, M. S.; Ernst, J. A.; Gorodeisky, R.; Guttman, N.; Peimer, D. R.; Soffer, A.; Lund, P.; Spanier, S. M.; Ritchie, J. L.; Ruland, A. M.; Schwitters, R. F.; Wray, B. C.; Izen, J. M.; Lou, X. C.; Bianchi, F.; Gamba, D.; Zambito, S.; Lanceri, L.; Vitale, L.; Martinez-Vidal, F.; Oyanguren, A.; Villanueva-Perez, P.; Ahmed, H.

    2013-03-01

    We report on a search for direct CP violation in the singly Cabibbo-suppressed decay D+?K+K-?+ using a data sample of 476fb-1 of e+e- annihilation data accumulated with the BABAR detector at the SLAC PEP-II electron-positron collider, running at and just below the energy of the ?(4S) resonance. The integrated CP-violating decay rate asymmetry ACP is determined to be (0.37±0.30±0.15)%. Model-independent and model-dependent Dalitz plot analysis techniques are used to search for CP-violating asymmetries in the various intermediate states. We find no evidence for CP-violation asymmetry.

  15. Majorana Dark Matter with a Coloured Mediator: Collider vs Direct and Indirect Searches

    E-print Network

    Mathias Garny; Alejandro Ibarra; Sara Rydbeck; Stefan Vogl

    2014-03-18

    We investigate the signatures at the Large Hadron Collider of a minimal model where the dark matter particle is a Majorana fermion that couples to the Standard Model via one or several coloured mediators. We emphasize the importance of the production channel of coloured scalars through the exchange of a dark matter particle in the t-channel, and perform a dedicated analysis of searches for jets and missing energy for this model. We find that the collider constraints are highly competitive compared to direct detection, and can even be considerably stronger over a wide range of parameters. We also discuss the complementarity with searches for spectral features at gamma-ray telescopes and comment on the possibility of several coloured mediators, which is further constrained by flavour observables.

  16. Towards Direct Detection of WIMPs with the Cryogenic Dark Matter Search

    SciTech Connect

    Figueroa-Feliciano, E.

    2010-02-10

    The Cryogenic Dark Matter Search (CDMS) is carrying out a direct detection search for Weakly Interacting Massive Particles (WIMPs), one of the favored candidates for dark matter. Our latest data has placed some of the most stringent limits on the WIMP-nucleon spin-independent cross section of 6.6x10{sup -44} cm{sup 2} for 60 GeV WIMPs at the 90% confidence level. This paper describes our experiment and our latest results; the status of SuperCDMS Soudan, a new experiment at the Soudan mine in Minnesota that will achieve a sensitivity of 5x10{sup -45} cm{sup 2} our plans for SuperCDMS SNOLAB, a 100 kg experiment with a projected sensitivity of 3x10{sup -46} cm{sup 2}; and GEODM, a ton-scale experiment at DUSEL with a projected sensitivity of 2x10{sup -47} cm{sup 2}.

  17. ZEPLIN-III direct dark matter search : final results and measurements in support of next generation instruments 

    E-print Network

    Reichhart, Lea

    2013-11-28

    Astrophysical observations give convincing evidence for a vast non-baryonic component, the so-called dark matter, accounting for over 20% of the overall content of our Universe. Direct dark matter search experiments ...

  18. Search for direct and indirect unitarity violation in neutrino oscillation experiments

    NASA Astrophysics Data System (ADS)

    Luo, Shu

    2014-08-01

    If three standard neutrinos mix with other degree of freedoms like sterile neutrinos, no matter how heavy the sterile neutrino masses are, it could result in the unitarity violation in the MNSP matrix. Nevertheless, the unitarity violation induced by the existence of light or heavy sterile neutrinos can have very different effects on neutrino oscillations, we call the former case direct unitarity violation and the later case the indirect unitarity violation. We will explain in this paper the difference of these two kinds of unitarity violations, then focus on the possibilities of searching the unitarity violation in neutrino oscillation experiments, of which the precision reactor experiments with multiple baselines are discussed in detail.

  19. A Generalized Radiation Model for Human Mobility: Spatial Scale, Searching Direction and Trip Constraint

    PubMed Central

    Kang, Chaogui; Liu, Yu; Guo, Diansheng; Qin, Kun

    2015-01-01

    We generalized the recently introduced “radiation model”, as an analog to the generalization of the classic “gravity model”, to consolidate its nature of universality for modeling diverse mobility systems. By imposing the appropriate scaling exponent ?, normalization factor ? and system constraints including searching direction and trip OD constraint, the generalized radiation model accurately captures real human movements in various scenarios and spatial scales, including two different countries and four different cities. Our analytical results also indicated that the generalized radiation model outperformed alternative mobility models in various empirical analyses. PMID:26600153

  20. Influence of data volume and EPC on process window in massively parallel e-beam direct write

    NASA Astrophysics Data System (ADS)

    Lin, Shy-Jay; Liu, Pei-Yi; Chen, Cheng-Hung; Wang, Wen-Chuan; Shin, Jaw-Jung; Lin, Burn Jeng; McCord, Mark A.; Shriyan, Sameet K.

    2013-03-01

    Multiple e-beam direct write lithography (MEBDW), using >10,000 e-beams writing in parallel, proposed by MAPPER, KLA-Tencor, and IMS is a potential solution for 20-nm half-pitch and beyond. The raster scan in MEBDW makes bitmap its data format. Data handling becomes indispensable since bitmap needs a huge data volume due to the fine pixel size to keep the CD accuracy after e-beam proximity correction (EPC). In fact, in 10,000-beam MEBDW, for a 10 WPH tool of 1-nm pixel size and 1-bit gray level, the aggregated data transmission rate would be up to 1963 Tera bits per second (bps), requiring 19,630 fibers transmitting 10 Gbps in each fiber. The data rate per beam would be <20 Gbps. Hence data reduction using bigger pixel size, fewer grey levels to achieve sub-nm EPC accuracy, and data truncation have been extensively studied. In this paper, process window assessment through Exposure-Defocus (E-D) Forest to quantitatively characterize the data truncation before and after EPC is reported. REBL electron optics, electron scattering in resist, and resist acid diffusion are considered, to construct the E-D Forest and to analyze the imaging performance of the most representative layers and patterns, such as critical line/space and hole layers with minimum pitch, cutting layers, and implant layers, for the 10-nm, and 7-nm nodes.

  1. Fuel cell and lithium iron phosphate battery hybrid powertrain with an ultracapacitor bank using direct parallel structure

    NASA Astrophysics Data System (ADS)

    Xie, Changjun; Xu, Xinyi; Bujlo, Piotr; Shen, Di; Zhao, Hengbing; Quan, Shuhai

    2015-04-01

    In this study, a novel fuel cell-Li-ion battery hybrid powertrain using a direct parallel structure with an ultracapacitor bank is presented. In addition, a fuzzy logic controller is designed for the energy management of hybrid powertrain aimed at adjusting and stabilizing the DC bus voltage via a bidirectional DC/DC converter. To validate the Fuel cell-Li-ion battery-Ultracapacitor (FC-LIB-UC) hybrid powertrain and energy management strategies developed in this study, a test station powered by a 1 kW fuel cell system, a 2.8 kWh Li-ion battery pack and a 330 F/48.6 V ultracapacitor bank is designed and constructed on the basis of stand-alone module. Finally, an Urban Dynamometer Driving Schedule cycle is performed on this station and the experimental results show that: (i) the power distribution of FC system is narrowest and the power distribution of UC bank is widest during a cycle, and (ii) the FC system is controlled to satisfy the slow dynamic variation in this hybrid powertrain and the output of the LIB pack and UC bank is adjusted to meet fast dynamic load requirements. As a result, the proposed FC-LIB-UC hybrid powertrain can take full advantage of three kinds of energy sources.

  2. 3-dimensional magnetotelluric inversion including topography using deformed hexahedral edge finite elements and direct solvers parallelized on symmetric multiprocessor computers - Part II: direct data-space inverse solution

    NASA Astrophysics Data System (ADS)

    Kordy, M.; Wannamaker, P.; Maris, V.; Cherkaev, E.; Hill, G.

    2016-01-01

    Following the creation described in Part I of a deformable edge finite-element simulator for 3-D magnetotelluric (MT) responses using direct solvers, in Part II we develop an algorithm named HexMT for 3-D regularized inversion of MT data including topography. Direct solvers parallelized on large-RAM, symmetric multiprocessor (SMP) workstations are used also for the Gauss-Newton model update. By exploiting the data-space approach, the computational cost of the model update becomes much less in both time and computer memory than the cost of the forward simulation. In order to regularize using the second norm of the gradient, we factor the matrix related to the regularization term and apply its inverse to the Jacobian, which is done using the MKL PARDISO library. For dense matrix multiplication and factorization related to the model update, we use the PLASMA library which shows very good scalability across processor cores. A synthetic test inversion using a simple hill model shows that including topography can be important; in this case depression of the electric field by the hill can cause false conductors at depth or mask the presence of resistive structure. With a simple model of two buried bricks, a uniform spatial weighting for the norm of model smoothing recovered more accurate locations for the tomographic images compared to weightings which were a function of parameter Jacobians. We implement joint inversion for static distortion matrices tested using the Dublin secret model 2, for which we are able to reduce nRMS to ˜1.1 while avoiding oscillatory convergence. Finally we test the code on field data by inverting full impedance and tipper MT responses collected around Mount St Helens in the Cascade volcanic chain. Among several prominent structures, the north-south trending, eruption-controlling shear zone is clearly imaged in the inversion.

  3. A directed search for continuous Gravitational Waves from the Galactic Center

    E-print Network

    The LIGO Scientific Collaboration; The Virgo Collaboration; J. Aasi; J. Abadie; B. P. Abbott; R. Abbott; T. Abbott; M. R. Abernathy; T. Accadia; F. Acernese; C. Adams; T. Adams; R. X. Adhikari; C. Affeldt; M. Agathos; N. Aggarwal; O. D. Aguiar; P. Ajith; B. Allen; A. Allocca; E. Amador Ceron; D. Amariutei; R. A. Anderson; S. B. Anderson; W. G. Anderson; K. Arai; M. C. Araya; C. Arceneaux; J. Areeda; S. Ast; S. M. Aston; P. Astone; P. Aufmuth; C. Aulbert; L. Austin; B. E. Aylott; S. Babak; P. T. Baker; G. Ballardin; S. W. Ballmer; J. C. Barayoga; D. Barker; S. H. Barnum; F. Barone; B. Barr; L. Barsotti; M. Barsuglia; M. A. Barton; I. Bartos; R. Bassiri; A. Basti; J. Batch; J. Bauchrowitz; Th. S. Bauer; M. Bebronne; B. Behnke; M. Bejger; M. G. Beker; A. S. Bell; C. Bell; I. Belopolski; G. Bergmann; J. M. Berliner; A. Bertolini; D. Bessis; J. Betzwieser; P. T. Beyersdorf; T. Bhadbhade; I. A. Bilenko; G. Billingsley; J. Birch; M. Bitossi; M. A. Bizouard; E. Black; J. K. Blackburn; L. Blackburn; D. Blair; M. Blom; O. Bock; T. P. Bodiya; M. Boer; C. Bogan; C. Bond; F. Bondu; L. Bonelli; R. Bonnand; R. Bork; M. Born; S. Bose; L. Bosi; J. Bowers; C. Bradaschia; P. R. Brady; V. B. Braginsky; M. Branchesi; C. A. Brannen; J. E. Brau; J. Breyer; T. Briant; D. O. Bridges; A. Brillet; M. Brinkmann; V. Brisson; M. Britzger; A. F. Brooks; D. A. Brown; D. D. Brown; F. Brückner; T. Bulik; H. J. Bulten; A. Buonanno; D. Buskulic; C. Buy; R. L. Byer; L. Cadonati; G. Cagnoli; J. Calderón Bustillo; E. Calloni; J. B. Camp; P. Campsie; K. C. Cannon; B. Canuel; J. Cao; C. D. Capano; F. Carbognani; L. Carbone; S. Caride; A. Castiglia; S. Caudill; M. Cavagliá; F. Cavalier; R. Cavalieri; G. Cella; C. Cepeda; E. Cesarini; R. Chakraborty; T. Chalermsongsak; S. Chao; P. Charlton; E. Chassande-Mottin; X. Chen; Y. Chen; A. Chincarini; A. Chiummo; H. S. Cho; J. Chow; N. Christensen; Q. Chu; S. S. Y. Chua; S. Chung; G. Ciani; F. Clara; D. E. Clark; J. A. Clark; F. Cleva; E. Coccia; P. -F. Cohadon; A. Colla; M. Colombini; M. Constancio Jr; A. Conte; R. Conte; D. Cook; T. R. Corbitt; M. Cordier; N. Cornish; A. Corsi; C. A. Costa; M. W. Coughlin; J. -P. Coulon; S. Countryman; P. Couvares; D. M. Coward; M. Cowart; D. C. Coyne; K. Craig; J. D. E. Creighton; T. D. Creighton; S. G. Crowder; A. Cumming; L. Cunningham; E. Cuoco; K. Dahl; T. Dal Canton; M. Damjanic; S. L. Danilishin; S. D'Antonio; K. Danzmann; V. Dattilo; B. Daudert; H. Daveloza; M. Davier; G. S. Davies; E. J. Daw; R. Day; T. Dayanga; R. De Rosa; G. Debreczeni; J. Degallaix; W. Del Pozzo; E. Deleeuw; S. Deléglise; T. Denker; T. Dent; H. Dereli; V. Dergachev; R. DeRosa; R. DeSalvo; S. Dhurandhar; L. Di Fiore; A. Di Lieto; I. Di Palma; A. Di Virgilio; M. Díaz; A. Dietz; K. Dmitry; F. Donovan; K. L. Dooley; S. Doravari; M. Drago; R. W. P. Drever; J. C. Driggers; Z. Du; J. -C. Dumas; S. Dwyer; T. Eberle; M. Edwards; A. Effler; P. Ehrens; J. Eichholz; S. S. Eikenberry; G. Endröczi; R. Essick; T. Etzel; K. Evans; M. Evans; T. Evans; M. Factourovich; V. Fafone; S. Fairhurst; Q. Fang; B. Farr; W. Farr; M. Favata; D. Fazi; H. Fehrmann; D. Feldbaum; I. Ferrante; F. Ferrini; F. Fidecaro; L. S. Finn; I. Fiori; R. Fisher; R. Flaminio; E. Foley; S. Foley; E. Forsi; L. A. Forte; N. Fotopoulos; J. -D. Fournier; S. Franco; S. Frasca; F. Frasconi; M. Frede; M. Frei; Z. Frei; A. Freise; R. Frey; T. T. Fricke; P. Fritschel; V. V. Frolov; M. -K. Fujimoto; P. Fulda; M. Fyffe; J. Gair; L. Gammaitoni; J. Garcia; F. Garufi; N. Gehrels; G. Gemme; E. Genin; A. Gennai; L. Gergely; S. Ghosh; J. A. Giaime; S. Giampanis; K. D. Giardina; A. Giazotto; S. Gil-Casanova; C. Gill; J. Gleason; E. Goetz; R. Goetz; L. Gondan; G. González; N. Gordon; M. L. Gorodetsky; S. Gossan; S. Goßler; R. Gouaty; C. Graef; P. B. Graff; M. Granata; A. Grant; S. Gras; C. Gray; R. J. S. Greenhalgh; A. M. Gretarsson; C. Griffo; H. Grote; K. Grover; S. Grunewald; G. M. Guidi; C. Guido; K. E. Gushwa; E. K. Gustafson; R. Gustafson; B. Hall; E. Hall; D. Hammer; G. Hammond; M. Hanke; J. Hanks; C. Hanna; J. Hanson; J. Harms; G. M. Harry; I. W. Harry; E. D. Harstad; M. T. Hartman; K. Haughian; K. Hayama; J. Heefner; A. Heidmann; M. Heintze; H. Heitmann; P. Hello; G. Hemming; M. Hendry; I. S. Heng; A. W. Heptonstall; M. Heurs; S. Hild; D. Hoak; K. A. Hodge; K. Holt; M. Holtrop; T. Hong; S. Hooper; T. Horrom; D. J. Hosken; J. Hough; E. J. Howell; Y. Hu; Z. Hua; V. Huang; E. A. Huerta; B. Hughey; S. Husa; S. H. Huttner; M. Huynh; T. Huynh-Dinh; J. Iafrate; D. R. Ingram; R. Inta; T. Isogai; A. Ivanov; B. R. Iyer; K. Izumi; M. Jacobson; E. James; H. Jang; Y. J. Jang; P. Jaranowski; F. Jiménez-Forteza; W. W. Johnson; D. Jones; D. I. Jones; R. Jones; R. J. G. Jonker; L. Ju; Haris K; P. Kalmus; V. Kalogera; S. Kandhasamy; G. Kang; J. B. Kanner; M. Kasprzack; R. Kasturi; E. Katsavounidis; W. Katzman; H. Kaufer; K. Kaufman; K. Kawabe

    2013-09-27

    We present the results of a directed search for continuous gravitational waves from unknown, isolated neutron stars in the Galactic Center region, performed on two years of data from LIGO's fifth science run from two LIGO detectors. The search uses a semi-coherent approach, analyzing coherently 630 segments, each spanning 11.5 hours, and then incoherently combining the results of the single segments. It covers gravitational wave frequencies in a range from 78 to 496 Hz and a frequency-dependent range of first order spindown values down to -7.86 x 10^-8 Hz/s at the highest frequency. No gravitational waves were detected. We place 90% confidence upper limits on the gravitational wave amplitude of sources at the Galactic Center. Placing 90% confidence upper limits on the gravitational wave amplitude of sources at the Galactic Center, we reach ~3.35x10^-25 for frequencies near 150 Hz. These upper limits are the most constraining to date for a large-parameter-space search for continuous gravitational wave signals.

  4. A directed search for gravitational waves from Scorpius X-1 with initial LIGO

    E-print Network

    The LIGO Scientific Collaboration; the Virgo Collaboration; J. Aasi; B. P. Abbott; R. Abbott; T. Abbott; M. R. Abernathy; F. Acernese; K. Ackley; C. Adams; T. Adams; T. Adams; P. Addesso; R. X. Adhikari; V. Adya; C. Affeldt; M. Agathos; K. Agatsuma; N. Aggarwal; O. D. Aguiar; A. Ain; P. Ajith; A. Alemic; B. Allen; A. Allocca; D. Amariutei; S. B. Anderson; W. G. Anderson; K. Arai; M. C. Araya; C. Arceneaux; J. S. Areeda; G. Ashton; S. Ast; S. M. Aston; P. Astone; P. Aufmuth; C. Aulbert; B. E. Aylott; S. Babak; P. T. Baker; F. Baldaccini; G. Ballardin; S. W. Ballmer; J. C. Barayoga; M. Barbet; S. Barclay; B. C. Barish; D. Barker; F. Barone; B. Barr; L. Barsotti; M. Barsuglia; J. Bartlett; M. A. Barton; I. Bartos; R. Bassiri; A. Basti; J. C. Batch; Th. S. Bauer; C. Baune; V. Bavigadda; B. Behnke; M. Bejger; C. Belczynski; A. S. Bell; C. Bell; M. Benacquista; J. Bergman; G. Bergmann; C. P. L. Berry; D. Bersanetti; A. Bertolini; J. Betzwieser; S. Bhagwat; R. Bhandare; I. A. Bilenko; G. Billingsley; J. Birch; S. Biscans; M. Bitossi; C. Biwer; M. A. Bizouard; J. K. Blackburn; L. Blackburn; C. D. Blair; D. Blair; S. Bloemen; O. Bock; T. P. Bodiya; M. Boer; G. Bogaert; P. Bojtos; C. Bond; F. Bondu; L. Bonelli; R. Bonnand; R. Bork; M. Born; V. Boschi; Sukanta Bose; C. Bradaschia; P. R. Brady; V. B. Braginsky; M. Branchesi; J. E. Brau; T. Briant; D. O. Bridges; A. Brillet; M. Brinkmann; V. Brisson; A. F. Brooks; D. A. Brown; D. D. Brown; N. M. Brown; S. Buchman; A. Buikema; T. Bulik; H. J. Bulten; A. Buonanno; D. Buskulic; C. Buy; L. Cadonati; G. Cagnoli; J. Calderón Bustillo; E. Calloni; J. B. Camp; K. C. Cannon; J. Cao; C. D. Capano; F. Carbognani; S. Caride; S. Caudill; M. Cavaglià; F. Cavalier; R. Cavalieri; G. Cella; C. Cepeda; E. Cesarini; R. Chakraborty; T. Chalermsongsak; S. J. Chamberlin; S. Chao; P. Charlton; E. Chassande-Mottin; Y. Chen; A. Chincarini; A. Chiummo; H. S. Cho; M. Cho; J. H. Chow; N. Christensen; Q. Chu; S. Chua; S. Chung; G. Ciani; F. Clara; J. A. Clark; F. Cleva; E. Coccia; P. -F. Cohadon; A. Colla; C. Collette; M. Colombini; L. Cominsky; M. Constancio, Jr.; A. Conte; D. Cook; T. R. Corbitt; N. Cornish; A. Corsi; C. A. Costa; M. W. Coughlin; J. -P. Coulon; S. Countryman; P. Couvares; D. M. Coward; M. J. Cowart; D. C. Coyne; R. Coyne; K. Craig; J. D. E. Creighton; T. D. Creighton; J. Cripe; S. G. Crowder; A. Cumming; L. Cunningham; E. Cuoco; C. Cutler; K. Dahl; T. Dal Canton; M. Damjanic; S. L. Danilishin; S. D'Antonio; K. Danzmann; L. Dartez; V. Dattilo; I. Dave; H. Daveloza; M. Davier; G. S. Davies; E. J. Daw; R. Day; D. DeBra; G. Debreczeni; J. Degallaix; M. De Laurentis; S. Deléglise; W. Del Pozzo; T. Denker; T. Dent; H. Dereli; V. Dergachev; R. De Rosa; R. T. DeRosa; R. DeSalvo; S. Dhurandhar; M. Díaz; L. Di Fiore; A. Di Lieto; I. Di Palma; A. Di Virgilio; G. Dojcinoski; V. Dolique; E. Dominguez; F. Donovan; K. L. Dooley; S. Doravari; R. Douglas; T. P. Downes; M. Drago; J. C. Driggers; Z. Du; M. Ducrot; S. Dwyer; T. Eberle; T. Edo; M. Edwards; M. Edwards; A. Effler; H. -B. Eggenstein; P. Ehrens; J. Eichholz; S. S. Eikenberry; R. Essick; T. Etzel; M. Evans; T. Evans; M. Factourovich; V. Fafone; S. Fairhurst; X. Fan; Q. Fang; S. Farinon; B. Farr; W. M. Farr; M. Favata; M. Fays; H. Fehrmann; M. M. Fejer; D. Feldbaum; I. Ferrante; E. C. Ferreira; F. Ferrini; F. Fidecaro; I. Fiori; R. P. Fisher; R. Flaminio; J. -D. Fournier; S. Franco; S. Frasca; F. Frasconi; Z. Frei; A. Freise; R. Frey; T. T. Fricke; P. Fritschel; V. V. Frolov; S. Fuentes-Tapia; P. Fulda; M. Fyffe; J. R. Gair; L. Gammaitoni; S. Gaonkar; F. Garufi; A. Gatto; N. Gehrels; G. Gemme; B. Gendre; E. Genin; A. Gennai; L. Á. Gergely; S. Ghosh; J. A. Giaime; K. D. Giardina; A. Giazotto; J. Gleason; E. Goetz; R. Goetz; L. Gondan; G. González; N. Gordon; M. L. Gorodetsky; S. Gossan; S. Goßler; R. Gouaty; C. Gräf; P. B. Graff; M. Granata; A. Grant; S. Gras; C. Gray; R. J. S. Greenhalgh; A. M. Gretarsson; P. Groot; H. Grote; S. Grunewald; G. M. Guidi; C. J. Guido; X. Guo; K. Gushwa; E. K. Gustafson; R. Gustafson; J. Hacker; E. D. Hall; G. Hammond; M. Hanke; J. Hanks; C. Hanna; M. D. Hannam; J. Hanson; T. Hardwick; J. Harms; G. M. Harry; I. W. Harry; M. Hart; M. T. Hartman; C. -J. Haster; K. Haughian; S. Hee; A. Heidmann; M. Heintze; G. Heinzel; H. Heitmann; P. Hello; G. Hemming; M. Hendry; I. S. Heng; A. W. Heptonstall; M. Heurs; M. Hewitson; S. Hild; D. Hoak; K. A. Hodge; D. Hofman; S. E. Hollitt; K. Holt; P. Hopkins; D. J. Hosken; J. Hough; E. Houston; E. J. Howell; Y. M. Hu; E. Huerta; B. Hughey; S. Husa; S. H. Huttner; M. Huynh; T. Huynh-Dinh; A. Idrisy; N. Indik; D. R. Ingram; R. Inta; G. Islas; J. C. Isler; T. Isogai; B. R. Iyer; K. Izumi; M. Jacobson; H. Jang; P. Jaranowski; S. Jawahar; Y. Ji; F. Jiménez-Forteza; W. W. Johnson; D. I. Jones; R. Jones; R. J. G. Jonker; L. Ju; Haris K; V. Kalogera

    2014-12-01

    We present results of a search for continuously-emitted gravitational radiation, directed at the brightest low-mass X-ray binary, Scorpius X-1. Our semi-coherent analysis covers 10 days of LIGO S5 data ranging from 50-550 Hz, and performs an incoherent sum of coherent $\\mathcal{F}$-statistic power distributed amongst frequency-modulated orbital sidebands. All candidates not removed at the veto stage were found to be consistent with noise at a 1% false alarm rate. We present Bayesian 95% confidence upper limits on gravitational-wave strain amplitude using two different prior distributions: a standard one, with no a priori assumptions about the orientation of Scorpius X-1; and an angle-restricted one, using a prior derived from electromagnetic observations. Median strain upper limits of 1.3e-24 and 8e-25 are reported at 150 Hz for the standard and angle-restricted searches respectively. This proof of principle analysis was limited to a short observation time by unknown effects of accretion on the intrinsic spin frequency of the neutron star, but improves upon previous upper limits by factors of ~1.4 for the standard, and 2.3 for the angle-restricted search at the sensitive region of the detector.

  5. Directed search for gravitational waves from Scorpius X-1 with initial LIGO data

    NASA Astrophysics Data System (ADS)

    Aasi, J.; Abbott, B. P.; Abbott, R.; Abbott, T.; Abernathy, M. R.; Acernese, F.; Ackley, K.; Adams, C.; Adams, T.; Addesso, P.; Adhikari, R. X.; Adya, V.; Affeldt, C.; Agathos, M.; Agatsuma, K.; Aggarwal, N.; Aguiar, O. D.; Ain, A.; Ajith, P.; Alemic, A.; Allen, B.; Allocca, A.; Amariutei, D.; Anderson, S. B.; Anderson, W. G.; Arai, K.; Araya, M. C.; Arceneaux, C.; Areeda, J. S.; Arnaud, N.; Ashton, G.; Ast, S.; Aston, S. M.; Astone, P.; Aufmuth, P.; Aulbert, C.; Aylott, B. E.; Babak, S.; Baker, P. T.; Baldaccini, F.; Ballardin, G.; Ballmer, S. W.; Barayoga, J. C.; Barbet, M.; Barclay, S.; Barish, B. C.; Barker, D.; Barone, F.; Barr, B.; Barsotti, L.; Barsuglia, M.; Bartlett, J.; Barton, M. A.; Bartos, I.; Bassiri, R.; Basti, A.; Batch, J. C.; Bauer, Th. S.; Baune, C.; Bavigadda, V.; Behnke, B.; Bejger, M.; Belczynski, C.; Bell, A. S.; Bell, C.; Benacquista, M.; Bergman, J.; Bergmann, G.; Berry, C. P. L.; Bersanetti, D.; Bertolini, A.; Betzwieser, J.; Bhagwat, S.; Bhandare, R.; Bilenko, I. A.; Billingsley, G.; Birch, J.; Biscans, S.; Bitossi, M.; Biwer, C.; Bizouard, M. A.; Blackburn, J. K.; Blackburn, L.; Blair, C. D.; Blair, D.; Bloemen, S.; Bock, O.; Bodiya, T. P.; Boer, M.; Bogaert, G.; Bojtos, P.; Bond, C.; Bondu, F.; Bonelli, L.; Bonnand, R.; Bork, R.; Born, M.; Boschi, V.; Bose, Sukanta; Bradaschia, C.; Brady, P. R.; Braginsky, V. B.; Branchesi, M.; Brau, J. E.; Briant, T.; Bridges, D. O.; Brillet, A.; Brinkmann, M.; Brisson, V.; Brooks, A. F.; Brown, D. A.; Brown, D. D.; Brown, N. M.; Buchman, S.; Buikema, A.; Bulik, T.; Bulten, H. J.; Buonanno, A.; Buskulic, D.; Buy, C.; Cadonati, L.; Cagnoli, G.; Calderón Bustillo, J.; Calloni, E.; Camp, J. B.; Cannon, K. C.; Cao, J.; Capano, C. D.; Capocasa, E.; Carbognani, F.; Caride, S.; Diaz, J. Casanueva; Caudill, S.; Cavaglià, M.; Cavalier, F.; Cavalieri, R.; Cella, G.; Cepeda, C.; Cesarini, E.; Chakraborty, R.; Chalermsongsak, T.; Chamberlin, S. J.; Chao, S.; Charlton, P.; Chassande-Mottin, E.; Chen, Y.; Chincarini, A.; Chiummo, A.; Cho, H. S.; Cho, M.; Chow, J. H.; Christensen, N.; Chu, Q.; Chua, S.; Chung, S.; Ciani, G.; Clara, F.; Clark, J. A.; Cleva, F.; Coccia, E.; Cohadon, P.-F.; Colla, A.; Collette, C.; Colombini, M.; Cominsky, L.; Constancio, M.; Conte, A.; Cook, D.; Corbitt, T. R.; Cornish, N.; Corsi, A.; Costa, C. A.; Coughlin, M. W.; Coulon, J.-P.; Countryman, S.; Couvares, P.; Coward, D. M.; Cowart, M. J.; Coyne, D. C.; Coyne, R.; Craig, K.; Creighton, J. D. E.; Creighton, T. D.; Cripe, J.; Crowder, S. G.; Cumming, A.; Cunningham, L.; Cuoco, E.; Cutler, C.; Dahl, K.; Canton, T. Dal; Damjanic, M.; Danilishin, S. L.; D'Antonio, S.; Danzmann, K.; Dartez, L.; Dattilo, V.; Dave, I.; Daveloza, H.; Davier, M.; Davies, G. S.; Daw, E. J.; Day, R.; DeBra, D.; Debreczeni, G.; Degallaix, J.; De Laurentis, M.; Deléglise, S.; Del Pozzo, W.; Denker, T.; Dent, T.; Dereli, H.; Dergachev, V.; De Rosa, R.; DeRosa, R. T.; DeSalvo, R.; Dhurandhar, S.; Díaz, M.; Di Fiore, L.; Di Lieto, A.; Di Palma, I.; Di Virgilio, A.; Dojcinoski, G.; Dolique, V.; Dominguez, E.; Donovan, F.; Dooley, K. L.; Doravari, S.; Douglas, R.; Downes, T. P.; Drago, M.; Driggers, J. C.; Du, Z.; Ducrot, M.; Dwyer, S.; Eberle, T.; Edo, T.; Edwards, M.; Edwards, M.; Effler, A.; Eggenstein, H.-B.; Ehrens, P.; Eichholz, J.; Eikenberry, S. S.; Essick, R.; Etzel, T.; Evans, M.; Evans, T.; Factourovich, M.; Fafone, V.; Fairhurst, S.; Fan, X.; Fang, Q.; Farinon, S.; Farr, B.; Farr, W. M.; Favata, M.; Fays, M.; Fehrmann, H.; Fejer, M. M.; Feldbaum, D.; Ferrante, I.; Ferreira, E. C.; Ferrini, F.; Fidecaro, F.; Fiori, I.; Fisher, R. P.; Flaminio, R.; Fournier, J.-D.; Franco, S.; Frasca, S.; Frasconi, F.; Frei, Z.; Freise, A.; Frey, R.; Fricke, T. T.; Fritschel, P.; Frolov, V. V.; Fuentes-Tapia, S.; Fulda, P.; Fyffe, M.; Gair, J. R.; Gammaitoni, L.; Gaonkar, S.; Garufi, F.; Gatto, A.; Gehrels, N.; Gemme, G.; Gendre, B.; Genin, E.; Gennai, A.; Gergely, L. Á.; Germain, V.; Ghosh, S.; Giaime, J. A.; Giardina, K. D.; Giazotto, A.; Gleason, J.; Goetz, E.; Goetz, R.; Gondan, L.; González, G.; Gordon, N.; Gorodetsky, M. L.; Gossan, S.; Goßler, S.; Gouaty, R.; Gräf, C.; Graff, P. B.; Granata, M.; Grant, A.; Gras, S.; Gray, C.; Greenhalgh, R. J. S.; Gretarsson, A. M.; Groot, P.; Grote, H.; Grunewald, S.; Guidi, G. M.; Guido, C. J.; Guo, X.; Gushwa, K.; Gustafson, E. K.; Gustafson, R.; Hacker, J.; Hall, E. D.; Hammond, G.; Hanke, M.; Hanks, J.; Hanna, C.; Hannam, M. D.; Hanson, J.; Hardwick, T.; Harms, J.; Harry, G. M.; Harry, I. W.; Hart, M.; Hartman, M. T.; Haster, C.-J.; Haughian, K.; Heidmann, A.; Heintze, M.; Heinzel, G.; Heitmann, H.; Hello, P.; Hemming, G.; Hendry, M.; Heng, I. S.; Heptonstall, A. W.; Heurs, M.; Hewitson, M.; Hild, S.; Hoak, D.; Hodge, K. A.; Hofman, D.; Hollitt, S. E.; Holt, K.; Hopkins, P.

    2015-03-01

    We present results of a search for continuously emitted gravitational radiation, directed at the brightest low-mass x-ray binary, Scorpius X-1. Our semicoherent analysis covers 10 days of LIGO S5 data ranging from 50-550 Hz, and performs an incoherent sum of coherent F -statistic power distributed amongst frequency-modulated orbital sidebands. All candidates not removed at the veto stage were found to be consistent with noise at a 1% false alarm rate. We present Bayesian 95% confidence upper limits on gravitational-wave strain amplitude using two different prior distributions: a standard one, with no a priori assumptions about the orientation of Scorpius X-1; and an angle-restricted one, using a prior derived from electromagnetic observations. Median strain upper limits of 1.3 ×10-24 and 8 ×10-25 are reported at 150 Hz for the standard and angle-restricted searches respectively. This proof-of-principle analysis was limited to a short observation time by unknown effects of accretion on the intrinsic spin frequency of the neutron star, but improves upon previous upper limits by factors of ˜1.4 for the standard, and 2.3 for the angle-restricted search at the sensitive region of the detector.

  6. Speculative parallelism in Intel Cilk Plus

    E-print Network

    Perez, Ruben (Ruben M.)

    2012-01-01

    Certain algorithms can be effectively parallelized at the cost of performing some redundant work. One example is searching an unordered tree graph for a particular node. Each subtree can be searched in parallel by a separate ...

  7. Parallelizing Sequential Programs With Statistical Accuracy Tests

    E-print Network

    Misailovic, Sasa

    2010-08-05

    We present QuickStep, a novel system for parallelizing sequential programs. QuickStep deploys a set of parallelization transformations that together induce a search space of candidate parallel programs. Given a sequential ...

  8. Template-directed atomically precise self-organization of perfectly ordered parallel cerium silicide nanowire arrays on Si(110)-16?×?2 surfaces

    PubMed Central

    2013-01-01

    The perfectly ordered parallel arrays of periodic Ce silicide nanowires can self-organize with atomic precision on single-domain Si(110)-16?×?2 surfaces. The growth evolution of self-ordered parallel Ce silicide nanowire arrays is investigated over a broad range of Ce coverages on single-domain Si(110)-16?×?2 surfaces by scanning tunneling microscopy (STM). Three different types of well-ordered parallel arrays, consisting of uniformly spaced and atomically identical Ce silicide nanowires, are self-organized through the heteroepitaxial growth of Ce silicides on a long-range grating-like 16?×?2 reconstruction at the deposition of various Ce coverages. Each atomically precise Ce silicide nanowire consists of a bundle of chains and rows with different atomic structures. The atomic-resolution dual-polarity STM images reveal that the interchain coupling leads to the formation of the registry-aligned chain bundles within individual Ce silicide nanowire. The nanowire width and the interchain coupling can be adjusted systematically by varying the Ce coverage on a Si(110) surface. This natural template-directed self-organization of perfectly regular parallel nanowire arrays allows for the precise control of the feature size and positions within ±0.2 nm over a large area. Thus, it is a promising route to produce parallel nanowire arrays in a straightforward, low-cost, high-throughput process. PMID:24188092

  9. Lorentz transformation directly from the invariance of the speed of light via the addition law of parallel speeds

    E-print Network

    Bernhard Rothenstein

    2007-09-14

    We show that starting with the addition law of parallel speeds derived as a consequence of the invariance of the speed of light, the Lorentz transformations for the space-time coordinates can be derived.

  10. A class of trust-region methods for parallel optimization

    SciTech Connect

    P. D. Hough; J. C. Meza

    1999-03-01

    The authors present a new class of optimization methods that incorporates a Parallel Direct Search (PDS) method within a trust-region Newton framework. This approach combines the inherent parallelism of PDS with the rapid and robust convergence properties of Newton methods. Numerical tests have yielded favorable results for both standard test problems and engineering applications. In addition, the new method appears to be more robust in the presence of noisy functions that are inherent in many engineering simulations.

  11. Are direct search experiments sensitive to all spin-independent weakly interacting massive particles?

    PubMed

    Giuliani, F

    2005-09-01

    The common analysis of direct searches for spin-independent weakly interacting massive particles (WIMPs) assumes that a spin-independent WIMP couples with the same strength with both nucleons, i.e., that the spin-independent interaction is also fully isospin independent. Though in a fully isospin-dependent interaction scenario the spin-independent WIMP-nucleus cross section is strongly quenched, the leading experiments are still sensitive enough to set limits 1-2 orders of magnitude less stringent than those traditionally presented. In the isospin-dependent scenario the difference between the limits of CDMS-II and ZEPLIN-I is significantly reduced. Here, a model-independent framework is discussed and applied to obtain the current general model-independent limits. PMID:16196915

  12. Challenges and Benefits of Direct Policy Search in Advancing Multiobjective Reservoir Management

    NASA Astrophysics Data System (ADS)

    Castelletti, Andrea; Giuliani, Matteo; Zatarain-Salazar, Jazmin; Hermann, John; Pianosi, Francesca; Reed, Patrick

    2015-04-01

    Optimal management policies for water reservoir operation are generally designed via stochastic dynamic programming (SDP). Yet, the adoption of SDP in complex real-world problems is challenged by the three curses of dimensionality, of modeling, and of multiple objectives. These three curses considerably limit SDP's practical application. Alternatively, in this study, we focus on the use of evolutionary multi-objective direct policy search (EMODPS), a simulation-based optimization approach that combines direct policy search, nonlinear approximating networks and multi-objective evolutionary algorithms to design Pareto approximate operating policies for multi-purpose water reservoirs. Our analysis explores the technical and practical implications of using EMODPS through a careful diagnostic assessment of the EMODPS Pareto approximate solutions attained and the overall reliability of the policy design process. A key choice in the EMODPS approach is the selection of alternative formulations of the operating policies. In this study, we distinguish the relative performance of two widely used nonlinear approximating networks, namely Artificial Neural Networks and Radial Basis Functions, and we further compare them with SDP. Besides, we comparatively assess state-of-the-art multi-objective evolutionary algorithms (MOEAs) in terms of efficiency, effectiveness, reliability, and controllability. Our diagnostic results show that RBFs solutions are more effective that ANNs in designing Pareto approximate policies for several water reservoir systems. They also highlight that EMODPS is very challenging for modern MOEAs and that epsilon dominance is critical for attaining high levels of performance. Epsilon dominance algorithms epsilon-MOEA, epsilon-NSGAII and the auto adaptive Borg MOEA, are statistically superior for the class of problems considered.

  13. Directed searches for continuous gravitational waves from spinning neutron stars in binary systems

    NASA Astrophysics Data System (ADS)

    Meadors, Grant David

    2014-09-01

    Gravitational wave detectors such as the Laser Interferometer Gravitational-wave Observatory (LIGO) seek to observe ripples in space predicted by General Relativity. Black holes, neutron stars, supernovae, the Big Bang and other sources can radiate gravitational waves. Original contributions to the LIGO effort are presented in this thesis: feedforward filtering, directed binary neutron star searches for continuous waves, and scientific outreach and education, as well as advances in quantum optical squeezing. Feedforward filtering removes extraneous noise from servo-controlled instruments. Filtering of the last science run, S6, improves LIGO's astrophysical range (+4.14% H1, +3.60% L1: +12% volume) after subtracting noise from auxiliary length control channels. This thesis shows how filtering enhances the scientific sensitivity of LIGO's data set during and after S6. Techniques for non-stationarity and verifying calibration and integrity may apply to Advanced LIGO. Squeezing is planned for future interferometers to exceed the standard quantum limit on noise from electromagnetic vacuum fluctuations; this thesis discusses the integration of a prototype squeezer at LIGO Hanford Observatory and impact on astrophysical sensitivity. Continuous gravitational waves may be emitted by neutron stars in low-mass X-ray binary systems such as Scorpius X-1. The TwoSpect directed binary search is designed to detect these waves. TwoSpect is the most sensitive of 4 methods in simulated data, projecting an upper limit of 4.23e-25 in strain, given a year-long data set at an Advanced LIGO design sensitivity of 4e-24 Hz. (-1/2). TwoSpect is also used on real S6 data to set 95% confidence upper limits (40 Hz to 2040 Hz) on strain from Scorpius X-1. A millisecond pulsar, X-ray transient J1751-305, is similarly considered. Search enhancements for Advanced LIGO are proposed. Advanced LIGO and fellow interferometers should detect gravitational waves in the coming decade. Methods in these thesis will benefit both the instrumental and analytical sides of observation.

  14. Stable computation of search directions for near-degenerate linear programming problems

    SciTech Connect

    Hough, P.D.

    1997-03-01

    In this paper, we examine stability issues that arise when computing search directions ({delta}x, {delta}y, {delta} s) for a primal-dual path-following interior point method for linear programming. The dual step {delta}y can be obtained by solving a weighted least-squares problem for which the weight matrix becomes extremely il conditioned near the boundary of the feasible region. Hough and Vavisis proposed using a type of complete orthogonal decomposition (the COD algorithm) to solve such a problem and presented stability results. The work presented here addresses the stable computation of the primal step {delta}x and the change in the dual slacks {delta}s. These directions can be obtained in a straight-forward manner, but near-degeneracy in the linear programming instance introduces ill-conditioning which can cause numerical problems in this approach. Therefore, we propose a new method of computing {delta}x and {delta}s. More specifically, this paper describes and orthogonal projection algorithm that extends the COD method. Unlike other algorithms, this method is stable for interior point methods without assuming nondegeneracy in the linear programming instance. Thus, it is more general than other algorithms on near-degenerate problems.

  15. Content-adaptive thresholding early termination scheme on directional gradient descent searches for fast block motion estimation

    NASA Astrophysics Data System (ADS)

    Chen, Hung-Ming; Chen, Po-Hung; Lin, Cheng-Tso; Liu, Ching-Chung

    2012-11-01

    An efficient algorithm named modified directional gradient descent searches to enhance the directional gradient descent search (DGDS) algorithm is presented to reduce computations. A modified search pattern with an adaptive threshold for early termination is applied to DGDS to avoid meaningless calculation after the searching point is good enough. A statistical analysis of best motion vector distribution is analyzed to decide the modified search pattern. Then a statistical model based on the characteristics of the block distortion information of the previous coded frame helps the early termination parameters selection, and a trade-off between the video quality and the computational complexity can be obtained. The simulation results show the proposed algorithm provides significant improvement in reducing the motion estimation (ME) by 17.81% of the average search points and 20% of ME time saving compared to the fast DGDS algorithm implemented in H.264/AVC JM 18.2 reference software according to different types of sequences, while maintaining a similar bit rate without losing picture quality.

  16. J. Parallel Distrib. Comput. 73 (2013) 371382 Contents lists available at SciVerse ScienceDirect

    E-print Network

    Wu, Jie

    2013-01-01

    . Parallel Distrib. Comput. journal homepage: www.elsevier.com/locate/jpdc Building a reliable and high Department of Computer and Information Sciences, Temple University Philadelphia, USA a r t i c l e i n f o distributed system High-performance system design a b s t r a c t Provisioning reliability in a high

  17. J. Parallel Distrib. Comput. 72 (2012) 666677 Contents lists available at SciVerse ScienceDirect

    E-print Network

    Qin, Xiao

    2012-01-01

    -as-a-Service (IaaS) cloud computing, computational resources are provided to remote users in the form of leases in the cloud system can improve the performance. When applying parallel processing in cloud computing Elsevier Inc. All rights reserved. 1. Introduction In cloud computing, a cloud is a cluster of distributed

  18. Science Parametrics for Missions to Search for Earth-like Exoplanets by Direct Imaging

    NASA Astrophysics Data System (ADS)

    Brown, Robert A.

    2015-01-01

    We use Nt , the number of exoplanets observed in time t, as a science metric to study direct-search missions like Terrestrial Planet Finder. In our model, N has 27 parameters, divided into three categories: 2 astronomical, 7 instrumental, and 18 science-operational. For various "27-vectors" of those parameters chosen to explore parameter space, we compute design reference missions to estimate Nt . Our treatment includes the recovery of completeness c after a search observation, for revisits, solar and antisolar avoidance, observational overhead, and follow-on spectroscopy. Our baseline 27-vector has aperture D = 16 m, inner working angle IWA = 0.039'', mission time t = 0-5 yr, occurrence probability for Earth-like exoplanets ? = 0.2, and typical values for the remaining 23 parameters. For the baseline case, a typical five-year design reference mission has an input catalog of ~4700 stars with nonzero completeness, ~1300 unique stars observed in ~2600 observations, of which ~1300 are revisits, and it produces N 1 ~ 50 exoplanets after one year and N 5 ~ 130 after five years. We explore offsets from the baseline for 10 parameters. We find that N depends strongly on IWA and only weakly on D. It also depends only weakly on zodiacal light for Z < 50 zodis, end-to-end efficiency for h > 0.2, and scattered starlight for ? < 10-10. We find that observational overheads, completeness recovery and revisits, solar and antisolar avoidance, and follow-on spectroscopy are all important factors in estimating N.

  19. Dark matter direct search rates in simulations of the Milky Way and Sagittarius stream

    SciTech Connect

    Purcell, Chris W.; Zentner, Andrew R.; Wang, Mei-Yu E-mail: zentner@pitt.edu

    2012-08-01

    We analyze self-consistent N-body simulations of the Milky Way disk and the ongoing disruption of the Sagittarius dwarf satellite to study the effect of Sagittarius tidal debris on dark matter detection experiments. In agreement with significant previous work, we reiterate that the standard halo model is insufficient to describe the non-Maxwellian velocity distribution of the Milky Way halo in our equilibrium halo-only and halo/galaxy models, and offer suggestions for correcting for this discrepancy. More importantly, we emphasize that the dark matter component of the leading tidal arm of the Sagittarius dwarf is significantly more extended than the stellar component of the arm, and also that the dark matter and stellar streams are not necessarily coaxial and may be offset by several kpc at the point at which they impact the Galactic disk. This suggests that the dark matter component of the Sagittarius debris is likely to have a non-negligible influence on dark matter detection experiments even when the stellar debris is centered several kpc from the solar neighborhood. Relative to models without an infalling Sagittarius dwarf, the Sagittarius dark matter debris in our models induces an energy-dependent enhancement of direct search event rates of as much as ? 20–45%, an energy-dependent reduction in the amplitude of the annual modulation of the event rate by as much as a factor of two, a shift in the phase of the annual modulation by as much as ? 20 days, and a shift in the recoil energy at which the modulation reverses phase. These influences of Sagittarius are of general interest in the interpretation of dark matter searches, but may be particularly important in the case of relatively light (m{sub ?}?<20 GeV/c{sup 2}) dark matter because the Sagittarius stream impacts the solar system at high speed compared to the primary halo dark matter.

  20. Results of a direct search using synchrotron radiation for the low-energy $^{229}$Th nuclear isomeric transition

    E-print Network

    Justin Jeet; Christian Schneider; Scott T. Sullivan; Wade G. Rellergert; Saed Mirzadeh; A. Cassanho; H. P. Jenssen; Eugene V. Tkalya; Eric R. Hudson

    2015-02-18

    We report the results of a direct search for the $^{229}$Th ($I^{p} = 3/2^+\\leftarrow 5/2^+$) nuclear isomeric transition, performed by exposing $^{229}$Th-doped LiSrAlF$_6$ crystals to tunable vacuum-ultraviolet synchrotron radiation and observing any resulting fluorescence. We also use existing nuclear physics data to establish a range of possible transition strengths for the isomeric transition. We find no evidence for the thorium nuclear transition between $7.3 {eV}$ and $8.8 {eV}$ with transition lifetime $(1-2){s} \\lesssim \\tau \\lesssim (2000-5600){s}$. This measurement excludes roughly half of the favored transition search area and can be used to direct future searches.

  1. Results of a direct search using synchrotron radiation for the low-energy $^{229}$Th nuclear isomeric transition

    E-print Network

    Jeet, Justin; Sullivan, Scott T; Rellergert, Wade G; Mirzadeh, Saed; Cassanho, A; Jenssen, H P; Tkalya, Eugene V; Hudson, Eric R

    2015-01-01

    We report the results of a direct search for the $^{229}$Th ($I^{p} = 3/2^+\\leftarrow 5/2^+$) nuclear isomeric transition, performed by exposing $^{229}$Th-doped LiSrAlF$_6$ crystals to tunable vacuum-ultraviolet synchrotron radiation and observing any resulting fluorescence. We also use existing nuclear physics data to establish a range of possible transition strengths for the isomeric transition. We find no evidence for the thorium nuclear transition between $7.3 \\mbox{eV}$ and $8.8 \\mbox{eV}$ with transition lifetime $(1-2)\\mbox{s} \\lesssim \\tau \\lesssim (2000-5600)\\mbox{s}$. This measurement excludes roughly half of the favored transition search area and can be used to direct future searches.

  2. Results of a Direct Search Using Synchrotron Radiation for the Low-Energy (229)Th Nuclear Isomeric Transition.

    PubMed

    Jeet, Justin; Schneider, Christian; Sullivan, Scott T; Rellergert, Wade G; Mirzadeh, Saed; Cassanho, A; Jenssen, H P; Tkalya, Eugene V; Hudson, Eric R

    2015-06-26

    We report the results of a direct search for the (229)Th (I(?)=3/2(+)?5/2(+)) nuclear isomeric transition, performed by exposing (229)Th-doped LiSrAlF(6) crystals to tunable vacuum-ultraviolet synchrotron radiation and observing any resulting fluorescence. We also use existing nuclear physics data to establish a range of possible transition strengths for the isomeric transition. We find no evidence for the thorium nuclear transition between 7.3 eV and 8.8 eV with transition lifetime (1-2) s???(2000-5600)??s. This measurement excludes roughly half of the favored transition search area and can be used to direct future searches. PMID:26197124

  3. The first search for sub-eV scalar fields via four-wave mixing at a quasi-parallel laser collider

    NASA Astrophysics Data System (ADS)

    Homma, Kensuke; Hasebe, Takashi; Kume, Kazuki

    2014-08-01

    A search for sub-eV scalar fields coupling to two photons has been performed via four-wave mixing at a quasi-parallel laser collider for the first time. The experiment demonstrates the novel approach of searching for resonantly produced sub-eV scalar fields by combining two-color laser fields in the vacuum. The aim of this paper is to provide the concrete experimental setup and the analysis method based on specific combinations of polarization states between incoming and outgoing photons, which is extendable to higher-intensity laser systems operated at high repetition rates. No significant signal of four-wave mixing was observed by combining a 0.2 ? J/0.75 ns pulse laser and a 2 mW CW laser on the same optical axis. Based on the prescription developed for this particular experimental approach, we obtained the upper limit at a confidence level of 95% on the coupling-mass relation.

  4. Using the Self-Directed Search in Research: Selecting a Representative Pool of Items to Measure Vocational Interests

    ERIC Educational Resources Information Center

    Poitras, Sarah-Caroline; Guay, Frederic; Ratelle, Catherine F.

    2012-01-01

    Using Item Response Theory (IRT) and Confirmatory Factor Analysis (CFA), the goal of this study was to select a reduced pool of items from the French Canadian version of the Self-Directed Search--Activities Section (Holland, Fritzsche, & Powell, 1994). Two studies were conducted. Results of Study 1, involving 727 French Canadian students, showed…

  5. Selection Criteria for a Career Development Program for the Mentally Ill: Evaluation of the Self-Directed Search (SDS).

    ERIC Educational Resources Information Center

    Loughead, Teri A.; Black, David R.

    1990-01-01

    Developed criteria for selection of career development program appropriate for mentally ill. Mentally ill persons who participated in Self-Directed Search (SDS) showed significant change on My Vocational Situation Identity Scale. Findings support selection of SDS as program and feasibility of offering career development services to mentally ill.…

  6. A Comparison Study of the Paper-and-Pencil, Personal Computer, and Internet Versions of Holland's Self-Directed Search

    ERIC Educational Resources Information Center

    Lumsden, Jill A.; Sampson, James P., Jr.; Reardon, Robert C.; Lenz, Janet G.; Peterson, Gary W.

    2004-01-01

    The authors examined the extent to which the Realistic, Investigative, Artistic, Social, Enterprising, and Conventional scales and 3-point codes of the Self-Directed Search may be considered statistically and practically equivalent across 3 different modes of administration: paper-and-pencil, personal computer, and Internet. Student preferences…

  7. Interest Profile Elevation, Big Five Personality Traits, and Secondary Constructs on the Self-Directed Search: A Replication and Extension

    ERIC Educational Resources Information Center

    Bullock, Emily E.; Reardon, Robert C.

    2008-01-01

    The study used the Self-Directed Search (SDS) and the NEO-FFI to explore profile elevation, four secondary constructs, and the Big Five personality factors in a sample of college students in a career course. Regression model results showed that openness, conscientiousness, differentiation high-low, differentiation Iachan, and consistency accounted…

  8. Comparing the Chinese Career Key and the Self-Directed Search with High School Girls in Hong Kong

    ERIC Educational Resources Information Center

    Ting, Siu-Man Raymond

    2007-01-01

    A career interest inventory, the Chinese Career Key (CCK) adapted from the Career Key based on Holland's theory of vocational choice, was studied. The purpose of the study was to further examine the psychometric qualities and user satisfaction of the CCK by comparing it to the Self-Directed Search. Students at a girls' public high school (N = 130)…

  9. $H \\to \\gamma\\gamma$ search and direct photon pair production differential cross section

    SciTech Connect

    Bu, Xuebing

    2010-06-01

    At a hadron collider, diphoton ({gamma}{gamma}) production allows detailed studies of the Standard Model (SM), as well as as searches for new phenomena, such as new heavy resonances, extra spatial dimensions or cascade decays of heavy new particles. Within the SM, continuum {gamma}{gamma}+X production is characterized by a steeply-falling {gamma}{gamma} mass spectrum, on top of which a heavy resonance decaying into {gamma}{gamma} can potentially be observed. In particular, this is considered one of the most promising discovery channels for a SM Higgs boson at the LHC, despite the small branching ratio of BR (H {yields} {gamma}{gamma}) {approx} 0.2% for 110 < M{sub Higgs} < 140 GeV. At the Tevatron, the dominant SM Higgs boson production mechanism is gluon fusion, followed by associated production with a W or Z boson, and vector boson fusion. While the SM Higgs production rate at the Tevatron is not sufficient to observe it in the {gamma}{gamma} mode, the Hgg and H{gamma}{gamma} couplings, being loop-mediated, are particularly sensitive to new physics effects. Furthermore, in some models beyond the SM, for instance, fermiophobic Higgs, with no couplings to fermions, the BR (H {yields} {gamma}{gamma}) can be enhanced significantly relative to the SM prediction, while has the SM-like production cross sections except the gluon fusion is absent. In this thesis, we present a search for a light Higgs boson in the diphoton final state using 4.2 {+-} 0.3 fb{sup -1} of the D0 Run II data, collected at the Fermilab Tevatron collider from April 2002 to December 2008. Good agreement between the data and the SM background prediction is observed. Since there is no evidence for new physics, we set 95% C.L. limits on the production cross section times the branching ratio ({sigma} x BR(H {yields} {gamma}{gamma})) relative to the SM-like Higgs prediction for different assumed Higgs masses. The observed limits ({sigma}(limit)/{sigma}(SM)) range from 11.9 to 35.2 for Higgs masses from 100 to 150 GeV, while the expected limits range from 17.5 to 32.0. This search is also interpreted in the context of the particular fermiophobic Higgs model. The corresponding results have reached the same sensitivity as a single LEP experiement, setting a lower limit on the fermiophobic Higgs of M{sub h{sub f}} > 102.5 GeV (M{sub h{sub f}} > 107.5 GeV expected). We are slightly below the combined LEP limit (M{sub h{sub f}} > 109.7 GeV). We also provide access to the M{sub h{sub f}} > 125 GeV region which was inaccessible at LEP. During the study, we found the major and irreducible background direct {gamma}{gamma} (DPP) production is not well modelled by the current theoretical predictions: RESBOS, DIPHOX or PYTHIA. There is {approx}20% theoretical uncertainty for the predicted values. Thus, for our Higgs search, we use the side-band fitting method to estimate DPP contribution directly from the data events. Furthermore, DPP production is also a significant background in searches for new phenomena, such as new heavy resonances, extra spatial dimensions, or cascade decays of heavy new particles. Thus, precise measurements of the DPP cross sections for various kinematic variables and their theoretical understanding are extremely important for future Higgs and new phenomena searches. In this thesis, we also present a precise measurement of the DPP single differential cross sections as a function of the diphoton mass, the transverse momentum of the diphoton system, the azimuthal angle between the photons, and the polar scattering angle of the photons, as well as the double differential cross sections considering the last three kinematic variables in three diphoton mass bins, using 4.2 fb{sup -1} data. These results are the first of their kind at D0 Run II, and in fact the double differential measurements are the first of their kind at Tevatron. The results are compared with different perturbative QCD predictions and event generators.

  10. Direct dark matter searches—Test of the Big Bounce Cosmology

    SciTech Connect

    Cheung, Yeuk-Kwan E.; Vergados, J.D. E-mail: vergados@uoi.gr

    2015-02-01

    We consider the possibility of using dark matter particle's mass and its interaction cross section as a smoking gun signal of the existence of a Big Bounce at the early stage in the evolution of our currently observed universe. A study of dark matter production in the pre-bounce contraction and the post bounce expansion epochs of this universe reveals a new venue for achieving the observed relic abundance of our present universe. Specifically, it predicts a characteristic relation governing a dark matter mass and interaction cross section and a factor of 1/2 in thermally averaged cross section, as compared to the non-thermal production in standard cosmology, is needed for creating enough dark matter particle to satisfy the currently observed relic abundance because dark matter is being created during the pre-bounce contraction, in addition to the post-bounce expansion. As the production rate is lower than the Hubble expansion rate information of the bounce universe evolution is preserved. Therefore once the value of dark matter mass and interaction cross section are obtained by direct detection in laboratories, this alternative route becomes a signature prediction of the bounce universe scenario. This leads us to consider a scalar dark matter candidate, which if it is light, has important implications on dark matter searches.

  11. Dark matter production from Goldstone boson interactions and implications for direct searches and dark radiation

    SciTech Connect

    Garcia-Cely, Camilo; Ibarra, Alejandro; Molinaro, Emiliano E-mail: alejandro.ibarra@ph.tum.de

    2013-11-01

    The stability of the dark matter particle could be attributed to the remnant Z{sub 2} symmetry that arises from the spontaneous breaking of a global U(1) symmetry. This plausible scenario contains a Goldstone boson which, as recently shown by Weinberg, is a strong candidate for dark radiation. We show in this paper that this Goldstone boson, together with the CP-even scalar associated to the spontaneous breaking of the global U(1) symmetry, plays a central role in the dark matter production. Besides, the mixing of the CP-even scalar with the Standard Model Higgs boson leads to novel Higgs decay channels and to interactions with nucleons, thus opening the possibility of probing this scenario at the LHC and in direct dark matter search experiments. We carefully analyze the latter possibility and we show that there are good prospects to observe a signal at the future experiments LUX and XENON1T provided the dark matter particle was produced thermally and has a mass larger than ? 25 GeV.

  12. Dark matter production from Goldstone boson interactions and implications for direct searches and dark radiation

    E-print Network

    Camilo Garcia-Cely; Alejandro Ibarra; Emiliano Molinaro

    2013-11-07

    The stability of the dark matter particle could be attributed to the remnant $Z_2$ symmetry that arises from the spontaneous breaking of a global U(1) symmetry. This plausible scenario contains a Goldstone boson which, as recently shown by Weinberg, is a strong candidate for dark radiation. We show in this paper that this Goldstone boson, together with the CP-even scalar associated to the spontaneous breaking of the global U(1) symmetry, plays a central role in the dark matter production. Besides, the mixing of the CP-even scalar with the Standard Model Higgs boson leads to novel Higgs decay channels and to interactions with nucleons, thus opening the possibility of probing this scenario at the LHC and in direct dark matter search experiments. We carefully analyze the latter possibility and we show that there are good prospects to observe a signal at the future experiments LUX and XENON1T provided the dark matter particle was produced thermally and has a mass larger than ~25 GeV.

  13. Radiopurity of CaWO4 crystals for direct dark matter search with CRESST and EURECA

    NASA Astrophysics Data System (ADS)

    Münster, A.; Sivers, M. v.; Angloher, G.; Bento, A.; Bucci, C.; Canonica, L.; Erb, A.; Feilitzsch, F. v.; Gorla, P.; Gütlein, A.; Hauff, D.; Jochum, J.; Kraus, H.; Lanfranchi, J.-C.; Laubenstein, M.; Loebell, J.; Ortigoza, Y.; Petricca, F.; Potzel, W.; Pröbst, F.; Puimedon, J.; Reindl, F.; Roth, S.; Rottler, K.; Sailer, C.; Schäffner, K.; Schieck, J.; Scholl, S.; Schönert, S.; Seidel, W.; Stodolsky, L.; Strandhagen, C.; Strauss, R.; Tanzke, A.; Uffinger, M.; Ulrich, A.; Usherov, I.; Wawoczny, S.; Willers, M.; Wüstrich, M.; Zöller, A.

    2014-05-01

    The direct dark matter search experiment CRESST uses scintillating CaWO4 single crystals as targets for possible WIMP scatterings. An intrinsic radioactive contamination of the crystals as low as possible is crucial for the sensitivity of the detectors. In the past CaWO4 crystals operated in CRESST were produced by institutes in Russia and the Ukraine. Since 2011 CaWO4 crystals have also been grown at the crystal laboratory of the Technische Universität München (TUM) to better meet the requirements of CRESST and of the future tonne-scale multi-material experiment EURECA. The radiopurity of the raw materials and of first TUM-grown crystals was measured by ultra-low background ?-spectrometry. Two TUM-grown crystals were also operated as low-temperature detectors at a test setup in the Gran Sasso underground laboratory. These measurements were used to determine the crystals' intrinsic ?-activities which were compared to those of crystals produced at other institutes. The total ?-activities of TUM-grown crystals as low as 1.23±0.06 mBq/kg were found to be significantly smaller than the activities of crystals grown at other institutes typically ranging between ~ 15 mBq/kg and ~ 35 mBq/kg.

  14. A Bayesian view of the current status of dark matter direct searches

    SciTech Connect

    Arina, Chiara; Wong, Yvonne Y.Y.; Hamann, Jan E-mail: hamann@phys.au.dk

    2011-09-01

    Bayesian statistical methods offer a simple and consistent framework for incorporating uncertainties into a multi-parameter inference problem. In this work we apply these methods to a selection of current direct dark matter searches. We consider the simplest scenario of spin-independent elastic WIMP scattering, and infer the WIMP mass and cross-section from the experimental data with the essential systematic uncertainties folded into the analysis. We find that when uncertainties in the scintillation efficiency of XENON100 have been accounted for, the resulting exclusion limit is not sufficiently constraining to rule out the CoGeNT preferred parameter region, contrary to previous claims. In the same vein, we also investigate the impact of astrophysical uncertainties on the preferred WIMP parameters. We find that within the class of smooth and isotropic WIMP velocity distributions, it is difficult to reconcile the DAMA and the CoGeNT preferred regions by tweaking the astrophysics parameters alone. If we demand compatibility between these experiments, then the inference process naturally concludes that a high value for the sodium quenching factor for DAMA is preferred.

  15. Banks of templates for directed searches of gravitational waves from spinning neutron stars

    E-print Network

    Andrzej Pisarski; Piotr Jaranowski; Maciej Pietka

    2010-10-14

    We construct efficient banks of templates suitable for directed searches of almost monochromatic gravitational waves originating from spinning nuetron stars in our Galaxy in data being collected by currently operating interferometric detectors. We thus assume that the position of the gravitational-wave source in the sky is known, but we do not assume that the wave's frequency and its derivatives are a priori known. In the construction we employ simplified model of the signal with constant amplitude and phase which is a polynomial function of time. All our template banks enable usage of the fast Fourier transform algorithm in the computation of the maximum-likelihood F-statistic for nodes of the grids defining the bank. We study and employ the dependence of the grid's construction on the choice of the position of the observational interval with respect to the origin of time axis. We also study the usage of the fast Fourier transform algorithms with non-standard frequency resolutions achieved by zero padding or folding the data. In the case of the gravitational-wave signal with one spindown parameter included we have found grids with covering thicknesses which are only 0.1%--16% larger than the thickness of the optimal two-dimensional hexagonal covering.

  16. R&D Status of Nuclear Emulsion For Directional Dark Matter Search

    E-print Network

    T. Naka; M. Kimura; M. Nakamura; O. Sato; T. Nakano; T. Asada; Y. Tawara; Y. Suzuki

    2011-09-22

    In this study, we are doing R&D for directional dark matter search with nuclear emulsion. First of all, higher resolution nuclear emulsion with fine silver halide crystals was developed in the production facility of emulsion at Nagoya university, and we confirmed that it can detect the expected nuclear recoil tracks. The readout of submicron tracks was required the new technology. We developed the expansion technique, and could readout the signal by shape analysis with optical microscopy. The two dimensional angular resolution is 36 degrees at the original track length of range from 150nm to 200nm with optical microscopy. Finally we demonstrated by using recoiled nuclei induced by 14.8MeV neutron, and confirmed the technique.Moreover, we developed the X-ray microscope system with SPring-8 as final check with higher resolution of selected candidate tracks with optical microscopy. The angular resolution was improved from 31 degrees with optical microscopy to 17degrees with X-ray microscopy at the track length of range from 150nm to 250nm. We are developing the practical system and planning for start of the test running with prototype detector.

  17. Parallel algorithm development

    SciTech Connect

    Adams, T.F.

    1996-06-01

    Rapid changes in parallel computing technology are causing significant changes in the strategies being used for parallel algorithm development. One approach is simply to write computer code in a standard language like FORTRAN 77 or with the expectation that the compiler will produce executable code that will run in parallel. The alternatives are: (1) to build explicit message passing directly into the source code; or (2) to write source code without explicit reference to message passing or parallelism, but use a general communications library to provide efficient parallel execution. Application of these strategies is illustrated with examples of codes currently under development.

  18. A parallel trajectory optimization tool for aerospace plane guidance

    NASA Technical Reports Server (NTRS)

    Psiaki, Mark L.; Park, Kihong

    1991-01-01

    A parallel trajectory optimization algorithm is being developed. One possible mission is to provide real-time, on-line guidance for the National Aerospace Plane. The algorithm solves a discrete-time problem via the augmented Lagrangian nonlinear programming algorithm. The algorithm exploits the dynamic programming structure of the problem to achieve parallelism in calculating cost functions, gradients, constraints, Jacobians, Hessian approximations, search directions, and merit functions. Special additions to the augmented Lagrangian algorithm achieve robust convergence, achieve (almost) superlinear local convergence, and deal with constraint curvature efficiency. The algorithm can handle control and state inequality constraints such as angle-of-attack and dynamic pressure constraints. Portions of the algorithm have been tested. The nonlinear programming core algorithm performs well on a variety of static test problems and on an orbit transfer problem. The parallel search direction algorithm can reduce wall clock time by a factor of 10 for this part of the computation task.

  19. Poiseuille flow and thermal transpiration of a rarefied gas between parallel plates II: effect of nonuniform surface properties in the longitudinal direction

    NASA Astrophysics Data System (ADS)

    Doi, Toshiyuki

    2015-09-01

    Poiseuille flow and thermal transpiration of a rarefied gas between two parallel plates are studied for the situation that one of the walls is a Maxwell-type boundary with a periodic distribution of the accommodation coefficient in the longitudinal direction. The flow behavior is studied numerically based on the Bhatnager-Gross-Krook-Welander model of the Boltzmann equation. The solution is sought in a superposition of a linear and a periodic functions in the longitudinal coordinate. The numerical solution is provided over a wide range of the mean free path and the parameters characterizing the distribution of the accommodation coefficient. Due to the nonuniform surface properties in the longitudinal direction, the flow is nonparallel, and a deviation in the pressure and the temperature of the gas from those of the conventional parallel flow is observed. An energy transfer between the gas and the walls arises. The mass flow rate of the gas is approximated by a formula consisting of the data of one-dimensional flows; however, a non-negligible disagreement is observed in Poiseuille flow when the amplitude of the variation of the accommodation coefficient is sufficiently large. The validity of the present approach is confirmed by a direct numerical analysis of a flow through a long channel.

  20. DIRECT SEARCH OF TIME DELAY IN BEAMFORMING APPLICATIONS Juan R. Aguilar , Miguel Arias, Ph.D. , Renato Salinas, Ph.D. , and Mongi A. Abidi, Ph.D.

    E-print Network

    Abidi, Mongi A.

    1 DIRECT SEARCH OF TIME DELAY IN BEAMFORMING APPLICATIONS Juan R. Aguilar , Miguel Arias, Ph@usach.cl m-arias@usach.cl rsalinas@usach.cl abidi@utk.edu Summary: This paper describes our attempts to use these delayed J. R. Aguilar, M. Arias, R. Salinas, and M. A. Abidi, "Direct search of time delay in beamforming

  1. Search for Direct CP Violation in Decays of Hyperons Y. C. Chen a , R. A. Burnstein b , A. Chakravorty b , A. Chan a ,

    E-print Network

    Fermilab Experiment E871

    Search for Direct CP Violation in Decays of Hyperons Y. C. Chen a , R. A. Burnstein b , A.S.A. The E871 (HyperCP) experiment at FNAL is searching for direct CP violation in decays of \\Xi \\Gamma (\\Xi more data which will improve the sensitivity to Ã? 1 \\Theta 10 \\Gamma4 . 1 Introduction CP violation has

  2. Development and parallelization of a direct numerical simulation to study the formation and transport of nanoparticle clusters in a viscous fluid

    NASA Astrophysics Data System (ADS)

    Sloan, Gregory James

    The direct numerical simulation (DNS) offers the most accurate approach to modeling the behavior of a physical system, but carries an enormous computation cost. There exists a need for an accurate DNS to model the coupled solid-fluid system seen in targeted drug delivery (TDD), nanofluid thermal energy storage (TES), as well as other fields where experiments are necessary, but experiment design may be costly. A parallel DNS can greatly reduce the large computation times required, while providing the same results and functionality of the serial counterpart. A D2Q9 lattice Boltzmann method approach was implemented to solve the fluid phase. The use of domain decomposition with message passing interface (MPI) parallelism resulted in an algorithm that exhibits super-linear scaling in testing, which may be attributed to the caching effect. Decreased performance on a per-node basis for a fixed number of processes confirms this observation. A multiscale approach was implemented to model the behavior of nanoparticles submerged in a viscous fluid, and used to examine the mechanisms that promote or inhibit clustering. Parallelization of this model using a masterworker algorithm with MPI gives less-than-linear speedup for a fixed number of particles and varying number of processes. This is due to the inherent inefficiency of the master-worker approach. Lastly, these separate simulations are combined, and two-way coupling is implemented between the solid and fluid.

  3. A generating set direct search augmented Lagrangian algorithm for optimization with a combination of general and linear constraints.

    SciTech Connect

    Lewis, Robert Michael (College of William and Mary, Williamsburg, VA); Torczon, Virginia Joanne (College of William and Mary, Williamsburg, VA); Kolda, Tamara Gibson

    2006-08-01

    We consider the solution of nonlinear programs in the case where derivatives of the objective function and nonlinear constraints are unavailable. To solve such problems, we propose an adaptation of a method due to Conn, Gould, Sartenaer, and Toint that proceeds by approximately minimizing a succession of linearly constrained augmented Lagrangians. Our modification is to use a derivative-free generating set direct search algorithm to solve the linearly constrained subproblems. The stopping criterion proposed by Conn, Gould, Sartenaer and Toint for the approximate solution of the subproblems requires explicit knowledge of derivatives. Such information is presumed absent in the generating set search method we employ. Instead, we show that stationarity results for linearly constrained generating set search methods provide a derivative-free stopping criterion, based on a step-length control parameter, that is sufficient to preserve the convergence properties of the original augmented Lagrangian algorithm.

  4. Search for patterns by combining cosmic-ray energy and arrival directions at the Pierre Auger Observatory

    NASA Astrophysics Data System (ADS)

    Aab, A.; Abreu, P.; Aglietta, M.; Ahn, E. J.; Samarai, I. Al; Albuquerque, I. F. M.; Allekotte, I.; Allen, J.; Allison, P.; Almela, A.; Castillo, J. Alvarez; Alvarez-Muñiz, J.; Batista, R. Alves; Ambrosio, M.; Aminaei, A.; Anchordoqui, L.; Andringa, S.; Aramo, C.; Aranda, V. M.; Arqueros, F.; Asorey, H.; Assis, P.; Aublin, J.; Ave, M.; Avenier, M.; Avila, G.; Awal, N.; Badescu, A. M.; Barber, K. B.; Bäuml, J.; Baus, C.; Beatty, J. J.; Becker, K. H.; Bellido, J. A.; Berat, C.; Bertaina, M. E.; Bertou, X.; Biermann, P. L.; Billoir, P.; Blaess, S.; Blanco, M.; Bleve, C.; Blümer, H.; Bohá?ová, M.; Boncioli, D.; Bonifazi, C.; Bonino, R.; Borodai, N.; Brack, J.; Brancus, I.; Bridgeman, A.; Brogueira, P.; Brown, W. C.; Buchholz, P.; Bueno, A.; Buitink, S.; Buscemi, M.; Caballero-Mora, K. S.; Caccianiga, B.; Caccianiga, L.; Candusso, M.; Caramete, L.; Caruso, R.; Castellina, A.; Cataldi, G.; Cazon, L.; Cester, R.; Chavez, A. G.; Chiavassa, A.; Chinellato, J. A.; Chudoba, J.; Cilmo, M.; Clay, R. W.; Cocciolo, G.; Colalillo, R.; Coleman, A.; Collica, L.; Coluccia, M. R.; Conceição, R.; Contreras, F.; Cooper, M. J.; Cordier, A.; Coutu, S.; Covault, C. E.; Cronin, J.; Curutiu, A.; Dallier, R.; Daniel, B.; Dasso, S.; Daumiller, K.; Dawson, B. R.; Almeida, R. M. de; Domenico, M. De; Jong, S. J. de; Neto, J. R. T. de Mello; Mitri, I. De; Oliveira, J. de; Souza, V. de; Peral, L. del; Deligny, O.; Dembinski, H.; Dhital, N.; Giulio, C. Di; Matteo, A. Di; Diaz, J. C.; Castro, M. L. Díaz; Diogo, F.; Dobrigkeit, C.; Docters, W.; D'Olivo, J. C.; Dorofeev, A.; Hasankiadeh, Q. Dorosti; Dova, M. T.; Ebr, J.; Engel, R.; Erdmann, M.; Erfani, M.; Escobar, C. O.; Espadanal, J.; Etchegoyen, A.; Luis, P. Facal San; Falcke, H.; Fang, K.; Farrar, G.; Fauth, A. C.; Fazzini, N.; Ferguson, A. P.; Fernandes, M.; Fick, B.; Figueira, J. M.; Filevich, A.; Filip?i?, A.; Fox, B. D.; Fratu, O.; Fröhlich, U.; Fuchs, B.; Fujii, T.; Gaior, R.; García, B.; Roca, S. T. Garcia; Garcia-Gamez, D.; Garcia-Pinto, D.; Garilli, G.; Bravo, A. Gascon; Gate, F.; Gemmeke, H.; Ghia, P. L.; Giaccari, U.; Giammarchi, M.; Giller, M.; Glaser, C.; Glass, H.; Berisso, M. Gómez; Vitale, P. F. Gómez; Gonçalves, P.; Gonzalez, J. G.; González, N.; Gookin, B.; Gordon, J.; Gorgi, A.; Gorham, P.; Gouffon, P.; Grebe, S.; Griffith, N.; Grillo, A. F.; Grubb, T. D.; Guarino, F.; Guedes, G. P.; Hampel, M. R.; Hansen, P.; Harari, D.; Harrison, T. A.; Hartmann, S.; Harton, J. L.; Haungs, A.; Hebbeker, T.; Heck, D.; Heimann, P.; Herve, A. E.; Hill, G. C.; Hojvat, C.; Hollon, N.; Holt, E.; Homola, P.; Hörandel, J. R.; Horvath, P.; Hrabovský, M.; Huber, D.; Huege, T.; Insolia, A.; Isar, P. G.; Jandt, I.; Jansen, S.; Jarne, C.; Josebachuili, M.; Kääpä, A.; Kambeitz, O.; Kampert, K. H.; Kasper, P.; Katkov, I.; Kégl, B.; Keilhauer, B.; Keivani, A.; Kemp, E.; Kieckhafer, R. M.; Klages, H. O.; Kleifges, M.; Kleinfeller, J.; Krause, R.; Krohm, N.; Krömer, O.; Kruppke-Hansen, D.; Kuempel, D.; Kunka, N.; LaHurd, D.; Latronico, L.; Lauer, R.; Lauscher, M.; Lautridou, P.; Coz, S. Le; Leão, M. S. A. B.; Lebrun, D.; Lebrun, P.; Oliveira, M. A. Leigui de; Letessier-Selvon, A.; Lhenry-Yvon, I.; Link, K.; López, R.; Agüera, A. Lopez; Louedec, K.; Bahilo, J. Lozano; Lu, L.; Lucero, A.; Ludwig, M.; Malacari, M.; Maldera, S.; Mallamaci, M.; Maller, J.; Mandat, D.; Mantsch, P.; Mariazzi, A. G.; Marin, V.; Mari?, I. C.; Marsella, G.; Martello, D.; Martin, L.; Martinez, H.; Bravo, O. Martínez; Martraire, D.; Meza, J. J. Masías; Mathes, H. J.; Mathys, S.; Matthews, J.; Matthews, J. A. J.; Matthiae, G.; Maurel, D.; Maurizio, D.; Mayotte, E.; Mazur, P. O.; Medina, C.; Medina-Tanco, G.; Meissner, R.; Melissas, M.; Melo, D.; Menshikov, A.; Messina, S.; Meyhandan, R.; Mi?anovi?, S.; Micheletti, M. I.; Middendorf, L.; Minaya, I. A.; Miramonti, L.; Mitrica, B.; Molina-Bueno, L.; Mollerach, S.; Monasor, M.; Ragaigne, D. Monnier; Montanet, F.; Morello, C.; Mostafá, M.; Moura, C. A.; Muller, M. A.; Müller, G.; Müller, S.; Münchmeyer, M.; Mussa, R.; Navarra, G.; Navas, S.; Necesal, P.; Nellen, L.; Nelles, A.; Neuser, J.; Nguyen, P.; Niechciol, M.; Niemietz, L.; Niggemann, T.; Nitz, D.; Nosek, D.; Novotny, V.; Nožka, L.; Ochilo, L.; Olinto, A.; Oliveira, M.; Pacheco, N.; Selmi-Dei, D. Pakk; Palatka, M.; Pallotta, J.; Palmieri, N.; Papenbreer, P.; Parente, G.; Parra, A.; Paul, T.; Pech, M.; P?kala, J.; Pelayo, R.; Pepe, I. M.; Perrone, L.; Petermann, E.; Peters, C.; Petrera, S.; Petrov, Y.; Phuntsok, J.; Piegaia, R.; Pierog, T.; Pieroni, P.; Pimenta, M.; Pirronello, V.; Platino, M.; Plum, M.; Porcelli, A.; Porowski, C.; Prado, R. R.; Privitera, P.; Prouza, M.; Purrello, V.; Quel, E. J.; Querchfeld, S.; Quinn, S.; Rautenberg, J.; Ravel, O.; Ravignani, D.; Revenu, B.

    2015-06-01

    Energy-dependent patterns in the arrival directions of cosmic rays are searched for using data of the Pierre Auger Observatory. We investigate local regions around the highest-energy cosmic rays with eV by analyzing cosmic rays with energies above eV arriving within an angular separation of approximately 15. We characterize the energy distributions inside these regions by two independent methods, one searching for angular dependence of energy-energy correlations and one searching for collimation of energy along the local system of principal axes of the energy distribution. No significant patterns are found with this analysis. The comparison of these measurements with astrophysical scenarios can therefore be used to obtain constraints on related model parameters such as strength of cosmic-ray deflection and density of point sources.

  5. Search for patterns by combining cosmic-ray energy and arrival directions at the Pierre Auger Observatory

    SciTech Connect

    Aab, A.; Abreu, P.; Aglietta, M.; Ahn, E. J.; Samarai, I. Al; Albuquerque, I. F. M.; Allekotte, I.; Allen, J.; Allison, P.; Almela, A.; Castillo, J. Alvarez; Alvarez-Muñiz, J.; Batista, R. Alves; Ambrosio, M.; Aminaei, A.; Anchordoqui, L.; Andringa, S.; Aramo, C.; Aranda, V. M.; Arqueros, F.; Asorey, H.; Assis, P.; Aublin, J.; Ave, M.; Avenier, M.; Avila, G.; Awal, N.; Badescu, A. M.; Barber, K. B.; Bäuml, J.; Baus, C.; Beatty, J. J.; Becker, K. H.; Bellido, J. A.; Berat, C.; Bertaina, M. E.; Bertou, X.; Biermann, P. L.; Billoir, P.; Blaess, S.; Blanco, M.; Bleve, C.; Blümer, H.; Bohá?ová, M.; Boncioli, D.; Bonifazi, C.; Bonino, R.; Borodai, N.; Brack, J.; Brancus, I.; Bridgeman, A.; Brogueira, P.; Brown, W. C.; Buchholz, P.; Bueno, A.; Buitink, S.; Buscemi, M.; Caballero-Mora, K. S.; Caccianiga, B.; Caccianiga, L.; Candusso, M.; Caramete, L.; Caruso, R.; Castellina, A.; Cataldi, G.; Cazon, L.; Cester, R.; Chavez, A. G.; Chiavassa, A.; Chinellato, J. A.; Chudoba, J.; Cilmo, M.; Clay, R. W.; Cocciolo, G.; Colalillo, R.; Coleman, A.; Collica, L.; Coluccia, M. R.; Conceição, R.; Contreras, F.; Cooper, M. J.; Cordier, A.; Coutu, S.; Covault, C. E.; Cronin, J.; Curutiu, A.; Dallier, R.; Daniel, B.; Dasso, S.; Daumiller, K.; Dawson, B. R.; Almeida, R. M. de; Domenico, M. De; Jong, S. J. de; Neto, J. R. T. de Mello; Mitri, I. De; Oliveira, J. de; Souza, V. de; Peral, L. del; Deligny, O.; Dembinski, H.; Dhital, N.; Giulio, C. Di; Matteo, A. Di; Diaz, J. C.; Castro, M. L. Díaz; Diogo, F.; Dobrigkeit, C.; Docters, W.; D’Olivo, J. C.; Dorofeev, A.; Hasankiadeh, Q. Dorosti; Dova, M. T.; Ebr, J.; Engel, R.; Erdmann, M.; Erfani, M.; Escobar, C. O.; Espadanal, J.; Etchegoyen, A.; Luis, P. Facal San; Falcke, H.; Fang, K.; Farrar, G.; Fauth, A. C.; Fazzini, N.; Ferguson, A. P.; Fernandes, M.; Fick, B.; Figueira, J. M.; Filevich, A.; Filip?i?, A.; Fox, B. D.; Fratu, O.; Fröhlich, U.; Fuchs, B.; Fujii, T.; Gaior, R.; García, B.; Roca, S. T. Garcia; Garcia-Gamez, D.; Garcia-Pinto, D.; Garilli, G.; Bravo, A. Gascon; Gate, F.; Gemmeke, H.; Ghia, P. L.; Giaccari, U.; Giammarchi, M.; Giller, M.; Glaser, C.; Glass, H.; Berisso, M. Gómez; Vitale, P. F. Gómez; Gonçalves, P.; Gonzalez, J. G.; González, N.; Gookin, B.; Gordon, J.; Gorgi, A.; Gorham, P.; Gouffon, P.; Grebe, S.; Griffith, N.; Grillo, A. F.; Grubb, T. D.; Guarino, F.; Guedes, G. P.; Hampel, M. R.; Hansen, P.; Harari, D.; Harrison, T. A.; Hartmann, S.; Harton, J. L.; Haungs, A.; Hebbeker, T.; Heck, D.; Heimann, P.; Herve, A. E.; Hill, G. C.; Hojvat, C.; Hollon, N.; Holt, E.; Homola, P.; Hörandel, J. R.; Horvath, P.; Hrabovský, M.; Huber, D.; Huege, T.; Insolia, A.; Isar, P. G.; Jandt, I.; Jansen, S.; Jarne, C.; Josebachuili, M.; Kääpä, A.; Kambeitz, O.; Kampert, K. H.; Kasper, P.; Katkov, I.; Kégl, B.; Keilhauer, B.; Keivani, A.; Kemp, E.; Kieckhafer, R. M.; Klages, H. O.; Kleifges, M.; Kleinfeller, J.; Krause, R.; Krohm, N.; Krömer, O.; Kruppke-Hansen, D.; Kuempel, D.; Kunka, N.; LaHurd, D.; Latronico, L.; Lauer, R.; Lauscher, M.; Lautridou, P.; Coz, S. Le; Leão, M. S. A. B.; Lebrun, D.; Lebrun, P.; Oliveira, M. A. Leigui de; Letessier-Selvon, A.; Lhenry-Yvon, I.; Link, K.; López, R.; Agüera, A. Lopez; Louedec, K.; Bahilo, J. Lozano; Lu, L.; Lucero, A.; Ludwig, M.; Malacari, M.; Maldera, S.; Mallamaci, M.; Maller, J.; Mandat, D.; Mantsch, P.; Mariazzi, A. G.; Marin, V.; Mari?, I. C.; Marsella, G.; Martello, D.; Martin, L.; Martinez, H.; Bravo, O. Martínez; Martraire, D.; Meza, J. J. Masías; Mathes, H. J.; Mathys, S.; Matthews, J.; Matthews, J. A. J.; Matthiae, G.; Maurel, D.; Maurizio, D.; Mayotte, E.; Mazur, P. O.; Medina, C.; Medina-Tanco, G.; Meissner, R.; Melissas, M.; Melo, D.; Menshikov, A.; Messina, S.; Meyhandan, R.; Mi?anovi?, S.; Micheletti, M. I.; Middendorf, L.; Minaya, I. A.; Miramonti, L.; Mitrica, B.; Molina-Bueno, L.; Mollerach, S.; Monasor, M.; Ragaigne, D. Monnier; Montanet, F.; Morello, C.; Mostafá, M.; Moura, C. A.; Muller, M. A.; Müller, G.; Müller, S.; Münchmeyer, M.; Mussa, R.; Navarra, G.; Navas, S.; Necesal, P.; Nellen, L.; Nelles, A.; Neuser, J.; Nguyen, P.; Niechciol, M.; Niemietz, L.; Niggemann, T.; Nitz, D.; Nosek, D.; Novotny, V.; Nožka, L.; Ochilo, L.; Olinto, A.; Oliveira, M.; Pacheco, N.; Selmi-Dei, D. Pakk; Palatka, M.; Pallotta, J.; Palmieri, N.; Papenbreer, P.; Parente, G.; Parra, A.; Paul, T.; Pech, M.; P?kala, J.; Pelayo, R.; Pepe, I. M.; Perrone, L.; Petermann, E.; Peters, C.; Petrera, S.; Petrov, Y.; Phuntsok, J.; Piegaia, R.; Pierog, T.; Pieroni, P.; Pimenta, M.; Pirronello, V.; Platino, M.; Plum, M.; Porcelli, A.; Porowski, C.; Prado, R. R.; Privitera, P.; Prouza, M.; Purrello, V.; Quel, E. J.; Querchfeld, S.; Quinn, S.; Rautenberg, J.; Ravel, O.; Ravignani, D.; Revenu, B.

    2015-06-20

    Energy-dependent patterns in the arrival directions of cosmic rays are searched for using data of the Pierre Auger Observatory. We investigate local regions around the highest-energy cosmic rays with $E \\ge 6 \\times 10^{19}$ eV by analyzing cosmic rays with energies above $E \\ge 5 \\times 10^{18}$ eV arriving within an angular separation of approximately 15$^{\\circ }$ . We characterize the energy distributions inside these regions by two independent methods, one searching for angular dependence of energy-energy correlations and one searching for collimation of energy along the local system of principal axes of the energy distribution. No significant patterns are found with this analysis. As a result, the comparison of these measurements with astrophysical scenarios can therefore be used to obtain constraints on related model parameters such as strength of cosmic-ray deflection and density of point sources.

  6. Search for patterns by combining cosmic-ray energy and arrival directions at the Pierre Auger Observatory

    DOE PAGESBeta

    Aab, A.; Abreu, P.; Aglietta, M.; Ahn, E. J.; Samarai, I. Al; Albuquerque, I. F. M.; Allekotte, I.; Allen, J.; Allison, P.; Almela, A.; et al

    2015-06-20

    Energy-dependent patterns in the arrival directions of cosmic rays are searched for using data of the Pierre Auger Observatory. We investigate local regions around the highest-energy cosmic rays with $E \\ge 6 \\times 10^{19}$ eV by analyzing cosmic rays with energies above $E \\ge 5 \\times 10^{18}$ eV arriving within an angular separation of approximately 15$^{\\circ }$ . We characterize the energy distributions inside these regions by two independent methods, one searching for angular dependence of energy-energy correlations and one searching for collimation of energy along the local system of principal axes of the energy distribution. No significant patterns aremore »found with this analysis. As a result, the comparison of these measurements with astrophysical scenarios can therefore be used to obtain constraints on related model parameters such as strength of cosmic-ray deflection and density of point sources.« less

  7. WEIRD : Wide orbit Exoplanet search with InfraRed Direct imaging

    NASA Astrophysics Data System (ADS)

    Baron, Frédérique; Artigau, Etienne; Rameau, Julien; Lafrenière, David; Albert, Loic; Naud, Marie-Eve; Gagné, Jonathan; Malo, Lison; Doyon, Rene; Beichman, Charles; Delorme, Philippe; Janson, Markus

    2015-12-01

    We currently do not know what does the emission spectrum of a young 1 Jupiter-mass planet look like, as no such object has yet been directly imaged. Arguably, the most useful Jupiter-mass planet would be one that is bound to a star of known age, distance and metallicity but which has an orbit large enough (100-5000 UA) that it can be studied as an "isolated" object. We are therefore searching for the most extreme planetary systems. We are currently gathering a large dataset to try to identify such objects through deep [3.6] and [4.5] imaging from SPITZER and deep seeing-limited J (with Flamingos 2 and WIRCam) and z imaging (with GMOS-S and MegaCam) of all 181 known confirmed members of a known young association (<120 Myr) within 70pc of the Sun. Our study will reveal distant planetary companions, over the reveal distant PMCs up to 5000 AU. AU separation range, through their distinctively red z-J and [4.5]-[3.6] colors. The sensitivity limits of our combined Spitzer+ground-based program will allow detection of planets with masses as low as 1 Mjup with very low contamination rates. Here we present some preliminary results of our survey. This approach is unique in the community and will give us an overview of the architecture of the outer part of planetary systems that were never probed before. Our survey will provide benchmark young Saturn and Jupiter for imaging and spectroscopy with the JWST

  8. Diagnostic Assessment of the Difficulty Using Direct Policy Search in Many-Objective Reservoir Control

    NASA Astrophysics Data System (ADS)

    Zatarain-Salazar, J.; Reed, P. M.; Herman, J. D.; Giuliani, M.; Castelletti, A.

    2014-12-01

    Globally reservoir operations provide fundamental services to water supply, energy generation, recreation, and ecosystems. The pressures of expanding populations, climate change, and increased energy demands are motivating a significant investment in re-operationalizing existing reservoirs or defining operations for new reservoirs. Recent work has highlighted the potential benefits of exploiting recent advances in many-objective optimization and direct policy search (DPS) to aid in addressing these systems' multi-sector demand tradeoffs. This study contributes to a comprehensive diagnostic assessment of multi-objective evolutionary optimization algorithms (MOEAs) efficiency, effectiveness, reliability, and controllability when supporting DPS for the Conowingo dam in the Lower Susquehanna River Basin. The Lower Susquehanna River is an interstate water body that has been subject to intensive water management efforts due to the system's competing demands from urban water supply, atomic power plant cooling, hydropower production, and federally regulated environmental flows. Seven benchmark and state-of-the-art MOEAs are tested on deterministic and stochastic instances of the Susquehanna test case. In the deterministic formulation, the operating objectives are evaluated over the historical realization of the hydroclimatic variables (i.e., inflows and evaporation rates). In the stochastic formulation, the same objectives are instead evaluated over an ensemble of stochastic inflows and evaporation rates realizations. The algorithms are evaluated in their ability to support DPS in discovering reservoir operations that compose the tradeoffs for six multi-sector performance objectives with thirty-two decision variables. Our diagnostic results highlight that many-objective DPS is very challenging for modern MOEAs and that epsilon dominance is critical for attaining high levels of performance. Epsilon dominance algorithms epsilon-MOEA, epsilon-NSGAII and the auto adaptive Borg MOEA, are statistically superior for the six-objective Susquehanna instance of this important class of problems. Additionally, shifting from deterministic history-based DPS to stochastic DPS significantly increases the difficulty of the problem.

  9. Importance of upgraded energy reconstruction for direct dark matter searches with liquid xenon detectors

    E-print Network

    Peter Sorensen

    2012-10-18

    The usual nuclear recoil energy reconstruction employed by liquid xenon dark matter search experiments relies only on the primary scintillation photon signal. Energy reconstruction based on both the photon and electron signals yields a more accurate representation of search results. For a dark matter particle mass m~10 GeV, a nuclear recoil from a scattering event is more likely to be observed in the lower left corner of the typical search box, rather than near the nuclear recoil calibration centroid. In this region of the search box, the actual nuclear recoil energies are smaller than the usual energy scale suggests, by about a factor x2. Recent search results from the XENON100 experiment are discussed in light of these considerations.

  10. Impact of Coherent Neutrino Nucleus Scattering on Direct Dark Matter Searches based on CaWO$_4$ Crystals

    E-print Network

    A. Gütlein; G. Angloher; A. Bento; C. Bucci; L. Canonica; A. Erb; F. v. Feilitzsch; N. Ferreiro Iachellini; P. Gorla; D. Hauff; J. Jochum; M. Kiefer; H. Kluck; H. Kraus; J. -C. Lanfranchi; J. Loebell; A. Münster; F. Petricca; W. Potzel; F. Pröbst; F. Reindl; S. Roth; K. Rottler; C. Sailer; K. Schäffner; J. Schieck; S. Schönert; W. Seidel; M. v. Sivers; L. Stodolsky; C. Strandhagen; R. Strauss; A. Tanzke; M. Uffinger; A. Ulrich; I. Usherov; S. Wawoczny; M. Willers; M. Wüstrich; A. Zöller

    2015-03-17

    Atmospheric and solar neutrinos scattering coherently off target nuclei will be an important background source for the next generation of direct dark matter searches. In this work we focus on calcium tungstate as target material. For comparison with existing works we calculate the neutrino floor indicating which sensitivities can be reached before the neutrino background appears. In addition, we investigate the sensitivities of future direct dark matter searches using CRESST-II like detectors. Extending previous works we take into account achievable energy resolutions and thresholds as well as beta and gamma backgrounds for this investigation. We show that an exploration of WIMP-nucleon cross sections below the neutrino floor is possible for exposures of $\\gtrsim10$ kg-years or higher. In the third part we show that a first detection of coherent neutrino nucleus scattering of atmospheric and solar neutrinos using the same detectors and the backgrounds is feasible for exposures of $\\gtrsim50$ kg-years.

  11. Impact of coherent neutrino nucleus scattering on direct dark matter searches based on CaWO4 crystals

    NASA Astrophysics Data System (ADS)

    Gütlein, A.; Angloher, G.; Bento, A.; Bucci, C.; Canonica, L.; Erb, A.; Feilitzsch, F. v.; Ferreiro Iachellini, N.; Gorla, P.; Hauff, D.; Jochum, J.; Kiefer, M.; Kluck, H.; Kraus, H.; Lanfranchi, J.-C.; Loebell, J.; Münster, A.; Petricca, F.; Potzel, W.; Pröbst, F.; Reindl, F.; Roth, S.; Rottler, K.; Sailer, C.; Schäffner, K.; Schieck, J.; Schönert, S.; Seidel, W.; Sivers, M. v.; Stodolsky, L.; Strandhagen, C.; Strauss, R.; Tanzke, A.; Uffinger, M.; Ulrich, A.; Usherov, I.; Wawoczny, S.; Willers, M.; Wüstrich, M.; Zöller, A.

    2015-09-01

    Atmospheric and solar neutrinos scattering coherently off target nuclei will be an important background source for the next generation of direct dark matter searches. In this work we focus on calcium tungstate as target material. For comparison with existing works we calculate the neutrino floor indicating which sensitivities can be reached before the neutrino background appears. In addition, we investigate the sensitivities of future direct dark matter searches using CRESST-II like detectors. Extending previous works we take into account achievable energy resolutions and thresholds as well as beta and gamma backgrounds for this investigation. We show that an exploration of WIMP-nucleon cross sections below the neutrino floor is possible for exposures of ? 10 kg-years. In the third part we show that a first detection of coherent neutrino nucleus scattering of atmospheric and solar neutrinos using the same detectors and the backgrounds is feasible for exposures of ? 50 kg-years.

  12. Goal-Directed ASR in a Multimedia Indexing and Searching Environment (MUMIS) 

    E-print Network

    Wester, Mirjam; Kessens, Judith M; Strik, Helmer

    This paper describes the contribution of automatic speech recognition (ASR) within the framework of MUMIS (Multimedia Indexing and Searching Environment). The domain is football commentaries. The initial results of carrying ...

  13. Parallel VLSI Circuit Analysis and Optimization 

    E-print Network

    Ye, Xiaoji

    2012-02-14

    circuit simulation techniques and achieves superlinear speedup in practice. The second part of the dissertation talks about parallel circuit optimization. A modified asynchronous parallel pattern search (APPS) based method which utilizes the efficient...

  14. Evaluation of fault-normal/fault-parallel directions rotated ground motions for response history analysis of an instrumented six-story building

    USGS Publications Warehouse

    Kalkan, Erol; Kwong, Neal S.

    2012-01-01

    According to regulatory building codes in United States (for example, 2010 California Building Code), at least two horizontal ground-motion components are required for three-dimensional (3D) response history analysis (RHA) of buildings. For sites within 5 km of an active fault, these records should be rotated to fault-normal/fault-parallel (FN/FP) directions, and two RHA analyses should be performed separately (when FN and then FP are aligned with the transverse direction of the structural axes). It is assumed that this approach will lead to two sets of responses that envelope the range of possible responses over all nonredundant rotation angles. This assumption is examined here using a 3D computer model of a six-story reinforced-concrete instrumented building subjected to an ensemble of bidirectional near-fault ground motions. Peak responses of engineering demand parameters (EDPs) were obtained for rotation angles ranging from 0° through 180° for evaluating the FN/FP directions. It is demonstrated that rotating ground motions to FN/FP directions (1) does not always lead to the maximum responses over all angles, (2) does not always envelope the range of possible responses, and (3) does not provide maximum responses for all EDPs simultaneously even if it provides a maximum response for a specific EDP.

  15. Sequential/parallel production of potential Malaria vaccines - A direct way from single batch to quasi-continuous integrated production.

    PubMed

    Luttmann, Reiner; Borchert, Sven-Oliver; Mueller, Christian; Loegering, Kai; Aupert, Florian; Weyand, Stephan; Kober, Christian; Faber, Bart; Cornelissen, Gesine

    2015-11-10

    An intensification of pharmaceutical protein production processes can be achieved by the integration of unit operations and application of recurring sequences of all biochemical process steps. Within optimization procedures each individual step as well as the overall process has to be in the focus of scientific interest. This paper includes a description of the development of a fully automated production plant, starting with a two step upstream followed by a four step downstream line, including cell clarification, broth cleaning with microfiltration, product concentration with ultrafiltration and purification with column chromatography. Recursive production strategies are developed where a cell breeding, the protein production and the whole downstream is operated in series but also in parallel, each main operation shifted by one day. The quality and reproducibility of the recursive protein expression is monitored on-line by Golden Batch and this is controlled by Model Predictive Multivariate Control (MPMC). As a demonstration process the production of potential Malaria vaccines with Pichia pastoris is under investigation. PMID:25736485

  16. Icarus: A 2D direct simulation Monte Carlo (DSMC) code for parallel computers. User`s manual - V.3.0

    SciTech Connect

    Bartel, T.; Plimpton, S.; Johannes, J.; Payne, J.

    1996-10-01

    Icarus is a 2D Direct Simulation Monte Carlo (DSMC) code which has been optimized for the parallel computing environment. The code is based on the DSMC method of Bird and models from free-molecular to continuum flowfields in either cartesian (x, y) or axisymmetric (z, r) coordinates. Computational particles, representing a given number of molecules or atoms, are tracked as they have collisions with other particles or surfaces. Multiple species, internal energy modes (rotation and vibration), chemistry, and ion transport are modelled. A new trace species methodology for collisions and chemistry is used to obtain statistics for small species concentrations. Gas phase chemistry is modelled using steric factors derived from Arrhenius reaction rates. Surface chemistry is modelled with surface reaction probabilities. The electron number density is either a fixed external generated field or determined using a local charge neutrality assumption. Ion chemistry is modelled with electron impact chemistry rates and charge exchange reactions. Coulomb collision cross-sections are used instead of Variable Hard Sphere values for ion-ion interactions. The electrostatic fields can either be externally input or internally generated using a Langmuir-Tonks model. The Icarus software package includes the grid generation, parallel processor decomposition, postprocessing, and restart software. The commercial graphics package, Tecplot, is used for graphics display. The majority of the software packages are written in standard Fortran.

  17. Digital signal processing and control and estimation theory -- Points of tangency, area of intersection, and parallel directions

    NASA Technical Reports Server (NTRS)

    Willsky, A. S.

    1976-01-01

    A number of current research directions in the fields of digital signal processing and modern control and estimation theory were studied. Topics such as stability theory, linear prediction and parameter identification, system analysis and implementation, two-dimensional filtering, decentralized control and estimation, image processing, and nonlinear system theory were examined in order to uncover some of the basic similarities and differences in the goals, techniques, and philosophy of the two disciplines. An extensive bibliography is included.

  18. Collective cargo hauling by a bundle of parallel microtubules: bi-directional motion caused by load-dependent polymerization and depolymerization

    E-print Network

    Dipanwita Ghanti; Debashish Chowdhury

    2015-01-09

    A microtubule (MT) is a hollow tube of approximately 25 nm diameter. The two ends of the tube are dissimilar and are designated as `plus' and `minus' ends. Motivated by the collective push and pull exerted by a bundle of MTs during chromosome segregation in a living cell, we have developed here a much simplified theoretical model of a bundle of parallel dynamic MTs. The plus-end of all the MTs in the bundle are permanently attached to a movable `wall' by a device whose detailed structure is not treated explicitly in our model. The only requirement is that the device allows polymerization and depolymerization of each MT at the plus-end. In spite of the absence of external force and direct lateral interactions between the MTs, the group of polymerizing MTs attached to the wall create a load force against the group of depolymerizing MTs and vice-versa; the load against a group is shared equally by the members of that group. Such indirect interactions among the MTs gives rise to the rich variety of possible states of collective dynamics that we have identified by computer simulations of the model in different parameter regimes. The bi-directional motion of the cargo, caused by the load-dependence of the polymerization kinetics, is a "proof-of-principle" that the bi-directional motion of chromosomes before cell division does not necessarily need active participation of motor proteins.

  19. A Search for Institutional Distinctiveness. New Directions for Community Colleges, Number 65.

    ERIC Educational Resources Information Center

    Townsend, Barbara K., Ed.

    1989-01-01

    The essays in this collection argue that community colleges have much to gain by seeking out and maintaining positive recognition of the features that distinguish them from other colleges in the region and state. In addition, the sourcebook contains articles discussing the process of conducting a search for institutional distinctiveness and ways…

  20. Adolescents' use of sexually explicit Internet material and their sexual attitudes and behavior: Parallel development and directional effects.

    PubMed

    Doornwaard, Suzan M; Bickham, David S; Rich, Michael; ter Bogt, Tom F M; van den Eijnden, Regina J J M

    2015-10-01

    Although research has repeatedly demonstrated that adolescents' use of sexually explicit Internet material (SEIM) is related to their endorsement of permissive sexual attitudes and their experience with sexual behavior, it is not clear how linkages between these constructs unfold over time. This study combined 2 types of longitudinal modeling, mean-level development and cross-lagged panel modeling, to examine (a) developmental patterns in adolescents' SEIM use, permissive sexual attitudes, and experience with sexual behavior, as well as whether these developments are related; and (b) longitudinal directionality of associations between SEIM use on the 1 hand and permissive sexual attitudes and sexual behavior on the other hand. We used 4-wave longitudinal data from 1,132 7th through 10th grade Dutch adolescents (M(age) T1 = 13.95; 52.7% boys) and estimated multigroup models to test for moderation by gender. Mean-level developmental trajectories showed that boys occasionally and increasingly used SEIM over the 18-month study period, which co-occurred with increases in their permissive attitudes and their experience with sexual behavior. Cross-lagged panel models revealed unidirectional effects from boys' SEIM use on their subsequent endorsement of permissive attitudes, but no consistent directional effects between their SEIM use and sexual behavior. Girls showed a similar pattern of increases in experience with sexual behavior, but their SEIM use was consistently low and their endorsement of permissive sexual attitudes decreased over the 18-month study period. In contrast to boys, girls' SEIM use was not longitudinally related to their sexual attitudes and behavior. Theoretical and practical implications of these gender-specific findings are discussed. (PsycINFO Database Record PMID:26376287

  1. A novel method of wide searching scope and fast searching speed for image block matching

    NASA Astrophysics Data System (ADS)

    Yu, Fei; Li, Chao; Mei, Qiang; Lin, Zhe

    2015-10-01

    When the image matching method is used for motion estimation, the performance parameters like searching scope, searching speed, accuracy and robustness of the method normally are significant and need enhancement. In this paper, a novel method of block matching containing the wide range image block matching strategy and the strategy of multi-start points and parallel searching are presented. In the wide range matching strategy, the size of template block and searching block are same. And the average value of cumulative results by pixels in calculation is taken to ensure matching parameters can accurately represent the matching degree. In the strategy of multi-start points and parallel searching, the way of choosing starting points evenly is presented based on the characteristic of the block matching search, and the adaptive conditions and adaptive schedule is established based on the searching region. In the processing of iteration, the new strategy can not only adapt to the solution that lead the objective to the correct direction, but also adapt to the solution that have a little offset comparing with the objective. Therefore the multi-start points and parallel searching algorithm can be easy to keep from the trap of local minima effectively. The image processing system based on the DSP chip of TMS320C6415 is used to make the experiment for the video image stabilization. The results of experiment show that, the application of two methods can improve the range of motion estimation and reduce the searching computation.

  2. A parallelized binary search tree

    Technology Transfer Automated Retrieval System (TEKTRAN)

    PTTRNFNDR is an unsupervised statistical learning algorithm that detects patterns in DNA sequences, protein sequences, or any natural language texts that can be decomposed into letters of a finite alphabet. PTTRNFNDR performs complex mathematical computations and its processing time increases when i...

  3. First measurement of the Head-Tail directional nuclear recoil signature at energies relevant to WIMP dark matter searches

    E-print Network

    S. Burgos; E. Daw; J. Forbes; C. Ghag; M. Gold; C. Hagemann; V. A. Kudryavtsev; T. B. Lawson; D. Loomba; P. Majewski; D. Muna; A. StJ. Murphy; G. G. Nicklin; S. M. Paling; A. Petkov; S. J. S. Plank; M. Robinson; N. Sanghi; D. P. Snowden-Ifft; N. J. C. Spooner; J. Turk; E. Tziaferi

    2008-09-10

    We present first evidence for the so-called Head-Tail asymmetry signature of neutron-induced nuclear recoil tracks at energies down to 1.5 keV/amu using the 1m^3 DRIFT-IIc dark matter detector. This regime is appropriate for recoils induced by Weakly Interacting Massive Particle (WIMPs) but one where the differential ionization is poorly understood. We show that the distribution of recoil energies and directions induced here by Cf-252 neutrons matches well that expected from massive WIMPs. The results open a powerful new means of searching for a galactic signature from WIMPs.

  4. Search for a Direct Large-Cluster-Transfer Process in the C-12,c-13(ne-20,a) Reaction 

    E-print Network

    Murakami, T.; Takahashi, N.; Lui, YW; Takada, E.; Tanner, D. M.; Tribble, Robert E.; Ungricht, E.; Nagatani, K.

    1985-01-01

    resonances. This work was supported in part by the U. S.~Department of Energy and the Robert A. Welch Foundation. 'p ' l~() 50 40 30 20 10 0E?(zeV) FIG. 3. Background-subtracted o. spectra of the ' C( Ne, n) reactions in the center-of-mass system. Also..., Texas 3 4 M University, College Station, Texas 77843 (Received 7 August 1985) The C(20Ne, o.) reactions were measured at E= 140.2 MeV in order to search for a direct ' 0- cluster-transfer process. In the reaction with the C target, prominent broad...

  5. Direct dark matter search by annual modulation in XMASS-I

    E-print Network

    Abe, K; Ichimura, K; Kishimoto, Y; Kobayashi, K; Kobayashi, M; Moriyama, S; Nakahata, M; Norita, T; Ogawa, H; Sekiya, H; Takachio, O; Takeda, A; Yamashita, M; Yang, B S; Kim, N Y; Kim, Y D; Tasaka, S; Fushimi, K; Liu, J; Martens, K; Suzuki, Y; Xu, B D; Fujita, R; Hosokawa, K; Miuchi, K; Onishi, Y; Oka, N; Takeuchi, Y; Kim, Y H; Lee, J S; Lee, K B; Lee, M K; Fukuda, Y; Itow, Y; Kegasa, R; Masada, K; Takiya, H; Nishijima, K; Nakamura, S

    2015-01-01

    A search for dark matter was conducted with the XMASS detector by means of the expected annual modulation due to the Earth's rotation around the Sun. The data used for this analysis was 359.2 live days $\\times$ 832 kg of exposure accumulated between November 2013 and March 2015. The result of a simple modulation analysis, without assuming any specific dark matter model, showed a slight negative amplitude. As the $p$-values are 6.1 or 17\\% in our two independent analyses, these results are consistent with fluctuations. We also set 90\\% confidence level (C.L.) upper bounds that can be used to test models. When we assume Weakly Interacting Massive Particle (WIMP) dark matter elastically scattering on the target nuclei, we exclude almost all the DAMA/LIBRA allowed region with the modulation analysis. This is the first extensive search probing this region with redan exposure comparable to theirs.

  6. Direct dark matter search by annual modulation in XMASS-I

    E-print Network

    XMASS Collaboration; K. Abe; K. Hiraide; K. Ichimura; Y. Kishimoto; K. Kobayashi; M. Kobayashi; S. Moriyama; M. Nakahata; T. Norita; H. Ogawa; H. Sekiya; O. Takachio; A. Takeda; M. Yamashita; B. S. Yang; N. Y. Kim; Y. D. Kim; S. Tasaka; K. Fushimi; J. Liu; K. Martens; Y. Suzuki; B. D. Xu; R. Fujita; K. Hosokawa; K. Miuchi; Y. Onishi; N. Oka; Y. Takeuchi; Y. H. Kim; J. S. Lee; K. B. Lee; M. K. Lee; Y. Fukuda; Y. Itow; R. Kegasa; K. Kobayashi; K. Masada; H. Takiya; K. Nishijima; S. Nakamura

    2015-11-16

    A search for dark matter was conducted with the XMASS detector by means of the expected annual modulation due to the Earth's rotation around the Sun. The data used for this analysis was 359.2 live days $\\times$ 832 kg of exposure accumulated between November 2013 and March 2015. The result of a simple modulation analysis, without assuming any specific dark matter model, showed a slight negative amplitude. As the $p$-values are 6.1 or 17\\% in our two independent analyses, these results are consistent with fluctuations. We also set 90\\% confidence level (C.L.) upper bounds that can be used to test models. When we assume Weakly Interacting Massive Particle (WIMP) dark matter elastically scattering on the target nuclei, we exclude almost all the DAMA/LIBRA allowed region with the modulation analysis. This is the first extensive search probing this region with redan exposure comparable to theirs.

  7. Footprint of Triplet Scalar Dark Matter in Direct, Indirect Search and Invisible Higgs Decay

    E-print Network

    Ayazi, Seyed Yaser

    2015-01-01

    In this talk, we will review Inert Triplet Model (ITM) which provide candidate for dark matter (DM) particles. Then we study possible decays of Higgs boson to DM candidate and apply current experimental data for invisible Higgs decay to constrain parameter space of ITM. We also consider indirect search for DM and use FermiLAT data to put constraints on parameter space. Ultimately we compare this limit with constraints provided by LUX experiment for low mass DM and invisible Higgs decay.

  8. Footprint of Triplet Scalar Dark Matter in Direct, Indirect Search and Invisible Higgs Decay

    E-print Network

    Seyed Yaser Ayazi; S. Mahdi Firouzabadi

    2015-01-25

    In this talk, we will review Inert Triplet Model (ITM) which provide candidate for dark matter (DM) particles. Then we study possible decays of Higgs boson to DM candidate and apply current experimental data for invisible Higgs decay to constrain parameter space of ITM. We also consider indirect search for DM and use FermiLAT data to put constraints on parameter space. Ultimately we compare this limit with constraints provided by LUX experiment for low mass DM and invisible Higgs decay.

  9. Direct and Indirect Searches for Dark Matter in the Form of Weakly Interacting Massive Particles (WIMPs)

    E-print Network

    Nader Mirabolfathi

    2004-12-03

    Numerous lines of evidence indicate that the matter content of the Universe is dominated by some unseen component. Determining the nature of this Dark Matter is one of the most important problems in cosmology. Weakly Interacting Massive Particles (WIMPs) are widely considered to be one of the best candidates which may comprise the Dark Matter. A brief overview of the different methods being used to search for WIMP Dark Matter is given, focusing on the technologies of several benchmark experiments.

  10. Supermassive Black Hole Binaries in High Performance Massively Parallel Direct N-body Simulations on Large GPU Clusters

    NASA Astrophysics Data System (ADS)

    Spurzem, R.; Berczik, P.; Zhong, S.; Nitadori, K.; Hamada, T.; Berentzen, I.; Veles, A.

    2012-07-01

    Astrophysical Computer Simulations of Dense Star Clusters in Galactic Nuclei with Supermassive Black Holes are presented using new cost-efficient supercomputers in China accelerated by graphical processing cards (GPU). We use large high-accuracy direct N-body simulations with Hermite scheme and block-time steps, parallelised across a large number of nodes on the large scale and across many GPU thread processors on each node on the small scale. A sustained performance of more than 350 Tflop/s for a science run on using simultaneously 1600 Fermi C2050 GPUs is reached; a detailed performance model is presented and studies for the largest GPU clusters in China with up to Petaflop/s performance and 7000 Fermi GPU cards. In our case study we look at two supermassive black holes with equal and unequal masses embedded in a dense stellar cluster in a galactic nucleus. The hardening processes due to interactions between black holes and stars, effects of rotation in the stellar system and relativistic forces between the black holes are simultaneously taken into account. The simulation stops at the complete relativistic merger of the black holes.

  11. High Resolution Direction of Arrival (DOA) Estimation Based on Improved Orthogonal Matching Pursuit (OMP) Algorithm by Iterative Local Searching

    PubMed Central

    Wang, Wenyi; Wu, Renbiao

    2013-01-01

    DOA (Direction of Arrival) estimation is a major problem in array signal processing applications. Recently, compressive sensing algorithms, including convex relaxation algorithms and greedy algorithms, have been recognized as a kind of novel DOA estimation algorithm. However, the success of these algorithms is limited by the RIP (Restricted Isometry Property) condition or the mutual coherence of measurement matrix. In the DOA estimation problem, the columns of measurement matrix are steering vectors corresponding to different DOAs. Thus, it violates the mutual coherence condition. The situation gets worse when there are two sources from two adjacent DOAs. In this paper, an algorithm based on OMP (Orthogonal Matching Pursuit), called ILS-OMP (Iterative Local Searching-Orthogonal Matching Pursuit), is proposed to improve DOA resolution by Iterative Local Searching. Firstly, the conventional OMP algorithm is used to obtain initial estimated DOAs. Then, in each iteration, a local searching process for every estimated DOA is utilized to find a new DOA in a given DOA set to further decrease the residual. Additionally, the estimated DOAs are updated by substituting the initial DOA with the new one. The simulation results demonstrate the advantages of the proposed algorithm. PMID:23974150

  12. Statistical learning modulates the direction of the first head movement in a large-scale search task.

    PubMed

    Won, Bo-Yeong; Lee, Hyejin J; Jiang, Yuhong V

    2015-10-01

    Foraging and search tasks in everyday activities are often performed in large, open spaces, necessitating head and body movements. Such activities are rarely studied in the laboratory, leaving important questions unanswered regarding the role of attention in large-scale tasks. Here we examined the guidance of visual attention by statistical learning in a large-scale, outdoor environment. We used the orientation of the first head movement as a proxy for spatial attention and examined its correspondence with reaction time (RT). Participants wore a lightweight camera on a baseball cap while searching for a coin on the concrete floor of a 64-m(2) outdoor space. We coded the direction of the first head movement at the start of a trial. The results showed that the first head movement was highly sensitive to the location probability of the coin and demonstrated more rapid adjustment to changes in environmental statistics than RTs did. Because the first head movement occurred ten times faster than the search RT, these results show that visual statistical learning affected attentional orienting early in large-scale tasks. PMID:26160317

  13. A Massively Parallel Hybrid Dusty-Gasdynamics and Kinetic Direct Simulation Monte Carlo Model for Planetary Applications

    NASA Technical Reports Server (NTRS)

    Combi, Michael R.

    2004-01-01

    In order to understand the global structure, dynamics, and physical and chemical processes occurring in the upper atmospheres, exospheres, and ionospheres of the Earth, the other planets, comets and planetary satellites and their interactions with their outer particles and fields environs, it is often necessary to address the fundamentally non-equilibrium aspects of the physical environment. These are regions where complex chemistry, energetics, and electromagnetic field influences are important. Traditional approaches are based largely on hydrodynamic or magnetohydrodynamic (MHD) formulations and are very important and highly useful. However, these methods often have limitations in rarefied physical regimes where the molecular collision rates and ion gyrofrequencies are small and where interactions with ionospheres and upper neutral atmospheres are important. At the University of Michigan we have an established base of experience and expertise in numerical simulations based on particle codes which address these physical regimes. The Principal Investigator, Dr. Michael Combi, has over 20 years of experience in the development of particle-kinetic and hybrid kinetichydrodynamics models and their direct use in data analysis. He has also worked in ground-based and space-based remote observational work and on spacecraft instrument teams. His research has involved studies of cometary atmospheres and ionospheres and their interaction with the solar wind, the neutral gas clouds escaping from Jupiter s moon Io, the interaction of the atmospheres/ionospheres of Io and Europa with Jupiter s corotating magnetosphere, as well as Earth s ionosphere. This report describes our progress during the year. The contained in section 2 of this report will serve as the basis of a paper describing the method and its application to the cometary coma that will be continued under a research and analysis grant that supports various applications of theoretical comet models to understanding the inner comae of comets (grant NAGS- 13239 from the Planetary Atmospheres program).

  14. Development of ballistic hot electron emitter and its applications to parallel processing: active-matrix massive direct-write lithography in vacuum and thin films deposition in solutions

    NASA Astrophysics Data System (ADS)

    Koshida, N.; Kojima, A.; Ikegami, N.; Suda, R.; Yagi, M.; Shirakashi, J.; Yoshida, T.; Miyaguchi, H.; Muroyama, M.; Nishino, H.; Yoshida, S.; Sugata, M.; Totsu, K.; Esashi, M.

    2015-03-01

    Making the best use of the characteristic features in nanocrystalline Si (nc-Si) ballistic hot electron source, the alternative lithographic technology is presented based on the two approaches: physical excitation in vacuum and chemical reduction in solutions. The nc-Si cold cathode is a kind of metal-insulator-semiconductor (MIS) diode, composed of a thin metal film, an nc-Si layer, an n+-Si substrate, and an ohmic back contact. Under a biased condition, energetic electrons are uniformly and directionally emitted through the thin surface electrodes. In vacuum, this emitter is available for active-matrix drive massive parallel lithography. Arrayed 100×100 emitters (each size: 10×10 ?m2, pitch: 100 ?m) are fabricated on silicon substrate by conventional planar process, and then every emitter is bonded with integrated complementary metal-oxide-semiconductor (CMOS) driver using through-silicon-via (TSV) interconnect technology. Electron multi-beams emitted from selected devices are focused by a micro-electro-mechanical system (MEMS) condenser lens array and introduced into an accelerating system with a demagnification factor of 100. The electron accelerating voltage is 5 kV. The designed size of each beam landing on the target is 10×10 nm2 in square. Here we discuss the fabrication process of the emitter array with TSV holes, implementation of integrated ctive-matrix driver circuit, the bonding of these components, the construction of electron optics, and the overall operation in the exposure system including the correction of possible aberrations. The experimental results of this mask-less parallel pattern transfer are shown in terms of simple 1:1 projection and parallel lithography under an active-matrix drive scheme. Another application is the use of this emitter as an active electrode supplying highly reducing electrons into solutions. A very small amount of metal-salt solutions is dripped onto the nc-Si emitter surface, and the emitter is driven without using any counter electrodes. After the emitter operation, thin metal (Cu, Ni, Co, and so on) and elemental semiconductors (Si and Ge) films are uniformly deposited on the emitting surface. Spectroscopic surface and compositional analyses indicate that there are no significant contaminations in deposited thin films. The implication is that ballistic hot electrons injected into solutions with appropriate kinetic energies induce preferential reduction of positive ions in solutions with no by-products followed by atom migration, nuclei formation, and the subsequent thin film growth. The availability of this technique for depositing thin SiGe films is also demonstrated by using a mixture solution. When patterned fine emission windows are formed on the emitter surface, metal and semiconductor wires array are directly deposited in parallel.

  15. Search for signatures of magnetically-induced alignment in the arrival directions measured by the Pierre Auger Observatory

    NASA Astrophysics Data System (ADS)

    Pierre Auger Collaboration; Abreu, P.; Aglietta, M.; Ahn, E. J.; Albuquerque, I. F. M.; Allard, D.; Allekotte, I.; Allen, J.; Allison, P.; Alvarez Castillo, J.; Alvarez-Muñiz, J.; Ambrosio, M.; Aminaei, A.; Anchordoqui, L.; Andringa, S.; Anti?i?, T.; Anzalone, A.; Aramo, C.; Arganda, E.; Arqueros, F.; Asorey, H.; Assis, P.; Aublin, J.; Ave, M.; Avenier, M.; Avila, G.; Bäcker, T.; Balzer, M.; Barber, K. B.; Barbosa, A. F.; Bardenet, R.; Barroso, S. L. C.; Baughman, B.; Bäuml, J.; Beatty, J. J.; Becker, B. R.; Becker, K. H.; Bellétoile, A.; Bellido, J. A.; Benzvi, S.; Berat, C.; Bertou, X.; Biermann, P. L.; Billoir, P.; Blanco, F.; Blanco, M.; Bleve, C.; Blümer, H.; Bohá?ová, M.; Boncioli, D.; Bonifazi, C.; Bonino, R.; Borodai, N.; Brack, J.; Brogueira, P.; Brown, W. C.; Bruijn, R.; Buchholz, P.; Bueno, A.; Burton, R. E.; Caballero-Mora, K. S.; Caramete, L.; Caruso, R.; Castellina, A.; Catalano, O.; Cataldi, G.; Cazon, L.; Cester, R.; Chauvin, J.; Cheng, S. H.; Chiavassa, A.; Chinellato, J. A.; Chou, A.; Chudoba, J.; Clay, R. W.; Coluccia, M. R.; Conceição, R.; Contreras, F.; Cook, H.; Cooper, M. J.; Coppens, J.; Cordier, A.; Coutu, S.; Covault, C. E.; Creusot, A.; Criss, A.; Cronin, J.; Curutiu, A.; Dagoret-Campagne, S.; Dallier, R.; Dasso, S.; Daumiller, K.; Dawson, B. R.; de Almeida, R. M.; de Domenico, M.; de Donato, C.; de Jong, S. J.; de La Vega, G.; de Mello Junior, W. J. M.; de Mello Neto, J. R. T.; de Mitri, I.; de Souza, V.; de Vries, K. D.; Decerprit, G.; Del Peral, L.; Del Río, M.; Deligny, O.; Dembinski, H.; Dhital, N.; di Giulio, C.; Diaz, J. C.; Díaz Castro, M. L.; Diep, P. N.; Dobrigkeit, C.; Docters, W.; D'Olivo, J. C.; Dong, P. N.; Dorofeev, A.; Dos Anjos, J. C.; Dova, M. T.; D'Urso, D.; Dutan, I.; Ebr, J.; Engel, R.; Erdmann, M.; Escobar, C. O.; Espadanal, J.; Etchegoyen, A.; Facal San Luis, P.; Fajardo Tapia, I.; Falcke, H.; Farrar, G.; Fauth, A. C.; Fazzini, N.; Ferguson, A. P.; Ferrero, A.; Fick, B.; Filevich, A.; Filip?i?, A.; Fliescher, S.; Fracchiolla, C. E.; Fraenkel, E. D.; Fröhlich, U.; Fuchs, B.; Gaior, R.; Gamarra, R. F.; Gambetta, S.; García, B.; García Gámez, D.; Garcia-Pinto, D.; Gascon, A.; Gemmeke, H.; Gesterling, K.; Ghia, P. L.; Giaccari, U.; Giller, M.; Glass, H.; Gold, M. S.; Golup, G.; Gomez Albarracin, F.; Gómez Berisso, M.; Gonçalves, P.; Gonzalez, D.; Gonzalez, J. G.; Gookin, B.; Góra, D.; Gorgi, A.; Gouffon, P.; Gozzini, S. R.; Grashorn, E.; Grebe, S.; Griffith, N.; Grigat, M.; Grillo, A. F.; Guardincerri, Y.; Guarino, F.; Guedes, G. P.; Guzman, A.; Hague, J. D.; Hansen, P.; Harari, D.; Harmsma, S.; Harton, J. L.; Haungs, A.; Hebbeker, T.; Heck, D.; Herve, A. E.; Hojvat, C.; Hollon, N.; Holmes, V. C.; Homola, P.; Hörandel, J. R.; Horneffer, A.; Hrabovský, M.; Huege, T.; Insolia, A.; Ionita, F.; Italiano, A.; Jarne, C.; Jiraskova, S.; Josebachuili, M.; Kadija, K.; Kampert, K. H.; Karhan, P.; Kasper, P.; Kégl, B.; Keilhauer, B.; Keivani, A.; Kelley, J. L.; Kemp, E.; Kieckhafer, R. M.; Klages, H. O.; Kleifges, M.; Kleinfeller, J.; Knapp, J.; Koang, D.-H.; Kotera, K.; Krohm, N.; Krömer, O.; Kruppke-Hansen, D.; Kuehn, F.; Kuempel, D.; Kulbartz, J. K.; Kunka, N.; La Rosa, G.; Lachaud, C.; Lautridou, P.; Leão, M. S. A. B.; Lebrun, D.; Lebrun, P.; Leigui de Oliveira, M. A.; Lemiere, A.; Letessier-Selvon, A.; Lhenry-Yvon, I.; Link, K.; López, R.; Lopez Agüera, A.; Louedec, K.; Lozano Bahilo, J.; Lu, L.; Lucero, A.; Ludwig, M.; Lyberis, H.; Maccarone, M. C.; Macolino, C.; Maldera, S.; Mandat, D.; Mantsch, P.; Mariazzi, A. G.; Marin, J.; Marin, V.; Maris, I. C.; Marquez Falcon, H. R.; Marsella, G.; Martello, D.; Martin, L.; Martinez, H.; Martínez Bravo, O.; Mathes, H. J.; Matthews, J.; Matthews, J. A. J.; Matthiae, G.; Maurizio, D.; Mazur, P. O.; Medina-Tanco, G.; Melissas, M.; Melo, D.; Menichetti, E.; Menshikov, A.; Mertsch, P.; Meurer, C.; Mi?anovi?, S.; Micheletti, M. I.; Miller, W.; Miramonti, L.; Molina-Bueno, L.; Mollerach, S.; Monasor, M.; Monnier Ragaigne, D.; Montanet, F.; Morales, B.; Morello, C.; Moreno, E.; Moreno, J. C.; Morris, C.; Mostafá, M.; Moura, C. A.; Mueller, S.; Muller, M. A.; Müller, G.; Münchmeyer, M.; Mussa, R.; Navarra, G.; Navarro, J. L.; Navas, S.; Necesal, P.; Nellen, L.; Nelles, A.; Neuser, J.; Nhung, P. T.; Niemietz, L.; Nierstenhoefer, N.; Nitz, D.; Nosek, D.; Nožka, L.; Nyklicek, M.; Oehlschläger, J.; Olinto, A.; Oliva, P.; Olmos-Gilbaja, V. M.; Ortiz, M.; Pacheco, N.; Pakk Selmi-Dei, D.; Palatka, M.; Pallotta, J.; Palmieri, N.; Parente, G.; Parizot, E.; Parra, A.; Parsons, R. D.; Pastor, S.; Paul, T.; Pech, M.; Pe?ala, J.; Pelayo, R.; Pepe, I. M.; Perrone, L.; Pesce, R.; Petermann, E.; Petrera, S.; Petrinca, P.; Petrolini, A.; Petrov, Y.; Petrovic, J.; Pfendner, C.

    2012-01-01

    We present the results of an analysis of data recorded at the Pierre Auger Observatory in which we search for groups of directionally-aligned events (or 'multiplets') which exhibit a correlation between arrival direction and the inverse of the energy. These signatures are expected from sets of events coming from the same source after having been deflected by intervening coherent magnetic fields. The observation of several events from the same source would open the possibility to accurately reconstruct the position of the source and also measure the integral of the component of the magnetic field orthogonal to the trajectory of the cosmic rays. We describe the largest multiplets found and compute the probability that they appeared by chance from an isotropic distribution. We find no statistically significant evidence for the presence of multiplets arising from magnetic deflections in the present data.

  16. Fourier Analysis of Gamma-Ray Burst Light Curves: Searching for Direct Signature of Cosmological Time Dilation

    E-print Network

    Heon-Young Chang

    2001-07-17

    We study the power density spectrum (PDS) of light curves of the observed gamma-ray bursts (GRBs) to search for a direct signature for cosmological time dilation in the PDS statistics with the GRBs whose redshifts $z$'s are known. The anticorrelation of a timescale measure and a brightness measure is indirect evidence of its effect. On the other hand, we directly demonstrate that a time dilation effect can be seen in GRB light curves. We find that timescales tend to be shorter in bursts with small redshift, as expected from cosmological time-dilation effects, and we also find that there may be non-cosmological effects constituting to this correlation. We discuss its implication on interpretations of the PDS analysis results. We put forward another caution to this kind of analysis when we statistically exercise with GRBs whose $z$ is unknown.

  17. Search for signatures of magnetically-induced alignment in the arrival directions measured by the Pierre Auger Observatory

    SciTech Connect

    Abreu, P.; Aglietta, M.; Ahn, E.J.; Albuquerque, I.F.M.; Allard, D.; Allekotte, I.; Allen, J.; Allison, P.; Alvarez Castillo, J.; Alvarez-Muniz, J.; Ambrosio, M.; /Naples U. /INFN, Naples /Nijmegen U., IMAPP

    2011-11-01

    We present the results of an analysis of data recorded at the Pierre Auger Observatory in which we search for groups of directionally-aligned events (or ''multiplets'') which exhibit a correlation between arrival direction and the inverse of the energy. These signatures are expected from sets of events coming from the same source after having been deflected by intervening coherent magnetic fields. The observation of several events from the same source would open the possibility to accurately reconstruct the position of the source and also measure the integral of the component of the magnetic field orthogonal to the trajectory of the cosmic rays. We describe the largest multiplets found and compute the probability that they appeared by chance from an isotropic distribution. We find no statistically significant evidence for the presence of multiplets arising from magnetic deflections in the present data.

  18. 3-D magnetotelluric inversion including topography using deformed hexahedral edge finite elements and direct solvers parallelized on SMP computers - Part I: forward problem and parameter Jacobians

    NASA Astrophysics Data System (ADS)

    Kordy, M.; Wannamaker, P.; Maris, V.; Cherkaev, E.; Hill, G.

    2016-01-01

    We have developed an algorithm, which we call HexMT, for 3-D simulation and inversion of magnetotelluric (MT) responses using deformable hexahedral finite elements that permit incorporation of topography. Direct solvers parallelized on symmetric multiprocessor (SMP), single-chassis workstations with large RAM are used throughout, including the forward solution, parameter Jacobians and model parameter update. In Part I, the forward simulator and Jacobian calculations are presented. We use first-order edge elements to represent the secondary electric field (E), yielding accuracy O(h) for E and its curl (magnetic field). For very low frequencies or small material admittivities, the E-field requires divergence correction. With the help of Hodge decomposition, the correction may be applied in one step after the forward solution is calculated. This allows accurate E-field solutions in dielectric air. The system matrix factorization and source vector solutions are computed using the MKL PARDISO library, which shows good scalability through 24 processor cores. The factorized matrix is used to calculate the forward response as well as the Jacobians of electromagnetic (EM) field and MT responses using the reciprocity theorem. Comparison with other codes demonstrates accuracy of our forward calculations. We consider a popular conductive/resistive double brick structure, several synthetic topographic models and the natural topography of Mount Erebus in Antarctica. In particular, the ability of finite elements to represent smooth topographic slopes permits accurate simulation of refraction of EM waves normal to the slopes at high frequencies. Run-time tests of the parallelized algorithm indicate that for meshes as large as 176 × 176 × 70 elements, MT forward responses and Jacobians can be calculated in ˜1.5 hr per frequency. Together with an efficient inversion parameter step described in Part II, MT inversion problems of 200-300 stations are computable with total run times of several days on such workstations.

  19. Should ground-motion records be rotated to fault-normal/parallel or maximum direction for response history analysis of buildings?

    USGS Publications Warehouse

    Reyes, Juan C.; Kalkan, Erol

    2012-01-01

    In the United States, regulatory seismic codes (for example, California Building Code) require at least two sets of horizontal ground-motion components for three-dimensional (3D) response history analysis (RHA) of building structures. For sites within 5 kilometers (3.1 miles) of an active fault, these records should be rotated to fault-normal and fault-parallel (FN/FP) directions, and two RHAs should be performed separately—when FN and then FP direction are aligned with transverse direction of the building axes. This approach is assumed to lead to two sets of responses that envelope the range of possible responses over all nonredundant rotation angles. The validity of this assumption is examined here using 3D computer models of single-story structures having symmetric (torsionally stiff) and asymmetric (torsionally flexible) layouts subjected to an ensemble of near-fault ground motions with and without apparent velocity pulses. In this parametric study, the elastic vibration period is varied from 0.2 to 5 seconds, and yield-strength reduction factors, R, are varied from a value that leads to linear-elastic design to 3 and 5. Further validations are performed using 3D computer models of 9-story structures having symmetric and asymmetric layouts subjected to the same ground-motion set. The influence of the ground-motion rotation angle on several engineering demand parameters (EDPs) is examined in both linear-elastic and nonlinear-inelastic domains to form benchmarks for evaluating the use of the FN/FP directions and also the maximum direction (MD). The MD ground motion is a new definition for horizontal ground motions for use in site-specific ground-motion procedures for seismic design according to provisions of the American Society of Civil Engineers/Seismic Engineering Institute (ASCE/SEI) 7-10. The results of this study have important implications for current practice, suggesting that ground motions rotated to MD or FN/FP directions do not necessarily provide the most critical EDPs in nonlinear-inelastic domain; however, they tend to produce larger EDPs than as-recorded (arbitrarily oriented) motions.

  20. Impact of nucleon matrix element uncertainties on the interpretation of direct and indirect dark matter search results

    SciTech Connect

    Austri, R. Ruiz de

    2013-11-01

    We study in detail the impact of the current uncertainty in nucleon matrix elements on the sensitivity of direct and indirect experimental techniques for dark matter detection. We perform two scans in the framework of the cMSSM: one using recent values of the pion-sigma term obtained from Lattice QCD, and the other using values derived from experimental measurements. The two choices correspond to extreme values quoted in the literature and reflect the current tension between different ways of obtaining information about the structure of the nucleon. All other inputs in the scans, astrophysical and from particle physics, are kept unchanged. We use two experiments, XENON100 and IceCube, as benchmark cases to illustrate our case. We find that the interpretation of dark matter search results from direct detection experiments is more sensitive to the choice of the central values of the hadronic inputs than the results of indirect search experiments. The allowed regions of cMSSM parameter space after including XENON100 constraints strongly differ depending on the assumptions on the hadronic matrix elements used. On the other hand, the constraining potential of IceCube is almost independent of the choice of these values.

  1. Totally parallel multilevel algorithms

    NASA Technical Reports Server (NTRS)

    Frederickson, Paul O.

    1988-01-01

    Four totally parallel algorithms for the solution of a sparse linear system have common characteristics which become quite apparent when they are implemented on a highly parallel hypercube such as the CM2. These four algorithms are Parallel Superconvergent Multigrid (PSMG) of Frederickson and McBryan, Robust Multigrid (RMG) of Hackbusch, the FFT based Spectral Algorithm, and Parallel Cyclic Reduction. In fact, all four can be formulated as particular cases of the same totally parallel multilevel algorithm, which are referred to as TPMA. In certain cases the spectral radius of TPMA is zero, and it is recognized to be a direct algorithm. In many other cases the spectral radius, although not zero, is small enough that a single iteration per timestep keeps the local error within the required tolerance.

  2. Experiments on Direct Dark Matter Search with Two-phase Emission Detectors

    NASA Astrophysics Data System (ADS)

    Bolozdynya, A. I.

    Emission detectors, invented 45 years ago in MEPhI, found their unique application in modern experiments searching for cold dark matter in the form of weakly ionizing massive particles (WIMPs). The current best limits for the interaction cross sections of supersymmetric WIMPs having a mass of 100 GeV/c2 with nucleons were measured with emission detector LUX containing 360 kg of liquid xenon as detector medium installed in Davis' cave at Homestake mine in South Dakota. Emission detectors of the next generation G2, with an active detector mass of about 10 tons, will either unambiguously detect WIMPs or rule out all current theoretical predictions for WIMP existence. Detectors of the G3 generation will be used for multiple purposes including detection of double beta neutrinoless decay and low-energy neutrinos

  3. A Search for New Directions in the War Against Poverty. Staff Paper.

    ERIC Educational Resources Information Center

    Sheppard, Harold L.

    Demographic surveys and data could be used to assess programs and policies directly and indirectly concerned with the reduction of poverty, and, through the use of such survey data, to point to a number of population subgroupings which are or are not moving out of poverty. Annually collected Census Bureau facts, the basis of much of the analysis…

  4. Debris Flows in Direct Dark Matter Searches-The modulation effect

    E-print Network

    J. D. Vergados

    2012-05-17

    The effect of some possible non standard WIMP velocity distributions, like the Debris Flows recently proposed, on the direct dark matter detection rates is investigated. We find that such distributions may be deciphered from the data, especially if the time variation of the event rates due to the annual motion of the Earth is observed

  5. Parallel rendering

    NASA Technical Reports Server (NTRS)

    Crockett, Thomas W.

    1995-01-01

    This article provides a broad introduction to the subject of parallel rendering, encompassing both hardware and software systems. The focus is on the underlying concepts and the issues which arise in the design of parallel rendering algorithms and systems. We examine the different types of parallelism and how they can be applied in rendering applications. Concepts from parallel computing, such as data decomposition, task granularity, scalability, and load balancing, are considered in relation to the rendering problem. We also explore concepts from computer graphics, such as coherence and projection, which have a significant impact on the structure of parallel rendering algorithms. Our survey covers a number of practical considerations as well, including the choice of architectural platform, communication and memory requirements, and the problem of image assembly and display. We illustrate the discussion with numerous examples from the parallel rendering literature, representing most of the principal rendering methods currently used in computer graphics.

  6. Searches for Anisotropies in the Arrival Directions of the Highest Energy Cosmic Rays Detected by the Pierre Auger Observatory

    NASA Astrophysics Data System (ADS)

    Aab, A.; Abreu, P.; Aglietta, M.; Ahn, E. J.; Samarai, I. Al; Albuquerque, I. F. M.; Allekotte, I.; Allen, J.; Allison, P.; Almela, A.; Alvarez Castillo, J.; Alvarez-Muñiz, J.; Alves Batista, R.; Ambrosio, M.; Aminaei, A.; Anchordoqui, L.; Andringa, S.; Aramo, C.; Aranda, V. M.; Arqueros, F.; Asorey, H.; Assis, P.; Aublin, J.; Ave, M.; Avenier, M.; Avila, G.; Awal, N.; Badescu, A. M.; Barber, K. B.; Bäuml, J.; Baus, C.; Beatty, J. J.; Becker, K. H.; Bellido, J. A.; Berat, C.; Bertaina, M. E.; Bertou, X.; Biermann, P. L.; Billoir, P.; Blaess, S. G.; Blanco, M.; Bleve, C.; Blümer, H.; Bohá?ová, M.; Boncioli, D.; Bonifazi, C.; Bonino, R.; Borodai, N.; Brack, J.; Brancus, I.; Bridgeman, A.; Brogueira, P.; Brown, W. C.; Buchholz, P.; Bueno, A.; Buitink, S.; Buscemi, M.; Caballero-Mora, K. S.; Caccianiga, B.; Caccianiga, L.; Candusso, M.; Caramete, L.; Caruso, R.; Castellina, A.; Cataldi, G.; Cazon, L.; Cester, R.; Chavez, A. G.; Chiavassa, A.; Chinellato, J. A.; Chudoba, J.; Cilmo, M.; Clay, R. W.; Cocciolo, G.; Colalillo, R.; Coleman, A.; Collica, L.; Coluccia, M. R.; Conceição, R.; Contreras, F.; Cooper, M. J.; Cordier, A.; Coutu, S.; Covault, C. E.; Cronin, J.; Curutiu, A.; Dallier, R.; Daniel, B.; Dasso, S.; Daumiller, K.; Dawson, B. R.; de Almeida, R. M.; De Domenico, M.; de Jong, S. J.; de Mello Neto, J. R. T.; De Mitri, I.; de Oliveira, J.; de Souza, V.; del Peral, L.; Deligny, O.; Dembinski, H.; Dhital, N.; Di Giulio, C.; Di Matteo, A.; Diaz, J. C.; Díaz Castro, M. L.; Diogo, F.; Dobrigkeit, C.; Docters, W.; D'Olivo, J. C.; Dorofeev, A.; Dorosti Hasankiadeh, Q.; Dova, M. T.; Ebr, J.; Engel, R.; Erdmann, M.; Erfani, M.; Escobar, C. O.; Espadanal, J.; Etchegoyen, A.; Facal San Luis, P.; Falcke, H.; Fang, K.; Farrar, G.; Fauth, A. C.; Fazzini, N.; Ferguson, A. P.; Fernandes, M.; Fick, B.; Figueira, J. M.; Filevich, A.; Filip?i?, A.; Fox, B. D.; Fratu, O.; Freire, M. M.; Fröhlich, U.; Fuchs, B.; Fujii, T.; Gaior, R.; García, B.; Garcia-Gamez, D.; Garcia-Pinto, D.; Garilli, G.; Gascon Bravo, A.; Gate, F.; Gemmeke, H.; Ghia, P. L.; Giaccari, U.; Giammarchi, M.; Giller, M.; Glaser, C.; Glass, H.; Gómez Berisso, M.; Gómez Vitale, P. F.; Gonçalves, P.; Gonzalez, J. G.; González, N.; Gookin, B.; Gordon, J.; Gorgi, A.; Gorham, P.; Gouffon, P.; Grebe, S.; Griffith, N.; Grillo, A. F.; Grubb, T. D.; Guarino, F.; Guedes, G. P.; Hampel, M. R.; Hansen, P.; Harari, D.; Harrison, T. A.; Hartmann, S.; Harton, J. L.; Haungs, A.; Hebbeker, T.; Heck, D.; Heimann, P.; Herve, A. E.; Hill, G. C.; Hojvat, C.; Hollon, N.; Holt, E.; Homola, P.; Hörandel, J. R.; Horvath, P.; Hrabovský, M.; Huber, D.; Huege, T.; Insolia, A.; Isar, P. G.; Jandt, I.; Jansen, S.; Jarne, C.; Josebachuili, M.; Kääpä, A.; Kambeitz, O.; Kampert, K. H.; Kasper, P.; Katkov, I.; Kégl, B.; Keilhauer, B.; Keivani, A.; Kemp, E.; Kieckhafer, R. M.; Klages, H. O.; Kleifges, M.; Kleinfeller, J.; Krause, R.; Krohm, N.; Krömer, O.; Kruppke-Hansen, D.; Kuempel, D.; Kunka, N.; LaHurd, D.; Latronico, L.; Lauer, R.; Lauscher, M.; Lautridou, P.; Le Coz, S.; Leão, M. S. A. B.; Lebrun, D.; Lebrun, P.; Leigui de Oliveira, M. A.; Letessier-Selvon, A.; Lhenry-Yvon, I.; Link, K.; López, R.; Louedec, K.; Lozano Bahilo, J.; Lu, L.; Lucero, A.; Ludwig, M.; Malacari, M.; Maldera, S.; Mallamaci, M.; Maller, J.; Mandat, D.; Mantsch, P.; Mariazzi, A. G.; Marin, V.; Mari?, I. C.; Marsella, G.; Martello, D.; Martin, L.; Martinez, H.; Martínez Bravo, O.; Martraire, D.; Masías Meza, J. J.; Mathes, H. J.; Mathys, S.; Matthews, J.; Matthews, J. A. J.; Matthiae, G.; Maurel, D.; Maurizio, D.; Mayotte, E.; Mazur, P. O.; Medina, C.; Medina-Tanco, G.; Meissner, R.; Melissas, M.; Melo, D.; Menshikov, A.; Messina, S.; Meyhandan, R.; Mi?anovi?, S.; Micheletti, M. I.; Middendorf, L.; Minaya, I. A.; Miramonti, L.; Mitrica, B.; Molina-Bueno, L.; Mollerach, S.; Monasor, M.; Monnier Ragaigne, D.; Montanet, F.; Morello, C.; Mostafá, M.; Moura, C. A.; Muller, M. A.; Müller, G.; Müller, S.; Münchmeyer, M.; Mussa, R.; Navarra, G.; Navas, S.; Necesal, P.; Nellen, L.; Nelles, A.; Neuser, J.; Nguyen, P. H.; Niechciol, M.; Niemietz, L.; Niggemann, T.; Nitz, D.; Nosek, D.; Novotny, V.; Nožka, L.; Ochilo, L.; Oikonomou, F.; Olinto, A.; Oliveira, M.; Pacheco, N.; Pakk Selmi-Dei, D.; Palatka, M.; Pallotta, J.; Palmieri, N.; Papenbreer, P.; Parente, G.; Parra, A.; Paul, T.; Pech, M.; P?kala, J.; Pelayo, R.; Pepe, I. M.; Perrone, L.; Petermann, E.; Peters, C.; Petrera, S.; Petrov, Y.; Phuntsok, J.; Piegaia, R.; Pierog, T.; Pieroni, P.; Pimenta, M.; Pirronello, V.; Platino, M.; Plum, M.; Porcelli, A.; Porowski, C.; Prado, R. R.; Privitera, P.; Prouza, M.; Purrello, V.; Quel, E. J.; Querchfeld, S.; Quinn, S.; Rautenberg, J.; Ravel, O.; Ravignani, D.; Revenu, B.

    2015-05-01

    We analyze the distribution of arrival directions of ultra-high-energy cosmic rays recorded at the Pierre Auger Observatory in 10 years of operation. The data set, about three times larger than that used in earlier studies, includes arrival directions with zenith angles up to 80°, thus covering from -90{}^\\circ to +45{}^\\circ in declination. After updating the fraction of events correlating with the active galactic nuclei (AGNs) in the Véron-Cetty and Véron catalog, we subject the arrival directions of the data with energies in excess of 40 EeV to different tests for anisotropy. We search for localized excess fluxes, self-clustering of event directions at angular scales up to 30°, and different threshold energies between 40 and 80 EeV. We then look for correlations of cosmic rays with celestial structures both in the Galaxy (the Galactic Center and Galactic Plane) and in the local universe (the Super-Galactic Plane). We also examine their correlation with different populations of nearby extragalactic objects: galaxies in the 2MRS catalog, AGNs detected by Swift-BAT, radio galaxies with jets, and the Centaurus A (Cen A) galaxy. None of the tests show statistically significant evidence of anisotropy. The strongest departures from isotropy (post-trial probability ˜ 1.4%) are obtained for cosmic rays with E\\gt 58 EeV in rather large windows around Swift AGNs closer than 130 Mpc and brighter than 1044 erg s-1 (18° radius), and around the direction of Cen A (15° radius).

  7. Searches for anisotropies in the arrival directions of the highest energy cosmic rays detected by the Pierre Auger Observatory

    SciTech Connect

    Aab, A.; Abreu, P.; Aglietta, M.; Ahn, E. J.; Samarai, I. Al; Albuquerque, I. F. M.; Allekotte, I.; Allen, J.; Allison, P.; Almela, A.; Castillo, J. Alvarez; Alvarez-Muñiz, J.; Batista, R. Alves; Ambrosio, M.; Aminaei, A.; Anchordoqui, L.; Andringa, S.; Aramo, C.; Aranda, V. M.; Arqueros, F.; Asorey, H.; Assis, P.; Aublin, J.; Ave, M.; Avenier, M.; Avila, G.; Awal, N.; Badescu, A. M.; Barber, K. B.; Bäuml, J.; Baus, C.; Beatty, J. J.; Becker, K. H.; Bellido, J. A.; Berat, C.; Bertaina, M. E.; Bertou, X.; Biermann, P. L.; Billoir, P.; Blaess, S. G.; Blanco, M.; Bleve, C.; Blümer, H.; Bohá?ová, M.; Boncioli, D.; Bonifazi, C.; Bonino, R.; Borodai, N.; Brack, J.; Brancus, I.; Bridgeman, A.; Brogueira, P.; Brown, W. C.; Buchholz, P.; Bueno, A.; Buitink, S.; Buscemi, M.; Caballero-Mora, K. S.; Caccianiga, B.; Caccianiga, L.; Candusso, M.; Caramete, L.; Caruso, R.; Castellina, A.; Cataldi, G.; Cazon, L.; Cester, R.; Chavez, A. G.; Chiavassa, A.; Chinellato, J. A.; Chudoba, J.; Cilmo, M.; Clay, R. W.; Cocciolo, G.; Colalillo, R.; Coleman, A.; Collica, L.; Coluccia, M. R.; Conceição, R.; Contreras, F.; Cooper, M. J.; Cordier, A.; Coutu, S.; Covault, C. E.; Cronin, J.; Curutiu, A.; Dallier, R.; Daniel, B.; Dasso, S.; Daumiller, K.; Dawson, B. R.; Almeida, R. M. de; Domenico, M. De; Jong, S. J. de; Neto, J. R. T. de Mello; Mitri, I. De; Oliveira, J. de; Souza, V. de; Peral, L. del; Deligny, O.; Dembinski, H.; Dhital, N.; Giulio, C. Di; Matteo, A. Di; Diaz, J. C.; Castro, M. L. Díaz; Diogo, F.; Dobrigkeit, C.; Docters, W.; D’Olivo, J. C.; Dorofeev, A.; Hasankiadeh, Q. Dorosti; Dova, M. T.; Ebr, J.; Engel, R.; Erdmann, M.; Erfani, M.; Escobar, C. O.; Espadanal, J.; Etchegoyen, A.; Luis, P. Facal San; Falcke, H.; Fang, K.; Farrar, G.; Fauth, A. C.; Fazzini, N.; Ferguson, A. P.; Fernandes, M.; Fick, B.; Figueira, J. M.; Filevich, A.; Filip?i?, A.; Fox, B. D.; Fratu, O.; Freire, M. M.; Fröhlich, U.; Fuchs, B.; Fujii, T.; Gaior, R.; García, B.; Gamez, D. Garcia-; Pinto, D. Garcia-; Garilli, G.; Bravo, A. Gascon; Gate, F.; Gemmeke, H.; Ghia, P. L.; Giaccari, U.; Giammarchi, M.; Giller, M.; Glaser, C.; Glass, H.; Berisso, M. Gómez; Vitale, P. F. Gómez; Gonçalves, P.; Gonzalez, J. G.; González, N.; Gookin, B.; Gordon, J.; Gorgi, A.; Gorham, P.; Gouffon, P.; Grebe, S.; Griffith, N.; Grillo, A. F.; Grubb, T. D.; Guarino, F.; Guedes, G. P.; Hampel, M. R.; Hansen, P.; Harari, D.; Harrison, T. A.; Hartmann, S.; Harton, J. L.; Haungs, A.; Hebbeker, T.; Heck, D.; Heimann, P.; Herve, A. E.; Hill, G. C.; Hojvat, C.; Hollon, N.; Holt, E.; Homola, P.; Hörandel, J. R.; Horvath, P.; Hrabovský, M.; Huber, D.; Huege, T.; Insolia, A.; Isar, P. G.; Jandt, I.; Jansen, S.; Jarne, C.; Josebachuili, M.; Kääpä, A.; Kambeitz, O.; Kampert, K. H.; Kasper, P.; Katkov, I.; Kégl, B.; Keilhauer, B.; Keivani, A.; Kemp, E.; Kieckhafer, R. M.; Klages, H. O.; Kleifges, M.; Kleinfeller, J.; Krause, R.; Krohm, N.; Krömer, O.; Hansen, D. Kruppke-; Kuempel, D.; Kunka, N.; LaHurd, D.; Latronico, L.; Lauer, R.; Lauscher, M.; Lautridou, P.; Coz, S. Le; Leão, M. S. A. B.; Lebrun, D.; Lebrun, P.; Leigui de Oliveira, M. A.; Letessier-Selvon, A.; Lhenry-Yvon, I.; Link, K.; López, R.; Louedec, K.; Bahilo, J. Lozano; Lu, L.; Lucero, A.; Ludwig, M.; Malacari, M.; Maldera, S.; Mallamaci, M.; Maller, J.; Mandat, D.; Mantsch, P.; Mariazzi, A. G.; Marin, V.; Mari?, I. C.; Marsella, G.; Martello, D.; Martin, L.; Martinez, H.; Bravo, O. Martínez; Martraire, D.; Meza, J. J. Masías; Mathes, H. J.; Mathys, S.; Matthews, J.; Matthews, J. A. J.; Matthiae, G.; Maurel, D.; Maurizio, D.; Mayotte, E.; Mazur, P. O.; Medina, C.; Tanco, G. Medina-; Meissner, R.; Melissas, M.; Melo, D.; Menshikov, A.; Messina, S.; Meyhandan, R.; Mi?anovi?, S.; Micheletti, M. I.; Middendorf, L.; Minaya, I. A.; Miramonti, L.; Mitrica, B.; Bueno, L. Molina-; Mollerach, S.; Monasor, M.; Ragaigne, D. Monnier; Montanet, F.; Morello, C.; Mostafá, M.; Moura, C. A.; Muller, M. A.; Müller, G.; Müller, S.; Münchmeyer, M.; Mussa, R.; Navarra, G.; Navas, S.; Necesal, P.; Nellen, L.; Nelles, A.; Neuser, J.; Nguyen, P. H.; Niechciol, M.; Niemietz, L.; Niggemann, T.; Nitz, D.; Nosek, D.; Novotny, V.; Nožka, L.; Ochilo, L.; Oikonomou, F.; Olinto, A.; Oliveira, M.; Pacheco, N.; Dei, D. Pakk Selmi-; Palatka, M.; Pallotta, J.; Palmieri, N.; Papenbreer, P.; Parente, G.; Parra, A.; Paul, T.; Pech, M.; P?kala, J.; Pelayo, R.; Pepe, I. M.; Perrone, L.; Petermann, E.; Peters, C.; Petrera, S.; Petrov, Y.; Phuntsok, J.; Piegaia, R.; Pierog, T.; Pieroni, P.; Pimenta, M.; Pirronello, V.; Platino, M.; Plum, M.; Porcelli, A.; Porowski, C.; Prado, R. R.; Privitera, P.; Prouza, M.; Purrello, V.; Quel, E. J.; Querchfeld, S.; Quinn, S.; Rautenberg, J.; Ravel, O.; Ravignani, D.

    2015-04-24

    In this study, we analyze the distribution of arrival directions of ultra-high-energy cosmic rays recorded at the Pierre Auger Observatory in 10 years of operation. The data set, about three times larger than that used in earlier studies, includes arrival directions with zenith angles up to 80°, thus covering from $-90{}^\\circ $ to $+45{}^\\circ $ in declination. After updating the fraction of events correlating with the active galactic nuclei (AGNs) in the Véron-Cetty and Véron catalog, we subject the arrival directions of the data with energies in excess of 40 EeV to different tests for anisotropy. We search for localized excess fluxes, self-clustering of event directions at angular scales up to 30°, and different threshold energies between 40 and 80 EeV. We then look for correlations of cosmic rays with celestial structures both in the Galaxy (the Galactic Center and Galactic Plane) and in the local universe (the Super-Galactic Plane). We also examine their correlation with different populations of nearby extragalactic objects: galaxies in the 2MRS catalog, AGNs detected by Swift-BAT, radio galaxies with jets, and the Centaurus A (Cen A) galaxy. None of the tests show statistically significant evidence of anisotropy. The strongest departures from isotropy (post-trial probability $\\sim 1.4$%) are obtained for cosmic rays with $E\\gt 58$ EeV in rather large windows around Swift AGNs closer than 130 Mpc and brighter than 1044 erg/s (18° radius), and around the direction of Centaurus A (15° radius).

  8. Searches for anisotropies in the arrival directions of the highest energy cosmic rays detected by the Pierre Auger Observatory

    DOE PAGESBeta

    Aab, A.; Abreu, P.; Aglietta, M.; Ahn, E. J.; Samarai, I. Al; Albuquerque, I. F. M.; Allekotte, I.; Allen, J.; Allison, P.; Almela, A.; et al

    2015-04-24

    In this study, we analyze the distribution of arrival directions of ultra-high-energy cosmic rays recorded at the Pierre Auger Observatory in 10 years of operation. The data set, about three times larger than that used in earlier studies, includes arrival directions with zenith angles up to 80°, thus covering from $-90{}^\\circ $ to $+45{}^\\circ $ in declination. After updating the fraction of events correlating with the active galactic nuclei (AGNs) in the Véron-Cetty and Véron catalog, we subject the arrival directions of the data with energies in excess of 40 EeV to different tests for anisotropy. We search for localizedmore »excess fluxes, self-clustering of event directions at angular scales up to 30°, and different threshold energies between 40 and 80 EeV. We then look for correlations of cosmic rays with celestial structures both in the Galaxy (the Galactic Center and Galactic Plane) and in the local universe (the Super-Galactic Plane). We also examine their correlation with different populations of nearby extragalactic objects: galaxies in the 2MRS catalog, AGNs detected by Swift-BAT, radio galaxies with jets, and the Centaurus A (Cen A) galaxy. None of the tests show statistically significant evidence of anisotropy. The strongest departures from isotropy (post-trial probability $\\sim 1.4$%) are obtained for cosmic rays with $E\\gt 58$ EeV in rather large windows around Swift AGNs closer than 130 Mpc and brighter than 1044 erg/s (18° radius), and around the direction of Centaurus A (15° radius).« less

  9. Measurement and modeling of muon-induced neutrons in LSM in application for direct dark matter searches

    SciTech Connect

    Kozlov, Valentin; Collaboration: EDELWEISS Collaboration

    2013-08-08

    Due to a very low event rate expected in direct dark matter search experiments, a good understanding of every background component is crucial. Muon-induced neutrons constitute a prominent background, since neutrons lead to nuclear recoils and thus can mimic a potential dark matter signal. EDELWEISS is a Ge-bolometer experiment searching for WIMP dark matter. It is located in the Laboratoire Souterrain de Modane (LSM, France). We have measured muon-induced neutrons by means of a neutron counter based on Gd-loaded liquid scintillator. Studies of muon-induced neutrons are presented and include development of the appropriate MC model based on Geant4 and analysis of a 1000-days measurement campaign in LSM. We find a good agreement between measured rates of muon-induced neutrons and those predicted by the developed model with full event topology. The impact of the neutron background on current EDELWEISS data-taking as well as for next generation experiments such as EURECA is briefly discussed.

  10. Directed searches for continuous gravitational waves from binary systems: Parameter-space metrics and optimal Scorpius X-1 sensitivity

    NASA Astrophysics Data System (ADS)

    Leaci, Paola; Prix, Reinhard

    2015-05-01

    We derive simple analytic expressions for the (coherent and semicoherent) phase metrics of continuous-wave sources in low-eccentricity binary systems for the two regimes of long and short segments compared to the orbital period. The resulting expressions correct and extend previous results found in the literature. We present results of extensive Monte Carlo studies comparing metric mismatch predictions against the measured loss of detection statistics for binary parameter offsets. The agreement is generally found to be within ˜10 %- 30 % . For an application of the metric template expressions, we estimate the optimal achievable sensitivity of an Einstein@Home directed search for Scorpius X-1, under the assumption of sufficiently small spin wandering. We find that such a search, using data from the upcoming advanced detectors, would be able to beat the torque-balance level [R. V. Wagoner, Astrophys. J. 278, 345 (1984); L. Bildsten, Astrophys. J. 501, L89 (1998).] up to a frequency of ˜500 - 600 Hz , if orbital eccentricity is well constrained, and up to a frequency of ˜160 - 200 Hz for more conservative assumptions about the uncertainty on orbital eccentricity.

  11. Direct constraints on diffusion models from cosmic-ray positron data: Excluding the Minimal model for dark matter searches

    E-print Network

    Julien Lavalle; David Maurin; Antje Putze

    2015-01-22

    Galactic Cosmic-ray (CR) transport parameters are usually constrained by the boron-to-carbon ratio. This procedure is generically plagued with degeneracies between the diffusion coefficient and the vertical extent of the Galactic magnetic halo. The latter is of paramount importance for indirect dark matter (DM) searches, because it fixes the amount of DM annihilation or decay that contributes to the local antimatter CR flux. These degeneracies could be broken by using secondary radioactive species, but the current data still have large error bars, and this method is extremely sensitive to the very local interstellar medium (ISM) properties. Here, we propose to use the low-energy CR positrons in the GeV range as another direct constraint on diffusion models. We show that the PAMELA data disfavor small diffusion halo ($L\\lesssim 3$ kpc) and large diffusion slope models, and exclude the minimal ({\\em min}) configuration (Maurin et al. 2001, Donato et al. 2004) widely used in the literature to bracket the uncertainties in the DM signal predictions. This is complementary to indirect constraints (diffuse radio and gamma-ray emissions) and has strong impact on DM searches. Indeed this makes the antiproton constraints more robust while enhancing the discovery/exclusion potential of current and future experiments, like AMS-02 and GAPS, especially in the antiproton and antideuteron channels.

  12. Automatic Multilevel Parallelization Using OpenMP

    NASA Technical Reports Server (NTRS)

    Jin, Hao-Qiang; Jost, Gabriele; Yan, Jerry; Ayguade, Eduard; Gonzalez, Marc; Martorell, Xavier; Biegel, Bryan (Technical Monitor)

    2002-01-01

    In this paper we describe the extension of the CAPO (CAPtools (Computer Aided Parallelization Toolkit) OpenMP) parallelization support tool to support multilevel parallelism based on OpenMP directives. CAPO generates OpenMP directives with extensions supported by the NanosCompiler to allow for directive nesting and definition of thread groups. We report some results for several benchmark codes and one full application that have been parallelized using our system.

  13. Future directions in the microwave cavity search for dark matter axions

    NASA Astrophysics Data System (ADS)

    Shokair, T. M.; Root, J.; van Bibber, K. A.; Brubaker, B.; Gurevich, Y. V.; Cahn, S. B.; Lamoreaux, S. K.; Anil, M. A.; Lehnert, K. W.; Mitchell, B. K.; Reed, A.; Carosi, G.

    2014-07-01

    The axion is a light pseudoscalar particle which suppresses CP-violating effects in strong interactions and also happens to be an excellent dark matter candidate. Axions constituting the dark matter halo of our galaxy may be detected by their resonant conversion to photons in a microwave cavity permeated by a magnetic field. The current generation of the microwave cavity experiment has demonstrated sensitivity to plausible axion models, and upgrades in progress should achieve the sensitivity required for a definitive search, at least for low mass axions. However, a comprehensive strategy for scanning the entire mass range, from 1-1000 ?eV, will require significant technological advances to maintain the needed sensitivity at higher frequencies. Such advances could include sub-quantum-limited amplifiers based on squeezed vacuum states, bolometers, and/or superconducting microwave cavities. The Axion Dark Matter eXperiment at High Frequencies (ADMX-HF) represents both a pathfinder for first data in the 20-100 ?eV range ( 5-25 GHz), and an innovation test-bed for these concepts.

  14. Searches for Direct CP Violation in D+ Decays And for D0 Anti-D0 Mixing

    SciTech Connect

    Purohit, M.V.; /South Carolina U.

    2005-10-11

    The authors present preliminary results of a search for direct CP violation in D{sup +} {yields} K{sup +}K{sup -} {pi}{sup +} decays using 87 fb{sup -1} of data acquired by the Babar experiment running on and near the {Upsilon}(4S) from 1999-2002. The authors report the asymmetries in the signal mode and in the main resonant subchannels. Based on the same dataset, they also report a new 90% CL upper limit of 0.0042 on the rate of D{sup 0}-{bar D}{sup 0} mixing using the decay modes D*{sup +} {yields} D{sup 0}{pi}{sup +}, D{sup 0} {yields} [K/K*]ev (+c.c.).

  15. ATLAS Run 1 searches for direct pair production of third-generation squarks at the Large Hadron Collider

    NASA Astrophysics Data System (ADS)

    Aad, G.; Abbott, B.; Abdallah, J.; Abdinov, O.; Aben, R.; Abolins, M.; AbouZeid, O. S.; Abramowicz, H.; Abreu, H.; Abreu, R.; Abulaiti, Y.; Acharya, B. S.; Adamczyk, L.; Adams, D. L.; Adelman, J.; Adomeit, S.; Adye, T.; Affolder, A. A.; Agatonovic-Jovin, T.; Agricola, J.; Aguilar-Saavedra, J. A.; Ahlen, S. P.; Ahmadov, F.; Aielli, G.; Akerstedt, H.; Åkesson, T. P. A.; Akimov, A. V.; Alberghi, G. L.; Albert, J.; Albrand, S.; Alconada Verzini, M. J.; Aleksa, M.; Aleksandrov, I. N.; Alexa, C.; Alexander, G.; Alexopoulos, T.; Alhroob, M.; Alimonti, G.; Alio, L.; Alison, J.; Alkire, S. P.; Allbrooke, B. M. M.; Allport, P. P.; Aloisio, A.; Alonso, A.; Alonso, F.; Alpigiani, C.; Altheimer, A.; Alvarez Gonzalez, B.; Álvarez Piqueras, D.; Alviggi, M. G.; Amadio, B. T.; Amako, K.; Amaral Coutinho, Y.; Amelung, C.; Amidei, D.; Amor Dos Santos, S. P.; Amorim, A.; Amoroso, S.; Amram, N.; Amundsen, G.; Anastopoulos, C.; Ancu, L. S.; Andari, N.; Andeen, T.; Anders, C. F.; Anders, G.; Anders, J. K.; Anderson, K. J.; Andreazza, A.; Andrei, V.; Angelidakis, S.; Angelozzi, I.; Anger, P.; Angerami, A.; Anghinolfi, F.; Anisenkov, A. V.; Anjos, N.; Annovi, A.; Antonelli, M.; Antonov, A.; Antos, J.; Anulli, F.; Aoki, M.; Aperio Bella, L.; Arabidze, G.; Arai, Y.; Araque, J. P.; Arce, A. T. H.; Arduh, F. A.; Arguin, J.-F.; Argyropoulos, S.; Arik, M.; Armbruster, A. J.; Arnaez, O.; Arnal, V.; Arnold, H.; Arratia, M.; Arslan, O.; Artamonov, A.; Artoni, G.; Asai, S.; Asbah, N.; Ashkenazi, A.; Åsman, B.; Asquith, L.; Assamagan, K.; Astalos, R.; Atkinson, M.; Atlay, N. B.; Auerbach, B.; Augsten, K.; Aurousseau, M.; Avolio, G.; Axen, B.; Ayoub, M. K.; Azuelos, G.; Baak, M. A.; Baas, A. E.; Baca, M. J.; Bacci, C.; Bachacou, H.; Bachas, K.; Backes, M.; Backhaus, M.; Bagiacchi, P.; Bagnaia, P.; Bai, Y.; Bain, T.; Baines, J. T.; Baker, O. K.; Baldin, E. M.; Balek, P.; Balestri, T.; Balli, F.; Banas, E.; Banerjee, Sw.; Bannoura, A. A. E.; Bansil, H. S.; Barak, L.; Barberio, E. L.; Barberis, D.; Barbero, M.; Barillari, T.; Barisonzi, M.; Barklow, T.; Barlow, N.; Barnes, S. L.; Barnett, B. M.; Barnett, R. M.; Barnovska, Z.; Baroncelli, A.; Barone, G.; Barr, A. J.; Barreiro, F.; Barreiro Guimarães da Costa, J.; Bartoldus, R.; Barton, A. E.; Bartos, P.; Basalaev, A.; Bassalat, A.; Basye, A.; Bates, R. L.; Batista, S. J.; Batley, J. R.; Battaglia, M.; Bauce, M.; Bauer, F.; Bawa, H. S.; Beacham, J. B.; Beattie, M. D.; Beau, T.; Beauchemin, P. H.; Beccherle, R.; Bechtle, P.; Beck, H. P.; Becker, K.; Becker, M.; Becker, S.; Beckingham, M.; Becot, C.; Beddall, A. J.; Beddall, A.; Bednyakov, V. A.; Bee, C. P.; Beemster, L. J.; Beermann, T. A.; Begel, M.; Behr, J. K.; Belanger-Champagne, C.; Bell, W. H.; Bella, G.; Bellagamba, L.; Bellerive, A.; Bellomo, M.; Belotskiy, K.; Beltramello, O.; Benary, O.; Benchekroun, D.; Bender, M.; Bendtz, K.; Benekos, N.; Benhammou, Y.; Benhar Noccioli, E.; Benitez Garcia, J. A.; Benjamin, D. P.; Bensinger, J. R.; Bentvelsen, S.; Beresford, L.; Beretta, M.; Berge, D.; Bergeaas Kuutmann, E.; Berger, N.; Berghaus, F.; Beringer, J.; Bernard, C.; Bernard, N. R.; Bernius, C.; Bernlochner, F. U.; Berry, T.; Berta, P.; Bertella, C.; Bertoli, G.; Bertolucci, F.; Bertsche, C.; Bertsche, D.; Besana, M. I.; Besjes, G. J.; Bessidskaia Bylund, O.; Bessner, M.; Besson, N.; Betancourt, C.; Bethke, S.; Bevan, A. J.; Bhimji, W.; Bianchi, R. M.; Bianchini, L.; Bianco, M.; Biebel, O.; Biedermann, D.; Bieniek, S. P.; Biglietti, M.; Bilbao De Mendizabal, J.; Bilokon, H.; Bindi, M.; Binet, S.; Bingul, A.; Bini, C.; Biondi, S.; Black, C. W.; Black, J. E.; Black, K. M.; Blackburn, D.; Blair, R. E.; Blanchard, J.-B.; Blanco, J. E.; Blazek, T.; Bloch, I.; Blocker, C.; Blum, W.; Blumenschein, U.; Bobbink, G. J.; Bobrovnikov, V. S.; Bocchetta, S. S.; Bocci, A.; Bock, C.; Boehler, M.; Bogaerts, J. A.; Bogavac, D.; Bogdanchikov, A. G.; Bohm, C.; Boisvert, V.; Bold, T.; Boldea, V.; Boldyrev, A. S.; Bomben, M.; Bona, M.; Boonekamp, M.; Borisov, A.; Borissov, G.; Borroni, S.; Bortfeldt, J.; Bortolotto, V.; Bos, K.; Boscherini, D.; Bosman, M.; Boudreau, J.; Bouffard, J.; Bouhova-Thacker, E. V.; Boumediene, D.; Bourdarios, C.; Bousson, N.; Boveia, A.; Boyd, J.; Boyko, I. R.; Bozic, I.; Bracinik, J.; Brandt, A.; Brandt, G.; Brandt, O.; Bratzler, U.; Brau, B.; Brau, J. E.; Braun, H. M.; Brazzale, S. F.; Breaden Madden, W. D.; Brendlinger, K.; Brennan, A. J.; Brenner, L.; Brenner, R.; Bressler, S.; Bristow, K.; Bristow, T. M.; Britton, D.; Britzger, D.; Brochu, F. M.; Brock, I.; Brock, R.; Bronner, J.; Brooijmans, G.; Brooks, T.; Brooks, W. K.; Brosamer, J.; Brost, E.; Brown, J.; Bruckman de Renstrom, P. A.; Bruncko, D.; Bruneliere, R.; Bruni, A.; Bruni, G.; Bruschi, M.; Bruscino, N.; Bryngemark, L.; Buanes, T.; Buat, Q.

    2015-10-01

    This paper reviews and extends searches for the direct pair production of the scalar supersymmetric partners of the top and bottom quarks in proton-proton collisions collected by the ATLAS collaboration during the LHC Run 1. Most of the analyses use 20 {fb^{-1}} of collisions at a centre-of-mass energy of ?{s} = 8 TeV, although in some case an additional 4.7 {fb^{-1}} of collision data at ?{s}= 7 TeV are used. New analyses are introduced to improve the sensitivity to specific regions of the model parameter space. Since no evidence of third-generation squarks is found, exclusion limits are derived by combining several analyses and are presented in both a simplified model framework, assuming simple decay chains, as well as within the context of more elaborate phenomenological supersymmetric models.

  16. Identification of Unknown Interface Locations in a Source/Shield System Using the Mesh Adaptive Direct Search Method

    SciTech Connect

    Armstrong, Jerawan C.; Favorite, Jeffrey A.

    2012-06-20

    The Levenberg-Marquardt (or simply Marquardt) and differential evolution (DE) optimization methods were recently applied to solve inverse transport problems. The Marquardt method is fast but convergence of the method is dependent on the initial guess. While it has been shown to work extremely well at finding an optimum independent of the initial guess, the DE method does not provide a global optimal solution in some problems. In this paper, we apply the Mesh Adaptive Direct Search (MADS) algorithm to solve the inverse problem of material interface location identification in one-dimensional spherical radiation source/shield systems, and we compare the results obtained by MADS to those obtained by Levenberg-Marquardt and DE.

  17. A direct imaging search for close stellar and sub-stellar companions to young nearby stars

    NASA Astrophysics Data System (ADS)

    Vogt, N.; Mugrauer, M.; Neuhäuser, R.; Schmidt, T. O. B.; Contreras-Quijada, A.; Schmidt, J. G.

    2015-01-01

    A total of 28 young nearby stars (ages {? 60} Myr) have been observed in the K_s-band with the adaptive optics imager Naos-Conica of the Very Large Telescope at the Paranal Observatory in Chile. Among the targets are ten visual binaries and one triple system at distances between 10 and 130 pc, all previously known. During a first observing epoch a total of 20 faint stellar or sub-stellar companion-candidates were detected around seven of the targets. These fields, as well as most of the stellar binaries, were re-observed with the same instrument during a second epoch, about one year later. We present the astrometric observations of all binaries. Their analysis revealed that all stellar binaries are co-moving. In two cases (HD 119022 AB and FG Aqr B/C) indications for significant orbital motions were found. However, all sub-stellar companion candidates turned out to be non-moving background objects except PZ Tel which is part of this project but whose results were published elsewhere. Detection limits were determined for all targets, and limiting masses were derived adopting three different age values; they turn out to be less than 10 Jupiter masses in most cases, well below the brown dwarf mass range. The fraction of stellar multiplicity and of the sub-stellar companion occurrence in the star forming regions in Chamaeleon are compared to the statistics of our search, and possible reasons for the observed differences are discussed. Based on observations made with ESO telescopes at Paranal Observatory under programme IDs 083.C-0150(B), 084.C-0364(A), 084.C-0364(B), 084.C-0364(C), 086.C-0600(A) and 086.C-0600(B).

  18. ZEPLIN-III direct dark matter search : final results and measurements in support of next generation instruments

    NASA Astrophysics Data System (ADS)

    Reichhart, Lea

    2013-12-01

    Astrophysical observations give convincing evidence for a vast non-baryonic component, the so-called dark matter, accounting for over 20% of the overall content of our Universe. Direct dark matter search experiments explore the possibility of interactions of these dark matter particles with ordinary baryonic matter via elastic scattering resulting in single nuclear recoils. The ZEPLIN-III detector operated on the basis of a dualphase (liquid/gas) xenon target, recording events in two separate response channels { scintillation and ionisation. These allow discrimination between electron recoils (from background radiation) and the signal expected from Weakly Interacting Massive Particle (WIMP) elastic scatters. Following a productive first exposure, the detector was upgraded with a new array of ultra-low background photomultiplier tubes, reducing the electron recoil background by over an order of magnitude. A second major upgrade to the detector was the incorporation of a tonne-scale active veto detector system, surrounding the WIMP target. Calibration and science data taken in coincidence with ZEPLIN-III showed rejection of up to 30% of the dominant electron recoil background and over 60% of neutron induced nuclear recoils. Data taking for the second science run finished in May 2011 with a total accrued raw fiducial exposure of 1,344 kg days. With this extensive data set, from over 300 days of run time, a limit on the spin-independent WIMP-nucleon cross-section of 4.8 10-8 pb near 50 GeV/c2 WIMP mass with 90% confidence was set. This result combined with the first science run of ZEPLIN-III excludes the scalar cross-section above 3.9 10-8 pb. Studying the background data taken by the veto detector allowed a calculation of the neutron yield induced by high energy cosmic-ray muons in lead of (5.8 0.2) 10-3 neutrons/muon/(g/cm2) for a mean muon energy of 260 GeV. Measurements of this kind are of great importance for large scale direct dark matter search experiments and future rare event searches in general. Finally, this work includes a comprehensive measurement of the energy dependent quenching factor for low energy nuclear recoils in a plastic scintillator, such as from the ZEPLIN-III veto detector, increasing accuracy for future simulation packages featuring large scale plastic scintillator detector systems.

  19. Discovering Common Ground: How Future Search Conferences Bring People Together To Achieve Breakthrough Innovation, Empowerment, Shared Vision, and Collaborative Action.

    ERIC Educational Resources Information Center

    Weisbord, Marvin R.; And Others

    This book contains 35 papers about planning and holding future search conferences, as well as their benefits and likely future directions. The following papers are included: "Applied Common Sense" (Weisbord); "Inventing the Search Conference" (Weisbord); "Building Collaborative Communities" (Schindler-Rainman, Lippitt); "Parallel Paths to…

  20. SEEK: A FORTRAN optimization program using a feasible directions gradient search

    NASA Technical Reports Server (NTRS)

    Savage, M.

    1995-01-01

    This report describes the use of computer program 'SEEK' which works in conjunction with two user-written subroutines and an input data file to perform an optimization procedure on a user's problem. The optimization method uses a modified feasible directions gradient technique. SEEK is written in ANSI standard Fortran 77, has an object size of about 46K bytes, and can be used on a personal computer running DOS. This report describes the use of the program and discusses the optimizing method. The program use is illustrated with four example problems: a bushing design, a helical coil spring design, a gear mesh design, and a two-parameter Weibull life-reliability curve fit.

  1. XENON1T - Direct Dark Matter Search on the Verge of a New Detector Generation

    NASA Astrophysics Data System (ADS)

    Aprile, Elena

    2015-04-01

    The XENON dark matter project aims at finding direct evidence for the scattering of weakly interacting massive dark matter particles (WIMPs) with target nuclei in an ultra-low background liquid xenon detector. After the successful operation of the XENON100 instrument - for many years the world's most sensitive deep underground WIMP detector - the next generation detector XENON1T is presently being built at the Italian Gran Sasso underground facility. The commissioning and first data taking of the experiment are expected to start in 2015. The talk will focus on the special challenges related to a ton-scale liquid xenon detector, provide a comprehensive overview of the ongoing construction phase, and discuss the prospects and projected physics reach of the experiment. We gratefully acknowledge the continuing support of the XENON dark matter project by the National Science Foundation.

  2. Global interpretation of direct Dark Matter searches after CDMS-II results

    SciTech Connect

    Kopp, Joachim; Schwetz, Thomas; Zupan, Jure

    2009-12-01

    We perform a global fit to data from Dark Matter (DM) direct detection experiments, including the recent CDMS-II results. We discuss possible interpretations of the DAMA annual modulation signal in terms of spin-independent and spin-dependent DM-nucleus interactions, both for elastic and inelastic scattering. We find that for the spin-dependent inelastic scattering off protons a good fit to all data is obtained. We present a simple toy model realizing such a scenario. In all the remaining cases the DAMA allowed regions are disfavored by other experiments or suffer from severe fine tuning of DM parameters with respect to the galactic escape velocity. Finally, we also entertain the possibility that the two events observed in CDMS-II are an actual signal of elastic DM scattering, and we compare the resulting CDMS-II allowed regions to the exclusion limits from other experiments.

  3. Some Parallel Extensions to Optimization Methods in OPT++

    SciTech Connect

    V. E. Howle; S. M. Shont; P. D. Hough

    2000-10-01

    OPT++ provides an array of optimization tools for solving scientific and engineering design problems. While these tools are useful, all of the code is serial. With increasingly easy access to multiprocessor machines and clusters of workstations, this results in unnecessarily long times to solution. In order to correct this problem, we have implemented a number of parallel techniques in OPT++. In particular, we have incorporated a speculative gradient algorithm that drastically reduces the time to solution for standard trust-region and line search algorithms. In addition, we have implemented a new version of the Trust-Region Parallel Direct Search (TRPDS) algorithm of Hough and Meza that yields a significant reduction in solution time for problems with expensive function evaluations.

  4. Massively parallel visualization: Parallel rendering

    SciTech Connect

    Hansen, C.D.; Krogh, M.; White, W.

    1995-12-01

    This paper presents rendering algorithms, developed for massively parallel processors (MPPs), for polygonal, spheres, and volumetric data. The polygon algorithm uses a data parallel approach whereas the sphere and volume renderer use a MIMD approach. Implementations for these algorithms are presented for the Thinking Machines Corporation CM-5 MPP.

  5. Search for a direction in the forest of Lyman-$\\alpha$

    E-print Network

    Hazra, Dhiraj Kumar

    2015-01-01

    We report the first test of isotropy of the Universe in the matter dominated epoch using the Lyman-$\\alpha$ forest data from the high redshift quasars ($z>2$) from SDSS-III BOSS-DR9 datasets. Using some specified data cuts, we obtain the probability distribution function (PDF) of the Lyman-$\\alpha$ forest transmitted flux and use the statistical moments of the PDF to address the isotropy of the Universe. In an isotropic Universe one would expect the transmitted flux to have consistent statistical characteristics in different parts of the sky. We trisect the total survey area of 3275 ${\\rm deg}^2$ along the galactic latitude and using quadrant convention. We also make three subdivisions in the data for three different signal-to-noise-ratios (SNR). Finally we obtain and compare the statistical moments in the mean redshifts of 2.3, 2.6 and 2.9. We find, that the moments from all patches agree at all redshifts and at all SNRs, within 3$\\sigma$ uncertainties. Since Lyman-$\\alpha$ transmitted flux directly maps the...

  6. Prospects for detection of target-dependent annual modulation in direct dark matter searches

    E-print Network

    Del Nobile, Eugenio; Witte, Samuel J

    2015-01-01

    Earth's rotation about the Sun produces an annual modulation in the expected scattering rate at direct dark matter detection experiments. The annual modulation as a function of the recoil energy $E_\\text{R}$ imparted by the dark matter particle to a target nucleus is expected to vary depending on the detector material. However, for most interactions a change of variables from $E_\\text{R}$ to $v_\\text{min}$, the minimum speed a dark matter particle must have to impart a fixed $E_\\text{R}$ to a target nucleus, produces an annual modulation independent of the target element. We recently showed that if the dark matter-nucleus cross section contains a non-factorizable target and dark matter velocity dependence, the annual modulation as a function of $v_\\text{min}$ can be target dependent. Here we examine more extensively the necessary conditions for target-dependent modulation, its observability in present-day experiments, and the extent to which putative signals could identify a dark matter-nucleus differential c...

  7. Duplex interrogation by a direct DNA repair protein in search of base damage

    SciTech Connect

    Yi, Chengqi; Chen, Baoen; Qi, Bo; Zhang, Wen; Jia, Guifang; Zhang, Liang; Li, Charles J.; Dinner, Aaron R.; Yang, Cai-Guang; He, Chuan

    2012-08-31

    ALKBH2 is a direct DNA repair dioxygenase guarding the mammalian genome against N{sup 1}-methyladenine, N{sup 3}-methylcytosine and 1,N{sup 6}-ethenoadenine damage. A prerequisite for repair is to identify these lesions in the genome. Here we present crystal structures of human ALKBH2 bound to different duplex DNAs. Together with computational and biochemical analyses, our results suggest that DNA interrogation by ALKBH2 has two previously unknown features: (i) ALKBH2 probes base-pair stability and detects base pairs with reduced stability, and (ii) ALKBH2 does not have nor need a damage-checking site, which is critical for preventing spurious base cleavage for several glycosylases. The demethylation mechanism of ALKBH2 insures that only cognate lesions are oxidized and reversed to normal bases, and that a flipped, non-substrate base remains intact in the active site. Overall, the combination of duplex interrogation and oxidation chemistry allows ALKBH2 to detect and process diverse lesions efficiently and correctly.

  8. Making sense of the local Galactic escape speed estimates in direct dark matter searches

    NASA Astrophysics Data System (ADS)

    Lavalle, Julien; Magni, Stefano

    2015-01-01

    Direct detection (DD) of dark matter (DM) candidates in the ?10 GeV mass range is very sensitive to the tail of their velocity distribution. The important quantity is the maximum weakly interacting massive particle speed in the observer's rest frame, i.e. in average the sum of the local Galactic escape speed vesc and of the circular velocity of the Sun vc. While the latter has been receiving continuous attention, the former is more difficult to constrain. The RAVE Collaboration has just released a new estimate of vesc [T. Piffl et al., Astron. Astrophys. 562, A91 (2014)] that supersedes the previous one [M. C. Smith, et al. Mon. Not. R. Astron. Soc. 379, 755 (2007)], which is of interest in the perspective of reducing the astrophysical uncertainties in DD. Nevertheless, these new estimates cannot be used blindly as they rely on assumptions in the dark halo modeling which induce tight correlations between the escape speed and other local astrophysical parameters. We make a self-consistent study of the implications of the RAVE results on DD assuming isotropic DM velocity distributions, both Maxwellian and ergodic. Taking as references the experimental sensitivities currently achieved by LUX, CRESST-II, and SuperCDMS, we show that (i) the exclusion curves associated with the best-fit points of P14 may be more constraining by up to ˜40 % with respect to standard limits, because the underlying astrophysical correlations induce a larger local DM density, and (ii) the corresponding relative uncertainties inferred in the low weakly interacting massive particle mass region may be moderate, down to 10-15% below 10 GeV. We finally discuss the level of consistency of these results with other independent astrophysical constraints. This analysis is complementary to others based on rotation curves.

  9. EBSCOhost 1 of 2 http://search.ebscohost.com/login.aspx?direct=true&db=pvh&AN=cnt-17-8-438

    E-print Network

    Weinberger, Norman M.

    which he chooses: "... a person's mind is the integrated totality of the conscious and unconsciousEBSCOhost 1 of 2 http://search.ebscohost.com/login.aspx?direct=true&db=pvh&AN=cnt-17-8-438 Mind : Past, Present, and (?) Review By: NORMAN M. WEINBERGER Review of: The Evolution of the Human Mind By

  10. Three-dimensional magnetotelluric inversion including topography using deformed hexahedral edge finite elements, direct solvers and data space Gauss-Newton, parallelized on SMP computers

    NASA Astrophysics Data System (ADS)

    Kordy, M. A.; Wannamaker, P. E.; Maris, V.; Cherkaev, E.; Hill, G. J.

    2014-12-01

    We have developed an algorithm for 3D simulation and inversion of magnetotelluric (MT) responses using deformable hexahedral finite elements that permits incorporation of topography. Direct solvers parallelized on symmetric multiprocessor (SMP), single-chassis workstations with large RAM are used for the forward solution, parameter jacobians, and model update. The forward simulator, jacobians calculations, as well as synthetic and real data inversion are presented. We use first-order edge elements to represent the secondary electric field (E), yielding accuracy O(h) for E and its curl (magnetic field). For very low frequency or small material admittivity, the E-field requires divergence correction. Using Hodge decomposition, correction may be applied after the forward solution is calculated. It allows accurate E-field solutions in dielectric air. The system matrix factorization is computed using the MUMPS library, which shows moderately good scalability through 12 processor cores but limited gains beyond that. The factored matrix is used to calculate the forward response as well as the jacobians of field and MT responses using the reciprocity theorem. Comparison with other codes demonstrates accuracy of our forward calculations. We consider a popular conductive/resistive double brick structure and several topographic models. In particular, the ability of finite elements to represent smooth topographic slopes permits accurate simulation of refraction of electromagnetic waves normal to the slopes at high frequencies. Run time tests indicate that for meshes as large as 150x150x60 elements, MT forward response and jacobians can be calculated in ~2.5 hours per frequency. For inversion, we implemented data space Gauss-Newton method, which offers reduction in memory requirement and a significant speedup of the parameter step versus model space approach. For dense matrix operations we use tiling approach of PLASMA library, which shows very good scalability. In synthetic inversions we examine the importance of including the topography in the inversion and we test different regularization schemes using weighted second norm of model gradient as well as inverting for a static distortion matrix following Miensopust/Avdeeva approach. We also apply our algorithm to invert MT data collected at Mt St Helens.

  11. A search for anisotropy in the arrival directions of ultra high energy cosmic rays recorded at the Pierre Auger Observatory

    NASA Astrophysics Data System (ADS)

    Pierre Auger Collaboration; Abreu, P.; Aglietta, M.; Ahlers, M.; Ahn, E. J.; Albuquerque, I. F. M.; Allard, D.; Allekotte, I.; Allen, J.; Allison, P.; Almela, A.; Alvarez Castillo, J.; Alvarez-Muñiz, J.; Ambrosio, M.; Aminaei, A.; Anchordoqui, L.; Andringa, S.; Antici'c, T.; Aramo, C.; Arganda, E.; Arqueros, F.; Asorey, H.; Assis, P.; Aublin, J.; Ave, M.; Avenier, M.; Avila, G.; Bäcker, T.; Badescu, A. M.; Balzer, M.; Barber, K. B.; Barbosa, A. F.; Bardenet, R.; Barroso, S. L. C.; Baughman, B.; Bäuml, J.; Beatty, J. J.; Becker, B. R.; Becker, K. H.; Bellétoile, A.; Bellido, J. A.; BenZvi, S.; Berat, C.; Bertou, X.; Biermann, P. L.; Billoir, P.; Blanco, F.; Blanco, M.; Bleve, C.; Blümer, H.; Bohácová, M.; Boncioli, D.; Bonifazi, C.; Bonino, R.; Borodai, N.; Brack, J.; Brancus, I.; Brogueira, P.; Brown, W. C.; Bruijn, R.; Buchholz, P.; Bueno, A.; Burton, R. E.; Caballero-Mora, K. S.; Caccianiga, B.; Caramete, L.; Caruso, R.; Castellina, A.; Catalano, O.; Cataldi, G.; Cazon, L.; Cester, R.; Chauvin, J.; Cheng, S. H.; Chiavassa, A.; Chinellato, J. A.; Chirinos Diaz, J.; Chudoba, J.; Cilmo, M.; Clay, R. W.; Coluccia, M. R.; Conceição, R.; Contreras, F.; Cook, H.; Cooper, M. J.; Coppens, J.; Cordier, A.; Coutu, S.; Covault, C. E.; Creusot, A.; Criss, A.; Cronin, J.; Curutiu, A.; Dagoret-Campagne, S.; Dallier, R.; Dasso, S.; Daumiller, K.; Dawson, B. R.; de Almeida, R. M.; De Domenico, M.; De Donato, C.; de Jong, S. J.; De La Vega, G.; de Mello Junior, W. J. M.; de Mello Neto, J. R. T.; De Mitri, I.; de Souza, V.; de Vries, K. D.; del Peral, L.; del Río, M.; Deligny, O.; Dembinski, H.; Dhital, N.; Di Giulio, C.; Díaz Castro, M. L.; Diep, P. N.; Diogo, F.; Dobrigkeit, C.; Docters, W.; D'Olivo, J. C.; Dong, P. N.; Dorofeev, A.; dos Anjos, J. C.; Dova, M. T.; D'Urso, D.; Dutan, I.; Ebr, J.; Engel, R.; Erdmann, M.; Escobar, C. O.; Espadanal, J.; Etchegoyen, A.; Facal San Luis, P.; Fajardo Tapia, I.; Falcke, H.; Farrar, G.; Fauth, A. C.; Fazzini, N.; Ferguson, A. P.; Fick, B.; Filevich, A.; Filipcic, A.; Fliescher, S.; Fracchiolla, C. E.; Fraenkel, E. D.; Fratu, O.; Fröhlich, U.; Fuchs, B.; Gaior, R.; Gamarra, R. F.; Gambetta, S.; García, B.; Garcia Roca, S. T.; Garcia-Gamez, D.; Garcia-Pinto, D.; Gascon, A.; Gemmeke, H.; Ghia, P. L.; Giaccari, U.; Giller, M.; Glass, H.; Gold, M. S.; Golup, G.; Gomez Albarracin, F.; Gómez Berisso, M.; Gómez Vitale, P. F.; Gonçalves, P.; Gonzalez, D.; Gonzalez, J. G.; Gookin, B.; Gorgi, A.; Gouffon, P.; Grashorn, E.; Grebe, S.; Griffith, N.; Grigat, M.; Grillo, A. F.; Guardincerri, Y.; Guarino, F.; Guedes, G. P.; Guzman, A.; Hague, J. D.; Hansen, P.; Harari, D.; Harmsma, S.; Harrison, T. A.; Harton, J. L.; Haungs, A.; Hebbeker, T.; Heck, D.; Herve, A. E.; Hojvat, C.; Hollon, N.; Holmes, V. C.; Homola, P.; Hörandel, J. R.; Horneffer, A.; Horvath, P.; Hrabovský, M.; Huege, T.; Insolia, A.; Ionita, F.; Italiano, A.; Jarne, C.; Jiraskova, S.; Josebachuili, M.; Kadija, K.; Kampert, K. H.; Karhan, P.; Kasper, P.; Kégl, B.; Keilhauer, B.; Keivani, A.; Kelley, J. L.; Kemp, E.; Kieckhafer, R. M.; Klages, H. O.; Kleifges, M.; Kleinfeller, J.; Knapp, J.; Koang, D.-H.; Kotera, K.; Krohm, N.; Krömer, O.; Kruppke-Hansen, D.; Kuehn, F.; Kuempel, D.; Kulbartz, J. K.; Kunka, N.; La Rosa, G.; Lachaud, C.; Lauer, R.; Lautridou, P.; Le Coz, S.; Leão, M. S. A. B.; Lebrun, D.; Lebrun, P.; Leigui de Oliveira, M. A.; Letessier-Selvon, A.; Lhenry-Yvon, I.; Link, K.; López, R.; Lopez Agüera, A.; Louedec, K.; Lozano Bahilo, J.; Lu, L.; Lucero, A.; Ludwig, M.; Lyberis, H.; Macolino, C.; Maldera, S.; Mandat, D.; Mantsch, P.; Mariazzi, A. G.; Marin, J.; Marin, V.; Maris, I. C.; Marquez Falcon, H. R.; Marsella, G.; Martello, D.; Martin, L.; Martinez, H.; Martínez Bravo, O.; Mathes, H. J.; Matthews, J.; Matthews, J. A. J.; Matthiae, G.; Maurel, D.; Maurizio, D.; Mazur, P. O.; Medina-Tanco, G.; Melissas, M.; Melo, D.; Menichetti, E.; Menshikov, A.; Mertsch, P.; Meurer, C.; Mi'canovi'c, S.; Micheletti, M. I.; Minaya, I. A.; Miramonti, L.; Molina-Bueno, L.; Mollerach, S.; Monasor, M.; Monnier Ragaigne, D.; Montanet, F.; Morales, B.; Morello, C.; Moreno, E.; Moreno, J. C.; Mostafá, M.; Moura, C. A.; Muller, M. A.; Müller, G.; Münchmeyer, M.; Mussa, R.; Navarra, G.; Navarro, J. L.; Navas, S.; Necesal, P.; Nellen, L.; Nelles, A.; Neuser, J.; Nhung, P. T.; Niechciol, M.; Niemietz, L.; Nierstenhoefer, N.; Nitz, D.; Nosek, D.; Nožka, L.; Nyklicek, M.; Oehlschläger, J.; Olinto, A.; Ortiz, M.; Pacheco, N.; Pakk Selmi-Dei, D.; Palatka, M.; Pallotta, J.; Palmieri, N.; Parente, G.; Parizot, E.; Parra, A.; Pastor, S.; Paul, T.; Pech, M.; Pekala, J.; Pelayo, R.; Pepe, I. M.; Perrone, L.; Pesce, R.; Petermann, E.; Petrera, S.; Petrinca, P.; Petrolini, A.; Petrov, Y.

    2012-04-01

    Observations of cosmic ray arrival directions made with the Pierre Auger Observatory have previously provided evidence of anisotropy at the 99% CL using the correlation of ultra high energy cosmic rays (UHECRs) with objects drawn from the Véron-Cetty Véron catalog. In this paper we report on the use of three catalog independent methods to search for anisotropy. The 2pt-L, 2pt+ and 3pt methods, each giving a different measure of self-clustering in arrival directions, were tested on mock cosmic ray data sets to study the impacts of sample size and magnetic smearing on their results, accounting for both angular and energy resolutions. If the sources of UHECRs follow the same large scale structure as ordinary galaxies in the local Universe and if UHECRs are deflected no more than a few degrees, a study of mock maps suggests that these three methods can efficiently respond to the resulting anisotropy with a P-value = 1.0% or smaller with data sets as few as 100 events. Using data taken from January 1, 2004 to July 31, 2010 we examined the 20,30,...,110 highest energy events with a corresponding minimum energy threshold of about 49.3 EeV. The minimum P-values found were 13.5% using the 2pt-L method, 1.0% using the 2pt+ method and 1.1% using the 3pt method for the highest 100 energy events. In view of the multiple (correlated) scans performed on the data set, these catalog-independent methods do not yield strong evidence of anisotropy in the highest energy cosmic rays.

  12. A search for anisotropy in the arrival directions of ultra high energy cosmic rays recorded at the Pierre Auger Observatory

    SciTech Connect

    Abreu, P.; ,

    2012-01-01

    Observations of cosmic ray arrival directions made with the Pierre Auger Observatory have previously provided evidence of anisotropy at the 99% CL using the correlation of ultra high energy cosmic rays (UHECRs) with objects drawn from the Veron-Cetty Veron catalog. In this paper we report on the use of three catalog independent methods to search for anisotropy. The 2pt-L, 2pt+ and 3pt methods, each giving a different measure of self-clustering in arrival directions, were tested on mock cosmic ray data sets to study the impacts of sample size and magnetic smearing on their results, accounting for both angular and energy resolutions. If the sources of UHECRs follow the same large scale structure as ordinary galaxies in the local Universe and if UHECRs are deflected no more than a few degrees, a study of mock maps suggests that these three methods can efficiently respond to the resulting anisotropy with a P-value = 1.0% or smaller with data sets as few as 100 events. Using data taken from January 1, 2004 to July 31, 2010 we examined the 20, 30, ..., 110 highest energy events with a corresponding minimum energy threshold of about 51 EeV. The minimum P-values found were 13.5% using the 2pt-L method, 1.0% using the 2pt+ method and 1.1% using the 3pt method for the highest 100 energy events. In view of the multiple (correlated) scans performed on the data set, these catalog-independent methods do not yield strong evidence of anisotropy in the highest energy cosmic rays.

  13. Discussing direct search of dark matter particles in the minimal supersymmetric extension of the standard model with light neutralinos

    SciTech Connect

    Fornengo, N.; Scopel, S.; Bottino, A.

    2011-01-01

    We examine the status of light neutralinos in an effective minimal supersymmetric extension of the standard model at the electroweak scale which was considered in the past and discussed in terms of the available data of direct searches for dark matter particles. Our reanalysis is prompted by new measurements at the Tevatron and B factories which might potentially provide significant constraints on the minimal supersymmetric extension of the standard model. Here we examine in detail all these new data and show that the present published results from the Tevatron and B factories have only a mild effect on the original light-neutralino population. This population, which fits quite well the DAMA/LIBRA annual modulation data, would also agree with the preliminary results of CDMS, CoGeNT, and CRESST, should these data, which are at present only hints of excesses of events over the expected backgrounds, be interpreted as authentic signals of dark matter. For the neutralino mass we find a lower bound of 7-8 GeV. Our results differ from some recent conclusions by other authors because of a few crucial points which we try to single out and elucidate.

  14. Simulations of the Nuclear Recoil Head-Tail Signature in Gases Relevant to Directional Dark Matter Searches

    E-print Network

    Majewski, P; Snowden-Ifft, D P; Spooner, N J C

    2009-01-01

    We present the first detailed simulations of the head-tail effect relevant to directional Dark Matter searches. Investigations of the location of the majority of the ionization charge as being either at the beginning half (tail) or at the end half (head) of the nuclear recoil track were performed for carbon and sulphur recoils in 40 Torr negative ion carbon disulfide and for fluorine recoils in 100 Torr carbon tetrafluoride. The SRIM simulation program was used, together with a purpose-written Monte Carlo generator, to model production of ionizing pairs, diffusion and basic readout geometries relevant to potential real detector scenarios, such as under development for the DRIFT experiment. The results clearly indicate the existence of a head-tail track asymmetry but with a magnitude critically influenced by two competing factors: the nature of the stopping power and details of the range straggling. The former tends to result in the tail being greater than the head and the latter the reverse.

  15. Simulations of the Nuclear Recoil Head-Tail Signature in Gases Relevant to Directional Dark Matter Searches

    E-print Network

    P. Majewski; D. Muna; D. P. Snowden-Ifft; N. J. C. Spooner

    2009-02-25

    We present the first detailed simulations of the head-tail effect relevant to directional Dark Matter searches. Investigations of the location of the majority of the ionization charge as being either at the beginning half (tail) or at the end half (head) of the nuclear recoil track were performed for carbon and sulphur recoils in 40 Torr negative ion carbon disulfide and for fluorine recoils in 100 Torr carbon tetrafluoride. The SRIM simulation program was used, together with a purpose-written Monte Carlo generator, to model production of ionizing pairs, diffusion and basic readout geometries relevant to potential real detector scenarios, such as under development for the DRIFT experiment. The results clearly indicate the existence of a head-tail track asymmetry but with a magnitude critically influenced by two competing factors: the nature of the stopping power and details of the range straggling. The former tends to result in the tail being greater than the head and the latter the reverse.

  16. Radiopurity of CaWO{sub 4} crystals for direct dark matter search with CRESST and EURECA

    SciTech Connect

    Münster, A.; Sivers, M. v.; Erb, A.; Feilitzsch, F. v.; Gütlein, A.; Lanfranchi, J.-C.; Potzel, W.; Angloher, G.; Bento, A.; Hauff, D.; Petricca, F.; Pröbst, F.; Bucci, C.; Canonica, L.; Gorla, P.; Laubenstein, M.; Jochum, J.; Loebell, J.; Kraus, H.; Ortigoza, Y. E-mail: msivers@ph.tum.de; and others

    2014-05-01

    The direct dark matter search experiment CRESST uses scintillating CaWO{sub 4} single crystals as targets for possible WIMP scatterings. An intrinsic radioactive contamination of the crystals as low as possible is crucial for the sensitivity of the detectors. In the past CaWO{sub 4} crystals operated in CRESST were produced by institutes in Russia and the Ukraine. Since 2011 CaWO{sub 4} crystals have also been grown at the crystal laboratory of the Technische Universität München (TUM) to better meet the requirements of CRESST and of the future tonne-scale multi-material experiment EURECA. The radiopurity of the raw materials and of first TUM-grown crystals was measured by ultra-low background ?-spectrometry. Two TUM-grown crystals were also operated as low-temperature detectors at a test setup in the Gran Sasso underground laboratory. These measurements were used to determine the crystals' intrinsic ?-activities which were compared to those of crystals produced at other institutes. The total ?-activities of TUM-grown crystals as low as 1.23±0.06 mBq/kg were found to be significantly smaller than the activities of crystals grown at other institutes typically ranging between ? 15 mBq/kg and ? 35 mBq/kg.

  17. Process Simulation and Control Optimization of a Blast Furnace Using Classical Thermodynamics Combined to a Direct Search Algorithm

    NASA Astrophysics Data System (ADS)

    Harvey, Jean-Philippe; Gheribi, Aïmen E.

    2013-12-01

    Several numerical approaches have been proposed in the literature to simulate the behavior of modern blast furnaces: finite volume methods, data-mining models, heat and mass balance models, and classical thermodynamic simulations. Despite this, there is actually no efficient method for evaluating quickly optimal operating parameters of a blast furnace as a function of the iron ore composition, which takes into account all potential chemical reactions that could occur in the system. In the current study, we propose a global simulation strategy of a blast furnace, the 5-unit process simulation. It is based on classical thermodynamic calculations coupled to a direct search algorithm to optimize process parameters. These parameters include the minimum required metallurgical coke consumption as well as the optimal blast chemical composition and the total charge that simultaneously satisfy the overall heat and mass balances of the system. Moreover, a Gibbs free energy function for metallurgical coke is parameterized in the current study and used to fine-tune the simulation of the blast furnace. Optimal operating conditions and predicted output stream properties calculated by the proposed thermodynamic simulation strategy are compared with reference data found in the literature and have proven the validity and high precision of this simulation.

  18. cuBLASTP: Fine-Grained Parallelization of Protein Sequence Search on a GPU Jing Zhang, Hao Wang, Heshan Lin, and Wu-chun Feng

    E-print Network

    Cao, Yong

    Alignment Search Tool, is a fundamental algorithm in the life sciences that compares biological sequences. The experimental results show that on a NVIDIA Kepler GPU, cuBLASTP delivers up to a 5.0-fold speedup over execution. Keywords-BLAST, BLASTP, GPU, bioinformatics, life sci- ences, next-generation sequencing, hit

  19. Analytic Guided-Search Model of Human Performance Accuracy in Target- Localization Search Tasks

    NASA Technical Reports Server (NTRS)

    Eckstein, Miguel P.; Beutter, Brent R.; Stone, Leland S.

    2000-01-01

    Current models of human visual search have extended the traditional serial/parallel search dichotomy. Two successful models for predicting human visual search are the Guided Search model and the Signal Detection Theory model. Although these models are inherently different, it has been difficult to compare them because the Guided Search model is designed to predict response time, while Signal Detection Theory models are designed to predict performance accuracy. Moreover, current implementations of the Guided Search model require the use of Monte-Carlo simulations, a method that makes fitting the model's performance quantitatively to human data more computationally time consuming. We have extended the Guided Search model to predict human accuracy in target-localization search tasks. We have also developed analytic expressions that simplify simulation of the model to the evaluation of a small set of equations using only three free parameters. This new implementation and extension of the Guided Search model will enable direct quantitative comparisons with human performance in target-localization search experiments and with the predictions of Signal Detection Theory and other search accuracy models.

  20. Demonstrating Forces between Parallel Wires.

    ERIC Educational Resources Information Center

    Baker, Blane

    2000-01-01

    Describes a physics demonstration that dramatically illustrates the mutual repulsion (attraction) between parallel conductors using insulated copper wire, wooden dowels, a high direct current power supply, electrical tape, and an overhead projector. (WRM)

  1. Parallel pipelining

    SciTech Connect

    Joseph, D.D.; Bai, R.; Liao, T.Y.; Huang, A.; Hu, H.H.

    1995-09-01

    In this paper the authors introduce the idea of parallel pipelining for water lubricated transportation of oil (or other viscous material). A parallel system can have major advantages over a single pipe with respect to the cost of maintenance and continuous operation of the system, to the pressure gradients required to restart a stopped system and to the reduction and even elimination of the fouling of pipe walls in continuous operation. The authors show that the action of capillarity in small pipes is more favorable for restart than in large pipes. In a parallel pipeline system, they estimate the number of small pipes needed to deliver the same oil flux as in one larger pipe as N = (R/r){sup {alpha}}, where r and R are the radii of the small and large pipes, respectively, and {alpha} = 4 or 19/7 when the lubricating water flow is laminar or turbulent.

  2. Meyers: Encyclopedia of Complexity and Systems Science --Entry 316 --2008/10/16 --10:15 --page 1 --le-tex Earthquake Location, Direct, Global-Search Methods 1

    E-print Network

    316 -- 2008/10/16 -- 10:15 -- page 1 -- le-tex ii ii ii Earthquake Location, Direct, Global-Search Methods 1 Earthquake Location, Direct, Global-Search Methods ANTHONY LOMAX1, ALBERTO MICHELINI2,1 ANDREW Glossary11 Definition of the Subject12 Introduction13 The Earthquake Location Problem14 Location Methods15

  3. Searches for direct stop production in events with two leptons in sqrt(s) = 8 TeV pp collisions using 20 fb-1 of ATLAS data

    E-print Network

    Meloni, F; The ATLAS collaboration

    2014-01-01

    Three searches for direct top squark pair production, targeting di erent decay modes yielding two leptons (electrons or muons) in the final state, are presented. Each search uses 20.3 fb-1 of pp collision data at sqrt(s) = 8 TeV collected by the ATLAS experiment at the Large Hadron Collider. No excesses over Standard Model expectations are found, and the results are interpreted under the separate assumptions that the light top squark decays to a b-quark and the lightest chargino, or to a t-quark and the lightest neutralino.

  4. Applied Parallel Metadata Indexing

    SciTech Connect

    Jacobi, Michael R

    2012-08-01

    The GPFS Archive is parallel archive is a parallel archive used by hundreds of users in the Turquoise collaboration network. It houses 4+ petabytes of data in more than 170 million files. Currently, users must navigate the file system to retrieve their data, requiring them to remember file paths and names. A better solution might allow users to tag data with meaningful labels and searach the archive using standard and user-defined metadata, while maintaining security. last summer, I developed the backend to a tool that adheres to these design goals. The backend works by importing GPFS metadata into a MongoDB cluster, which is then indexed on each attribute. This summer, the author implemented security and developed the user interfae for the search tool. To meet security requirements, each database table is associated with a single user, which only stores records that the user may read, and requires a set of credentials to access. The interface to the search tool is implemented using FUSE (Filesystem in USErspace). FUSE is an intermediate layer that intercepts file system calls and allows the developer to redefine how those calls behave. In the case of this tool, FUSE interfaces with MongoDB to issue queries and populate output. A FUSE implementation is desirable because it allows users to interact with the search tool using commands they are already familiar with. These security and interface additions are essential for a usable product.

  5. Parallel Magnetic Resonance Imaging

    E-print Network

    Uecker, Martin

    2015-01-01

    The main disadvantage of Magnetic Resonance Imaging (MRI) are its long scan times and, in consequence, its sensitivity to motion. Exploiting the complementary information from multiple receive coils, parallel imaging is able to recover images from under-sampled k-space data and to accelerate the measurement. Because parallel magnetic resonance imaging can be used to accelerate basically any imaging sequence it has many important applications. Parallel imaging brought a fundamental shift in image reconstruction: Image reconstruction changed from a simple direct Fourier transform to the solution of an ill-conditioned inverse problem. This work gives an overview of image reconstruction from the perspective of inverse problems. After introducing basic concepts such as regularization, discretization, and iterative reconstruction, advanced topics are discussed including algorithms for auto-calibration, the connection to approximation theory, and the combination with compressed sensing.

  6. Automatic Multilevel Parallelization Using OpenMP

    NASA Technical Reports Server (NTRS)

    Jin, Hao-Qiang; Jost, Gabriele; Yan, Jerry; Ayguade, Eduard; Gonzalez, Marc; Martorell, Xavier; Biegel, Bryan (Technical Monitor)

    2002-01-01

    In this paper we describe the extension of the CAPO parallelization support tool to support multilevel parallelism based on OpenMP directives. CAPO generates OpenMP directives with extensions supported by the NanosCompiler to allow for directive nesting and definition of thread groups. We report first results for several benchmark codes and one full application that have been parallelized using our system.

  7. Parallel hierarchical global illumination

    SciTech Connect

    Snell, Q.O.

    1997-10-08

    Solving the global illumination problem is equivalent to determining the intensity of every wavelength of light in all directions at every point in a given scene. The complexity of the problem has led researchers to use approximation methods for solving the problem on serial computers. Rather than using an approximation method, such as backward ray tracing or radiosity, the authors have chosen to solve the Rendering Equation by direct simulation of light transport from the light sources. This paper presents an algorithm that solves the Rendering Equation to any desired accuracy, and can be run in parallel on distributed memory or shared memory computer systems with excellent scaling properties. It appears superior in both speed and physical correctness to recent published methods involving bidirectional ray tracing or hybrid treatments of diffuse and specular surfaces. Like progressive radiosity methods, it dynamically refines the geometry decomposition where required, but does so without the excessive storage requirements for ray histories. The algorithm, called Photon, produces a scene which converges to the global illumination solution. This amounts to a huge task for a 1997-vintage serial computer, but using the power of a parallel supercomputer significantly reduces the time required to generate a solution. Currently, Photon can be run on most parallel environments from a shared memory multiprocessor to a parallel supercomputer, as well as on clusters of heterogeneous workstations.

  8. Parallel Anisotropic Tetrahedral Adaptation

    NASA Technical Reports Server (NTRS)

    Park, Michael A.; Darmofal, David L.

    2008-01-01

    An adaptive method that robustly produces high aspect ratio tetrahedra to a general 3D metric specification without introducing hybrid semi-structured regions is presented. The elemental operators and higher-level logic is described with their respective domain-decomposed parallelizations. An anisotropic tetrahedral grid adaptation scheme is demonstrated for 1000-1 stretching for a simple cube geometry. This form of adaptation is applicable to more complex domain boundaries via a cut-cell approach as demonstrated by a parallel 3D supersonic simulation of a complex fighter aircraft. To avoid the assumptions and approximations required to form a metric to specify adaptation, an approach is introduced that directly evaluates interpolation error. The grid is adapted to reduce and equidistribute this interpolation error calculation without the use of an intervening anisotropic metric. Direct interpolation error adaptation is illustrated for 1D and 3D domains.

  9. Micro-physics simulations of columnar recombination along nuclear recoil tracks in high-pressure Xe gas for directional dark matter searches

    NASA Astrophysics Data System (ADS)

    Nakajima, Y.; Goldschmidt, A.; Long, M.; Nygren, D.; Oliveira, C.; Renner, J.

    2015-11-01

    Directional sensitivity is one of the most important aspects of WIMP dark matter searches. Yet, making the direction of nuclear recoil visible with large target masses is a challenge. To achieve this, we are exploring a new method of detecting directions of short nuclear recoil tracks in high-pressure Xe gas, down to a few micron long, by utilizing columnar recombination. Columnar recombination changes the scintillation and ionization yields depending on the angle between a track and the electric field direction. In order to realize this, efficient cooling of electrons is essential. Trimethylamine(TMA) is one of the candidate additives to gaseous Xe in order to enhance the effect, not only by efficiently cooling the electrons, but also by increasing the amount of columnar recombination by Penning transfer. We performed a detailed simulation of ionization electrons transport created by nuclear recoils in a Xe + TMA gas mixture, and evaluated the size of the columnar recombination signal. The results show that the directionality signal can be obtained for a track longer than a few ?m in some ideal cases. Although more studies with realistic assumptions are still needed in order to assess feasibility of this technique, this potentially opens a new possibility for dark matter searches.

  10. Micro-physics simulations of columnar recombination along nuclear recoil tracks in high-pressure Xe gas for directional dark matter searches

    E-print Network

    Y. Nakajima; A. Goldschmidt; M. Long; D. Nygren; C. Oliveira; J. Renner

    2015-05-14

    Directional sensitivity is one of the most important aspects of WIMP dark matter searches. Yet, making the direction of nuclear recoil visible with large target masses is a challenge. To achieve this, we are exploring a new method of detecting directions of short nuclear recoil tracks in high-pressure Xe gas, down to a few micron long, by utilizing columnar recombination. Columnar recombination changes the scintillation and ionization yields depending on the angle between a track and the electric field direction. In order to realize this, efficient cooling of electrons is essential. Trimethylamine(TMA) is one of the candidate additives to gaseous Xe in order to enhance the effect, not only by efficiently cooling the electrons, but also by increasing the amount of columnar recombination by Penning transfer. We performed a detailed simulation of ionization electrons transport created by nuclear recoils in a Xe + TMA gas mixture, and evaluated the size of the columnar recombination signal. The results show that the directionality signal can be obtained for a track longer than a few micrometers in some ideal cases. Although more studies with realistic assumptions are still needed in order to assess feasibility of this technique, this potentially opens a new possibility for dark matter searches.

  11. Computer-Aided Parallelizer and Optimizer

    NASA Technical Reports Server (NTRS)

    Jin, Haoqiang

    2011-01-01

    The Computer-Aided Parallelizer and Optimizer (CAPO) automates the insertion of compiler directives (see figure) to facilitate parallel processing on Shared Memory Parallel (SMP) machines. While CAPO currently is integrated seamlessly into CAPTools (developed at the University of Greenwich, now marketed as ParaWise), CAPO was independently developed at Ames Research Center as one of the components for the Legacy Code Modernization (LCM) project. The current version takes serial FORTRAN programs, performs interprocedural data dependence analysis, and generates OpenMP directives. Due to the widely supported OpenMP standard, the generated OpenMP codes have the potential to run on a wide range of SMP machines. CAPO relies on accurate interprocedural data dependence information currently provided by CAPTools. Compiler directives are generated through identification of parallel loops in the outermost level, construction of parallel regions around parallel loops and optimization of parallel regions, and insertion of directives with automatic identification of private, reduction, induction, and shared variables. Attempts also have been made to identify potential pipeline parallelism (implemented with point-to-point synchronization). Although directives are generated automatically, user interaction with the tool is still important for producing good parallel codes. A comprehensive graphical user interface is included for users to interact with the parallelization process.

  12. Parallel fast gauss transform

    SciTech Connect

    Sampath, Rahul S; Sundar, Hari; Veerapaneni, Shravan

    2010-01-01

    We present fast adaptive parallel algorithms to compute the sum of N Gaussians at N points. Direct sequential computation of this sum would take O(N{sup 2}) time. The parallel time complexity estimates for our algorithms are O(N/n{sub p}) for uniform point distributions and O( (N/n{sub p}) log (N/n{sub p}) + n{sub p}log n{sub p}) for non-uniform distributions using n{sub p} CPUs. We incorporate a plane-wave representation of the Gaussian kernel which permits 'diagonal translation'. We use parallel octrees and a new scheme for translating the plane-waves to efficiently handle non-uniform distributions. Computing the transform to six-digit accuracy at 120 billion points took approximately 140 seconds using 4096 cores on the Jaguar supercomputer. Our implementation is 'kernel-independent' and can handle other 'Gaussian-type' kernels even when explicit analytic expression for the kernel is not known. These algorithms form a new class of core computational machinery for solving parabolic PDEs on massively parallel architectures.

  13. Status of the MSSM Higgs sector using global analysis and direct search bounds, and future prospects at the High Luminosity LHC

    NASA Astrophysics Data System (ADS)

    Bhattacherjee, Biplob; Chakraborty, Amit; Choudhury, Arghya

    2015-11-01

    In this paper, we search for the regions of the phenomenological minimal supersymmetric standard model (pMSSM) parameter space where one can expect to have moderate Higgs mixing angle (? ) with relatively light (up to 600 GeV) additional Higgses after satisfying the current LHC data. We perform a global fit analysis using most updated data (till December 2014) from the LHC and Tevatron experiments. The constraints coming from the precision measurements of the rare b-decays Bs??+?- and b ?s ? are also considered. We find that low MA(?350 ) and high tan ? (?25 ) regions are disfavored by the combined effect of the global analysis and flavor data. However, regions with Higgs mixing angle ? ˜0.1 - 0.8 are still allowed by the current data. We then study the existing direct search bounds on the heavy scalar/pseudoscalar (H /A ) and charged Higgs boson (H±) masses and branchings at the LHC. It has been found that regions with low to moderate values of tan ? with light additional Higgses (mass ?600 GeV ) are unconstrained by the data, while the regions with tan ? >20 are excluded considering the direct search bounds by the LHC-8 data. The possibility to probe the region with tan ? ?20 at the high luminosity run of LHC are also discussed, giving special attention to the H ?hh , H /A ?t t ¯ and H /A ??+?- decay modes.

  14. Search for Direct Top Squark Pair Production in Final States with One Isolated Lepton, Jets, and Missing Transverse Momentum in ?s=7??TeV pp Collisions Using 4.7??fb[superscript -1] of ATLAS Data

    E-print Network

    Taylor, Frank E.

    A search is presented for direct top squark pair production in final states with one isolated electron or muon, jets, and missing transverse momentum in proton-proton collisions at ?s=7??TeV. The measurement is based on ...

  15. The Higgs boson in the Standard Model theoretical constraints and a direct search in the wh channel at the Tevatron

    SciTech Connect

    Huske, Nils Kristian; /Paris U., VI-VII

    2010-09-01

    We have presented results in two different yet strongly linked aspects of Higgs boson physics. We have learned about the importance of the Higgs boson for the fate of the Standard Model, being either only a theory limited to explaining phenomena at the electroweak scale or, if the Higgs boson lies within a mass range of 130 < m{sub H} < 160 GeV the SM would remain a self consistent theory up to highest energy scales O(m{sub Pl}). This could have direct implications on theories of cosmological inflation using the Higgs boson as the particle giving rise to inflation in the very early Universe, if it couples non-minimally to gravity, an effect that would only become significant at very high energies. After understanding the immense meaning of proving whether the Higgs boson exists and if so, at which mass, we have presented a direct search for a Higgs boson in associated production with a W boson in a mass range 100 < m{sub H} < 150 GeV. A light Higgs boson is favored regarding constraints from electroweak precision measurements. As a single analysis is not yet sensitive for an observation of the Higgs boson using 5.3 fb{sup -1} of Tevatron data, we set limits on the production cross section times branching ratio. At the Tevatron, however, we are able to combine the sensitivity of our analyses not only across channels or analyses at a single experiment but also across both experiments, namely CDF and D0. This yields to the so-called Tevatron Higgs combination which, in total, combines 129 analyses from both experiments with luminosities of up to 6.7 fb{sup -1}. The results of a previous Tevatron combination led to the first exclusion of possible Higgs boson masses since the LEP exclusion in 2001. The latest Tevatron combination from July 2010 can be seen in Fig. 111 and limits compared to the Standard Model expectation are listed in Table 23. It excludes a SM Higgs boson in the regions of 100 < m{sub H} < 109 GeV as well as 158 < m{sub H} < 175 GeV based on the observed final limits at 95% C.L. In the most interesting low mass region between 115 and 135 GeV, even the full Tevatron combination is not yet sensitive enough to exclude a Higgs boson, or to even prove its existence with a meaningful significance. Fig. 112 shows a projection plot for sensitivity to the SM Higgs boson at the Tevatron as a measure of increasing luminosity. The 10 fb{sup -1} projection is a rather conservative outlook for the coming year of data taking as the Tevatron runs smoothly and the run till the end of 2011 is assured. By now, already 9 fb{sup -1} have been recorded by the two experiments. As the extrapolation plot shows, this amount of luminosity will allow to exclude the Higgs boson over a wide mass range at a 95% C.L. With the LHC at CERN now running and successfully collecting first data, it is worth looking at projections of Higgs boson sensitivity at the current center of mass energy of 7 TeV of the LHC accelerator. Fig. 113 shows a projection of a possible SM Higgs boson exclusion using 1 fb{sup -1} of LHC data collected by the ATLAS experiment. An exclusion is expected between 135 and 188 GeV at 95% C.L., combining the three decay channels H {yields} WW, H {yields} ZZ and H {yields} {gamma}{gamma}. A combination between LHC experiments would possibly yield an even broader range of excluded Higgs boson mass points. Therefore, whether at the Tevatron or the LHC, exciting times in the exclusion or possible discovery of the SM Higgs boson lie ahead.

  16. Template based parallel checkpointing in a massively parallel computer system

    DOEpatents

    Archer, Charles Jens (Rochester, MN); Inglett, Todd Alan (Rochester, MN)

    2009-01-13

    A method and apparatus for a template based parallel checkpoint save for a massively parallel super computer system using a parallel variation of the rsync protocol, and network broadcast. In preferred embodiments, the checkpoint data for each node is compared to a template checkpoint file that resides in the storage and that was previously produced. Embodiments herein greatly decrease the amount of data that must be transmitted and stored for faster checkpointing and increased efficiency of the computer system. Embodiments are directed to a parallel computer system with nodes arranged in a cluster with a high speed interconnect that can perform broadcast communication. The checkpoint contains a set of actual small data blocks with their corresponding checksums from all nodes in the system. The data blocks may be compressed using conventional non-lossy data compression algorithms to further reduce the overall checkpoint size.

  17. Parallelization of the SIR code

    NASA Astrophysics Data System (ADS)

    Thonhofer, S.; Bellot Rubio, L. R.; Utz, D.; Jur?ak, J.; Hanslmeier, A.; Piantschitsch, I.; Pauritsch, J.; Lemmerer, B.; Guttenbrunner, S.

    A high-resolution 3-dimensional model of the photospheric magnetic field is essential for the investigation of small-scale solar magnetic phenomena. The SIR code is an advanced Stokes-inversion code that deduces physical quantities, e.g. magnetic field vector, temperature, and LOS velocity, from spectropolarimetric data. We extended this code by the capability of directly using large data sets and inverting the pixels in parallel. Due to this parallelization it is now feasible to apply the code directly on extensive data sets. Besides, we included the possibility to use different initial model atmospheres for the inversion, which enhances the quality of the results.

  18. Toward Parallel Document Clustering

    SciTech Connect

    Mogill, Jace A.; Haglin, David J.

    2011-09-01

    A key challenge to automated clustering of documents in large text corpora is the high cost of comparing documents in a multimillion dimensional document space. The Anchors Hierarchy is a fast data structure and algorithm for localizing data based on a triangle inequality obeying distance metric, the algorithm strives to minimize the number of distance calculations needed to cluster the documents into “anchors” around reference documents called “pivots”. We extend the original algorithm to increase the amount of available parallelism and consider two implementations: a complex data structure which affords efficient searching, and a simple data structure which requires repeated sorting. The sorting implementation is integrated with a text corpora “Bag of Words” program and initial performance results of end-to-end a document processing workflow are reported.

  19. Search for direct production of charginos and neutralinos in events with three leptons and missing transverse momentum in = 8 TeV pp collisions with the ATLAS detector

    NASA Astrophysics Data System (ADS)

    Aad, G.; Abajyan, T.; Abbott, B.; Abdallah, J.; Khalek, S. Abdel; Abdinov, O.; Aben, R.; Abi, B.; Abolins, M.; AbouZeid, O. S.; Abramowicz, H.; Abreu, H.; Abulaiti, Y.; Acharya, B. S.; Adamczyk, L.; Adams, D. L.; Adelman, J.; Adomeit, S.; Adye, T.; Agatonovic-Jovin, T.; Aguilar-Saavedra, J. A.; Agustoni, M.; Ahlen, S. P.; Ahmad, A.; Ahmadov, F.; Aielli, G.; Åkesson, T. P. A.; Akimoto, G.; Akimov, A. V.; Albert, J.; Albrand, S.; Verzini, M. J. Alconada; Aleksa, M.; Aleksandrov, I. N.; Alexa, C.; Alexander, G.; Alexandre, G.; Alexopoulos, T.; Alhroob, M.; Alimonti, G.; Alio, L.; Alison, J.; Allbrooke, B. M. M.; Allison, L. J.; Allport, P. P.; Allwood-Spiers, S. E.; Almond, J.; Aloisio, A.; Alon, R.; Alonso, A.; Alonso, F.; Alpigiani, C.; Altheimer, A.; Gonzalez, B. Alvarez; Alviggi, M. G.; Amako, K.; Coutinho, Y. Amaral; Amelung, C.; Amidei, D.; Ammosov, V. V.; Santos, S. P. Amor Dos; Amorim, A.; Amoroso, S.; Amram, N.; Amundsen, G.; Anastopoulos, C.; Ancu, L. S.; Andari, N.; Andeen, T.; Anders, C. F.; Anders, G.; Anderson, K. J.; Andreazza, A.; Andrei, V.; Anduaga, X. S.; Angelidakis, S.; Anger, P.; Angerami, A.; Anghinolfi, F.; Anisenkov, A. V.; Anjos, N.; Annovi, A.; Antonaki, A.; Antonelli, M.; Antonov, A.; Antos, J.; Anulli, F.; Aoki, M.; Bella, L. Aperio; Apolle, R.; Arabidze, G.; Aracena, I.; Arai, Y.; Araque, J. P.; Arce, A. T. H.; Arguin, J.-F.; Argyropoulos, S.; Arik, M.; Armbruster, A. J.; Arnaez, O.; Arnal, V.; Arslan, O.; Artamonov, A.; Artoni, G.; Asai, S.; Asbah, N.; Ashkenazi, A.; Ask, S.; Åsman, B.; Asquith, L.; Assamagan, K.; Astalos, R.; Atkinson, M.; Atlay, N. B.; Auerbach, B.; Auge, E.; Augsten, K.; Aurousseau, M.; Avolio, G.; Azuelos, G.; Azuma, Y.; Baak, M. A.; Bacci, C.; Bachacou, H.; Bachas, K.; Backes, M.; Backhaus, M.; Mayes, J. Backus; Badescu, E.; Bagiacchi, P.; Bagnaia, P.; Bai, Y.; Bailey, D. C.; Bain, T.; Baines, J. T.; Baker, O. K.; Baker, S.; Balek, P.; Balli, F.; Banas, E.; Banerjee, Sw.; Banfi, D.; Bangert, A.; Bannoura, A. A. E.; Bansal, V.; Bansil, H. S.; Barak, L.; Baranov, S. P.; Barber, T.; Barberio, E. L.; Barberis, D.; Barbero, M.; Barillari, T.; Barisonzi, M.; Barklow, T.; Barlow, N.; Barnett, B. M.; Barnett, R. M.; Barnovska, Z.; Baroncelli, A.; Barone, G.; Barr, A. J.; Barreiro, F.; da Costa, J. Barreiro Guimarães; Bartoldus, R.; Barton, A. E.; Bartos, P.; Bartsch, V.; Bassalat, A.; Basye, A.; Bates, R. L.; Batkova, L.; Batley, J. R.; Battistin, M.; Bauer, F.; Bawa, H. S.; Beau, T.; Beauchemin, P. H.; Beccherle, R.; Bechtle, P.; Beck, H. P.; Becker, K.; Becker, S.; Beckingham, M.; Becot, C.; Beddall, A. J.; Beddall, A.; Bedikian, S.; Bednyakov, V. A.; Bee, C. P.; Beemster, L. J.; Beermann, T. A.; Begel, M.; Behr, K.; Belanger-Champagne, C.; Bell, P. J.; Bell, W. H.; Bella, G.; Bellagamba, L.; Bellerive, A.; Bellomo, M.; Belloni, A.; Beloborodova, O. L.; Belotskiy, K.; Beltramello, O.; Benary, O.; Benchekroun, D.; Bendtz, K.; Benekos, N.; Benhammou, Y.; Noccioli, E. Benhar; Garcia, J. A. Benitez; Benjamin, D. P.; Bensinger, J. R.; Benslama, K.; Bentvelsen, S.; Berge, D.; Kuutmann, E. Bergeaas; Berger, N.; Berghaus, F.; Berglund, E.; Beringer, J.; Bernard, C.; Bernat, P.; Bernius, C.; Bernlochner, F. U.; Berry, T.; Berta, P.; Bertella, C.; Bertolucci, F.; Besana, M. I.; Besjes, G. J.; Bessidskaia, O.; Besson, N.; Betancourt, C.; Bethke, S.; Bhimji, W.; Bianchi, R. M.; Bianchini, L.; Bianco, M.; Biebel, O.; Bieniek, S. P.; Bierwagen, K.; Biesiada, J.; Biglietti, M.; De Mendizabal, J. Bilbao; Bilokon, H.; Bindi, M.; Binet, S.; Bingul, A.; Bini, C.; Black, C. W.; Black, J. E.; Black, K. M.; Blackburn, D.; Blair, R. E.; Blanchard, J.-B.; Blazek, T.; Bloch, I.; Blocker, C.; Blum, W.; Blumenschein, U.; Bobbink, G. J.; Bobrovnikov, V. S.; Bocchetta, S. S.; Bocci, A.; Boddy, C. R.; Boehler, M.; Boek, J.; Boek, T. T.; Bogaerts, J. A.; Bogdanchikov, A. G.; Bogouch, A.; Bohm, C.; Bohm, J.; Boisvert, V.; Bold, T.; Boldea, V.; Boldyrev, A. S.; Bolnet, N. M.; Bomben, M.; Bona, M.; Boonekamp, M.; Borisov, A.; Borissov, G.; Borri, M.; Borroni, S.; Bortfeldt, J.; Bortolotto, V.; Bos, K.; Boscherini, D.; Bosman, M.; Boterenbrood, H.; Boudreau, J.; Bouffard, J.; Bouhova-Thacker, E. V.; Boumediene, D.; Bourdarios, C.; Bousson, N.; Boutouil, S.; Boveia, A.; Boyd, J.; Boyko, I. R.; Bozovic-Jelisavcic, I.; Bracinik, J.; Branchini, P.; Brandt, A.; Brandt, G.; Brandt, O.; Bratzler, U.; Brau, B.; Brau, J. E.; Braun, H. M.; Brazzale, S. F.; Brelier, B.; Brendlinger, K.; Brennan, A. J.; Brenner, R.; Bressler, S.; Bristow, K.; Bristow, T. M.; Britton, D.; Brochu, F. M.; Brock, I.; Brock, R.; Bromberg, C.; Bronner, J.; Brooijmans, G.; Brooks, T.; Brooks, W. K.; Brosamer, J.; Brost, E.; Brown, G.; Brown, J.; de Renstrom, P. A. Bruckman; Bruncko, D.; Bruneliere, R.

    2014-04-01

    A search for the direct production of charginos and neutralinos in final states with three leptons and missing transverse momentum is presented. The analysis is based on 20.3 fb-1 of = 8 TeV proton-proton collision data delivered by the Large Hadron Collider and recorded with the ATLAS detector. Observations are consistent with the Standard Model expectations and limits are set in R-parity-conserving phenomenological Minimal Supersymmetric Standard Models and in simplified supersymmetric models, significantly extending previous results. For simplified supersymmetric models of direct chargino and next-to-lightest neutralino production with decays to lightest neutralino via either all three generations of sleptons, staus only, gauge bosons, or Higgs bosons, and masses are excluded up to 700 GeV, 380 GeV, 345 GeV, or 148 GeV respectively, for a massless . [Figure not available: see fulltext.

  20. A join algorithm for combining AND parallel solutions in AND/OR parallel systems

    SciTech Connect

    Ramkumar, B. ); Kale, L.V. )

    1992-02-01

    When two or more literals in the body of a Prolog clause are solved in (AND) parallel, their solutions need to be joined to compute solutions for the clause. This is often a difficult problem in parallel Prolog systems that exploit OR and independent AND parallelism in Prolog programs. In several AND/OR parallel systems proposed recently, this problem is side-stepped at the cost of unexploited OR parallelism in the program, in part due to the complexity of the backtracking algorithm beneath AND parallel branches. In some cases, the data dependency graphs used by these systems cannot represent all the exploitable independent AND parallelism known at compile time. In this paper, we describe the compile time analysis for an optimized join algorithm for supporting independent AND parallelism in logic programs efficiently without leaving and OR parallelism unexploited. We then discuss how this analysis can be used to yield very efficient runtime behavior. We also discuss problems associated with a tree representation of the search space when arbitrarily complex data dependency graphs are permitted. We describe how these problems can be resolved by mapping the search space onto data dependency graphs themselves. The algorithm has been implemented in a compiler for parallel Prolog based on the reduce-OR process model. The algorithm is suitable for the implementation of AND/OR systems on both shared and nonshared memory machines. Performance on benchmark programs.

  1. Predicting performance of parallel computations

    NASA Technical Reports Server (NTRS)

    Mak, Victor W.; Lundstrom, Stephen F.

    1990-01-01

    An accurate and computationally efficient method for predicting the performance of a class of parallel computations running on concurrent systems is described. A parallel computation is modeled as a task system with precedence relationships expressed as a series-parallel directed acyclic graph. Resources in a concurrent system are modeled as service centers in a queuing network model. Using these two models as inputs, the method outputs predictions of expected execution time of the parallel computation and the concurrent system utilization. The method is validated against both detailed simulation and actual execution on a commercial multiprocessor. Using 100 test cases, the average error of the prediction when compared to simulation statistics is 1.7 percent, with a standard deviation of 1.5 percent; the maximum error is about 10 percent.

  2. Xyce(?) Parallel Electronic Simulator

    Energy Science and Technology Software Center (ESTSC)

    2013-10-03

    The Xyce Parallel Electronic Simulator simulates electronic circuit behavior in DC, AC, HB, MPDE and transient mode using standard analog (DAE) and/or device (PDE) device models including several age and radiation aware devices. It supports a variety of computing platforms (both serial and parallel) computers. Lastly, it uses a variety of modern solution algorithms dynamic parallel load-balancing and iterative solvers.! ! Xyce is primarily used to simulate the voltage and current behavior of a circuitmore »network (a network of electronic devices connected via a conductive network). As a tool, it is mainly used for the design and analysis of electronic circuits.! ! Kirchoff's conservation laws are enforced over a network using modified nodal analysis. This results in a set of differential algebraic equations (DAEs). The resulting nonlinear problem is solved iteratively using a fully coupled Newton method, which in turn results in a linear system that is solved by either a standard sparse-direct solver or iteratively using Trilinos linear solver packages, also developed at Sandia National Laboratories.« less

  3. Xyce(?) Parallel Electronic Simulator

    SciTech Connect

    2013-10-03

    The Xyce Parallel Electronic Simulator simulates electronic circuit behavior in DC, AC, HB, MPDE and transient mode using standard analog (DAE) and/or device (PDE) device models including several age and radiation aware devices. It supports a variety of computing platforms (both serial and parallel) computers. Lastly, it uses a variety of modern solution algorithms dynamic parallel load-balancing and iterative solvers.! ! Xyce is primarily used to simulate the voltage and current behavior of a circuit network (a network of electronic devices connected via a conductive network). As a tool, it is mainly used for the design and analysis of electronic circuits.! ! Kirchoff's conservation laws are enforced over a network using modified nodal analysis. This results in a set of differential algebraic equations (DAEs). The resulting nonlinear problem is solved iteratively using a fully coupled Newton method, which in turn results in a linear system that is solved by either a standard sparse-direct solver or iteratively using Trilinos linear solver packages, also developed at Sandia National Laboratories.

  4. Parallelization for reaction

    E-print Network

    Louvet, Violaine

    Parallelization for reaction waves with complex chemistry Context Application Background Numerical Results Conclusions and Perspectives Parallelization strategies for multi-scale reaction waves for Engineering - Paraguay 2010 #12;Parallelization for reaction waves with complex chemistry Context Application

  5. Search for direct CP violation in \\Lambda and \\Xi hyperon decays C. G. White, a R. A. Burnstein, a M. Carmack, j A. Chakravorty, a A. Chan, b Y. C. Chen, b

    E-print Network

    Fermilab Experiment E871

    1 Search for direct CP violation in \\Lambda and \\Xi hyperon decays C. G. White, a R. A. Burnstein for direct CP violation in \\Xi \\Gamma ( ¯ \\Xi + ) and \\Lambda ( ¯ \\Lambda) decays is underway at FNAL. Experiment E871 (HyperCP) intends to perform a precision measurement of the angular distribution of protons

  6. Fits to the Fermi-LAT GeV excess with RH sneutrino dark matter: implications for direct and indirect dark matter searches and the LHC

    E-print Network

    D. G. Cerdeno; M. Peiro; S. Robles

    2015-07-31

    We show that the right-handed (RH) sneutrino in the NMSSM can account for the observed excess in the Fermi-LAT spectrum of gamma rays from the Galactic Centre, while fulfilling all the current experimental constraints from the LHC as well as from direct and indirect dark matter searches. We have explored the parameter space of this scenario, computed the gamma ray spectrum for each phenomenologically viable solution and then performed a chi^2 fit to the excess. Unlike previous studies based on model independent interpretations, we have taken into account the full annihilation spectrum, without assuming pure annihilation channels. Furthermore, we have incorporated limits from direct detection experiments, LHC bounds and also the constraints from Fermi-LAT on dwarf spheroidal galaxies (dSphs) and gamma ray spectral lines. In addition, we have estimated the effect of the most recent Fermi-LAT reprocessed data (Pass 8). In general, we obtain good fits to the GCE when the RH sneutrino annihilates mainly into pairs of light singlet-like scalar or pseudoscalar Higgs bosons that subsequently decay in flight, producing four-body final states and spectral features that improve the goodness of the fit at large energies. The best fit (chi^2=20.8) corresponds to a RH sneutrino with a mass of 64 GeV which annihilates preferentially into a pair of light singlet-like pseudoscalar Higgs bosons (with masses of order 60 GeV). Besides, we have analysed other channels that also provide good fits to the excess. Finally, we discuss the implications for direct and indirect detection searches paying special attention to the possible appearance of gamma ray spectral features in near future Fermi-LAT analyses, as well as deviations from the SM-like Higgs properties at the LHC. Remarkably, many of the scenarios that fit the GCE can also be probed by these other complementary techniques.

  7. Anisotropic diffusion of electrons in liquid xenon with application to improving the sensitivity of direct dark matter searches

    SciTech Connect

    Sorensen, P

    2011-02-14

    Electron diffusion in a liquid xenon time projection chamber has recently been used to infer the z coordinate of a particle interaction, from the width of the electron signal. The goal of this technique is to reduce the background event rate by discriminating edge events from bulk events. Analyses of dark matter search data which employ it would benefit from increased longitudinal electron diffusion. We show that a significant increase is expected if the applied electric field is decreased. This observation is trivial to implement but runs contrary to conventional wisdom and practice. We also extract a first measurement of the longitudinal diffusion coefficient, and confirm the expectation that electron diffusion in liquid xenon is highly anisotropic under typical operating conditions.

  8. Topic-based Index Partitions for Efficient and Effective Selective Search

    E-print Network

    Callan, Jamie

    Keywords selective searching, federated search, document clustering 1. INTRODUCTION TraditionallyTopic-based Index Partitions for Efficient and Effective Selective Search Anagha Kulkarni and Jamie divided into shards that are distributed across multiple computers and searched in parallel to provide

  9. Integrated Task and Data Parallel Programming

    NASA Technical Reports Server (NTRS)

    Grimshaw, A. S.

    1998-01-01

    This research investigates the combination of task and data parallel language constructs within a single programming language. There are an number of applications that exhibit properties which would be well served by such an integrated language. Examples include global climate models, aircraft design problems, and multidisciplinary design optimization problems. Our approach incorporates data parallel language constructs into an existing, object oriented, task parallel language. The language will support creation and manipulation of parallel classes and objects of both types (task parallel and data parallel). Ultimately, the language will allow data parallel and task parallel classes to be used either as building blocks or managers of parallel objects of either type, thus allowing the development of single and multi-paradigm parallel applications. 1995 Research Accomplishments In February I presented a paper at Frontiers 1995 describing the design of the data parallel language subset. During the spring I wrote and defended my dissertation proposal. Since that time I have developed a runtime model for the language subset. I have begun implementing the model and hand-coding simple examples which demonstrate the language subset. I have identified an astrophysical fluid flow application which will validate the data parallel language subset. 1996 Research Agenda Milestones for the coming year include implementing a significant portion of the data parallel language subset over the Legion system. Using simple hand-coded methods, I plan to demonstrate (1) concurrent task and data parallel objects and (2) task parallel objects managing both task and data parallel objects. My next steps will focus on constructing a compiler and implementing the fluid flow application with the language. Concurrently, I will conduct a search for a real-world application exhibiting both task and data parallelism within the same program. Additional 1995 Activities During the fall I collaborated with Andrew Grimshaw and Adam Ferrari to write a book chapter which will be included in Parallel Processing in C++ edited by Gregory Wilson. I also finished two courses, Compilers and Advanced Compilers, in 1995. These courses complete my class requirements at the University of Virginia. I have only my dissertation research and defense to complete.

  10. Confronting recent results from selected direct and indirect dark matter searches and the Higgs boson with supersymmetric models with non-universal gaugino masses

    SciTech Connect

    Spies, A.; Anton, G. E-mail: gisela.anton@physik.uni-erlangen.de

    2013-06-01

    In this paper we study a class of supersymmetric models with non-universal gaugino masses that arise from a mixture of SU(5) singlet and non-singlet representations, i.e. a combination of 1, 24, 75 and 200. Based on these models we calculate the expected dark matter signatures within the linear combination 1 ? 24 ? 75 ? 200. We confront the model predictions with the detected boson as well as current experimental limits from selected indirect and direct dark matter search experiments ANTARES respective IceCube and XENON. We comment on the detection/exclusion capability of the future XENON 1t project. For the investigated parameter span we could not find a SU(5) singlet model that fulfils the Higgs mass and the relic density constraint. In contrary, allowing a mixture of 1 ? 24 ? 75 ? 200 enables a number of models fulfilling these constraints.

  11. WMAP-normalized Inflationary Model Predictions and the Search for Primordial Gravitational Waves with Direct Detection Experiments

    E-print Network

    Brett C. Friedman; Asantha Cooray; Alessandro Melchiorri

    2006-10-06

    In addition to density perturbations, inflationary models of the early universe generally predict a stochastic background of gravitational waves or tensor fluctuations. By making use of the inflationary flow approach for single field models and fitting the models with Monte-Carlo techniques to cosmic microwave background (CMB) data from the {\\it Wilkinson Microwave Anisotropy Probe} (WMAP), we discuss the expected properties of the gravitational wave background from inflation at scales corresponding to direct detection experiments with laser interferometers in space. We complement the Monte-Carlo numerical calculations by including predictions expected under several classes of analytical inflationary models. We find that an improved version of {\\it Big Bang Observer} (BBO-grand) can be used to detect a gravitational wave background at 0.1 Hz with a corresponding CMB tensor-to-scalar ratio above 10$^{-4}$. Even if the CMB tensor-to-scalar ratio were to be above 10$^{-2}$, we suggest that BBO-grand will be useful to study inflationary models as the standard version of BBO, with a sensitivity to a stochastic gravitational wave background $\\Omega_{\\rm GW}h^2 > 10^{-17}$, will only allow a marginal detection of the amplitude while leaving the tensor spectral index at 0.1 Hz unconstrained. We also discuss the extent to which CMB measurements can be used to predict the gravitational wave background amplitude in a direct detection experiment and how any measurement of the amplitude and the spectral tilt of the gravitational wave background at direct detection frequencies together with the CMB tensor-to-scalar ratio can be used to establish slow-roll inflation.

  12. Parallel rendering techniques for massively parallel visualization

    SciTech Connect

    Hansen, C.; Krogh, M.; Painter, J.

    1995-07-01

    As the resolution of simulation models increases, scientific visualization algorithms which take advantage of the large memory. and parallelism of Massively Parallel Processors (MPPs) are becoming increasingly important. For large applications rendering on the MPP tends to be preferable to rendering on a graphics workstation due to the MPP`s abundant resources: memory, disk, and numerous processors. The challenge becomes developing algorithms that can exploit these resources while minimizing overhead, typically communication costs. This paper will describe recent efforts in parallel rendering for polygonal primitives as well as parallel volumetric techniques. This paper presents rendering algorithms, developed for massively parallel processors (MPPs), for polygonal, spheres, and volumetric data. The polygon algorithm uses a data parallel approach whereas the sphere and volume render use a MIMD approach. Implementations for these algorithms are presented for the Thinking Ma.chines Corporation CM-5 MPP.

  13. Real-time trajectory optimization on parallel processors

    NASA Technical Reports Server (NTRS)

    Psiaki, Mark L.

    1993-01-01

    A parallel algorithm has been developed for rapidly solving trajectory optimization problems. The goal of the work has been to develop an algorithm that is suitable to do real-time, on-line optimal guidance through repeated solution of a trajectory optimization problem. The algorithm has been developed on an INTEL iPSC/860 message passing parallel processor. It uses a zero-order-hold discretization of a continuous-time problem and solves the resulting nonlinear programming problem using a custom-designed augmented Lagrangian nonlinear programming algorithm. The algorithm achieves parallelism of function, derivative, and search direction calculations through the principle of domain decomposition applied along the time axis. It has been encoded and tested on 3 example problems, the Goddard problem, the acceleration-limited, planar minimum-time to the origin problem, and a National Aerospace Plane minimum-fuel ascent guidance problem. Execution times as fast as 118 sec of wall clock time have been achieved for a 128-stage Goddard problem solved on 32 processors. A 32-stage minimum-time problem has been solved in 151 sec on 32 processors. A 32-stage National Aerospace Plane problem required 2 hours when solved on 32 processors. A speed-up factor of 7.2 has been achieved by using 32-nodes instead of 1-node to solve a 64-stage Goddard problem.

  14. Characterizing the parallelism in rule-based expert systems

    SciTech Connect

    Douglass, R.J.

    1984-01-01

    A brief review of two classes of rule-based expert systems is presented, followed by a detailed analysis of potential sources of parallelism at the production or rule level, the subrule level (including match, select, and act parallelism), and at the search level (including AND, OR, and stream parallelism). The potential amount of parallelism from each source is discussed and characterized in terms of its granularity, inherent serial constraints, efficiency, speedup, dynamic behavior, and communication volume, frequency, and topology. Subrule parallelism will yield, at best, two- to tenfold speedup, and rule level parallelism will yield a modest speedup on the order of 5 to 10 times. Rule level can be combined with OR, AND, and stream parallelism in many instances to yield further parallel speedups.

  15. Fast parallel algorithms on a class of graph structures with applications in relational databases and computer networks

    SciTech Connect

    Radhakrishnan, S.

    1990-01-01

    The quest for efficient parallel algorithms for graph related problems necessitates not only fast computational schemes but also requires insights into their inherent structures that lend themselves to elegant problem solving methods. Towards this objective efficient parallel algorithms on a class of hypergraphs called acyclic hypergraphs and directed hypergraphs are developed in this thesis. In this thesis, first, the author presents efficient parallel algorithms for the following problems on graphs. (1) Determining whether a graph is strongly chordal, ptolemaic, or a block graph. If the graph is strongly chordal, determine the strongly perfect vertex elimination ordering. (2) Determining the minimal set of edges needed to make an arbitrary graph strong chordal, ptolemaic, or a block graph. (3) Determining the minimum cardinality dominating set, connected dominating set, total dominating set, and the domatic number of a strongly chordal graph. Secondly, he shows that the query implication problem (Q{sub 1} {yields} Q{sub 2}) on two queries, which is to determine whether the data retrieved by query Q{sub 1} is always a subset of the data retrieved by query Q{sub 2}, is not even in NP and in fact complete in {Pi}{sub 2{sup p}}. Thirdly, he develops efficient parallel algorithms for manipulating directed hypergraphs H such as finding a directed path in H, closure of H, and minimum equivalent hypergraph of H. Finally, he also presents an efficient parallel algorithm for multidimensional range search.

  16. Fast data parallel polygon rendering

    SciTech Connect

    Ortega, F.A.; Hansen, C.D.

    1993-09-01

    This paper describes a parallel method for polygonal rendering on a massively parallel SIMD machine. This method, based on a simple shading model, is targeted for applications which require very fast polygon rendering for extremely large sets of polygons such as is found in many scientific visualization applications. The algorithms described in this paper are incorporated into a library of 3D graphics routines written for the Connection Machine. The routines are implemented on both the CM-200 and the CM-5. This library enables a scientists to display 3D shaded polygons directly from a parallel machine without the need to transmit huge amounts of data to a post-processing rendering system.

  17. Fits to the Fermi-LAT GeV excess with RH sneutrino dark matter: implications for direct and indirect dark matter searches and the LHC

    E-print Network

    Cerdeno, D G; Robles, S

    2015-01-01

    We show that the right-handed (RH) sneutrino in the NMSSM can account for the observed excess in the Fermi-LAT spectrum of gamma rays from the Galactic Centre, while fulfilling all the current experimental constraints from the LHC as well as from direct and indirect dark matter searches. We have explored the parameter space of this scenario, computed the gamma ray spectrum for each phenomenologically viable solution and then performed a chi^2 fit to the excess. Unlike previous studies based on model independent interpretations, we have taken into account the full annihilation spectrum, without assuming pure annihilation channels. Furthermore, we have incorporated limits from direct detection experiments, LHC bounds and also the constraints from Fermi-LAT on dwarf spheroidal galaxies (dSphs) and gamma ray spectral lines. In addition, we have estimated the effect of the most recent Fermi-LAT reprocessed data (Pass~8). In general, we obtain good fits to the GCE when the RH sneutrino annihilates mainly into pairs...

  18. Message passing with parallel queue traversal

    DOEpatents

    Underwood, Keith D. (Albuquerque, NM); Brightwell, Ronald B. (Albuquerque, NM); Hemmert, K. Scott (Albuquerque, NM)

    2012-05-01

    In message passing implementations, associative matching structures are used to permit list entries to be searched in parallel fashion, thereby avoiding the delay of linear list traversal. List management capabilities are provided to support list entry turnover semantics and priority ordering semantics.

  19. Computing contingency statistics in parallel.

    SciTech Connect

    Bennett, Janine Camille; Thompson, David; Pebay, Philippe Pierre

    2010-09-01

    Statistical analysis is typically used to reduce the dimensionality of and infer meaning from data. A key challenge of any statistical analysis package aimed at large-scale, distributed data is to address the orthogonal issues of parallel scalability and numerical stability. Many statistical techniques, e.g., descriptive statistics or principal component analysis, are based on moments and co-moments and, using robust online update formulas, can be computed in an embarrassingly parallel manner, amenable to a map-reduce style implementation. In this paper we focus on contingency tables, through which numerous derived statistics such as joint and marginal probability, point-wise mutual information, information entropy, and {chi}{sup 2} independence statistics can be directly obtained. However, contingency tables can become large as data size increases, requiring a correspondingly large amount of communication between processors. This potential increase in communication prevents optimal parallel speedup and is the main difference with moment-based statistics where the amount of inter-processor communication is independent of data size. Here we present the design trade-offs which we made to implement the computation of contingency tables in parallel.We also study the parallel speedup and scalability properties of our open source implementation. In particular, we observe optimal speed-up and scalability when the contingency statistics are used in their appropriate context, namely, when the data input is not quasi-diffuse.

  20. Parallelizing Timed Petri Net simulations

    NASA Technical Reports Server (NTRS)

    Nicol, David M.

    1993-01-01

    The possibility of using parallel processing to accelerate the simulation of Timed Petri Nets (TPN's) was studied. It was recognized that complex system development tools often transform system descriptions into TPN's or TPN-like models, which are then simulated to obtain information about system behavior. Viewed this way, it was important that the parallelization of TPN's be as automatic as possible, to admit the possibility of the parallelization being embedded in the system design tool. Later years of the grant were devoted to examining the problem of joint performance and reliability analysis, to explore whether both types of analysis could be accomplished within a single framework. In this final report, the results of our studies are summarized. We believe that the problem of parallelizing TPN's automatically for MIMD architectures has been almost completely solved for a large and important class of problems. Our initial investigations into joint performance/reliability analysis are two-fold; it was shown that Monte Carlo simulation, with importance sampling, offers promise of joint analysis in the context of a single tool, and methods for the parallel simulation of general Continuous Time Markov Chains, a model framework within which joint performance/reliability models can be cast, were developed. However, very much more work is needed to determine the scope and generality of these approaches. The results obtained in our two studies, future directions for this type of work, and a list of publications are included.

  1. Multi-Target-Directed Ligands and other Therapeutic Strategies in the Search of a Real Solution for Alzheimer's Disease

    PubMed Central

    Agis-Torres, Angel; Sölhuber, Monica; Fernandez, Maria; Sanchez-Montero, J.M.

    2014-01-01

    The lack of an adequate therapy for Alzheimer's Disease (AD) contributes greatly to the continuous growing amount of papers and reviews, reflecting the important efforts made by scientists in this field. It is well known that AD is the most common cause of dementia, and up-to-date there is no prevention therapy and no cure for the disease, which contrasts with the enormous efforts put on the task. On the other hand many aspects of AD are currently debated or even unknown. This review offers a view of the current state of knowledge about AD which includes more relevant findings and processes that take part in the disease; it also shows more relevant past, present and future research on therapeutic drugs taking into account the new paradigm “Multi-Target-Directed Ligands” (MTDLs). In our opinion, this paradigm will lead from now on the research toward the discovery of better therapeutic solutions, not only in the case of AD but also in other complex diseases. This review highlights the strategies followed by now, and focuses other emerging targets that should be taken into account for the future development of new MTDLs. Thus, the path followed in this review goes from the pathology and the processes involved in AD to the strategies to consider in on-going and future researches. PMID:24533013

  2. Parallel Factor Analysis of 4.2 K Excitation-Emission Matrices for the Direct Determination of Dibenzopyrene Isomers in Coal-Tar Samples with a Cryogenic Fiber-Optic Probe Coupled to a Commercial Spectrofluorimeter.

    PubMed

    Moore, Anthony F T; Goicoechea, Hector C; Barbosa, Fernando; Campiglia, Andres D

    2015-01-01

    Several studies have shown high concentrations of polycyclic aromatic hydrocarbons (PAHs) in living spaces and soil adjacent to parking lots sealed with coal-tar-based products. Recent attention has been paid to the presence of seven PAHs in coal-tar samples, namely, benz[a]anthracene, benzo[k]-fluoranthene, benzo[b]fluoranthene, benzo[a]pyrene, chrysene, dibenz[a,h]anthracene, and indeno[1,2,3-cd]pyrene, and their association to significant increases in estimated excess lifetime cancer risk for nearby residents. Herein, we present an analytical approach to screen the presence of five highly toxic, high-molecular weight PAHs (HMW-PAHs) in coal-tar samples. These include dibenzo[a,l]pyrene, dibenzo[a,i]pyrene, dibenzo[a,e]pyrene, dibenzo[a,h]pyrene, and naphtho[2,3-a]pyrene. Their direct analysis, without chromatographic separation, in a reference coal-tar sample is made possible with the combination of excitation-emission matrices (EEMs) and parallel factor analysis (PARAFAC). EEMs are recorded at 4.2 K with the aid of a cryogenic fiber-optic probe and a commercial spectrofluorimeter. The simplicity of the experimental procedure and the excellent analytical figures of merit demonstrate the screening potential of this environmentally friendly approach for the routine analysis of numerous coal-tar samples. PMID:25902285

  3. A Parallel Algorithm for the Vehicle Routing Problem

    SciTech Connect

    Groer, Christopher S; Golden, Bruce; Edward, Wasil

    2011-01-01

    The vehicle routing problem (VRP) is a dicult and well-studied combinatorial optimization problem. We develop a parallel algorithm for the VRP that combines a heuristic local search improvement procedure with integer programming. We run our parallel algorithm with as many as 129 processors and are able to quickly nd high-quality solutions to standard benchmark problems. We assess the impact of parallelism by analyzing our procedure's performance under a number of dierent scenarios.

  4. Quantum Search in Hilbert Space

    NASA Technical Reports Server (NTRS)

    Zak, Michail

    2003-01-01

    A proposed quantum-computing algorithm would perform a search for an item of information in a database stored in a Hilbert-space memory structure. The algorithm is intended to make it possible to search relatively quickly through a large database under conditions in which available computing resources would otherwise be considered inadequate to perform such a task. The algorithm would apply, more specifically, to a relational database in which information would be stored in a set of N complex orthonormal vectors, each of N dimensions (where N can be exponentially large). Each vector would constitute one row of a unitary matrix, from which one would derive the Hamiltonian operator (and hence the evolutionary operator) of a quantum system. In other words, all the stored information would be mapped onto a unitary operator acting on a quantum state that would represent the item of information to be retrieved. Then one could exploit quantum parallelism: one could pose all search queries simultaneously by performing a quantum measurement on the system. In so doing, one would effectively solve the search problem in one computational step. One could exploit the direct- and inner-product decomposability of the unitary matrix to make the dimensionality of the memory space exponentially large by use of only linear resources. However, inasmuch as the necessary preprocessing (the mapping of the stored information into a Hilbert space) could be exponentially expensive, the proposed algorithm would likely be most beneficial in applications in which the resources available for preprocessing were much greater than those available for searching.

  5. Parallel flow diffusion battery

    DOEpatents

    Yeh, H.C.; Cheng, Y.S.

    1984-01-01

    A parallel flow diffusion battery for determining the mass distribution of an aerosol has a plurality of diffusion cells mounted in parallel to an aerosol stream, each diffusion cell including a stack of mesh wire screens of different density.

  6. Parallel flow diffusion battery

    DOEpatents

    Yeh, Hsu-Chi (Albuquerque, NM); Cheng, Yung-Sung (Albuquerque, NM)

    1984-08-07

    A parallel flow diffusion battery for determining the mass distribution of an aerosol has a plurality of diffusion cells mounted in parallel to an aerosol stream, each diffusion cell including a stack of mesh wire screens of different density.

  7. Search for direct pair production of the top squark in all-hadronic final states in proton-proton collisions at ?s = 8 TeV with the ATLAS detector

    E-print Network

    Taylor, Frank E.

    The results of a search for direct pair production of the scalar partner to the top quark using an integrated luminosity of 20.1 fb?1 of proton-proton collision data at s? = 8 TeV recorded with the ATLAS detector at the ...

  8. Search for direct production of charginos and neutralinos in events with three leptons and missing transverse momentum in ?s = 7 TeV pp collisions with the ATLAS detector

    E-print Network

    Taylor, Frank E.

    A search for the direct production of charginos and neutralinos in final states with three electrons or muons and missing transverse momentum is presented. The analysis is based on 4.7 fb[superscript -1] of ?s = 7 TeV ...

  9. Parallel Discrete Event Simulation

    NASA Astrophysics Data System (ADS)

    Kunz, Georg

    Ever since discrete event simulation has been adopted by a large research community, simulation developers have attempted to draw benefits from executing a simulation on multiple processing units in parallel. Hence, a wide range of research has been conducted on Parallel Discrete Event Simulation (PDES). In this chapter we give an overview of the challenges and approaches of parallel simulation. Furthermore, we present a survey of the parallelization capabilities of the network simulators OMNeT++, ns-2, DSIM and JiST.

  10. Research in parallel computing

    NASA Technical Reports Server (NTRS)

    Ortega, James M.; Henderson, Charles

    1994-01-01

    This report summarizes work on parallel computations for NASA Grant NAG-1-1529 for the period 1 Jan. - 30 June 1994. Short summaries on highly parallel preconditioners, target-specific parallel reductions, and simulation of delta-cache protocols are provided.

  11. Combinatorial Parallel and Scientific

    E-print Network

    Pinar, Ali

    Combinatorial algorithms have long played a pivotal enabling role in many applica- tions of parallel computing computational techniques and rapidly changing computational platforms. But the relationship be- tween parallel the relationship between discrete algorithms and parallel computing. In addition to their traditional role

  12. Parallel simulation today

    NASA Technical Reports Server (NTRS)

    Nicol, David; Fujimoto, Richard

    1992-01-01

    This paper surveys topics that presently define the state of the art in parallel simulation. Included in the tutorial are discussions on new protocols, mathematical performance analysis, time parallelism, hardware support for parallel simulation, load balancing algorithms, and dynamic memory management for optimistic synchronization.

  13. Verbal and Visual Parallelism

    ERIC Educational Resources Information Center

    Fahnestock, Jeanne

    2003-01-01

    This study investigates the practice of presenting multiple supporting examples in parallel form. The elements of parallelism and its use in argument were first illustrated by Aristotle. Although real texts may depart from the ideal form for presenting multiple examples, rhetorical theory offers a rationale for minimal, parallel presentation. The…

  14. Parallel algorithm for dominant points correspondences in robot binocular stereo vision

    NASA Technical Reports Server (NTRS)

    Al-Tammami, A.; Singh, B.

    1993-01-01

    This paper presents an algorithm to find the correspondences of points representing dominant feature in robot stereo vision. The algorithm consists of two main steps: dominant point extraction and dominant point matching. In the feature extraction phase, the algorithm utilizes the widely used Moravec Interest Operator and two other operators: the Prewitt Operator and a new operator called Gradient Angle Variance Operator. The Interest Operator in the Moravec algorithm was used to exclude featureless areas and simple edges which are oriented in the vertical, horizontal, and two diagonals. It was incorrectly detecting points on edges which are not on the four main directions (vertical, horizontal, and two diagonals). The new algorithm uses the Prewitt operator to exclude featureless areas, so that the Interest Operator is applied only on the edges to exclude simple edges and to leave interesting points. This modification speeds-up the extraction process by approximately 5 times. The Gradient Angle Variance (GAV), an operator which calculates the variance of the gradient angle in a window around the point under concern, is then applied on the interesting points to exclude the redundant ones and leave the actual dominant ones. The matching phase is performed after the extraction of the dominant points in both stereo images. The matching starts with dominant points in the left image and does a local search, looking for corresponding dominant points in the right image. The search is geometrically constrained the epipolar line of the parallel-axes stereo geometry and the maximum disparity of the application environment. If one dominant point in the right image lies in the search areas, then it is the corresponding point of the reference dominant point in the left image. A parameter provided by the GAV is thresholded and used as a rough similarity measure to select the corresponding dominant point if there is more than one point the search area. The correlation is used as a final decision tool when there is still more than one point in the search area. If there is no dominant point in the search area of if the points in the search area are below a correlation threshold, then the dominant point in the reference image is occluded and can not be corresponded. The algorithm has been modeled, implemented and shown to be fast, robust and parallel. The parallelism is created from three main features: locality of the operators; a memory optimization scheme; and the ability to fully parallelize the extraction phase which is the most computational intensive task in the algorithm. The last feature is achieved by performing the extraction phase on the two images simultaneously.

  15. Search for direct top-squark pair production in final states with two leptons in pp collisions at = 8 TeV with the ATLAS detector

    NASA Astrophysics Data System (ADS)

    Aad, G.; Abajyan, T.; Abbott, B.; Abdallah, J.; Abdel Khalek, S.; Abdinov, O.; Aben, R.; Abi, B.; Abolins, M.; AbouZeid, O. S.; Abramowicz, H.; Abreu, H.; Abulaiti, Y.; Acharya, B. S.; Adamczyk, L.; Adams, D. L.; Adelman, J.; Adomeit, S.; Adye, T.; Agatonovic-Jovin, T.; Aguilar-Saavedra, J. A.; Agustoni, M.; Ahlen, S. P.; Ahmad, A.; Ahmadov, F.; Aielli, G.; Åkesson, T. P. A.; Akimoto, G.; Akimov, A. V.; Albert, J.; Albrand, S.; Verzini, M. J. Alconada; Aleksa, M.; Aleksandrov, I. N.; Alexa, C.; Alexander, G.; Alexandre, G.; Alexopoulos, T.; Alhroob, M.; Alimonti, G.; Alio, L.; Alison, J.; Allbrooke, B. M. M.; Allison, L. J.; Allport, P. P.; Allwood-Spiers, S. E.; Almond, J.; Aloisio, A.; Alon, R.; Alonso, A.; Alonso, F.; Alpigiani, C.; Altheimer, A.; Gonzalez, B. Alvarez; Alviggi, M. G.; Amako, K.; Coutinho, Y. Amaral; Amelung, C.; Amidei, D.; Ammosov, V. V.; Santos, S. P. Amor Dos; Amorim, A.; Amoroso, S.; Amram, N.; Amundsen, G.; Anastopoulos, C.; Ancu, L. S.; Andari, N.; Andeen, T.; Anders, C. F.; Anders, G.; Anderson, K. J.; Andreazza, A.; Andrei, V.; Anduaga, X. S.; Angelidakis, S.; Anger, P.; Angerami, A.; Anghinolfi, F.; Anisenkov, A. V.; Anjos, N.; Annovi, A.; Antonaki, A.; Antonelli, M.; Antonov, A.; Antos, J.; Anulli, F.; Aoki, M.; Bella, L. Aperio; Apolle, R.; Arabidze, G.; Aracena, I.; Arai, Y.; Araque, J. P.; Arce, A. T. H.; Arguin, J.-F.; Argyropoulos, S.; Arik, M.; Armbruster, A. J.; Arnaez, O.; Arnal, V.; Arslan, O.; Artamonov, A.; Artoni, G.; Asai, S.; Asbah, N.; Ashkenazi, A.; Ask, S.; Åsman, B.; Asquith, L.; Assamagan, K.; Astalos, R.; Atkinson, M.; Atlay, N. B.; Auerbach, B.; Auge, E.; Augsten, K.; Aurousseau, M.; Avolio, G.; Azuelos, G.; Azuma, Y.; Baak, M. A.; Bacci, C.; Bachacou, H.; Bachas, K.; Backes, M.; Backhaus, M.; Backus Mayes, J.; Badescu, E.; Bagiacchi, P.; Bagnaia, P.; Bai, Y.; Bailey, D. C.; Bain, T.; Baines, J. T.; Baker, O. K.; Baker, S.; Balek, P.; Balli, F.; Banas, E.; Banerjee, Sw.; Banfi, D.; Bangert, A.; Bannoura, A. A. E.; Bansal, V.; Bansil, H. S.; Barak, L.; Baranov, S. P.; Barber, T.; Barberio, E. L.; Barberis, D.; Barbero, M.; Barillari, T.; Barisonzi, M.; Barklow, T.; Barlow, N.; Barnett, B. M.; Barnett, R. M.; Barnovska, Z.; Baroncelli, A.; Barone, G.; Barr, A. J.; Barreiro, F.; Barreiro Guimarães da Costa, J.; Bartoldus, R.; Barton, A. E.; Bartos, P.; Bartsch, V.; Bassalat, A.; Basye, A.; Bates, R. L.; Batkova, L.; Batley, J. R.; Battistin, M.; Bauer, F.; Bawa, H. S.; Beau, T.; Beauchemin, P. H.; Beccherle, R.; Bechtle, P.; Beck, H. P.; Becker, K.; Becker, S.; Beckingham, M.; Becot, C.; Beddall, A. J.; Beddall, A.; Bedikian, S.; Bednyakov, V. A.; Bee, C. P.; Beemster, L. J.; Beermann, T. A.; Begel, M.; Behr, K.; Belanger-Champagne, C.; Bell, P. J.; Bell, W. H.; Bella, G.; Bellagamba, L.; Bellerive, A.; Bellomo, M.; Belloni, A.; Beloborodova, O. L.; Belotskiy, K.; Beltramello, O.; Benary, O.; Benchekroun, D.; Bendtz, K.; Benekos, N.; Benhammou, Y.; Benhar Noccioli, E.; Benitez Garcia, J. A.; Benjamin, D. P.; Bensinger, J. R.; Benslama, K.; Bentvelsen, S.; Berge, D.; Bergeaas Kuutmann, E.; Berger, N.; Berghaus, F.; Berglund, E.; Beringer, J.; Bernard, C.; Bernat, P.; Bernius, C.; Bernlochner, F. U.; Berry, T.; Berta, P.; Bertella, C.; Bertolucci, F.; Besana, M. I.; Besjes, G. J.; Bessidskaia, O.; Besson, N.; Betancourt, C.; Bethke, S.; Bhimji, W.; Bianchi, R. M.; Bianchini, L.; Bianco, M.; Biebel, O.; Bieniek, S. P.; Bierwagen, K.; Biesiada, J.; Biglietti, M.; De Mendizabal, J. Bilbao; Bilokon, H.; Bindi, M.; Binet, S.; Bingul, A.; Bini, C.; Black, C. W.; Black, J. E.; Black, K. M.; Blackburn, D.; Blair, R. E.; Blanchard, J.-B.; Blazek, T.; Bloch, I.; Blocker, C.; Blum, W.; Blumenschein, U.; Bobbink, G. J.; Bobrovnikov, V. S.; Bocchetta, S. S.; Bocci, A.; Boddy, C. R.; Boehler, M.; Boek, J.; Boek, T. T.; Bogaerts, J. A.; Bogdanchikov, A. G.; Bogouch, A.; Bohm, C.; Bohm, J.; Boisvert, V.; Bold, T.; Boldea, V.; Boldyrev, A. S.; Bolnet, N. M.; Bomben, M.; Bona, M.; Boonekamp, M.; Borisov, A.; Borissov, G.; Borri, M.; Borroni, S.; Bortfeldt, J.; Bortolotto, V.; Bos, K.; Boscherini, D.; Bosman, M.; Boterenbrood, H.; Boudreau, J.; Bouffard, J.; Bouhova-Thacker, E. V.; Boumediene, D.; Bourdarios, C.; Bousson, N.; Boutouil, S.; Boveia, A.; Boyd, J.; Boyko, I. R.; Bozovic-Jelisavcic, I.; Bracinik, J.; Branchini, P.; Brandt, A.; Brandt, G.; Brandt, O.; Bratzler, U.; Brau, B.; Brau, J. E.; Braun, H. M.; Brazzale, S. F.; Brelier, B.; Brendlinger, K.; Brennan, A. J.; Brenner, R.; Bressler, S.; Bristow, K.; Bristow, T. M.; Britton, D.; Brochu, F. M.; Brock, I.; Brock, R.; Bromberg, C.; Bronner, J.; Brooijmans, G.; Brooks, T.; Brooks, W. K.; Brosamer, J.; Brost, E.; Brown, G.; Brown, J.; de Renstrom, P. A. Bruckman; Bruncko, D.; Bruneliere, R.

    2014-06-01

    A search is presented for direct top-squark pair production in final states with two leptons (electrons or muons) of opposite charge using 20.3 fb-1 of pp collision data at = 8 TeV, collected by the ATLAS experiment at the Large Hadron Collider in 2012. No excess over the Standard Model expectation is found. The results are interpreted under the separate assumptions (i) that the top squark decays to a b-quark in addition to an on-shell chargino whose decay occurs via a real or virtual W boson, or (ii) that the top squark decays to a t-quark and the lightest neutralino. A top squark with a mass between 150 GeV and 445 GeV decaying to a b-quark and an on-shell chargino is excluded at 95% confidence level for a top squark mass equal to the chargino mass plus 10 GeV, in the case of a 1 GeV lightest neutralino. Top squarks with masses between 215 (90) GeV and 530 (170) GeV decaying to an on-shell (off-shell) t-quark and a neutralino are excluded at 95% confidence level for a 1 GeV neutralino. [Figure not available: see fulltext.

  16. Parallel Imaging Microfluidic Cytometer

    PubMed Central

    Ehrlich, Daniel J.; McKenna, Brian K.; Evans, James G.; Belkina, Anna C.; Denis, Gerald V.; Sherr, David; Cheung, Man Ching

    2011-01-01

    By adding an additional degree of freedom from multichannel flow, the parallel microfluidic cytometer (PMC) combines some of the best features of flow cytometry (FACS) and microscope-based high-content screening (HCS). The PMC (i) lends itself to fast processing of large numbers of samples, (ii) adds a 1-D imaging capability for intracellular localization assays (HCS), (iii) has a high rare-cell sensitivity and, (iv) has an unusual capability for time-synchronized sampling. An inability to practically handle large sample numbers has restricted applications of conventional flow cytometers and microscopes in combinatorial cell assays, network biology, and drug discovery. The PMC promises to relieve a bottleneck in these previously constrained applications. The PMC may also be a powerful tool for finding rare primary cells in the clinic. The multichannel architecture of current PMC prototypes allows 384 unique samples for a cell-based screen to be read out in approximately 6–10 minutes, about 30-times the speed of most current FACS systems. In 1-D intracellular imaging, the PMC can obtain protein localization using HCS marker strategies at many times the sample throughput of CCD-based microscopes or CCD-based single-channel flow cytometers. The PMC also permits the signal integration time to be varied over a larger range than is practical in conventional flow cytometers. The signal-to-noise advantages are useful, for example, in counting rare positive cells in the most difficult early stages of genome-wide screening. We review the status of parallel microfluidic cytometry and discuss some of the directions the new technology may take. PMID:21704835

  17. A parallel variable metric optimization algorithm

    NASA Technical Reports Server (NTRS)

    Straeter, T. A.

    1973-01-01

    An algorithm, designed to exploit the parallel computing or vector streaming (pipeline) capabilities of computers is presented. When p is the degree of parallelism, then one cycle of the parallel variable metric algorithm is defined as follows: first, the function and its gradient are computed in parallel at p different values of the independent variable; then the metric is modified by p rank-one corrections; and finally, a single univariant minimization is carried out in the Newton-like direction. Several properties of this algorithm are established. The convergence of the iterates to the solution is proved for a quadratic functional on a real separable Hilbert space. For a finite-dimensional space the convergence is in one cycle when p equals the dimension of the space. Results of numerical experiments indicate that the new algorithm will exploit parallel or pipeline computing capabilities to effect faster convergence than serial techniques.

  18. Search for correlations between the arrival directions of IceCube neutrino events and ultrahigh-energy cosmic rays detected by the Pierre Auger Observatory and the Telescope Array

    E-print Network

    Aartsen, M G; Ackermann, M; Adams, J; Aguilar, J A; Ahlers, M; Ahrens, M; Altmann, D; Anderson, T; Ansseau, I; Archinger, M; Arguelles, C; Arlen, T C; Auffenberg, J; Bai, X; Barwick, S W; Baum, V; Bay, R; Beatty, J J; Tjus, J Becker; Becker, K -H; Beiser, E; Berghaus, P; Berley, D; Bernardini, E; Bernhard, A; Besson, D Z; Binder, G; Bindig, D; Bissok, M; Blaufuss, E; Blumenthal, J; Boersma, D J; Bohm, C; Börner, M; Bos, F; Bose, D; Böser, S; Botner, O; Braun, J; Brayeur, L; Bretz, H -P; Buzinsky, N; Casey, J; Casier, M; Cheung, E; Chirkin, D; Christov, A; Clark, K; Classen, L; Coenders, S; Cowen, D F; Silva, A H Cruz; Daughhetee, J; Davis, J C; Day, M; de André, J P A M; De Clercq, C; Rosendo, E del Pino; Dembinski, H; De Ridder, S; Desiati, P; de Vries, K D; de Wasseige, G; de With, M; DeYoung, T; Díaz-Vélez, J C; di Lorenzo, V; Dumm, J P; Dunkman, M; Eberhardt, B; Ehrhardt, T; Eichmann, B; Euler, S; Evenson, P A; Fahey, S; Fazely, A R; Feintzeig, J; Felde, J; Filimonov, K; Finley, C; Fischer-Wasels, T; Flis, S; Fösig, C -C; Fuchs, T; Gaisser, T K; Gaior, R; Gallagher, J; Gerhardt, L; Ghorbani, K; Gier, D; Gladstone, L; Glagla, M; Glüsenkamp, T; Goldschmidt, A; Golup, G; Gonzalez, J G; Góra, D; Grant, D; Griffith, Z; Groß, A; Ha, C; Haack, C; Ismail, A Haj; Hallgren, A; Halzen, F; Hansen, E; Hansmann, B; Hanson, K; Hebecker, D; Heereman, D; Helbing, K; Hellauer, R; Hickford, S; Hignight, J; Hill, G C; Hoffman, K D; Hoffmann, R; Holzapfel, K; Homeier, A; Hoshina, K; Huang, F; Huber, M; Huelsnitz, W; Hulth, P O; Hultqvist, K; In, S; Ishihara, A; Jacobi, E; Japaridze, G S; Jeong, M; Jero, K; Jurkovic, M; Kappes, A; Karg, T; Karle, A; Kauer, M; Keivani, A; Kelley, J L; Kemp, J; Kheirandish, A; Kiryluk, J; Kläs, J; Klein, S R; Kohnen, G; Koirala, R; Kolanoski, H; Konietz, R; Köpke, L; Kopper, C; Kopper, S; Koskinen, D J; Kowalski, M; Krings, K; Kroll, G; Kroll, M; Krückl, G; Kunnen, J; Kurahashi, N; Kuwabara, T; Labare, M; Lanfranchi, J L; Larson, M J; Lesiak-Bzdak, M; Leuermann, M; Leuner, J; Lu, L; Lünemann, J; Madsen, J; Maggi, G; Mahn, K B M; Mandelartz, M; Maruyama, R; Mase, K; Matis, H S; Maunu, R; McNally, F; Meagher, K; Medici, M; Meli, A; Menne, T; Merino, G; Meures, T; Miarecki, S; Middell, E; Mohrmann, L; Montaruli, T; Morse, R; Nahnhauer, R; Naumann, U; Neer, G; Niederhausen, H; Nowicki, S C; Nygren, D R; Pollmann, A Obertacke; Olivas, A; Omairat, A; O'Murchadha, A; Palczewski, T; Pandya, H; Pankova, D V; Paul, L; Pepper, J A; Heros, C Pérez de los; Pfendner, C; Pieloth, D; Pinat, E; Posselt, J; Price, P B; Przybylski, G T; Quinnan, M; Raab, C; Rädel, L; Rameez, M; Rawlins, K; Reimann, R; Relich, M; Resconi, E; Rhode, W; Richman, M; Richter, S; Riedel, B; Robertson, S; Rongen, M; Rott, C; Ruhe, T; Ryckbosch, D; Sabbatini, L; Sander, H -G; Sandrock, A; Sandroos, J; Sarkar, S; Schatto, K; Schimp, M; Schmidt, T; Schoenen, S; Schöneberg, S; Schönwald, A; Schulte, L; Schumacher, L; Seckel, D; Seunarine, S; Soldin, D; Song, M; Spiczak, G M; Spiering, C; Stahlberg, M; Stamatikos, M; Stanev, T; Stasik, A; Steuer, A; Stezelberger, T; Stokstad, R G; Stößl, A; Ström, R; Strotjohann, N L; Sullivan, G W; Sutherland, M; Taavola, H; Taboada, I; Tatar, J; Ter-Antonyan, S; Terliuk, A; Teši?, G; Tilav, S; Toale, P A; Tobin, M N; Toscano, S; Tosi, D; Tselengidou, M; Turcati, A; Unger, E; Usner, M; Vallecorsa, S; Vandenbroucke, J; van Eijndhoven, N; Vanheule, S; van Santen, J; Veenkamp, J; Vehring, M; Voge, M; Vraeghe, M; Walck, C; Wallace, A; Wallraff, M; Wandkowsky, N; Weaver, Ch; Wendt, C; Westerhoff, S; Whelan, B J; Wiebe, K; Wiebusch, C H; Wille, L; Williams, D R; Wissing, H; Wolf, M; Wood, T R; Woschnagg, K; Xu, D L; Xu, X W; Xu, Y; Yanez, J P; Yodh, G; Yoshida, S; :,; Aab, A; Abreu, P; Aglietta, M; Ahn, E J; Samarai, I Al; Albuquerque, I F M; Allekotte, I; Allison, P; Almela, A; Castillo, J Alvarez; Alvarez-Muñiz, J; Batista, R Alves; Ambrosio, M; Aminaei, A; Anchordoqui, L; Andrada, B; Andringa, S; Aramo, C; Arqueros, F; Arsene, N; Asorey, H; Assis, P; Aublin, J; Avila, G; Awal, N; Badescu, A M; Baus, C; Becker, K H; Bellido, J A; Berat, C; Bertaina, M E; Bertou, X; Biermann, P L; Billoir, P; Blaess, S G; Blanco, A; Blanco, M; Blazek, J; Bleve, C; Blümer, H; Bohá?ová, M; Boncioli, D; Bonifazi, C; Borodai, N; Botti, A M; Brack, J; Brancus, I; Bretz, T; Bridgeman, A; Briechle, F L; Buchholz, P; Bueno, A; Buitink, S; Buscemi, M; Caballero-Mora, K S; Caccianiga, B; Caccianiga, L; Candusso, M; Caramete, L; Caruso, R; Castellina, A; Cataldi, G; Cazon, L; Cester, R; Chavez, A G; Chiavassa, A; Chinellato, J A; Diaz, J C Chirinos; Chudoba, J; Clay, R W; Colalillo, R; Coleman, A; Collica, L; Coluccia, M R; Conceição, R; Contreras, F; Cooper, M J; Cordier, A; Coutu, S; Covault, C E; Dallier, R; D'Amico, S; Daniel, B; Dasso, S; Daumiller, K; Dawson, B R; de Almeida, R M

    2015-01-01

    This paper presents the results of different searches for correlations between very high-energy neutrino candidates detected by IceCube and the highest-energy cosmic rays measured by the Pierre Auger Observatory and the Telescope Array. We first consider samples of cascade neutrino events and of high-energy neutrino-induced muon tracks, which provided evidence for a neutrino flux of astrophysical origin, and study their cross-correlation with the ultrahigh-energy cosmic ray (UHECR) samples as a function of angular separation. We also study their possible directional correlations using a likelihood method stacking the neutrino arrival directions and adopting different assumptions on the size of the UHECR magnetic deflections. Finally, we perform another likelihood analysis stacking the UHECR directions and using a sample of through-going muon tracks optimized for neutrino point-source searches with sub-degree angular resolution. No indications of correlations at discovery level are obtained for any of the sear...

  19. The STAPL Parallel Container Framework 

    E-print Network

    Tanase, Ilie Gabriel

    2012-02-14

    The Standard Template Adaptive Parallel Library (STAPL) is a parallel programming infrastructure that extends C with support for parallelism. STAPL provides a run-time system, a collection of distributed data structures (pContainers) and parallel...

  20. Parallel digital forensics infrastructure.

    SciTech Connect

    Liebrock, Lorie M.; Duggan, David Patrick

    2009-10-01

    This report documents the architecture and implementation of a Parallel Digital Forensics infrastructure. This infrastructure is necessary for supporting the design, implementation, and testing of new classes of parallel digital forensics tools. Digital Forensics has become extremely difficult with data sets of one terabyte and larger. The only way to overcome the processing time of these large sets is to identify and develop new parallel algorithms for performing the analysis. To support algorithm research, a flexible base infrastructure is required. A candidate architecture for this base infrastructure was designed, instantiated, and tested by this project, in collaboration with New Mexico Tech. Previous infrastructures were not designed and built specifically for the development and testing of parallel algorithms. With the size of forensics data sets only expected to increase significantly, this type of infrastructure support is necessary for continued research in parallel digital forensics. This report documents the implementation of the parallel digital forensics (PDF) infrastructure architecture and implementation.

  1. Search Engine for Antimicrobial Resistance: A Cloud Compatible Pipeline and Web Interface for Rapidly Detecting Antimicrobial Resistance Genes Directly from Sequence Data

    PubMed Central

    Rowe, Will; Baker, Kate S.; Verner-Jeffreys, David; Baker-Austin, Craig; Ryan, Jim J.; Maskell, Duncan; Pearce, Gareth

    2015-01-01

    Background Antimicrobial resistance remains a growing and significant concern in human and veterinary medicine. Current laboratory methods for the detection and surveillance of antimicrobial resistant bacteria are limited in their effectiveness and scope. With the rapidly developing field of whole genome sequencing beginning to be utilised in clinical practice, the ability to interrogate sequencing data quickly and easily for the presence of antimicrobial resistance genes will become increasingly important and useful for informing clinical decisions. Additionally, use of such tools will provide insight into the dynamics of antimicrobial resistance genes in metagenomic samples such as those used in environmental monitoring. Results Here we present the Search Engine for Antimicrobial Resistance (SEAR), a pipeline and web interface for detection of horizontally acquired antimicrobial resistance genes in raw sequencing data. The pipeline provides gene information, abundance estimation and the reconstructed sequence of antimicrobial resistance genes; it also provides web links to additional information on each gene. The pipeline utilises clustering and read mapping to annotate full-length genes relative to a user-defined database. It also uses local alignment of annotated genes to a range of online databases to provide additional information. We demonstrate SEAR’s application in the detection and abundance estimation of antimicrobial resistance genes in two novel environmental metagenomes, 32 human faecal microbiome datasets and 126 clinical isolates of Shigella sonnei. Conclusions We have developed a pipeline that contributes to the improved capacity for antimicrobial resistance detection afforded by next generation sequencing technologies, allowing for rapid detection of antimicrobial resistance genes directly from sequencing data. SEAR uses raw sequencing data via an intuitive interface so can be run rapidly without requiring advanced bioinformatic skills or resources. Finally, we show that SEAR is effective in detecting antimicrobial resistance genes in metagenomic and isolate sequencing data from both environmental metagenomes and sequencing data from clinical isolates. PMID:26197475

  2. Cube search, revisited.

    PubMed

    Zhang, Xuetao; Huang, Jie; Yigit-Elliott, Serap; Rosenholtz, Ruth

    2015-01-01

    Observers can quickly search among shaded cubes for one lit from a unique direction. However, replace the cubes with similar 2-D patterns that do not appear to have a 3-D shape, and search difficulty increases. These results have challenged models of visual search and attention. We demonstrate that cube search displays differ from those with "equivalent" 2-D search items in terms of the informativeness of fairly low-level image statistics. This informativeness predicts peripheral discriminability of target-present from target-absent patches, which in turn predicts visual search performance, across a wide range of conditions. Comparing model performance on a number of classic search tasks, cube search does not appear unexpectedly easy. Easy cube search, per se, does not provide evidence for preattentive computation of 3-D scene properties. However, search asymmetries derived from rotating and/or flipping the cube search displays cannot be explained by the information in our current set of image statistics. This may merely suggest a need to modify the model's set of 2-D image statistics. Alternatively, it may be difficult cube search that provides evidence for preattentive computation of 3-D scene properties. By attributing 2-D luminance variations to a shaded 3-D shape, 3-D scene understanding may slow search for 2-D features of the target. PMID:25780063

  3. Cube search, revisited

    PubMed Central

    Zhang, Xuetao; Huang, Jie; Yigit-Elliott, Serap; Rosenholtz, Ruth

    2015-01-01

    Observers can quickly search among shaded cubes for one lit from a unique direction. However, replace the cubes with similar 2-D patterns that do not appear to have a 3-D shape, and search difficulty increases. These results have challenged models of visual search and attention. We demonstrate that cube search displays differ from those with “equivalent” 2-D search items in terms of the informativeness of fairly low-level image statistics. This informativeness predicts peripheral discriminability of target-present from target-absent patches, which in turn predicts visual search performance, across a wide range of conditions. Comparing model performance on a number of classic search tasks, cube search does not appear unexpectedly easy. Easy cube search, per se, does not provide evidence for preattentive computation of 3-D scene properties. However, search asymmetries derived from rotating and/or flipping the cube search displays cannot be explained by the information in our current set of image statistics. This may merely suggest a need to modify the model's set of 2-D image statistics. Alternatively, it may be difficult cube search that provides evidence for preattentive computation of 3-D scene properties. By attributing 2-D luminance variations to a shaded 3-D shape, 3-D scene understanding may slow search for 2-D features of the target. PMID:25780063

  4. Parallel MR Imaging

    PubMed Central

    Deshmane, Anagha; Gulani, Vikas; Griswold, Mark A.; Seiberlich, Nicole

    2015-01-01

    Parallel imaging is a robust method for accelerating the acquisition of magnetic resonance imaging (MRI) data, and has made possible many new applications of MR imaging. Parallel imaging works by acquiring a reduced amount of k-space data with an array of receiver coils. These undersampled data can be acquired more quickly, but the undersampling leads to aliased images. One of several parallel imaging algorithms can then be used to reconstruct artifact-free images from either the aliased images (SENSE-type reconstruction) or from the under-sampled data (GRAPPA-type reconstruction). The advantages of parallel imaging in a clinical setting include faster image acquisition, which can be used, for instance, to shorten breath-hold times resulting in fewer motion-corrupted examinations. In this article the basic concepts behind parallel imaging are introduced. The relationship between undersampling and aliasing is discussed and two commonly used parallel imaging methods, SENSE and GRAPPA, are explained in detail. Examples of artifacts arising from parallel imaging are shown and ways to detect and mitigate these artifacts are described. Finally, several current applications of parallel imaging are presented and recent advancements and promising research in parallel imaging are briefly reviewed. PMID:22696125

  5. PCLIPS: Parallel CLIPS

    NASA Technical Reports Server (NTRS)

    Hall, Lawrence O.; Bennett, Bonnie H.; Tello, Ivan

    1994-01-01

    A parallel version of CLIPS 5.1 has been developed to run on Intel Hypercubes. The user interface is the same as that for CLIPS with some added commands to allow for parallel calls. A complete version of CLIPS runs on each node of the hypercube. The system has been instrumented to display the time spent in the match, recognize, and act cycles on each node. Only rule-level parallelism is supported. Parallel commands enable the assertion and retraction of facts to/from remote nodes working memory. Parallel CLIPS was used to implement a knowledge-based command, control, communications, and intelligence (C(sup 3)I) system to demonstrate the fusion of high-level, disparate sources. We discuss the nature of the information fusion problem, our approach, and implementation. Parallel CLIPS has also be used to run several benchmark parallel knowledge bases such as one to set up a cafeteria. Results show from running Parallel CLIPS with parallel knowledge base partitions indicate that significant speed increases, including superlinear in some cases, are possible.

  6. PDDP: A data parallel programming model. Revision 1

    SciTech Connect

    Warren, K.H.

    1995-06-01

    PDDP, the Parallel Data Distribution Preprocessor, is a data parallel programming model for distributed memory parallel computers. PDDP impelments High Performance Fortran compatible data distribution directives and parallelism expressed by the use of Fortran 90 array syntax, the FORALL statement, and the (WRERE?) construct. Distribued data objects belong to a global name space; other data objects are treated as local and replicated on each processor. PDDP allows the user to program in a shared-memory style and generates codes that are portable to a variety of parallel machines. For interprocessor communication, PDDP uses the fastest communication primitives on each platform.

  7. Eclipse Parallel Tools Platform

    Energy Science and Technology Software Center (ESTSC)

    2005-02-18

    Designing and developing parallel programs is an inherently complex task. Developers must choose from the many parallel architectures and programming paradigms that are available, and face a plethora of tools that are required to execute, debug, and analyze parallel programs i these environments. Few, if any, of these tools provide any degree of integration, or indeed any commonality in their user interfaces at all. This further complicates the parallel developer's task, hampering software engineering practices,more »and ultimately reducing productivity. One consequence of this complexity is that best practice in parallel application development has not advanced to the same degree as more traditional programming methodologies. The result is that there is currently no open-source, industry-strength platform that provides a highly integrated environment specifically designed for parallel application development. Eclipse is a universal tool-hosting platform that is designed to providing a robust, full-featured, commercial-quality, industry platform for the development of highly integrated tools. It provides a wide range of core services for tool integration that allow tool producers to concentrate on their tool technology rather than on platform specific issues. The Eclipse Integrated Development Environment is an open-source project that is supported by over 70 organizations, including IBM, Intel and HP. The Eclipse Parallel Tools Platform (PTP) plug-in extends the Eclipse framwork by providing support for a rich set of parallel programming languages and paradigms, and a core infrastructure for the integration of a wide variety of parallel tools. The first version of the PTP is a prototype that only provides minimal functionality for parallel tool integration of a wide variety of parallel tools. The first version of the PTP is a prototype that only provides minimal functionality for parallel tool integration, support for a small number of parallel architectures, and basis Fortran integration. Future versions will extend the functionality substantially, provide a number of core parallel tools, and provide support across a wide rang of parallel architectures and languages.« less

  8. Parallel Plate System for Collecting Data Used to Determine Viscosity

    NASA Technical Reports Server (NTRS)

    Kaukler, William (Inventor); Ethridge, Edwin C. (Inventor)

    2013-01-01

    A parallel-plate system collects data used to determine viscosity. A first plate is coupled to a translator so that the first plate can be moved along a first direction. A second plate has a pendulum device coupled thereto such that the second plate is suspended above and parallel to the first plate. The pendulum device constrains movement of the second plate to a second direction that is aligned with the first direction and is substantially parallel thereto. A force measuring device is coupled to the second plate for measuring force along the second direction caused by movement of the second plate.

  9. VOLUME 88, NUMBER 15 P H Y S I C A L R E V I E W L E T T E R S 15 APRIL 2002 Direct Search for Charged Higgs Bosons in Decays of Top Quarks

    E-print Network

    . Gallas,37 A. N. Galyaev,26 M. Gao,53 V. Gavrilov,24 R. J. Genik II,27 K. Genser,37 C. E. Gerber,38 YVOLUME 88, NUMBER 15 P H Y S I C A L R E V I E W L E T T E R S 15 APRIL 2002 Direct Search. Abramov,26 B. S. Acharya,17 D. L. Adams,60 M. Adams,38 S. N. Ahmed,21 G. D. Alexeev,23 G. A. Alves,2 N

  10. Parallel computing works

    SciTech Connect

    Not Available

    1991-10-23

    An account of the Caltech Concurrent Computation Program (C{sup 3}P), a five year project that focused on answering the question: Can parallel computers be used to do large-scale scientific computations '' As the title indicates, the question is answered in the affirmative, by implementing numerous scientific applications on real parallel computers and doing computations that produced new scientific results. In the process of doing so, C{sup 3}P helped design and build several new computers, designed and implemented basic system software, developed algorithms for frequently used mathematical computations on massively parallel machines, devised performance models and measured the performance of many computers, and created a high performance computing facility based exclusively on parallel computers. While the initial focus of C{sup 3}P was the hypercube architecture developed by C. Seitz, many of the methods developed and lessons learned have been applied successfully on other massively parallel architectures.

  11. Massively parallel mathematical sieves

    SciTech Connect

    Montry, G.R.

    1989-01-01

    The Sieve of Eratosthenes is a well-known algorithm for finding all prime numbers in a given subset of integers. A parallel version of the Sieve is described that produces computational speedups over 800 on a hypercube with 1,024 processing elements for problems of fixed size. Computational speedups as high as 980 are achieved when the problem size per processor is fixed. The method of parallelization generalizes to other sieves and will be efficient on any ensemble architecture. We investigate two highly parallel sieves using scattered decomposition and compare their performance on a hypercube multiprocessor. A comparison of different parallelization techniques for the sieve illustrates the trade-offs necessary in the design and implementation of massively parallel algorithms for large ensemble computers.

  12. Code Parallelization with CAPO: A User Manual

    NASA Technical Reports Server (NTRS)

    Jin, Hao-Qiang; Frumkin, Michael; Yan, Jerry; Biegel, Bryan (Technical Monitor)

    2001-01-01

    A software tool has been developed to assist the parallelization of scientific codes. This tool, CAPO, extends an existing parallelization toolkit, CAPTools developed at the University of Greenwich, to generate OpenMP parallel codes for shared memory architectures. This is an interactive toolkit to transform a serial Fortran application code to an equivalent parallel version of the software - in a small fraction of the time normally required for a manual parallelization. We first discuss the way in which loop types are categorized and how efficient OpenMP directives can be defined and inserted into the existing code using the in-depth interprocedural analysis. The use of the toolkit on a number of application codes ranging from benchmark to real-world application codes is presented. This will demonstrate the great potential of using the toolkit to quickly parallelize serial programs as well as the good performance achievable on a large number of toolkit to quickly parallelize serial programs as well as the good performance achievable on a large number of processors. The second part of the document gives references to the parameters and the graphic user interface implemented in the toolkit. Finally a set of tutorials is included for hands-on experiences with this toolkit.

  13. Database Searching by Managers.

    ERIC Educational Resources Information Center

    Arnold, Stephen E.

    Managers and executives need the easy and quick access to business and management information that online databases can provide, but many have difficulty articulating their search needs to an intermediary. One possible solution would be to encourage managers and their immediate support staff members to search textual databases directly as they now…

  14. Web Search Engines.

    ERIC Educational Resources Information Center

    Schwartz, Candy

    1998-01-01

    Looks briefly at the history of World Wide Web search engine development and considers the current state of affairs. Reflects on future directions in terms of personalization, summarization, query expansion, coverage, and metadata. (Author/AEF)

  15. Parallel nearest neighbor calculations

    NASA Astrophysics Data System (ADS)

    Trease, Harold

    We are just starting to parallelize the nearest neighbor portion of our free-Lagrange code. Our implementation of the nearest neighbor reconnection algorithm has not been parallelizable (i.e., we just flip one connection at a time). In this paper we consider what sort of nearest neighbor algorithms lend themselves to being parallelized. For example, the construction of the Voronoi mesh can be parallelized, but the construction of the Delaunay mesh (dual to the Voronoi mesh) cannot because of degenerate connections. We will show our most recent attempt to tessellate space with triangles or tetrahedrons with a new nearest neighbor construction algorithm called DAM (Dial-A-Mesh). This method has the characteristics of a parallel algorithm and produces a better tessellation of space than the Delaunay mesh. Parallel processing is becoming an everyday reality for us at Los Alamos. Our current production machines are Cray YMPs with 8 processors that can run independently or combined to work on one job. We are also exploring massive parallelism through the use of two 64K processor Connection Machines (CM2), where all the processors run in lock step mode. The effective application of 3-D computer models requires the use of parallel processing to achieve reasonable "turn around" times for our calculations.

  16. NAS parallel benchmark results

    NASA Technical Reports Server (NTRS)

    Bailey, D. H.; Barszcz, E.; Dagum, L.; Simon, H. D.

    1992-01-01

    The NAS (Numerical Aerodynamic Simulation) parallel benchmarks have been developed at NASA Ames Research Center to study the performance of parallel supercomputers. The eight benchmark problems are specified in a 'pencil and paper' fashion. The performance results of various systems using the NAS parallel benchmarks are presented. These results represent the best results that have been reported to the authors for the specific systems listed. They represent implementation efforts performed by personnel in both the NAS Applied Research Branch of NASA Ames Research Center and in other organizations.

  17. The NAS parallel benchmarks

    NASA Technical Reports Server (NTRS)

    Bailey, David (editor); Barton, John (editor); Lasinski, Thomas (editor); Simon, Horst (editor)

    1993-01-01

    A new set of benchmarks was developed for the performance evaluation of highly parallel supercomputers. These benchmarks consist of a set of kernels, the 'Parallel Kernels,' and a simulated application benchmark. Together they mimic the computation and data movement characteristics of large scale computational fluid dynamics (CFD) applications. The principal distinguishing feature of these benchmarks is their 'pencil and paper' specification - all details of these benchmarks are specified only algorithmically. In this way many of the difficulties associated with conventional benchmarking approaches on highly parallel systems are avoided.

  18. Simulating Billion-Task Parallel Programs

    SciTech Connect

    Perumalla, Kalyan S; Park, Alfred J

    2014-01-01

    In simulating large parallel systems, bottom-up approaches exercise detailed hardware models with effects from simplified software models or traces, whereas top-down approaches evaluate the timing and functionality of detailed software models over coarse hardware models. Here, we focus on the top-down approach and significantly advance the scale of the simulated parallel programs. Via the direct execution technique combined with parallel discrete event simulation, we stretch the limits of the top-down approach by simulating message passing interface (MPI) programs with millions of tasks. Using a timing-validated benchmark application, a proof-of-concept scaling level is achieved to over 0.22 billion virtual MPI processes on 216,000 cores of a Cray XT5 supercomputer, representing one of the largest direct execution simulations to date, combined with a multiplexing ratio of 1024 simulated tasks per real task.

  19. The Parallel Axiom

    ERIC Educational Resources Information Center

    Rogers, Pat

    1972-01-01

    Criteria for a reasonable axiomatic system are discussed. A discussion of the historical attempts to prove the independence of Euclids parallel postulate introduces non-Euclidean geometries. Poincare's model for a non-Euclidean geometry is defined and analyzed. (LS)

  20. Parallel programming with PCN

    SciTech Connect

    Foster, I.; Tuecke, S.

    1991-12-01

    PCN is a system for developing and executing parallel programs. It comprises a high-level programming language, tools for developing and debugging programs in this language, and interfaces to Fortran and C that allow the reuse of existing code in multilingual parallel programs. Programs developed using PCN are portable across many different workstations, networks, and parallel computers. This document provides all the information required to develop parallel programs with the PCN programming system. In includes both tutorial and reference material. It also presents the basic concepts that underly PCN, particularly where these are likely to be unfamiliar to the reader, and provides pointers to other documentation on the PCN language, programming techniques, and tools. PCN is in the public domain. The latest version of both the software and this manual can be obtained by anonymous FTP from Argonne National Laboratory in the directory pub/pcn at info.mcs.anl.gov (c.f. Appendix A).

  1. UCLA Parallel PIC Framework

    NASA Astrophysics Data System (ADS)

    Decyk, Viktor K.; Norton, Charles D.

    2004-12-01

    The UCLA Parallel PIC Framework (UPIC) has been developed to provide trusted components for the rapid construction of new, parallel Particle-in-Cell (PIC) codes. The Framework uses object-based ideas in Fortran95, and is designed to provide support for various kinds of PIC codes on various kinds of hardware. The focus is on student programmers. The Framework supports multiple numerical methods, different physics approximations, different numerical optimizations and implementations for different hardware. It is designed with "defensive" programming in mind, meaning that it contains many error checks and debugging helps. Above all, it is designed to hide the complexity of parallel processing. It is currently being used in a number of new Parallel PIC codes.

  2. Introduction to Parallel Processing

    E-print Network

    Evans, Hal

    for interprocess communication · industry standard in parallel and cluster computing decades · implementations!) · Optimization Strategy · Message Passing Interface (MPI) · Graphics Processing Units (GPU) · Thursday: Physics Optimization Strategy · Overall one needs to understand where the software is spending the most time · Free

  3. Control of parallel manipulators using force feedback

    NASA Technical Reports Server (NTRS)

    Nanua, Prabjot

    1994-01-01

    Two control schemes are compared for parallel robotic mechanisms actuated by hydraulic cylinders. One scheme, the 'rate based scheme', uses the position and rate information only for feedback. The second scheme, the 'force based scheme' feeds back the force information also. The force control scheme is shown to improve the response over the rate control one. It is a simple constant gain control scheme better suited to parallel mechanisms. The force control scheme can be easily modified for the dynamic forces on the end effector. This paper presents the results of a computer simulation of both the rate and force control schemes. The gains in the force based scheme can be individually adjusted in all three directions, whereas the adjustment in just one direction of the rate based scheme directly affects the other two directions.

  4. Scalable parallel communications

    NASA Technical Reports Server (NTRS)

    Maly, K.; Khanna, S.; Overstreet, C. M.; Mukkamala, R.; Zubair, M.; Sekhar, Y. S.; Foudriat, E. C.

    1992-01-01

    Coarse-grain parallelism in networking (that is, the use of multiple protocol processors running replicated software sending over several physical channels) can be used to provide gigabit communications for a single application. Since parallel network performance is highly dependent on real issues such as hardware properties (e.g., memory speeds and cache hit rates), operating system overhead (e.g., interrupt handling), and protocol performance (e.g., effect of timeouts), we have performed detailed simulations studies of both a bus-based multiprocessor workstation node (based on the Sun Galaxy MP multiprocessor) and a distributed-memory parallel computer node (based on the Touchstone DELTA) to evaluate the behavior of coarse-grain parallelism. Our results indicate: (1) coarse-grain parallelism can deliver multiple 100 Mbps with currently available hardware platforms and existing networking protocols (such as Transmission Control Protocol/Internet Protocol (TCP/IP) and parallel Fiber Distributed Data Interface (FDDI) rings); (2) scale-up is near linear in n, the number of protocol processors, and channels (for small n and up to a few hundred Mbps); and (3) since these results are based on existing hardware without specialized devices (except perhaps for some simple modifications of the FDDI boards), this is a low cost solution to providing multiple 100 Mbps on current machines. In addition, from both the performance analysis and the properties of these architectures, we conclude: (1) multiple processors providing identical services and the use of space division multiplexing for the physical channels can provide better reliability than monolithic approaches (it also provides graceful degradation and low-cost load balancing); (2) coarse-grain parallelism supports running several transport protocols in parallel to provide different types of service (for example, one TCP handles small messages for many users, other TCP's running in parallel provide high bandwidth service to a single application); and (3) coarse grain parallelism will be able to incorporate many future improvements from related work (e.g., reduced data movement, fast TCP, fine-grain parallelism) also with near linear speed-ups.

  5. Parallel image compression

    NASA Technical Reports Server (NTRS)

    Reif, John H.

    1987-01-01

    A parallel compression algorithm for the 16,384 processor MPP machine was developed. The serial version of the algorithm can be viewed as a combination of on-line dynamic lossless test compression techniques (which employ simple learning strategies) and vector quantization. These concepts are described. How these concepts are combined to form a new strategy for performing dynamic on-line lossy compression is discussed. Finally, the implementation of this algorithm in a massively parallel fashion on the MPP is discussed.

  6. Artificial intelligence in parallel

    SciTech Connect

    Waldrop, M.M.

    1984-08-10

    The current rage in the Artificial Intelligence (AI) community is parallelism: the idea is to build machines with many independent processors doing many things at once. The upshot is that about a dozen parallel machines are now under development for AI alone. As might be expected, the approaches are diverse yet there are a number of fundamental issues in common: granularity, topology, control, and algorithms.

  7. Search for direct pair production of a chargino and a neutralino decaying to the 125 GeV Higgs boson in ?s = 8  TeV pp collisions with the ATLAS detector

    DOE PAGESBeta

    Aad, G.

    2015-05-12

    A search is presented for the direct pair production of a chargino and a neutralino pp??~±1?~02, where the chargino decays to the lightest neutralino and the W boson, ?~±1??~01(W± ? ?±?), while the neutralino decays to the lightest neutralino and the 125 GeV Higgs boson, ?~02??~01(h ? bb/??/?±?qq). The final states considered for the search have large missing transverse momentum, an isolated electron or muon, and one of the following: either two jets identified as originating from bottom quarks, or two photons, or a second electron or muon with the same electric charge. The analysis is based on 20.3 fb-1more »of ?s=8 TeV proton–proton collision data delivered by the Large Hadron Collider and recorded with the ATLAS detector. Observations are consistent with the Standard Model expectations; limits are set in the context of a simplified super-symmetric model.« less

  8. Search for direct pair production of a chargino and a neutralino decaying to the 125 GeV Higgs boson in TeV collisions with the ATLAS detector

    NASA Astrophysics Data System (ADS)

    Aad, G.; Abbott, B.; Abdallah, J.; Abdel Khalek, S.; Abdinov, O.; Aben, R.; Abi, B.; Abolins, M.; AbouZeid, O. S.; Abramowicz, H.; Abreu, H.; Abreu, R.; Abulaiti, Y.; Acharya, B. S.; Adamczyk, L.; Adams, D. L.; Adelman, J.; Adomeit, S.; Adye, T.; Agatonovic-Jovin, T.; Aguilar-Saavedra, J. A.; Agustoni, M.; Ahlen, S. P.; Ahmadov, F.; Aielli, G.; Akerstedt, H.; Åkesson, T. P. A.; Akimoto, G.; Akimov, A. V.; Alberghi, G. L.; Albert, J.; Albrand, S.; Alconada Verzini, M. J.; Aleksa, M.; Aleksandrov, I. N.; Alexa, C.; Alexander, G.; Alexandre, G.; Alexopoulos, T.; Alhroob, M.; Alimonti, G.; Alio, L.; Alison, J.; Allbrooke, B. M. M.; Allison, L. J.; Allport, P. P.; Aloisio, A.; Alonso, A.; Alonso, F.; Alpigiani, C.; Altheimer, A.; Alvarez Gonzalez, B.; Alviggi, M. G.; Amako, K.; Amaral Coutinho, Y.; Amelung, C.; Amidei, D.; Amor Dos Santos, S. P.; Amorim, A.; Amoroso, S.; Amram, N.; Amundsen, G.; Anastopoulos, C.; Ancu, L. S.; Andari, N.; Andeen, T.; Anders, C. F.; Anders, G.; Anderson, K. J.; Andreazza, A.; Andrei, V.; Anduaga, X. S.; Angelidakis, S.; Angelozzi, I.; Anger, P.; Angerami, A.; Anghinolfi, F.; Anisenkov, A. V.; Anjos, N.; Annovi, A.; Antonelli, M.; Antonov, A.; Antos, J.; Anulli, F.; Aoki, M.; Aperio Bella, L.; Arabidze, G.; Arai, Y.; Araque, J. P.; Arce, A. T. H.; Arduh, F. A.; Arguin, J.-F.; Argyropoulos, S.; Arik, M.; Armbruster, A. J.; Arnaez, O.; Arnal, V.; Arnold, H.; Arratia, M.; Arslan, O.; Artamonov, A.; Artoni, G.; Asai, S.; Asbah, N.; Ashkenazi, A.; Åsman, B.; Asquith, L.; Assamagan, K.; Astalos, R.; Atkinson, M.; Atlay, N. B.; Auerbach, B.; Augsten, K.; Aurousseau, M.; Avolio, G.; Axen, B.; Ayoub, M. K.; Azuelos, G.; Baak, M. A.; Baas, A. E.; Bacci, C.; Bachacou, H.; Bachas, K.; Backes, M.; Backhaus, M.; Bagiacchi, P.; Bagnaia, P.; Bai, Y.; Bain, T.; Baines, J. T.; Baker, O. K.; Balek, P.; Balestri, T.; Balli, F.; Banas, E.; Banerjee, Sw.; Bannoura, A. A. E.; Bansil, H. S.; Barak, L.; Baranov, S. P.; Barberio, E. L.; Barberis, D.; Barbero, M.; Barillari, T.; Barisonzi, M.; Barklow, T.; Barlow, N.; Barnes, S. L.; Barnett, B. M.; Barnett, R. M.; Barnovska, Z.; Baroncelli, A.; Barone, G.; Barr, A. J.; Barreiro, F.; Barreiro Guimarães da Costa, J.; Bartoldus, R.; Barton, A. E.; Bartos, P.; Bassalat, A.; Basye, A.; Bates, R. L.; Batista, S. J.; Batley, J. R.; Battaglia, M.; Bauce, M.; Bauer, F.; Bawa, H. S.; Beacham, J. B.; Beattie, M. D.; Beau, T.; Beauchemin, P. H.; Beccherle, R.; Bechtle, P.; Beck, H. P.; Becker, K.; Becker, S.; Beckingham, M.; Becot, C.; Beddall, A. J.; Beddall, A.; Bednyakov, V. A.; Bee, C. P.; Beemster, L. J.; Beermann, T. A.; Begel, M.; Behr, K.; Belanger-Champagne, C.; Bell, P. J.; Bell, W. H.; Bella, G.; Bellagamba, L.; Bellerive, A.; Bellomo, M.; Belotskiy, K.; Beltramello, O.; Benary, O.; Benchekroun, D.; Bender, M.; Bendtz, K.; Benekos, N.; Benhammou, Y.; Benhar Noccioli, E.; Benitez Garcia, J. A.; Benjamin, D. P.; Bensinger, J. R.; Bentvelsen, S.; Beresford, L.; Beretta, M.; Berge, D.; Bergeaas Kuutmann, E.; Berger, N.; Berghaus, F.; Beringer, J.; Bernard, C.; Bernard, N. R.; Bernius, C.; Bernlochner, F. U.; Berry, T.; Berta, P.; Bertella, C.; Bertoli, G.; Bertolucci, F.; Bertsche, C.; Bertsche, D.; Besana, M. I.; Besjes, G. J.; Bessidskaia Bylund, O.; Bessner, M.; Besson, N.; Betancourt, C.; Bethke, S.; Bevan, A. J.; Bhimji, W.; Bianchi, R. M.; Bianchini, L.; Bianco, M.; Biebel, O.; Bieniek, S. P.; Biglietti, M.; Bilbao De Mendizabal, J.; Bilokon, H.; Bindi, M.; Binet, S.; Bingul, A.; Bini, C.; Black, C. W.; Black, J. E.; Black, K. M.; Blackburn, D.; Blair, R. E.; Blanchard, J.-B.; Blanco, J. E.; Blazek, T.; Bloch, I.; Blocker, C.; Blum, W.; Blumenschein, U.; Bobbink, G. J.; Bobrovnikov, V. S.; Bocchetta, S. S.; Bocci, A.; Bock, C.; Boddy, C. R.; Boehler, M.; Bogaerts, J. A.; Bogdanchikov, A. G.; Bohm, C.; Boisvert, V.; Bold, T.; Boldea, V.; Boldyrev, A. S.; Bomben, M.; Bona, M.; Boonekamp, M.; Borisov, A.; Borissov, G.; Borroni, S.; Bortfeldt, J.; Bortolotto, V.; Bos, K.; Boscherini, D.; Bosman, M.; Boudreau, J.; Bouffard, J.; Bouhova-Thacker, E. V.; Boumediene, D.; Bourdarios, C.; Bousson, N.; Boutouil, S.; Boveia, A.; Boyd, J.; Boyko, I. R.; Bozic, I.; Bracinik, J.; Brandt, A.; Brandt, G.; Brandt, O.; Bratzler, U.; Brau, B.; Brau, J. E.; Braun, H. M.; Brazzale, S. F.; Brendlinger, K.; Brennan, A. J.; Brenner, L.; Brenner, R.; Bressler, S.; Bristow, K.; Bristow, T. M.; Britton, D.; Brochu, F. M.; Brock, I.; Brock, R.; Bronner, J.; Brooijmans, G.; Brooks, T.; Brooks, W. K.; Brosamer, J.; Brost, E.; Brown, J.; Bruckman de Renstrom, P. A.; Bruncko, D.; Bruneliere, R.; Bruni, A.; Bruni, G.; Bruschi, M.; Bryngemark, L.; Buanes, T.; Buat, Q.; Bucci, F.; Buchholz, P.; Buckley, A. G.; Buda, S. I.; Budagov, I. A.; Buehrer, F.; Bugge, L.

    2015-05-01

    A search is presented for the direct pair production of a chargino and a neutralino , where the chargino decays to the lightest neutralino and the boson, , while the neutralino decays to the lightest neutralino and the 125 GeV Higgs boson, . The final states considered for the search have large missing transverse momentum, an isolated electron or muon, and one of the following: either two jets identified as originating from bottom quarks, or two photons, or a second electron or muon with the same electric charge. The analysis is based on 20.3 of proton-proton collision data delivered by the Large Hadron Collider and recorded with the ATLAS detector. Observations are consistent with the Standard Model expectations, and limits are set in the context of a simplified supersymmetric model.

  9. Freeze After Writing Quasi-Deterministic Parallel Programming with LVars

    E-print Network

    Connelly, Kay

    Freeze After Writing Quasi-Deterministic Parallel Programming with LVars Lindsey Kuper Indiana the ability to "freeze" and then read the contents of an LVar directly. Second, we add the ability to attach and freezing enable an expressive and useful style of parallel program- ming. We prove that in a language where

  10. Prefix Parallel Adder Virtual Implementation in Reversible Logic

    E-print Network

    Thornton, Mitchell

    Prefix Parallel Adder Virtual Implementation in Reversible Logic David Y. Feinstein, Mitchell A logic synthesis based on direct translation of the circuit VHDL description into virtual Fredkin gates-Kung Parallel Prefix Adder (PPA) in comparison to a standard logic implementation. Using the Altera Corporation

  11. IPSJ SIG Technical Report Automatic parallelization with OSCAR API Analyzer

    E-print Network

    Kasahara, Hironori

    IPSJ SIG Technical Report Automatic parallelization with OSCAR API Analyzer: a cross have devel- oped the OSCAR API Analyzer. It allows programs automatically parallelized by the OSCAR compiler with OSCAR API directives to target many different platforms using just sequential compilers. We

  12. Safe Parallelism for Robotic Control Matthew C. Jadud

    E-print Network

    Kent, University of

    Safe Parallelism for Robotic Control Matthew C. Jadud Allegheny College Meadville, PA 16335, USA the environment in a consistent and safe model for parallel control that is directly expressed in software. I that a small robot must sense, think, and act, and that data flows from the robots sensor inputs to its "brain

  13. Integrated Task And Data Parallel Programming: Language Design

    NASA Technical Reports Server (NTRS)

    Grimshaw, Andrew S.; West, Emily A.

    1998-01-01

    his research investigates the combination of task and data parallel language constructs within a single programming language. There are an number of applications that exhibit properties which would be well served by such an integrated language. Examples include global climate models, aircraft design problems, and multidisciplinary design optimization problems. Our approach incorporates data parallel language constructs into an existing, object oriented, task parallel language. The language will support creation and manipulation of parallel classes and objects of both types (task parallel and data parallel). Ultimately, the language will allow data parallel and task parallel classes to be used either as building blocks or managers of parallel objects of either type, thus allowing the development of single and multi-paradigm parallel applications. 1995 Research Accomplishments In February I presented a paper at Frontiers '95 describing the design of the data parallel language subset. During the spring I wrote and defended my dissertation proposal. Since that time I have developed a runtime model for the language subset. I have begun implementing the model and hand-coding simple examples which demonstrate the language subset. I have identified an astrophysical fluid flow application which will validate the data parallel language subset. 1996 Research Agenda Milestones for the coming year include implementing a significant portion of the data parallel language subset over the Legion system. Using simple hand-coded methods, I plan to demonstrate (1) concurrent task and data parallel objects and (2) task parallel objects managing both task and data parallel objects. My next steps will focus on constructing a compiler and implementing the fluid flow application with the language. Concurrently, I will conduct a search for a real-world application exhibiting both task and data parallelism within the same program m. Additional 1995 Activities During the fall I collaborated with Andrew Grimshaw and Adam Ferrari to write a book chapter which will be included in Parallel Processing in C++ edited by Gregory Wilson. I also finished two courses, Compilers and Advanced Compilers, in 1995. These courses complete my class requirements at the University of Virginia. I have only my dissertation research and defense to complete.

  14. Direct current transformer

    NASA Technical Reports Server (NTRS)

    Khanna, S. M.; Urban, E. W. (inventors)

    1979-01-01

    A direct current transformer in which the primary consists of an elongated strip of superconductive material, across the ends of which is direct current potential is described. Parallel and closely spaced to the primary is positioned a transformer secondary consisting of a thin strip of magnetoresistive material.

  15. Optimized data communications in a parallel computer

    DOEpatents

    Faraj, Daniel A.

    2014-08-19

    A parallel computer includes nodes that include a network adapter that couples the node in a point-to-point network and supports communications in opposite directions of each dimension. Optimized communications include: receiving, by a network adapter of a receiving compute node, a packet--from a source direction--that specifies a destination node and deposit hints. Each hint is associated with a direction within which the packet is to be deposited. If a hint indicates the packet to be deposited in the opposite direction: the adapter delivers the packet to an application on the receiving node; forwards the packet to a next node in the opposite direction if the receiving node is not the destination; and forwards the packet to a node in a direction of a subsequent dimension if the hints indicate that the packet is to be deposited in the direction of the subsequent dimension.

  16. Optimized data communications in a parallel computer

    DOEpatents

    Faraj, Daniel A

    2014-10-21

    A parallel computer includes nodes that include a network adapter that couples the node in a point-to-point network and supports communications in opposite directions of each dimension. Optimized communications include: receiving, by a network adapter of a receiving compute node, a packet--from a source direction--that specifies a destination node and deposit hints. Each hint is associated with a direction within which the packet is to be deposited. If a hint indicates the packet to be deposited in the opposite direction: the adapter delivers the packet to an application on the receiving node; forwards the packet to a next node in the opposite direction if the receiving node is not the destination; and forwards the packet to a node in a direction of a subsequent dimension if the hints indicate that the packet is to be deposited in the direction of the subsequent dimension.

  17. Parallel time integration software

    Energy Science and Technology Software Center (ESTSC)

    2014-07-01

    This package implements an optimal-scaling multigrid solver for the (non) linear systems that arise from the discretization of problems with evolutionary behavior. Typically, solution algorithms for evolution equations are based on a time-marching approach, solving sequentially for one time step after the other. Parallelism in these traditional time-integrarion techniques is limited to spatial parallelism. However, current trends in computer architectures are leading twards system with more, but not faster. processors. Therefore, faster compute speeds mustmore »come from greater parallelism. One approach to achieve parallelism in time is with multigrid, but extending classical multigrid methods for elliptic poerators to this setting is a significant achievement. In this software, we implement a non-intrusive, optimal-scaling time-parallel method based on multigrid reduction techniques. The examples in the package demonstrate optimality of our multigrid-reduction-in-time algorithm (MGRIT) for solving a variety of parabolic equations in two and three sparial dimensions. These examples can also be used to show that MGRIT can achieve significant speedup in comparison to sequential time marching on modern architectures.« less

  18. Progress in parallelizing XOOPIC

    SciTech Connect

    Mardahl, P.J.; Verboncoeur, J.P.

    1998-12-31

    XOOPIC (Object Oriented Particle in Cell code for X11-based Unix workstations) is presently a serial 2d 3v particle-in-cell plasma simulation. The present effort focuses on using parallel and distributed processing to optimize the simulation for large problems. The benefits include increased capacity for memory intensive problems, and improved performance for processor-intensive problems. The MPI library enables the parallel version to be easily ported to massively parallel, SMP, and distributed computers. The philosophy employed here is to spatially decompose the system into computational regions separated by virtual boundaries, objects which contain the local data and algorithms to perform the local field solve and particle communication between regions. This implementation will reduce the changes required in the rest of the program by parallelization. Specific implementation details such as the hiding of communication latency behind local computation will also be discussed. The initial implementation includes manual, partitioning in one spatial coordinate, electromagnetic models, diagnostics by computational region, and effective transmission of both fields and particles across virtual boundaries. This version was able to perform greater than 600,000 particle-pushes-per-second using 8 200MHz UltraSPARC CPU`s. In this work the authors extend parallel XOOPIC to have 2-d partitioning, automated partitioning, and global diagnostics.

  19. Parallel time integration software

    SciTech Connect

    2014-07-01

    This package implements an optimal-scaling multigrid solver for the (non) linear systems that arise from the discretization of problems with evolutionary behavior. Typically, solution algorithms for evolution equations are based on a time-marching approach, solving sequentially for one time step after the other. Parallelism in these traditional time-integrarion techniques is limited to spatial parallelism. However, current trends in computer architectures are leading twards system with more, but not faster. processors. Therefore, faster compute speeds must come from greater parallelism. One approach to achieve parallelism in time is with multigrid, but extending classical multigrid methods for elliptic poerators to this setting is a significant achievement. In this software, we implement a non-intrusive, optimal-scaling time-parallel method based on multigrid reduction techniques. The examples in the package demonstrate optimality of our multigrid-reduction-in-time algorithm (MGRIT) for solving a variety of parabolic equations in two and three sparial dimensions. These examples can also be used to show that MGRIT can achieve significant speedup in comparison to sequential time marching on modern architectures.

  20. Search Cloud

    MedlinePLUS

    ... www.nlm.nih.gov/medlineplus/cloud.html Search Cloud To use the sharing features on this page, ... of Top 110 zoloft Share the MedlinePlus search cloud with your users by embedding our search cloud ...

  1. Parallel Transport on Principal Bundles over Stacks

    E-print Network

    Brian Collier; Eugene Lerman; Seth Wolbert

    2015-09-16

    In this paper we introduce a notion of parallel transport for principal bundles with connections over differentiable stacks. We show that principal bundles with connections over stacks can be recovered from their parallel transport thereby extending the results of Barrett, Caetano and Picken, and Schreiber and Waldof from manifolds to stacks. In the process of proving our main result we simplify Schreiber and Waldorf's definition of a transport functor for principal bundles with connections over manifolds and provide a more direct proof of the correspondence between principal bundles with connections and transport functors.

  2. Hierarchical Parallelism in Finite Difference Analysis of Heat Conduction

    NASA Technical Reports Server (NTRS)

    Padovan, Joseph; Krishna, Lala; Gute, Douglas

    1997-01-01

    Based on the concept of hierarchical parallelism, this research effort resulted in highly efficient parallel solution strategies for very large scale heat conduction problems. Overall, the method of hierarchical parallelism involves the partitioning of thermal models into several substructured levels wherein an optimal balance into various associated bandwidths is achieved. The details are described in this report. Overall, the report is organized into two parts. Part 1 describes the parallel modelling methodology and associated multilevel direct, iterative and mixed solution schemes. Part 2 establishes both the formal and computational properties of the scheme.

  3. Some fast elliptic solvers on parallel architectures and their complexities

    NASA Technical Reports Server (NTRS)

    Gallopoulos, E.; Saad, Youcef

    1989-01-01

    The discretization of separable elliptic partial differential equations leads to linear systems with special block triangular matrices. Several methods are known to solve these systems, the most general of which is the Block Cyclic Reduction (BCR) algorithm which handles equations with nonconsistant coefficients. A method was recently proposed to parallelize and vectorize BCR. Here, the mapping of BCR on distributed memory architectures is discussed, and its complexity is compared with that of other approaches, including the Alternating-Direction method. A fast parallel solver is also described, based on an explicit formula for the solution, which has parallel computational complexity lower than that of parallel BCR.

  4. Parallel collective resonances in arrays of gold nanorods.

    PubMed

    Vitrey, Alan; Aigouy, Lionel; Prieto, Patricia; García-Martín, José Miguel; González, María U

    2014-01-01

    In this work we discuss the excitation of parallel collective resonances in arrays of gold nanoparticles. Parallel collective resonances result from the coupling of the nanoparticles localized surface plasmons with diffraction orders traveling in the direction parallel to the polarization vector. While they provide field enhancement and delocalization as the standard collective resonances, our results suggest that parallel resonances could exhibit greater tolerance to index asymmetry in the environment surrounding the arrays. The near- and far-field properties of these resonances are analyzed, both experimentally and numerically. PMID:24645987

  5. Geographical and Topographical Atlas accompanying the report of the Geological Exploration of the Fortieth Parallel, made by authority of the Hornorable Secretary of War, under the direction of Brig. and Bvt. Major General A. A. Humphreys, Chief of Engineers

    USGS Publications Warehouse

    King, Clarence; Bien, Julius, (lithographer)

    1876-01-01

    Contains a title, legend, and 11 folio maps in the folio. Contains a topographic (shaded) map of Cordilleran region, limiting meridians 104° and 124°; limiting parallels 29° and 50°. Scale, 60 miles to the inch. Also contains four geologic and four topographic (shaded) maps, on scale of 4 miles to the inch, of the following areas: Sheet I. Longitude, 104° 30'-107° 37'; latitude, 40° 20'-41° 54'. Sheet II. Longitude, 107° 37'-110° 43'; latitude, 40° 16'-41° 50'. Sheet III. Longitude, 110° 43'-113° 50'; latitude, 40° 13'-41° 46'. Sheet IV. Longitude, 113° 50'-116° 56'; latitude, 39° 55'-41° 29'.

  6. Parallelizing Quantum Circuits

    E-print Network

    Anne Broadbent; Elham Kashefi

    2007-04-13

    We present a novel automated technique for parallelizing quantum circuits via forward and backward translation to measurement-based quantum computing patterns and analyze the trade off in terms of depth and space complexity. As a result we distinguish a class of polynomial depth circuits that can be parallelized to logarithmic depth while adding only polynomial many auxiliary qubits. In particular, we provide for the first time a full characterization of patterns with flow of arbitrary depth, based on the notion of influencing paths and a simple rewriting system on the angles of the measurement. Our method leads to insightful knowledge for constructing parallel circuits and as applications, we demonstrate several constant and logarithmic depth circuits. Furthermore, we prove a logarithmic separation in terms of quantum depth between the quantum circuit model and the measurement-based model.

  7. Parallelism in System Tools

    SciTech Connect

    Matney, Sr., Kenneth D; Shipman, Galen M

    2010-01-01

    The Cray XT, when employed in conjunction with the Lustre filesystem, has provided the ability to generate huge amounts of data in the form of many files. Typically, this is accommodated by satisfying the requests of large numbers of Lustre clients in parallel. In contrast, a single service node (Lustre client) cannot adequately service such datasets. This means that the use of traditional UNIX tools like cp, tar, et alli (with have no parallel capability) can result in substantial impact to user productivity. For example, to copy a 10 TB dataset from the service node using cp would take about 24 hours, under more or less ideal conditions. During production operation, this could easily extend to 36 hours. In this paper, we introduce the Lustre User Toolkit for Cray XT, developed at the Oak Ridge Leadership Computing Facility (OLCF). We will show that Linux commands, implementing highly parallel I/O algorithms, provide orders of magnitude greater performance, greatly reducing impact to productivity.

  8. Parallel optical sampler

    DOEpatents

    Tauke-Pedretti, Anna; Skogen, Erik J; Vawter, Gregory A

    2014-05-20

    An optical sampler includes a first and second 1.times.n optical beam splitters splitting an input optical sampling signal and an optical analog input signal into n parallel channels, respectively, a plurality of optical delay elements providing n parallel delayed input optical sampling signals, n photodiodes converting the n parallel optical analog input signals into n respective electrical output signals, and n optical modulators modulating the input optical sampling signal or the optical analog input signal by the respective electrical output signals, and providing n successive optical samples of the optical analog input signal. A plurality of output photodiodes and eADCs convert the n successive optical samples to n successive digital samples. The optical modulator may be a photodiode interconnected Mach-Zehnder Modulator. A method of sampling the optical analog input signal is disclosed.

  9. Search for direct photons in p+Pb and p+C collisions at sqrt(sNN) = 17.4 GeV

    E-print Network

    Christoph Baumann; for the WA98 collaboration

    2008-04-28

    Upper limits on direct photon production were determined as a function of the transverse momentum for 0.7 photon measurements in Pb+Pb collisions at sqrt(sNN) = 17.3 GeV by WA98. Implications for a possible thermal direct photon contribution are discussed.

  10. Adaptive parallel logic networks

    NASA Technical Reports Server (NTRS)

    Martinez, Tony R.; Vidal, Jacques J.

    1988-01-01

    Adaptive, self-organizing concurrent systems (ASOCS) that combine self-organization with massive parallelism for such applications as adaptive logic devices, robotics, process control, and system malfunction management, are presently discussed. In ASOCS, an adaptive network composed of many simple computing elements operating in combinational and asynchronous fashion is used and problems are specified by presenting if-then rules to the system in the form of Boolean conjunctions. During data processing, which is a different operational phase from adaptation, the network acts as a parallel hardware circuit.

  11. The NAS Parallel Benchmarks

    SciTech Connect

    Bailey, David H.

    2009-11-15

    The NAS Parallel Benchmarks (NPB) are a suite of parallel computer performance benchmarks. They were originally developed at the NASA Ames Research Center in 1991 to assess high-end parallel supercomputers. Although they are no longer used as widely as they once were for comparing high-end system performance, they continue to be studied and analyzed a great deal in the high-performance computing community. The acronym 'NAS' originally stood for the Numerical Aeronautical Simulation Program at NASA Ames. The name of this organization was subsequently changed to the Numerical Aerospace Simulation Program, and more recently to the NASA Advanced Supercomputing Center, although the acronym remains 'NAS.' The developers of the original NPB suite were David H. Bailey, Eric Barszcz, John Barton, David Browning, Russell Carter, LeoDagum, Rod Fatoohi, Samuel Fineberg, Paul Frederickson, Thomas Lasinski, Rob Schreiber, Horst Simon, V. Venkatakrishnan and Sisira Weeratunga. The original NAS Parallel Benchmarks consisted of eight individual benchmark problems, each of which focused on some aspect of scientific computing. The principal focus was in computational aerophysics, although most of these benchmarks have much broader relevance, since in a much larger sense they are typical of many real-world scientific computing applications. The NPB suite grew out of the need for a more rational procedure to select new supercomputers for acquisition by NASA. The emergence of commercially available highly parallel computer systems in the late 1980s offered an attractive alternative to parallel vector supercomputers that had been the mainstay of high-end scientific computing. However, the introduction of highly parallel systems was accompanied by a regrettable level of hype, not only on the part of the commercial vendors but even, in some cases, by scientists using the systems. As a result, it was difficult to discern whether the new systems offered any fundamental performance advantage over vector supercomputers, and, if so, which of the parallel offerings would be most useful in real-world scientific computation. In part to draw attention to some of the performance reporting abuses prevalent at the time, the present author wrote a humorous essay 'Twelve Ways to Fool the Masses,' which described in a light-hearted way a number of the questionable ways in which both vendor marketing people and scientists were inflating and distorting their performance results. All of this underscored the need for an objective and scientifically defensible measure to compare performance on these systems.

  12. "Parallel" transport - revisited

    E-print Network

    Stasheff, Jim

    2011-01-01

    Parallel transport in a fibre bundle with respect to smooth paths in the base space B have recently been extended to representations of the smooth singular simplicial set Sing_{smooth}(B). Inspired by these extensions,I revisit the development of a notion of `parallel' transport in the topological setting of fibrations with the homotopy lifting property and then extend it to representations of Sing(B) on such fibrations. Closely related is the notion of (strong or `infty') homotopy action, which has variants under a variety of names.

  13. A Parallel Tree Code

    E-print Network

    John Dubinski

    1996-03-18

    We describe a new implementation of a parallel N-body tree code. The code is load-balanced using the method of orthogonal recursive bisection to subdivide the N-body system into independent rectangular volumes each of which is mapped to a processor on a parallel computer. On the Cray T3D, the load balance in the range of 70-90\\% depending on the problem size and number of processors. The code can handle simulations with $>$ 10 million particles roughly a factor of 10 greater than allowed in vectorized tree codes.

  14. Parallelization of NAS Benchmarks for Shared Memory Multiprocessors

    NASA Technical Reports Server (NTRS)

    Waheed, Abdul; Yan, Jerry C.; Saini, Subhash (Technical Monitor)

    1998-01-01

    This paper presents our experiences of parallelizing the sequential implementation of NAS benchmarks using compiler directives on SGI Origin2000 distributed shared memory (DSM) system. Porting existing applications to new high performance parallel and distributed computing platforms is a challenging task. Ideally, a user develops a sequential version of the application, leaving the task of porting to new generations of high performance computing systems to parallelization tools and compilers. Due to the simplicity of programming shared-memory multiprocessors, compiler developers have provided various facilities to allow the users to exploit parallelism. Native compilers on SGI Origin2000 support multiprocessing directives to allow users to exploit loop-level parallelism in their programs. Additionally, supporting tools can accomplish this process automatically and present the results of parallelization to the users. We experimented with these compiler directives and supporting tools by parallelizing sequential implementation of NAS benchmarks. Results reported in this paper indicate that with minimal effort, the performance gain is comparable with the hand-parallelized, carefully optimized, message-passing implementations of the same benchmarks.

  15. A massively asynchronous, parallel brain.

    PubMed

    Zeki, Semir

    2015-05-19

    Whether the visual brain uses a parallel or a serial, hierarchical, strategy to process visual signals, the end result appears to be that different attributes of the visual scene are perceived asynchronously--with colour leading form (orientation) by 40 ms and direction of motion by about 80 ms. Whatever the neural root of this asynchrony, it creates a problem that has not been properly addressed, namely how visual attributes that are perceived asynchronously over brief time windows after stimulus onset are bound together in the longer term to give us a unified experience of the visual world, in which all attributes are apparently seen in perfect registration. In this review, I suggest that there is no central neural clock in the (visual) brain that synchronizes the activity of different processing systems. More likely, activity in each of the parallel processing-perceptual systems of the visual brain is reset independently, making of the brain a massively asynchronous organ, just like the new generation of more efficient computers promise to be. Given the asynchronous operations of the brain, it is likely that the results of activities in the different processing-perceptual systems are not bound by physiological interactions between cells in the specialized visual areas, but post-perceptually, outside the visual brain. PMID:25823871

  16. A massively asynchronous, parallel brain

    PubMed Central

    Zeki, Semir

    2015-01-01

    Whether the visual brain uses a parallel or a serial, hierarchical, strategy to process visual signals, the end result appears to be that different attributes of the visual scene are perceived asynchronously—with colour leading form (orientation) by 40 ms and direction of motion by about 80 ms. Whatever the neural root of this asynchrony, it creates a problem that has not been properly addressed, namely how visual attributes that are perceived asynchronously over brief time windows after stimulus onset are bound together in the longer term to give us a unified experience of the visual world, in which all attributes are apparently seen in perfect registration. In this review, I suggest that there is no central neural clock in the (visual) brain that synchronizes the activity of different processing systems. More likely, activity in each of the parallel processing-perceptual systems of the visual brain is reset independently, making of the brain a massively asynchronous organ, just like the new generation of more efficient computers promise to be. Given the asynchronous operations of the brain, it is likely that the results of activities in the different processing-perceptual systems are not bound by physiological interactions between cells in the specialized visual areas, but post-perceptually, outside the visual brain. PMID:25823871

  17. Measurements of Charge and Light in Pure High Pressure Xe towards the Study of Xe+TMA Mixtures with Dark Matter Directionality Sensitivity and Supra-intrinsic Energy Resolution for 0??? Decay Searches

    NASA Astrophysics Data System (ADS)

    Oliveira, C. A. B.; Gehman, V.; Goldschmidt, A.; Nygren, D.; Renner, J.

    Trimethylamine (TMA) may improve the energy resolution of gaseous xenon based detectors for 0??? decay searches through the reduction of the Fano factor by the Penning effect. This molecule may also be the key for sensing directionality of nuclear recoils induced by Weakly Interacting Massive Particles (WIMPs) in monolithic massive (ton-scale) detectors, without the need of track imaging, by making use of columnar recombination. Nuclear recoil directionality may be the path for a definite discovery of the WIMP nature of Dark Matter. An ionization chamber has been constructed and operated to explore the properties of high pressure gaseous Xe + TMA mixtures for particle detection in rare-event experiments. The ionization, scintillation and electroluminescence (EL) signals are measured as function of pressure and electric field. We present results for pure xenon at pressures up to 8 bar. This work has been carried out within the context of the NEXT collaboration.

  18. Measurements of charge and light in pure high pressure Xe towards the study of Xe+TMA mixtures with dark matter directionality sensitivity and supra-intrinsic energy resolution for 0??? decay searches

    DOE PAGESBeta

    Oliveira, C. A.B.; Gehman, V.; Goldschmidt, A.; Nygren, D.; Renner, J.

    2015-03-24

    Trimethylamine (TMA) may improve the energy resolution of gaseous xenon based detectors for 0??? decay searches through the reduction of the Fano factor by the Penning effect. This molecule may also be the key for sensing directionality of nuclear recoils induced by Weakly Interacting Massive Particles (WIMPs) in monolithic massive (ton-scale) detectors, without the need of track imaging, by making use of columnar recombination. Nuclear recoil directionality may be the path for a definite discovery of the WIMP nature of Dark Matter. An ionization chamber has been constructed and operated to explore the properties of high pressure gaseous Xe +more »TMA mixtures for particle detection in rare-event experiments. The ionization, scintillation and electroluminescence (EL) signals are measured as function of pressure and electric field. We present results for pure xenon at pressures up to 8 bar. This work has been carried out within the context of the NEXT collaboration.« less

  19. Measurements of charge and light in pure high pressure Xe towards the study of Xe+TMA mixtures with dark matter directionality sensitivity and supra-intrinsic energy resolution for 0??? decay searches

    SciTech Connect

    Oliveira, C. A.B.; Gehman, V.; Goldschmidt, A.; Nygren, D.; Renner, J.

    2015-03-24

    Trimethylamine (TMA) may improve the energy resolution of gaseous xenon based detectors for 0??? decay searches through the reduction of the Fano factor by the Penning effect. This molecule may also be the key for sensing directionality of nuclear recoils induced by Weakly Interacting Massive Particles (WIMPs) in monolithic massive (ton-scale) detectors, without the need of track imaging, by making use of columnar recombination. Nuclear recoil directionality may be the path for a definite discovery of the WIMP nature of Dark Matter. An ionization chamber has been constructed and operated to explore the properties of high pressure gaseous Xe + TMA mixtures for particle detection in rare-event experiments. The ionization, scintillation and electroluminescence (EL) signals are measured as function of pressure and electric field. We present results for pure xenon at pressures up to 8 bar. This work has been carried out within the context of the NEXT collaboration.

  20. Parallel processing of graph reachability in databases

    SciTech Connect

    Wolfson, O. ); Zhang, W. ); Butani, H. ); Kawaguchi, A.; Mok, K. )

    1992-08-01

    In this paper we consider parallel processing of a graph represented by a database relation, and we achieved two objectives. First, we propose a methodology for analyzing the speedup of a parallel processing strategy with the purpose of selecting at runtime one of several candidate strategies, depending the hardware architecture and the input graph. Second, we study the single source reachability problem, namely the problem of computing the set of nodes reachable from a given node in a directed graph. We propose several parallel strategies for solving this problem, and we analyze their performance using our new methodology. The analysis is confirmed experimentally in a UNIX-Ethernet environment. We also extend the results to the transitive closure problem.

  1. Heuristics, Optimizations, and Parallelism for Protein Structure Prediction in CLP(FD)

    E-print Network

    Dal Palù, Alessandro

    Heuristics, Optimizations, and Parallelism for Protein Structure Prediction in CLP(FD) Alessandro and to plug-and-play different search strategies and heuristics. A preliminary approach to the use of CLP

  2. Novel concept microarray enabling PCR and multistep reactions through pipette-free aperture-to-aperture parallel transfer

    PubMed Central

    2010-01-01

    Background The microarray has contributed to developing the omic analysis. However, as it depends basically on the surface reaction, it is hard to perform bulk reactions and sequential multistep reactions. On the other hand, the popular microplate technology, which has a great merit of being able to perform parallel multistep reactions, has come to its limit in increasing the number of wells (currently, up to 9600) and reducing the volume to deal with due to the difficulty in operations. Results Here, we report a novel microarray technology which enables us to explore advanced applications, termed microarray-with-manageable volumes (MMV). The technical essence is in the pipette-free direct parallel transfer from well to well performed by centrifugation, evading the evaporation and adsorption-losses during handling. By developing the MMV plate, accompanying devices and techniques, generation of multiple conditions (256 kinds) and performance of parallel multistep reactions, including PCR and in vitro translation reactions, have been made possible. These were demonstrated by applying the MMV technology to searching lysozyme-crystallizing conditions and selecting peptides aimed for A?-binding or cathepsin E-inhibition. Conclusions With the introduction of a novel concept microarray (MMV) technology, parallel and multistep reactions in sub-?L scale have become possible. PMID:20923572

  3. Chapter in SYNTHESIS OF PARALLEL ALGORITHMS, MorganKaufmann, 1993. (Figures not yet included in this file.) Parallel Open Ear Decomposition

    E-print Network

    Ramachandran, Vijaya

    in this file.) Parallel Open Ear Decomposition with Applications to Graph Biconnectivity and Triconnectivity describe this method for searching undirected graphs, called ``open ear decomposition'', and we relate and we relate it to a sequential algorithm based on depth­first search. We then apply open ear

  4. Chapter in SYNTHESIS OF PARALLEL ALGORITHMS, Morgan-Kaufmann, 1993. (Figures not yet included in this file.) Parallel Open Ear Decomposition

    E-print Network

    Ramachandran, Vijaya

    in this file.) Parallel Open Ear Decomposition with Applications to Graph Biconnectivity and Triconnectivity this method for searching undirected graphs, called open ear decomposition", and we relate this decomposition relate it to a sequential algorithm based on depth- rst search. We then apply open ear decomposition

  5. Parallel programming with PCN

    SciTech Connect

    Foster, I.; Tuecke, S.

    1993-01-01

    PCN is a system for developing and executing parallel programs. It comprises a high-level programming language, tools for developing and debugging programs in this language, and interfaces to Fortran and Cthat allow the reuse of existing code in multilingual parallel programs. Programs developed using PCN are portable across many different workstations, networks, and parallel computers. This document provides all the information required to develop parallel programs with the PCN programming system. It includes both tutorial and reference material. It also presents the basic concepts that underlie PCN, particularly where these are likely to be unfamiliar to the reader, and provides pointers to other documentation on the PCN language, programming techniques, and tools. PCN is in the public domain. The latest version of both the software and this manual can be obtained by anonymous ftp from Argonne National Laboratory in the directory pub/pcn at info.mcs. ani.gov (cf. Appendix A). This version of this document describes PCN version 2.0, a major revision of the PCN programming system. It supersedes earlier versions of this report.

  6. NAS Parallel Benchmarks Results

    NASA Technical Reports Server (NTRS)

    Subhash, Saini; Bailey, David H.; Lasinski, T. A. (Technical Monitor)

    1995-01-01

    The NAS Parallel Benchmarks (NPB) were developed in 1991 at NASA Ames Research Center to study the performance of parallel supercomputers. The eight benchmark problems are specified in a pencil and paper fashion i.e. the complete details of the problem to be solved are given in a technical document, and except for a few restrictions, benchmarkers are free to select the language constructs and implementation techniques best suited for a particular system. In this paper, we present new NPB performance results for the following systems: (a) Parallel-Vector Processors: Cray C90, Cray T'90 and Fujitsu VPP500; (b) Highly Parallel Processors: Cray T3D, IBM SP2 and IBM SP-TN2 (Thin Nodes 2); (c) Symmetric Multiprocessing Processors: Convex Exemplar SPP1000, Cray J90, DEC Alpha Server 8400 5/300, and SGI Power Challenge XL. We also present sustained performance per dollar for Class B LU, SP and BT benchmarks. We also mention NAS future plans of NPB.

  7. Parallel Total Energy

    Energy Science and Technology Software Center (ESTSC)

    2004-10-21

    This is a total energy electronic structure code using Local Density Approximation (LDA) of the density funtional theory. It uses the plane wave as the wave function basis set. It can sue both the norm conserving pseudopotentials and the ultra soft pseudopotentials. It can relax the atomic positions according to the total energy. It is a parallel code using MP1.

  8. Massively parallel processor computer

    NASA Technical Reports Server (NTRS)

    Fung, L. W. (inventor)

    1983-01-01

    An apparatus for processing multidimensional data with strong spatial characteristics, such as raw image data, characterized by a large number of parallel data streams in an ordered array is described. It comprises a large number (e.g., 16,384 in a 128 x 128 array) of parallel processing elements operating simultaneously and independently on single bit slices of a corresponding array of incoming data streams under control of a single set of instructions. Each of the processing elements comprises a bidirectional data bus in communication with a register for storing single bit slices together with a random access memory unit and associated circuitry, including a binary counter/shift register device, for performing logical and arithmetical computations on the bit slices, and an I/O unit for interfacing the bidirectional data bus with the data stream source. The massively parallel processor architecture enables very high speed processing of large amounts of ordered parallel data, including spatial translation by shifting or sliding of bits vertically or horizontally to neighboring processing elements.

  9. Parallel hierarchical radiosity rendering

    SciTech Connect

    Carter, M.

    1993-07-01

    In this dissertation, the step-by-step development of a scalable parallel hierarchical radiosity renderer is documented. First, a new look is taken at the traditional radiosity equation, and a new form is presented in which the matrix of linear system coefficients is transformed into a symmetric matrix, thereby simplifying the problem and enabling a new solution technique to be applied. Next, the state-of-the-art hierarchical radiosity methods are examined for their suitability to parallel implementation, and scalability. Significant enhancements are also discovered which both improve their theoretical foundations and improve the images they generate. The resultant hierarchical radiosity algorithm is then examined for sources of parallelism, and for an architectural mapping. Several architectural mappings are discussed. A few key algorithmic changes are suggested during the process of making the algorithm parallel. Next, the performance, efficiency, and scalability of the algorithm are analyzed. The dissertation closes with a discussion of several ideas which have the potential to further enhance the hierarchical radiosity method, or provide an entirely new forum for the application of hierarchical methods.

  10. Parallel Dislocation Simulator

    Energy Science and Technology Software Center (ESTSC)

    2006-10-30

    ParaDiS is software capable of simulating the motion, evolution, and interaction of dislocation networks in single crystals using massively parallel computer architectures. The software is capable of outputting the stress-strain response of a single crystal whose plastic deformation is controlled by the dislocation processes.

  11. High performance parallel architectures

    SciTech Connect

    Anderson, R.E. )

    1989-09-01

    In this paper the author describes current high performance parallel computer architectures. A taxonomy is presented to show computer architecture from the user programmer's point-of-view. The effects of the taxonomy upon the programming model are described. Some current architectures are described with respect to the taxonomy. Finally, some predictions about future systems are presented. 5 refs., 1 fig.

  12. Progress in parallelizing XOOPIC

    NASA Astrophysics Data System (ADS)

    Mardahl, Peter; Verboncoeur, J. P.

    1997-11-01

    XOOPIC (Object Orient Particle in Cell code for X11-based Unix workstations) is presently a serial 2-D 3v particle-in-cell plasma simulation (J.P. Verboncoeur, A.B. Langdon, and N.T. Gladd, ``An object-oriented electromagnetic PIC code.'' Computer Physics Communications 87 (1995) 199-211.). The present effort focuses on using parallel and distributed processing to optimize the simulation for large problems. The benefits include increased capacity for memory intensive problems, and improved performance for processor-intensive problems. The MPI library is used to enable the parallel version to be easily ported to massively parallel, SMP, and distributed computers. The philosophy employed here is to spatially decompose the system into computational regions separated by 'virtual boundaries', objects which contain the local data and algorithms to perform the local field solve and particle communication between regions. This implementation will reduce the changes required in the rest of the program by parallelization. Specific implementation details such as the hiding of communication latency behind local computation will also be discussed.

  13. A Parallel Genetic Algorithm for Automated Electronic Circuit Design

    NASA Technical Reports Server (NTRS)

    Lohn, Jason D.; Colombano, Silvano P.; Haith, Gary L.; Stassinopoulos, Dimitris; Norvig, Peter (Technical Monitor)

    2000-01-01

    We describe a parallel genetic algorithm (GA) that automatically generates circuit designs using evolutionary search. A circuit-construction programming language is introduced and we show how evolution can generate practical analog circuit designs. Our system allows circuit size (number of devices), circuit topology, and device values to be evolved. We present experimental results as applied to analog filter and amplifier design tasks.

  14. Device for balancing parallel strings

    DOEpatents

    Mashikian, Matthew S. (Storrs, CT)

    1985-01-01

    A battery plant is described which features magnetic circuit means in association with each of the battery strings in the battery plant for balancing the electrical current flow through the battery strings by equalizing the voltage across each of the battery strings. Each of the magnetic circuit means generally comprises means for sensing the electrical current flow through one of the battery strings, and a saturable reactor having a main winding connected electrically in series with the battery string, a bias winding connected to a source of alternating current and a control winding connected to a variable source of direct current controlled by the sensing means. Each of the battery strings is formed by a plurality of batteries connected electrically in series, and these battery strings are connected electrically in parallel across common bus conductors.

  15. Search for Neutrinos from Annihilating Dark Matter in the Direction of the Galactic Center with the 40-String IceCube Neutrino Observatory

    E-print Network

    Abbasi, R; Ackermann, M; Adams, J; Aguilar, J A; Ahlers, M; Altmann, D; Andeen, K; Auffenberg, J; Bai, X; Baker, M; Barwick, S W; Baum, V; Bay, R; Beattie, K; Beatty, J J; Bechet, S; Tjus, J Becker; Becker, K -H; Bell, M; Benabderrahmane, M L; BenZvi, S; Berdermann, J; Berghaus, P; Berley, D; Bernardini, E; Bertrand, D; Besson, D Z; Bindig, D; Bissok, M; Blaufuss, E; Blumenthal, J; Boersma, D J; Bohm, C; Bose, D; Böser, S; Botner, O; Brayeur, L; Brown, A M; Bruijn, R; Brunner, J; Buitink, S; Carson, M; Casey, J; Casier, M; Chirkin, D; Christy, B; Clevermann, F; Cohen, S; Cowen, D F; Silva, A H Cruz; Danninger, M; Daughhetee, J; Davis, J C; De Clercq, C; Descamps, F; Desiati, P; Uiterweerd, G de Vries; DeYoung, T; Díaz-Vélez, J C; Dreyer, J; Dumm, J P; Dunkman, M; Eagan, R; Eisch, J; Ellsworth, R W; Engdegård, O; Euler, S; Evenson, P A; Fadiran, O; Fazely, A R; Fedynitch, A; Feintzeig, J; Feusels, T; Filimonov, K; Finley, C; Fischer-Wasels, T; Flis, S; Franckowiak, A; Franke, R; Frantzen, K; Fuchs, T; Gaisser, T K; Gallagher, J; Gerhardt, L; Gladstone, L; Glüsenkamp, T; Goldschmidt, A; Goodman, J A; Góra, D; Grant, D; Groß, A; Grullon, S; Gurtner, M; Ha, C; Ismail, A Haj; Hallgren, A; Halzen, F; Hanson, K; Heereman, D; Heimann, P; Heinen, D; Helbing, K; Hellauer, R; Hickford, S; Hill, G C; Hoffman, K D; Hoffmann, R; Homeier, A; Hoshina, K; Hülß, J -P; Huelsnitz, W; Hulth, P O; Hultqvist, K; Hussain, S; Ishihara, A; Jacobi, E; Jacobsen, J; Japaridze, G S; Jlelati, O; Kappes, A; Karg, T; Karle, A; Kiryluk, J; Kislat, F; Kläs, J; Klein, S R; Köhne, J -H; Kohnen, G; Kolanoski, H; Köpke, L; Kopper, C; Kopper, S; Koskinen, D J; Kowalski, M; Krasberg, M; Kroll, G; Kunnen, J; Kurahashi, N; Kuwabara, T; Labare, M; Laihem, K; Landsman, H; Larson, M J; Lauer, R; Lesiak-Bzdak, M; Lünemann, J; Madsen, J; Maruyama, R; Mase, K; Matis, H S; McNally, F; Meagher, K; Merck, M; Mészáros, P; Meures, T; Miarecki, S; Middell, E; Milke, N; Miller, J; Mohrmann, L; Montaruli, T; Morse, R; Movit, S M; Nahnhauer, R; Naumann, U; Nowicki, S C; Nygren, D R; Obertacke, A; Odrowski, S; Olivas, A; Olivo, M; O'Murchadha, A; Panknin, S; Paul, L; Pepper, J A; Heros, C Pérez de los; Pieloth, D; Pirk, N; Posselt, J; Price, P B; Przybylski, G T; Rädel, L; Rawlins, K; Redl, P; Resconi, E; Rhode, W; Ribordy, M; Richman, M; Riedel, B; Rodrigues, J P; Rothmaier, F; Rott, C; Ruhe, T; Ruzybayev, B; Ryckbosch, D; Saba, S M; Salameh, T; Sander, H -G; Santander, M; Sarkar, S; Schatto, K; Scheel, M; Scheriau, F; Schmidt, T; Schmitz, M; Schoenen, S; Schöneberg, S; Schönherr, L; Schönwald, A; Schukraft, A; Schulte, L; Schulz, O; Seckel, D; Seo, S H; Sestayo, Y; Seunarine, S; Smith, M W E; Soiron, M; Soldin, D; Spiczak, G M; Spiering, C; Stamatikos, M; Stanev, T; Stasik, A; Stezelberger, T; Stokstad, R G; Stößl, A; Strahler, E A; Ström, R; Sullivan, G W; Taavola, H; Taboada, I; Tamburro, A; Ter-Antonyan, S; Tilav, S; Toale, P A; Toscano, S; Usner, M; van der Drift, D; van Eijndhoven, N; Van Overloop, A; van Santen, J; Vehring, M; Voge, M; Walck, C; Waldenmaier, T; Wallraff, M; Walter, M; Wasserman, R; Weaver, Ch; Wendt, C; Westerhoff, S; Whitehorn, N; Wiebe, K; Wiebusch, C H; Williams, D R; Wissing, H; Wolf, M; Wood, T R; Woschnagg, K; Xu, C; Xu, D L; Xu, X W; Yanez, J P; Yodh, G; Yoshida, S; Zarzhitsky, P; Ziemann, J; Zilles, A; Zoll, M

    2012-01-01

    A search for muon neutrinos from dark matter annihilations in the Galactic Center region has been performed with the 40-string configuration of the IceCube Neutrino Observatory using data collected in 367 days of live-time starting in April 2008. The observed fluxes were consistent with the atmospheric background expectations. Upper limits on the self-annihilation cross-section are obtained for dark matter particle masses ranging from 100 GeV to 10 TeV. In the case of decaying dark matter, lower limits on the lifetime have been determined for masses between 200 GeV and 20 TeV.

  16. Search for Neutrinos from Annihilating Dark Matter in the Direction of the Galactic Center with the 40-String IceCube Neutrino Observatory

    E-print Network

    The IceCube collaboration; R. Abbasi; Y. Abdou; M. Ackermann; J. Adams; J. A. Aguilar; M. Ahlers; D. Altmann; K. Andeen; J. Auffenberg; X. Bai; M. Baker; S. W. Barwick; V. Baum; R. Bay; K. Beattie; J. J. Beatty; S. Bechet; J. Becker Tjus; K. -H. Becker; M. Bell; M. L. Benabderrahmane; S. BenZvi; J. Berdermann; P. Berghaus; D. Berley; E. Bernardini; D. Bertrand; D. Z. Besson; D. Bindig; M. Bissok; E. Blaufuss; J. Blumenthal; D. J. Boersma; C. Bohm; D. Bose; S. Böser; O. Botner; L. Brayeur; A. M. Brown; R. Bruijn; J. Brunner; S. Buitink; M. Carson; J. Casey; M. Casier; D. Chirkin; B. Christy; F. Clevermann; S. Cohen; D. F. Cowen; A. H. Cruz Silva; M. Danninger; J. Daughhetee; J. C. Davis; C. De Clercq; F. Descamps; P. Desiati; G. de Vries Uiterweerd; T. DeYoung; J. C. Díaz-Vélez; J. Dreyer; J. P. Dumm; M. Dunkman; R. Eagan; J. Eisch; R. W. Ellsworth; O. Engdegård; S. Euler; P. A. Evenson; O. Fadiran; A. R. Fazely; A. Fedynitch; J. Feintzeig; T. Feusels; K. Filimonov; C. Finley; T. Fischer-Wasels; S. Flis; A. Franckowiak; R. Franke; K. Frantzen; T. Fuchs; T. K. Gaisser; J. Gallagher; L. Gerhardt; L. Gladstone; T. Glüsenkamp; A. Goldschmidt; J. A. Goodman; D. Góra; D. Grant; A. Groß; S. Grullon; M. Gurtner; C. Ha; A. Haj Ismail; A. Hallgren; F. Halzen; K. Hanson; D. Heereman; P. Heimann; D. Heinen; K. Helbing; R. Hellauer; S. Hickford; G. C. Hill; K. D. Hoffman; R. Hoffmann; A. Homeier; K. Hoshina; J. -P. Hülß; W. Huelsnitz; P. O. Hulth; K. Hultqvist; S. Hussain; A. Ishihara; E. Jacobi; J. Jacobsen; G. S. Japaridze; O. Jlelati; A. Kappes; T. Karg; A. Karle; J. Kiryluk; F. Kislat; J. Kläs; S. R. Klein; J. -H. Köhne; G. Kohnen; H. Kolanoski; L. Köpke; C. Kopper; S. Kopper; D. J. Koskinen; M. Kowalski; M. Krasberg; G. Kroll; J. Kunnen; N. Kurahashi; T. Kuwabara; M. Labare; K. Laihem; H. Landsman; M. J. Larson; R. Lauer; M. Lesiak-Bzdak; J. Lünemann; J. Madsen; R. Maruyama; K. Mase; H. S. Matis; F. McNally; K. Meagher; M. Merck; P. Mészáros; T. Meures; S. Miarecki; E. Middell; N. Milke; J. Miller; L. Mohrmann; T. Montaruli; R. Morse; S. M. Movit; R. Nahnhauer; U. Naumann; S. C. Nowicki; D. R. Nygren; A. Obertacke; S. Odrowski; A. Olivas; M. Olivo; A. O'Murchadha; S. Panknin; L. Paul; J. A. Pepper; C. Pérez de los Heros; D. Pieloth; N. Pirk; J. Posselt; P. B. Price; G. T. Przybylski; L. Rädel; K. Rawlins; P. Redl; E. Resconi; W. Rhode; M. Ribordy; M. Richman; B. Riedel; J. P. Rodrigues; F. Rothmaier; C. Rott; T. Ruhe; B. Ruzybayev; D. Ryckbosch; S. M. Saba; T. Salameh; H. -G. Sander; M. Santander; S. Sarkar; K. Schatto; M. Scheel; F. Scheriau; T. Schmidt; M. Schmitz; S. Schoenen; S. Schöneberg; L. Schönherr; A. Schönwald; A. Schukraft; L. Schulte; O. Schulz; D. Seckel; S. H. Seo; Y. Sestayo; S. Seunarine; M. W. E. Smith; M. Soiron; D. Soldin; G. M. Spiczak; C. Spiering; M. Stamatikos; T. Stanev; A. Stasik; T. Stezelberger; R. G. Stokstad; A. Stößl; E. A. Strahler; R. Ström; G. W. Sullivan; H. Taavola; I. Taboada; A. Tamburro; S. Ter-Antonyan; S. Tilav; P. A. Toale; S. Toscano; M. Usner; D. van der Drift; N. van Eijndhoven; A. Van Overloop; J. van Santen; M. Vehring; M. Voge; C. Walck; T. Waldenmaier; M. Wallraff; M. Walter; R. Wasserman; Ch. Weaver; C. Wendt; S. Westerhoff; N. Whitehorn; K. Wiebe; C. H. Wiebusch; D. R. Williams; H. Wissing; M. Wolf; T. R. Wood; K. Woschnagg; C. Xu; D. L. Xu; X. W. Xu; J. P. Yanez; G. Yodh; S. Yoshida; P. Zarzhitsky; J. Ziemann; A. Zilles; M. Zoll

    2013-04-10

    A search for muon neutrinos from dark matter annihilations in the Galactic Center region has been performed with the 40-string configuration of the IceCube Neutrino Observatory using data collected in 367 days of live-time starting in April 2008. The observed fluxes were consistent with the atmospheric background expectations. Upper limits on the self-annihilation cross-section are obtained for dark matter particle masses ranging from 100 GeV to 10 TeV. In the case of decaying dark matter, lower limits on the lifetime have been determined for masses between 200 GeV and 20 TeV.

  17. Allinea DDT as a Parallel Debugging Alternative to Totalview

    SciTech Connect

    Antypas, K.B.

    2007-03-05

    Totalview, from the Etnus Corporation, is a sophisticated and feature rich software debugger for parallel applications. As Totalview has gained in popularity and market share its pricing model has increased to the point where it is often prohibitively expensive for massively parallel supercomputers. Additionally, many of Totalview's advanced features are not used by members of the scientific computing community. For these reasons, supercomputing centers have begun to search for a basic parallel debugging tool which can be used as an alternative to Totalview. As the cost and complexity of Totalview has increased over the years, scientific computing centers have started searching for a viable parallel debugging alternative. DDT (Distributed Debugging Tool) from Allinea Software is a relatively new parallel debugging tool which aims to provide much of the same functionality as Totalview. This review outlines the basic features and limitations of DDT to determine if it can be a reasonable substitute for Totalview. DDT was tested on the NERSC platforms Bassi, Seaborg, Jacquard and Davinci with Fortran90, C, and C++ codes using MPI and OpenMP for parallelism.

  18. Pattern recognition with parallel associative memory

    NASA Technical Reports Server (NTRS)

    Toth, Charles K.; Schenk, Toni

    1990-01-01

    An examination is conducted of the feasibility of searching targets in aerial photographs by means of a parallel associative memory (PAM) that is based on the nearest-neighbor algorithm; the Hamming distance is used as a measure of closeness, in order to discriminate patterns. Attention has been given to targets typically used for ground-control points. The method developed sorts out approximate target positions where precise localizations are needed, in the course of the data-acquisition process. The majority of control points in different images were correctly identified.

  19. Parallelized CCHE2D flow model with CUDA Fortran on Graphics Process Units

    Technology Transfer Automated Retrieval System (TEKTRAN)

    This paper presents the CCHE2D implicit flow model parallelized using CUDA Fortran programming technique on Graphics Processing Units (GPUs). A parallelized implicit Alternating Direction Implicit (ADI) solver using Parallel Cyclic Reduction (PCR) algorithm on GPU is developed and tested. This solve...

  20. Parallel electric fields in the upward current region of the aurora: Numerical solutions

    E-print Network

    Carlson, Charles W.

    Parallel electric fields in the upward current region of the aurora: Numerical solutions R. E that a parallel electric field in the upward current region of the aurora is not confined to a single region along Direct observations of the parallel electric field by the Fast Auroral Snapshot satellite and the Polar

  1. Characteristics of parallel electric fields in the downward current region of the aurora

    E-print Network

    Carlson, Charles W.

    Characteristics of parallel electric fields in the downward current region of the aurora L downward current region. The observed parallel electric fields have amplitudes reaching nearly 1 V, Colorado 80309 Received 19 December 2001; accepted 7 May 2002 Direct measurements of parallel electric

  2. Consistent first solution speedups in OR-parallel execution of logic programs

    SciTech Connect

    Ramkumar, V.A.B.; Kale, L.V. . Dept. of Computer Science)

    1990-01-01

    The authors consider the problem of searching for one possible solution for a logic program in parallel. Most of the proposed parallel search strategies l = for logic programs fail to provide consistent linear speedups over sequential execution. The speedups vary between sub-linear to super-linear and from run to run. They present search strategies using priorities for OR parallel execution of logic programs when both consumer instance and pipeline parallelism is exploited using the REDUCE/OR process model. These strategies yield consistent speedups to first solution, which increase linearly with addition of processors. This is achieved by prioritizing the consumer instances of a goal literal. In addition the total number of nodes expanded during parallel search is kept very close to that in a sequential depth-first search. The authors describe a technique called delayed release to accomplish this. This is done by assigning priorities to subgoals that need to be evaluated, and initially exploring one branch at each OR node in the search tree. The unexplored OR alternatives are released in a delay manner. The authors present performance data on large OR parallel benchmark programs. The data demonstrates consistent linear speedups to first solution and the effectiveness of the scheme in reducing redundant work with efficient use of memory.

  3. The role of hydrous phases in the formation of trench parallel anisotropy: Evidence from Rayleigh waves in Cascadia

    E-print Network

    The role of hydrous phases in the formation of trench parallel anisotropy: Evidence from Rayleigh exhibiting trench parallel fast directions in subduction systems has been the subject of significant recent an unusually well-localized region of trench parallel fast directions in Rayleigh wave phase velocities near

  4. Resistor Combinations for Parallel Circuits.

    ERIC Educational Resources Information Center

    McTernan, James P.

    1978-01-01

    To help simplify both teaching and learning of parallel circuits, a high school electricity/electronics teacher presents and illustrates the use of tables of values for parallel resistive circuits in which total resistances are whole numbers. (MF)

  5. Descriptive Simplicity in Parallel Computing 

    E-print Network

    Marr, Marcus

    The programming of parallel computers is recognised as being a difficult task and there exist a wide selection of parallel programming languages and environments. This thesis presents and examines the Hierarchical ...

  6. Tinkertoy Parallel Programming: Complicated Applications

    E-print Network

    Plimpton, Steve

    parallel algorithms for particle modeling, crash simulations and transferring data between two independent of activity within the parallel computing community. A key \\Lambda This work was funded by the Applied

  7. On parallel machine scheduling 1

    E-print Network

    Magdeburg, Universität

    On parallel machine scheduling 1 machines with setup times. The setup has to be performed by a single server. The objective is to minimize even for the case of two identical parallel machines. This paper presents a pseudopolynomial

  8. The Galley Parallel File System

    NASA Technical Reports Server (NTRS)

    Nieuwejaar, Nils; Kotz, David

    1996-01-01

    As the I/O needs of parallel scientific applications increase, file systems for multiprocessors are being designed to provide applications with parallel access to multiple disks. Many parallel file systems present applications with a conventional Unix-like interface that allows the application to access multiple disks transparently. The interface conceals the parallelism within the file system, which increases the ease of programmability, but makes it difficult or impossible for sophisticated programmers and libraries to use knowledge about their I/O needs to exploit that parallelism. Furthermore, most current parallel file systems are optimized for a different workload than they are being asked to support. We introduce Galley, a new parallel file system that is intended to efficiently support realistic parallel workloads. We discuss Galley's file structure and application interface, as well as an application that has been implemented using that interface.

  9. Ultrascalable petaflop parallel supercomputer

    DOEpatents

    Blumrich, Matthias A. (Ridgefield, CT); Chen, Dong (Croton On Hudson, NY); Chiu, George (Cross River, NY); Cipolla, Thomas M. (Katonah, NY); Coteus, Paul W. (Yorktown Heights, NY); Gara, Alan G. (Mount Kisco, NY); Giampapa, Mark E. (Irvington, NY); Hall, Shawn (Pleasantville, NY); Haring, Rudolf A. (Cortlandt Manor, NY); Heidelberger, Philip (Cortlandt Manor, NY); Kopcsay, Gerard V. (Yorktown Heights, NY); Ohmacht, Martin (Yorktown Heights, NY); Salapura, Valentina (Chappaqua, NY); Sugavanam, Krishnan (Mahopac, NY); Takken, Todd (Brewster, NY)

    2010-07-20

    A massively parallel supercomputer of petaOPS-scale includes node architectures based upon System-On-a-Chip technology, where each processing node comprises a single Application Specific Integrated Circuit (ASIC) having up to four processing elements. The ASIC nodes are interconnected by multiple independent networks that optimally maximize the throughput of packet communications between nodes with minimal latency. The multiple networks may include three high-speed networks for parallel algorithm message passing including a Torus, collective network, and a Global Asynchronous network that provides global barrier and notification functions. These multiple independent networks may be collaboratively or independently utilized according to the needs or phases of an algorithm for optimizing algorithm processing performance. The use of a DMA engine is provided to facilitate message passing among the nodes without the expenditure of processing resources at the node.

  10. Homology, convergence and parallelism.

    PubMed

    Ghiselin, Michael T

    2016-01-01

    Homology is a relation of correspondence between parts of parts of larger wholes. It is used when tracking objects of interest through space and time and in the context of explanatory historical narratives. Homologues can be traced through a genealogical nexus back to a common ancestral precursor. Homology being a transitive relation, homologues remain homologous however much they may come to differ. Analogy is a relationship of correspondence between parts of members of classes having no relationship of common ancestry. Although homology is often treated as an alternative to convergence, the latter is not a kind of correspondence: rather, it is one of a class of processes that also includes divergence and parallelism. These often give rise to misleading appearances (homoplasies). Parallelism can be particularly hard to detect, especially when not accompanied by divergences in some parts of the body. PMID:26598721

  11. Parallel Subconvolution Filtering Architectures

    NASA Technical Reports Server (NTRS)

    Gray, Andrew A.

    2003-01-01

    These architectures are based on methods of vector processing and the discrete-Fourier-transform/inverse-discrete- Fourier-transform (DFT-IDFT) overlap-and-save method, combined with time-block separation of digital filters into frequency-domain subfilters implemented by use of sub-convolutions. The parallel-processing method implemented in these architectures enables the use of relatively small DFT-IDFT pairs, while filter tap lengths are theoretically unlimited. The size of a DFT-IDFT pair is determined by the desired reduction in processing rate, rather than on the order of the filter that one seeks to implement. The emphasis in this report is on those aspects of the underlying theory and design rules that promote computational efficiency, parallel processing at reduced data rates, and simplification of the designs of very-large-scale integrated (VLSI) circuits needed to implement high-order filters and correlators.

  12. Parallel multilevel preconditioners

    SciTech Connect

    Bramble, J.H.; Pasciak, J.E.; Xu, Jinchao.

    1989-01-01

    In this paper, we shall report on some techniques for the development of preconditioners for the discrete systems which arise in the approximation of solutions to elliptic boundary value problems. Here we shall only state the resulting theorems. It has been demonstrated that preconditioned iteration techniques often lead to the most computationally effective algorithms for the solution of the large algebraic systems corresponding to boundary value problems in two and three dimensional Euclidean space. The use of preconditioned iteration will become even more important on computers with parallel architecture. This paper discusses an approach for developing completely parallel multilevel preconditioners. In order to illustrate the resulting algorithms, we shall describe the simplest application of the technique to a model elliptic problem.

  13. Parallel grid population

    DOEpatents

    Wald, Ingo; Ize, Santiago

    2015-07-28

    Parallel population of a grid with a plurality of objects using a plurality of processors. One example embodiment is a method for parallel population of a grid with a plurality of objects using a plurality of processors. The method includes a first act of dividing a grid into n distinct grid portions, where n is the number of processors available for populating the grid. The method also includes acts of dividing a plurality of objects into n distinct sets of objects, assigning a distinct set of objects to each processor such that each processor determines by which distinct grid portion(s) each object in its distinct set of objects is at least partially bounded, and assigning a distinct grid portion to each processor such that each processor populates its distinct grid portion with any objects that were previously determined to be at least partially bounded by its distinct grid portion.

  14. PARALLEL ELECTRIC FIELD SPECTRUM OF SOLAR WIND TURBULENCE

    SciTech Connect

    Mozer, F. S.; Chen, C. H. K.

    2013-05-01

    By searching through more than 10 satellite years of THEMIS and Cluster data, 3 reliable examples of parallel electric field turbulence in the undisturbed solar wind have been found. The perpendicular and parallel electric field spectra in these examples have similar shapes and amplitudes, even at large scales (frequencies below the ion gyroscale), where Alfvenic turbulence with no parallel electric field component is thought to dominate. The spectra of the parallel electric field fluctuations are power laws with exponents near -5/3 below the ion scales ({approx}0.1 Hz), and with a flattening of the spectrum in the vicinity of this frequency. At small scales (above a few Hz), the spectra are steeper than -5/3 with values in the range of -2.1 to -2.8. These steeper slopes are consistent with expectations for kinetic Alfven turbulence, although their amplitude relative to the perpendicular fluctuations is larger than expected.

  15. Scioto: A Framework for Global-ViewTask Parallelism

    SciTech Connect

    Dinan, James S.; Krishnamoorthy, Sriram; Larkins, D. B.; Nieplocha, Jaroslaw; Sadayappan, Ponnuswamy

    2008-09-09

    We introduce Scioto, Shared Collections of Task Objects, a framework for supporting task-parallelism in one-sided and global-view parallel programming models. Scioto provides lightweight, locality aware dynamic load balancing and interoperates with existing parallel models including MPI, SHMEM, CAF, and Global Arrays. Through task parallelism, the Scioto framework provides a solution for overcoming load imbalance and heterogeneity as well as dynamic mapping of computation onto emerging multicore architectures. In this paper, we present the design and implementation of the Scioto framework and demonstrate its effectiveness on the Unbalanced Tree Search (UTS) benchmark and two quantum chemistry codes: the closed shell Self-Consistent Field (SCF) method and a sparse tensor contraction kernel extracted from a coupled cluster computation. We explore the efficiency and scalability of Scioto through these sample applications and demonstrate that is offers low overhead, achieves good performance on heterogeneous and multicore clusters, and scales to hundreds of processors.

  16. Xyce parallel electronic simulator.

    SciTech Connect

    Keiter, Eric Richard; Mei, Ting; Russo, Thomas V.; Rankin, Eric Lamont; Schiek, Richard Louis; Thornquist, Heidi K.; Fixel, Deborah A.; Coffey, Todd Stirling; Pawlowski, Roger Patrick; Santarelli, Keith R.

    2010-05-01

    This document is a reference guide to the Xyce Parallel Electronic Simulator, and is a companion document to the Xyce Users' Guide. The focus of this document is (to the extent possible) exhaustively list device parameters, solver options, parser options, and other usage details of Xyce. This document is not intended to be a tutorial. Users who are new to circuit simulation are better served by the Xyce Users' Guide.

  17. Parallel sphere rendering

    SciTech Connect

    Krogh, M.; Painter, J.; Hansen, C.

    1996-10-01

    Sphere rendering is an important method for visualizing molecular dynamics data. This paper presents a parallel algorithm that is almost 90 times faster than current graphics workstations. To render extremely large data sets and large images, the algorithm uses the MIMD features of the supercomputers to divide up the data, render independent partial images, and then finally composite the multiple partial images using an optimal method. The algorithm and performance results are presented for the CM-5 and the M.

  18. Parallel Pascal - An extended Pascal for parallel computers

    NASA Technical Reports Server (NTRS)

    Reeves, A. P.

    1984-01-01

    Parallel Pascal is an extended version of the conventional serial Pascal programming language which includes a convenient syntax for specifying array operations. It is upward compatible with standard Pascal and involves only a small number of carefully chosen new features. Parallel Pascal was developed to reduce the semantic gap between standard Pascal and a large range of highly parallel computers. Two important design goals of Parallel Pascal were efficiency and portability. Portability is particularly difficult to achieve since different parallel computers frequently have very different capabilities.

  19. A Parallel Particle Swarm Optimization Algorithm Accelerated by Asynchronous Evaluations

    NASA Technical Reports Server (NTRS)

    Venter, Gerhard; Sobieszczanski-Sobieski, Jaroslaw

    2005-01-01

    A parallel Particle Swarm Optimization (PSO) algorithm is presented. Particle swarm optimization is a fairly recent addition to the family of non-gradient based, probabilistic search algorithms that is based on a simplified social model and is closely tied to swarming theory. Although PSO algorithms present several attractive properties to the designer, they are plagued by high computational cost as measured by elapsed time. One approach to reduce the elapsed time is to make use of coarse-grained parallelization to evaluate the design points. Previous parallel PSO algorithms were mostly implemented in a synchronous manner, where all design points within a design iteration are evaluated before the next iteration is started. This approach leads to poor parallel speedup in cases where a heterogeneous parallel environment is used and/or where the analysis time depends on the design point being analyzed. This paper introduces an asynchronous parallel PSO algorithm that greatly improves the parallel e ciency. The asynchronous algorithm is benchmarked on a cluster assembled of Apple Macintosh G5 desktop computers, using the multi-disciplinary optimization of a typical transport aircraft wing as an example.

  20. Parallel-processing techniques for production systems

    SciTech Connect

    da Mota Tenorio, M.F.

    1987-01-01

    Production systems static and dynamic characteristics are modeled with the use of graph grammar, in order to create means to increase the processing efficiency and the use of parallel computation through compile-time analysis. The model is used to explicate rule interaction, so that proofs of equivalence between knowledge bases can be attempted. Solely relying on program static characteristics shown by the model, a series of observations are made to determine the system dynamic characteristics and modifications to the original knowledge base are suggested as a means of increasing efficiency and decreasing overall search and computational effort. Dependencies between the rules are analyzed and different approaches for automatic detection are presented. From rule dependences, tools for programming environments,logical evaluation of search spaces and Petri net models of production systems are shown. An algorithm for the allocation and partitioning of a production system into a multiprocessor system is also shown, and addresses the problems of communication and execution of these systems in parallel. Finally, the results of a simulator constructed to test several strategies, networks, and algorithms are presented.

  1. Comment on: ``Search for direct photons from S-Au Collisions at 200 GeV/nucleon'' by the CERES Collaboration

    E-print Network

    K. H. Kampert; T. C. Awes; P. Stankus; H. H. Gutbrod; V. Manko; T. Peitzmann; R. Santo

    1997-03-27

    In this note we comment on a recent publication in this journal by the CERES (NA45) Collaboration. The authors report to have determined an upper limit on the direct photon yield relative to the decay photon yield in S+Au collisions of 14 % and 7 % by two different methods, respectively. We argue that these limits are unsupported by the results and analysis of the CERES data. The systematic error estimates quoted in the CERES analysis are consistently overly optimistic. Using more realistic estimates of the various error contributions and propagating them appropriately we arrive at a direct photon upper limit which at best is 20% of the inclusive photon yield, and most probably is much higher.

  2. Parallelization of Rocket Engine Simulator Software (PRESS)

    NASA Technical Reports Server (NTRS)

    Cezzar, Ruknet

    1998-01-01

    We have outlined our work in the last half of the funding period. We have shown how a demo package for RESSAP using MPI can be done. However, we also mentioned the difficulties with the UNIX platform. We have reiterated some of the suggestions made during the presentation of the progress of the at Fourth Annual HBCU Conference. Although we have discussed, in some detail, how TURBDES/PUMPDES software can be run in parallel using MPI, at present, we are unable to experiment any further with either MPI or PVM. Due to X windows not being implemented, we are also not able to experiment further with XPVM, which it will be recalled, has a nice GUI interface. There are also some concerns, on our part, about MPI being an appropriate tool. The best thing about MPr is that it is public domain. Although and plenty of documentation exists for the intricacies of using MPI, little information is available on its actual implementations. Other than very typical, somewhat contrived examples, such as Jacobi algorithm for solving Laplace's equation, there are few examples which can readily be applied to real situations, such as in our case. In effect, the review of literature on both MPI and PVM, and there is a lot, indicate something similar to the enormous effort which was spent on LISP and LISP-like languages as tools for artificial intelligence research. During the development of a book on programming languages [12], when we searched the literature for very simple examples like taking averages, reading and writing records, multiplying matrices, etc., we could hardly find a any! Yet, so much was said and done on that topic in academic circles. It appears that we faced the same problem with MPI, where despite significant documentation, we could not find even a simple example which supports course-grain parallelism involving only a few processes. From the foregoing, it appears that a new direction may be required for more productive research during the extension period (10/19/98 - 10/18/99). At the least, the research would need to be done on Windows 95/Windows NT based platforms. Moreover, with the acquisition of Lahey Fortran package for PC platform, and the existing Borland C + + 5. 0, we can do work on C + + wrapper issues. We have carefully studied the blueprint for Space Transportation Propulsion Integrated Design Environment for the next 25 years [13] and found the inclusion of HBCUs in that effort encouraging. Especially in the long period for which a map is provided, there is no doubt that HBCUs will grow and become better equipped to do meaningful research. In the shorter period, as was suggested in our presentation at the HBCU conference, some key decisions regarding the aging Fortran based software for rocket propellants will need to be made. One important issue is whether or not object oriented languages such as C + + or Java should be used for distributed computing. Whether or not "distributed computing" is necessary for the existing software is yet another, larger, question to be tackled with.

  3. Search Recipes

    MedlinePLUS

    ... Home Recipes Household Supplemental Nutrition Assistance Program (SNAP) Search Recipes 1 - 20 of 787 results Sort by ... 5 … next › last » Skip to top of page Search Recipes Sort by Items per page Sort by ...

  4. Confidential Searches.

    ERIC Educational Resources Information Center

    Kenney, Linda Chion

    2003-01-01

    Will the stealth superintendent hunt in Cincinnati become tomorrow's standard approach? Search consultants and superintendents offer their views on how far confidentiality should go. Also includes a search firm's process for shielding identities and a confidentiality pledge. (MLF)

  5. Personalized Search

    E-print Network

    AUTHOR|(SzGeCERN)749939

    2015-01-01

    As the volume of electronically available information grows, relevant items become harder to find. This work presents an approach to personalizing search results in scientific publication databases. This work focuses on re-ranking search results from existing search engines like Solr or ElasticSearch. This work also includes the development of Obelix, a new recommendation system used to re-rank search results. The project was proposed and performed at CERN, using the scientific publications available on the CERN Document Server (CDS). This work experiments with re-ranking using offline and online evaluation of users and documents in CDS. The experiments conclude that the personalized search result outperform both latest first and word similarity in terms of click position in the search result for global search in CDS.

  6. APHID Game-Tree Search Mark G. Brockington, brock@cs.ualberta.ca

    E-print Network

    Schaeffer, Jonathan

    APHID Game-Tree Search Mark G. Brockington, brock@cs.ualberta.ca Jonathan Schae er, jonathan This paper introduces the APHID (Asynchronous Parallel Hierarchical Iterative Deepening) game- tree search algorithm. An APHID search is controlled by a master and a series of slave processors. The master searches

  7. Search for direct pair production of the top squark in all-hadronic final states in proton-proton collisions at = 8 TeV with the ATLAS detector

    NASA Astrophysics Data System (ADS)

    Aad, G.; Abbott, B.; Abdallah, J.; Abdel Khalek, S.; Abdinov, O.; Aben, R.; Abi, B.; Abolins, M.; AbouZeid, O. S.; Abramowicz, H.; Abreu, H.; Abreu, R.; Abulaiti, Y.; Acharya, B. S.; Adamczyk, L.; Adams, D. L.; Adelman, J.; Adomeit, S.; Adye, T.; Agatonovic-Jovin, T.; Aguilar-Saavedra, J. A.; Agustoni, M.; Ahlen, S. P.; Ahmadov, F.; Aielli, G.; Akerstedt, H.; Åkesson, T. P. A.; Akimoto, G.; Akimov, A. V.; Alberghi, G. L.; Albert, J.; Albrand, S.; Alconada Verzini, M. J.; Aleksa, M.; Aleksandrov, I. N.; Alexa, C.; Alexander, G.; Alexandre, G.; Alexopoulos, T.; Alhroob, M.; Alimonti, G.; Alio, L.; Alison, J.; Allbrooke, B. M. M.; Allison, L. J.; Allport, P. P.; Almond, J.; Aloisio, A.; Alonso, A.; Alonso, F.; Alpigiani, C.; Altheimer, A.; Gonzalez, B. Alvarez; Alviggi, M. G.; Amako, K.; Amaral Coutinho, Y.; Amelung, C.; Amidei, D.; Amor Dos Santos, S. P.; Amorim, A.; Amoroso, S.; Amram, N.; Amundsen, G.; Anastopoulos, C.; Ancu, L. S.; Andari, N.; Andeen, T.; Anders, C. F.; Anders, G.; Anderson, K. J.; Andreazza, A.; Andrei, V.; Anduaga, X. S.; Angelidakis, S.; Angelozzi, I.; Anger, P.; Angerami, A.; Anghinolfi, F.; Anisenkov, A. V.; Anjos, N.; Annovi, A.; Antonaki, A.; Antonelli, M.; Antonov, A.; Antos, J.; Anulli, F.; Aoki, M.; Bella, L. Aperio; Apolle, R.; Arabidze, G.; Aracena, I.; Arai, Y.; Araque, J. P.; Arce, A. T. H.; Arguin, J.-F.; Argyropoulos, S.; Arik, M.; Armbruster, A. J.; Arnaez, O.; Arnal, V.; Arnold, H.; Arratia, M.; Arslan, O.; Artamonov, A.; Artoni, G.; Asai, S.; Asbah, N.; Ashkenazi, A.; Åsman, B.; Asquith, L.; Assamagan, K.; Astalos, R.; Atkinson, M.; Atlay, N. B.; Auerbach, B.; Augsten, K.; Aurousseau, M.; Avolio, G.; Azuelos, G.; Azuma, Y.; Baak, M. A.; Baas, A.; Bacci, C.; Bachacou, H.; Bachas, K.; Backes, M.; Backhaus, M.; Mayes, J. Backus; Badescu, E.; Bagiacchi, P.; Bagnaia, P.; Bai, Y.; Bain, T.; Baines, J. T.; Baker, O. K.; Balek, P.; Balli, F.; Banas, E.; Banerjee, Sw.; Bannoura, A. A. E.; Bansal, V.; Bansil, H. S.; Barak, L.; Baranov, S. P.; Barberio, E. L.; Barberis, D.; Barbero, M.; Barillari, T.; Barisonzi, M.; Barklow, T.; Barlow, N.; Barnett, B. M.; Barnett, R. M.; Barnovska, Z.; Baroncelli, A.; Barone, G.; Barr, A. J.; Barreiro, F.; da Costa, J. Barreiro Guimarães; Bartoldus, R.; Barton, A. E.; Bartos, P.; Bartsch, V.; Bassalat, A.; Basye, A.; Bates, R. L.; Batkova, L.; Batley, J. R.; Battaglia, M.; Battistin, M.; Bauer, F.; Bawa, H. S.; Beau, T.; Beauchemin, P. H.; Beccherle, R.; Bechtle, P.; Beck, H. P.; Becker, K.; Becker, S.; Beckingham, M.; Becot, C.; Beddall, A. J.; Beddall, A.; Bedikian, S.; Bednyakov, V. A.; Bee, C. P.; Beemster, L. J.; Beermann, T. A.; Begel, M.; Behr, K.; Belanger-Champagne, C.; Bell, P. J.; Bell, W. H.; Bella, G.; Bellagamba, L.; Bellerive, A.; Bellomo, M.; Belotskiy, K.; Beltramello, O.; Benary, O.; Benchekroun, D.; Bendtz, K.; Benekos, N.; Benhammou, Y.; Benhar Noccioli, E.; Benitez Garcia, J. A.; Benjamin, D. P.; Bensinger, J. R.; Benslama, K.; Bentvelsen, S.; Berge, D.; Bergeaas Kuutmann, E.; Berger, N.; Berghaus, F.; Beringer, J.; Bernard, C.; Bernat, P.; Bernius, C.; Bernlochner, F. U.; Berry, T.; Berta, P.; Bertella, C.; Bertoli, G.; Bertolucci, F.; Bertsche, D.; Besana, M. I.; Besjes, G. J.; Bessidskaia, O.; Bessner, M. F.; Besson, N.; Betancourt, C.; Bethke, S.; Bhimji, W.; Bianchi, R. M.; Bianchini, L.; Bianco, M.; Biebel, O.; Bieniek, S. P.; Bierwagen, K.; Biesiada, J.; Biglietti, M.; De Mendizabal, J. Bilbao; Bilokon, H.; Bindi, M.; Binet, S.; Bingul, A.; Bini, C.; Black, C. W.; Black, J. E.; Black, K. M.; Blackburn, D.; Blair, R. E.; Blanchard, J.-B.; Blazek, T.; Bloch, I.; Blocker, C.; Blum, W.; Blumenschein, U.; Bobbink, G. J.; Bobrovnikov, V. S.; Bocchetta, S. S.; Bocci, A.; Bock, C.; Boddy, C. R.; Boehler, M.; Boek, T. T.; Bogaerts, J. A.; Bogdanchikov, A. G.; Bogouch, A.; Bohm, C.; Bohm, J.; Boisvert, V.; Bold, T.; Boldea, V.; Boldyrev, A. S.; Bomben, M.; Bona, M.; Boonekamp, M.; Borisov, A.; Borissov, G.; Borri, M.; Borroni, S.; Bortfeldt, J.; Bortolotto, V.; Bos, K.; Boscherini, D.; Bosman, M.; Boterenbrood, H.; Boudreau, J.; Bouffard, J.; Bouhova-Thacker, E. V.; Boumediene, D.; Bourdarios, C.; Bousson, N.; Boutouil, S.; Boveia, A.; Boyd, J.; Boyko, I. R.; Bracinik, J.; Brandt, A.; Brandt, G.; Brandt, O.; Bratzler, U.; Brau, B.; Brau, J. E.; Braun, H. M.; Brazzale, S. F.; Brelier, B.; Brendlinger, K.; Brennan, A. J.; Brenner, R.; Bressler, S.; Bristow, K.; Bristow, T. M.; Britton, D.; Brochu, F. M.; Brock, I.; Brock, R.; Bromberg, C.; Bronner, J.; Brooijmans, G.; Brooks, T.; Brooks, W. K.; Brosamer, J.; Brost, E.; Brown, J.; de Renstrom, P. A. Bruckman; Bruncko, D.; Bruneliere, R.; Brunet, S.; Bruni, A.; Bruni, G.; Bruschi, M.; Bryngemark, L.; Buanes, T.; Buat, Q.; Bucci, F.; Buchholz, P.

    2014-09-01

    The results of a search for direct pair production of the scalar partner to the top quark using an integrated luminosity of 20.1 fb-1 of proton-proton collision data at = 8 TeV recorded with the ATLAS detector at the LHC are reported. The top squark is assumed to decay via or , where denotes the lightest neutralino (chargino) in supersymmetric models. The search targets a fully-hadronic final state in events with four or more jets and large missing transverse momentum. No significant excess over the Standard Model background prediction is observed, and exclusion limits are reported in terms of the top squark and neutralino masses and as a function of the branching fraction of . For a branching fraction of 100%, top squark masses in the range 270-645 GeV are excluded for masses below 30 GeV. For a branching fraction of 50% to either or , and assuming the mass to be twice the mass, top squark masses in the range 250-550 GeV are excluded for masses below 60 GeV. [Figure not available: see fulltext.

  8. Search for direct pair production of a chargino and a neutralino decaying to the 125 GeV Higgs boson in ?s = 8  TeV pp collisions with the ATLAS detector

    SciTech Connect

    Aad, G.

    2015-05-12

    A search is presented for the direct pair production of a chargino and a neutralino pp??~±1?~02, where the chargino decays to the lightest neutralino and the W boson, ?1??~01(W± ? ?±?), while the neutralino decays to the lightest neutralino and the 125 GeV Higgs boson, ?~02??~01(h ? bb/??/?±?qq). The final states considered for the search have large missing transverse momentum, an isolated electron or muon, and one of the following: either two jets identified as originating from bottom quarks, or two photons, or a second electron or muon with the same electric charge. The analysis is based on 20.3 fb-1 of ?s=8 TeV proton–proton collision data delivered by the Large Hadron Collider and recorded with the ATLAS detector. Observations are consistent with the Standard Model expectations; limits are set in the context of a simplified super-symmetric model.

  9. Computer Assisted Parallel Program Generation

    E-print Network

    Kawata, Shigeo

    2015-01-01

    Parallel computation is widely employed in scientific researches, engineering activities and product development. Parallel program writing itself is not always a simple task depending on problems solved. Large-scale scientific computing, huge data analyses and precise visualizations, for example, would require parallel computations, and the parallel computing needs the parallelization techniques. In this Chapter a parallel program generation support is discussed, and a computer-assisted parallel program generation system P-NCAS is introduced. Computer assisted problem solving is one of key methods to promote innovations in science and engineering, and contributes to enrich our society and our life toward a programming-free environment in computing science. Problem solving environments (PSE) research activities had started to enhance the programming power in 1970's. The P-NCAS is one of the PSEs; The PSE concept provides an integrated human-friendly computational software and hardware system to solve a target ...

  10. Effect of Thenardite on the Direct Detection of Aromatic Amino Acids: Implications for the Search for Life in the Solar System

    SciTech Connect

    C. Doc Richardson; Nancy W. Hinman; Jill R. Scott

    2009-10-01

    With the discovery of Na-sulfate minerals on Mars and Europa, recent studies using these minerals have focused on their ability to assist in the detection of bio/organic signatures. This study further investigates the ability of thenardite (Na2SO4) to effectively facilitate the ionization and identification of aromatic amino acids (phenylalanine, tyrosine, and tryptophan) using a technique called geomatrix-assisted laser desorption/ionization (GALDI) in conjunction with a Fourier transform mass spectrometry (FTICR-MS). This technique is based on the ability of a mineral host to facilitate the ionization and detection of bio/organic molecules. Spectra obtained from each aromatic amino acid alone and in combination with thenardite show differences in ionization mechanism and fragmentation patterns. These differences are due to chemical and structural differences between the aromatic side chains of their respective amino acid. Tyrosine and tryptophan when combined with thenardite were observed to undergo cation-attachment ([M+Na]+), due to the high alkali affinity of their aromatic side chains. Subsequent cation substitution of the carboxyl group led to formation double cation-attached peaks ([M-H+Na]Na+). In contrast, phenylalanine mixed with thenardite showed no evidence of Na+ interaction. Understanding how codeposition of amino acids with thenardite can affect the observed mass spectra is important for future exploration missions that are likely to use laser desorption mass spectrometry to search for bio/organic compounds in extraterrestrial environments.

  11. Search for direct top squark pair production in final states with one isolated lepton, jets, and missing transverse momentum in sqrt[s] = 7 TeV pp collisions using 4.7 fb(-10 of ATLAS data.

    PubMed

    Aad, G; Abajyan, T; Abbott, B; Abdallah, J; Abdel Khalek, S; Abdelalim, A A; Abdinov, O; Aben, R; Abi, B; Abolins, M; Abouzeid, O S; Abramowicz, H; Abreu, H; Acharya, B S; Adamczyk, L; Adams, D L; Addy, T N; Adelman, J; Adomeit, S; Adragna, P; Adye, T; Aefsky, S; Aguilar-Saavedra, J A; Agustoni, M; Aharrouche, M; Ahlen, S P; Ahles, F; Ahmad, A; Ahsan, M; Aielli, G; Akdogan, T; Akesson, T P A; Akimoto, G; Akimov, A V; Alam, M S; Alam, M A; Albert, J; Albrand, S; Aleksa, M; Aleksandrov, I N; Alessandria, F; Alexa, C; Alexander, G; Alexandre, G; Alexopoulos, T; Alhroob, M; Aliev, M; Alimonti, G; Alison, J; Allbrooke, B M M; Allport, P P; Allwood-Spiers, S E; Almond, J; Aloisio, A; Alon, R; Alonso, A; Alonso, F; Altheimer, A D; Alvarez Gonzalez, B; Alviggi, M G; Amako, K; Amelung, C; Ammosov, V V; Amorim, A; Amram, N; Anastopoulos, C; Ancu, L S; Andari, N; Andeen, T; Anders, C F; Anders, G; Anderson, K J; Andreazza, A; Andrei, V; Anduaga, X S; Anger, P; Angerami, A; Anghinolfi, F; Anisenkov, A; Anjos, N; Annovi, A; Antonaki, A; Antonelli, M; Antonov, A; Antos, J; Anulli, F; Aoki, M; Aoun, S; Aperio Bella, L; Apolle, R; Arabidze, G; Aracena, I; Arai, Y; Arce, A T H; Arfaoui, S; Arguin, J-F; Arik, E; Arik, M; Armbruster, A J; Arnaez, O; Arnal, V; Arnault, C; Artamonov, A; Artoni, G; Arutinov, D; Asai, S; Asfandiyarov, R; Ask, S; Asman, B; Asquith, L; Assamagan, K; Astbury, A; Atkinson, M; Aubert, B; Auge, E; Augsten, K; Aurousseau, M; Avolio, G; Avramidou, R; Axen, D; Azuelos, G; Azuma, Y; Baak, M A; Baccaglioni, G; Bacci, C; Bach, A M; Bachacou, H; Bachas, K; Backes, M; Backhaus, M; Badescu, E; Bagnaia, P; Bahinipati, S; Bai, Y; Bailey, D C; Bain, T; Baines, J T; Baker, O K; Baker, M D; Baker, S; Banas, E; Banerjee, P; Banerjee, Sw; Banfi, D; Bangert, A; Bansal, V; Bansil, H S; Barak, L; Baranov, S P; Barbaro Galtieri, A; Barber, T; Barberio, E L; Barberis, D; Barbero, M; Bardin, D Y; Barillari, T; Barisonzi, M; Barklow, T; Barlow, N; Barnett, B M; Barnett, R M; Baroncelli, A; Barone, G; Barr, A J; Barreiro, F; Barreiro Guimarães da Costa, J; Barrillon, P; Bartoldus, R; Barton, A E; Bartsch, V; Basye, A; Bates, R L; Batkova, L; Batley, J R; Battaglia, A; Battistin, M; Bauer, F; Bawa, H S; Beale, S; Beau, T; Beauchemin, P H; Beccherle, R; Bechtle, P; Beck, H P; Becker, A K; Becker, S; Beckingham, M; Becks, K H; Beddall, A J; Beddall, A; Bedikian, S; Bednyakov, V A; Bee, C P; Beemster, L J; Begel, M; Behar Harpaz, S; Beimforde, M; Belanger-Champagne, C; Bell, P J; Bell, W H; Bella, G; Bellagamba, L; Bellina, F; Bellomo, M; Belloni, A; Beloborodova, O; Belotskiy, K; Beltramello, O; Benary, O; Benchekroun, D; Bendtz, K; Benekos, N; Benhammou, Y; Benhar Noccioli, E; Benitez Garcia, J A; Benjamin, D P; Benoit, M; Bensinger, J R; Benslama, K; Bentvelsen, S; Berge, D; Bergeaas Kuutmann, E; Berger, N; Berghaus, F; Berglund, E; Beringer, J; Bernat, P; Bernhard, R; Bernius, C; Berry, T; Bertella, C; Bertin, A; Bertolucci, F; Besana, M I; Besjes, G J; Besson, N; Bethke, S; Bhimji, W; Bianchi, R M; Bianco, M; Biebel, O; Bieniek, S P; Bierwagen, K; Biesiada, J; Biglietti, M; Bilokon, H; Bindi, M; Binet, S; Bingul, A; Bini, C; Biscarat, C; Bittner, B; Black, K M; Blair, R E; Blanchard, J-B; Blanchot, G; Blazek, T; Bloch, I; Blocker, C; Blocki, J; Blondel, A; Blum, W; Blumenschein, U; Bobbink, G J; Bobrovnikov, V B; Bocchetta, S S; Bocci, A; Boddy, C R; Boehler, M; Boek, J; Boelaert, N; Bogaerts, J A; Bogdanchikov, A; Bogouch, A; Bohm, C; Bohm, J; Boisvert, V; Bold, T; Boldea, V; Bolnet, N M; Bomben, M; Bona, M; Boonekamp, M; Bordoni, S; Borer, C; Borisov, A; Borissov, G; Borjanovic, I; Borri, M; Borroni, S; Bortolotto, V; Bos, K; Boscherini, D; Bosman, M; Boterenbrood, H; Bouchami, J; Boudreau, J; Bouhova-Thacker, E V; Boumediene, D; Bourdarios, C; Bousson, N; Boveia, A; Boyd, J; Boyko, I R; Bozovic-Jelisavcic, I; Bracinik, J; Branchini, P; Brandt, A; Brandt, G; Brandt, O; Bratzler, U; Brau, B; Brau, J E; Braun, H M; Brazzale, S F; Brelier, B; Bremer, J; Brendlinger, K; Brenner, R; Bressler, S; Britton, D; Brochu, F M; Brock, I; Brock, R; Broggi, F; Bromberg, C; Bronner, J; Brooijmans, G; Brooks, T; Brooks, W K; Brown, G; Brown, H; Bruckman de Renstrom, P A; Bruncko, D; Bruneliere, R; Brunet, S; Bruni, A; Bruni, G; Bruschi, M; Buanes, T; Buat, Q; Bucci, F; Buchanan, J; Buchholz, P; Buckingham, R M; Buckley, A G; Buda, S I; Budagov, I A; Budick, B; Büscher, V; Bugge, L; Bulekov, O; Bundock, A C; Bunse, M; Buran, T; Burckhart, H; Burdin, S; Burgess, T; Burke, S; Busato, E; Bussey, P; Buszello, C P; Butler, B; Butler, J M; Buttar, C M; Butterworth, J M; Buttinger, W; Cabrera Urbán, S; Caforio, D; Cakir, O; Calafiura, P; Calderini, G; Calfayan, P; Calkins, R; Caloba, L P; Caloi, R; Calvet, D; Calvet, S; Camacho Toro, R; Camarri, P; Cameron, D; Caminada, L M; Caminal Armadans, R; Campana, S

    2012-11-21

    A search is presented for direct top squark pair production in final states with one isolated electron or muon, jets, and missing transverse momentum in proton-proton collisions at sqrt[s] = 7 TeV. The measurement is based on 4.7 fb(-1) of data collected with the ATLAS detector at the LHC. Each top squark is assumed to decay to a top quark and the lightest supersymmetric particle (LSP). The data are found to be consistent with standard model expectations. Top squark masses between 230 GeV and 440 GeV are excluded with 95% confidence for massless LSPs, and top squark masses around 400 GeV are excluded for LSP masses up to 125 GeV. PMID:23215588

  12. Dual-level parallelism for high-order CFD methods

    E-print Network

    2004-01-02

    able or the complicated operations prohibit such loop-level parallelization directives. For example, in the spectral element implementation in the current work the ..... Periodic conditions are imposed in the homogeneous direction. ..... help on the thread-safety of the Veclib and many useful discussions. ... benchmark suite.

  13. AIAA 2003-4234 A PARALLEL, OBJECT-ORIENTED

    E-print Network

    AIAA 2003-4234 A PARALLEL, OBJECT-ORIENTED DIRECT SIMULATION MONTE CARLO METHOD FOR BLAST, OBJECT-ORIENTED DIRECT SIMULATION MONTE CARLO METHOD FOR BLAST-IMPACT SIMULATIONS Anupam Sharma and Lyle. A different approach to the problem is to use com- puters to simulate the impact of a blast wave generated

  14. Extended Parallelism Models for Optimization on Massively Parallel Computers

    SciTech Connect

    Eldred, M.S.; Schimel, B.D.

    1999-05-24

    Single-level parallel optimization approaches, those in which either the simulation code executes in parallel or the optimiza- tion algorithm invokes multiple simultaneous single-processor analyses, have been investigated previously and been shown to be effective in reducing the time required to compute optimal solutions. However, these approaches have clear performance limita- tions that prevent effective scaling with the thousands of processors available in massively parallel supercomputers. In more recent work, a capability has been developed for multilevel parallelism in which multiple instances of multiprocessor simulations are coordinated simultaneously. This implementation employs a master-slave approach using the Message Passing Interface (MPI) within the DAKOTA software toolkit. Mathematical analysis on achieving peak efficiency in multilevel parallelism has shown that the most effective processor partitioning scheme is the one that limits the size of multiprocessor simulations in favor of concurrent execution of multiple simulations. That is, if both coarse-grained and fine-grained parallelism can be exploited, then preference should be given to the coarse-grained parallelism. This analysis was verified in multilevel paralIel computatiorud experiments on networks of workstations (NOWS) and on the Intel TeraFLOPS massively parallel supercomputer. In current work, methods for exploiting additional coarse-grained parallelism in optimization are being investigated so that fine-grained efficiency losses can be further minimized. These activities are focusing on both algorithmic coarse-grained parallel- ism (multiple independent function evaluations) through the development of speculative gradient methods and concurrent iterator strategies and on function evaluation coarse-grained parallelism (multiple separable simulations within a function evaluation) through the development of general partitioning and nested synchronization facilities. The net result is a total of four separate lev- els of parallelism which can minimize efficiency losses and achieve near linear scaling on massively parallel computers.

  15. Partition search

    SciTech Connect

    Ginsberg, M.L.

    1996-12-31

    We introduce a new form of game search called partition search that incorporates dependency analysis, allowing substantial reductions in the portion of the tree that needs to be expanded. Both theoretical results and experimental data are presented. For the game of bridge, partition search provides approximately as much of an improvement over existing methods as {alpha}-{beta} pruning provides over minimax.

  16. Dewey Searches!

    ERIC Educational Resources Information Center

    School Library Media Activities Monthly, 2000

    2000-01-01

    Describes an activity for young children that helps them conduct subject searches using an automated system that allows customization of access to a library's collection. Explains a timed game that makes use of subject searching and word searching on the topic of dinosaurs. (LRW)

  17. Highly parallel computation

    NASA Technical Reports Server (NTRS)

    Denning, Peter J.; Tichy, Walter F.

    1990-01-01

    Highly parallel computing architectures are the only means to achieve the computation rates demanded by advanced scientific problems. A decade of research has demonstrated the feasibility of such machines and current research focuses on which architectures designated as multiple instruction multiple datastream (MIMD) and single instruction multiple datastream (SIMD) have produced the best results to date; neither shows a decisive advantage for most near-homogeneous scientific problems. For scientific problems with many dissimilar parts, more speculative architectures such as neural networks or data flow may be needed.

  18. The Parallel Principle

    E-print Network

    Richard A Mould

    2001-11-19

    Von Neumann's psycho-physical parallelism requires the existence of an interaction between subjective experiences and material systems. A hypothesis is proposed that amends physics in a way that connects subjective states with physical states, and a general model of the interaction is provided. A specific example shows how the theory applies to pain consciousness. The implications concerning quantum mechanical state creation and reduction are discussed, and some mechanisms are suggested to seed the process. An experiment that tests the hypothesis is described elsewhere. Key Words: von Neumann, psycho-physical, consciousness, state reduction, state collapse, macroscopic superpositions, conscious observer.

  19. Learning in Parallel

    E-print Network

    Vitter, Jeffrey Scott; Lin, Jyh-Han

    1992-01-01

    no restrictionson the representationof the hypothesisreturned by the parallel learning algorithm other than that it isNC-evaluatable: De#0Cnition 2.4. A concept class C n is NC-evaluatable if the problem of determining whether a given hypothesis c2C n is consistent... n is NC-evaluatable, then C n isNC-learnable. Section 3. NC-learnable Concept Classes #2F 5 Proof. The proof is a straightforwardadaptation of the proof for the sequential case given in #5BBlumer, Ehrenfeucht, Haussler, and Warmuth 1989#5D. Suppose...

  20. Parallel sphere rendering

    SciTech Connect

    Krogh, M.; Hansen, C.; Painter, J.; de Verdiere, G.C.

    1995-05-01

    Sphere rendering is an important method for visualizing molecular dynamics data. This paper presents a parallel divide-and-conquer algorithm that is almost 90 times faster than current graphics workstations. To render extremely large data sets and large images, the algorithm uses the MIMD features of the supercomputers to divide up the data, render independent partial images, and then finally composite the multiple partial images using an optimal method. The algorithm and performance results are presented for the CM-5 and the T3D.