Effective Vectorization with OpenMP 4.5
DOE Office of Scientific and Technical Information (OSTI.GOV)
Huber, Joseph N.; Hernandez, Oscar R.; Lopez, Matthew Graham
This paper describes how the Single Instruction Multiple Data (SIMD) model and its extensions in OpenMP work, and how these are implemented in different compilers. Modern processors are highly parallel computational machines which often include multiple processors capable of executing several instructions in parallel. Understanding SIMD and executing instructions in parallel allows the processor to achieve higher performance without increasing the power required to run it. SIMD instructions can significantly reduce the runtime of code by executing a single operation on large groups of data. The SIMD model is so integral to the processor s potential performance that, if SIMDmore » is not utilized, less than half of the processor is ever actually used. Unfortunately, using SIMD instructions is a challenge in higher level languages because most programming languages do not have a way to describe them. Most compilers are capable of vectorizing code by using the SIMD instructions, but there are many code features important for SIMD vectorization that the compiler cannot determine at compile time. OpenMP attempts to solve this by extending the C++/C and Fortran programming languages with compiler directives that express SIMD parallelism. OpenMP is used to pass hints to the compiler about the code to be executed in SIMD. This is a key resource for making optimized code, but it does not change whether or not the code can use SIMD operations. However, in many cases critical functions are limited by a poor understanding of how SIMD instructions are actually implemented, as SIMD can be implemented through vector instructions or simultaneous multi-threading (SMT). We have found that it is often the case that code cannot be vectorized, or is vectorized poorly, because the programmer does not have sufficient knowledge of how SIMD instructions work.« less
Vectorization with SIMD extensions speeds up reconstruction in electron tomography.
Agulleiro, J I; Garzón, E M; García, I; Fernández, J J
2010-06-01
Electron tomography allows structural studies of cellular structures at molecular detail. Large 3D reconstructions are needed to meet the resolution requirements. The processing time to compute these large volumes may be considerable and so, high performance computing techniques have been used traditionally. This work presents a vector approach to tomographic reconstruction that relies on the exploitation of the SIMD extensions available in modern processors in combination to other single processor optimization techniques. This approach succeeds in producing full resolution tomograms with an important reduction in processing time, as evaluated with the most common reconstruction algorithms, namely WBP and SIRT. The main advantage stems from the fact that this approach is to be run on standard computers without the need of specialized hardware, which facilitates the development, use and management of programs. Future trends in processor design open excellent opportunities for vector processing with processor's SIMD extensions in the field of 3D electron microscopy.
On the Impact of Widening Vector Registers on Sequence Alignment
DOE Office of Scientific and Technical Information (OSTI.GOV)
Daily, Jeffrey A.; Kalyanaraman, Anantharaman; Krishnamoorthy, Sriram
2016-09-22
Vector extensions, such as SSE, have been part of the x86 since the 1990s, with applications in graphics, signal processing, and scientific applications. Although many algorithms and applications can naturally benefit from automatic vectorization techniques, there are still many that are difficult to vectorize due to their dependence on irregular data structures, dense branch operations, or data dependencies. Sequence alignment, one of the most widely used operations in bioinformatics workflows, has a computational footprint that features complex data dependencies. In this paper, we demonstrate that the trend of widening vector registers adversely affects the state-of-the-art sequence alignment algorithm based onmore » striped data layouts. We present a practically efficient SIMD implementation of a parallel scan based sequence alignment algorithm that can better exploit wider SIMD units. We conduct comprehensive workload and use case analyses to characterize the relative behavior of the striped and scan approaches and identify the best choice of algorithm based on input length and SIMD width.« less
NASA Astrophysics Data System (ADS)
Tanikawa, Ataru; Yoshikawa, Kohji; Okamoto, Takashi; Nitadori, Keigo
2012-02-01
We present a high-performance N-body code for self-gravitating collisional systems accelerated with the aid of a new SIMD instruction set extension of the x86 architecture: Advanced Vector eXtensions (AVX), an enhanced version of the Streaming SIMD Extensions (SSE). With one processor core of Intel Core i7-2600 processor (8 MB cache and 3.40 GHz) based on Sandy Bridge micro-architecture, we implemented a fourth-order Hermite scheme with individual timestep scheme ( Makino and Aarseth, 1992), and achieved the performance of ˜20 giga floating point number operations per second (GFLOPS) for double-precision accuracy, which is two times and five times higher than that of the previously developed code implemented with the SSE instructions ( Nitadori et al., 2006b), and that of a code implemented without any explicit use of SIMD instructions with the same processor core, respectively. We have parallelized the code by using so-called NINJA scheme ( Nitadori et al., 2006a), and achieved ˜90 GFLOPS for a system containing more than N = 8192 particles with 8 MPI processes on four cores. We expect to achieve about 10 tera FLOPS (TFLOPS) for a self-gravitating collisional system with N ˜ 10 5 on massively parallel systems with at most 800 cores with Sandy Bridge micro-architecture. This performance will be comparable to that of Graphic Processing Unit (GPU) cluster systems, such as the one with about 200 Tesla C1070 GPUs ( Spurzem et al., 2010). This paper offers an alternative to collisional N-body simulations with GRAPEs and GPUs.
Cache-Oblivious parallel SIMD Viterbi decoding for sequence search in HMMER.
Ferreira, Miguel; Roma, Nuno; Russo, Luis M S
2014-05-30
HMMER is a commonly used bioinformatics tool based on Hidden Markov Models (HMMs) to analyze and process biological sequences. One of its main homology engines is based on the Viterbi decoding algorithm, which was already highly parallelized and optimized using Farrar's striped processing pattern with Intel SSE2 instruction set extension. A new SIMD vectorization of the Viterbi decoding algorithm is proposed, based on an SSE2 inter-task parallelization approach similar to the DNA alignment algorithm proposed by Rognes. Besides this alternative vectorization scheme, the proposed implementation also introduces a new partitioning of the Markov model that allows a significantly more efficient exploitation of the cache locality. Such optimization, together with an improved loading of the emission scores, allows the achievement of a constant processing throughput, regardless of the innermost-cache size and of the dimension of the considered model. The proposed optimized vectorization of the Viterbi decoding algorithm was extensively evaluated and compared with the HMMER3 decoder to process DNA and protein datasets, proving to be a rather competitive alternative implementation. Being always faster than the already highly optimized ViterbiFilter implementation of HMMER3, the proposed Cache-Oblivious Parallel SIMD Viterbi (COPS) implementation provides a constant throughput and offers a processing speedup as high as two times faster, depending on the model's size.
Cache-Oblivious parallel SIMD Viterbi decoding for sequence search in HMMER
2014-01-01
Background HMMER is a commonly used bioinformatics tool based on Hidden Markov Models (HMMs) to analyze and process biological sequences. One of its main homology engines is based on the Viterbi decoding algorithm, which was already highly parallelized and optimized using Farrar’s striped processing pattern with Intel SSE2 instruction set extension. Results A new SIMD vectorization of the Viterbi decoding algorithm is proposed, based on an SSE2 inter-task parallelization approach similar to the DNA alignment algorithm proposed by Rognes. Besides this alternative vectorization scheme, the proposed implementation also introduces a new partitioning of the Markov model that allows a significantly more efficient exploitation of the cache locality. Such optimization, together with an improved loading of the emission scores, allows the achievement of a constant processing throughput, regardless of the innermost-cache size and of the dimension of the considered model. Conclusions The proposed optimized vectorization of the Viterbi decoding algorithm was extensively evaluated and compared with the HMMER3 decoder to process DNA and protein datasets, proving to be a rather competitive alternative implementation. Being always faster than the already highly optimized ViterbiFilter implementation of HMMER3, the proposed Cache-Oblivious Parallel SIMD Viterbi (COPS) implementation provides a constant throughput and offers a processing speedup as high as two times faster, depending on the model’s size. PMID:24884826
Optimized scalar promotion with load and splat SIMD instructions
Eichenberger, Alexander E; Gschwind, Michael K; Gunnels, John A
2013-10-29
Mechanisms for optimizing scalar code executed on a single instruction multiple data (SIMD) engine are provided. Placement of vector operation-splat operations may be determined based on an identification of scalar and SIMD operations in an original code representation. The original code representation may be modified to insert the vector operation-splat operations based on the determined placement of vector operation-splat operations to generate a first modified code representation. Placement of separate splat operations may be determined based on identification of scalar and SIMD operations in the first modified code representation. The first modified code representation may be modified to insert or delete separate splat operations based on the determined placement of the separate splat operations to generate a second modified code representation. SIMD code may be output based on the second modified code representation for execution by the SIMD engine.
Optimized scalar promotion with load and splat SIMD instructions
Eichenberger, Alexandre E [Chappaqua, NY; Gschwind, Michael K [Chappaqua, NY; Gunnels, John A [Yorktown Heights, NY
2012-08-28
Mechanisms for optimizing scalar code executed on a single instruction multiple data (SIMD) engine are provided. Placement of vector operation-splat operations may be determined based on an identification of scalar and SIMD operations in an original code representation. The original code representation may be modified to insert the vector operation-splat operations based on the determined placement of vector operation-splat operations to generate a first modified code representation. Placement of separate splat operations may be determined based on identification of scalar and SIMD operations in the first modified code representation. The first modified code representation may be modified to insert or delete separate splat operations based on the determined placement of the separate splat operations to generate a second modified code representation. SIMD code may be output based on the second modified code representation for execution by the SIMD engine.
NASA Astrophysics Data System (ADS)
Barnaś, Dawid; Bieniasz, Lesław K.
2017-07-01
We have recently developed a vectorized Thomas solver for quasi-block tridiagonal linear algebraic equation systems using Streaming SIMD Extensions (SSE) and Advanced Vector Extensions (AVX) in operations on dense blocks [D. Barnaś and L. K. Bieniasz, Int. J. Comput. Meth., accepted]. The acceleration caused by vectorization was observed for large block sizes, but was less satisfactory for small blocks. In this communication we report on another version of the solver, optimized for small blocks of size up to four rows and/or columns.
Pairwise Sequence Alignment Library
DOE Office of Scientific and Technical Information (OSTI.GOV)
Jeff Daily, PNNL
2015-05-20
Vector extensions, such as SSE, have been part of the x86 CPU since the 1990s, with applications in graphics, signal processing, and scientific applications. Although many algorithms and applications can naturally benefit from automatic vectorization techniques, there are still many that are difficult to vectorize due to their dependence on irregular data structures, dense branch operations, or data dependencies. Sequence alignment, one of the most widely used operations in bioinformatics workflows, has a computational footprint that features complex data dependencies. The trend of widening vector registers adversely affects the state-of-the-art sequence alignment algorithm based on striped data layouts. Therefore, amore » novel SIMD implementation of a parallel scan-based sequence alignment algorithm that can better exploit wider SIMD units was implemented as part of the Parallel Sequence Alignment Library (parasail). Parasail features: Reference implementations of all known vectorized sequence alignment approaches. Implementations of Smith Waterman (SW), semi-global (SG), and Needleman Wunsch (NW) sequence alignment algorithms. Implementations across all modern CPU instruction sets including AVX2 and KNC. Language interfaces for C/C++ and Python.« less
NASA Astrophysics Data System (ADS)
Olson, Richard F.
2013-05-01
Rendering of point scatterer based radar scenes for millimeter wave (mmW) seeker tests in real-time hardware-in-the-loop (HWIL) scene generation requires efficient algorithms and vector-friendly computer architectures for complex signal synthesis. New processor technology from Intel implements an extended 256-bit vector SIMD instruction set (AVX, AVX2) in a multi-core CPU design providing peak execution rates of hundreds of GigaFLOPS (GFLOPS) on one chip. Real world mmW scene generation code can approach peak SIMD execution rates only after careful algorithm and source code design. An effective software design will maintain high computing intensity emphasizing register-to-register SIMD arithmetic operations over data movement between CPU caches or off-chip memories. Engineers at the U.S. Army Aviation and Missile Research, Development and Engineering Center (AMRDEC) applied two basic parallel coding methods to assess new 256-bit SIMD multi-core architectures for mmW scene generation in HWIL. These include use of POSIX threads built on vector library functions and more portable, highlevel parallel code based on compiler technology (e.g. OpenMP pragmas and SIMD autovectorization). Since CPU technology is rapidly advancing toward high processor core counts and TeraFLOPS peak SIMD execution rates, it is imperative that coding methods be identified which produce efficient and maintainable parallel code. This paper describes the algorithms used in point scatterer target model rendering, the parallelization of those algorithms, and the execution performance achieved on an AVX multi-core machine using the two basic parallel coding methods. The paper concludes with estimates for scale-up performance on upcoming multi-core technology.
Tomo3D 2.0--exploitation of advanced vector extensions (AVX) for 3D reconstruction.
Agulleiro, Jose-Ignacio; Fernandez, Jose-Jesus
2015-02-01
Tomo3D is a program for fast tomographic reconstruction on multicore computers. Its high speed stems from code optimization, vectorization with Streaming SIMD Extensions (SSE), multithreading and optimization of disk access. Recently, Advanced Vector eXtensions (AVX) have been introduced in the x86 processor architecture. Compared to SSE, AVX double the number of simultaneous operations, thus pointing to a potential twofold gain in speed. However, in practice, achieving this potential is extremely difficult. Here, we provide a technical description and an assessment of the optimizations included in Tomo3D to take advantage of AVX instructions. Tomo3D 2.0 allows huge reconstructions to be calculated in standard computers in a matter of minutes. Thus, it will be a valuable tool for electron tomography studies with increasing resolution needs. Copyright © 2014 Elsevier Inc. All rights reserved.
Gschwind, Michael K [Chappaqua, NY
2011-03-01
Mechanisms for implementing a floating point only single instruction multiple data instruction set architecture are provided. A processor is provided that comprises an issue unit, an execution unit coupled to the issue unit, and a vector register file coupled to the execution unit. The execution unit has logic that implements a floating point (FP) only single instruction multiple data (SIMD) instruction set architecture (ISA). The floating point vector registers of the vector register file store both scalar and floating point values as vectors having a plurality of vector elements. The processor may be part of a data processing system.
Deploy Nalu/Kokkos algorithmic infrastructure with performance benchmarking.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Domino, Stefan P.; Ananthan, Shreyas; Knaus, Robert C.
The former Nalu interior heterogeneous algorithm design, which was originally designed to manage matrix assembly operations over all elemental topology types, has been modified to operate over homogeneous collections of mesh entities. This newly templated kernel design allows for removal of workset variable resize operations that were formerly required at each loop over a Sierra ToolKit (STK) bucket (nominally, 512 entities in size). Extensive usage of the Standard Template Library (STL) std::vector has been removed in favor of intrinsic Kokkos memory views. In this milestone effort, the transition to Kokkos as the underlying infrastructure to support performance and portability onmore » many-core architectures has been deployed for key matrix algorithmic kernels. A unit-test driven design effort has developed a homogeneous entity algorithm that employs a team-based thread parallelism construct. The STK Single Instruction Multiple Data (SIMD) infrastructure is used to interleave data for improved vectorization. The collective algorithm design, which allows for concurrent threading and SIMD management, has been deployed for the core low-Mach element- based algorithm. Several tests to ascertain SIMD performance on Intel KNL and Haswell architectures have been carried out. The performance test matrix includes evaluation of both low- and higher-order methods. The higher-order low-Mach methodology builds on polynomial promotion of the core low-order control volume nite element method (CVFEM). Performance testing of the Kokkos-view/SIMD design indicates low-order matrix assembly kernel speed-up ranging between two and four times depending on mesh loading and node count. Better speedups are observed for higher-order meshes (currently only P=2 has been tested) especially on KNL. The increased workload per element on higher-order meshes bene ts from the wide SIMD width on KNL machines. Combining multiple threads with SIMD on KNL achieves a 4.6x speedup over the baseline, with assembly timings faster than that observed on Haswell architecture. The computational workload of higher-order meshes, therefore, seems ideally suited for the many-core architecture and justi es further exploration of higher-order on NGP platforms. A Trilinos/Tpetra-based multi-threaded GMRES preconditioned by symmetric Gauss Seidel (SGS) represents the core solver infrastructure for the low-Mach advection/diffusion implicit solves. The threaded solver stack has been tested on small problems on NREL's Peregrine system using the newly developed and deployed Kokkos-view/SIMD kernels. fforts are underway to deploy the Tpetra-based solver stack on NERSC Cori system to benchmark its performance at scale on KNL machines.« less
NASA Technical Reports Server (NTRS)
Fijany, Amir (Inventor); Bejczy, Antal K. (Inventor)
1993-01-01
This is a real-time robotic controller and simulator which is a MIMD-SIMD parallel architecture for interfacing with an external host computer and providing a high degree of parallelism in computations for robotic control and simulation. It includes a host processor for receiving instructions from the external host computer and for transmitting answers to the external host computer. There are a plurality of SIMD microprocessors, each SIMD processor being a SIMD parallel processor capable of exploiting fine grain parallelism and further being able to operate asynchronously to form a MIMD architecture. Each SIMD processor comprises a SIMD architecture capable of performing two matrix-vector operations in parallel while fully exploiting parallelism in each operation. There is a system bus connecting the host processor to the plurality of SIMD microprocessors and a common clock providing a continuous sequence of clock pulses. There is also a ring structure interconnecting the plurality of SIMD microprocessors and connected to the clock for providing the clock pulses to the SIMD microprocessors and for providing a path for the flow of data and instructions between the SIMD microprocessors. The host processor includes logic for controlling the RRCS by interpreting instructions sent by the external host computer, decomposing the instructions into a series of computations to be performed by the SIMD microprocessors, using the system bus to distribute associated data among the SIMD microprocessors, and initiating activity of the SIMD microprocessors to perform the computations on the data by procedure call.
NASA Technical Reports Server (NTRS)
Manohar, Mareboyana; Tilton, James C.
1994-01-01
A progressive vector quantization (VQ) compression approach is discussed which decomposes image data into a number of levels using full search VQ. The final level is losslessly compressed, enabling lossless reconstruction. The computational difficulties are addressed by implementation on a massively parallel SIMD machine. We demonstrate progressive VQ on multispectral imagery obtained from the Advanced Very High Resolution Radiometer instrument and other Earth observation image data, and investigate the trade-offs in selecting the number of decomposition levels and codebook training method.
Vectorization for Molecular Dynamics on Intel Xeon Phi Corpocessors
NASA Astrophysics Data System (ADS)
Yi, Hongsuk
2014-03-01
Many modern processors are capable of exploiting data-level parallelism through the use of single instruction multiple data (SIMD) execution. The new Intel Xeon Phi coprocessor supports 512 bit vector registers for the high performance computing. In this paper, we have developed a hierarchical parallelization scheme for accelerated molecular dynamics simulations with the Terfoff potentials for covalent bond solid crystals on Intel Xeon Phi coprocessor systems. The scheme exploits multi-level parallelism computing. We combine thread-level parallelism using a tightly coupled thread-level and task-level parallelism with 512-bit vector register. The simulation results show that the parallel performance of SIMD implementations on Xeon Phi is apparently superior to their x86 CPU architecture.
NASA Astrophysics Data System (ADS)
Tanikawa, Ataru; Yoshikawa, Kohji; Nitadori, Keigo; Okamoto, Takashi
2013-02-01
We have developed a numerical software library for collisionless N-body simulations named "Phantom-GRAPE" which highly accelerates force calculations among particles by use of a new SIMD instruction set extension to the x86 architecture, Advanced Vector eXtensions (AVX), an enhanced version of the Streaming SIMD Extensions (SSE). In our library, not only the Newton's forces, but also central forces with an arbitrary shape f(r), which has a finite cutoff radius rcut (i.e. f(r)=0 at r>rcut), can be quickly computed. In computing such central forces with an arbitrary force shape f(r), we refer to a pre-calculated look-up table. We also present a new scheme to create the look-up table whose binning is optimal to keep good accuracy in computing forces and whose size is small enough to avoid cache misses. Using an Intel Core i7-2600 processor, we measure the performance of our library for both of the Newton's forces and the arbitrarily shaped central forces. In the case of Newton's forces, we achieve 2×109 interactions per second with one processor core (or 75 GFLOPS if we count 38 operations per interaction), which is 20 times higher than the performance of an implementation without any explicit use of SIMD instructions, and 2 times than that with the SSE instructions. With four processor cores, we obtain the performance of 8×109 interactions per second (or 300 GFLOPS). In the case of the arbitrarily shaped central forces, we can calculate 1×109 and 4×109 interactions per second with one and four processor cores, respectively. The performance with one processor core is 6 times and 2 times higher than those of the implementations without any use of SIMD instructions and with the SSE instructions. These performances depend only weakly on the number of particles, irrespective of the force shape. It is good contrast with the fact that the performance of force calculations accelerated by graphics processing units (GPUs) depends strongly on the number of particles. Substantially weak dependence of the performance on the number of particles is suitable to collisionless N-body simulations, since these simulations are usually performed with sophisticated N-body solvers such as Tree- and TreePM-methods combined with an individual timestep scheme. We conclude that collisionless N-body simulations accelerated with our library have significant advantage over those accelerated by GPUs, especially on massively parallel environments.
Gschwind, Michael K
2013-04-16
Mechanisms for generating and executing programs for a floating point (FP) only single instruction multiple data (SIMD) instruction set architecture (ISA) are provided. A computer program product comprising a computer recordable medium having a computer readable program recorded thereon is provided. The computer readable program, when executed on a computing device, causes the computing device to receive one or more instructions and execute the one or more instructions using logic in an execution unit of the computing device. The logic implements a floating point (FP) only single instruction multiple data (SIMD) instruction set architecture (ISA), based on data stored in a vector register file of the computing device. The vector register file is configured to store both scalar and floating point values as vectors having a plurality of vector elements.
A hybrid algorithm for parallel molecular dynamics simulations
NASA Astrophysics Data System (ADS)
Mangiardi, Chris M.; Meyer, R.
2017-10-01
This article describes algorithms for the hybrid parallelization and SIMD vectorization of molecular dynamics simulations with short-range forces. The parallelization method combines domain decomposition with a thread-based parallelization approach. The goal of the work is to enable efficient simulations of very large (tens of millions of atoms) and inhomogeneous systems on many-core processors with hundreds or thousands of cores and SIMD units with large vector sizes. In order to test the efficiency of the method, simulations of a variety of configurations with up to 74 million atoms have been performed. Results are shown that were obtained on multi-core systems with Sandy Bridge and Haswell processors as well as systems with Xeon Phi many-core processors.
An efficient and portable SIMD algorithm for charge/current deposition in Particle-In-Cell codes
NASA Astrophysics Data System (ADS)
Vincenti, H.; Lobet, M.; Lehe, R.; Sasanka, R.; Vay, J.-L.
2017-01-01
In current computer architectures, data movement (from die to network) is by far the most energy consuming part of an algorithm (≈ 20 pJ/word on-die to ≈10,000 pJ/word on the network). To increase memory locality at the hardware level and reduce energy consumption related to data movement, future exascale computers tend to use many-core processors on each compute nodes that will have a reduced clock speed to allow for efficient cooling. To compensate for frequency decrease, machine vendors are making use of long SIMD instruction registers that are able to process multiple data with one arithmetic operator in one clock cycle. SIMD register length is expected to double every four years. As a consequence, Particle-In-Cell (PIC) codes will have to achieve good vectorization to fully take advantage of these upcoming architectures. In this paper, we present a new algorithm that allows for efficient and portable SIMD vectorization of current/charge deposition routines that are, along with the field gathering routines, among the most time consuming parts of the PIC algorithm. Our new algorithm uses a particular data structure that takes into account memory alignment constraints and avoids gather/scatter instructions that can significantly affect vectorization performances on current CPUs. The new algorithm was successfully implemented in the 3D skeleton PIC code PICSAR and tested on Haswell Xeon processors (AVX2-256 bits wide data registers). Results show a factor of × 2 to × 2.5 speed-up in double precision for particle shape factor of orders 1- 3. The new algorithm can be applied as is on future KNL (Knights Landing) architectures that will include AVX-512 instruction sets with 512 bits register lengths (8 doubles/16 singles).
Efficient irregular wavefront propagation algorithms on Intel® Xeon Phi™
Gomes, Jeremias M.; Teodoro, George; de Melo, Alba; Kong, Jun; Kurc, Tahsin; Saltz, Joel H.
2016-01-01
We investigate the execution of the Irregular Wavefront Propagation Pattern (IWPP), a fundamental computing structure used in several image analysis operations, on the Intel® Xeon Phi™ co-processor. An efficient implementation of IWPP on the Xeon Phi is a challenging problem because of IWPP’s irregularity and the use of atomic instructions in the original IWPP algorithm to resolve race conditions. On the Xeon Phi, the use of SIMD and vectorization instructions is critical to attain high performance. However, SIMD atomic instructions are not supported. Therefore, we propose a new IWPP algorithm that can take advantage of the supported SIMD instruction set. We also evaluate an alternate storage container (priority queue) to track active elements in the wavefront in an effort to improve the parallel algorithm efficiency. The new IWPP algorithm is evaluated with Morphological Reconstruction and Imfill operations as use cases. Our results show performance improvements of up to 5.63× on top of the original IWPP due to vectorization. Moreover, the new IWPP achieves speedups of 45.7× and 1.62×, respectively, as compared to efficient CPU and GPU implementations. PMID:27298591
Efficient irregular wavefront propagation algorithms on Intel® Xeon Phi™.
Gomes, Jeremias M; Teodoro, George; de Melo, Alba; Kong, Jun; Kurc, Tahsin; Saltz, Joel H
2015-10-01
We investigate the execution of the Irregular Wavefront Propagation Pattern (IWPP), a fundamental computing structure used in several image analysis operations, on the Intel ® Xeon Phi ™ co-processor. An efficient implementation of IWPP on the Xeon Phi is a challenging problem because of IWPP's irregularity and the use of atomic instructions in the original IWPP algorithm to resolve race conditions. On the Xeon Phi, the use of SIMD and vectorization instructions is critical to attain high performance. However, SIMD atomic instructions are not supported. Therefore, we propose a new IWPP algorithm that can take advantage of the supported SIMD instruction set. We also evaluate an alternate storage container (priority queue) to track active elements in the wavefront in an effort to improve the parallel algorithm efficiency. The new IWPP algorithm is evaluated with Morphological Reconstruction and Imfill operations as use cases. Our results show performance improvements of up to 5.63 × on top of the original IWPP due to vectorization. Moreover, the new IWPP achieves speedups of 45.7 × and 1.62 × , respectively, as compared to efficient CPU and GPU implementations.
SIMD Optimization of Linear Expressions for Programmable Graphics Hardware
Bajaj, Chandrajit; Ihm, Insung; Min, Jungki; Oh, Jinsang
2009-01-01
The increased programmability of graphics hardware allows efficient graphical processing unit (GPU) implementations of a wide range of general computations on commodity PCs. An important factor in such implementations is how to fully exploit the SIMD computing capacities offered by modern graphics processors. Linear expressions in the form of ȳ = Ax̄ + b̄, where A is a matrix, and x̄, ȳ and b̄ are vectors, constitute one of the most basic operations in many scientific computations. In this paper, we propose a SIMD code optimization technique that enables efficient shader codes to be generated for evaluating linear expressions. It is shown that performance can be improved considerably by efficiently packing arithmetic operations into four-wide SIMD instructions through reordering of the operations in linear expressions. We demonstrate that the presented technique can be used effectively for programming both vertex and pixel shaders for a variety of mathematical applications, including integrating differential equations and solving a sparse linear system of equations using iterative methods. PMID:19946569
An implementation of a tree code on a SIMD, parallel computer
NASA Technical Reports Server (NTRS)
Olson, Kevin M.; Dorband, John E.
1994-01-01
We describe a fast tree algorithm for gravitational N-body simulation on SIMD parallel computers. The tree construction uses fast, parallel sorts. The sorted lists are recursively divided along their x, y and z coordinates. This data structure is a completely balanced tree (i.e., each particle is paired with exactly one other particle) and maintains good spatial locality. An implementation of this tree-building algorithm on a 16k processor Maspar MP-1 performs well and constitutes only a small fraction (approximately 15%) of the entire cycle of finding the accelerations. Each node in the tree is treated as a monopole. The tree search and the summation of accelerations also perform well. During the tree search, node data that is needed from another processor is simply fetched. Roughly 55% of the tree search time is spent in communications between processors. We apply the code to two problems of astrophysical interest. The first is a simulation of the close passage of two gravitationally, interacting, disk galaxies using 65,636 particles. We also simulate the formation of structure in an expanding, model universe using 1,048,576 particles. Our code attains speeds comparable to one head of a Cray Y-MP, so single instruction, multiple data (SIMD) type computers can be used for these simulations. The cost/performance ratio for SIMD machines like the Maspar MP-1 make them an extremely attractive alternative to either vector processors or large multiple instruction, multiple data (MIMD) type parallel computers. With further optimizations (e.g., more careful load balancing), speeds in excess of today's vector processing computers should be possible.
Generic accelerated sequence alignment in SeqAn using vectorization and multi-threading.
Rahn, René; Budach, Stefan; Costanza, Pascal; Ehrhardt, Marcel; Hancox, Jonny; Reinert, Knut
2018-05-03
Pairwise sequence alignment is undoubtedly a central tool in many bioinformatics analyses. In this paper, we present a generically accelerated module for pairwise sequence alignments applicable for a broad range of applications. In our module, we unified the standard dynamic programming kernel used for pairwise sequence alignments and extended it with a generalized inter-sequence vectorization layout, such that many alignments can be computed simultaneously by exploiting SIMD (Single Instruction Multiple Data) instructions of modern processors. We then extended the module by adding two layers of thread-level parallelization, where we a) distribute many independent alignments on multiple threads and b) inherently parallelize a single alignment computation using a work stealing approach producing a dynamic wavefront progressing along the minor diagonal. We evaluated our alignment vectorization and parallelization on different processors, including the newest Intel® Xeon® (Skylake) and Intel® Xeon Phi™ (KNL) processors, and use cases. The instruction set AVX512-BW (Byte and Word), available on Skylake processors, can genuinely improve the performance of vectorized alignments. We could run single alignments 1600 times faster on the Xeon Phi™ and 1400 times faster on the Xeon® than executing them with our previous sequential alignment module. The module is programmed in C++ using the SeqAn (Reinert et al., 2017) library and distributed with version 2.4. under the BSD license. We support SSE4, AVX2, AVX512 instructions and included UME::SIMD, a SIMD-instruction wrapper library, to extend our module for further instruction sets. We thoroughly test all alignment components with all major C++ compilers on various platforms. rene.rahn@fu-berlin.de.
NASA Astrophysics Data System (ADS)
Stone, Christopher P.; Alferman, Andrew T.; Niemeyer, Kyle E.
2018-05-01
Accurate and efficient methods for solving stiff ordinary differential equations (ODEs) are a critical component of turbulent combustion simulations with finite-rate chemistry. The ODEs governing the chemical kinetics at each mesh point are decoupled by operator-splitting allowing each to be solved concurrently. An efficient ODE solver must then take into account the available thread and instruction-level parallelism of the underlying hardware, especially on many-core coprocessors, as well as the numerical efficiency. A stiff Rosenbrock and a nonstiff Runge-Kutta ODE solver are both implemented using the single instruction, multiple thread (SIMT) and single instruction, multiple data (SIMD) paradigms within OpenCL. Both methods solve multiple ODEs concurrently within the same instruction stream. The performance of these parallel implementations was measured on three chemical kinetic models of increasing size across several multicore and many-core platforms. Two separate benchmarks were conducted to clearly determine any performance advantage offered by either method. The first benchmark measured the run-time of evaluating the right-hand-side source terms in parallel and the second benchmark integrated a series of constant-pressure, homogeneous reactors using the Rosenbrock and Runge-Kutta solvers. The right-hand-side evaluations with SIMD parallelism on the host multicore Xeon CPU and many-core Xeon Phi co-processor performed approximately three times faster than the baseline multithreaded C++ code. The SIMT parallel model on the host and Phi was 13%-35% slower than the baseline while the SIMT model on the NVIDIA Kepler GPU provided approximately the same performance as the SIMD model on the Phi. The runtimes for both ODE solvers decreased significantly with the SIMD implementations on the host CPU (2.5-2.7 ×) and Xeon Phi coprocessor (4.7-4.9 ×) compared to the baseline parallel code. The SIMT implementations on the GPU ran 1.5-1.6 times faster than the baseline multithreaded CPU code; however, this was significantly slower than the SIMD versions on the host CPU or the Xeon Phi. The performance difference between the three platforms was attributed to thread divergence caused by the adaptive step-sizes within the ODE integrators. Analysis showed that the wider vector width of the GPU incurs a higher level of divergence than the narrower Sandy Bridge or Xeon Phi. The significant performance improvement provided by the SIMD parallel strategy motivates further research into more ODE solver methods that are both SIMD-friendly and computationally efficient.
Efficiently modeling neural networks on massively parallel computers
NASA Technical Reports Server (NTRS)
Farber, Robert M.
1993-01-01
Neural networks are a very useful tool for analyzing and modeling complex real world systems. Applying neural network simulations to real world problems generally involves large amounts of data and massive amounts of computation. To efficiently handle the computational requirements of large problems, we have implemented at Los Alamos a highly efficient neural network compiler for serial computers, vector computers, vector parallel computers, and fine grain SIMD computers such as the CM-2 connection machine. This paper describes the mapping used by the compiler to implement feed-forward backpropagation neural networks for a SIMD (Single Instruction Multiple Data) architecture parallel computer. Thinking Machines Corporation has benchmarked our code at 1.3 billion interconnects per second (approximately 3 gigaflops) on a 64,000 processor CM-2 connection machine (Singer 1990). This mapping is applicable to other SIMD computers and can be implemented on MIMD computers such as the CM-5 connection machine. Our mapping has virtually no communications overhead with the exception of the communications required for a global summation across the processors (which has a sub-linear runtime growth on the order of O(log(number of processors)). We can efficiently model very large neural networks which have many neurons and interconnects and our mapping can extend to arbitrarily large networks (within memory limitations) by merging the memory space of separate processors with fast adjacent processor interprocessor communications. This paper will consider the simulation of only feed forward neural network although this method is extendable to recurrent networks.
An efficient and portable SIMD algorithm for charge/current deposition in Particle-In-Cell codes
Vincenti, H.; Lobet, M.; Lehe, R.; ...
2016-09-19
In current computer architectures, data movement (from die to network) is by far the most energy consuming part of an algorithm (≈20pJ/word on-die to ≈10,000 pJ/word on the network). To increase memory locality at the hardware level and reduce energy consumption related to data movement, future exascale computers tend to use many-core processors on each compute nodes that will have a reduced clock speed to allow for efficient cooling. To compensate for frequency decrease, machine vendors are making use of long SIMD instruction registers that are able to process multiple data with one arithmetic operator in one clock cycle. SIMD registermore » length is expected to double every four years. As a consequence, Particle-In-Cell (PIC) codes will have to achieve good vectorization to fully take advantage of these upcoming architectures. In this paper, we present a new algorithm that allows for efficient and portable SIMD vectorization of current/charge deposition routines that are, along with the field gathering routines, among the most time consuming parts of the PIC algorithm. Our new algorithm uses a particular data structure that takes into account memory alignment constraints and avoids gather/scat;ter instructions that can significantly affect vectorization performances on current CPUs. The new algorithm was successfully implemented in the 3D skeleton PIC code PICSAR and tested on Haswell Xeon processors (AVX2-256 bits wide data registers). Results show a factor of ×2 to ×2.5 speed-up in double precision for particle shape factor of orders 1–3. The new algorithm can be applied as is on future KNL (Knights Landing) architectures that will include AVX-512 instruction sets with 512 bits register lengths (8 doubles/16 singles). Program summary Program Title: vec_deposition Program Files doi:http://dx.doi.org/10.17632/nh77fv9k8c.1 Licensing provisions: BSD 3-Clause Programming language: Fortran 90 External routines/libraries: OpenMP > 4.0 Nature of problem: Exascale architectures will have many-core processors per node with long vector data registers capable of performing one single instruction on multiple data during one clock cycle. Data register lengths are expected to double every four years and this pushes for new portable solutions for efficiently vectorizing Particle-In-Cell codes on these future many-core architectures. One of the main hotspot routines of the PIC algorithm is the current/charge deposition for which there is no efficient and portable vector algorithm. Solution method: Here we provide an efficient and portable vector algorithm of current/charge deposition routines that uses a new data structure, which significantly reduces gather/scatter operations. Vectorization is controlled using OpenMP 4.0 compiler directives for vectorization which ensures portability across different architectures. Restrictions: Here we do not provide the full PIC algorithm with an executable but only vector routines for current/charge deposition. These scalar/vector routines can be used as library routines in your 3D Particle-In-Cell code. However, to get the best performances out of vector routines you have to satisfy the two following requirements: (1) Your code should implement particle tiling (as explained in the manuscript) to allow for maximized cache reuse and reduce memory accesses that can hinder vector performances. The routines can be used directly on each particle tile. (2) You should compile your code with a Fortran 90 compiler (e.g Intel, gnu or cray) and provide proper alignment flags and compiler alignment directives (more details in README file).« less
An efficient and portable SIMD algorithm for charge/current deposition in Particle-In-Cell codes
DOE Office of Scientific and Technical Information (OSTI.GOV)
Vincenti, H.; Lobet, M.; Lehe, R.
In current computer architectures, data movement (from die to network) is by far the most energy consuming part of an algorithm (≈20pJ/word on-die to ≈10,000 pJ/word on the network). To increase memory locality at the hardware level and reduce energy consumption related to data movement, future exascale computers tend to use many-core processors on each compute nodes that will have a reduced clock speed to allow for efficient cooling. To compensate for frequency decrease, machine vendors are making use of long SIMD instruction registers that are able to process multiple data with one arithmetic operator in one clock cycle. SIMD registermore » length is expected to double every four years. As a consequence, Particle-In-Cell (PIC) codes will have to achieve good vectorization to fully take advantage of these upcoming architectures. In this paper, we present a new algorithm that allows for efficient and portable SIMD vectorization of current/charge deposition routines that are, along with the field gathering routines, among the most time consuming parts of the PIC algorithm. Our new algorithm uses a particular data structure that takes into account memory alignment constraints and avoids gather/scat;ter instructions that can significantly affect vectorization performances on current CPUs. The new algorithm was successfully implemented in the 3D skeleton PIC code PICSAR and tested on Haswell Xeon processors (AVX2-256 bits wide data registers). Results show a factor of ×2 to ×2.5 speed-up in double precision for particle shape factor of orders 1–3. The new algorithm can be applied as is on future KNL (Knights Landing) architectures that will include AVX-512 instruction sets with 512 bits register lengths (8 doubles/16 singles). Program summary Program Title: vec_deposition Program Files doi:http://dx.doi.org/10.17632/nh77fv9k8c.1 Licensing provisions: BSD 3-Clause Programming language: Fortran 90 External routines/libraries: OpenMP > 4.0 Nature of problem: Exascale architectures will have many-core processors per node with long vector data registers capable of performing one single instruction on multiple data during one clock cycle. Data register lengths are expected to double every four years and this pushes for new portable solutions for efficiently vectorizing Particle-In-Cell codes on these future many-core architectures. One of the main hotspot routines of the PIC algorithm is the current/charge deposition for which there is no efficient and portable vector algorithm. Solution method: Here we provide an efficient and portable vector algorithm of current/charge deposition routines that uses a new data structure, which significantly reduces gather/scatter operations. Vectorization is controlled using OpenMP 4.0 compiler directives for vectorization which ensures portability across different architectures. Restrictions: Here we do not provide the full PIC algorithm with an executable but only vector routines for current/charge deposition. These scalar/vector routines can be used as library routines in your 3D Particle-In-Cell code. However, to get the best performances out of vector routines you have to satisfy the two following requirements: (1) Your code should implement particle tiling (as explained in the manuscript) to allow for maximized cache reuse and reduce memory accesses that can hinder vector performances. The routines can be used directly on each particle tile. (2) You should compile your code with a Fortran 90 compiler (e.g Intel, gnu or cray) and provide proper alignment flags and compiler alignment directives (more details in README file).« less
Liu, Yongchao; Wirawan, Adrianto; Schmidt, Bertil
2013-04-04
The maximal sensitivity for local alignments makes the Smith-Waterman algorithm a popular choice for protein sequence database search based on pairwise alignment. However, the algorithm is compute-intensive due to a quadratic time complexity. Corresponding runtimes are further compounded by the rapid growth of sequence databases. We present CUDASW++ 3.0, a fast Smith-Waterman protein database search algorithm, which couples CPU and GPU SIMD instructions and carries out concurrent CPU and GPU computations. For the CPU computation, this algorithm employs SSE-based vector execution units as accelerators. For the GPU computation, we have investigated for the first time a GPU SIMD parallelization, which employs CUDA PTX SIMD video instructions to gain more data parallelism beyond the SIMT execution model. Moreover, sequence alignment workloads are automatically distributed over CPUs and GPUs based on their respective compute capabilities. Evaluation on the Swiss-Prot database shows that CUDASW++ 3.0 gains a performance improvement over CUDASW++ 2.0 up to 2.9 and 3.2, with a maximum performance of 119.0 and 185.6 GCUPS, on a single-GPU GeForce GTX 680 and a dual-GPU GeForce GTX 690 graphics card, respectively. In addition, our algorithm has demonstrated significant speedups over other top-performing tools: SWIPE and BLAST+. CUDASW++ 3.0 is written in CUDA C++ and PTX assembly languages, targeting GPUs based on the Kepler architecture. This algorithm obtains significant speedups over its predecessor: CUDASW++ 2.0, by benefiting from the use of CPU and GPU SIMD instructions as well as the concurrent execution on CPUs and GPUs. The source code and the simulated data are available at http://cudasw.sourceforge.net.
Implementation and analysis of a Navier-Stokes algorithm on parallel computers
NASA Technical Reports Server (NTRS)
Fatoohi, Raad A.; Grosch, Chester E.
1988-01-01
The results of the implementation of a Navier-Stokes algorithm on three parallel/vector computers are presented. The object of this research is to determine how well, or poorly, a single numerical algorithm would map onto three different architectures. The algorithm is a compact difference scheme for the solution of the incompressible, two-dimensional, time-dependent Navier-Stokes equations. The computers were chosen so as to encompass a variety of architectures. They are the following: the MPP, an SIMD machine with 16K bit serial processors; Flex/32, an MIMD machine with 20 processors; and Cray/2. The implementation of the algorithm is discussed in relation to these architectures and measures of the performance on each machine are given. The basic comparison is among SIMD instruction parallelism on the MPP, MIMD process parallelism on the Flex/32, and vectorization of a serial code on the Cray/2. Simple performance models are used to describe the performance. These models highlight the bottlenecks and limiting factors for this algorithm on these architectures. Finally, conclusions are presented.
Accelerating navigation in the VecGeom geometry modeller
NASA Astrophysics Data System (ADS)
Wenzel, Sandro; Zhang, Yang; pre="for the"> VecGeom Developers, 2017-10-01 The VecGeom geometry library is a relatively recent effort aiming to provide a modern and high performance geometry service for particle detector simulation in hierarchical detector geometries common to HEP experiments. One of its principal targets is the efficient use of vector SIMD hardware instructions to accelerate geometry calculations for single track as well as multi-track queries. Previously, excellent performance improvements compared to Geant4/ROOT could be reported for elementary geometry algorithms at the level of single shape queries. In this contribution, we will focus on the higher level navigation algorithms in VecGeom, which are the most important components as seen from the simulation engines. We will first report on our R&D effort and developments to implement SIMD enhanced data structures to speed up the well-known “voxelised” navigation algorithms, ubiquitously used for particle tracing in complex detector modules consisting of many daughter parts. Second, we will discuss complementary new approaches to improve navigation algorithms in HEP. These ideas are based on a systematic exploitation of static properties of the detector layout as well as automatic code generation and specialisation of the C++ navigator classes. Such specialisations reduce the overhead of generic- or virtual function based algorithms and enhance the effectiveness of the SIMD vector units. These novel approaches go well beyond the existing solutions available in Geant4 or TGeo/ROOT, achieve a significantly superior performance, and might be of interest for a wide range of simulation backends (GeantV, Geant4). We exemplify this with concrete benchmarks for the CMS and ALICE detectors.
First experience of vectorizing electromagnetic physics models for detector simulation
NASA Astrophysics Data System (ADS)
Amadio, G.; Apostolakis, J.; Bandieramonte, M.; Bianchini, C.; Bitzes, G.; Brun, R.; Canal, P.; Carminati, F.; de Fine Licht, J.; Duhem, L.; Elvira, D.; Gheata, A.; Jun, S. Y.; Lima, G.; Novak, M.; Presbyterian, M.; Shadura, O.; Seghal, R.; Wenzel, S.
2015-12-01
The recent emergence of hardware architectures characterized by many-core or accelerated processors has opened new opportunities for concurrent programming models taking advantage of both SIMD and SIMT architectures. The GeantV vector prototype for detector simulations has been designed to exploit both the vector capability of mainstream CPUs and multi-threading capabilities of coprocessors including NVidia GPUs and Intel Xeon Phi. The characteristics of these architectures are very different in terms of the vectorization depth, parallelization needed to achieve optimal performance or memory access latency and speed. An additional challenge is to avoid the code duplication often inherent to supporting heterogeneous platforms. In this paper we present the first experience of vectorizing electromagnetic physics models developed for the GeantV project.
fast_protein_cluster: parallel and optimized clustering of large-scale protein modeling data.
Hung, Ling-Hong; Samudrala, Ram
2014-06-15
fast_protein_cluster is a fast, parallel and memory efficient package used to cluster 60 000 sets of protein models (with up to 550 000 models per set) generated by the Nutritious Rice for the World project. fast_protein_cluster is an optimized and extensible toolkit that supports Root Mean Square Deviation after optimal superposition (RMSD) and Template Modeling score (TM-score) as metrics. RMSD calculations using a laptop CPU are 60× faster than qcprot and 3× faster than current graphics processing unit (GPU) implementations. New GPU code further increases the speed of RMSD and TM-score calculations. fast_protein_cluster provides novel k-means and hierarchical clustering methods that are up to 250× and 2000× faster, respectively, than Clusco, and identify significantly more accurate models than Spicker and Clusco. fast_protein_cluster is written in C++ using OpenMP for multi-threading support. Custom streaming Single Instruction Multiple Data (SIMD) extensions and advanced vector extension intrinsics code accelerate CPU calculations, and OpenCL kernels support AMD and Nvidia GPUs. fast_protein_cluster is available under the M.I.T. license. (http://software.compbio.washington.edu/fast_protein_cluster) © The Author 2014. Published by Oxford University Press.
2014-09-30
portability is difficult to achieve on future supercomputers that use various type of accelerators (GPUs, Xeon - Phi , and SIMD etc). All of these...bottlenecks of NUMA. For example, in the CG code the state vector was originally stored as q(1 : Nvar ,1 : Npoin) where Nvar are the number of...a Global Grid Point (GGP) storage. On the other hand, in the DG code the state vector is typically stored as q(1 : Nvar ,1 : Npts,1 : Nelem) where
PIC codes for plasma accelerators on emerging computer architectures (GPUS, Multicore/Manycore CPUS)
NASA Astrophysics Data System (ADS)
Vincenti, Henri
2016-03-01
The advent of exascale computers will enable 3D simulations of a new laser-plasma interaction regimes that were previously out of reach of current Petasale computers. However, the paradigm used to write current PIC codes will have to change in order to fully exploit the potentialities of these new computing architectures. Indeed, achieving Exascale computing facilities in the next decade will be a great challenge in terms of energy consumption and will imply hardware developments directly impacting our way of implementing PIC codes. As data movement (from die to network) is by far the most energy consuming part of an algorithm future computers will tend to increase memory locality at the hardware level and reduce energy consumption related to data movement by using more and more cores on each compute nodes (''fat nodes'') that will have a reduced clock speed to allow for efficient cooling. To compensate for frequency decrease, CPU machine vendors are making use of long SIMD instruction registers that are able to process multiple data with one arithmetic operator in one clock cycle. SIMD register length is expected to double every four years. GPU's also have a reduced clock speed per core and can process Multiple Instructions on Multiple Datas (MIMD). At the software level Particle-In-Cell (PIC) codes will thus have to achieve both good memory locality and vectorization (for Multicore/Manycore CPU) to fully take advantage of these upcoming architectures. In this talk, we present the portable solutions we implemented in our high performance skeleton PIC code PICSAR to both achieve good memory locality and cache reuse as well as good vectorization on SIMD architectures. We also present the portable solutions used to parallelize the Pseudo-sepctral quasi-cylindrical code FBPIC on GPUs using the Numba python compiler.
Horizontal vectorization of electron repulsion integrals.
Pritchard, Benjamin P; Chow, Edmond
2016-10-30
We present an efficient implementation of the Obara-Saika algorithm for the computation of electron repulsion integrals that utilizes vector intrinsics to calculate several primitive integrals concurrently in a SIMD vector. Initial benchmarks display a 2-4 times speedup with AVX instructions over comparable scalar code, depending on the basis set. Speedup over scalar code is found to be sensitive to the level of contraction of the basis set, and is best for (lAlB|lClD) quartets when lD = 0 or lB=lD=0, which makes such a vectorization scheme particularly suitable for density fitting. The basic Obara-Saika algorithm, how it is vectorized, and the performance bottlenecks are analyzed and discussed. © 2016 Wiley Periodicals, Inc. © 2016 Wiley Periodicals, Inc.
A sparse matrix algorithm on the Boolean vector machine
NASA Technical Reports Server (NTRS)
Wagner, Robert A.; Patrick, Merrell L.
1988-01-01
VLSI technology is being used to implement a prototype Boolean Vector Machine (BVM), which is a large network of very small processors with equally small memories that operate in SIMD mode; these use bit-serial arithmetic, and communicate via cube-connected cycles network. The BVM's bit-serial arithmetic and the small memories of individual processors are noted to compromise the system's effectiveness in large numerical problem applications. Attention is presently given to the implementation of a basic matrix-vector iteration algorithm for space matrices of the BVM, in order to generate over 1 billion useful floating-point operations/sec for this iteration algorithm. The algorithm is expressed in a novel language designated 'BVM'.
Implementation of a parallel unstructured Euler solver on the CM-5
NASA Technical Reports Server (NTRS)
Morano, Eric; Mavriplis, D. J.
1995-01-01
An efficient unstructured 3D Euler solver is parallelized on a Thinking Machine Corporation Connection Machine 5, distributed memory computer with vectoring capability. In this paper, the single instruction multiple data (SIMD) strategy is employed through the use of the CM Fortran language and the CMSSL scientific library. The performance of the CMSSL mesh partitioner is evaluated and the overall efficiency of the parallel flow solver is discussed.
Jeong, Han Saem; Lee, Tae Hyub; Bang, Cho Hee; Kim, Jong-Ho; Hong, Soon Jun
2018-03-01
While both sepsis-induced myocardial dysfunction (SIMD) and stress-induced cardiomyopathy (SICMP) are common in patients with sepsis, the pathogenesis of the 2 diseases is different, and they require different treatment strategies. Thus, we aimed to investigate risk factors and outcomes between the 2 diseases.This retrospective study enrolled patients diagnosed with sepsis or septic shock, admitted to intensive care unit via emergency department in Korea University Anam Hospital, and who underwent transthoracic echocardiography within the first 24 hours of admission.In all, 25 patients with SIMD and 27 patients with SICMP were enrolled. Chronic obstructive pulmonary disease and a history of heart failure (HF) were more prevalent in both the SIMD and SICMP groups than in the control group. In the SIMD and SICMP groups, levels of inflammatory cytokines were similar. Serum troponin level was significantly elevated in the SICMP and SIMD group compared to the control group. N-terminal pro-brain natriuretic peptide (NT pro-BNP) level was significantly elevated in the SIMD group compared to the SICMP group or control group. The in-hospital mortality rate in the SIMD and SICMP group was about 40%, showing increased trends compared with the control group. The in-hospital mortality rate was significantly increased in SIMD group with EF<30% than in SICMP group with EF<30%. In multiple logistic regression analysis, a past history of diabetes mellitus (DM) and HF was significantly associated with the incidence of SIMD. Younger age, elevated levels of NT pro-BNP, and positive result of blood culture also showed significant odds ratio regard to the occurrence of SIMD. However, only elevated lactate and troponin level were positively associated with the incidence of SICMP.The SIMD and SICMP had different risk factors. The risk factors of SIMD were younger age, history of DM, history of HF, elevated NT pro-BNP, and positive result of blood culture. The elevated levels of lactate and troponin were identified as risk factors of SICMP. More importantly, in-hospital mortality rate from SIMD and SICMP showed increased trend and worse outcome in SIMD group with reduced EF<30%. Thus, developing SIMD or SICMP reflected poor prognosis in sepsis or septic shock.
Jeong, Han Saem; Lee, Tae Hyub; Bang, Cho Hee; Kim, Jong-Ho; Hong, Soon Jun
2018-01-01
Abstract While both sepsis-induced myocardial dysfunction (SIMD) and stress-induced cardiomyopathy (SICMP) are common in patients with sepsis, the pathogenesis of the 2 diseases is different, and they require different treatment strategies. Thus, we aimed to investigate risk factors and outcomes between the 2 diseases. This retrospective study enrolled patients diagnosed with sepsis or septic shock, admitted to intensive care unit via emergency department in Korea University Anam Hospital, and who underwent transthoracic echocardiography within the first 24 hours of admission. In all, 25 patients with SIMD and 27 patients with SICMP were enrolled. Chronic obstructive pulmonary disease and a history of heart failure (HF) were more prevalent in both the SIMD and SICMP groups than in the control group. In the SIMD and SICMP groups, levels of inflammatory cytokines were similar. Serum troponin level was significantly elevated in the SICMP and SIMD group compared to the control group. N-terminal pro-brain natriuretic peptide (NT pro-BNP) level was significantly elevated in the SIMD group compared to the SICMP group or control group. The in-hospital mortality rate in the SIMD and SICMP group was about 40%, showing increased trends compared with the control group. The in-hospital mortality rate was significantly increased in SIMD group with EF<30% than in SICMP group with EF<30%. In multiple logistic regression analysis, a past history of diabetes mellitus (DM) and HF was significantly associated with the incidence of SIMD. Younger age, elevated levels of NT pro-BNP, and positive result of blood culture also showed significant odds ratio regard to the occurrence of SIMD. However, only elevated lactate and troponin level were positively associated with the incidence of SICMP. The SIMD and SICMP had different risk factors. The risk factors of SIMD were younger age, history of DM, history of HF, elevated NT pro-BNP, and positive result of blood culture. The elevated levels of lactate and troponin were identified as risk factors of SICMP. More importantly, in-hospital mortality rate from SIMD and SICMP showed increased trend and worse outcome in SIMD group with reduced EF<30%. Thus, developing SIMD or SICMP reflected poor prognosis in sepsis or septic shock. PMID:29595686
A VLSI chip set for real time vector quantization of image sequences
NASA Technical Reports Server (NTRS)
Baker, Richard L.
1989-01-01
The architecture and implementation of a VLSI chip set that vector quantizes (VQ) image sequences in real time is described. The chip set forms a programmable Single-Instruction, Multiple-Data (SIMD) machine which can implement various vector quantization encoding structures. Its VQ codebook may contain unlimited number of codevectors, N, having dimension up to K = 64. Under a weighted least squared error criterion, the engine locates at video rates the best code vector in full-searched or large tree searched VQ codebooks. The ability to manipulate tree structured codebooks, coupled with parallelism and pipelining, permits searches in as short as O (log N) cycles. A full codebook search results in O(N) performance, compared to O(KN) for a Single-Instruction, Single-Data (SISD) machine. With this VLSI chip set, an entire video code can be built on a single board that permits realtime experimentation with very large codebooks.
Electromagnetic Physics Models for Parallel Computing Architectures
NASA Astrophysics Data System (ADS)
Amadio, G.; Ananya, A.; Apostolakis, J.; Aurora, A.; Bandieramonte, M.; Bhattacharyya, A.; Bianchini, C.; Brun, R.; Canal, P.; Carminati, F.; Duhem, L.; Elvira, D.; Gheata, A.; Gheata, M.; Goulas, I.; Iope, R.; Jun, S. Y.; Lima, G.; Mohanty, A.; Nikitina, T.; Novak, M.; Pokorski, W.; Ribon, A.; Seghal, R.; Shadura, O.; Vallecorsa, S.; Wenzel, S.; Zhang, Y.
2016-10-01
The recent emergence of hardware architectures characterized by many-core or accelerated processors has opened new opportunities for concurrent programming models taking advantage of both SIMD and SIMT architectures. GeantV, a next generation detector simulation, has been designed to exploit both the vector capability of mainstream CPUs and multi-threading capabilities of coprocessors including NVidia GPUs and Intel Xeon Phi. The characteristics of these architectures are very different in terms of the vectorization depth and type of parallelization needed to achieve optimal performance. In this paper we describe implementation of electromagnetic physics models developed for parallel computing architectures as a part of the GeantV project. Results of preliminary performance evaluation and physics validation are presented as well.
Adaptive track scheduling to optimize concurrency and vectorization in GeantV
Apostolakis, J.; Bandieramonte, M.; Bitzes, G.; ...
2015-05-22
The GeantV project is focused on the R&D of new particle transport techniques to maximize parallelism on multiple levels, profiting from the use of both SIMD instructions and co-processors for the CPU-intensive calculations specific to this type of applications. In our approach, vectors of tracks belonging to multiple events and matching different locality criteria must be gathered and dispatched to algorithms having vector signatures. While the transport propagates tracks and changes their individual states, data locality becomes harder to maintain. The scheduling policy has to be changed to maintain efficient vectors while keeping an optimal level of concurrency. The modelmore » has complex dynamics requiring tuning the thresholds to switch between the normal regime and special modes, i.e. prioritizing events to allow flushing memory, adding new events in the transport pipeline to boost locality, dynamically adjusting the particle vector size or switching between vector to single track mode when vectorization causes only overhead. Lastly, this work requires a comprehensive study for optimizing these parameters to make the behaviour of the scheduler self-adapting, presenting here its initial results.« less
Working with and Visualizing Big Data Efficiently with Python for the DARPA XDATA Program
2017-08-01
same function to be used with scalar inputs, input arrays of the same shape, or even input arrays of dimensionality in some cases. Most of the math ... math operations on values ● Split-apply-combine: similar to group-by operations in databases ● Join: combine two datasets using common columns 4.3.3...Numba - Continue to increase SIMD performance with support for fast math flags and improved support for AVX, Intel’s large vector
SC'11 Poster: A Highly Efficient MGPT Implementation for LAMMPS; with Strong Scaling
DOE Office of Scientific and Technical Information (OSTI.GOV)
Oppelstrup, T; Stukowski, A; Marian, J
2011-12-07
The MGPT potential has been implemented as a drop in package to the general molecular dynamics code LAMMPS. We implement an improved communication scheme that shrinks the communication layer thickness, and increases the load balancing. This results in unprecedented strong scaling, and speedup continuing beyond 1/8 atom/core. In addition, we have optimized the small matrix linear algebra with generic blocking (for all processors) and specific SIMD intrinsics for vectorization on Intel, AMD, and BlueGene CPUs.
Sperl-Hillen, JoAnn; O'Connor, Patrick J; Ekstrom, Heidi L; Rush, William A; Asche, Stephen E; Fernandes, Omar D; Appana, Deepika; Amundson, Gerald H; Johnson, Paul E; Curran, Debra M
2014-12-01
To test a virtual case-based Simulated Diabetes Education intervention (SimDE) developed to teach primary care residents how to manage diabetes. Nineteen primary care residency programs, with 341 volunteer residents in all postgraduate years (PGY), were randomly assigned to a SimDE intervention group or control group (CG). The Web-based interactive educational intervention used computerized virtual patients who responded to provider actions through programmed simulation models. Eighteen distinct learning cases (L-cases) were assigned to SimDE residents over six months from 2010 to 2011. Impact was assessed using performance on four virtual assessment cases (A-cases), an objective knowledge test, and pre-post changes in self-assessed diabetes knowledge and confidence. Group comparisons were analyzed using generalized linear mixed models, controlling for clustering of residents within residency programs and differences in baseline knowledge. The percentages of residents appropriately achieving A-case composite clinical goals for glucose, blood pressure, and lipids were as follows: A-case 1: SimDE = 21.2%, CG = 1.8%, P = .002; A-case 2: SimDE = 15.7%, CG = 4.7%, P = .02; A-case 3: SimDE = 48.0%, CG = 10.4%, P < .001; and A-case 4: SimDE = 42.1%, CG = 18.7%, P = .004. The mean knowledge score and pre-post changes in self-assessed knowledge and confidence were significantly better for SimDE group than CG participants. A virtual case-based simulated diabetes education intervention improved diabetes management skills, knowledge, and confidence for primary care residents.
Electromagnetic physics models for parallel computing architectures
Amadio, G.; Ananya, A.; Apostolakis, J.; ...
2016-11-21
The recent emergence of hardware architectures characterized by many-core or accelerated processors has opened new opportunities for concurrent programming models taking advantage of both SIMD and SIMT architectures. GeantV, a next generation detector simulation, has been designed to exploit both the vector capability of mainstream CPUs and multi-threading capabilities of coprocessors including NVidia GPUs and Intel Xeon Phi. The characteristics of these architectures are very different in terms of the vectorization depth and type of parallelization needed to achieve optimal performance. In this paper we describe implementation of electromagnetic physics models developed for parallel computing architectures as a part ofmore » the GeantV project. Finally, the results of preliminary performance evaluation and physics validation are presented as well.« less
Insertion of operation-and-indicate instructions for optimized SIMD code
Eichenberger, Alexander E; Gara, Alan; Gschwind, Michael K
2013-06-04
Mechanisms are provided for inserting indicated instructions for tracking and indicating exceptions in the execution of vectorized code. A portion of first code is received for compilation. The portion of first code is analyzed to identify non-speculative instructions performing designated non-speculative operations in the first code that are candidates for replacement by replacement operation-and-indicate instructions that perform the designated non-speculative operations and further perform an indication operation for indicating any exception conditions corresponding to special exception values present in vector register inputs to the replacement operation-and-indicate instructions. The replacement is performed and second code is generated based on the replacement of the at least one non-speculative instruction. The data processing system executing the compiled code is configured to store special exception values in vector output registers, in response to a speculative instruction generating an exception condition, without initiating exception handling.
Overview and extensions of a system for routing directed graphs on SIMD architectures
NASA Technical Reports Server (NTRS)
Tomboulian, Sherryl
1988-01-01
Many problems can be described in terms of directed graphs that contain a large number of vertices where simple computations occur using data from adjacent vertices. A method is given for parallelizing such problems on an SIMD machine model that uses only nearest neighbor connections for communication, and has no facility for local indirect addressing. Each vertex of the graph will be assigned to a processor in the machine. Rules for a labeling are introduced that support the use of a simple algorithm for movement of data along the edges of the graph. Additional algorithms are defined for addition and deletion of edges. Modifying or adding a new edge takes the same time as parallel traversal. This combination of architecture and algorithms defines a system that is relatively simple to build and can do fast graph processing. All edges can be traversed in parallel in time O(T), where T is empirically proportional to the average path length in the embedding times the average degree of the graph. Additionally, researchers present an extension to the above method which allows for enhanced performance by allowing some broadcasting capabilities.
Empirical study of parallel LRU simulation algorithms
NASA Technical Reports Server (NTRS)
Carr, Eric; Nicol, David M.
1994-01-01
This paper reports on the performance of five parallel algorithms for simulating a fully associative cache operating under the LRU (Least-Recently-Used) replacement policy. Three of the algorithms are SIMD, and are implemented on the MasPar MP-2 architecture. Two other algorithms are parallelizations of an efficient serial algorithm on the Intel Paragon. One SIMD algorithm is quite simple, but its cost is linear in the cache size. The two other SIMD algorithm are more complex, but have costs that are independent on the cache size. Both the second and third SIMD algorithms compute all stack distances; the second SIMD algorithm is completely general, whereas the third SIMD algorithm presumes and takes advantage of bounds on the range of reference tags. Both MIMD algorithm implemented on the Paragon are general and compute all stack distances; they differ in one step that may affect their respective scalability. We assess the strengths and weaknesses of these algorithms as a function of problem size and characteristics, and compare their performance on traces derived from execution of three SPEC benchmark programs.
Solving the Cauchy-Riemann equations on parallel computers
NASA Technical Reports Server (NTRS)
Fatoohi, Raad A.; Grosch, Chester E.
1987-01-01
Discussed is the implementation of a single algorithm on three parallel-vector computers. The algorithm is a relaxation scheme for the solution of the Cauchy-Riemann equations; a set of coupled first order partial differential equations. The computers were chosen so as to encompass a variety of architectures. They are: the MPP, and SIMD machine with 16K bit serial processors; FLEX/32, an MIMD machine with 20 processors; and CRAY/2, an MIMD machine with four vector processors. The machine architectures are briefly described. The implementation of the algorithm is discussed in relation to these architectures and measures of the performance on each machine are given. Simple performance models are used to describe the performance. These models highlight the bottlenecks and limiting factors for this algorithm on these architectures. Conclusions are presented.
Deprivation in relation to urgent suspicion of head and neck cancer referrals in Glasgow.
Zeitler, M; Fingland, P; Tikka, T; Douglas, C M; Montgomery, J
2018-06-01
To examine deprivation measured by the Scottish index of multiple deprivation (SIMD) and its relation to urgent suspicion of head and neck cancer referrals. A secondary aim was to examine the symptomatology generating urgent suspicion of cancer (USOC) referrals by SIMD category. All "urgent suspicion of cancer" referrals to the GGC ENT department over a one-year period, between 2015 and 2016, were reviewed. Information was recorded anonymously and included demographics and red flag referral symptoms. A total of 1998 patients were assessed, 43.4% (n = 867) were male. A total of 171 (8.6%) patients had primary head and neck cancer. A total of 61 patients had other types of cancer, giving an all cause cancer rate of 11.6%. About 71.3% of primary patients with head and neck cancer (HNC) were male. The most common SIMD category observed was SIMD1, the most common SIMD category yielding a primary head and neck cancer diagnosis was SIMD1. Neck lump was the commonest symptom amongst all SIMD categories. A link between deprivation and USOC referrals has been established. A difference in gender distribution between referrals and HNC was observed, more females are referred but a significantly higher number of patients with HNC are males. Neck lump is a very strong referral indicator for HNC and intermittent hoarseness is not. The findings from this analysis could be used to refine local referral patterns and priority of referral. © 2018 John Wiley & Sons Ltd.
NASA Astrophysics Data System (ADS)
Mori, Kensaku; Suenaga, Yasuhito; Toriwaki, Jun-ichiro
2003-05-01
This paper describes a software-based fast volume rendering (VolR) method on a PC platform by using multimedia instructions, such as SIMD instructions, which are currently available in PCs' CPUs. This method achieves fast rendering speed through highly optimizing software rather than an improved rendering algorithm. In volume rendering using a ray casting method, the system requires fast execution of the following processes: (a) interpolation of voxel or color values at sample points, (b) computation of normal vectors (gray-level gradient vectors), (c) calculation of shaded values obtained by dot-products of normal vectors and light source direction vectors, (d) memory access to a huge area, and (e) efficient ray skipping at translucent regions. The proposed software implements these fundamental processes in volume rending by using special instruction sets for multimedia processing. The proposed software can generate virtual endoscopic images of a 3-D volume of 512x512x489 voxel size by volume rendering with perspective projection, specular reflection, and on-the-fly normal vector computation on a conventional PC without any special hardware at thirteen frames per second. Semi-translucent display is also possible.
A flexible algorithm for calculating pair interactions on SIMD architectures
NASA Astrophysics Data System (ADS)
Páll, Szilárd; Hess, Berk
2013-12-01
Calculating interactions or correlations between pairs of particles is typically the most time-consuming task in particle simulation or correlation analysis. Straightforward implementations using a double loop over particle pairs have traditionally worked well, especially since compilers usually do a good job of unrolling the inner loop. In order to reach high performance on modern CPU and accelerator architectures, single-instruction multiple-data (SIMD) parallelization has become essential. Avoiding memory bottlenecks is also increasingly important and requires reducing the ratio of memory to arithmetic operations. Moreover, when pairs only interact within a certain cut-off distance, good SIMD utilization can only be achieved by reordering input and output data, which quickly becomes a limiting factor. Here we present an algorithm for SIMD parallelization based on grouping a fixed number of particles, e.g. 2, 4, or 8, into spatial clusters. Calculating all interactions between particles in a pair of such clusters improves data reuse compared to the traditional scheme and results in a more efficient SIMD parallelization. Adjusting the cluster size allows the algorithm to map to SIMD units of various widths. This flexibility not only enables fast and efficient implementation on current CPUs and accelerator architectures like GPUs or Intel MIC, but it also makes the algorithm future-proof. We present the algorithm with an application to molecular dynamics simulations, where we can also make use of the effective buffering the method introduces.
A Parallel First-Order Linear Recurrence Solver.
1986-09-01
1og2 -M)steps, but p M did not discuss any specific parallel implementation. Gajski [GAJ81] improved upon this result by performing the SIMD computation...solves a series of reduced recurrences of size p 2. However, when N = p 2, our approach reduces to that of I’- [GAJ81], except that Gajski presents the...existing SIMD algorithms to solve R<N,1>, the SIMD algo- rithm presented by Gajski [GAJ81] can be most efficiently mapped to a uni- directional ring
Evaluating local indirect addressing in SIMD proc essors
NASA Technical Reports Server (NTRS)
Middleton, David; Tomboulian, Sherryl
1989-01-01
In the design of parallel computers, there exists a tradeoff between the number and power of individual processors. The single instruction stream, multiple data stream (SIMD) model of parallel computers lies at one extreme of the resulting spectrum. The available hardware resources are devoted to creating the largest possible number of processors, and consequently each individual processor must use the fewest possible resources. Disagreement exists as to whether SIMD processors should be able to generate addresses individually into their local data memory, or all processors should access the same address. The tradeoff is examined between the increased capability and the reduced number of processors that occurs in this single instruction stream, multiple, locally addressed, data (SIMLAD) model. Factors are assembled that affect this design choice, and the SIMLAD model is compared with the bare SIMD and the MIMD models.
Parallel computing of physical maps--a comparative study in SIMD and MIMD parallelism.
Bhandarkar, S M; Chirravuri, S; Arnold, J
1996-01-01
Ordering clones from a genomic library into physical maps of whole chromosomes presents a central computational problem in genetics. Chromosome reconstruction via clone ordering is usually isomorphic to the NP-complete Optimal Linear Arrangement problem. Parallel SIMD and MIMD algorithms for simulated annealing based on Markov chain distribution are proposed and applied to the problem of chromosome reconstruction via clone ordering. Perturbation methods and problem-specific annealing heuristics are proposed and described. The SIMD algorithms are implemented on a 2048 processor MasPar MP-2 system which is an SIMD 2-D toroidal mesh architecture whereas the MIMD algorithms are implemented on an 8 processor Intel iPSC/860 which is an MIMD hypercube architecture. A comparative analysis of the various SIMD and MIMD algorithms is presented in which the convergence, speedup, and scalability characteristics of the various algorithms are analyzed and discussed. On a fine-grained, massively parallel SIMD architecture with a low synchronization overhead such as the MasPar MP-2, a parallel simulated annealing algorithm based on multiple periodically interacting searches performs the best. For a coarse-grained MIMD architecture with high synchronization overhead such as the Intel iPSC/860, a parallel simulated annealing algorithm based on multiple independent searches yields the best results. In either case, distribution of clonal data across multiple processors is shown to exacerbate the tendency of the parallel simulated annealing algorithm to get trapped in a local optimum.
Implementation of an ADI method on parallel computers
NASA Technical Reports Server (NTRS)
Fatoohi, Raad A.; Grosch, Chester E.
1987-01-01
The implementation of an ADI method for solving the diffusion equation on three parallel/vector computers is discussed. The computers were chosen so as to encompass a variety of architectures. They are: the MPP, an SIMD machine with 16K bit serial processors; FLEX/32, an MIMD machine with 20 processors; and CRAY/2, an MIMD machine with four vector processors. The Gaussian elimination algorithm is used to solve a set of tridiagonal systems on the FLEX/32 and CRAY/2 while the cyclic elimination algorithm is used to solve these systems on the MPP. The implementation of the method is discussed in relation to these architectures and measures of the performance on each machine are given. Simple performance models are used to describe the performance. These models highlight the bottlenecks and limiting factors for this algorithm on these architectures. Finally, conclusions are presented.
Implementation of an ADI method on parallel computers
NASA Technical Reports Server (NTRS)
Fatoohi, Raad A.; Grosch, Chester E.
1987-01-01
In this paper the implementation of an ADI method for solving the diffusion equation on three parallel/vector computers is discussed. The computers were chosen so as to encompass a variety of architectures. They are the MPP, an SIMD machine with 16-Kbit serial processors; Flex/32, an MIMD machine with 20 processors; and Cray/2, an MIMD machine with four vector processors. The Gaussian elimination algorithm is used to solve a set of tridiagonal systems on the Flex/32 and Cray/2 while the cyclic elimination algorithm is used to solve these systems on the MPP. The implementation of the method is discussed in relation to these architectures and measures of the performance on each machine are given. Simple performance models are used to describe the performance. These models highlight the bottlenecks and limiting factors for this algorithm on these architectures. Finally conclusions are presented.
Flexbar 3.0 - SIMD and multicore parallelization.
Roehr, Johannes T; Dieterich, Christoph; Reinert, Knut
2017-09-15
High-throughput sequencing machines can process many samples in a single run. For Illumina systems, sequencing reads are barcoded with an additional DNA tag that is contained in the respective sequencing adapters. The recognition of barcode and adapter sequences is hence commonly needed for the analysis of next-generation sequencing data. Flexbar performs demultiplexing based on barcodes and adapter trimming for such data. The massive amounts of data generated on modern sequencing machines demand that this preprocessing is done as efficiently as possible. We present Flexbar 3.0, the successor of the popular program Flexbar. It employs now twofold parallelism: multi-threading and additionally SIMD vectorization. Both types of parallelism are used to speed-up the computation of pair-wise sequence alignments, which are used for the detection of barcodes and adapters. Furthermore, new features were included to cover a wide range of applications. We evaluated the performance of Flexbar based on a simulated sequencing dataset. Our program outcompetes other tools in terms of speed and is among the best tools in the presented quality benchmark. https://github.com/seqan/flexbar. johannes.roehr@fu-berlin.de or knut.reinert@fu-berlin.de. © The Author (2017). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com
Kalman filter tracking on parallel architectures
NASA Astrophysics Data System (ADS)
Cerati, G.; Elmer, P.; Krutelyov, S.; Lantz, S.; Lefebvre, M.; McDermott, K.; Riley, D.; Tadel, M.; Wittich, P.; Wurthwein, F.; Yagil, A.
2017-10-01
We report on the progress of our studies towards a Kalman filter track reconstruction algorithm with optimal performance on manycore architectures. The combinatorial structure of these algorithms is not immediately compatible with an efficient SIMD (or SIMT) implementation; the challenge for us is to recast the existing software so it can readily generate hundreds of shared-memory threads that exploit the underlying instruction set of modern processors. We show how the data and associated tasks can be organized in a way that is conducive to both multithreading and vectorization. We demonstrate very good performance on Intel Xeon and Xeon Phi architectures, as well as promising first results on Nvidia GPUs.
NASA Technical Reports Server (NTRS)
Fijany, Amir (Inventor); Bejczy, Antal K. (Inventor)
1994-01-01
In a computer having a large number of single-instruction multiple data (SIMD) processors, each of the SIMD processors has two sets of three individual processor elements controlled by a master control unit and interconnected among a plurality of register file units where data is stored. The register files input and output data in synchronism with a minor cycle clock under control of two slave control units controlling the register file units connected to respective ones of the two sets of processor elements. Depending upon which ones of the register file units are enabled to store or transmit data during a particular minor clock cycle, the processor elements within an SIMD processor are connected in rings or in pipeline arrays, and may exchange data with the internal bus or with neighboring SIMD processors through interface units controlled by respective ones of the two slave control units.
Protecting Cryptographic Keys and Functions from Malware Attacks
2010-12-01
registers. modifies RSA private key signing in OpenSSL to use the technique. The resulting system has the following features: 1. No special hardware is...the above method based on OpenSSL , by exploiting the Streaming SIMD Extension (SSE) XMM registers of modern Intel and AMD x86-compatible CPU’s [22...one can store a 2048-bit exponent.1 Our prototype is based on OpenSSL 0.9.8e, the Ubuntu 6.06 Linux distribution with a 2.6.15 kernel, and SSE2 which
The Unified Floating Point Vector Coprocessor for Reconfigurable Hardware
NASA Astrophysics Data System (ADS)
Kathiara, Jainik
There has been an increased interest recently in using embedded cores on FPGAs. Many of the applications that make use of these cores have floating point operations. Due to the complexity and expense of floating point hardware, these algorithms are usually converted to fixed point operations or implemented using floating-point emulation in software. As the technology advances, more and more homogeneous computational resources and fixed function embedded blocks are added to FPGAs and hence implementation of floating point hardware becomes a feasible option. In this research we have implemented a high performance, autonomous floating point vector Coprocessor (FPVC) that works independently within an embedded processor system. We have presented a unified approach to vector and scalar computation, using a single register file for both scalar operands and vector elements. The Hybrid vector/SIMD computational model of FPVC results in greater overall performance for most applications along with improved peak performance compared to other approaches. By parameterizing vector length and the number of vector lanes, we can design an application specific FPVC and take optimal advantage of the FPGA fabric. For this research we have also initiated designing a software library for various computational kernels, each of which adapts FPVC's configuration and provide maximal performance. The kernels implemented are from the area of linear algebra and include matrix multiplication and QR and Cholesky decomposition. We have demonstrated the operation of FPVC on a Xilinx Virtex 5 using the embedded PowerPC.
Performance of GeantV EM Physics Models
NASA Astrophysics Data System (ADS)
Amadio, G.; Ananya, A.; Apostolakis, J.; Aurora, A.; Bandieramonte, M.; Bhattacharyya, A.; Bianchini, C.; Brun, R.; Canal, P.; Carminati, F.; Cosmo, G.; Duhem, L.; Elvira, D.; Folger, G.; Gheata, A.; Gheata, M.; Goulas, I.; Iope, R.; Jun, S. Y.; Lima, G.; Mohanty, A.; Nikitina, T.; Novak, M.; Pokorski, W.; Ribon, A.; Seghal, R.; Shadura, O.; Vallecorsa, S.; Wenzel, S.; Zhang, Y.
2017-10-01
The recent progress in parallel hardware architectures with deeper vector pipelines or many-cores technologies brings opportunities for HEP experiments to take advantage of SIMD and SIMT computing models. Launched in 2013, the GeantV project studies performance gains in propagating multiple particles in parallel, improving instruction throughput and data locality in HEP event simulation on modern parallel hardware architecture. Due to the complexity of geometry description and physics algorithms of a typical HEP application, performance analysis is indispensable in identifying factors limiting parallel execution. In this report, we will present design considerations and preliminary computing performance of GeantV physics models on coprocessors (Intel Xeon Phi and NVidia GPUs) as well as on mainstream CPUs.
Geospace simulations on the Cell BE processor
NASA Astrophysics Data System (ADS)
Germaschewski, K.; Raeder, J.; Larson, D.
2008-12-01
OpenGGCM (Open Geospace General circulation Model) is an established numerical code that simulates the Earth's space environment. The most computing intensive part is the MHD (magnetohydrodynamics) solver that models the plasma surrounding Earth and its interaction with Earth's magnetic field and the solar wind flowing in from the sun. Like other global magnetosphere codes, OpenGGCM's realism is limited by computational constraints on grid resolution. We investigate porting of the MHD solver to the Cell BE architecture, a novel inhomogeneous multicore architecture capable of up to 230 GFlops per processor. Realizing this high performance on the Cell processor is a programming challenge, though. We implemented the MHD solver using a multi-level parallel approach: On the coarsest level, the problem is distributed to processors based upon the usual domain decomposition approach. Then, on each processor, the problem is divided into 3D columns, each of which is handled by the memory limited SPEs (synergistic processing elements) slice by slice. Finally, SIMD instructions are used to fully exploit the vector/SIMD FPUs in each SPE. Memory management needs to be handled explicitly by the code, using DMA to move data from main memory to the per-SPE local store and vice versa. We obtained excellent performance numbers, a speed-up of a factor of 25 compared to just using the main processor, while still keeping the numerical implementation details of the code maintainable.
Characterization of robotics parallel algorithms and mapping onto a reconfigurable SIMD machine
NASA Technical Reports Server (NTRS)
Lee, C. S. G.; Lin, C. T.
1989-01-01
The kinematics, dynamics, Jacobian, and their corresponding inverse computations are six essential problems in the control of robot manipulators. Efficient parallel algorithms for these computations are discussed and analyzed. Their characteristics are identified and a scheme on the mapping of these algorithms to a reconfigurable parallel architecture is presented. Based on the characteristics including type of parallelism, degree of parallelism, uniformity of the operations, fundamental operations, data dependencies, and communication requirement, it is shown that most of the algorithms for robotic computations possess highly regular properties and some common structures, especially the linear recursive structure. Moreover, they are well-suited to be implemented on a single-instruction-stream multiple-data-stream (SIMD) computer with reconfigurable interconnection network. The model of a reconfigurable dual network SIMD machine with internal direct feedback is introduced. A systematic procedure internal direct feedback is introduced. A systematic procedure to map these computations to the proposed machine is presented. A new scheduling problem for SIMD machines is investigated and a heuristic algorithm, called neighborhood scheduling, that reorders the processing sequence of subtasks to reduce the communication time is described. Mapping results of a benchmark algorithm are illustrated and discussed.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Amadio, G.; et al.
An intensive R&D and programming effort is required to accomplish new challenges posed by future experimental high-energy particle physics (HEP) programs. The GeantV project aims to narrow the gap between the performance of the existing HEP detector simulation software and the ideal performance achievable, exploiting latest advances in computing technology. The project has developed a particle detector simulation prototype capable of transporting in parallel particles in complex geometries exploiting instruction level microparallelism (SIMD and SIMT), task-level parallelism (multithreading) and high-level parallelism (MPI), leveraging both the multi-core and the many-core opportunities. We present preliminary verification results concerning the electromagnetic (EM) physicsmore » models developed for parallel computing architectures within the GeantV project. In order to exploit the potential of vectorization and accelerators and to make the physics model effectively parallelizable, advanced sampling techniques have been implemented and tested. In this paper we introduce a set of automated statistical tests in order to verify the vectorized models by checking their consistency with the corresponding Geant4 models and to validate them against experimental data.« less
Multi-GPU and multi-CPU accelerated FDTD scheme for vibroacoustic applications
NASA Astrophysics Data System (ADS)
Francés, J.; Otero, B.; Bleda, S.; Gallego, S.; Neipp, C.; Márquez, A.; Beléndez, A.
2015-06-01
The Finite-Difference Time-Domain (FDTD) method is applied to the analysis of vibroacoustic problems and to study the propagation of longitudinal and transversal waves in a stratified media. The potential of the scheme and the relevance of each acceleration strategy for massively computations in FDTD are demonstrated in this work. In this paper, we propose two new specific implementations of the bi-dimensional scheme of the FDTD method using multi-CPU and multi-GPU, respectively. In the first implementation, an open source message passing interface (OMPI) has been included in order to massively exploit the resources of a biprocessor station with two Intel Xeon processors. Moreover, regarding CPU code version, the streaming SIMD extensions (SSE) and also the advanced vectorial extensions (AVX) have been included with shared memory approaches that take advantage of the multi-core platforms. On the other hand, the second implementation called the multi-GPU code version is based on Peer-to-Peer communications available in CUDA on two GPUs (NVIDIA GTX 670). Subsequently, this paper presents an accurate analysis of the influence of the different code versions including shared memory approaches, vector instructions and multi-processors (both CPU and GPU) and compares them in order to delimit the degree of improvement of using distributed solutions based on multi-CPU and multi-GPU. The performance of both approaches was analysed and it has been demonstrated that the addition of shared memory schemes to CPU computing improves substantially the performance of vector instructions enlarging the simulation sizes that use efficiently the cache memory of CPUs. In this case GPU computing is slightly twice times faster than the fine tuned CPU version in both cases one and two nodes. However, for massively computations explicit vector instructions do not worth it since the memory bandwidth is the limiting factor and the performance tends to be the same than the sequential version with auto-vectorisation and also shared memory approach. In this scenario GPU computing is the best option since it provides a homogeneous behaviour. More specifically, the speedup of GPU computing achieves an upper limit of 12 for both one and two GPUs, whereas the performance reaches peak values of 80 GFlops and 146 GFlops for the performance for one GPU and two GPUs respectively. Finally, the method is applied to an earth crust profile in order to demonstrate the potential of our approach and the necessity of applying acceleration strategies in these type of applications.
Fault Tolerant Parallel Implementations of Iterative Algorithms for Optimal Control Problems
1988-01-21
p/.V)] steps, but did not discuss any specific parallel implementation. Gajski [51 improved upon this result by performing the SIMD computation in...N = p2. our approach reduces to that of [51, except that Gajski presents the coefficient computation and partial solution phases as a single...8217>. the SIMD algo- rithm presented by Gajski [5] can be most efficiently mapped to a unidirec- tional ring network with broadcasting capability. Based
Kernel optimization for short-range molecular dynamics
NASA Astrophysics Data System (ADS)
Hu, Changjun; Wang, Xianmeng; Li, Jianjiang; He, Xinfu; Li, Shigang; Feng, Yangde; Yang, Shaofeng; Bai, He
2017-02-01
To optimize short-range force computations in Molecular Dynamics (MD) simulations, multi-threading and SIMD optimizations are presented in this paper. With respect to multi-threading optimization, a Partition-and-Separate-Calculation (PSC) method is designed to avoid write conflicts caused by using Newton's third law. Serial bottlenecks are eliminated with no additional memory usage. The method is implemented by using the OpenMP model. Furthermore, the PSC method is employed on Intel Xeon Phi coprocessors in both native and offload models. We also evaluate the performance of the PSC method under different thread affinities on the MIC architecture. In the SIMD execution, we explain the performance influence in the PSC method, considering the "if-clause" of the cutoff radius check. The experiment results show that our PSC method is relatively more efficient compared to some traditional methods. In double precision, our 256-bit SIMD implementation is about 3 times faster than the scalar version.
Introduction to a system for implementing neural net connections on SIMD architectures
NASA Technical Reports Server (NTRS)
Tomboulian, Sherryl
1988-01-01
Neural networks have attracted much interest recently, and using parallel architectures to simulate neural networks is a natural and necessary application. The SIMD model of parallel computation is chosen, because systems of this type can be built with large numbers of processing elements. However, such systems are not naturally suited to generalized communication. A method is proposed that allows an implementation of neural network connections on massively parallel SIMD architectures. The key to this system is an algorithm permitting the formation of arbitrary connections between the neurons. A feature is the ability to add new connections quickly. It also has error recovery ability and is robust over a variety of network topologies. Simulations of the general connection system, and its implementation on the Connection Machine, indicate that the time and space requirements are proportional to the product of the average number of connections per neuron and the diameter of the interconnection network.
Introduction to a system for implementing neural net connections on SIMD architectures
NASA Technical Reports Server (NTRS)
Tomboulian, Sherryl
1988-01-01
Neural networks have attracted much interest recently, and using parallel architectures to simulate neural networks is a natural and necessary application. The SIMD model of parallel computation is chosen, because systems of this type can be built with large numbers of processing elements. However, such systems are not naturally suited to generalized elements. A method is proposed that allows an implementation of neural network connections on massively parallel SIMD architectures. The key to this system is an algorithm permitting the formation of arbitrary connections between the neurons. A feature is the ability to add new connections quickly. It also has error recovery ability and is robust over a variety of network topologies. Simulations of the general connection system, and its implementation on the Connection Machine, indicate that the time and space requirements are proportional to the product of the average number of connections per neuron and the diameter of the interconnection network.
NASA Astrophysics Data System (ADS)
Tramm, John R.; Gunow, Geoffrey; He, Tim; Smith, Kord S.; Forget, Benoit; Siegel, Andrew R.
2016-05-01
In this study we present and analyze a formulation of the 3D Method of Characteristics (MOC) technique applied to the simulation of full core nuclear reactors. Key features of the algorithm include a task-based parallelism model that allows independent MOC tracks to be assigned to threads dynamically, ensuring load balancing, and a wide vectorizable inner loop that takes advantage of modern SIMD computer architectures. The algorithm is implemented in a set of highly optimized proxy applications in order to investigate its performance characteristics on CPU, GPU, and Intel Xeon Phi architectures. Speed, power, and hardware cost efficiencies are compared. Additionally, performance bottlenecks are identified for each architecture in order to determine the prospects for continued scalability of the algorithm on next generation HPC architectures.
Steele, R J C; Kostourou, I; McClements, P; Watling, C; Libby, G; Weller, D; Brewster, D H; Black, R; Carey, F A; Fraser, C
2010-01-01
To assess the effect of gender, age and deprivation on key performance indicators in a colorectal cancer screening programme. Between March 2000 and May 2006 a demonstration pilot of biennial guaiac faecal occult blood test (gFOBT) colorectal screening was carried out in North-East Scotland for all individuals aged 50-69 years. The relevant populations were subdivided, by gender, into four age groups and into five deprivation categories according to the Scottish Index of Multiple Deprivation (SIMD), and key performance indicators analysed within these groups. In all rounds, uptake of the gFOBT increased with age (P < 0.001), decreased with increasing deprivation in both genders (P < 0.001), and was consistently higher in women than in men in all age and all SIMD groups. In addition, increasing deprivation was negatively associated with uptake of colonoscopy in men with a positive gFOBT (P < 0.001) although this effect was not observed in women. Positivity rates increased with age (P < 0.001) and increasing deprivation (P < 0.001) in both genders in all rounds, although they were higher in men than in women for all age and SIMD categories. Cancer detection rates increased with age (P < 0.001), were higher in men than in women in all age and SIMD categories, but were not consistently related to deprivation. In both genders, the positive predictive value (PPV) for cancer increased with age (P < 0.001) and decreased with increasing deprivation (P < 0.001) in all rounds and was consistently higher in men than in women in all age and SIMD categories. In this population-based colorectal screening programme gender, age, and deprivation had marked effects on key performance indicators, and this has implications both for the evaluation of screening programmes and for strategies designed to reduce inequalities.
Perry, John L; Dempster, Martin; McKay, Michael T
2017-01-01
A developing literature continues to testify to the relationship between higher socio-economic status (SES) and better academic attainment. However, the literature is complex in terms of the variety of SES and attainment indicators used. Against the backdrop of a Scottish Government initiative to close the attainment gap between higher and lower SES children, the present study examined the relationship between individual-level Scottish Index of Multiple Deprivation (SIMD) and National Lower Tariff Score in school children in the West of Scotland. Results showed a practically significant relationship between SIMD and Tariff Score. This relationship was partially mediated by higher academic self-efficacy, so that higher belief in academic competency partially mediated the SIMD-Tariff Score relationship. Further, this partial mediation was robust to the influence of gender, sensation seeking, level of school attendance and past month frequency of Heavy Episodic Drinking. It is suggested that increasing attendance and perceived academic competence are viable ways (among others) of attempting to close the attainment gap.
Perry, John L.; Dempster, Martin; McKay, Michael T.
2017-01-01
A developing literature continues to testify to the relationship between higher socio-economic status (SES) and better academic attainment. However, the literature is complex in terms of the variety of SES and attainment indicators used. Against the backdrop of a Scottish Government initiative to close the attainment gap between higher and lower SES children, the present study examined the relationship between individual-level Scottish Index of Multiple Deprivation (SIMD) and National Lower Tariff Score in school children in the West of Scotland. Results showed a practically significant relationship between SIMD and Tariff Score. This relationship was partially mediated by higher academic self-efficacy, so that higher belief in academic competency partially mediated the SIMD-Tariff Score relationship. Further, this partial mediation was robust to the influence of gender, sensation seeking, level of school attendance and past month frequency of Heavy Episodic Drinking. It is suggested that increasing attendance and perceived academic competence are viable ways (among others) of attempting to close the attainment gap. PMID:29163281
Benchmarking and performance analysis of the CM-2. [SIMD computer
NASA Technical Reports Server (NTRS)
Myers, David W.; Adams, George B., II
1988-01-01
A suite of benchmarking routines testing communication, basic arithmetic operations, and selected kernel algorithms written in LISP and PARIS was developed for the CM-2. Experiment runs are automated via a software framework that sequences individual tests, allowing for unattended overnight operation. Multiple measurements are made and treated statistically to generate well-characterized results from the noisy values given by cm:time. The results obtained provide a comparison with similar, but less extensive, testing done on a CM-1. Tests were chosen to aid the algorithmist in constructing fast, efficient, and correct code on the CM-2, as well as gain insight into what performance criteria are needed when evaluating parallel processing machines.
A portable approach for PIC on emerging architectures
NASA Astrophysics Data System (ADS)
Decyk, Viktor
2016-03-01
A portable approach for designing Particle-in-Cell (PIC) algorithms on emerging exascale computers, is based on the recognition that 3 distinct programming paradigms are needed. They are: low level vector (SIMD) processing, middle level shared memory parallel programing, and high level distributed memory programming. In addition, there is a memory hierarchy associated with each level. Such algorithms can be initially developed using vectorizing compilers, OpenMP, and MPI. This is the approach recommended by Intel for the Phi processor. These algorithms can then be translated and possibly specialized to other programming models and languages, as needed. For example, the vector processing and shared memory programming might be done with CUDA instead of vectorizing compilers and OpenMP, but generally the algorithm itself is not greatly changed. The UCLA PICKSC web site at http://www.idre.ucla.edu/ contains example open source skeleton codes (mini-apps) illustrating each of these three programming models, individually and in combination. Fortran2003 now supports abstract data types, and design patterns can be used to support a variety of implementations within the same code base. Fortran2003 also supports interoperability with C so that implementations in C languages are also easy to use. Finally, main codes can be translated into dynamic environments such as Python, while still taking advantage of high performing compiled languages. Parallel languages are still evolving with interesting developments in co-Array Fortran, UPC, and OpenACC, among others, and these can also be supported within the same software architecture. Work supported by NSF and DOE Grants.
Unstructured grids on SIMD torus machines
NASA Technical Reports Server (NTRS)
Bjorstad, Petter E.; Schreiber, Robert
1994-01-01
Unstructured grids lead to unstructured communication on distributed memory parallel computers, a problem that has been considered difficult. Here, we consider adaptive, offline communication routing for a SIMD processor grid. Our approach is empirical. We use large data sets drawn from supercomputing applications instead of an analytic model of communication load. The chief contribution of this paper is an experimental demonstration of the effectiveness of certain routing heuristics. Our routing algorithm is adaptive, nonminimal, and is generally designed to exploit locality. We have a parallel implementation of the router, and we report on its performance.
Ralston, Kevin; Dundas, Ruth; Leyland, Alastair H
2014-07-08
There is a growing international literature assessing inequalities in health and mortality by area based measures. However, there are few works comparing measures available to inform research design. The analysis here seeks to begin to address this issue by assessing whether there are important differences in the relationship between deprivation and inequalities in mortality when measures that have been constructed at different time points are compared. We contrast whether the interpretation of inequalities in all-cause mortality between the years 2008-10 changes in Scotland if we apply the earliest (2004) and the 2009 + 1 releases of the Scottish Index of Multiple Deprivation (SIMD) to make this comparison. The 2004 release is based on data from 2001/2 and the 2009 + 1 release is based on data from 2008/9. The slope index of inequality (SII) and 1:10 ratio are used to summarise inequalities standardised by age/sex using population and mortality records. The 1:10 ratio suggests some differences in the magnitude of inequalities measured using SIMD at different time points. However, the SII shows much closer correspondence. Overall the findings show that substantive conclusions in relation to inequalities in all-cause mortality are little changed by the updated measure. This information is beneficial to researchers as the most recent measures are not always available. This adds to the body of literature showing stability in inequalities in health and mortality by geographical deprivation over time.
Interaction sorting method for molecular dynamics on multi-core SIMD CPU architecture.
Matvienko, Sergey; Alemasov, Nikolay; Fomin, Eduard
2015-02-01
Molecular dynamics (MD) is widely used in computational biology for studying binding mechanisms of molecules, molecular transport, conformational transitions, protein folding, etc. The method is computationally expensive; thus, the demand for the development of novel, much more efficient algorithms is still high. Therefore, the new algorithm designed in 2007 and called interaction sorting (IS) clearly attracted interest, as it outperformed the most efficient MD algorithms. In this work, a new IS modification is proposed which allows the algorithm to utilize SIMD processor instructions. This paper shows that the improvement provides an additional gain in performance, 9% to 45% in comparison to the original IS method.
Applications of Parallel Computation in Micro-Mechanics and Finite Element Method
NASA Technical Reports Server (NTRS)
Tan, Hui-Qian
1996-01-01
This project discusses the application of parallel computations related with respect to material analyses. Briefly speaking, we analyze some kind of material by elements computations. We call an element a cell here. A cell is divided into a number of subelements called subcells and all subcells in a cell have the identical structure. The detailed structure will be given later in this paper. It is obvious that the problem is "well-structured". SIMD machine would be a better choice. In this paper we try to look into the potentials of SIMD machine in dealing with finite element computation by developing appropriate algorithms on MasPar, a SIMD parallel machine. In section 2, the architecture of MasPar will be discussed. A brief review of the parallel programming language MPL also is given in that section. In section 3, some general parallel algorithms which might be useful to the project will be proposed. And, combining with the algorithms, some features of MPL will be discussed in more detail. In section 4, the computational structure of cell/subcell model will be given. The idea of designing the parallel algorithm for the model will be demonstrated. Finally in section 5, a summary will be given.
Rapid prototyping and evaluation of programmable SIMD SDR processors in LISA
NASA Astrophysics Data System (ADS)
Chen, Ting; Liu, Hengzhu; Zhang, Botao; Liu, Dongpei
2013-03-01
With the development of international wireless communication standards, there is an increase in computational requirement for baseband signal processors. Time-to-market pressure makes it impossible to completely redesign new processors for the evolving standards. Due to its high flexibility and low power, software defined radio (SDR) digital signal processors have been proposed as promising technology to replace traditional ASIC and FPGA fashions. In addition, there are large numbers of parallel data processed in computation-intensive functions, which fosters the development of single instruction multiple data (SIMD) architecture in SDR platform. So a new way must be found to prototype the SDR processors efficiently. In this paper we present a bit-and-cycle accurate model of programmable SIMD SDR processors in a machine description language LISA. LISA is a language for instruction set architecture which can gain rapid model at architectural level. In order to evaluate the availability of our proposed processor, three common baseband functions, FFT, FIR digital filter and matrix multiplication have been mapped on the SDR platform. Analytical results showed that the SDR processor achieved the maximum of 47.1% performance boost relative to the opponent processor.
Algorithm architecture co-design for ultra low-power image sensor
NASA Astrophysics Data System (ADS)
Laforest, T.; Dupret, A.; Verdant, A.; Lattard, D.; Villard, P.
2012-03-01
In a context of embedded video surveillance, stand alone leftbehind image sensors are used to detect events with high level of confidence, but also with a very low power consumption. Using a steady camera, motion detection algorithms based on background estimation to find regions in movement are simple to implement and computationally efficient. To reduce power consumption, the background is estimated using a down sampled image formed of macropixels. In order to extend the class of moving objects to be detected, we propose an original mixed mode architecture developed thanks to an algorithm architecture co-design methodology. This programmable architecture is composed of a vector of SIMD processors. A basic RISC architecture was optimized in order to implement motion detection algorithms with a dedicated set of 42 instructions. Definition of delta modulation as a calculation primitive has allowed to implement algorithms in a very compact way. Thereby, a 1920x1080@25fps CMOS image sensor performing integrated motion detection is proposed with a power estimation of 1.8 mW.
An efficient three-dimensional Poisson solver for SIMD high-performance-computing architectures
NASA Technical Reports Server (NTRS)
Cohl, H.
1994-01-01
We present an algorithm that solves the three-dimensional Poisson equation on a cylindrical grid. The technique uses a finite-difference scheme with operator splitting. This splitting maps the banded structure of the operator matrix into a two-dimensional set of tridiagonal matrices, which are then solved in parallel. Our algorithm couples FFT techniques with the well-known ADI (Alternating Direction Implicit) method for solving Elliptic PDE's, and the implementation is extremely well suited for a massively parallel environment like the SIMD architecture of the MasPar MP-1. Due to the highly recursive nature of our problem, we believe that our method is highly efficient, as it avoids excessive interprocessor communication.
Application of multigrid methods to the solution of liquid crystal equations on a SIMD computer
NASA Technical Reports Server (NTRS)
Farrell, Paul A.; Ruttan, Arden; Zeller, Reinhardt R.
1993-01-01
We will describe a finite difference code for computing the equilibrium configurations of the order-parameter tensor field for nematic liquid crystals in rectangular regions by minimization of the Landau-de Gennes Free Energy functional. The implementation of the free energy functional described here includes magnetic fields, quadratic gradient terms, and scalar bulk terms through the fourth order. Boundary conditions include the effects of strong surface anchoring. The target architectures for our implementation are SIMD machines, with interconnection networks which can be configured as 2 or 3 dimensional grids, such as the Wavetracer DTC. We also discuss the relative efficiency of a number of iterative methods for the solution of the linear systems arising from this discretization on such architectures.
A graphics-card implementation of Monte-Carlo simulations for cosmic-ray transport
NASA Astrophysics Data System (ADS)
Tautz, R. C.
2016-05-01
A graphics card implementation of a test-particle simulation code is presented that is based on the CUDA extension of the C/C++ programming language. The original CPU version has been developed for the calculation of cosmic-ray diffusion coefficients in artificial Kolmogorov-type turbulence. In the new implementation, the magnetic turbulence generation, which is the most time-consuming part, is separated from the particle transport and is performed on a graphics card. In this article, the modification of the basic approach of integrating test particle trajectories to employ the SIMD (single instruction, multiple data) model is presented and verified. The efficiency of the new code is tested and several language-specific accelerating factors are discussed. For the example of isotropic magnetostatic turbulence, sample results are shown and a comparison to the results of the CPU implementation is performed.
Indirect addressing and load balancing for faster solution to Mandelbrot Set on SIMD architectures
NASA Technical Reports Server (NTRS)
Tomboulian, Sherryl
1989-01-01
SIMD computers with local indirect addressing allow programs to have queues and buffers, making certain kinds of problems much more efficient. Examined here are a class of problems characterized by computations on data points where the computation is identical, but the convergence rate is data dependent. Normally, in this situation, the algorithm time is governed by the maximum number of iterations required by each point. Using indirect addressing allows a processor to proceed to the next data point when it is done, reducing the overall number of iterations required to approach the mean convergence rate when a sufficiently large problem set is solved. Load balancing techniques can be applied for additional performance improvement. Simulations of this technique applied to solving Mandelbrot Sets indicate significant performance gains.
2D-RBUC for efficient parallel compression of residuals
NASA Astrophysics Data System (ADS)
Đurđević, Đorđe M.; Tartalja, Igor I.
2018-02-01
In this paper, we present a method for lossless compression of residuals with an efficient SIMD parallel decompression. The residuals originate from lossy or near lossless compression of height fields, which are commonly used to represent models of terrains. The algorithm is founded on the existing RBUC method for compression of non-uniform data sources. We have adapted the method to capture 2D spatial locality of height fields, and developed the data decompression algorithm for modern GPU architectures already present even in home computers. In combination with the point-level SIMD-parallel lossless/lossy high field compression method HFPaC, characterized by fast progressive decompression and seamlessly reconstructed surface, the newly proposed method trades off small efficiency degradation for a non negligible compression ratio (measured up to 91%) benefit.
A scalable SIMD digital signal processor for high-quality multifunctional printer systems
NASA Astrophysics Data System (ADS)
Kang, Hyeong-Ju; Choi, Yongwoo; Kim, Kimo; Park, In-Cheol; Kim, Jung-Wook; Lee, Eul-Hwan; Gahang, Goo-Soo
2005-01-01
This paper describes a high-performance scalable SIMD digital signal processor (DSP) developed for multifunctional printer systems. The DSP supports a variable number of datapaths to cover a wide range of performance and maintain a RISC-like pipeline structure. Many special instructions suitable for image processing algorithms are included in the DSP. Quad/dual instructions are introduced for 8-bit or 16-bit data, and bit-field extraction/insertion instructions are supported to process various data types. Conditional instructions are supported to deal with complex relative conditions efficiently. In addition, an intelligent DMA block is integrated to align data in the course of data reading. Experimental results show that the proposed DSP outperforms a high-end printer-system DSP by at least two times.
The MasPar MP-1 As a Computer Arithmetic Laboratory
Anuta, Michael A.; Lozier, Daniel W.; Turner, Peter R.
1996-01-01
This paper is a blueprint for the use of a massively parallel SIMD computer architecture for the simulation of various forms of computer arithmetic. The particular system used is a DEC/MasPar MP-1 with 4096 processors in a square array. This architecture has many advantages for such simulations due largely to the simplicity of the individual processors. Arithmetic operations can be spread across the processor array to simulate a hardware chip. Alternatively they may be performed on individual processors to allow simulation of a massively parallel implementation of the arithmetic. Compromises between these extremes permit speed-area tradeoffs to be examined. The paper includes a description of the architecture and its features. It then summarizes some of the arithmetic systems which have been, or are to be, implemented. The implementation of the level-index and symmetric level-index, LI and SLI, systems is described in some detail. An extensive bibliography is included. PMID:27805123
Nicholson, L; Hotchin, H
2015-05-01
People with intellectual disabilities (ID) have high rates of psychiatric illness and are known to live in more deprived areas than the general population. This study investigated the relationship between area deprivation and contact with ID psychiatry. Psychiatric case notes and electronic records were used to identify all patients who had face-to-face contact with community ID psychiatric services over 1 year in the North East Community Health Partnership of Greater Glasgow and Clyde (estimated population 177,867). The Scottish Index of Multiple Deprivation (SIMD) were determined for the patient sample and for the general population living in the same area. Between 1 June 2012 and 1 June 2013, 184 patients were seen by ID psychiatry over a total of 553 contacts, with valid SIMD data for 179 patients and 543 contacts. Fifty-two per cent of patients (n = 93) lived in the most deprived SIMD decile, and 90.5% (n = 152) in the lowest 5 deciles. Compared with the general population, there were significantly more patients than expected living in the most deprived decile (Fisher's Exact test, P = 0.009) and in the most deprived 5 deciles (Fisher's Exact test, P = 0.001). The median number of contacts was 2 (interquartile range = 1-3). There was no significant association between the number of contacts and SIMD decile. Forty-eight point one per cent (n = 261) of all contacts were with patients living in the most deprived decile and 88.6% (n = 481) in the most deprived 5 deciles. This was significantly more than expected compared with general population data (Fisher's Exact test, P = 0.008 and Fisher's Exact test, P ≤ 0.001). In the area under study, contact with ID psychiatry was greater in more deprived areas. Given the high psychiatric morbidity of people with ID, if services do not adjust for deprivation, this may lead to further discrimination in an already disadvantaged population. © 2014 MENCAP and International Association of the Scientific Study of Intellectual and Developmental Disabilities and John Wiley & Sons Ltd.
Visual information processing II; Proceedings of the Meeting, Orlando, FL, Apr. 14-16, 1993
NASA Technical Reports Server (NTRS)
Huck, Friedrich O. (Editor); Juday, Richard D. (Editor)
1993-01-01
Various papers on visual information processing are presented. Individual topics addressed include: aliasing as noise, satellite image processing using a hammering neural network, edge-detetion method using visual perception, adaptive vector median filters, design of a reading test for low-vision image warping, spatial transformation architectures, automatic image-enhancement method, redundancy reduction in image coding, lossless gray-scale image compression by predictive GDF, information efficiency in visual communication, optimizing JPEG quantization matrices for different applications, use of forward error correction to maintain image fidelity, effect of peanoscanning on image compression. Also discussed are: computer vision for autonomous robotics in space, optical processor for zero-crossing edge detection, fractal-based image edge detection, simulation of the neon spreading effect by bandpass filtering, wavelet transform (WT) on parallel SIMD architectures, nonseparable 2D wavelet image representation, adaptive image halftoning based on WT, wavelet analysis of global warming, use of the WT for signal detection, perfect reconstruction two-channel rational filter banks, N-wavelet coding for pattern classification, simulation of image of natural objects, number-theoretic coding for iconic systems.
Livermore Compiler Analysis Loop Suite
DOE Office of Scientific and Technical Information (OSTI.GOV)
Hornung, R. D.
2013-03-01
LCALS is designed to evaluate compiler optimizations and performance of a variety of loop kernels and loop traversal software constructs. Some of the loop kernels are pulled directly from "Livermore Loops Coded in C", developed at LLNL (see item 11 below for details of earlier code versions). The older suites were used to evaluate floating-point performances of hardware platforms prior to porting larger application codes. The LCALS suite is geared toward assissing C++ compiler optimizations and platform performance related to SIMD vectorization, OpenMP threading, and advanced C++ language features. LCALS contains 20 of 24 loop kernels from the older Livermoremore » Loop suites, plus various others representative of loops found in current production appkication codes at LLNL. The latter loops emphasize more diverse loop constructs and data access patterns than the others, such as multi-dimensional difference stencils. The loops are included in a configurable framework, which allows control of compilation, loop sampling for execution timing, which loops are run and their lengths. It generates timing statistics for analysis and comparing variants of individual loops. Also, it is easy to add loops to the suite as desired.« less
A multi-platform evaluation of the randomized CX low-rank matrix factorization in Spark
DOE Office of Scientific and Technical Information (OSTI.GOV)
Gittens, Alex; Kottalam, Jey; Yang, Jiyan
We investigate the performance and scalability of the randomized CX low-rank matrix factorization and demonstrate its applicability through the analysis of a 1TB mass spectrometry imaging (MSI) dataset, using Apache Spark on an Amazon EC2 cluster, a Cray XC40 system, and an experimental Cray cluster. We implemented this factorization both as a parallelized C implementation with hand-tuned optimizations and in Scala using the Apache Spark high-level cluster computing framework. We obtained consistent performance across the three platforms: using Spark we were able to process the 1TB size dataset in under 30 minutes with 960 cores on all systems, with themore » fastest times obtained on the experimental Cray cluster. In comparison, the C implementation was 21X faster on the Amazon EC2 system, due to careful cache optimizations, bandwidth-friendly access of matrices and vector computation using SIMD units. We report these results and their implications on the hardware and software issues arising in supporting data-centric workloads in parallel and distributed environments.« less
NASA Astrophysics Data System (ADS)
Drabik, Timothy J.; Lee, Sing H.
1986-11-01
The intrinsic parallelism characteristics of easily realizable optical SIMD arrays prompt their present consideration in the implementation of highly structured algorithms for the numerical solution of multidimensional partial differential equations and the computation of fast numerical transforms. Attention is given to a system, comprising several spatial light modulators (SLMs), an optical read/write memory, and a functional block, which performs simple, space-invariant shifts on images with sufficient flexibility to implement the fastest known methods for partial differential equations as well as a wide variety of numerical transforms in two or more dimensions. Either fixed or floating-point arithmetic may be used. A performance projection of more than 1 billion floating point operations/sec using SLMs with 1000 x 1000-resolution and operating at 1-MHz frame rates is made.
Route planning in a four-dimensional environment
NASA Technical Reports Server (NTRS)
Slack, M. G.; Miller, D. P.
1987-01-01
Robots must be able to function in the real world. The real world involves processes and agents that move independently of the actions of the robot, sometimes in an unpredictable manner. A real-time integrated route planning and spatial representation system for planning routes through dynamic domains is presented. The system will find the safest most efficient route through space-time as described by a set of user defined evaluation functions. Because the route planning algorthims is highly parallel and can run on an SIMD machine in O(p) time (p is the length of a path), the system will find real-time paths through unpredictable domains when used in an incremental mode. Spatial representation, an SIMD algorithm for route planning in a dynamic domain, and results from an implementation on a traditional computer architecture are discussed.
A FAST ITERATIVE METHOD FOR SOLVING THE EIKONAL EQUATION ON TETRAHEDRAL DOMAINS
Fu, Zhisong; Kirby, Robert M.; Whitaker, Ross T.
2014-01-01
Generating numerical solutions to the eikonal equation and its many variations has a broad range of applications in both the natural and computational sciences. Efficient solvers on cutting-edge, parallel architectures require new algorithms that may not be theoretically optimal, but that are designed to allow asynchronous solution updates and have limited memory access patterns. This paper presents a parallel algorithm for solving the eikonal equation on fully unstructured tetrahedral meshes. The method is appropriate for the type of fine-grained parallelism found on modern massively-SIMD architectures such as graphics processors and takes into account the particular constraints and capabilities of these computing platforms. This work builds on previous work for solving these equations on triangle meshes; in this paper we adapt and extend previous two-dimensional strategies to accommodate three-dimensional, unstructured, tetrahedralized domains. These new developments include a local update strategy with data compaction for tetrahedral meshes that provides solutions on both serial and parallel architectures, with a generalization to inhomogeneous, anisotropic speed functions. We also propose two new update schemes, specialized to mitigate the natural data increase observed when moving to three dimensions, and the data structures necessary for efficiently mapping data to parallel SIMD processors in a way that maintains computational density. Finally, we present descriptions of the implementations for a single CPU, as well as multicore CPUs with shared memory and SIMD architectures, with comparative results against state-of-the-art eikonal solvers. PMID:25221418
NASA Astrophysics Data System (ADS)
Hadade, Ioan; di Mare, Luca
2016-08-01
Modern multicore and manycore processors exhibit multiple levels of parallelism through a wide range of architectural features such as SIMD for data parallel execution or threads for core parallelism. The exploitation of multi-level parallelism is therefore crucial for achieving superior performance on current and future processors. This paper presents the performance tuning of a multiblock CFD solver on Intel SandyBridge and Haswell multicore CPUs and the Intel Xeon Phi Knights Corner coprocessor. Code optimisations have been applied on two computational kernels exhibiting different computational patterns: the update of flow variables and the evaluation of the Roe numerical fluxes. We discuss at great length the code transformations required for achieving efficient SIMD computations for both kernels across the selected devices including SIMD shuffles and transpositions for flux stencil computations and global memory transformations. Core parallelism is expressed through threading based on a number of domain decomposition techniques together with optimisations pertaining to alleviating NUMA effects found in multi-socket compute nodes. Results are correlated with the Roofline performance model in order to assert their efficiency for each distinct architecture. We report significant speedups for single thread execution across both kernels: 2-5X on the multicore CPUs and 14-23X on the Xeon Phi coprocessor. Computations at full node and chip concurrency deliver a factor of three speedup on the multicore processors and up to 24X on the Xeon Phi manycore coprocessor.
VASP-4096: a very high performance programmable device for digital media processing applications
NASA Astrophysics Data System (ADS)
Krikelis, Argy
2001-03-01
Over the past few years, technology drivers for microprocessors have changed significantly. Media data delivery and processing--such as telecommunications, networking, video processing, speech recognition and 3D graphics--is increasing in importance and will soon dominate the processing cycles consumed in computer-based systems. This paper presents the architecture of the VASP-4096 processor. VASP-4096 provides high media performance with low energy consumption by integrating associative SIMD parallel processing with embedded microprocessor technology. The major innovations in the VASP-4096 is the integration of thousands of processing units in a single chip that are capable of support software programmable high-performance mathematical functions as well as abstract data processing. In addition to 4096 processing units, VASP-4096 integrates on a single chip a RISC controller that is an implementation of the SPARC architecture, 128 Kbytes of Data Memory, and I/O interfaces. The SIMD processing in VASP-4096 implements the ASProCore architecture, which is a proprietary implementation of SIMD processing, operates at 266 MHz with program instructions issued by the RISC controller. The device also integrates a 64-bit synchronous main memory interface operating at 133 MHz (double-data rate), and a 64- bit 66 MHz PCI interface. VASP-4096, compared with other processors architectures that support media processing, offers true performance scalability, support for deterministic and non-deterministic data processing on a single device, and software programmability that can be re- used in future chip generations.
Introducing difference recurrence relations for faster semi-global alignment of long sequences.
Suzuki, Hajime; Kasahara, Masahiro
2018-02-19
The read length of single-molecule DNA sequencers is reaching 1 Mb. Popular alignment software tools widely used for analyzing such long reads often take advantage of single-instruction multiple-data (SIMD) operations to accelerate calculation of dynamic programming (DP) matrices in the Smith-Waterman-Gotoh (SWG) algorithm with a fixed alignment start position at the origin. Nonetheless, 16-bit or 32-bit integers are necessary for storing the values in a DP matrix when sequences to be aligned are long; this situation hampers the use of the full SIMD width of modern processors. We proposed a faster semi-global alignment algorithm, "difference recurrence relations," that runs more rapidly than the state-of-the-art algorithm by a factor of 2.1. Instead of calculating and storing all the values in a DP matrix directly, our algorithm computes and stores mainly the differences between the values of adjacent cells in the matrix. Although the SWG algorithm and our algorithm can output exactly the same result, our algorithm mainly involves 8-bit integer operations, enabling us to exploit the full width of SIMD operations (e.g., 32) on modern processors. We also developed a library, libgaba, so that developers can easily integrate our algorithm into alignment programs. Our novel algorithm and optimized library implementation will facilitate accelerating nucleotide long-read analysis algorithms that use pairwise alignment stages. The library is implemented in the C programming language and available at https://github.com/ocxtal/libgaba .
Herz, Stefan; Füssl, Monika; Steiger, Sandra; Koop, Hans-Ulrich
2005-12-01
Two new vector types for plastid transformation were developed and uidA reporter gene expression was compared to standard transformation vectors. The first vector type does not contain any plastid promoter, instead it relies on extension of existing plastid operons and was therefore named "operon-extension" vector. When a strongly expressed plastid operon like psbA was extended by the reporter gene with this vector type, the expression level was superior to that of a standard vector under control of the 16S rRNA promoter. Different insertion sites, promoters and 5'-UTRs were analysed for their effect on reporter gene expression with standard and operon-extension vectors. The 5'-UTR of phage 7 gene 10 in combination with a modified N-terminus was found to yield the highest expression levels. Expression levels were also strongly dependent on external factors like plant or leaf age or light intensity. In the second vector type, named "split" plastid transformation vector, modules of the expression cassette were distributed on two separate vectors. Upon co-transformation of plastids with these vectors, the complete expression cassette became inserted into the plastome. This result can be explained by successive co-integration of the split vectors and final loop-out recombination of the duplicated sequences. The split vector concept was validated with different vector pairs.
Neuromorphic processing for next generation automotive control and diagnostics
NASA Technical Reports Server (NTRS)
Aranki, N.; Tawel, R.
2001-01-01
This paper describes intra-layer architecture of a neuroprocessor organized in a SIMD configuration and the two challenging applications, misfire detection and engine idle speed control, that had served as the focus of this effort.
A system for routing arbitrary directed graphs on SIMD architectures
NASA Technical Reports Server (NTRS)
Tomboulian, Sherryl
1987-01-01
There are many problems which can be described in terms of directed graphs that contain a large number of vertices where simple computations occur using data from connecting vertices. A method is given for parallelizing such problems on an SIMD machine model that is bit-serial and uses only nearest neighbor connections for communication. Each vertex of the graph will be assigned to a processor in the machine. Algorithms are given that will be used to implement movement of data along the arcs of the graph. This architecture and algorithms define a system that is relatively simple to build and can do graph processing. All arcs can be transversed in parallel in time O(T), where T is empirically proportional to the diameter of the interconnection network times the average degree of the graph. Modifying or adding a new arc takes the same time as parallel traversal.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Langer, Steven H.; Karlin, Ian; Marinak, Marty M.
HYDRA is used to simulate a variety of experiments carried out at the National Ignition Facility (NIF) [4] and other high energy density physics facilities. HYDRA has packages to simulate radiation transfer, atomic physics, hydrodynamics, laser propagation, and a number of other physics effects. HYDRA has over one million lines of code and includes both MPI and thread-level (OpenMP and pthreads) parallelism. This paper measures the performance characteristics of HYDRA using hardware counters on an IBM BlueGene/Q system. We report key ratios such as bytes/instruction and memory bandwidth for several different physics packages. The total number of bytes read andmore » written per time step is also reported. We show that none of the packages which use significant time are memory bandwidth limited on a Blue Gene/Q. HYDRA currently issues very few SIMD instructions. The pressure on memory bandwidth will increase if high levels of SIMD instructions can be achieved.« less
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
2011-01-01
Background The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest approach to parallelisation with SIMD technology has previously been described by Farrar in 2007. The aim of this study was to explore whether further speed could be gained by other approaches to parallelisation. Results A faster approach and implementation is described and benchmarked. In the new tool SWIPE, residues from sixteen different database sequences are compared in parallel to one query residue. Using a 375 residue query sequence a speed of 106 billion cell updates per second (GCUPS) was achieved on a dual Intel Xeon X5650 six-core processor system, which is over six times more rapid than software based on Farrar's 'striped' approach. SWIPE was about 2.5 times faster when the programs used only a single thread. For shorter queries, the increase in speed was larger. SWIPE was about twice as fast as BLAST when using the BLOSUM50 score matrix, while BLAST was about twice as fast as SWIPE for the BLOSUM62 matrix. The software is designed for 64 bit Linux on processors with SSSE3. Source code is available from http://dna.uio.no/swipe/ under the GNU Affero General Public License. Conclusions Efficient parallelisation using SIMD on standard hardware makes it possible to run Smith-Waterman database searches more than six times faster than before. The approach described here could significantly widen the potential application of Smith-Waterman searches. Other applications that require optimal local alignment scores could also benefit from improved performance. PMID:21631914
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation.
Rognes, Torbjørn
2011-06-01
The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest approach to parallelisation with SIMD technology has previously been described by Farrar in 2007. The aim of this study was to explore whether further speed could be gained by other approaches to parallelisation. A faster approach and implementation is described and benchmarked. In the new tool SWIPE, residues from sixteen different database sequences are compared in parallel to one query residue. Using a 375 residue query sequence a speed of 106 billion cell updates per second (GCUPS) was achieved on a dual Intel Xeon X5650 six-core processor system, which is over six times more rapid than software based on Farrar's 'striped' approach. SWIPE was about 2.5 times faster when the programs used only a single thread. For shorter queries, the increase in speed was larger. SWIPE was about twice as fast as BLAST when using the BLOSUM50 score matrix, while BLAST was about twice as fast as SWIPE for the BLOSUM62 matrix. The software is designed for 64 bit Linux on processors with SSSE3. Source code is available from http://dna.uio.no/swipe/ under the GNU Affero General Public License. Efficient parallelisation using SIMD on standard hardware makes it possible to run Smith-Waterman database searches more than six times faster than before. The approach described here could significantly widen the potential application of Smith-Waterman searches. Other applications that require optimal local alignment scores could also benefit from improved performance.
The 2nd Symposium on the Frontiers of Massively Parallel Computations
NASA Technical Reports Server (NTRS)
Mills, Ronnie (Editor)
1988-01-01
Programming languages, computer graphics, neural networks, massively parallel computers, SIMD architecture, algorithms, digital terrain models, sort computation, simulation of charged particle transport on the massively parallel processor and image processing are among the topics discussed.
Martella, Andrea; Matjusaitis, Mantas; Auxillos, Jamie; Pollard, Steven M; Cai, Yizhi
2017-07-21
Mammalian plasmid expression vectors are critical reagents underpinning many facets of research across biology, biomedical research, and the biotechnology industry. Traditional cloning methods often require laborious manual design and assembly of plasmids using tailored sequential cloning steps. This process can be protracted, complicated, expensive, and error-prone. New tools and strategies that facilitate the efficient design and production of bespoke vectors would help relieve a current bottleneck for researchers. To address this, we have developed an extensible mammalian modular assembly kit (EMMA). This enables rapid and efficient modular assembly of mammalian expression vectors in a one-tube, one-step golden-gate cloning reaction, using a standardized library of compatible genetic parts. The high modularity, flexibility, and extensibility of EMMA provide a simple method for the production of functionally diverse mammalian expression vectors. We demonstrate the value of this toolkit by constructing and validating a range of representative vectors, such as transient and stable expression vectors (transposon based vectors), targeting vectors, inducible systems, polycistronic expression cassettes, fusion proteins, and fluorescent reporters. The method also supports simple assembly combinatorial libraries and hierarchical assembly for production of larger multigenetic cargos. In summary, EMMA is compatible with automated production, and novel genetic parts can be easily incorporated, providing new opportunities for mammalian synthetic biology.
PS3 CELL Development for Scientific Computation and Research
NASA Astrophysics Data System (ADS)
Christiansen, M.; Sevre, E.; Wang, S. M.; Yuen, D. A.; Liu, S.; Lyness, M. D.; Broten, M.
2007-12-01
The Cell processor is one of the most powerful processors on the market, and researchers in the earth sciences may find its parallel architecture to be very useful. A cell processor, with 7 cores, can easily be obtained for experimentation by purchasing a PlayStation 3 (PS3) and installing linux and the IBM SDK. Each core of the PS3 is capable of 25 GFLOPS giving a potential limit of 150 GFLOPS when using all 6 SPUs (synergistic processing units) by using vectorized algorithms. We have used the Cell's computational power to create a program which takes simulated tsunami datasets, parses them, and returns a colorized height field image using ray casting techniques. As expected, the time required to create an image is inversely proportional to the number of SPUs used. We believe that this trend will continue when multiple PS3s are chained using OpenMP functionality and are in the process of researching this. By using the Cell to visualize tsunami data, we have found that its greatest feature is its power. This fact entwines well with the needs of the scientific community where the limiting factor is time. Any algorithm, such as the heat equation, that can be subdivided into multiple parts can take advantage of the PS3 Cell's ability to split the computations across the 6 SPUs reducing required run time by one sixth. Further vectorization of the code can allow for 4 simultanious floating point operations by using the SIMD (single instruction multiple data) capabilities of the SPU increasing efficiency 24 times.
Shared Memory Parallelism for 3D Cartesian Discrete Ordinates Solver
NASA Astrophysics Data System (ADS)
Moustafa, Salli; Dutka-Malen, Ivan; Plagne, Laurent; Ponçot, Angélique; Ramet, Pierre
2014-06-01
This paper describes the design and the performance of DOMINO, a 3D Cartesian SN solver that implements two nested levels of parallelism (multicore+SIMD) on shared memory computation nodes. DOMINO is written in C++, a multi-paradigm programming language that enables the use of powerful and generic parallel programming tools such as Intel TBB and Eigen. These two libraries allow us to combine multi-thread parallelism with vector operations in an efficient and yet portable way. As a result, DOMINO can exploit the full power of modern multi-core processors and is able to tackle very large simulations, that usually require large HPC clusters, using a single computing node. For example, DOMINO solves a 3D full core PWR eigenvalue problem involving 26 energy groups, 288 angular directions (S16), 46 × 106 spatial cells and 1 × 1012 DoFs within 11 hours on a single 32-core SMP node. This represents a sustained performance of 235 GFlops and 40:74% of the SMP node peak performance for the DOMINO sweep implementation. The very high Flops/Watt ratio of DOMINO makes it a very interesting building block for a future many-nodes nuclear simulation tool.
A GPU-Parallelized Eigen-Based Clutter Filter Framework for Ultrasound Color Flow Imaging.
Chee, Adrian J Y; Yiu, Billy Y S; Yu, Alfred C H
2017-01-01
Eigen-filters with attenuation response adapted to clutter statistics in color flow imaging (CFI) have shown improved flow detection sensitivity in the presence of tissue motion. Nevertheless, its practical adoption in clinical use is not straightforward due to the high computational cost for solving eigendecompositions. Here, we provide a pedagogical description of how a real-time computing framework for eigen-based clutter filtering can be developed through a single-instruction, multiple data (SIMD) computing approach that can be implemented on a graphical processing unit (GPU). Emphasis is placed on the single-ensemble-based eigen-filtering approach (Hankel singular value decomposition), since it is algorithmically compatible with GPU-based SIMD computing. The key algebraic principles and the corresponding SIMD algorithm are explained, and annotations on how such algorithm can be rationally implemented on the GPU are presented. Real-time efficacy of our framework was experimentally investigated on a single GPU device (GTX Titan X), and the computing throughput for varying scan depths and slow-time ensemble lengths was studied. Using our eigen-processing framework, real-time video-range throughput (24 frames/s) can be attained for CFI frames with full view in azimuth direction (128 scanlines), up to a scan depth of 5 cm ( λ pixel axial spacing) for slow-time ensemble length of 16 samples. The corresponding CFI image frames, with respect to the ones derived from non-adaptive polynomial regression clutter filtering, yielded enhanced flow detection sensitivity in vivo, as demonstrated in a carotid imaging case example. These findings indicate that the GPU-enabled eigen-based clutter filtering can improve CFI flow detection performance in real time.
2018-01-01
Virus-induced gene silencing (VIGS) is used extensively for gene function studies in plants. VIGS is inexpensive and rapid compared with silencing conducted through stable transformation, but many virus-silencing vectors, especially in grasses, induce only transient silencing phenotypes. A major reason for transient phenotypes is the instability of the foreign gene fragment (insert) in the vector during VIGS. Here, we report the development of a Brome mosaic virus (BMV)-based vector that better maintains inserts through modification of the original BMV vector RNA sequence. Modification of the BMV RNA3 sequence yielded a vector, BMVCP5, that better maintained phytoene desaturase and heat shock protein70-1 (HSP70-1) inserts in Nicotiana benthamiana and maize (Zea mays). Longer maintenance of inserts was correlated with greater target gene silencing and more extensive visible silencing phenotypes displaying greater tissue penetration and involving more leaves. The modified vector accumulated similarly to the original vector in N. benthamiana after agroinfiltration, thus maintaining a high titer of virus in this intermediate host used to produce virus inoculum for grass hosts. For HSP70, silencing one family member led to a large increase in the expression of another family member, an increase likely related to the target gene knockdown and not a general effect of virus infection. The cause of the increased insert stability in the modified vector is discussed in relationship to its recombination and accumulation potential. The modified vector will improve functional genomic studies in grasses, and the conceptual methods used to improve the vector may be applied to other VIGS vectors. PMID:29127260
Fuzzy scalar and vector median filters based on fuzzy distances.
Chatzis, V; Pitas, I
1999-01-01
In this paper, the fuzzy scalar median (FSM) is proposed, defined by using ordering of fuzzy numbers based on fuzzy minimum and maximum operations defined by using the extension principle. Alternatively, the FSM is defined from the minimization of a fuzzy distance measure, and the equivalence of the two definitions is proven. Then, the fuzzy vector median (FVM) is proposed as an extension of vector median, based on a novel distance definition of fuzzy vectors, which satisfy the property of angle decomposition. By defining properly the fuzziness of a value, the combination of the basic properties of the classical scalar and vector median (VM) filter with other desirable characteristics can be succeeded.
NASA Technical Reports Server (NTRS)
Kao, David
1999-01-01
The line integral convolution (LIC) technique has been known to be an effective tool for depicting flow patterns in a given vector field. There have been many extensions to make it run faster and reveal useful flow information such as velocity magnitude, motion, and direction. There are also extensions to unsteady flows and 3D vector fields. Surprisingly, none of these extensions automatically highlight flow features, which often represent the most important and interesting physical flow phenomena. In this sketch, a method for highlighting flow direction in LIC images is presented. The method gives an intuitive impression of flow direction in the given vector field and automatically reveals saddle points in the flow.
NASA Technical Reports Server (NTRS)
Dorband, John E.
1987-01-01
Generating graphics to faithfully represent information can be a computationally intensive task. A way of using the Massively Parallel Processor to generate images by ray tracing is presented. This technique uses sort computation, a method of performing generalized routing interspersed with computation on a single-instruction-multiple-data (SIMD) computer.
Parallel optimization algorithms and their implementation in VLSI design
NASA Technical Reports Server (NTRS)
Lee, G.; Feeley, J. J.
1991-01-01
Two new parallel optimization algorithms based on the simplex method are described. They may be executed by a SIMD parallel processor architecture and be implemented in VLSI design. Several VLSI design implementations are introduced. An application example is reported to demonstrate that the algorithms are effective.
An Improved Brome mosaic virus Silencing Vector: Greater Insert Stability and More Extensive VIGS.
Ding, Xin Shun; Mannas, Stephen W; Bishop, Bethany A; Rao, Xiaolan; Lecoultre, Mitchell; Kwon, Soonil; Nelson, Richard S
2018-01-01
Virus-induced gene silencing (VIGS) is used extensively for gene function studies in plants. VIGS is inexpensive and rapid compared with silencing conducted through stable transformation, but many virus-silencing vectors, especially in grasses, induce only transient silencing phenotypes. A major reason for transient phenotypes is the instability of the foreign gene fragment (insert) in the vector during VIGS. Here, we report the development of a Brome mosaic virus (BMV)-based vector that better maintains inserts through modification of the original BMV vector RNA sequence. Modification of the BMV RNA3 sequence yielded a vector, BMVCP5, that better maintained phytoene desaturase and heat shock protein70-1 ( HSP70-1 ) inserts in Nicotiana benthamiana and maize ( Zea mays ). Longer maintenance of inserts was correlated with greater target gene silencing and more extensive visible silencing phenotypes displaying greater tissue penetration and involving more leaves. The modified vector accumulated similarly to the original vector in N. benthamiana after agroinfiltration, thus maintaining a high titer of virus in this intermediate host used to produce virus inoculum for grass hosts. For HSP70 , silencing one family member led to a large increase in the expression of another family member, an increase likely related to the target gene knockdown and not a general effect of virus infection. The cause of the increased insert stability in the modified vector is discussed in relationship to its recombination and accumulation potential. The modified vector will improve functional genomic studies in grasses, and the conceptual methods used to improve the vector may be applied to other VIGS vectors. © 2018 American Society of Plant Biologists. All Rights Reserved.
An Analysis of Instruction-Cached SIMD Computer Architecture
1993-12-01
ASSEBLE SIMULATE SCHEDULE VERIFY :t og ... . .. ... V~JSRUCTONSFOR PECIIEDCOMPARE ASSEMBLEI SIMULATE Ift*U1II ~ ~ SCHEDULEIinw ;. & VERIFY...Cache to Place Blocks ................. 70 4.5.4 Step 4: Schedule Cache Blocks ............................. 70 4.5.5 Step 5: Store Cache Blocks...167 B.4 Scheduler .............................................. 167 B.4.1 Basic Block Definition
An age-structured extension to the vectorial capacity model.
Novoseltsev, Vasiliy N; Michalski, Anatoli I; Novoseltseva, Janna A; Yashin, Anatoliy I; Carey, James R; Ellis, Alicia M
2012-01-01
Vectorial capacity and the basic reproductive number (R(0)) have been instrumental in structuring thinking about vector-borne pathogen transmission and how best to prevent the diseases they cause. One of the more important simplifying assumptions of these models is age-independent vector mortality. A growing body of evidence indicates that insect vectors exhibit age-dependent mortality, which can have strong and varied affects on pathogen transmission dynamics and strategies for disease prevention. Based on survival analysis we derived new equations for vectorial capacity and R(0) that are valid for any pattern of age-dependent (or age-independent) vector mortality and explore the behavior of the models across various mortality patterns. The framework we present (1) lays the groundwork for an extension and refinement of the vectorial capacity paradigm by introducing an age-structured extension to the model, (2) encourages further research on the actuarial dynamics of vectors in particular and the relationship of vector mortality to pathogen transmission in general, and (3) provides a detailed quantitative basis for understanding the relative impact of reductions in vector longevity compared to other vector-borne disease prevention strategies. Accounting for age-dependent vector mortality in estimates of vectorial capacity and R(0) was most important when (1) vector densities are relatively low and the pattern of mortality can determine whether pathogen transmission will persist; i.e., determines whether R(0) is above or below 1, (2) vector population growth rate is relatively low and there are complex interactions between birth and death that differ fundamentally from birth-death relationships with age-independent mortality, and (3) the vector exhibits complex patterns of age-dependent mortality and R(0) ∼ 1. A limiting factor in the construction and evaluation of new age-dependent mortality models is the paucity of data characterizing vector mortality patterns, particularly for free ranging vectors in the field.
An Age-Structured Extension to the Vectorial Capacity Model
Novoseltsev, Vasiliy N.; Michalski, Anatoli I.; Novoseltseva, Janna A.; Yashin, Anatoliy I.; Carey, James R.; Ellis, Alicia M.
2012-01-01
Background Vectorial capacity and the basic reproductive number (R0) have been instrumental in structuring thinking about vector-borne pathogen transmission and how best to prevent the diseases they cause. One of the more important simplifying assumptions of these models is age-independent vector mortality. A growing body of evidence indicates that insect vectors exhibit age-dependent mortality, which can have strong and varied affects on pathogen transmission dynamics and strategies for disease prevention. Methodology/Principal Findings Based on survival analysis we derived new equations for vectorial capacity and R0 that are valid for any pattern of age-dependent (or age–independent) vector mortality and explore the behavior of the models across various mortality patterns. The framework we present (1) lays the groundwork for an extension and refinement of the vectorial capacity paradigm by introducing an age-structured extension to the model, (2) encourages further research on the actuarial dynamics of vectors in particular and the relationship of vector mortality to pathogen transmission in general, and (3) provides a detailed quantitative basis for understanding the relative impact of reductions in vector longevity compared to other vector-borne disease prevention strategies. Conclusions/Significance Accounting for age-dependent vector mortality in estimates of vectorial capacity and R0 was most important when (1) vector densities are relatively low and the pattern of mortality can determine whether pathogen transmission will persist; i.e., determines whether R0 is above or below 1, (2) vector population growth rate is relatively low and there are complex interactions between birth and death that differ fundamentally from birth-death relationships with age-independent mortality, and (3) the vector exhibits complex patterns of age-dependent mortality and R0∼1. A limiting factor in the construction and evaluation of new age-dependent mortality models is the paucity of data characterizing vector mortality patterns, particularly for free ranging vectors in the field. PMID:22724022
DOE Office of Scientific and Technical Information (OSTI.GOV)
Shitara, Shingo; Kakeda, Minoru; Nagata, Keiko
2008-05-09
Telomerase-mediated life-span extension enables the expansion of normal cells without malignant transformation, and thus has been thought to be useful in cell therapies. Currently, integrating vectors including the retrovirus are used for human telomerase reverse transcriptase (hTERT)-mediated expansion of normal cells; however, the use of these vectors potentially causes unexpected insertional mutagenesis and/or activation of oncogenes. Here, we established normal human fibroblast (hPF) clones retaining non-integrating human artificial chromosome (HAC) vectors harboring the hTERT expression cassette. In hTERT-HAC/hPF clones, we observed the telomerase activity and the suppression of senescent-associated SA-{beta}-galactosidase activity. Furthermore, the hTERT-HAC/hPF clones continued growing beyond 120 daysmore » after cloning, whereas the hPF clones retaining the silent hTERT-HAC senesced within 70 days. Thus, hTERT-HAC-mediated episomal expression of hTERT allows the extension of the life-span of human primary cells, implying that gene delivery by non-integrating HAC vectors can be used to control cellular proliferative capacity of primary cultured cells.« less
Design of a massively parallel computer using bit serial processing elements
NASA Technical Reports Server (NTRS)
Aburdene, Maurice F.; Khouri, Kamal S.; Piatt, Jason E.; Zheng, Jianqing
1995-01-01
A 1-bit serial processor designed for a parallel computer architecture is described. This processor is used to develop a massively parallel computational engine, with a single instruction-multiple data (SIMD) architecture. The computer is simulated and tested to verify its operation and to measure its performance for further development.
NASA Astrophysics Data System (ADS)
Bird, Robert; Nystrom, David; Albright, Brian
2017-10-01
The ability of scientific simulations to effectively deliver performant computation is increasingly being challenged by successive generations of high-performance computing architectures. Code development to support efficient computation on these modern architectures is both expensive, and highly complex; if it is approached without due care, it may also not be directly transferable between subsequent hardware generations. Previous works have discussed techniques to support the process of adapting a legacy code for modern hardware generations, but despite the breakthroughs in the areas of mini-app development, portable-performance, and cache oblivious algorithms the problem still remains largely unsolved. In this work we demonstrate how a focus on platform agnostic modern code-development can be applied to Particle-in-Cell (PIC) simulations to facilitate effective scientific delivery. This work builds directly on our previous work optimizing VPIC, in which we replaced intrinsic based vectorisation with compile generated auto-vectorization to improve the performance and portability of VPIC. In this work we present the use of a specialized SIMD queue for processing some particle operations, and also preview a GPU capable OpenMP variant of VPIC. Finally we include a lessons learnt. Work performed under the auspices of the U.S. Dept. of Energy by the Los Alamos National Security, LLC Los Alamos National Laboratory under contract DE-AC52-06NA25396 and supported by the LANL LDRD program.
Scalable Metropolis Monte Carlo for simulation of hard shapes
NASA Astrophysics Data System (ADS)
Anderson, Joshua A.; Eric Irrgang, M.; Glotzer, Sharon C.
2016-07-01
We design and implement a scalable hard particle Monte Carlo simulation toolkit (HPMC), and release it open source as part of HOOMD-blue. HPMC runs in parallel on many CPUs and many GPUs using domain decomposition. We employ BVH trees instead of cell lists on the CPU for fast performance, especially with large particle size disparity, and optimize inner loops with SIMD vector intrinsics on the CPU. Our GPU kernel proposes many trial moves in parallel on a checkerboard and uses a block-level queue to redistribute work among threads and avoid divergence. HPMC supports a wide variety of shape classes, including spheres/disks, unions of spheres, convex polygons, convex spheropolygons, concave polygons, ellipsoids/ellipses, convex polyhedra, convex spheropolyhedra, spheres cut by planes, and concave polyhedra. NVT and NPT ensembles can be run in 2D or 3D triclinic boxes. Additional integration schemes permit Frenkel-Ladd free energy computations and implicit depletant simulations. In a benchmark system of a fluid of 4096 pentagons, HPMC performs 10 million sweeps in 10 min on 96 CPU cores on XSEDE Comet. The same simulation would take 7.6 h in serial. HPMC also scales to large system sizes, and the same benchmark with 16.8 million particles runs in 1.4 h on 2048 GPUs on OLCF Titan.
Fisher, A; Craigie, A M; Macleod, M; Steele, R J C; Anderson, A S
2018-06-01
Although 45% of colorectal cancer (CRC) cases may be avoidable through appropriate lifestyle and weight management, health promotion interventions run the risk of widening health inequalities. The BeWEL randomised controlled trial assessed the impact of a diet and activity programme in overweight adults who were diagnosed with a colorectal adenoma, demonstrating a significantly greater weight loss at 12 months in intervention participants than in controls. The present study aimed to compare BeWEL intervention outcomes by participant deprivation status. The intervention group of the BeWEL trial (n = 163) was classified by the Scottish Index of Multiple Deprivation (SIMD) quintiles into 'more deprived' (SIMD 1-2, n = 58) and 'less deprived' (SIMD 3-5, n = 105). Socio-economic and lifestyle variables were compared at baseline to identify potential challenges to intervention adherence in the more deprived. Between group differences at 12 months in primary outcome (change in body weight) and secondary outcomes (cardiovascular risk factors, diet, physical activity, knowledge of CRC risk and psychosocial variables) were assessed by deprivation status. At baseline, education (P = 0.001), income (P < 0.001), spending on physical activity (P = 0.003) and success at previous weight loss attempts (P = 0.007) were significantly lower in the most deprived. At 12 months, no between group differences by deprivation status were detected for changes in primary and main secondary outcomes. Despite potential barriers faced by the more deprived participants, primary and most secondary outcomes were comparable between groups, indicating that this intervention is unlikely to worsen health inequalities and is equally effective across socio-economic groups. © 2017 The Authors. Journal of Human Nutrition and Dietetics published by John Wiley & Sons Ltd on behalf of British Dietetic Association.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Trędak, Przemysław, E-mail: przemyslaw.tredak@fuw.edu.pl; Rudnicki, Witold R.; Interdisciplinary Centre for Mathematical and Computational Modelling, University of Warsaw, ul. Pawińskiego 5a, 02-106 Warsaw
The second generation Reactive Bond Order (REBO) empirical potential is commonly used to accurately model a wide range hydrocarbon materials. It is also extensible to other atom types and interactions. REBO potential assumes complex multi-body interaction model, that is difficult to represent efficiently in the SIMD or SIMT programming model. Hence, despite its importance, no efficient GPGPU implementation has been developed for this potential. Here we present a detailed description of a highly efficient GPGPU implementation of molecular dynamics algorithm using REBO potential. The presented algorithm takes advantage of rarely used properties of the SIMT architecture of a modern GPUmore » to solve difficult synchronizations issues that arise in computations of multi-body potential. Techniques developed for this problem may be also used to achieve efficient solutions of different problems. The performance of proposed algorithm is assessed using a range of model systems. It is compared to highly optimized CPU implementation (both single core and OpenMP) available in LAMMPS package. These experiments show up to 6x improvement in forces computation time using single processor of the NVIDIA Tesla K80 compared to high end 16-core Intel Xeon processor.« less
NASA Astrophysics Data System (ADS)
Mills, R. T.; Rupp, K.; Smith, B. F.; Brown, J.; Knepley, M.; Zhang, H.; Adams, M.; Hammond, G. E.
2017-12-01
As the high-performance computing community pushes towards the exascale horizon, power and heat considerations have driven the increasing importance and prevalence of fine-grained parallelism in new computer architectures. High-performance computing centers have become increasingly reliant on GPGPU accelerators and "manycore" processors such as the Intel Xeon Phi line, and 512-bit SIMD registers have even been introduced in the latest generation of Intel's mainstream Xeon server processors. The high degree of fine-grained parallelism and more complicated memory hierarchy considerations of such "manycore" processors present several challenges to existing scientific software. Here, we consider how the massively parallel, open-source hydrologic flow and reactive transport code PFLOTRAN - and the underlying Portable, Extensible Toolkit for Scientific Computation (PETSc) library on which it is built - can best take advantage of such architectures. We will discuss some key features of these novel architectures and our code optimizations and algorithmic developments targeted at them, and present experiences drawn from working with a wide range of PFLOTRAN benchmark problems on these architectures.
An ultra low energy biomedical signal processing system operating at near-threshold.
Hulzink, J; Konijnenburg, M; Ashouei, M; Breeschoten, A; Berset, T; Huisken, J; Stuyt, J; de Groot, H; Barat, F; David, J; Van Ginderdeuren, J
2011-12-01
This paper presents a voltage-scalable digital signal processing system designed for the use in a wireless sensor node (WSN) for ambulatory monitoring of biomedical signals. To fulfill the requirements of ambulatory monitoring, power consumption, which directly translates to the WSN battery lifetime and size, must be kept as low as possible. The proposed processing platform is an event-driven system with resources to run applications with different degrees of complexity in an energy-aware way. The architecture uses effective system partitioning to enable duty cycling, single instruction multiple data (SIMD) instructions, power gating, voltage scaling, multiple clock domains, multiple voltage domains, and extensive clock gating. It provides an alternative processing platform where the power and performance can be scaled to adapt to the application need. A case study on a continuous wavelet transform (CWT)-based heart-beat detection shows that the platform not only preserves the sensitivity and positive predictivity of the algorithm but also achieves the lowest energy/sample for ElectroCardioGram (ECG) heart-beat detection publicly reported today.
Kraus, Wayne A; Wagner, Albert F
1986-04-01
A triatomic classical trajectory code has been modified by extensive vectorization of the algorithms to achieve much improved performance on an FPS 164 attached processor. Extensive timings on both the FPS 164 and a VAX 11/780 with floating point accelerator are presented as a function of the number of trajectories simultaneously run. The timing tests involve a potential energy surface of the LEPS variety and trajectories with 1000 time steps. The results indicate that vectorization results in timing improvements on both the VAX and the FPS. For larger numbers of trajectories run simultaneously, up to a factor of 25 improvement in speed occurs between VAX and FPS vectorized code. Copyright © 1986 John Wiley & Sons, Inc.
CMOS VLSI Layout and Verification of a SIMD Computer
NASA Technical Reports Server (NTRS)
Zheng, Jianqing
1996-01-01
A CMOS VLSI layout and verification of a 3 x 3 processor parallel computer has been completed. The layout was done using the MAGIC tool and the verification using HSPICE. Suggestions for expanding the computer into a million processor network are presented. Many problems that might be encountered when implementing a massively parallel computer are discussed.
A Code Generation Approach for Auto-Vectorization in the Spade Compiler
NASA Astrophysics Data System (ADS)
Wang, Huayong; Andrade, Henrique; Gedik, Buğra; Wu, Kun-Lung
We describe an auto-vectorization approach for the Spade stream processing programming language, comprising two ideas. First, we provide support for vectors as a primitive data type. Second, we provide a C++ library with architecture-specific implementations of a large number of pre-vectorized operations as the means to support language extensions. We evaluate our approach with several stream processing operators, contrasting Spade's auto-vectorization with the native auto-vectorization provided by the GNU gcc and Intel icc compilers.
Vector-Vector Scattering on the Lattice
NASA Astrophysics Data System (ADS)
Romero-López, Fernando; Urbach, Carsten; Rusetsky, Akaki
2018-03-01
In this work we present an extension of the LüScher formalism to include the interaction of particles with spin, focusing on the scattering of two vector particles. The derived formalism will be applied to Scalar QED in the Higgs Phase, where the U(1) gauge boson acquires mass.
NASA Technical Reports Server (NTRS)
Bates, Lisa B.; Young, David T.
2012-01-01
This paper describes recent developmental testing to verify the integration of a developmental electromechanical actuator (EMA) with high rate lithium ion batteries and a cross platform extensible controller. Testing was performed at the Thrust Vector Control Research, Development and Qualification Laboratory at the NASA George C. Marshall Space Flight Center. Electric Thrust Vector Control (ETVC) systems like the EMA may significantly reduce recurring launch costs and complexity compared to heritage systems. Electric actuator mechanisms and control requirements across dissimilar platforms are also discussed with a focus on the similarities leveraged and differences overcome by the cross platform extensible common controller architecture.
2008-07-31
Unlike the Lyrtech, each DSP on a Bittware board offers 3 MB of on-chip memory and 3 GFLOPs of 32-bit peak processing power. Based on the performance...Each NVIDIA 8800 Ultra features 576 GFLOPS on 128 612-MHz single-precision floating-point SIMD processors, arranged in 16 clusters of eight. Each
Extensions of the standard model
DOE Office of Scientific and Technical Information (OSTI.GOV)
Ramond, P.
1983-01-01
In these lectures we focus on several issues that arise in theoretical extensions of the standard model. First we describe the kinds of fermions that can be added to the standard model without affecting known phenomenology. We focus in particular on three types: the vector-like completion of the existing fermions as would be predicted by a Kaluza-Klein type theory, which we find cannot be realistically achieved without some chiral symmetry; fermions which are vector-like by themselves, such as do appear in supersymmetric extensions, and finally anomaly-free chiral sets of fermions. We note that a chiral symmetry, such as the Peccei-Quinnmore » symmetry can be used to produce a vector-like theory which, at scales less than M/sub W/, appears to be chiral. Next, we turn to the analysis of the second hierarchy problem which arises in Grand Unified extensions of the standard model, and plays a crucial role in proton decay of supersymmetric extensions. We review the known mechanisms for avoiding this problem and present a new one which seems to lead to the (family) triplication of the gauge group. Finally, this being a summer school, we present a list of homework problems. 44 references.« less
Preliminary Observations on the Changing Roles of Malaria Vectors in Southern Belize
1993-01-01
darlingi (Diptera: Cu- licidae) de la Ceiba, Atlantida, Honduras. Thesis. Maestria en Entomologia. Universidad de Panama, Panama City, Panama. 456...Brown and C. Cordon-Rosales. 1992. Potential malaria vectors in northern Guatemala (Vectores potenciales de ma- laria in la region norte de Guatemala...Serra de Aqua in June 1946 (Linthicum 1988). We initiated a malaria vector research pro- gram in Belize in 1990 and conducted extensive larval
MANCOVA for one way classification with homogeneity of regression coefficient vectors
NASA Astrophysics Data System (ADS)
Mokesh Rayalu, G.; Ravisankar, J.; Mythili, G. Y.
2017-11-01
The MANOVA and MANCOVA are the extensions of the univariate ANOVA and ANCOVA techniques to multidimensional or vector valued observations. The assumption of a Gaussian distribution has been replaced with the Multivariate Gaussian distribution for the vectors data and residual term variables in the statistical models of these techniques. The objective of MANCOVA is to determine if there are statistically reliable mean differences that can be demonstrated between groups later modifying the newly created variable. When randomization assignment of samples or subjects to groups is not possible, multivariate analysis of covariance (MANCOVA) provides statistical matching of groups by adjusting dependent variables as if all subjects scored the same on the covariates. In this research article, an extension has been made to the MANCOVA technique with more number of covariates and homogeneity of regression coefficient vectors is also tested.
Bunch of restless vector solitons in a fiber laser with SESAM.
Zhao, L M; Tang, D Y; Zhang, H; Wu, X
2009-05-11
We report on the experimental observation of a novel form of vector soliton interaction in a fiber laser mode-locked with SESAM. Several vector solitons bunch in the cavity and move as a unit with the cavity repetition rate. However, inside the bunch the vector solitons make repeatedly contractive and repulsive motions, resembling the contraction and extension of a spring. The number of vector solitons in the bunch is controllable by changing the pump power. In addition, polarization rotation locking and period doubling bifurcation of the vector soliton bunch are also experimentally observed.
Smisc - A collection of miscellaneous functions
DOE Office of Scientific and Technical Information (OSTI.GOV)
Landon Sego, PNNL
2015-08-31
A collection of functions for statistical computing and data manipulation. These include routines for rapidly aggregating heterogeneous matrices, manipulating file names, loading R objects, sourcing multiple R files, formatting datetimes, multi-core parallel computing, stream editing, specialized plotting, etc. Smisc-package A collection of miscellaneous functions allMissing Identifies missing rows or columns in a data frame or matrix as.numericSilent Silent wrapper for coercing a vector to numeric comboList Produces all possible combinations of a set of linear model predictors cumMax Computes the maximum of the vector up to the current index cumsumNA Computes the cummulative sum of a vector without propogating NAsmore » d2binom Probability functions for the sum of two independent binomials dataIn A flexible way to import data into R. dbb The Beta-Binomial Distribution df2list Row-wise conversion of a data frame to a list dfplapply Parallelized single row processing of a data frame dframeEquiv Examines the equivalence of two dataframes or matrices dkbinom Probability functions for the sum of k independent binomials factor2character Converts all factor variables in a dataframe to character variables findDepMat Identify linearly dependent rows or columns in a matrix formatDT Converts date or datetime strings into alternate formats getExtension Filename manipulations: remove the extension or path, extract the extension or path getPath Filename manipulations: remove the extension or path, extract the extension or path grabLast Filename manipulations: remove the extension or path, extract the extension or path ifelse1 Non-vectorized version of ifelse integ Simple numerical integration routine interactionPlot Two-way Interaction Plot with Error Bar linearMap Linear mapping of a numerical vector or scalar list2df Convert a list to a data frame loadObject Loads and returns the object(s) in an ".Rdata" file more Display the contents of a file to the R terminal movAvg2 Calculate the moving average using a 2-sided window openDevice Opens a graphics device based on the filename extension p2binom Probability functions for the sum of two independent binomials padZero Pad a vector of numbers with zeros parseJob Parses a collection of elements into (almost) equal sized groups pbb The Beta-Binomial Distribution pcbinom A continuous version of the binomial cdf pkbinom Probability functions for the sum of k independent binomials plapply Simple parallelization of lapply plotFun Plot one or more functions on a single plot PowerData An example of power data pvar Prints the name and value of one or more objects qbb The Beta-Binomial Distribution rbb And numerous others (space limits reporting).« less
Efficient implementation of the many-body Reactive Bond Order (REBO) potential on GPU
NASA Astrophysics Data System (ADS)
Trędak, Przemysław; Rudnicki, Witold R.; Majewski, Jacek A.
2016-09-01
The second generation Reactive Bond Order (REBO) empirical potential is commonly used to accurately model a wide range hydrocarbon materials. It is also extensible to other atom types and interactions. REBO potential assumes complex multi-body interaction model, that is difficult to represent efficiently in the SIMD or SIMT programming model. Hence, despite its importance, no efficient GPGPU implementation has been developed for this potential. Here we present a detailed description of a highly efficient GPGPU implementation of molecular dynamics algorithm using REBO potential. The presented algorithm takes advantage of rarely used properties of the SIMT architecture of a modern GPU to solve difficult synchronizations issues that arise in computations of multi-body potential. Techniques developed for this problem may be also used to achieve efficient solutions of different problems. The performance of proposed algorithm is assessed using a range of model systems. It is compared to highly optimized CPU implementation (both single core and OpenMP) available in LAMMPS package. These experiments show up to 6x improvement in forces computation time using single processor of the NVIDIA Tesla K80 compared to high end 16-core Intel Xeon processor.
A link between torse-forming vector fields and rotational hypersurfaces
NASA Astrophysics Data System (ADS)
Chen, Bang-Yen; Verstraelen, Leopold
Torse-forming vector fields introduced by Yano [On torse forming direction in a Riemannian space, Proc. Imp. Acad. Tokyo 20 (1944) 340-346] are natural extension of concurrent and concircular vector fields. Such vector fields have many nice applications to geometry and mathematical physics. In this paper, we establish a link between rotational hypersurfaces and torse-forming vector fields. More precisely, our main result states that, for a hypersurface M of 𝔼n+1 with n ≥ 3, the tangential component xT of the position vector field of M is a proper torse-forming vector field on M if and only if M is contained in a rotational hypersurface whose axis of rotation contains the origin.
NASA Astrophysics Data System (ADS)
Lohe, M. A.
2018-06-01
We generalize the Watanabe–Strogatz (WS) transform, which acts on the Kuramoto model in d = 2 dimensions, to a higher-dimensional vector transform which operates on vector oscillator models of synchronization in any dimension , for the case of identical frequency matrices. These models have conserved quantities constructed from the cross ratios of inner products of the vector variables, which are invariant under the vector transform, and have trajectories which lie on the unit sphere S d‑1. Application of the vector transform leads to a partial integration of the equations of motion, leaving independent equations to be solved, for any number of nodes N. We discuss properties of complete synchronization and use the reduced equations to derive a stability condition for completely synchronized trajectories on S d‑1. We further generalize the vector transform to a mapping which acts in and in particular preserves the unit ball , and leaves invariant the cross ratios constructed from inner products of vectors in . This mapping can be used to partially integrate a system of vector oscillators with trajectories in , and for d = 2 leads to an extension of the Kuramoto system to a system of oscillators with time-dependent amplitudes and trajectories in the unit disk. We find an inequivalent generalization of the Möbius map which also preserves but leaves invariant a different set of cross ratios, this time constructed from the vector norms. This leads to a different extension of the Kuramoto model with trajectories in the complex plane that can be partially integrated by means of fractional linear transformations.
Development of Improved Modeling and Analysis Techniques for Dynamics of Shell Structures
1991-07-24
Engineering Sciences and Center for Space Structures and Control University of Colorado,Campus Box 429 Boulder, Colorado 80309 Accesion :or -.... ... i...system architecture ; third, to implement a decomposi- tion/mapping procedure that matches as far as possible the layout of the processors to the...element computations. In particular. we address issues that are related to the processor memory size. to the SIMD architecture and to the fast
1994-06-01
algorithms for large, irreducibly coupled systems iteratively solve concurrent problems within different subspaces of a Hilbert space, or within different...effective on problems amenable to SIMD solution. Together with researchers at AT&T Bell Labs (Boris Lubachevsky, Albert Greenberg ) we have developed...reasonable measurement. In the study of different speedups, various causes of superlinear speedup are also presented. Greenberg , Albert G., Boris D
Efficient, massively parallel eigenvalue computation
NASA Technical Reports Server (NTRS)
Huo, Yan; Schreiber, Robert
1993-01-01
In numerical simulations of disordered electronic systems, one of the most common approaches is to diagonalize random Hamiltonian matrices and to study the eigenvalues and eigenfunctions of a single electron in the presence of a random potential. An effort to implement a matrix diagonalization routine for real symmetric dense matrices on massively parallel SIMD computers, the Maspar MP-1 and MP-2 systems, is described. Results of numerical tests and timings are also presented.
Architecture Adaptive Computing Environment
NASA Technical Reports Server (NTRS)
Dorband, John E.
2006-01-01
Architecture Adaptive Computing Environment (aCe) is a software system that includes a language, compiler, and run-time library for parallel computing. aCe was developed to enable programmers to write programs, more easily than was previously possible, for a variety of parallel computing architectures. Heretofore, it has been perceived to be difficult to write parallel programs for parallel computers and more difficult to port the programs to different parallel computing architectures. In contrast, aCe is supportable on all high-performance computing architectures. Currently, it is supported on LINUX clusters. aCe uses parallel programming constructs that facilitate writing of parallel programs. Such constructs were used in single-instruction/multiple-data (SIMD) programming languages of the 1980s, including Parallel Pascal, Parallel Forth, C*, *LISP, and MasPar MPL. In aCe, these constructs are extended and implemented for both SIMD and multiple- instruction/multiple-data (MIMD) architectures. Two new constructs incorporated in aCe are those of (1) scalar and virtual variables and (2) pre-computed paths. The scalar-and-virtual-variables construct increases flexibility in optimizing memory utilization in various architectures. The pre-computed-paths construct enables the compiler to pre-compute part of a communication operation once, rather than computing it every time the communication operation is performed.
Perendeci, Altinay; Arslan, Sever; Tanyolaç, Abdurrahman; Celebi, Serdar S
2009-10-01
A conceptual neural fuzzy model based on adaptive-network based fuzzy inference system, ANFIS, was proposed using available input on-line and off-line operational variables for a sugar factory anaerobic wastewater treatment plant operating under unsteady state to estimate the effluent chemical oxygen demand, COD. The predictive power of the developed model was improved as a new approach by adding the phase vector and the recent values of COD up to 5-10 days, longer than overall retention time of wastewater in the system. History of last 10 days for COD effluent with two-valued phase vector in the input variable matrix including all parameters had more predictive power. History of 7 days with two-valued phase vector in the matrix comprised of only on-line variables yielded fairly well estimations. The developed ANFIS model with phase vector and history extension has been able to adequately represent the behavior of the treatment system.
A generalized graph-theoretical matrix of heterosystems and its application to the VMV procedure.
Mozrzymas, Anna
2011-12-14
The extensions of generalized (molecular) graph-theoretical matrix and vector-matrix-vector procedure are considered. The elements of the generalized matrix are redefined in order to describe molecules containing heteroatoms and multiple bonds. The adjacency, distance, detour and reciprocal distance matrices of heterosystems, and corresponding vectors are derived from newly defined generalized graph matrix. The topological indices, which are most widely used in predicting physicochemical and biological properties/activities of various compounds, can be calculated from the new generalized vector-matrix-vector invariant. Copyright © 2011 Elsevier Ltd. All rights reserved.
9 CFR 124.20 - Patent term extension calculation.
Code of Federal Regulations, 2012 CFR
2012-01-01
... 9 Animals and Animal Products 1 2012-01-01 2012-01-01 false Patent term extension calculation. 124... OF AGRICULTURE VIRUSES, SERUMS, TOXINS, AND ANALOGOUS PRODUCTS; ORGANISMS AND VECTORS PATENT TERM RESTORATION Regulatory Review Period § 124.20 Patent term extension calculation. (a) As provided in 37 CFR 1...
9 CFR 124.20 - Patent term extension calculation.
Code of Federal Regulations, 2011 CFR
2011-01-01
... 9 Animals and Animal Products 1 2011-01-01 2011-01-01 false Patent term extension calculation. 124... OF AGRICULTURE VIRUSES, SERUMS, TOXINS, AND ANALOGOUS PRODUCTS; ORGANISMS AND VECTORS PATENT TERM RESTORATION Regulatory Review Period § 124.20 Patent term extension calculation. (a) As provided in 37 CFR 1...
9 CFR 124.20 - Patent term extension calculation.
Code of Federal Regulations, 2013 CFR
2013-01-01
... 9 Animals and Animal Products 1 2013-01-01 2013-01-01 false Patent term extension calculation. 124... OF AGRICULTURE VIRUSES, SERUMS, TOXINS, AND ANALOGOUS PRODUCTS; ORGANISMS AND VECTORS PATENT TERM RESTORATION Regulatory Review Period § 124.20 Patent term extension calculation. (a) As provided in 37 CFR 1...
9 CFR 124.20 - Patent term extension calculation.
Code of Federal Regulations, 2014 CFR
2014-01-01
... 9 Animals and Animal Products 1 2014-01-01 2014-01-01 false Patent term extension calculation. 124... OF AGRICULTURE VIRUSES, SERUMS, TOXINS, AND ANALOGOUS PRODUCTS; ORGANISMS AND VECTORS PATENT TERM RESTORATION Regulatory Review Period § 124.20 Patent term extension calculation. (a) As provided in 37 CFR 1...
9 CFR 124.20 - Patent term extension calculation.
Code of Federal Regulations, 2010 CFR
2010-01-01
... 9 Animals and Animal Products 1 2010-01-01 2010-01-01 false Patent term extension calculation. 124... OF AGRICULTURE VIRUSES, SERUMS, TOXINS, AND ANALOGOUS PRODUCTS; ORGANISMS AND VECTORS PATENT TERM RESTORATION Regulatory Review Period § 124.20 Patent term extension calculation. (a) As provided in 37 CFR 1...
Facilitating protein solubility by use of peptide extensions
Freimuth, Paul I; Zhang, Yian-Biao; Howitt, Jason
2013-09-17
Expression vectors for expression of a protein or polypeptide of interest as a fusion product composed of the protein or polypeptide of interest fused at one terminus to a solubility enhancing peptide extension are provided. Sequences encoding the peptide extensions are provided. The invention further comprises antibodies which bind specifically to one or more of the solubility enhancing peptide extensions.
NASA Technical Reports Server (NTRS)
Kenner, B. G.; Lincoln, N. R.
1979-01-01
The manual is intended to show the revisions and additions to the current STAR FORTRAN. The changes are made to incorporate an FMP (Flow Model Processor) for use in the Numerical Aerodynamic Simulation Facility (NASF) for the purpose of simulating fluid flow over three-dimensional bodies in wind tunnel environments and in free space. The FORTRAN programming language for the STAR-100 computer contains both CDC and unique STAR extensions to the standard FORTRAN. Several of the STAR FORTRAN extensions to standard FOR-TRAN allow the FORTRAN user to exploit the vector processing capabilities of the STAR computer. In STAR FORTRAN, vectors can be expressed with an explicit notation, functions are provided that return vector results, and special call statements enable access to any machine instruction.
Medical and Transmission Vector Vocabulary Alignment with Schema.org
DOE Office of Scientific and Technical Information (OSTI.GOV)
Smith, William P.; Chappell, Alan R.; Corley, Courtney D.
Available biomedical ontologies and knowledge bases currently lack formal and standards-based interconnections between disease, disease vector, and drug treatment vocabularies. The PNNL Medical Linked Dataset (PNNL-MLD) addresses this gap. This paper describes the PNNL-MLD, which provides a unified vocabulary and dataset of drug, disease, side effect, and vector transmission background information. Currently, the PNNL-MLD combines and curates data from the following research projects: DrugBank, DailyMed, Diseasome, DisGeNet, Wikipedia Infobox, Sider, and PharmGKB. The main outcomes of this effort are a dataset aligned to Schema.org, including a parsing framework, and extensible hooks ready for integration with selected medical ontologies. The PNNL-MLDmore » enables researchers more quickly and easily to query distinct datasets. Future extensions to the PNNL-MLD will include Traditional Chinese Medicine, broader interlinks across genetic structures, a larger thesaurus of synonyms and hypernyms, explicit coding of diseases and drugs across research systems, and incorporating vector-borne transmission vocabularies.« less
Integration, Development and Performance of the 500 TFLOPS Heterogeneous Cluster (Condor)
2012-08-01
PlayStation 3 for High Performance Cluster Computing” LAPACK Working Note 185, 2007. [ 4 ] Feng, W., X. Feng, and R. Ge, “Green Supercomputing Comes of...CONFERENCE PAPER (Post Print) 3. DATES COVERED (From - To) JUN 2010 – MAY 2013 4 . TITLE AND SUBTITLE INTEGRATION, DEVELOPMENT AND PERFORMANCE OF...and streaming processing; the PlayStation 3 uses the IBM Cell BE processor, which adopts the multi-processor, single-instruction-multiple- data (SIMD
Adenoviral Vector Immunity: Its Implications and circumvention strategies
Ahi, Yadvinder S.; Bangari, Dinesh S.; Mittal, Suresh K.
2014-01-01
Adenoviral (Ad) vectors have emerged as a promising gene delivery platform for a variety of therapeutic and vaccine purposes during last two decades. However, the presence of preexisting Ad immunity and the rapid development of Ad vector immunity still pose significant challenges to the clinical use of these vectors. Innate inflammatory response following Ad vector administration may lead to systemic toxicity, drastically limit vector transduction efficiency and significantly abbreviate the duration of transgene expression. Currently, a number of approaches are being extensively pursued to overcome these drawbacks by strategies that target either the host or the Ad vector. In addition, significant progress has been made in the development of novel Ad vectors based on less prevalent human Ad serotypes and nonhuman Ad. This review provides an update on our current understanding of immune responses to Ad vectors and delineates various approaches for eluding Ad vector immunity. Approaches targeting the host and those targeting the vector are discussed in light of their promises and limitations. PMID:21453277
Towards a high performance geometry library for particle-detector simulations
Apostolakis, J.; Bandieramonte, M.; Bitzes, G.; ...
2015-05-22
Thread-parallelization and single-instruction multiple data (SIMD) ”vectorisation” of software components in HEP computing has become a necessity to fully benefit from current and future computing hardware. In this context, the Geant-Vector/GPU simulation project aims to re-engineer current software for the simulation of the passage of particles through detectors in order to increase the overall event throughput. As one of the core modules in this area, the geometry library plays a central role and vectorising its algorithms will be one of the cornerstones towards achieving good CPU performance. Here, we report on the progress made in vectorising the shape primitives, asmore » well as in applying new C++ template based optimizations of existing code available in the Geant4, ROOT or USolids geometry libraries. We will focus on a presentation of our software development approach that aims to provide optimized code for all use cases of the library (e.g., single particle and many-particle APIs) and to support different architectures (CPU and GPU) while keeping the code base small, manageable and maintainable. We report on a generic and templated C++ geometry library as a continuation of the AIDA USolids project. As a result, the experience gained with these developments will be beneficial to other parts of the simulation software, such as for the optimization of the physics library, and possibly to other parts of the experiment software stack, such as reconstruction and analysis.« less
Towards a high performance geometry library for particle-detector simulations
DOE Office of Scientific and Technical Information (OSTI.GOV)
Apostolakis, J.; Bandieramonte, M.; Bitzes, G.
Thread-parallelization and single-instruction multiple data (SIMD) ”vectorisation” of software components in HEP computing has become a necessity to fully benefit from current and future computing hardware. In this context, the Geant-Vector/GPU simulation project aims to re-engineer current software for the simulation of the passage of particles through detectors in order to increase the overall event throughput. As one of the core modules in this area, the geometry library plays a central role and vectorising its algorithms will be one of the cornerstones towards achieving good CPU performance. Here, we report on the progress made in vectorising the shape primitives, asmore » well as in applying new C++ template based optimizations of existing code available in the Geant4, ROOT or USolids geometry libraries. We will focus on a presentation of our software development approach that aims to provide optimized code for all use cases of the library (e.g., single particle and many-particle APIs) and to support different architectures (CPU and GPU) while keeping the code base small, manageable and maintainable. We report on a generic and templated C++ geometry library as a continuation of the AIDA USolids project. As a result, the experience gained with these developments will be beneficial to other parts of the simulation software, such as for the optimization of the physics library, and possibly to other parts of the experiment software stack, such as reconstruction and analysis.« less
Parallelized Kalman-Filter-Based Reconstruction of Particle Tracks on Many-Core Processors and GPUs
DOE Office of Scientific and Technical Information (OSTI.GOV)
Cerati, Giuseppe; Elmer, Peter; Krutelyov, Slava
2017-01-01
For over a decade now, physical and energy constraints have limited clock speed improvements in commodity microprocessors. Instead, chipmakers have been pushed into producing lower-power, multi-core processors such as Graphical Processing Units (GPU), ARM CPUs, and Intel MICs. Broad-based efforts from manufacturers and developers have been devoted to making these processors user-friendly enough to perform general computations. However, extracting performance from a larger number of cores, as well as specialized vector or SIMD units, requires special care in algorithm design and code optimization. One of the most computationally challenging problems in high-energy particle experiments is finding and fitting the charged-particlemore » tracks during event reconstruction. This is expected to become by far the dominant problem at the High-Luminosity Large Hadron Collider (HL-LHC), for example. Today the most common track finding methods are those based on the Kalman filter. Experience with Kalman techniques on real tracking detector systems has shown that they are robust and provide high physics performance. This is why they are currently in use at the LHC, both in the trigger and offine. Previously we reported on the significant parallel speedups that resulted from our investigations to adapt Kalman filters to track fitting and track building on Intel Xeon and Xeon Phi. Here, we discuss our progresses toward the understanding of these processors and the new developments to port the Kalman filter to NVIDIA GPUs.« less
Parallelized Kalman-Filter-Based Reconstruction of Particle Tracks on Many-Core Processors and GPUs
NASA Astrophysics Data System (ADS)
Cerati, Giuseppe; Elmer, Peter; Krutelyov, Slava; Lantz, Steven; Lefebvre, Matthieu; Masciovecchio, Mario; McDermott, Kevin; Riley, Daniel; Tadel, Matevž; Wittich, Peter; Würthwein, Frank; Yagil, Avi
2017-08-01
For over a decade now, physical and energy constraints have limited clock speed improvements in commodity microprocessors. Instead, chipmakers have been pushed into producing lower-power, multi-core processors such as Graphical Processing Units (GPU), ARM CPUs, and Intel MICs. Broad-based efforts from manufacturers and developers have been devoted to making these processors user-friendly enough to perform general computations. However, extracting performance from a larger number of cores, as well as specialized vector or SIMD units, requires special care in algorithm design and code optimization. One of the most computationally challenging problems in high-energy particle experiments is finding and fitting the charged-particle tracks during event reconstruction. This is expected to become by far the dominant problem at the High-Luminosity Large Hadron Collider (HL-LHC), for example. Today the most common track finding methods are those based on the Kalman filter. Experience with Kalman techniques on real tracking detector systems has shown that they are robust and provide high physics performance. This is why they are currently in use at the LHC, both in the trigger and offine. Previously we reported on the significant parallel speedups that resulted from our investigations to adapt Kalman filters to track fitting and track building on Intel Xeon and Xeon Phi. Here, we discuss our progresses toward the understanding of these processors and the new developments to port the Kalman filter to NVIDIA GPUs.
Automatic recognition of vector and parallel operations in a higher level language
NASA Technical Reports Server (NTRS)
Schneck, P. B.
1971-01-01
A compiler for recognizing statements of a FORTRAN program which are suited for fast execution on a parallel or pipeline machine such as Illiac-4, Star or ASC is described. The technique employs interval analysis to provide flow information to the vector/parallel recognizer. Where profitable the compiler changes scalar variables to subscripted variables. The output of the compiler is an extension to FORTRAN which shows parallel and vector operations explicitly.
Design and cloning strategies for constructing shRNA expression vectors
McIntyre, Glen J; Fanning, Gregory C
2006-01-01
Background Short hairpin RNA (shRNA) encoded within an expression vector has proven an effective means of harnessing the RNA interference (RNAi) pathway in mammalian cells. A survey of the literature revealed that shRNA vector construction can be hindered by high mutation rates and the ensuing sequencing is often problematic. Current options for constructing shRNA vectors include the use of annealed complementary oligonucleotides (74 % of surveyed studies), a PCR approach using hairpin containing primers (22 %) and primer extension of hairpin templates (4 %). Results We considered primer extension the most attractive method in terms of cost. However, in initial experiments we encountered a mutation frequency of 50 % compared to a reported 20 – 40 % for other strategies. By modifying the technique to be an isothermal reaction using the DNA polymerase Phi29, we reduced the error rate to 10 %, making primer extension the most efficient and cost-effective approach tested. We also found that inclusion of a restriction site in the loop could be exploited for confirming construct integrity by automated sequencing, while maintaining intended gene suppression. Conclusion In this study we detail simple improvements for constructing and sequencing shRNA that overcome current limitations. We also compare the advantages of our solutions against proposed alternatives. Our technical modifications will be of tangible benefit to researchers looking for a more efficient and reliable shRNA construction process. PMID:16396676
Scan line graphics generation on the massively parallel processor
NASA Technical Reports Server (NTRS)
Dorband, John E.
1988-01-01
Described here is how researchers implemented a scan line graphics generation algorithm on the Massively Parallel Processor (MPP). Pixels are computed in parallel and their results are applied to the Z buffer in large groups. To perform pixel value calculations, facilitate load balancing across the processors and apply the results to the Z buffer efficiently in parallel requires special virtual routing (sort computation) techniques developed by the author especially for use on single-instruction multiple-data (SIMD) architectures.
Campos, Samuel K; Barry, Michael A
2004-11-01
There are extensive efforts to develop cell-targeting adenoviral vectors for gene therapy wherein endogenous cell-binding ligands are ablated and exogenous ligands are introduced by genetic means. Although current approaches can genetically manipulate the capsid genes of adenoviral vectors, these approaches can be time-consuming and require multiple steps to produce a modified viral genome. We present here the use of the bacteriophage lambda Red recombination system as a valuable tool for the easy and rapid construction of capsid-modified adenoviral genomes.
Optical implementation of systolic array processing
NASA Technical Reports Server (NTRS)
Caulfield, H. J.; Rhodes, W. T.; Foster, M. J.; Horvitz, S.
1981-01-01
Algorithms for matrix vector multiplication are implemented using acousto-optic cells for multiplication and input data transfer and using charge coupled devices detector arrays for accumulation and output of the results. No two dimensional matrix mask is required; matrix changes are implemented electronically. A system for multiplying a 50 component nonnegative real vector by a 50 by 50 nonnegative real matrix is described. Modifications for bipolar real and complex valued processing are possible, as are extensions to matrix-matrix multiplication and multiplication of a vector by multiple matrices.
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.
Parallel Computing:. Some Activities in High Energy Physics
NASA Astrophysics Data System (ADS)
Willers, Ian
This paper examines some activities in High Energy Physics that utilise parallel computing. The topic includes all computing from the proposed SIMD front end detectors, the farming applications, high-powered RISC processors and the large machines in the computer centers. We start by looking at the motivation behind using parallelism for general purpose computing. The developments around farming are then described from its simplest form to the more complex system in Fermilab. Finally, there is a list of some developments that are happening close to the experiments.
2012-12-01
identity operation SIMD Single instruction, multiple datastream parallel computing Scala A byte-compiled programming language featuring dynamic type...Specific Languages 5a. CONTRACT NUMBER FA8750-10-1-0191 5b. GRANT NUMBER N/A 5c. PROGRAM ELEMENT NUMBER 61101E 6. AUTHOR(S) Armando Fox 5d...application performance, but usually must rely on efficiency programmers who are experts in explicit parallel programming to achieve it. Since such efficiency
Fast Fourier Transform algorithm design and tradeoffs
NASA Technical Reports Server (NTRS)
Kamin, Ray A., III; Adams, George B., III
1988-01-01
The Fast Fourier Transform (FFT) is a mainstay of certain numerical techniques for solving fluid dynamics problems. The Connection Machine CM-2 is the target for an investigation into the design of multidimensional Single Instruction Stream/Multiple Data (SIMD) parallel FFT algorithms for high performance. Critical algorithm design issues are discussed, necessary machine performance measurements are identified and made, and the performance of the developed FFT programs are measured. Fast Fourier Transform programs are compared to the currently best Cray-2 FFT program.
Vaxvec: The first web-based recombinant vaccine vector database and its data analysis
Deng, Shunzhou; Martin, Carly; Patil, Rasika; Zhu, Felix; Zhao, Bin; Xiang, Zuoshuang; He, Yongqun
2015-01-01
A recombinant vector vaccine uses an attenuated virus, bacterium, or parasite as the carrier to express a heterologous antigen(s). Many recombinant vaccine vectors and related vaccines have been developed and extensively investigated. To compare and better understand recombinant vectors and vaccines, we have generated Vaxvec (http://www.violinet.org/vaxvec), the first web-based database that stores various recombinant vaccine vectors and those experimentally verified vaccines that use these vectors. Vaxvec has now included 59 vaccine vectors that have been used in 196 recombinant vector vaccines against 66 pathogens and cancers. These vectors are classified to 41 viral vectors, 15 bacterial vectors, 1 parasitic vector, and 1 fungal vector. The most commonly used viral vaccine vectors are double-stranded DNA viruses, including herpesviruses, adenoviruses, and poxviruses. For example, Vaxvec includes 63 poxvirus-based recombinant vaccines for over 20 pathogens and cancers. Vaxvec collects 30 recombinant vector influenza vaccines that use 17 recombinant vectors and were experimentally tested in 7 animal models. In addition, over 60 protective antigens used in recombinant vector vaccines are annotated and analyzed. User-friendly web-interfaces are available for querying various data in Vaxvec. To support data exchange, the information of vaccine vectors, vaccines, and related information is stored in the Vaccine Ontology (VO). Vaxvec is a timely and vital source of vaccine vector database and facilitates efficient vaccine vector research and development. PMID:26403370
Development of Novel Adenoviral Vectors to Overcome Challenges Observed With HAdV-5–based Constructs
Alonso-Padilla, Julio; Papp, Tibor; Kaján, Győző L; Benkő, Mária; Havenga, Menzo; Lemckert, Angelique; Harrach, Balázs; Baker, Andrew H
2016-01-01
Recombinant vectors based on human adenovirus serotype 5 (HAdV-5) have been extensively studied in preclinical models and clinical trials over the past two decades. However, the thorough understanding of the HAdV-5 interaction with human subjects has uncovered major concerns about its product applicability. High vector-associated toxicity and widespread preexisting immunity have been shown to significantly impede the effectiveness of HAdV-5–mediated gene transfer. It is therefore that the in-depth knowledge attained working on HAdV-5 is currently being used to develop alternative vectors. Here, we provide a comprehensive overview of data obtained in recent years disqualifying the HAdV-5 vector for systemic gene delivery as well as novel strategies being pursued to overcome the limitations observed with particular emphasis on the ongoing vectorization efforts to obtain vectors based on alternative serotypes. PMID:26478249
Extended vector-tensor theories
DOE Office of Scientific and Technical Information (OSTI.GOV)
Kimura, Rampei; Naruko, Atsushi; Yoshida, Daisuke, E-mail: rampei@th.phys.titech.ac.jp, E-mail: naruko@th.phys.titech.ac.jp, E-mail: yoshida@th.phys.titech.ac.jp
Recently, several extensions of massive vector theory in curved space-time have been proposed in many literatures. In this paper, we consider the most general vector-tensor theories that contain up to two derivatives with respect to metric and vector field. By imposing a degeneracy condition of the Lagrangian in the context of ADM decomposition of space-time to eliminate an unwanted mode, we construct a new class of massive vector theories where five degrees of freedom can propagate, corresponding to three for massive vector modes and two for massless tensor modes. We find that the generalized Proca and the beyond generalized Procamore » theories up to the quartic Lagrangian, which should be included in this formulation, are degenerate theories even in curved space-time. Finally, introducing new metric and vector field transformations, we investigate the properties of thus obtained theories under such transformations.« less
DOE Office of Scientific and Technical Information (OSTI.GOV)
Sharma, Vishal C.; Gopalakrishnan, Ganesh; Krishnamoorthy, Sriram
The systems resilience research community has developed methods to manually insert additional source-program level assertions to trap errors, and also devised tools to conduct fault injection studies for scalar program codes. In this work, we contribute the first vector oriented LLVM-level fault injector VULFI to help study the effects of faults in vector architectures that are of growing importance, especially for vectorizing loops. Using VULFI, we conduct a resiliency study of nine real-world vector benchmarks using Intel’s AVX and SSE extensions as the target vector instruction sets, and offer the first reported understanding of how faults affect vector instruction sets.more » We take this work further toward automating the insertion of resilience assertions during compilation. This is based on our observation that during intermediate (e.g., LLVM-level) code generation to handle full and partial vectorization, modern compilers exploit (and explicate in their code-documentation) critical invariants. These invariants are turned into error-checking code. We confirm the efficacy of these automatically inserted low-overhead error detectors for vectorized for-loops.« less
A static investigation of the thrust vectoring system of the F/A-18 high-alpha research vehicle
NASA Technical Reports Server (NTRS)
Mason, Mary L.; Capone, Francis J.; Asbury, Scott C.
1992-01-01
A static (wind-off) test was conducted in the static test facility of the Langley 16-foot Transonic Tunnel to evaluate the vectoring capability and isolated nozzle performance of the proposed thrust vectoring system of the F/A-18 high alpha research vehicle (HARV). The thrust vectoring system consisted of three asymmetrically spaced vanes installed externally on a single test nozzle. Two nozzle configurations were tested: A maximum afterburner-power nozzle and a military-power nozzle. Vane size and vane actuation geometry were investigated, and an extensive matrix of vane deflection angles was tested. The nozzle pressure ratios ranged from two to six. The results indicate that the three vane system can successfully generate multiaxis (pitch and yaw) thrust vectoring. However, large resultant vector angles incurred large thrust losses. Resultant vector angles were always lower than the vane deflection angles. The maximum thrust vectoring angles achieved for the military-power nozzle were larger than the angles achieved for the maximum afterburner-power nozzle.
Missileborne Artificial Vision System (MAVIS)
NASA Technical Reports Server (NTRS)
Andes, David K.; Witham, James C.; Miles, Michael D.
1994-01-01
Several years ago when INTEL and China Lake designed the ETANN chip, analog VLSI appeared to be the only way to do high density neural computing. In the last five years, however, digital parallel processing chips capable of performing neural computation functions have evolved to the point of rough equality with analog chips in system level computational density. The Naval Air Warfare Center, China Lake, has developed a real time, hardware and software system designed to implement and evaluate biologically inspired retinal and cortical models. The hardware is based on the Adaptive Solutions Inc. massively parallel CNAPS system COHO boards. Each COHO board is a standard size 6U VME card featuring 256 fixed point, RISC processors running at 20 MHz in a SIMD configuration. Each COHO board has a companion board built to support a real time VSB interface to an imaging seeker, a NTSC camera, and to other COHO boards. The system is designed to have multiple SIMD machines each performing different corticomorphic functions. The system level software has been developed which allows a high level description of corticomorphic structures to be translated into the native microcode of the CNAPS chips. Corticomorphic structures are those neural structures with a form similar to that of the retina, the lateral geniculate nucleus, or the visual cortex. This real time hardware system is designed to be shrunk into a volume compatible with air launched tactical missiles. Initial versions of the software and hardware have been completed and are in the early stages of integration with a missile seeker.
Parasail: SIMD C library for global, semi-global, and local pairwise sequence alignments
DOE Office of Scientific and Technical Information (OSTI.GOV)
Daily, Jeffrey A.
Sequence alignment algorithms are a key component of many bioinformatics applications. Though various fast Smith-Waterman local sequence alignment implementations have been developed for x86 CPUs, most are embedded into larger database search tools. In addition, fast implementations of Needleman-Wunsch global sequence alignment and its semi-global variants are not as widespread. This article presents the first software library for local, global, and semi-global pairwise intra-sequence alignments and improves the performance of previous intra-sequence implementations. As a result, a faster intra-sequence pairwise alignment implementation is described and benchmarked. Using a 375 residue query sequence a speed of 136 billion cell updates permore » second (GCUPS) was achieved on a dual Intel Xeon E5-2670 12-core processor system, the highest reported for an implementation based on Farrar’s ’striped’ approach. When using only a single thread, parasail was 1.7 times faster than Rognes’s SWIPE. For many score matrices, parasail is faster than BLAST. The software library is designed for 64 bit Linux, OS X, or Windows on processors with SSE2, SSE41, or AVX2. Source code is available from https://github.com/jeffdaily/parasail under the Battelle BSD-style license. In conclusion, applications that require optimal alignment scores could benefit from the improved performance. For the first time, SIMD global, semi-global, and local alignments are available in a stand-alone C library.« less
Parasail: SIMD C library for global, semi-global, and local pairwise sequence alignments
Daily, Jeffrey A.
2016-02-10
Sequence alignment algorithms are a key component of many bioinformatics applications. Though various fast Smith-Waterman local sequence alignment implementations have been developed for x86 CPUs, most are embedded into larger database search tools. In addition, fast implementations of Needleman-Wunsch global sequence alignment and its semi-global variants are not as widespread. This article presents the first software library for local, global, and semi-global pairwise intra-sequence alignments and improves the performance of previous intra-sequence implementations. As a result, a faster intra-sequence pairwise alignment implementation is described and benchmarked. Using a 375 residue query sequence a speed of 136 billion cell updates permore » second (GCUPS) was achieved on a dual Intel Xeon E5-2670 12-core processor system, the highest reported for an implementation based on Farrar’s ’striped’ approach. When using only a single thread, parasail was 1.7 times faster than Rognes’s SWIPE. For many score matrices, parasail is faster than BLAST. The software library is designed for 64 bit Linux, OS X, or Windows on processors with SSE2, SSE41, or AVX2. Source code is available from https://github.com/jeffdaily/parasail under the Battelle BSD-style license. In conclusion, applications that require optimal alignment scores could benefit from the improved performance. For the first time, SIMD global, semi-global, and local alignments are available in a stand-alone C library.« less
Vaxvec: The first web-based recombinant vaccine vector database and its data analysis.
Deng, Shunzhou; Martin, Carly; Patil, Rasika; Zhu, Felix; Zhao, Bin; Xiang, Zuoshuang; He, Yongqun
2015-11-27
A recombinant vector vaccine uses an attenuated virus, bacterium, or parasite as the carrier to express a heterologous antigen(s). Many recombinant vaccine vectors and related vaccines have been developed and extensively investigated. To compare and better understand recombinant vectors and vaccines, we have generated Vaxvec (http://www.violinet.org/vaxvec), the first web-based database that stores various recombinant vaccine vectors and those experimentally verified vaccines that use these vectors. Vaxvec has now included 59 vaccine vectors that have been used in 196 recombinant vector vaccines against 66 pathogens and cancers. These vectors are classified to 41 viral vectors, 15 bacterial vectors, 1 parasitic vector, and 1 fungal vector. The most commonly used viral vaccine vectors are double-stranded DNA viruses, including herpesviruses, adenoviruses, and poxviruses. For example, Vaxvec includes 63 poxvirus-based recombinant vaccines for over 20 pathogens and cancers. Vaxvec collects 30 recombinant vector influenza vaccines that use 17 recombinant vectors and were experimentally tested in 7 animal models. In addition, over 60 protective antigens used in recombinant vector vaccines are annotated and analyzed. User-friendly web-interfaces are available for querying various data in Vaxvec. To support data exchange, the information of vaccine vectors, vaccines, and related information is stored in the Vaccine Ontology (VO). Vaxvec is a timely and vital source of vaccine vector database and facilitates efficient vaccine vector research and development. Copyright © 2015 Elsevier Ltd. All rights reserved.
GPU Accelerated Vector Median Filter
NASA Technical Reports Server (NTRS)
Aras, Rifat; Shen, Yuzhong
2011-01-01
Noise reduction is an important step for most image processing tasks. For three channel color images, a widely used technique is vector median filter in which color values of pixels are treated as 3-component vectors. Vector median filters are computationally expensive; for a window size of n x n, each of the n(sup 2) vectors has to be compared with other n(sup 2) - 1 vectors in distances. General purpose computation on graphics processing units (GPUs) is the paradigm of utilizing high-performance many-core GPU architectures for computation tasks that are normally handled by CPUs. In this work. NVIDIA's Compute Unified Device Architecture (CUDA) paradigm is used to accelerate vector median filtering. which has to the best of our knowledge never been done before. The performance of GPU accelerated vector median filter is compared to that of the CPU and MPI-based versions for different image and window sizes, Initial findings of the study showed 100x improvement of performance of vector median filter implementation on GPUs over CPU implementations and further speed-up is expected after more extensive optimizations of the GPU algorithm .
Disease Vector Ecology Profile: Ecuador
1998-12-01
fleas, has not been reported since 1985; however, extensive outbreaks in neighboring Peru occurred in 1992-94. Avoid rodent -infested areas and use PPM...throughout the year ( Peru ). Heavy shade in permanent bodies of water with abundant floatage. Commonly bites humans but apparently prefers rodents ...Vectors of Arboviruses other than Dengue or Yellow Fever in the Amazon Basin and Associated Northwestern Regions of South America
Engineering adeno-associated viruses for clinical gene therapy.
Kotterman, Melissa A; Schaffer, David V
2014-07-01
Clinical gene therapy has been increasingly successful owing both to an enhanced molecular understanding of human disease and to progressively improving gene delivery technologies. Among these technologies, delivery vectors based on adeno-associated viruses (AAVs) have emerged as safe and effective and, in one recent case, have led to regulatory approval. Although shortcomings in viral vector properties will render extension of such successes to many other human diseases challenging, new approaches to engineer and improve AAV vectors and their genetic cargo are increasingly helping to overcome these barriers.
Community detection in complex networks using proximate support vector clustering
NASA Astrophysics Data System (ADS)
Wang, Feifan; Zhang, Baihai; Chai, Senchun; Xia, Yuanqing
2018-03-01
Community structure, one of the most attention attracting properties in complex networks, has been a cornerstone in advances of various scientific branches. A number of tools have been involved in recent studies concentrating on the community detection algorithms. In this paper, we propose a support vector clustering method based on a proximity graph, owing to which the introduced algorithm surpasses the traditional support vector approach both in accuracy and complexity. Results of extensive experiments undertaken on computer generated networks and real world data sets illustrate competent performances in comparison with the other counterparts.
Engineering adeno-associated viruses for clinical gene therapy
Kotterman, Melissa A.; Schaffer, David V.
2015-01-01
Clinical gene therapy has been increasingly successful, due both to an enhanced molecular understanding of human disease and to progressively improving gene delivery technologies. Among the latter, delivery vectors based on adeno-associated virus (AAV) have emerged as safe and effective – in one recent case leading to regulatory approval. Although shortcomings in viral vector properties will render extension of such successes to many other human diseases challenging, new approaches to engineer and improve AAV vectors and their genetic cargo are increasingly helping to overcome these barriers. PMID:24840552
Stable solutions of inflation driven by vector fields
NASA Astrophysics Data System (ADS)
Emami, Razieh; Mukohyama, Shinji; Namba, Ryo; Zhang, Ying-li
2017-03-01
Many models of inflation driven by vector fields alone have been known to be plagued by pathological behaviors, namely ghost and/or gradient instabilities. In this work, we seek a new class of vector-driven inflationary models that evade all of the mentioned instabilities. We build our analysis on the Generalized Proca Theory with an extension to three vector fields to realize isotropic expansion. We obtain the conditions required for quasi de-Sitter solutions to be an attractor analogous to the standard slow-roll one and those for their stability at the level of linearized perturbations. Identifying the remedy to the existing unstable models, we provide a simple example and explicitly show its stability. This significantly broadens our knowledge on vector inflationary scenarios, reviving potential phenomenological interests for this class of models.
Access to chlamydia testing in remote and rural Scotland.
Hawkins, Katherine E; Thompson, Lucy; Wilson, Philip
2016-01-01
The aim of this study was to assess access to sexual health care in remote and rural settings using Chlamydia testing as a focus by measuring the extent of Chlamydia testing and positivity across the Scottish Highlands in relation to the Scottish Index of Multiple Deprivation Quintile (SIMD) and Urban Rural 8-fold index (UR8). Tests processed through Raigmore Hospital in Inverness, the main testing laboratory for microbiology tests in North and West and South and Mid Highlands, were studied. Where people are tested in relation to where they live was assessed, as well as the type of test they opt for. Also assessed was the rate of positivity in male and female patients in rural compared with urban settings using the Scottish Government UR8 and in relation to the SIMD. 9644 results were analysed. 77.2% of the results were for females and 22.4% for males. 8.1% of the results were positive and 84.4% were negative. There were proportionately more positive tests from the sexual health sources than from general practice. The proportion of men who had positive tests was almost double that for women (12.7% vs 6.6%) although men made up only 27.9% of the total number of tests. There was no significant difference in positivity when compared with UR8 index or SIMD. 37.7% of people living in the most rural areas (UR8 7-8) had their test performed in a more urban setting (UR8 1-6), and 20.4% people had their test performed in a very urban setting (UR8 1-2). Of these tests, there was a tendency for UR8 7-8 patients to be more likely to have a positive test if tested in an urban setting. These results are similar to previous results in other countries that suggest that Chlamydia positivity is similar in rural and urban settings. A large proportion of people living in more rurally classified areas, and perhaps those with a higher risk, have their test in a central setting, suggesting that they may be bypassing local resources to get a test. The reason for this is not clear. The results also show that men are more likely to have their test in a genitourinary setting as well as have proportionately more positive results. These results support the case for customising sexual health services to the most rural areas and suggest that providing an anonymous testing service in these areas might be beneficial, especially for men.
Poxvirus-vectored vaccines for rabies--a review.
Weyer, Jacqueline; Rupprecht, Charles E; Nel, Louis H
2009-11-27
Oral rabies vaccination of target reservoir species has proved to be one of the pillars of successful rabies elimination programs. The use of live attenuated rabies virus vaccines has been extensive but several limitations hamper its future use. A recombinant vaccinia-rabies vaccine has also been successfully used for the oral vaccination of several species. Nevertheless, its lack of efficacy in certain important rabies reservoirs and concerns on the use of this potent live virus as vaccine carrier (vector) impair the expansion of its use for new target species and new areas. Several attenuated and host-restricted poxvirus alternatives, which supposedly offer enhanced safety, have been investigated. Once again, efficacy in certain target species and innocuity through the oral route remain major limitations of these vaccines. Alternative recombinant vaccines using adenovirus as an antigen delivery vector have been extensively investigated and may provide an important addition to the currently available oral rabies vaccine repertoire, but are not the primary subject of this review.
Agulleiro, Jose-Ignacio; Fernandez, Jose-Jesus
2015-01-01
Cache blocking is a technique widely used in scientific computing to minimize the exchange of information with main memory by reusing the data kept in cache memory. In tomographic reconstruction on standard computers using vector instructions, cache blocking turns out to be central to optimize performance. To this end, sinograms of the tilt-series and slices of the volumes to be reconstructed have to be divided into small blocks that fit into the different levels of cache memory. The code is then reorganized so as to operate with a block as much as possible before proceeding with another one. This data article is related to the research article titled Tomo3D 2.0 – Exploitation of Advanced Vector eXtensions (AVX) for 3D reconstruction (Agulleiro and Fernandez, 2015) [1]. Here we present data of a thorough study of the performance of tomographic reconstruction by varying cache block sizes, which allows derivation of expressions for their automatic quasi-optimal tuning. PMID:26217710
Agulleiro, Jose-Ignacio; Fernandez, Jose-Jesus
2015-06-01
Cache blocking is a technique widely used in scientific computing to minimize the exchange of information with main memory by reusing the data kept in cache memory. In tomographic reconstruction on standard computers using vector instructions, cache blocking turns out to be central to optimize performance. To this end, sinograms of the tilt-series and slices of the volumes to be reconstructed have to be divided into small blocks that fit into the different levels of cache memory. The code is then reorganized so as to operate with a block as much as possible before proceeding with another one. This data article is related to the research article titled Tomo3D 2.0 - Exploitation of Advanced Vector eXtensions (AVX) for 3D reconstruction (Agulleiro and Fernandez, 2015) [1]. Here we present data of a thorough study of the performance of tomographic reconstruction by varying cache block sizes, which allows derivation of expressions for their automatic quasi-optimal tuning.
HIV-1 vaccine strategies utilizing viral vectors including antigen- displayed inoviral vectors.
Hassapis, Kyriakos A; Kostrikis, Leondios G
2013-12-01
Antigen-presenting viral vectors have been extensively used as vehicles for the presentation of antigens to the immune system in numerous vaccine strategies. Particularly in HIV vaccine development efforts, two main viral vectors have been used as antigen carriers: (a) live attenuated vectors and (b) virus-like particles (VLPs); the former, although highly effective in animal studies, cannot be clinically tested in humans due to safety concerns and the latter have failed to induce broadly neutralizing anti-HIV antibodies. For more than two decades, Inoviruses (non-lytic bacterial phages) have also been utilized as antigen carriers in several vaccine studies. Inoviral vectors are important antigen-carriers in vaccine development due to their ability to present an antigen on their outer architecture in many copies and to their natural high immunogenicity. Numerous fundamental studies have been conducted, which have established the unique properties of antigen-displayed inoviral vectors in HIV vaccine efforts. The recent isolation of new, potent anti-HIV broadly neutralizing monoclonal antibodies provides a new momentum in this emerging technology.
Nonlinear Wave Simulation on the Xeon Phi Knights Landing Processor
NASA Astrophysics Data System (ADS)
Hristov, Ivan; Goranov, Goran; Hristova, Radoslava
2018-02-01
We consider an interesting from computational point of view standing wave simulation by solving coupled 2D perturbed Sine-Gordon equations. We make an OpenMP realization which explores both thread and SIMD levels of parallelism. We test the OpenMP program on two different energy equivalent Intel architectures: 2× Xeon E5-2695 v2 processors, (code-named "Ivy Bridge-EP") in the Hybrilit cluster, and Xeon Phi 7250 processor (code-named "Knights Landing" (KNL). The results show 2 times better performance on KNL processor.
NASA Astrophysics Data System (ADS)
Fukuzawa, M.; Kawata, K.; Nakamori, N.; Kitsunezuka, Y.
2011-03-01
By real-time visual feedback of 3D scatter diagram of pulsatile tissue-motion, freehand ultrasonic diagnosis of neonatal ischemic diseases has been assisted at the bedside. The 2D ultrasonic movie was taken with a conventional ultrasonic apparatus (ATL HDI5000) and ultrasonic probes of 5-7 MHz with the compact tilt-sensor to measure the probe orientation. The real-time 3D visualization was realized by developing an extended version of the PC-based visualization system. The software was originally developed on the DirectX platform and optimized with the streaming SIMD extensions. The 3D scatter diagram of the latest pulsatile tissues has been continuously generated and visualized as projection image with the ultrasonic movie in the current section more than 15 fps. It revealed the 3D structure of pulsatile tissues such as middle and posterior cerebral arteries, Willis ring and cerebellar arteries, in which pediatricians have great interests in the blood flow because asphyxiated and/or low-birth-weight neonates have a high risk of ischemic diseases such as hypoxic-ischemic encephalopathy and periventricular leukomalacia. Since the pulsatile tissue-motion is due to local blood flow, it can be concluded that the system developed in this work is very useful to assist freehand ultrasonic diagnosis of ischemic diseases in the neonatal cranium.
Viruses vector control proposal: genus Aedes emphasis.
Reis, Nelson Nogueira; Silva, Alcino Lázaro da; Reis, Elma Pereira Guedes; Silva, Flávia Chaves E; Reis, Igor Guedes Nogueira
The dengue fever is a major public health problem in the world. In Brazil, in 2015, there were 1,534,932 cases, being 20,320 cases of severe form, and 811 deaths related to this disease. The distribution of Aedes aegypti, the vector, is extensive. Recently, Zika and Chikungunya viruses had arisen, sharing the same vector as dengue and became a huge public health issue. Without specific treatment, it is urgently required as an effective vector control. This article is focused on reviewing vector control strategies, their effectiveness, viability and economical impact. Among all, the Sterile Insect Technique is highlighted as the best option to be adopted in Brazil, once it is largely effectively used in the USA and Mexico for plagues related to agribusiness. Copyright © 2017 Sociedade Brasileira de Infectologia. Published by Elsevier Editora Ltda. All rights reserved.
NASA Astrophysics Data System (ADS)
Gao, Wei; Zhu, Linli; Wang, Kaiyun
2015-12-01
Ontology, a model of knowledge representation and storage, has had extensive applications in pharmaceutics, social science, chemistry and biology. In the age of “big data”, the constructed concepts are often represented as higher-dimensional data by scholars, and thus the sparse learning techniques are introduced into ontology algorithms. In this paper, based on the alternating direction augmented Lagrangian method, we present an ontology optimization algorithm for ontological sparse vector learning, and a fast version of such ontology technologies. The optimal sparse vector is obtained by an iterative procedure, and the ontology function is then obtained from the sparse vector. Four simulation experiments show that our ontological sparse vector learning model has a higher precision ratio on plant ontology, humanoid robotics ontology, biology ontology and physics education ontology data for similarity measuring and ontology mapping applications.
Re-engineering adenovirus vector systems to enable high-throughput analyses of gene function.
Stanton, Richard J; McSharry, Brian P; Armstrong, Melanie; Tomasec, Peter; Wilkinson, Gavin W G
2008-12-01
With the enhanced capacity of bioinformatics to interrogate extensive banks of sequence data, more efficient technologies are needed to test gene function predictions. Replication-deficient recombinant adenovirus (Ad) vectors are widely used in expression analysis since they provide for extremely efficient expression of transgenes in a wide range of cell types. To facilitate rapid, high-throughput generation of recombinant viruses, we have re-engineered an adenovirus vector (designated AdZ) to allow single-step, directional gene insertion using recombineering technology. Recombineering allows for direct insertion into the Ad vector of PCR products, synthesized sequences, or oligonucleotides encoding shRNAs without requirement for a transfer vector Vectors were optimized for high-throughput applications by making them "self-excising" through incorporating the I-SceI homing endonuclease into the vector removing the need to linearize vectors prior to transfection into packaging cells. AdZ vectors allow genes to be expressed in their native form or with strep, V5, or GFP tags. Insertion of tetracycline operators downstream of the human cytomegalovirus major immediate early (HCMV MIE) promoter permits silencing of transgenes in helper cells expressing the tet repressor thus making the vector compatible with the cloning of toxic gene products. The AdZ vector system is robust, straightforward, and suited to both sporadic and high-throughput applications.
Miller, Stephan W.
1981-01-01
A second set of related problems deals with how this format and other representations of spatial entities, such as vector formats for point and line features, can be interrelated for manipulation, retrieval, and analysis by a spatial database management subsystem. Methods have been developed for interrelating areal data sets in the raster format with point and line data in a vector format and these are described.
A FAST ITERATIVE METHOD FOR SOLVING THE EIKONAL EQUATION ON TRIANGULATED SURFACES*
Fu, Zhisong; Jeong, Won-Ki; Pan, Yongsheng; Kirby, Robert M.; Whitaker, Ross T.
2012-01-01
This paper presents an efficient, fine-grained parallel algorithm for solving the Eikonal equation on triangular meshes. The Eikonal equation, and the broader class of Hamilton–Jacobi equations to which it belongs, have a wide range of applications from geometric optics and seismology to biological modeling and analysis of geometry and images. The ability to solve such equations accurately and efficiently provides new capabilities for exploring and visualizing parameter spaces and for solving inverse problems that rely on such equations in the forward model. Efficient solvers on state-of-the-art, parallel architectures require new algorithms that are not, in many cases, optimal, but are better suited to synchronous updates of the solution. In previous work [W. K. Jeong and R. T. Whitaker, SIAM J. Sci. Comput., 30 (2008), pp. 2512–2534], the authors proposed the fast iterative method (FIM) to efficiently solve the Eikonal equation on regular grids. In this paper we extend the fast iterative method to solve Eikonal equations efficiently on triangulated domains on the CPU and on parallel architectures, including graphics processors. We propose a new local update scheme that provides solutions of first-order accuracy for both architectures. We also propose a novel triangle-based update scheme and its corresponding data structure for efficient irregular data mapping to parallel single-instruction multiple-data (SIMD) processors. We provide detailed descriptions of the implementations on a single CPU, a multicore CPU with shared memory, and SIMD architectures with comparative results against state-of-the-art Eikonal solvers. PMID:22641200
Initialization of Formation Flying Using Primer Vector Theory
NASA Technical Reports Server (NTRS)
Mailhe, Laurie; Schiff, Conrad; Folta, David
2002-01-01
In this paper, we extend primer vector analysis to formation flying. Optimization of the classical rendezvous or free-time transfer problem between two orbits using primer vector theory has been extensively studied for one spacecraft. However, an increasing number of missions are now considering flying a set of spacecraft in close formation. Missions such as the Magnetospheric MultiScale (MMS) and Leonardo-BRDF (Bidirectional Reflectance Distribution Function) need to determine strategies to transfer each spacecraft from the common launch orbit to their respective operational orbit. In addition, all the spacecraft must synchronize their states so that they achieve the same desired formation geometry over each orbit. This periodicity requirement imposes constraints on the boundary conditions that can be used for the primer vector algorithm. In this work we explore the impact of the periodicity requirement in optimizing each spacecraft transfer trajectory using primer vector theory. We first present our adaptation of primer vector theory to formation flying. Using this method, we then compute the AV budget for each spacecraft subject to different formation endpoint constraints.
Applications of lentiviral vectors in molecular imaging.
Chatterjee, Sushmita; De, Abhijit
2014-06-01
Molecular imaging provides the ability of simultaneous visual and quantitative estimation of long term gene expression directly from living organisms. To reveal the kinetics of gene expression by imaging method, often sustained expression of the transgene is required. Lentiviral vectors have been extensively used over last fifteen years for delivery of a transgene in a wide variety of cell types. Lentiviral vectors have the well known advantages such as sustained transgene delivery through stable integration into the host genome, the capability of infecting non-dividing and dividing cells, broad tissue tropism, a reasonably large carrying capacity for delivering therapeutic and reporter gene combinations. Additionally, they do not express viral proteins during transduction, have a potentially safe integration site profile, and a relatively easy system for vector manipulation and infective viral particle production. As a result, lentiviral vector mediated therapeutic and imaging reporter gene delivery to various target organs holds promise for the future treatment. In this review, we have conducted a brief survey of important lentiviral vector developments in diverse biomedical fields including reproductive biology.
Applications and challenges of multivalent recombinant vaccines
Naim, Hussein Y.
2013-01-01
The exceptional discoveries of antigen/gene delivery systems have allowed the development of novel prophylactic and therapeutic vaccine candidates. The vaccine candidates employ various antigen-delivery systems, particularly recombinant viral vectors. Recombinant viral vectors are experimental vaccines similar to DNA vaccines, but they use attenuated viruses or bacterium as a carrier “vector” to introduce microbial DNA to cells of the body. They closely mimic a natural infection and therefore can efficiently stimulate the immune system. Although such recombinant vectors may face extensive preclinical testing and will possibly have to meet stringent regulatory requirements, some of these vectors (e.g. measles virus vectors) may benefit from the profound industrial and clinical experience of the parent vaccine. Most notably, novel vaccines based on live attenuated viruses combine the induction of broad, strong and persistent immune responses with acceptable safety profiles. We assess certain technologies in light of their use against human immunodeficiency virus (HIV). PMID:23249651
Tensor Sparse Coding for Positive Definite Matrices.
Sivalingam, Ravishankar; Boley, Daniel; Morellas, Vassilios; Papanikolopoulos, Nikos
2013-08-02
In recent years, there has been extensive research on sparse representation of vector-valued signals. In the matrix case, the data points are merely vectorized and treated as vectors thereafter (for e.g., image patches). However, this approach cannot be used for all matrices, as it may destroy the inherent structure of the data. Symmetric positive definite (SPD) matrices constitute one such class of signals, where their implicit structure of positive eigenvalues is lost upon vectorization. This paper proposes a novel sparse coding technique for positive definite matrices, which respects the structure of the Riemannian manifold and preserves the positivity of their eigenvalues, without resorting to vectorization. Synthetic and real-world computer vision experiments with region covariance descriptors demonstrate the need for and the applicability of the new sparse coding model. This work serves to bridge the gap between the sparse modeling paradigm and the space of positive definite matrices.
Tensor sparse coding for positive definite matrices.
Sivalingam, Ravishankar; Boley, Daniel; Morellas, Vassilios; Papanikolopoulos, Nikolaos
2014-03-01
In recent years, there has been extensive research on sparse representation of vector-valued signals. In the matrix case, the data points are merely vectorized and treated as vectors thereafter (for example, image patches). However, this approach cannot be used for all matrices, as it may destroy the inherent structure of the data. Symmetric positive definite (SPD) matrices constitute one such class of signals, where their implicit structure of positive eigenvalues is lost upon vectorization. This paper proposes a novel sparse coding technique for positive definite matrices, which respects the structure of the Riemannian manifold and preserves the positivity of their eigenvalues, without resorting to vectorization. Synthetic and real-world computer vision experiments with region covariance descriptors demonstrate the need for and the applicability of the new sparse coding model. This work serves to bridge the gap between the sparse modeling paradigm and the space of positive definite matrices.
Sun, Xun; Lu, You; Bish, Lawrence T; Calcedo, Roberto; Wilson, James M; Gao, Guangping
2010-06-01
Vectors based on several new adeno-associated viral (AAV) serotypes demonstrated strong hepatocyte tropism and transduction efficiency in both small- and large-animal models for liver-directed gene transfer. Efficiency of liver transduction by AAV vectors can be further improved in both murine and nonhuman primate (NHP) animals when the vector genomes are packaged in a self-complementary (sc) format. In an attempt to understand potential molecular mechanism(s) responsible for enhanced transduction efficiency of the sc vector in liver, we performed extensive molecular studies of genome structures of conventional single-stranded (ss) and sc AAV vectors from liver after AAV gene transfer in both mice and NHPs. These included treatment with exonucleases with specific substrate preferences, single-cutter restriction enzyme digestion and polarity-specific hybridization-based vector genome mapping, and bacteriophage phi29 DNA polymerase-mediated and double-stranded circular template-specific rescue of persisted circular genomes. In mouse liver, vector genomes of both genome formats seemed to persist primarily as episomal circular forms, but sc vectors converted into circular forms more rapidly and efficiently. However, the overall differences in vector genome abundance and structure in the liver between ss and sc vectors could not account for the remarkable differences in transduction. Molecular structures of persistent genomes of both ss and sc vectors were significantly more heterogeneous in macaque liver, with noticeable structural rearrangements that warrant further characterizations.
Sun, Xun; Lu, You; Bish, Lawrence T.; Calcedo, Roberto; Wilson, James M.
2010-01-01
Abstract Vectors based on several new adeno-associated viral (AAV) serotypes demonstrated strong hepatocyte tropism and transduction efficiency in both small- and large-animal models for liver-directed gene transfer. Efficiency of liver transduction by AAV vectors can be further improved in both murine and nonhuman primate (NHP) animals when the vector genomes are packaged in a self-complementary (sc) format. In an attempt to understand potential molecular mechanism(s) responsible for enhanced transduction efficiency of the sc vector in liver, we performed extensive molecular studies of genome structures of conventional single-stranded (ss) and sc AAV vectors from liver after AAV gene transfer in both mice and NHPs. These included treatment with exonucleases with specific substrate preferences, single-cutter restriction enzyme digestion and polarity-specific hybridization-based vector genome mapping, and bacteriophage ϕ29 DNA polymerase-mediated and double-stranded circular template-specific rescue of persisted circular genomes. In mouse liver, vector genomes of both genome formats seemed to persist primarily as episomal circular forms, but sc vectors converted into circular forms more rapidly and efficiently. However, the overall differences in vector genome abundance and structure in the liver between ss and sc vectors could not account for the remarkable differences in transduction. Molecular structures of persistent genomes of both ss and sc vectors were significantly more heterogeneous in macaque liver, with noticeable structural rearrangements that warrant further characterizations. PMID:20113166
Lukan, Tjaša; Machens, Fabian; Coll, Anna; Baebler, Špela; Messerschmidt, Katrin; Gruden, Kristina
2018-01-01
Cloning multiple DNA fragments for delivery of several genes of interest into the plant genome is one of the main technological challenges in plant synthetic biology. Despite several modular assembly methods developed in recent years, the plant biotechnology community has not widely adopted them yet, probably due to the lack of appropriate vectors and software tools. Here we present Plant X-tender, an extension of the highly efficient, scar-free and sequence-independent multigene assembly strategy AssemblX, based on overlap-depended cloning methods and rare-cutting restriction enzymes. Plant X-tender consists of a set of plant expression vectors and the protocols for most efficient cloning into the novel vector set needed for plant expression and thus introduces advantages of AssemblX into plant synthetic biology. The novel vector set covers different backbones and selection markers to allow full design flexibility. We have included ccdB counterselection, thereby allowing the transfer of multigene constructs into the novel vector set in a straightforward and highly efficient way. Vectors are available as empty backbones and are fully flexible regarding the orientation of expression cassettes and addition of linkers between them, if required. We optimised the assembly and subcloning protocol by testing different scar-less assembly approaches: the noncommercial SLiCE and TAR methods and the commercial Gibson assembly and NEBuilder HiFi DNA assembly kits. Plant X-tender was applicable even in combination with low efficient homemade chemically competent or electrocompetent Escherichia coli. We have further validated the developed procedure for plant protein expression by cloning two cassettes into the newly developed vectors and subsequently transferred them to Nicotiana benthamiana in a transient expression setup. Thereby we show that multigene constructs can be delivered into plant cells in a streamlined and highly efficient way. Our results will support faster introduction of synthetic biology into plant science.
Machens, Fabian; Coll, Anna; Baebler, Špela; Messerschmidt, Katrin; Gruden, Kristina
2018-01-01
Cloning multiple DNA fragments for delivery of several genes of interest into the plant genome is one of the main technological challenges in plant synthetic biology. Despite several modular assembly methods developed in recent years, the plant biotechnology community has not widely adopted them yet, probably due to the lack of appropriate vectors and software tools. Here we present Plant X-tender, an extension of the highly efficient, scar-free and sequence-independent multigene assembly strategy AssemblX, based on overlap-depended cloning methods and rare-cutting restriction enzymes. Plant X-tender consists of a set of plant expression vectors and the protocols for most efficient cloning into the novel vector set needed for plant expression and thus introduces advantages of AssemblX into plant synthetic biology. The novel vector set covers different backbones and selection markers to allow full design flexibility. We have included ccdB counterselection, thereby allowing the transfer of multigene constructs into the novel vector set in a straightforward and highly efficient way. Vectors are available as empty backbones and are fully flexible regarding the orientation of expression cassettes and addition of linkers between them, if required. We optimised the assembly and subcloning protocol by testing different scar-less assembly approaches: the noncommercial SLiCE and TAR methods and the commercial Gibson assembly and NEBuilder HiFi DNA assembly kits. Plant X-tender was applicable even in combination with low efficient homemade chemically competent or electrocompetent Escherichia coli. We have further validated the developed procedure for plant protein expression by cloning two cassettes into the newly developed vectors and subsequently transferred them to Nicotiana benthamiana in a transient expression setup. Thereby we show that multigene constructs can be delivered into plant cells in a streamlined and highly efficient way. Our results will support faster introduction of synthetic biology into plant science. PMID:29300787
DOE Office of Scientific and Technical Information (OSTI.GOV)
Emami, Razieh; Mukohyama, Shinji; Namba, Ryo
Many models of inflation driven by vector fields alone have been known to be plagued by pathological behaviors, namely ghost and/or gradient instabilities. In this work, we seek a new class of vector-driven inflationary models that evade all of the mentioned instabilities. We build our analysis on the Generalized Proca Theory with an extension to three vector fields to realize isotropic expansion. We obtain the conditions required for quasi de-Sitter solutions to be an attractor analogous to the standard slow-roll one and those for their stability at the level of linearized perturbations. Identifying the remedy to the existing unstable models,more » we provide a simple example and explicitly show its stability. This significantly broadens our knowledge on vector inflationary scenarios, reviving potential phenomenological interests for this class of models.« less
Kataoka, Miho; Tateno, Chise; Yoshizato, Katsutoshi; Kawasaki, Yoshiko; Kimura, Takahiro; Faure-Kumar, Emmanuelle; Palmer, Donna J.; Ng, Philip; Okamura, Haruki; Kasahara, Noriyuki
2010-01-01
Abstract We developed hybrid vectors employing high-capacity adenovirus as a first-stage carrier encoding all the components required for in situ production of a second-stage lentivirus, thereby achieving stable transgene expression in secondary target cells. Such vectors have never previously been tested in normal tissues, because of the scarcity of suitable in vivo systems permissive for second-stage lentivirus assembly. Here we employed a novel murine model in which endogenous liver tissue is extensively reconstituted with engrafted human hepatocytes, and successfully achieved stable transduction by the second-stage lentivirus produced in situ from first-stage adenovirus. This represents the first demonstration of the functionality of adenoviral-lentiviral hybrid vectors in a normal parenchymal organ in vivo. PMID:19725756
Vector Meson Production at Hera
NASA Astrophysics Data System (ADS)
Szuba, Dorota
The diffractive production of vector mesons ep→eVMY, with VM=ρ0, ω, ϕ, J/ψ, ψ‧ or ϒ and with Y being either the scattered proton or a low mass hadronic system, has been extensively investigated at HERA. HERA offers a unique opportunity to study the dependences of diffractive processes on different scales: the mass of the vector meson, mVM, the centre-of-mass energy of the γp system, W, the photon virtuality, Q2 and the four-momentum transfer squared at the proton vertex, |t|. Strong interactions can be investigated in the transition from the hard to the soft regime, where the confinement of quarks and gluons occurs.
Highly-Parallel, Highly-Compact Computing Structures Implemented in Nanotechnology
NASA Technical Reports Server (NTRS)
Crawley, D. G.; Duff, M. J. B.; Fountain, T. J.; Moffat, C. D.; Tomlinson, C. D.
1995-01-01
In this paper, we describe work in which we are evaluating how the evolving properties of nano-electronic devices could best be utilized in highly parallel computing structures. Because of their combination of high performance, low power, and extreme compactness, such structures would have obvious applications in spaceborne environments, both for general mission control and for on-board data analysis. However, the anticipated properties of nano-devices mean that the optimum architecture for such systems is by no means certain. Candidates include single instruction multiple datastream (SIMD) arrays, neural networks, and multiple instruction multiple datastream (MIMD) assemblies.
A sweep algorithm for massively parallel simulation of circuit-switched networks
NASA Technical Reports Server (NTRS)
Gaujal, Bruno; Greenberg, Albert G.; Nicol, David M.
1992-01-01
A new massively parallel algorithm is presented for simulating large asymmetric circuit-switched networks, controlled by a randomized-routing policy that includes trunk-reservation. A single instruction multiple data (SIMD) implementation is described, and corresponding experiments on a 16384 processor MasPar parallel computer are reported. A multiple instruction multiple data (MIMD) implementation is also described, and corresponding experiments on an Intel IPSC/860 parallel computer, using 16 processors, are reported. By exploiting parallelism, our algorithm increases the possible execution rate of such complex simulations by as much as an order of magnitude.
Improving Quantum Gate Simulation using a GPU
NASA Astrophysics Data System (ADS)
Gutierrez, Eladio; Romero, Sergio; Trenas, Maria A.; Zapata, Emilio L.
2008-11-01
Due to the increasing computing power of the graphics processing units (GPU), they are becoming more and more popular when solving general purpose algorithms. As the simulation of quantum computers results on a problem with exponential complexity, it is advisable to perform a parallel computation, such as the one provided by the SIMD multiprocessors present in recent GPUs. In this paper, we focus on an important quantum algorithm, the quantum Fourier transform (QTF), in order to evaluate different parallelization strategies on a novel GPU architecture. Our implementation makes use of the new CUDA software/hardware architecture developed recently by NVIDIA.
NASA Technical Reports Server (NTRS)
Yan, Jerry C.; Jespersen, Dennis; Buning, Peter; Bailey, David (Technical Monitor)
1996-01-01
The Gorden Bell Prizes given out at Supercomputing every year includes at least two catergories: performance (highest GFLOP count) and price-performance (GFLOP/million $$) for real applications. In the past five years, the winners of the price-performance categories all came from networks of work-stations. This reflects three important facts: 1. supercomputers are still too expensive for the masses; 2. achieving high performance for real applications takes real work; and, most importantly; 3. it is possible to obtain acceptable performance for certain real applications on network of work stations. With the continued advance of network technology as well as increased performance of "desktop" workstation, the "Swarm of Ants vs. Herd of Elephants" debate, which began with vector multiprocessors (VPPs) against SIMD type multiprocessors (e.g. CM2), is now recast as VPPs against Symetric Multiprocessors (SMPs, e.g. SGI PowerChallenge). This paper reports on performance studies we performed solving a large scale (2-million grid pt.s) CFD problem involving a Boeing 747 based on a parallel version of OVERFLOW that utilizes message passing on PVM. A performance monitoring tool developed under NASA HPCC, called AIMS, was used to instrument and analyze the the performance data thus obtained. We plan to compare its performance data obtained across a wide spectrum of architectures including: the Cray C90, IBM/SP2, SGI/Power Challenge Cluster, to a group of workstations connected over a simple network. The metrics of comparison includes speed-up, price-performance, throughput, and turn-around time. We also plan to present a plan of attack for various issues that will make the execution of Grand Challenge Applications across the Global Information Infrastructure a reality.
Speeding up tsunami wave propagation modeling
NASA Astrophysics Data System (ADS)
Lavrentyev, Mikhail; Romanenko, Alexey
2014-05-01
Trans-oceanic wave propagation is one of the most time/CPU consuming parts of the tsunami modeling process. The so-called Method Of Splitting Tsunami (MOST) software package, developed at PMEL NOAA USA (Pacific Marine Environmental Laboratory of the National Oceanic and Atmospheric Administration, USA), is widely used to evaluate the tsunami parameters. However, it takes time to simulate trans-ocean wave propagation, that is up to 5 hours CPU time to "drive" the wave from Chili (epicenter) to the coast of Japan (even using a rather coarse computational mesh). Accurate wave height prediction requires fine meshes which leads to dramatic increase in time for simulation. Computation time is among the critical parameter as it takes only about 20 minutes for tsunami wave to approach the coast of Japan after earthquake at Japan trench or Sagami trench (as it was after the Great East Japan Earthquake on March 11, 2011). MOST solves numerically the hyperbolic system for three unknown functions, namely velocity vector and wave height (shallow water approximation). The system could be split into two independent systems by orthogonal directions (splitting method). Each system can be treated independently. This calculation scheme is well suited for SIMD architecture and GPUs as well. We performed adaptation of MOST package to GPU. Several numerical tests showed 40x performance gain for NVIDIA Tesla C2050 GPU vs. single core of Intel i7 processor. Results of numerical experiments were compared with other available simulation data. Calculation results, obtained at GPU, differ from the reference ones by 10^-3 cm of the wave height simulating 24 hours wave propagation. This allows us to speak about possibility to develop real-time system for evaluating tsunami danger.
NASA Astrophysics Data System (ADS)
Gerber, Florian; Mösinger, Kaspar; Furrer, Reinhard
2017-07-01
Software packages for spatial data often implement a hybrid approach of interpreted and compiled programming languages. The compiled parts are usually written in C, C++, or Fortran, and are efficient in terms of computational speed and memory usage. Conversely, the interpreted part serves as a convenient user-interface and calls the compiled code for computationally demanding operations. The price paid for the user friendliness of the interpreted component is-besides performance-the limited access to low level and optimized code. An example of such a restriction is the 64-bit vector support of the widely used statistical language R. On the R side, users do not need to change existing code and may not even notice the extension. On the other hand, interfacing 64-bit compiled code efficiently is challenging. Since many R packages for spatial data could benefit from 64-bit vectors, we investigate strategies to efficiently pass 64-bit vectors to compiled languages. More precisely, we show how to simply extend existing R packages using the foreign function interface to seamlessly support 64-bit vectors. This extension is shown with the sparse matrix algebra R package spam. The new capabilities are illustrated with an example of GIMMS NDVI3g data featuring a parametric modeling approach for a non-stationary covariance matrix.
Determination of key parameters of vector multifractal vector fields
NASA Astrophysics Data System (ADS)
Schertzer, D. J. M.; Tchiguirinskaia, I.
2017-12-01
For too long time, multifractal analyses and simulations have been restricted to scalar-valued fields (Schertzer and Tchiguirinskaia, 2017a,b). For instance, the wind velocity multifractality has been mostly analysed in terms of scalar structure functions and with the scalar energy flux. This restriction has had the unfortunate consequences that multifractals were applicable to their full extent in geophysics, whereas it has inspired them. Indeed a key question in geophysics is the complexity of the interactions between various fields or they components. Nevertheless, sophisticated methods have been developed to determine the key parameters of scalar valued fields. In this communication, we first present the vector extensions of the universal multifractal analysis techniques to multifractals whose generator belong to a Levy-Clifford algebra (Schertzer and Tchiguirinskaia, 2015). We point out further extensions noting the increased complexity. For instance, the (scalar) index of multifractality becomes a matrice. Schertzer, D. and Tchiguirinskaia, I. (2015) `Multifractal vector fields and stochastic Clifford algebra', Chaos: An Interdisciplinary Journal of Nonlinear Science, 25(12), p. 123127. doi: 10.1063/1.4937364. Schertzer, D. and Tchiguirinskaia, I. (2017) `An Introduction to Multifractals and Scale Symmetry Groups', in Ghanbarian, B. and Hunt, A. (eds) Fractals: Concepts and Applications in Geosciences. CRC Press, p. (in press). Schertzer, D. and Tchiguirinskaia, I. (2017b) `Pandora Box of Multifractals: Barely Open ?', in Tsonis, A. A. (ed.) 30 Years of Nonlinear Dynamics in Geophysics. Berlin: Springer, p. (in press).
Unification with vector-like fermions and signals at LHC
NASA Astrophysics Data System (ADS)
Bhattacherjee, Biplob; Byakti, Pritibhajan; Kushwaha, Ashwani; Vempati, Sudhir K.
2018-05-01
We look for minimal extensions of Standard Model with vector like fermions leading to precision unification of gauge couplings. Constraints from proton decay, Higgs stability and perturbativity are considered. The simplest models contain several copies of vector fermions in two different (incomplete) representations. Some of these models encompass Type III seesaw mechanism for neutrino masses whereas some others have a dark matter candidate. In all the models, at least one of the candidates has non-trivial representation under SU(3)color. In the limit of vanishing Yukawa couplings, new QCD bound states are formed, which can be probed at LHC. The present limits based on results from 13 TeV already probe these particles for masses around a TeV. Similar models can be constructed with three or four vector representations, examples of which are presented.
Bayesian data assimilation provides rapid decision support for vector-borne diseases
Jewell, Chris P.; Brown, Richard G.
2015-01-01
Predicting the spread of vector-borne diseases in response to incursions requires knowledge of both host and vector demographics in advance of an outbreak. Although host population data are typically available, for novel disease introductions there is a high chance of the pathogen using a vector for which data are unavailable. This presents a barrier to estimating the parameters of dynamical models representing host–vector–pathogen interaction, and hence limits their ability to provide quantitative risk forecasts. The Theileria orientalis (Ikeda) outbreak in New Zealand cattle demonstrates this problem: even though the vector has received extensive laboratory study, a high degree of uncertainty persists over its national demographic distribution. Addressing this, we develop a Bayesian data assimilation approach whereby indirect observations of vector activity inform a seasonal spatio-temporal risk surface within a stochastic epidemic model. We provide quantitative predictions for the future spread of the epidemic, quantifying uncertainty in the model parameters, case infection times and the disease status of undetected infections. Importantly, we demonstrate how our model learns sequentially as the epidemic unfolds and provide evidence for changing epidemic dynamics through time. Our approach therefore provides a significant advance in rapid decision support for novel vector-borne disease outbreaks. PMID:26136225
Geospace simulations using modern accelerator processor technology
NASA Astrophysics Data System (ADS)
Germaschewski, K.; Raeder, J.; Larson, D. J.
2009-12-01
OpenGGCM (Open Geospace General Circulation Model) is a well-established numerical code simulating the Earth's space environment. The most computing intensive part is the MHD (magnetohydrodynamics) solver that models the plasma surrounding Earth and its interaction with Earth's magnetic field and the solar wind flowing in from the sun. Like other global magnetosphere codes, OpenGGCM's realism is currently limited by computational constraints on grid resolution. OpenGGCM has been ported to make use of the added computational powerof modern accelerator based processor architectures, in particular the Cell processor. The Cell architecture is a novel inhomogeneous multicore architecture capable of achieving up to 230 GFLops on a single chip. The University of New Hampshire recently acquired a PowerXCell 8i based computing cluster, and here we will report initial performance results of OpenGGCM. Realizing the high theoretical performance of the Cell processor is a programming challenge, though. We implemented the MHD solver using a multi-level parallelization approach: On the coarsest level, the problem is distributed to processors based upon the usual domain decomposition approach. Then, on each processor, the problem is divided into 3D columns, each of which is handled by the memory limited SPEs (synergistic processing elements) slice by slice. Finally, SIMD instructions are used to fully exploit the SIMD FPUs in each SPE. Memory management needs to be handled explicitly by the code, using DMA to move data from main memory to the per-SPE local store and vice versa. We use a modern technique, automatic code generation, which shields the application programmer from having to deal with all of the implementation details just described, keeping the code much more easily maintainable. Our preliminary results indicate excellent performance, a speed-up of a factor of 30 compared to the unoptimized version.
NASA Astrophysics Data System (ADS)
Poya, Roman; Gil, Antonio J.; Ortigosa, Rogelio
2017-07-01
The paper presents aspects of implementation of a new high performance tensor contraction framework for the numerical analysis of coupled and multi-physics problems on streaming architectures. In addition to explicit SIMD instructions and smart expression templates, the framework introduces domain specific constructs for the tensor cross product and its associated algebra recently rediscovered by Bonet et al. (2015, 2016) in the context of solid mechanics. The two key ingredients of the presented expression template engine are as follows. First, the capability to mathematically transform complex chains of operations to simpler equivalent expressions, while potentially avoiding routes with higher levels of computational complexity and, second, to perform a compile time depth-first or breadth-first search to find the optimal contraction indices of a large tensor network in order to minimise the number of floating point operations. For optimisations of tensor contraction such as loop transformation, loop fusion and data locality optimisations, the framework relies heavily on compile time technologies rather than source-to-source translation or JIT techniques. Every aspect of the framework is examined through relevant performance benchmarks, including the impact of data parallelism on the performance of isomorphic and nonisomorphic tensor products, the FLOP and memory I/O optimality in the evaluation of tensor networks, the compilation cost and memory footprint of the framework and the performance of tensor cross product kernels. The framework is then applied to finite element analysis of coupled electro-mechanical problems to assess the speed-ups achieved in kernel-based numerical integration of complex electroelastic energy functionals. In this context, domain-aware expression templates combined with SIMD instructions are shown to provide a significant speed-up over the classical low-level style programming techniques.
Parasail: SIMD C library for global, semi-global, and local pairwise sequence alignments.
Daily, Jeff
2016-02-10
Sequence alignment algorithms are a key component of many bioinformatics applications. Though various fast Smith-Waterman local sequence alignment implementations have been developed for x86 CPUs, most are embedded into larger database search tools. In addition, fast implementations of Needleman-Wunsch global sequence alignment and its semi-global variants are not as widespread. This article presents the first software library for local, global, and semi-global pairwise intra-sequence alignments and improves the performance of previous intra-sequence implementations. A faster intra-sequence local pairwise alignment implementation is described and benchmarked, including new global and semi-global variants. Using a 375 residue query sequence a speed of 136 billion cell updates per second (GCUPS) was achieved on a dual Intel Xeon E5-2670 24-core processor system, the highest reported for an implementation based on Farrar's 'striped' approach. Rognes's SWIPE optimal database search application is still generally the fastest available at 1.2 to at best 2.4 times faster than Parasail for sequences shorter than 500 amino acids. However, Parasail was faster for longer sequences. For global alignments, Parasail's prefix scan implementation is generally the fastest, faster even than Farrar's 'striped' approach, however the opal library is faster for single-threaded applications. The software library is designed for 64 bit Linux, OS X, or Windows on processors with SSE2, SSE41, or AVX2. Source code is available from https://github.com/jeffdaily/parasail under the Battelle BSD-style license. Applications that require optimal alignment scores could benefit from the improved performance. For the first time, SIMD global, semi-global, and local alignments are available in a stand-alone C library.
2014-01-01
Background Because of relatively small treatment numbers together with low adverse drug reaction (ADR) reporting rates the timely identification of ADRs affecting children and young people is problematic. The primary objective of this study was to assess the utility of unplanned medication discontinuation as a signal for possible ADRs in children and young people. Methods Using orlistat as an exemplar, all orlistat prescriptions issued to patients up to 18 years of age together with patient characteristics, prescription duration, co-prescribed medicines and recorded clinical (Read) codes were identified from the Primary Care Informatics Unit database between 1st Jan 2006-30th Nov 2009. Binary logistic regression was used to assess association between characteristics and discontinuation. Results During the study period, 79 patients were prescribed orlistat (81% female, median age 17 years). Unplanned medication discontinuation rates for orlistat were 52% and 77% at 1 and 3-months. Almost 20% of patients were co-prescribed an anti-depressant. One month unplanned medication discontinuation was significantly lower in the least deprived group (SIMD 1–2 compared to SIMD 9–10 OR 0.09 (95% CI0.01 – 0.83)) and those co-prescribed at least one other medication. At 3 months, discontinuation was higher in young people (≥17 yr versus, OR 3.07 (95% CI1.03 – 9.14)). Read codes were recorded for digestive, respiratory and urinary symptoms around the time of discontinuation for 24% of patients. Urinary retention was reported for 7.6% of patients. Conclusions Identification of unplanned medication discontinuation using large primary care datasets may be a useful tool for pharmacovigilance signal generation and detection of potential ADRs in children and young people. PMID:24594374
Park, Andrew W; Cleveland, Christopher A; Dallas, Tad A; Corn, Joseph L
2016-06-01
Although many parasites are transmitted between hosts by a suite of arthropod vectors, the impact of vector biodiversity on parasite transmission is poorly understood. Positive relationships between host infection prevalence and vector species richness (SR) may operate through multiple mechanisms, including (i) increased vector abundance, (ii) a sampling effect in which species of high vectorial capacity are more likely to occur in species-rich communities, and (iii) functional diversity whereby communities comprised species with distinct phenologies may extend the duration of seasonal transmission. Teasing such mechanisms apart is impeded by a lack of appropriate data, yet could highlight a neglected role for functional diversity in parasite transmission. We used statistical modelling of extensive host, vector and microparasite data to test the hypothesis that functional diversity leading to longer seasonal transmission explained variable levels of disease in a wildlife population. We additionally developed a simple transmission model to guide our expectation of how an increased transmission season translates to infection prevalence. Our study demonstrates that vector SR is associated with increased levels of disease reporting, but not via increases in vector abundance or via a sampling effect. Rather, the relationship operates by extending the length of seasonal transmission, in line with theoretical predictions.
Bayesian data assimilation provides rapid decision support for vector-borne diseases.
Jewell, Chris P; Brown, Richard G
2015-07-06
Predicting the spread of vector-borne diseases in response to incursions requires knowledge of both host and vector demographics in advance of an outbreak. Although host population data are typically available, for novel disease introductions there is a high chance of the pathogen using a vector for which data are unavailable. This presents a barrier to estimating the parameters of dynamical models representing host-vector-pathogen interaction, and hence limits their ability to provide quantitative risk forecasts. The Theileria orientalis (Ikeda) outbreak in New Zealand cattle demonstrates this problem: even though the vector has received extensive laboratory study, a high degree of uncertainty persists over its national demographic distribution. Addressing this, we develop a Bayesian data assimilation approach whereby indirect observations of vector activity inform a seasonal spatio-temporal risk surface within a stochastic epidemic model. We provide quantitative predictions for the future spread of the epidemic, quantifying uncertainty in the model parameters, case infection times and the disease status of undetected infections. Importantly, we demonstrate how our model learns sequentially as the epidemic unfolds and provide evidence for changing epidemic dynamics through time. Our approach therefore provides a significant advance in rapid decision support for novel vector-borne disease outbreaks. © 2015 The Author(s) Published by the Royal Society. All rights reserved.
Haut, Larissa H; Gill, Amanda L; Kurupati, Raj K; Bian, Ang; Li, Yan; Giles-Davis, Wynetta; Xiang, Zhiquan; Zhou, Xiang Yang; Ertl, Hildegund C J
2016-10-01
Adenovirus (Ad) is used extensively for construction of viral vectors, most commonly with deletion in its E1 and/or E3 genomic regions. Previously, our attempts to insert envelope proteins (Env) of HIV-1 into such vectors based on chimpanzee-derived Ad (AdC) viruses were thwarted. Here, we describe that genetic instability of an E1- and E3-deleted AdC vector of serotype C6 expressing Env of HIV-1 can be overcome by reinsertion of E3 sequences with anti-apoptotic activities. This partial E3 deletion presumably delays premature death of HEK-293 packaging cell lines due to Env-induced cell apoptosis. The same partial E3 deletion also allows for the generation of stable glycoprotein 140 (gp140)- and gp160-expressing Ad vectors based on AdC7, a distinct AdC serotype. Env-expressing AdC vectors containing the partial E3 deletion are genetically stable upon serial cell culture passaging, produce yields comparable to those of other AdC vectors, and induce transgene product-specific antibody responses in mice. A partial E3 deletion thereby allows expansion of the repertoire of transgenes that can be expressed by Ad vectors.
Bezodis, Neil E; North, Jamie S; Razavet, Jane L
2017-09-01
A more horizontally oriented ground reaction force vector is related to higher levels of sprint acceleration performance across a range of athletes. However, the effects of acute experimental alterations to the force vector orientation within athletes are unknown. Fifteen male team sports athletes completed maximal effort 10-m accelerations in three conditions following different verbal instructions intended to manipulate the force vector orientation. Ground reaction forces (GRFs) were collected from the step nearest 5-m and stance leg kinematics at touchdown were also analysed to understand specific kinematic features of touchdown technique which may influence the consequent force vector orientation. Magnitude-based inferences were used to compare findings between conditions. There was a likely more horizontally oriented ground reaction force vector and a likely lower peak vertical force in the control condition compared with the experimental conditions. 10-m sprint time was very likely quickest in the control condition which confirmed the importance of force vector orientation for acceleration performance on a within-athlete basis. The stance leg kinematics revealed that a more horizontally oriented force vector during stance was preceded at touchdown by a likely more dorsiflexed ankle, a likely more flexed knee, and a possibly or likely greater hip extension velocity.
Search for charged lepton flavor violation of vector mesons in the BLMSSM model
NASA Astrophysics Data System (ADS)
Dong, Xing-Xing; Zhao, Shu-Min; Feng, Jing-Jing; Ning, Guo-Zhu; Chen, Jian-Bin; Zhang, Hai-Bin; Feng, Tai-Fu
2018-03-01
We analyze the charged lepton flavor violating (CLFV) decays of vector mesons V →li±lj∓ with V ∈{ϕ ,J /Ψ ,ϒ ,ρ0,ω } in the BLMSSM model. This new model is introduced as a supersymmetric extension of the Standard Model (SM), where local gauged baryon number B and lepton number L are considered. The numerical results indicate the BLMSSM model can produce significant contributions to such two-body CLFV decays, and the branching ratios to these CLFV processes can easily reach the present experimental upper bounds. Therefore, searching for CLFV processes of vector mesons may be an effective channel to study new physics.
New vector-like fermions and flavor physics
Ishiwata, Koji; Ligeti, Zoltan; Wise, Mark B.
2015-10-06
We study renormalizable extensions of the standard model that contain vector-like fermions in a (single) complex representation of the standard model gauge group. There are 11 models where the vector-like fermions Yukawa couple to the standard model fermions via the Higgs field. These models do not introduce additional fine-tunings. They can lead to, and are constrained by, a number of different flavor-changing processes involving leptons and quarks, as well as direct searches. An interesting feature of the models with strongly interacting vector-like fermions is that constraints from neutral meson mixings (apart from CP violation inmore » $$ {K}^0-{\\overline{K}}^0 $$ mixing) are not sensitive to higher scales than other flavor-changing neutral-current processes. We identify order 1/(4πM) 2 (where M is the vector-like fermion mass) one-loop contributions to the coefficients of the four-quark operators for meson mixing, that are not suppressed by standard model quark masses and/or mixing angles.« less
1985-12-01
mentioned project whose objective was to produce 0DIST~i8LT1,vAAILABILITr OF ABSTRACT 21 ABSTRACT SEC R.ITY CLASSiF CATION ~ .~ C.,NCLASSIFIEDI’.,NLMITED M ...wave propagation vector m . Thl-; -’esns that, f we wnnt to perform the tv-o-lirensional inverse 7’,urier ’ransformar i7! (to transform from i-space...nropaqition vector ~,which was used extensively in the -’-i-al npnro)arh, is still retained in the new approach. It is used in nodellin" m . if
De Rocco, Davide; Pompili, Barbara; Castellani, Stefano; Morini, Elena; Cavinato, Luca; Cimino, Giuseppe; Mariggiò, Maria A; Guarnieri, Simone; Conese, Massimo; Del Porto, Paola; Ascenzioni, Fiorentina
2018-04-17
Improving the efficacy of gene therapy vectors is still an important goal toward the development of safe and efficient gene therapy treatments. S/MAR (scaffold/matrix attached region)-based vectors are maintained extra-chromosomally in numerous cell types, which is similar to viral-based vectors. Additionally, when established as an episome, they show a very high mitotic stability. In the present study we tested the idea that addition of an S/MAR element to a CFTR (cystic fibrosis transmembrane conductance regulator) expression vector, may allow the establishment of a CFTR episome in bronchial epithelial cells. Starting from the observation that the S/MAR vector pEPI-EGFP (enhanced green fluorescence protein) is maintained as an episome in human bronchial epithelial cells, we assembled the CFTR vector pBQ-S/MAR. This vector, transfected in bronchial epithelial cells with mutated CFTR , supported long term wt CFTR expression and activity, which in turn positively impacted on the assembly of tight junctions in polarized epithelial cells. Additionally, the recovery of intact pBQ-S/MAR, but not the parental vector lacking the S/MAR element, from transfected cells after extensive proliferation, strongly suggested that pBQ-S/MAR was established as an episome. These results add a new element, the S/MAR, that can be considered to improve the persistence and safety of gene therapy vectors for cystic fibrosis pulmonary disease.
NASA Astrophysics Data System (ADS)
Ettestad, David; Carbonara, Joaquin
The Sierpinski Triangle (ST) is a fractal which has Haussdorf dimension log23 ≈ 1.585 that has been studied extensively. In this paper, we introduce the Sierpinski Triangle Plane (STP), an infinite extension of the ST that spans the entire real plane but is not a vector subspace or a tiling of the plane with a finite set of STs. STP is shown to be a radial fractal with many interesting and surprising properties.
Distance learning in discriminative vector quantization.
Schneider, Petra; Biehl, Michael; Hammer, Barbara
2009-10-01
Discriminative vector quantization schemes such as learning vector quantization (LVQ) and extensions thereof offer efficient and intuitive classifiers based on the representation of classes by prototypes. The original methods, however, rely on the Euclidean distance corresponding to the assumption that the data can be represented by isotropic clusters. For this reason, extensions of the methods to more general metric structures have been proposed, such as relevance adaptation in generalized LVQ (GLVQ) and matrix learning in GLVQ. In these approaches, metric parameters are learned based on the given classification task such that a data-driven distance measure is found. In this letter, we consider full matrix adaptation in advanced LVQ schemes. In particular, we introduce matrix learning to a recent statistical formalization of LVQ, robust soft LVQ, and we compare the results on several artificial and real-life data sets to matrix learning in GLVQ, a derivation of LVQ-like learning based on a (heuristic) cost function. In all cases, matrix adaptation allows a significant improvement of the classification accuracy. Interestingly, however, the principled behavior of the models with respect to prototype locations and extracted matrix dimensions shows several characteristic differences depending on the data sets.
Remote sensing and environment in the study of the malaria vector Anopheles gambiae in Mali
NASA Astrophysics Data System (ADS)
Rian, Sigrid Katrine Eivindsdatter
The malaria mosquito Anopheles gambiae is the most important vector for the most devastating form of human malaria, the parasite Plasmodium falciparum. In-depth knowledge of the vector's history and environmental preferences is essential in the pursuit of new malaria mitigation strategies. Research was conducted in Mali across a range of habitats occupied by the vector, focusing on three identified chromosomal forms in the mosquito complex. The development of a 500-m landcover classification map was carried out using MODIS satellite imagery and extensive ground survey. The resulting product has the highest resolution and is the most up-to-date and most extensively ground-surveyed among land-cover maps for the study region. The new landcover classification product is a useful tool in the mapping of the varying ecological preferences of the different An. gambiae chromosomal forms. Climate and vegetation characteristics and their relationship to chromosomal forms were investigated further along a Southwest-Northeast moisture gradient in Mali. This research demonstrates particular ecological preferences of each chromosomal form, and gives a detailed examination of particular vegetation structural and climatological patterns across the study region. A key issue in current research into the population structure of An. gambiae is speciation and evolution in the complex, as an understanding of the mechanisms of change can help in the development of new mitigation strategies. A historical review of the paleoecology, archaeology, and other historical sources intended to shed light on the evolutionary history of the vector is presented. The generally held assumption that the current breed of An. gambiae emerged in the rainforest is called into question and discussed within the framework of paleoenvironment and human expansions in sub-Saharan West Africa.
Rank-Optimized Logistic Matrix Regression toward Improved Matrix Data Classification.
Zhang, Jianguang; Jiang, Jianmin
2018-02-01
While existing logistic regression suffers from overfitting and often fails in considering structural information, we propose a novel matrix-based logistic regression to overcome the weakness. In the proposed method, 2D matrices are directly used to learn two groups of parameter vectors along each dimension without vectorization, which allows the proposed method to fully exploit the underlying structural information embedded inside the 2D matrices. Further, we add a joint [Formula: see text]-norm on two parameter matrices, which are organized by aligning each group of parameter vectors in columns. This added co-regularization term has two roles-enhancing the effect of regularization and optimizing the rank during the learning process. With our proposed fast iterative solution, we carried out extensive experiments. The results show that in comparison to both the traditional tensor-based methods and the vector-based regression methods, our proposed solution achieves better performance for matrix data classifications.
Conditional Entropy-Constrained Residual VQ with Application to Image Coding
NASA Technical Reports Server (NTRS)
Kossentini, Faouzi; Chung, Wilson C.; Smith, Mark J. T.
1996-01-01
This paper introduces an extension of entropy-constrained residual vector quantization (VQ) where intervector dependencies are exploited. The method, which we call conditional entropy-constrained residual VQ, employs a high-order entropy conditioning strategy that captures local information in the neighboring vectors. When applied to coding images, the proposed method is shown to achieve better rate-distortion performance than that of entropy-constrained residual vector quantization with less computational complexity and lower memory requirements. Moreover, it can be designed to support progressive transmission in a natural way. It is also shown to outperform some of the best predictive and finite-state VQ techniques reported in the literature. This is due partly to the joint optimization between the residual vector quantizer and a high-order conditional entropy coder as well as the efficiency of the multistage residual VQ structure and the dynamic nature of the prediction.
Model-based vision using geometric hashing
NASA Astrophysics Data System (ADS)
Akerman, Alexander, III; Patton, Ronald
1991-04-01
The Geometric Hashing technique developed by the NYU Courant Institute has been applied to various automatic target recognition applications. In particular, I-MATH has extended the hashing algorithm to perform automatic target recognition ofsynthetic aperture radar (SAR) imagery. For this application, the hashing is performed upon the geometric locations of dominant scatterers. In addition to being a robust model-based matching algorithm -- invariant under translation, scale, and 3D rotations of the target -- hashing is of particular utility because it can still perform effective matching when the target is partially obscured. Moreover, hashing is very amenable to a SIMD parallel processing architecture, and thus potentially realtime implementable.
Parallel processors and nonlinear structural dynamics algorithms and software
NASA Technical Reports Server (NTRS)
Belytschko, Ted; Gilbertsen, Noreen D.; Neal, Mark O.; Plaskacz, Edward J.
1989-01-01
The adaptation of a finite element program with explicit time integration to a massively parallel SIMD (single instruction multiple data) computer, the CONNECTION Machine is described. The adaptation required the development of a new algorithm, called the exchange algorithm, in which all nodal variables are allocated to the element with an exchange of nodal forces at each time step. The architectural and C* programming language features of the CONNECTION Machine are also summarized. Various alternate data structures and associated algorithms for nonlinear finite element analysis are discussed and compared. Results are presented which demonstrate that the CONNECTION Machine is capable of outperforming the CRAY XMP/14.
Fast and accurate de novo genome assembly from long uncorrected reads
Vaser, Robert; Sović, Ivan; Nagarajan, Niranjan
2017-01-01
The assembly of long reads from Pacific Biosciences and Oxford Nanopore Technologies typically requires resource-intensive error-correction and consensus-generation steps to obtain high-quality assemblies. We show that the error-correction step can be omitted and that high-quality consensus sequences can be generated efficiently with a SIMD-accelerated, partial-order alignment–based, stand-alone consensus module called Racon. Based on tests with PacBio and Oxford Nanopore data sets, we show that Racon coupled with miniasm enables consensus genomes with similar or better quality than state-of-the-art methods while being an order of magnitude faster. PMID:28100585
Serial multiplier arrays for parallel computation
NASA Technical Reports Server (NTRS)
Winters, Kel
1990-01-01
Arrays of systolic serial-parallel multiplier elements are proposed as an alternative to conventional SIMD mesh serial adder arrays for applications that are multiplication intensive and require few stored operands. The design and operation of a number of multiplier and array configurations featuring locality of connection, modularity, and regularity of structure are discussed. A design methodology combining top-down and bottom-up techniques is described to facilitate development of custom high-performance CMOS multiplier element arrays as well as rapid synthesis of simulation models and semicustom prototype CMOS components. Finally, a differential version of NORA dynamic circuits requiring a single-phase uncomplemented clock signal introduced for this application.
Special-purpose computing for dense stellar systems
NASA Astrophysics Data System (ADS)
Makino, Junichiro
2007-08-01
I'll describe the current status of the GRAPE-DR project. The GRAPE-DR is the next-generation hardware for N-body simulation. Unlike the previous GRAPE hardwares, it is programmable SIMD machine with a large number of simple processors integrated into a single chip. The GRAPE-DR chip consists of 512 simple processors and operates at the clock speed of 500 MHz, delivering the theoretical peak speed of 512/226 Gflops (single/double precision). As of August 2006, the first prototype board with the sample chip successfully passed the test we prepared. The full GRAPE-DR system will consist of 4096 chips, reaching the theoretical peak speed of 2 Pflops.
Hu, Wenjun; Chung, Fu-Lai; Wang, Shitong
2012-03-01
Although pattern classification has been extensively studied in the past decades, how to effectively solve the corresponding training on large datasets is a problem that still requires particular attention. Many kernelized classification methods, such as SVM and SVDD, can be formulated as the corresponding quadratic programming (QP) problems, but computing the associated kernel matrices requires O(n2)(or even up to O(n3)) computational complexity, where n is the size of the training patterns, which heavily limits the applicability of these methods for large datasets. In this paper, a new classification method called the maximum vector-angular margin classifier (MAMC) is first proposed based on the vector-angular margin to find an optimal vector c in the pattern feature space, and all the testing patterns can be classified in terms of the maximum vector-angular margin ρ, between the vector c and all the training data points. Accordingly, it is proved that the kernelized MAMC can be equivalently formulated as the kernelized Minimum Enclosing Ball (MEB), which leads to a distinctive merit of MAMC, i.e., it has the flexibility of controlling the sum of support vectors like v-SVC and may be extended to a maximum vector-angular margin core vector machine (MAMCVM) by connecting the core vector machine (CVM) method with MAMC such that the corresponding fast training on large datasets can be effectively achieved. Experimental results on artificial and real datasets are provided to validate the power of the proposed methods. Copyright © 2011 Elsevier Ltd. All rights reserved.
Dark matter phenomenology of SM and enlarged Higgs sectors extended with vector-like leptons
NASA Astrophysics Data System (ADS)
Angelescu, Andrei; Arcadi, Giorgio
2017-07-01
We will investigate the scenario in which the Standard Model (SM) Higgs sector and its two-doublet extension (called the Two Higgs Doublet Model or 2HDM) are the "portal" for the interactions between the Standard Model and a fermionic Dark Matter (DM) candidate. The latter is the lightest stable neutral particle of a family of vector-like leptons (VLLs). We will provide an extensive overview of this scenario combining the constraints coming purely from DM phenomenology with more general constraints like Electroweak Precision Test (EWPT) as well as with collider searches. In the case that the new fermionic sector interacts with the SM Higgs sector, constraints from DM phenomenology force the new states to lie above the TeV scale. This requirement is relaxed in the case of 2HDM. Nevertheless, strong constraints coming from EWPTs and the Renormalization Group Equations (RGEs) limit the impact of VLFs on collider phenomenology.
Dark matter phenomenology of SM and enlarged Higgs sectors extended with vector-like leptons.
Angelescu, Andrei; Arcadi, Giorgio
2017-01-01
We will investigate the scenario in which the Standard Model (SM) Higgs sector and its two-doublet extension (called the Two Higgs Doublet Model or 2HDM) are the "portal" for the interactions between the Standard Model and a fermionic Dark Matter (DM) candidate. The latter is the lightest stable neutral particle of a family of vector-like leptons (VLLs). We will provide an extensive overview of this scenario combining the constraints coming purely from DM phenomenology with more general constraints like Electroweak Precision Test (EWPT) as well as with collider searches. In the case that the new fermionic sector interacts with the SM Higgs sector, constraints from DM phenomenology force the new states to lie above the TeV scale. This requirement is relaxed in the case of 2HDM. Nevertheless, strong constraints coming from EWPTs and the Renormalization Group Equations (RGEs) limit the impact of VLFs on collider phenomenology.
Moghaddasi, Hanie; Nourian, Saeed
2016-06-01
Heart disease is the major cause of death as well as a leading cause of disability in the developed countries. Mitral Regurgitation (MR) is a common heart disease which does not cause symptoms until its end stage. Therefore, early diagnosis of the disease is of crucial importance in the treatment process. Echocardiography is a common method of diagnosis in the severity of MR. Hence, a method which is based on echocardiography videos, image processing techniques and artificial intelligence could be helpful for clinicians, especially in borderline cases. In this paper, we introduce novel features to detect micro-patterns of echocardiography images in order to determine the severity of MR. Extensive Local Binary Pattern (ELBP) and Extensive Volume Local Binary Pattern (EVLBP) are presented as image descriptors which include details from different viewpoints of the heart in feature vectors. Support Vector Machine (SVM), Linear Discriminant Analysis (LDA) and Template Matching techniques are used as classifiers to determine the severity of MR based on textural descriptors. The SVM classifier with Extensive Uniform Local Binary Pattern (ELBPU) and Extensive Volume Local Binary Pattern (EVLBP) have the best accuracy with 99.52%, 99.38%, 99.31% and 99.59%, respectively, for the detection of Normal, Mild MR, Moderate MR and Severe MR subjects among echocardiography videos. The proposed method achieves 99.38% sensitivity and 99.63% specificity for the detection of the severity of MR and normal subjects. Copyright © 2016 Elsevier Ltd. All rights reserved.
Advances in the development of bacterial vector technology.
Kochi, Sims K; Killeen, Kevin P; Ryan, Una S
2003-02-01
The demand for new and improved vaccines against human diseases has continued unabated over the past century. While the need continues for traditional vaccines in areas such as infectious diseases, there is an increasing demand for new therapies in nontraditional areas, such as cancer treatment, bioterrorism and food safety. Prompted by these changes, there has been a renewed interest in the application and development of live, attenuated bacteria expressing foreign antigens as vaccines. The application of bacterial vector vaccines to human maladies has been studied most extensively in attenuted strains of Salmonella. Live, attenuated strains of Shigella, Listeria monocytogenes, Mycobacterium bovis-BCG and Vibrio cholerae provide unique alternatives in terms of antigen delivery and immune presentation, however and also show promise as potentially useful bacterial vectors.
Dual linear structured support vector machine tracking method via scale correlation filter
NASA Astrophysics Data System (ADS)
Li, Weisheng; Chen, Yanquan; Xiao, Bin; Feng, Chen
2018-01-01
Adaptive tracking-by-detection methods based on structured support vector machine (SVM) performed well on recent visual tracking benchmarks. However, these methods did not adopt an effective strategy of object scale estimation, which limits the overall tracking performance. We present a tracking method based on a dual linear structured support vector machine (DLSSVM) with a discriminative scale correlation filter. The collaborative tracker comprised of a DLSSVM model and a scale correlation filter obtains good results in tracking target position and scale estimation. The fast Fourier transform is applied for detection. Extensive experiments show that our tracking approach outperforms many popular top-ranking trackers. On a benchmark including 100 challenging video sequences, the average precision of the proposed method is 82.8%.
Immune Recognition of Gene Transfer Vectors: Focus on Adenovirus as a Paradigm
Aldhamen, Yasser Ali; Seregin, Sergey S.; Amalfitano, Andrea
2011-01-01
Recombinant Adenovirus (Ad) based vectors have been utilized extensively as a gene transfer platform in multiple pre-clinical and clinical applications. These applications are numerous, and inclusive of both gene therapy and vaccine based approaches to human or animal diseases. The widespread utilization of these vectors in both animal models, as well as numerous human clinical trials (Ad-based vectors surpass all other gene transfer vectors relative to numbers of patients treated, as well as number of clinical trials overall), has shed light on how this virus vector interacts with both the innate and adaptive immune systems. The ability to generate and administer large amounts of this vector likely contributes not only to their ability to allow for highly efficient gene transfer, but also their elicitation of host immune responses to the vector and/or the transgene the vector expresses in vivo. These facts, coupled with utilization of several models that allow for full detection of these responses has predicted several observations made in human trials, an important point as lack of similar capabilities by other vector systems may prevent detection of such responses until only after human trials are initiated. Finally, induction of innate or adaptive immune responses by Ad vectors may be detrimental in one setting (i.e., gene therapy) and be entirely beneficial in another (i.e., prophylactic or therapeutic vaccine based applications). Herein, we review the current understanding of innate and adaptive immune responses to Ad vectors, as well some recent advances that attempt to capitalize on this understanding so as to further broaden the safe and efficient use of Ad-based gene transfer therapies in general. PMID:22566830
Emergence and Prevalence of Human Vector-Borne Diseases in Sink Vector Populations
Rascalou, Guilhem; Pontier, Dominique; Menu, Frédéric; Gourbière, Sébastien
2012-01-01
Vector-borne diseases represent a major public health concern in most tropical and subtropical areas, and an emerging threat for more developed countries. Our understanding of the ecology, evolution and control of these diseases relies predominantly on theory and data on pathogen transmission in large self-sustaining ‘source’ populations of vectors representative of highly endemic areas. However, there are numerous places where environmental conditions are less favourable to vector populations, but where immigration allows them to persist. We built an epidemiological model to investigate the dynamics of six major human vector borne-diseases in such non self-sustaining ‘sink’ vector populations. The model was parameterized through a review of the literature, and we performed extensive sensitivity analysis to look at the emergence and prevalence of the pathogen that could be encountered in these populations. Despite the low vector abundance in typical sink populations, all six human diseases were able to spread in 15–55% of cases after accidental introduction. The rate of spread was much more strongly influenced by vector longevity, immigration and feeding rates, than by transmission and virulence of the pathogen. Prevalence in humans remained lower than 5% for dengue, leishmaniasis and Japanese encephalitis, but substantially higher for diseases with longer duration of infection; malaria and the American and African trypanosomiasis. Vector-related parameters were again the key factors, although their influence was lower than on pathogen emergence. Our results emphasize the need for ecology and evolution to be thought in the context of metapopulations made of a mosaic of sink and source habitats, and to design vector control program not only targeting areas of high vector density, but working at a larger spatial scale. PMID:22629337
Water deficit enhances the transmission of plant viruses by insect vectors
Yvon, Michel; Vile, Denis; Dader, Beatriz; Fereres, Alberto
2017-01-01
Drought is a major threat to crop production worldwide and is accentuated by global warming. Plant responses to this abiotic stress involve physiological changes overlapping, at least partially, the defense pathways elicited both by viruses and their herbivore vectors. Recently, a number of theoretical and empirical studies anticipated the influence of climate changes on vector-borne viruses of plants and animals, mainly addressing the effects on the virus itself or on the vector population dynamics, and inferring possible consequences on virus transmission. Here, we directly assess the effect of a severe water deficit on the efficiency of aphid-transmission of the Cauliflower mosaic virus (CaMV) or the Turnip mosaic virus (TuMV). For both viruses, our results demonstrate that the rate of vector-transmission is significantly increased from water-deprived source plants: CaMV transmission reproducibly increased by 34% and that of TuMV by 100%. In both cases, the enhanced transmission rate could not be explained by a higher virus accumulation, suggesting a more complex drought-induced process that remains to be elucidated. The evidence that infected plants subjected to drought are much better virus sources for insect vectors may have extensive consequences for viral epidemiology, and should be investigated in a wide range of plant-virus-vector systems. PMID:28467423
Water deficit enhances the transmission of plant viruses by insect vectors.
van Munster, Manuella; Yvon, Michel; Vile, Denis; Dader, Beatriz; Fereres, Alberto; Blanc, Stéphane
2017-01-01
Drought is a major threat to crop production worldwide and is accentuated by global warming. Plant responses to this abiotic stress involve physiological changes overlapping, at least partially, the defense pathways elicited both by viruses and their herbivore vectors. Recently, a number of theoretical and empirical studies anticipated the influence of climate changes on vector-borne viruses of plants and animals, mainly addressing the effects on the virus itself or on the vector population dynamics, and inferring possible consequences on virus transmission. Here, we directly assess the effect of a severe water deficit on the efficiency of aphid-transmission of the Cauliflower mosaic virus (CaMV) or the Turnip mosaic virus (TuMV). For both viruses, our results demonstrate that the rate of vector-transmission is significantly increased from water-deprived source plants: CaMV transmission reproducibly increased by 34% and that of TuMV by 100%. In both cases, the enhanced transmission rate could not be explained by a higher virus accumulation, suggesting a more complex drought-induced process that remains to be elucidated. The evidence that infected plants subjected to drought are much better virus sources for insect vectors may have extensive consequences for viral epidemiology, and should be investigated in a wide range of plant-virus-vector systems.
Evidence for instantaneous e-vector detection in the honeybee using an associative learning paradigm
Sakura, Midori; Okada, Ryuichi; Aonuma, Hitoshi
2012-01-01
Many insects use the polarization pattern of the sky for obtaining compass information during orientation or navigation. E-vector information is collected by a specialized area in the dorsal-most part of the compound eye, the dorsal rim area (DRA). We tested honeybees' capability of learning certain e-vector orientations by using a classical conditioning paradigm with the proboscis extension reflex. When one e-vector orientation (CS+) was associated with sugar water, while another orientation (CS−) was not rewarded, the honeybees could discriminate CS+ from CS−. Bees whose DRA was inactivated by painting did not learn CS+. When ultraviolet (UV) polarized light (350 nm) was used for CS, the bees discriminated CS+ from CS−, but no discrimination was observed in blue (442 nm) or green light (546 nm). Our data indicate that honeybees can learn and discriminate between different e-vector orientations, sensed by the UV receptors of the DRA, suggesting that bees can determine their flight direction from polarized UV skylight during foraging. Fixing the bees' heads during the experiments did not prevent learning, indicating that they use an ‘instantaneous’ algorithm of e-vector detection; that is, the bees do not need to actively scan the sky with their DRAs (‘sequential’ method) to determine e-vector orientation. PMID:21733901
Shuttle of lentiviral vectors via transplanted cells in vivo.
Blömer, U; Gruh, I; Witschel, H; Haverich, A; Martin, U
2005-01-01
Lentiviral vectors have turned out to be an efficient method for stable gene transfer in vitro and in vivo. Not only do fields of application include cell marking and tracing following transplantation in vivo, but also the stable delivery of biological active proteins for gene therapy. A variety of cells, however, need immediate transplantation after preparation, for example, to prevent cell death, differentiation or de-differentiation. Although these cells are usually washed several times following lentiviral transduction, there may be the risk of viral vector shuttle via transplanted cells resulting in undesired in vivo transduction of recipient cells. We investigated whether infectious lentiviral particles are transmitted via ex vivo lentivirally transduced cells. To this end, we explored potential viral shuttle via ex vivo lentivirally transduced cardiomyocytes in vitro and following transplantation into the brain and peripheral muscle. We demonstrate that, even after extensive washing, infectious viral vector particles can be detected in cell suspensions. Those lentiviral vector particles were able to transduce target cells in transwell experiments. Moreover, transmitted vector particles stably transduced resident cells of the recipient central nervous system and muscle in vivo. Our results of lentiviral vector shuttle via transduced cardiomyocytes are significant for both ex vivo gene therapy and for lentiviral cell tracing, in particular for investigation of stem cell differentiation in transplantation models and co-cultivation systems.
Getting genetic access to natural adenovirus genomes to explore vector diversity.
Zhang, Wenli; Ehrhardt, Anja
2017-10-01
Recombinant vectors based on the human adenovirus type 5 (HAdV5) have been developed and extensively used in preclinical and clinical studies for over 30 years. However, certain restrictions of HAdV5-based vectors have limited their clinical applications because they are rather inefficient in specifically transducing cells of therapeutic interest that lack the coxsackievirus and adenovirus receptor (CAR). Moreover, enhanced vector-associated toxicity and widespread preexisting immunity have been shown to significantly hamper the effectiveness of HAdV-5-mediated gene transfer. However, evolution of adenoviruses in the natural host is driving the generation of novel types with altered virulence, enhanced transmission, and altered tissue tropism. As a consequence, an increasing number of alternative adenovirus types were identified, which may represent a valuable resource for the development of novel vector types. Thus, researchers are focusing on the other naturally occurring adenovirus types, which are structurally similar but functionally different from HAdV5. To this end, several strategies have been devised for getting genetic access to adenovirus genomes, resulting in a new panel of adenoviral vectors. Importantly, these vectors were shown to have a host range different from HAdV5 and to escape the anti-HAdV5 immune response, thus underlining the great potential of this approach. In summary, this review provides a state-of-the-art overview of one essential step in adenoviral vector development.
Jakobsen, Maria; Askou, Anne Louise; Stenderup, Karin; Rosada, Cecilia; Dagnæs-Hansen, Frederik; Jensen, Thomas G; Corydon, Thomas J; Mikkelsen, Jacob Giehm; Aagaard, Lars
2015-08-01
Skin is an easily accessible organ, and therapeutic gene transfer to skin remains an attractive alternative for the treatment of skin diseases. Although we have previously documented potent lentiviral gene delivery to human skin, vectors based on adeno-associated virus (AAV) rank among the most promising gene delivery tools for in vivo purposes. Thus, we compared the potential usefulness of various serotypes of recombinant AAV vectors and lentiviral vectors for gene transfer to human skin in a xenotransplanted mouse model. Vector constructs encoding firefly luciferase were packaged in AAV capsids of serotype 1, 2, 5, 6, 8, and 9 and separately administered by intradermal injection in human skin transplants. For all serotypes, live bioimaging demonstrated low levels of transgene expression in the human skin graft, and firefly luciferase expression was observed primarily in neighboring tissue outside of the graft. In contrast, gene delivery by intradermally injected lentiviral vectors was efficient and led to extensive and persistent firefly luciferase expression within the human skin graft only. The study demonstrates the limited capacity of single-stranded AAV vectors of six commonly used serotypes for gene delivery to human skin in vivo.
Jakobsen, Maria; Askou, Anne Louise; Stenderup, Karin; Rosada, Cecilia; Dagnæs-Hansen, Frederik; Jensen, Thomas G.; Corydon, Thomas J.; Mikkelsen, Jacob Giehm; Aagaard, Lars
2015-01-01
Skin is an easily accessible organ, and therapeutic gene transfer to skin remains an attractive alternative for the treatment of skin diseases. Although we have previously documented potent lentiviral gene delivery to human skin, vectors based on adeno-associated virus (AAV) rank among the most promising gene delivery tools for in vivo purposes. Thus, we compared the potential usefulness of various serotypes of recombinant AAV vectors and lentiviral vectors for gene transfer to human skin in a xenotransplanted mouse model. Vector constructs encoding firefly luciferase were packaged in AAV capsids of serotype 1, 2, 5, 6, 8, and 9 and separately administered by intradermal injection in human skin transplants. For all serotypes, live bioimaging demonstrated low levels of transgene expression in the human skin graft, and firefly luciferase expression was observed primarily in neighboring tissue outside of the graft. In contrast, gene delivery by intradermally injected lentiviral vectors was efficient and led to extensive and persistent firefly luciferase expression within the human skin graft only. The study demonstrates the limited capacity of single-stranded AAV vectors of six commonly used serotypes for gene delivery to human skin in vivo. PMID:26204415
Reduction of solar vector magnetograph data using a microMSP array processor
NASA Technical Reports Server (NTRS)
Kineke, Jack
1990-01-01
The processing of raw data obtained by the solar vector magnetograph at NASA-Marshall requires extensive arithmetic operations on large arrays of real numbers. The objectives of this summer faculty fellowship study are to: (1) learn the programming language of the MicroMSP Array Processor and adapt some existing data reduction routines to exploit its capabilities; and (2) identify other applications and/or existing programs which lend themselves to array processor utilization which can be developed by undergraduate student programmers under the provisions of project JOVE.
Vector-algebra approach to extract Denavit-Hartenberg parameters of assembled robot arms
NASA Technical Reports Server (NTRS)
Barker, L. K.
1983-01-01
The Denavit-Hartenberg parameters characterize the joint axis systems in a robot arm and, naturally, appear in the transformation matrices from one joint axis system to another. These parameters are needed in the control of robot arms and in the passage of sensor information along the arm. This paper presents a vector algebra method to determine these parameters for any assembled robot arm. The idea is to measure the location of the robot hand (or extension) for different joint angles and then use these measurements to calculate the parameters.
NASA Astrophysics Data System (ADS)
König, Friedrich; Wong, Franco N. C.
2004-03-01
Under extended phase-matching conditions, the first frequency derivative of the wave-vector mismatch is zero and the phase-matching bandwidth is greatly increased. We present extensive three-wave mixing measurements of the wave-vector mismatch and obtain improved Sellmeier equations for KTiOPO4. We observed a type-II extended phase-matching bandwidth of 100 nm for second-harmonic generation in periodically poled KTiOPO4, centered at the fundamental wavelength of 1584 nm. Applications in quantum entanglement and frequency metrology are discussed.
Bennett, Charles R; Kelly, Brian P
2013-08-09
Standard in-vitro spine testing methods have focused on application of isolated and/or constant load components while the in-vivo spine is subject to multiple components that can be resolved into resultant dynamic load vectors. To advance towards more in-vivo like simulations the objective of the current study was to develop a methodology to apply robotically-controlled, non-zero, real-time dynamic resultant forces during flexion-extension on human lumbar motion segment units (MSU) with initial application towards simulation of an ideal follower load (FL) force vector. A proportional-integral-derivative (PID) controller with custom algorithms coordinated the motion of a Cartesian serial manipulator comprised of six axes each capable of position- or load-control. Six lumbar MSUs (L4-L5) were tested with continuously increasing sagittal plane bending to 8 Nm while force components were dynamically programmed to deliver a resultant 400 N FL that remained normal to the moving midline of the intervertebral disc. Mean absolute load-control tracking errors between commanded and experimental loads were computed. Global spinal ranges of motion and sagittal plane inter-body translations were compared to previously published values for non-robotic applications. Mean TEs for zero-commanded force and moment axes were 0.7 ± 0.4N and 0.03 ± 0.02 Nm, respectively. For non-zero force axes mean TEs were 0.8 ± 0.8 N, 1.3 ± 1.6 Nm, and 1.3 ± 1.6N for Fx, Fz, and the resolved ideal follower load vector FL(R), respectively. Mean extension and flexion ranges of motion were 2.6° ± 1.2° and 5.0° ± 1.7°, respectively. Relative vertebral body translations and rotations were very comparable to data collected with non-robotic systems in the literature. The robotically coordinated Cartesian load controlled testing system demonstrated robust real-time load-control that permitted application of a real-time dynamic non-zero load vector during flexion-extension. For single MSU investigations the methodology has potential to overcome conventional follower load limitations, most notably via application outside the sagittal plane. This methodology holds promise for future work aimed at reducing the gap between current in-vitro testing and in-vivo circumstances. Copyright © 2013 Elsevier Ltd. All rights reserved.
Aksu, Yaman; Miller, David J; Kesidis, George; Yang, Qing X
2010-05-01
Feature selection for classification in high-dimensional spaces can improve generalization, reduce classifier complexity, and identify important, discriminating feature "markers." For support vector machine (SVM) classification, a widely used technique is recursive feature elimination (RFE). We demonstrate that RFE is not consistent with margin maximization, central to the SVM learning approach. We thus propose explicit margin-based feature elimination (MFE) for SVMs and demonstrate both improved margin and improved generalization, compared with RFE. Moreover, for the case of a nonlinear kernel, we show that RFE assumes that the squared weight vector 2-norm is strictly decreasing as features are eliminated. We demonstrate this is not true for the Gaussian kernel and, consequently, RFE may give poor results in this case. MFE for nonlinear kernels gives better margin and generalization. We also present an extension which achieves further margin gains, by optimizing only two degrees of freedom--the hyperplane's intercept and its squared 2-norm--with the weight vector orientation fixed. We finally introduce an extension that allows margin slackness. We compare against several alternatives, including RFE and a linear programming method that embeds feature selection within the classifier design. On high-dimensional gene microarray data sets, University of California at Irvine (UCI) repository data sets, and Alzheimer's disease brain image data, MFE methods give promising results.
Lee, Wen-Li; Chang, Koyin; Hsieh, Kai-Sheng
2016-09-01
Segmenting lung fields in a chest radiograph is essential for automatically analyzing an image. We present an unsupervised method based on multiresolution fractal feature vector. The feature vector characterizes the lung field region effectively. A fuzzy c-means clustering algorithm is then applied to obtain a satisfactory initial contour. The final contour is obtained by deformable models. The results show the feasibility and high performance of the proposed method. Furthermore, based on the segmentation of lung fields, the cardiothoracic ratio (CTR) can be measured. The CTR is a simple index for evaluating cardiac hypertrophy. After identifying a suspicious symptom based on the estimated CTR, a physician can suggest that the patient undergoes additional extensive tests before a treatment plan is finalized.
Shim, Jae Kun; Karol, Sohit; Hsu, Jeffrey; de Oliveira, Marcio Alves
2008-04-01
The aim of this study was to investigate the contralateral motor overflow in children during single-finger and multi-finger maximum force production tasks. Forty-five right handed children, 5-11 years of age produced maximum isometric pressing force in flexion or extension with single fingers or all four fingers of their right hand. The forces produced by individual fingers of the right and left hands were recorded and analyzed in four-dimensional finger force vector space. The results showed that increases in task (right) hand finger forces were linearly associated with non-task (left) hand finger forces. The ratio of the non-task hand finger force magnitude to the corresponding task hand finger force magnitude, termed motor overflow magnitude (MOM), was greater in extension than flexion. The index finger flexion task showed the smallest MOM values. The similarity between the directions of task hand and non-task hand finger force vectors in four-dimensional finger force vector space, termed motor overflow direction (MOD), was the greatest for index and smallest for little finger tasks. MOM of a four-finger task was greater than the sum of MOMs of single-finger tasks, and this phenomenon was termed motor overflow surplus. Contrary to previous studies, no single-finger or four-finger tasks showed significant changes of MOM or MOD with the age of children. We conclude that the contralateral motor overflow in children during finger maximum force production tasks is dependent upon the task fingers and the magnitude and direction of task finger forces.
Parallel algorithms for boundary value problems
NASA Technical Reports Server (NTRS)
Lin, Avi
1990-01-01
A general approach to solve boundary value problems numerically in a parallel environment is discussed. The basic algorithm consists of two steps: the local step where all the P available processors work in parallel, and the global step where one processor solves a tridiagonal linear system of the order P. The main advantages of this approach are two fold. First, this suggested approach is very flexible, especially in the local step and thus the algorithm can be used with any number of processors and with any of the SIMD or MIMD machines. Secondly, the communication complexity is very small and thus can be used as easily with shared memory machines. Several examples for using this strategy are discussed.
An update on the BQCD Hybrid Monte Carlo program
NASA Astrophysics Data System (ADS)
Haar, Taylor Ryan; Nakamura, Yoshifumi; Stüben, Hinnerk
2018-03-01
We present an update of BQCD, our Hybrid Monte Carlo program for simulating lattice QCD. BQCD is one of the main production codes of the QCDSF collaboration and is used by CSSM and in some Japanese finite temperature and finite density projects. Since the first publication of the code at Lattice 2010 the program has been extended in various ways. New features of the code include: dynamical QED, action modification in order to compute matrix elements by using Feynman-Hellman theory, more trace measurements (like Tr(D-n) for K, cSW and chemical potential reweighting), a more flexible integration scheme, polynomial filtering, term-splitting for RHMC, and a portable implementation of performance critical parts employing SIMD.
Abraham, Mark James; Murtola, Teemu; Schulz, Roland; ...
2015-07-15
GROMACS is one of the most widely used open-source and free software codes in chemistry, used primarily for dynamical simulations of biomolecules. It provides a rich set of calculation types, preparation and analysis tools. Several advanced techniques for free-energy calculations are supported. In version 5, it reaches new performance heights, through several new and enhanced parallelization algorithms. This work on every level; SIMD registers inside cores, multithreading, heterogeneous CPU–GPU acceleration, state-of-the-art 3D domain decomposition, and ensemble-level parallelization through built-in replica exchange and the separate Copernicus framework. Finally, the latest best-in-class compressed trajectory storage format is supported.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Abraham, Mark James; Murtola, Teemu; Schulz, Roland
GROMACS is one of the most widely used open-source and free software codes in chemistry, used primarily for dynamical simulations of biomolecules. It provides a rich set of calculation types, preparation and analysis tools. Several advanced techniques for free-energy calculations are supported. In version 5, it reaches new performance heights, through several new and enhanced parallelization algorithms. This work on every level; SIMD registers inside cores, multithreading, heterogeneous CPU–GPU acceleration, state-of-the-art 3D domain decomposition, and ensemble-level parallelization through built-in replica exchange and the separate Copernicus framework. Finally, the latest best-in-class compressed trajectory storage format is supported.
Nose, Atsushi; Yamazaki, Tomohiro; Katayama, Hironobu; Uehara, Shuji; Kobayashi, Masatsugu; Shida, Sayaka; Odahara, Masaki; Takamiya, Kenichi; Matsumoto, Shizunori; Miyashita, Leo; Watanabe, Yoshihiro; Izawa, Takashi; Muramatsu, Yoshinori; Nitta, Yoshikazu; Ishikawa, Masatoshi
2018-04-24
We have developed a high-speed vision chip using 3D stacking technology to address the increasing demand for high-speed vision chips in diverse applications. The chip comprises a 1/3.2-inch, 1.27 Mpixel, 500 fps (0.31 Mpixel, 1000 fps, 2 × 2 binning) vision chip with 3D-stacked column-parallel Analog-to-Digital Converters (ADCs) and 140 Giga Operation per Second (GOPS) programmable Single Instruction Multiple Data (SIMD) column-parallel PEs for new sensing applications. The 3D-stacked structure and column parallel processing architecture achieve high sensitivity, high resolution, and high-accuracy object positioning.
NASA Astrophysics Data System (ADS)
Dave, Gaurav P.; Sureshkumar, N.; Blessy Trencia Lincy, S. S.
2017-11-01
Current trend in processor manufacturing focuses on multi-core architectures rather than increasing the clock speed for performance improvement. Graphic processors have become as commodity hardware for providing fast co-processing in computer systems. Developments in IoT, social networking web applications, big data created huge demand for data processing activities and such kind of throughput intensive applications inherently contains data level parallelism which is more suited for SIMD architecture based GPU. This paper reviews the architectural aspects of multi/many core processors and graphics processors. Different case studies are taken to compare performance of throughput computing applications using shared memory programming in OpenMP and CUDA API based programming.
An elementary proof of a criterion for linear disjointness
NASA Astrophysics Data System (ADS)
Dobbs, David E.
2013-06-01
An elementary proof using matrix theory is given for the following criterion: if F/K and L/K are field extensions, with F and L both contained in a common extension field, then F and L are linearly disjoint over K if (and only if) some K-vector space basis of F is linearly independent over L. The material in this note could serve as enrichment material for the unit on fields in a first course on abstract algebra.
FPGA-accelerated adaptive optics wavefront control
NASA Astrophysics Data System (ADS)
Mauch, S.; Reger, J.; Reinlein, C.; Appelfelder, M.; Goy, M.; Beckert, E.; Tünnermann, A.
2014-03-01
The speed of real-time adaptive optical systems is primarily restricted by the data processing hardware and computational aspects. Furthermore, the application of mirror layouts with increasing numbers of actuators reduces the bandwidth (speed) of the system and, thus, the number of applicable control algorithms. This burden turns out a key-impediment for deformable mirrors with continuous mirror surface and highly coupled actuator influence functions. In this regard, specialized hardware is necessary for high performance real-time control applications. Our approach to overcome this challenge is an adaptive optics system based on a Shack-Hartmann wavefront sensor (SHWFS) with a CameraLink interface. The data processing is based on a high performance Intel Core i7 Quadcore hard real-time Linux system. Employing a Xilinx Kintex-7 FPGA, an own developed PCie card is outlined in order to accelerate the analysis of a Shack-Hartmann Wavefront Sensor. A recently developed real-time capable spot detection algorithm evaluates the wavefront. The main features of the presented system are the reduction of latency and the acceleration of computation For example, matrix multiplications which in general are of complexity O(n3 are accelerated by using the DSP48 slices of the field-programmable gate array (FPGA) as well as a novel hardware implementation of the SHWFS algorithm. Further benefits are the Streaming SIMD Extensions (SSE) which intensively use the parallelization capability of the processor for further reducing the latency and increasing the bandwidth of the closed-loop. Due to this approach, up to 64 actuators of a deformable mirror can be handled and controlled without noticeable restriction from computational burdens.
Patch-based image reconstruction for PET using prior-image derived dictionaries
NASA Astrophysics Data System (ADS)
Tahaei, Marzieh S.; Reader, Andrew J.
2016-09-01
In PET image reconstruction, regularization is often needed to reduce the noise in the resulting images. Patch-based image processing techniques have recently been successfully used for regularization in medical image reconstruction through a penalized likelihood framework. Re-parameterization within reconstruction is another powerful regularization technique in which the object in the scanner is re-parameterized using coefficients for spatially-extensive basis vectors. In this work, a method for extracting patch-based basis vectors from the subject’s MR image is proposed. The coefficients for these basis vectors are then estimated using the conventional MLEM algorithm. Furthermore, using the alternating direction method of multipliers, an algorithm for optimizing the Poisson log-likelihood while imposing sparsity on the parameters is also proposed. This novel method is then utilized to find sparse coefficients for the patch-based basis vectors extracted from the MR image. The results indicate the superiority of the proposed methods to patch-based regularization using the penalized likelihood framework.
Visualization of Morse connection graphs for topologically rich 2D vector fields.
Szymczak, Andrzej; Sipeki, Levente
2013-12-01
Recent advances in vector field topologymake it possible to compute its multi-scale graph representations for autonomous 2D vector fields in a robust and efficient manner. One of these representations is a Morse Connection Graph (MCG), a directed graph whose nodes correspond to Morse sets, generalizing stationary points and periodic trajectories, and arcs - to trajectories connecting them. While being useful for simple vector fields, the MCG can be hard to comprehend for topologically rich vector fields, containing a large number of features. This paper describes a visual representation of the MCG, inspired by previous work on graph visualization. Our approach aims to preserve the spatial relationships between the MCG arcs and nodes and highlight the coherent behavior of connecting trajectories. Using simulations of ocean flow, we show that it can provide useful information on the flow structure. This paper focuses specifically on MCGs computed for piecewise constant (PC) vector fields. In particular, we describe extensions of the PC framework that make it more flexible and better suited for analysis of data on complex shaped domains with a boundary. We also describe a topology simplification scheme that makes our MCG visualizations less ambiguous. Despite the focus on the PC framework, our approach could also be applied to graph representations or topological skeletons computed using different methods.
Corre, Guillaume; Dessainte, Michel; Marteau, Jean-Brice; Dalle, Bruno; Fenard, David; Galy, Anne
2016-02-01
Nonreplicative recombinant HIV-1-derived lentiviral vectors (LV) are increasingly used in gene therapy of various genetic diseases, infectious diseases, and cancer. Before they are used in humans, preparations of LV must undergo extensive quality control testing. In particular, testing of LV must demonstrate the absence of replication-competent lentiviruses (RCL) with suitable methods, on representative fractions of vector batches. Current methods based on cell culture are challenging because high titers of vector batches translate into high volumes of cell culture to be tested in RCL assays. As vector batch size and titers are continuously increasing because of the improvement of production and purification methods, it became necessary for us to modify the current RCL assay based on the detection of p24 in cultures of indicator cells. Here, we propose a practical optimization of this method using a pairwise pooling strategy enabling easier testing of higher vector inoculum volumes. These modifications significantly decrease material handling and operator time, leading to a cost-effective method, while maintaining optimal sensibility of the RCL testing. This optimized "RCL-pooling assay" ameliorates the feasibility of the quality control of large-scale batches of clinical-grade LV while maintaining the same sensitivity.
User's and test case manual for FEMATS
NASA Technical Reports Server (NTRS)
Chatterjee, Arindam; Volakis, John; Nurnberger, Mike; Natzke, John
1995-01-01
The FEMATS program incorporates first-order edge-based finite elements and vector absorbing boundary conditions into the scattered field formulation for computation of the scattering from three-dimensional geometries. The code has been validated extensively for a large class of geometries containing inhomogeneities and satisfying transition conditions. For geometries that are too large for the workstation environment, the FEMATS code has been optimized to run on various supercomputers. Currently, FEMATS has been configured to run on the HP 9000 workstation, vectorized for the Cray Y-MP, and parallelized to run on the Kendall Square Research (KSR) architecture and the Intel Paragon.
Short cavity DFB fiber laser based vector hydrophone for low frequency signal detection
NASA Astrophysics Data System (ADS)
Zhang, Xiaolei; Zhang, Faxiang; Jiang, Shaodong; Min, Li; Li, Ming; Peng, Gangding; Ni, Jiasheng; Wang, Chang
2017-12-01
A short cavity distributed feedback (DFB) fiber laser is used for low frequency acoustic signal detection. Three DFB fiber lasers with different central wavelengths are chained together to make three-element vector hydrophone with proper sensitivity enhancement design, which has extensive and significant applications to underwater acoustic monitoring for the national defense, oil, gas exploration, and so on. By wavelength-phase demodulation, the lasing wavelength changes under different frequency signals can be interpreted, and the sensitivity is tested about 33 dB re pm/g. The frequency response range is rather flat from 5 Hz to 300 Hz.
Characterization of the Asian citrus psyllid transcriptome
USDA-ARS?s Scientific Manuscript database
The Asian citrus psyllid (Diaphorina citri Kuwayama) and other psyllids are important agricultural pests that cause extensive economic damage by feeding and as vectors of plant pathogens. No psyllid genomes have been characterized, and little is known about the composition of psyllid genomes or the ...
CHANGING APPROACHES TO CONTROLLING PATHOGENS IN BIOSOLIDS AND THEIR VECTOR ATTRACTIVENESS
This paper reviews the commonly employed Class A and B processes for controlling pathogens; notes how extensively they are used; and discusses issues and concerns with some of them. Processes presently being researched are also noted together with EPA's methodology for determinin...
Nagarajan, Mahesh B.; Huber, Markus B.; Schlossbauer, Thomas; Leinsinger, Gerda; Krol, Andrzej; Wismüller, Axel
2014-01-01
Objective While dimension reduction has been previously explored in computer aided diagnosis (CADx) as an alternative to feature selection, previous implementations of its integration into CADx do not ensure strict separation between training and test data required for the machine learning task. This compromises the integrity of the independent test set, which serves as the basis for evaluating classifier performance. Methods and Materials We propose, implement and evaluate an improved CADx methodology where strict separation is maintained. This is achieved by subjecting the training data alone to dimension reduction; the test data is subsequently processed with out-of-sample extension methods. Our approach is demonstrated in the research context of classifying small diagnostically challenging lesions annotated on dynamic breast magnetic resonance imaging (MRI) studies. The lesions were dynamically characterized through topological feature vectors derived from Minkowski functionals. These feature vectors were then subject to dimension reduction with different linear and non-linear algorithms applied in conjunction with out-of-sample extension techniques. This was followed by classification through supervised learning with support vector regression. Area under the receiver-operating characteristic curve (AUC) was evaluated as the metric of classifier performance. Results Of the feature vectors investigated, the best performance was observed with Minkowski functional ’perimeter’ while comparable performance was observed with ’area’. Of the dimension reduction algorithms tested with ’perimeter’, the best performance was observed with Sammon’s mapping (0.84 ± 0.10) while comparable performance was achieved with exploratory observation machine (0.82 ± 0.09) and principal component analysis (0.80 ± 0.10). Conclusions The results reported in this study with the proposed CADx methodology present a significant improvement over previous results reported with such small lesions on dynamic breast MRI. In particular, non-linear algorithms for dimension reduction exhibited better classification performance than linear approaches, when integrated into our CADx methodology. We also note that while dimension reduction techniques may not necessarily provide an improvement in classification performance over feature selection, they do allow for a higher degree of feature compaction. PMID:24355697
Neighboring block based disparity vector derivation for multiview compatible 3D-AVC
NASA Astrophysics Data System (ADS)
Kang, Jewon; Chen, Ying; Zhang, Li; Zhao, Xin; Karczewicz, Marta
2013-09-01
3D-AVC being developed under Joint Collaborative Team on 3D Video Coding (JCT-3V) significantly outperforms the Multiview Video Coding plus Depth (MVC+D) which simultaneously encodes texture views and depth views with the multiview extension of H.264/AVC (MVC). However, when the 3D-AVC is configured to support multiview compatibility in which texture views are decoded without depth information, the coding performance becomes significantly degraded. The reason is that advanced coding tools incorporated into the 3D-AVC do not perform well due to the lack of a disparity vector converted from the depth information. In this paper, we propose a disparity vector derivation method utilizing only the information of texture views. Motion information of neighboring blocks is used to determine a disparity vector for a macroblock, so that the derived disparity vector is efficiently used for the coding tools in 3D-AVC. The proposed method significantly improves a coding gain of the 3D-AVC in the multiview compatible mode about 20% BD-rate saving in the coded views and 26% BD-rate saving in the synthesized views on average.
750 GeV diphoton excess at CERN LHC from a dark sector assisted scalar decay
DOE Office of Scientific and Technical Information (OSTI.GOV)
Bhattacharya, Subhaditya; Patra, Sudhanwa; Sahoo, Nirakar
2016-06-06
We present a simple extension of the Standard Model (SM) to explain the recent diphoton excess, reported by CMS and ATLAS at CERN LHC. The SM is extended by a dark sector including a vector-like lepton doublet and a singlet of zero electromagnetic charge, which are odd under a Z{sub 2} symmetry. The charged particle of the vector-like lepton doublet assist the additional scalar, different from SM Higgs, to decay to di-photons of invariant mass around 750 GeV and thus explaining the excess observed at LHC. The admixture of neutral component of the vector-like lepton doublet and singlet constitute themore » dark matter of the Universe. We show the relevant parameter space for correct relic density and direct detection of dark matter.« less
An analysis of random projection for changeable and privacy-preserving biometric verification.
Wang, Yongjin; Plataniotis, Konstantinos N
2010-10-01
Changeability and privacy protection are important factors for widespread deployment of biometrics-based verification systems. This paper presents a systematic analysis of a random-projection (RP)-based method for addressing these problems. The employed method transforms biometric data using a random matrix with each entry an independent and identically distributed Gaussian random variable. The similarity- and privacy-preserving properties, as well as the changeability of the biometric information in the transformed domain, are analyzed in detail. Specifically, RP on both high-dimensional image vectors and dimensionality-reduced feature vectors is discussed and compared. A vector translation method is proposed to improve the changeability of the generated templates. The feasibility of the introduced solution is well supported by detailed theoretical analyses. Extensive experimentation on a face-based biometric verification problem shows the effectiveness of the proposed method.
Watson, Swellengrebel and species sanitation: environmental and ecological aspects.
Bradley, D J
1994-08-01
Following the discovery of mosquito transmission of malaria, the theory and practice of malaria control by general and selective removal of specific vector populations resulted particularly from Malcolm Watson's empirical work in peninsular Malaysia, first in the urban and peri-urban areas of Klang and Port Swettenham and subsequently in the rural rubber plantations, and from the work of N.H. Swellengrebel in nearby Indonesia on the taxonomy, ecology and control of anophelines. They developed the concept of species sanitation: the selective modification of the environment to render a particular anopheline of no importance as a vector in a particular situation. The lack of progress along these lines in India at that time is contrasted with that in south-east Asia. The extension of species sanitation and related concepts to other geographical areas and to other vector-borne disease situations is outlined.
Intersection of Three Planes Revisited--An Algebraic Approach
ERIC Educational Resources Information Center
Trenkler, Götz; Trenkler, Dietrich
2017-01-01
Given three planes in space, a complete characterization of their intersection is provided. Special attention is paid to the case when the intersection set does not exist of one point only. Besides the vector cross product, the tool of generalized inverse of a matrix is used extensively.
Modification and identification of a vector for making a large phage antibody library.
Zhang, Guo-min; Chen, Yü-ping; Guan, Yuan-zhi; Wang, Yan; An, Yun-qing
2007-11-20
The large phage antibody library is used to obtain high-affinity human antibody, and the Loxp/cre site-specific recombination system is a potential method for constructing a large phage antibody library. In the present study, a phage antibody library vector pDF was reconstructed to construct diabody more quickly and conveniently without injury to homologous recombination and the expression function of the vector and thus to integrate construction of the large phage antibody library with the preparation of diabodies. scFv was obtained by overlap polymerase chain reaction (PCR) amplification with the newly designed VL and VH extension primers. loxp511 was flanked by VL and VH and the endonuclease ACC III encoding sequences were introduced on both sides of loxp511. scFv was cloned into the vector pDF to obtain the vector pDscFv. The vector expression function was identified and the feasibility of diabody preparation was evaluated. A large phage antibody library was constructed in pDscFv. Several antigens were used to screen the antibody library and the quality of the antibody library was evaluated. The phage antibody library expression vector pDscFv was successfully constructed and confirmed to express functional scFv. The large phage antibody library constructed using this vector was of high diversity. Screening of the library on 6 antigens confirmed the generation of specific antibodies to these antigens. Two antibodies were subjected to enzymatic digestion and were prepared into diabody with functional expression. The reconstructed vector pDscFv retains its recombination capability and expression function and can be used to construct large phage antibody libraries. It can be used as a convenient and quick method for preparing diabodies after simple enzymatic digestion, which facilitates clinical trials and application of antibody therapy.
Immune clearance of highly pathogenic SIV infection
Hansen, Scott G.; Piatak, Michael; Ventura, Abigail B.; Hughes, Colette M.; Gilbride, Roxanne M.; Ford, Julia C.; Oswald, Kelli; Shoemaker, Rebecca; Li, Yuan; Lewis, Matthew S.; Gilliam, Awbrey N.; Xu, Guangwu; Whizin, Nathan; Burwitz, Benjamin J.; Planer, Shannon L.; Turner, John M.; Legasse, Alfred W.; Axthelm, Michael K.; Nelson, Jay A.; Früh, Klaus; Sacha, Jonah B.; Estes, Jacob D.; Keele, Brandon F.; Edlefsen, Paul T.; Lifson, Jeffrey D.; Picker, Louis J.
2013-01-01
Established infections with the human and simian immunodeficiency viruses (HIV, SIV) are thought to be permanent with even the most effective immune responses and anti-retroviral therapies (ART) only able to control, but not clear, these infections1–4. Whether the residual virus that maintains these infections is vulnerable to clearance is a question of central importance to the future management of millions of HIV-infected individuals. We recently reported that ~50% of rhesus macaques (RM) vaccinated with SIV protein-expressing Rhesus Cytomegalovirus (RhCMV/SIV) vectors manifest durable, aviremic control of infection with highly pathogenic SIVmac2395. Here, we demonstrate that regardless of route of challenge, RhCMV/SIV vector-elicited immune responses control SIVmac239 after demonstrable lymphatic and hematogenous viral dissemination, and that replication-competent SIV persists in multiple sites for weeks to months. However, over time, protected RM lost signs of SIV infection, showing a consistent lack of measurable plasma or tissue-associated virus using ultrasensitive assays, and loss of T cell reactivity to SIV determinants not in the vaccine. Extensive ultrasensitive RT-PCR and PCR analysis of tissues from RhCMV/SIV vector-protected RM necropsied 69–172 weeks after challenge did not detect SIV RNA or DNA over background, and replication-competent SIV was not detected in these RM by extensive co-culture analysis of tissues or by adoptive transfer of 60 million hematolymphoid cells to naïve RM. These data provide compelling evidence for progressive clearance of a pathogenic lentiviral infection, and suggest that some lentiviral reservoirs may be susceptible to the continuous effector memory T cell-mediated immune surveillance elicited and maintained by CMV vectors. PMID:24025770
Immune clearance of highly pathogenic SIV infection.
Hansen, Scott G; Piatak, Michael; Ventura, Abigail B; Hughes, Colette M; Gilbride, Roxanne M; Ford, Julia C; Oswald, Kelli; Shoemaker, Rebecca; Li, Yuan; Lewis, Matthew S; Gilliam, Awbrey N; Xu, Guangwu; Whizin, Nathan; Burwitz, Benjamin J; Planer, Shannon L; Turner, John M; Legasse, Alfred W; Axthelm, Michael K; Nelson, Jay A; Früh, Klaus; Sacha, Jonah B; Estes, Jacob D; Keele, Brandon F; Edlefsen, Paul T; Lifson, Jeffrey D; Picker, Louis J
2013-10-03
Established infections with the human and simian immunodeficiency viruses (HIV and SIV, respectively) are thought to be permanent with even the most effective immune responses and antiretroviral therapies only able to control, but not clear, these infections. Whether the residual virus that maintains these infections is vulnerable to clearance is a question of central importance to the future management of millions of HIV-infected individuals. We recently reported that approximately 50% of rhesus macaques (RM; Macaca mulatta) vaccinated with SIV protein-expressing rhesus cytomegalovirus (RhCMV/SIV) vectors manifest durable, aviraemic control of infection with the highly pathogenic strain SIVmac239 (ref. 5). Here we show that regardless of the route of challenge, RhCMV/SIV vector-elicited immune responses control SIVmac239 after demonstrable lymphatic and haematogenous viral dissemination, and that replication-competent SIV persists in several sites for weeks to months. Over time, however, protected RM lost signs of SIV infection, showing a consistent lack of measurable plasma- or tissue-associated virus using ultrasensitive assays, and a loss of T-cell reactivity to SIV determinants not in the vaccine. Extensive ultrasensitive quantitative PCR and quantitative PCR with reverse transcription analyses of tissues from RhCMV/SIV vector-protected RM necropsied 69-172 weeks after challenge did not detect SIV RNA or DNA sequences above background levels, and replication-competent SIV was not detected in these RM by extensive co-culture analysis of tissues or by adoptive transfer of 60 million haematolymphoid cells to naive RM. These data provide compelling evidence for progressive clearance of a pathogenic lentiviral infection, and suggest that some lentiviral reservoirs may be susceptible to the continuous effector memory T-cell-mediated immune surveillance elicited and maintained by cytomegalovirus vectors.
Simple Method for Markerless Gene Deletion in Multidrug-Resistant Acinetobacter baumannii
Oh, Man Hwan; Lee, Je Chul; Kim, Jungmin
2015-01-01
The traditional markerless gene deletion technique based on overlap extension PCR has been used for generating gene deletions in multidrug-resistant Acinetobacter baumannii. However, the method is time-consuming because it requires restriction digestion of the PCR products in DNA cloning and the construction of new vectors containing a suitable antibiotic resistance cassette for the selection of A. baumannii merodiploids. Moreover, the availability of restriction sites and the selection of recombinant bacteria harboring the desired chimeric plasmid are limited, making the construction of a chimeric plasmid more difficult. We describe a rapid and easy cloning method for markerless gene deletion in A. baumannii, which has no limitation in the availability of restriction sites and allows for easy selection of the clones carrying the desired chimeric plasmid. Notably, it is not necessary to construct new vectors in our method. This method utilizes direct cloning of blunt-end DNA fragments, in which upstream and downstream regions of the target gene are fused with an antibiotic resistance cassette via overlap extension PCR and are inserted into a blunt-end suicide vector developed for blunt-end cloning. Importantly, the antibiotic resistance cassette is placed outside the downstream region in order to enable easy selection of the recombinants carrying the desired plasmid, to eliminate the antibiotic resistance cassette via homologous recombination, and to avoid the necessity of constructing new vectors. This strategy was successfully applied to functional analysis of the genes associated with iron acquisition by A. baumannii ATCC 19606 and to ompA gene deletion in other A. baumannii strains. Consequently, the proposed method is invaluable for markerless gene deletion in multidrug-resistant A. baumannii. PMID:25746991
Cosmology in beyond-generalized Proca theories
NASA Astrophysics Data System (ADS)
Nakamura, Shintaro; Kase, Ryotaro; Tsujikawa, Shinji
2017-05-01
The beyond-generalized Proca theories are the extension of second-order massive vector-tensor theories (dubbed generalized Proca theories) with two transverse vector modes and one longitudinal scalar besides two tensor polarizations. Even with this extension, the propagating degrees of freedom remain unchanged on the isotropic cosmological background without an Ostrogradski instability. We study the cosmology in beyond-generalized Proca theories by paying particular attention to the dynamics of late-time cosmic acceleration and resulting observational consequences. We derive conditions for avoiding ghosts and instabilities of tensor, vector, and scalar perturbations and discuss viable parameter spaces in concrete models allowing the dark energy equation of state smaller than -1 . The propagation speeds of those perturbations are subject to modifications beyond the domain of generalized Proca theories. There is a mixing between scalar and matter sound speeds, but such a mixing is suppressed during most of the cosmic expansion history without causing a new instability. On the other hand, we find that derivative interactions arising in beyond-generalized Proca theories give rise to important modifications to the cosmic growth history. The growth rate of matter perturbations can be compatible with the redshift-space distortion data due to the realization of gravitational interaction weaker than that in generalized Proca theories. Thus, it is possible to distinguish the dark energy model in beyond-generalized Proca theories from the counterpart in generalized Proca theories as well as from the Λ CDM model.
Factors That Influence the Transmission of West Nile Virus in Florida.
Day, Jonathan F; Tabachnick, Walter J; Smartt, Chelsea T
2015-09-01
West Nile virus (WNV) was first detected in North America in New York City during the late summer of 1999 and was first detected in Florida in 2001. Although WNV has been responsible for widespread and extensive epidemics in human populations and epizootics in domestic animals and wildlife throughout North America, comparable epidemics have never materialized in Florida. Here, we review some of the reasons why WNV has yet to cause an extensive outbreak in Florida. The primary vector of mosquito-borne encephalitis virus in Florida is Culex nigripalpus Theobald. Rainfall, drought, and temperature are the primary factors that regulate annual populations of this species. Cx. nigripalpus is a competent vector of WNV, St. Louis encephalitis virus, and eastern equine encephalitis virus in Florida, and populations of this species can support focal amplification and transmission of these arboviruses. We propose that a combination of environmental factors influencing Cx. nigripalpus oviposition, blood-feeding behavior, and vector competence have limited WNV transmission in Florida to relatively small focal outbreaks and kept the state free of a major epidemic. Florida must remain vigilant to the danger from WNV, because a change in these environmental factors could easily result in a substantial WNV epidemic rivaling those seen elsewhere in the United States. © The Authors 2015. Published by Oxford University Press on behalf of Entomological Society of America. All rights reserved. For Permissions, please email: journals.permissions@oup.com.
Extensions and improvements on XTRAN3S
NASA Technical Reports Server (NTRS)
Borland, C. J.
1989-01-01
Improvements to the XTRAN3S computer program are summarized. Work on this code, for steady and unsteady aerodynamic and aeroelastic analysis in the transonic flow regime has concentrated on the following areas: (1) Maintenance of the XTRAN3S code, including correction of errors, enhancement of operational capability, and installation on the Cray X-MP system; (2) Extension of the vectorization concepts in XTRAN3S to include additional areas of the code for improved execution speed; (3) Modification of the XTRAN3S algorithm for improved numerical stability for swept, tapered wing cases and improved computational efficiency; and (4) Extension of the wing-only version of XTRAN3S to include pylon and nacelle or external store capability.
Decoding the Ubiquitin-Mediated Pathway of Arthropod Disease Vectors
Choy, Anthony; Severo, Maiara S.; Sun, Ruobai; Girke, Thomas; Gillespie, Joseph J.; Pedra, Joao H. F.
2013-01-01
Protein regulation by ubiquitin has been extensively described in model organisms. However, characterization of the ubiquitin machinery in disease vectors remains mostly unknown. This fundamental gap in knowledge presents a concern because new therapeutics are needed to control vector-borne diseases, and targeting the ubiquitin machinery as a means for disease intervention has been already adopted in the clinic. In this study, we employed a bioinformatics approach to uncover the ubiquitin-mediated pathway in the genomes of Anopheles gambiae, Aedes aegypti, Culex quinquefasciatus, Ixodes scapularis, Pediculus humanus and Rhodnius prolixus. We observed that (1) disease vectors encode a lower percentage of ubiquitin-related genes when compared to Drosophila melanogaster, Mus musculus and Homo sapiens but not Saccharomyces cerevisiae; (2) overall, there are more proteins categorized as E3 ubiquitin ligases when compared to E2-conjugating or E1-activating enzymes; (3) the ubiquitin machinery within the three mosquito genomes is highly similar; (4) ubiquitin genes are more than doubled in the Chagas disease vector (R. prolixus) when compared to other arthropod vectors; (5) the deer tick I. scapularis and the body louse (P. humanus) genomes carry low numbers of E1-activating enzymes and HECT-type E3 ubiquitin ligases; (6) R. prolixus have low numbers of RING-type E3 ubiquitin ligases; and (7) C. quinquefasciatus present elevated numbers of predicted F-box E3 ubiquitin ligases, JAB and UCH deubiquitinases. Taken together, these findings provide novel opportunities to study the interaction between a pathogen and an arthropod vector. PMID:24205097
Segura, María Mercedes; Garnier, Alain; Di Falco, Marcos Rafael; Whissell, Gavin; Meneses-Acosta, Angélica; Arcand, Normand; Kamen, Amine
2008-01-01
The Moloney murine leukemia virus (MMLV) belongs to the Retroviridae family of enveloped viruses, which is known to acquire minute amounts of host cellular proteins both on the surface and inside the virion. Despite the extensive use of retroviral vectors in experimental and clinical applications, the repertoire of host proteins incorporated into MMLV vector particles remains unexplored. We report here the identification of host proteins from highly purified retroviral vector preparations obtained by rate-zonal ultracentrifugation. Viral proteins were fractionated by one-dimensional sodium dodecyl sulfate-polyacrylamide gel electrophoresis, in-gel tryptic digested, and subjected to liquid chromatography/tandem mass spectrometry analysis. Immunogold electron microscopy studies confirmed the presence of several host membrane proteins exposed at the vector surface. These studies led to the identification of 27 host proteins on MMLV vector particles derived from 293 HEK cells, including 5 proteins previously described as part of wild-type MMLV. Nineteen host proteins identified corresponded to intracellular proteins. A total of eight host membrane proteins were identified, including cell adhesion proteins integrin β1 (fibronectin receptor subunit beta) and HMFG-E8, tetraspanins CD81 and CD9, and late endosomal markers CD63 and Lamp-2. Identification of membrane proteins on the retroviral surface is particularly attractive, since they can serve as anchoring sites for the insertion of tags for targeting or purification purposes. The implications of our findings for retrovirus-mediated gene therapy are discussed. PMID:18032515
2013-01-01
Background Interruption of vector-borne transmission of Trypanosoma cruzi remains an unrealized objective in many Latin American countries. The task of vector control is complicated by the emergence of vector insects in urban areas. Methods Utilizing data from a large-scale vector control program in Arequipa, Peru, we explored the spatial patterns of infestation by Triatoma infestans in an urban and peri-urban landscape. Multilevel logistic regression was utilized to assess the associations between household infestation and household- and locality-level socio-environmental measures. Results Of 37,229 households inspected for infestation, 6,982 (18.8%; 95% CI: 18.4 – 19.2%) were infested by T. infestans. Eighty clusters of infestation were identified, ranging in area from 0.1 to 68.7 hectares and containing as few as one and as many as 1,139 infested households. Spatial dependence between infested households was significant at distances up to 2,000 meters. Household T. infestans infestation was associated with household- and locality-level factors, including housing density, elevation, land surface temperature, and locality type. Conclusions High levels of T. infestans infestation, characterized by spatial heterogeneity, were found across extensive urban and peri-urban areas prior to vector control. Several environmental and social factors, which may directly or indirectly influence the biology and behavior of T. infestans, were associated with infestation. Spatial clustering of infestation in the urban context may both challenge and inform surveillance and control of vector reemergence after insecticide intervention. PMID:24171704
CONTRIBUTION TO THE THEORY OF MATRICES PARTITIONED INTO BLOCKS.
results were obtained on cones of matrices and vectors, and an extension of the well-known Perron - Frobenius theorem was proved. Also a necessary and...sufficient condition was derived, in order that to a given matrix corresponds a cone on which it is a positive operator. Easily computed upper and
This presentation will review the commonly employed Class A & B processes for controlling pathogens; note how extensively they are used; and discuss issues and concerns. Processes presently being researched will also be noted together with EPA's methodology for determining equiva...
Secure Computer Systems: Extensions to the Bell-La Padula Model
2009-01-01
countable and n CX ℜ∈ ; V is a finite collection of input variables. We assume ( )CD VVV ∪= with DV countable and nCV ℜ∈ ; XInit ⊆ is a set of...assume ( )CD VVV ∪= with DV countable and nCV ℜ∈ ; XInit ⊆ is a set of initial states; CXVXf →×: is a vector field, assumed to be globally...built under the Eclipse Swordfish project. As indicated on the project web site,”The goal of the Swordfish project is to provide an extensible SOA
DOE Office of Scientific and Technical Information (OSTI.GOV)
Toyama, F.M.; Nogami, Y.; Zhao, Z.
1993-02-01
For the Dirac equation in one space dimension with a potential of the Lorentz scalar type, we present a complete solution for the problem of constructing a transparent potential. This is a relativistic extension of the Kay-Moses method which was developed for the nonrelativistic Schroedinger equation. There is an infinite family of transparent potentials. The potentials are all related to solutions of a class of coupled, nonlinear Dirac equations. In addition, it is argued that an admixture of a Lorentz vector component in the potential impairs perfect transparency.
Korch, C
1987-01-01
A cross index is presented for using the improved selectivity offered by the Hung and Wensink (Nucl. Acids Res. 12, 1863-1874, 1984) method of partially filling in 5'-extensions produced by type II restriction endonucleases. After this treatment, DNA fragments which normally cannot be ligated to one another, can be joined providing that complementary cohesive ends have been generated. The uses of this technique, which include the prevention of DNA fragments (both vector and insert) auto-annealing, are discussed. PMID:3033600
Vector control in developed countries
Peters, Richard F.
1963-01-01
The recent rapid growth of California's population, leading to competition for space between residential, industrial and agricultural interests, the development of its water resources and increasing water pollution provide the basic ingredients of its present vector problems. Within the past half-century, the original mosquito habitats provided by nature have gradually given place to even more numerous and productive habitats of man-made character. At the same time, emphasis in mosquito control has shifted from physical to chemical, with the more recent extension to biological approaches as well. The growing domestic fly problem, continuing despite the virtual disappearance of the horse, is attributable to an increasing amount of organic by-products, stemming from growing communities, expanding industries and changing agriculture. The programme for the control of disease vectors and pest insects and animals directs its major effort to the following broad areas: (1) water management (including land preparation), (2) solid organic wastes management (emphasizing utilization), (3) community management (including design, layout, and storage practices of buildings and grounds), and (4) recreational area management (related to wildlife management). It is apparent that vector control can often employ economics as an ally in securing its objectives. Effective organization of the environment to produce maximum economic benefits to industry, agriculture, and the community results generally in conditions unfavourable to the survival of vector and noxious animal species. Hence, vector prevention or suppression is preferable to control as a programme objective. PMID:20604166
HMM for hyperspectral spectrum representation and classification with endmember entropy vectors
NASA Astrophysics Data System (ADS)
Arabi, Samir Y. W.; Fernandes, David; Pizarro, Marco A.
2015-10-01
The Hyperspectral images due to its good spectral resolution are extensively used for classification, but its high number of bands requires a higher bandwidth in the transmission data, a higher data storage capability and a higher computational capability in processing systems. This work presents a new methodology for hyperspectral data classification that can work with a reduced number of spectral bands and achieve good results, comparable with processing methods that require all hyperspectral bands. The proposed method for hyperspectral spectra classification is based on the Hidden Markov Model (HMM) associated to each Endmember (EM) of a scene and the conditional probabilities of each EM belongs to each other EM. The EM conditional probability is transformed in EM vector entropy and those vectors are used as reference vectors for the classes in the scene. The conditional probability of a spectrum that will be classified is also transformed in a spectrum entropy vector, which is classified in a given class by the minimum ED (Euclidian Distance) among it and the EM entropy vectors. The methodology was tested with good results using AVIRIS spectra of a scene with 13 EM considering the full 209 bands and the reduced spectral bands of 128, 64 and 32. For the test area its show that can be used only 32 spectral bands instead of the original 209 bands, without significant loss in the classification process.
Hardware accelerator design for tracking in smart camera
NASA Astrophysics Data System (ADS)
Singh, Sanjay; Dunga, Srinivasa Murali; Saini, Ravi; Mandal, A. S.; Shekhar, Chandra; Vohra, Anil
2011-10-01
Smart Cameras are important components in video analysis. For video analysis, smart cameras needs to detect interesting moving objects, track such objects from frame to frame, and perform analysis of object track in real time. Therefore, the use of real-time tracking is prominent in smart cameras. The software implementation of tracking algorithm on a general purpose processor (like PowerPC) could achieve low frame rate far from real-time requirements. This paper presents the SIMD approach based hardware accelerator designed for real-time tracking of objects in a scene. The system is designed and simulated using VHDL and implemented on Xilinx XUP Virtex-IIPro FPGA. Resulted frame rate is 30 frames per second for 250x200 resolution video in gray scale.
A GPU-based large-scale Monte Carlo simulation method for systems with long-range interactions
NASA Astrophysics Data System (ADS)
Liang, Yihao; Xing, Xiangjun; Li, Yaohang
2017-06-01
In this work we present an efficient implementation of Canonical Monte Carlo simulation for Coulomb many body systems on graphics processing units (GPU). Our method takes advantage of the GPU Single Instruction, Multiple Data (SIMD) architectures, and adopts the sequential updating scheme of Metropolis algorithm. It makes no approximation in the computation of energy, and reaches a remarkable 440-fold speedup, compared with the serial implementation on CPU. We further use this method to simulate primitive model electrolytes, and measure very precisely all ion-ion pair correlation functions at high concentrations. From these data, we extract the renormalized Debye length, renormalized valences of constituent ions, and renormalized dielectric constants. These results demonstrate unequivocally physics beyond the classical Poisson-Boltzmann theory.
Line-drawing algorithms for parallel machines
NASA Technical Reports Server (NTRS)
Pang, Alex T.
1990-01-01
The fact that conventional line-drawing algorithms, when applied directly on parallel machines, can lead to very inefficient codes is addressed. It is suggested that instead of modifying an existing algorithm for a parallel machine, a more efficient implementation can be produced by going back to the invariants in the definition. Popular line-drawing algorithms are compared with two alternatives; distance to a line (a point is on the line if sufficiently close to it) and intersection with a line (a point on the line if an intersection point). For massively parallel single-instruction-multiple-data (SIMD) machines (with thousands of processors and up), the alternatives provide viable line-drawing algorithms. Because of the pixel-per-processor mapping, their performance is independent of the line length and orientation.
Pulse-coupled neural network implementation in FPGA
NASA Astrophysics Data System (ADS)
Waldemark, Joakim T. A.; Lindblad, Thomas; Lindsey, Clark S.; Waldemark, Karina E.; Oberg, Johnny; Millberg, Mikael
1998-03-01
Pulse Coupled Neural Networks (PCNN) are biologically inspired neural networks, mainly based on studies of the visual cortex of small mammals. The PCNN is very well suited as a pre- processor for image processing, particularly in connection with object isolation, edge detection and segmentation. Several implementations of PCNN on von Neumann computers, as well as on special parallel processing hardware devices (e.g. SIMD), exist. However, these implementations are not as flexible as required for many applications. Here we present an implementation in Field Programmable Gate Arrays (FPGA) together with a performance analysis. The FPGA hardware implementation may be considered a platform for further, extended implementations and easily expanded into various applications. The latter may include advanced on-line image analysis with close to real-time performance.
Off disk-center potential field calculations using vector magnetograms
NASA Technical Reports Server (NTRS)
Venkatakrishnan, P.; Gary, G. Allen
1989-01-01
A potential field calculation for off disk-center vector magnetograms that uses all the three components of the measured field is investigated. There is neither any need for interpolation of grid points between the image plane and the heliographic plane nor for an extension or a truncation to a heliographic rectangle. Hence, the method provides the maximum information content from the photospheric field as well as the most consistent potential field independent of the viewing angle. The introduction of polarimetric noise produces a less tolerant extrapolation procedure than using the line-of-sight extrapolation, but the resultant standard deviation is still small enough for the practical utility of this method.
A modular toolset for recombination transgenesis and neurogenetic analysis of Drosophila.
Wang, Ji-Wu; Beck, Erin S; McCabe, Brian D
2012-01-01
Transgenic Drosophila have contributed extensively to our understanding of nervous system development, physiology and behavior in addition to being valuable models of human neurological disease. Here, we have generated a novel series of modular transgenic vectors designed to optimize and accelerate the production and analysis of transgenes in Drosophila. We constructed a novel vector backbone, pBID, that allows both phiC31 targeted transgene integration and incorporates insulator sequences to ensure specific and uniform transgene expression. Upon this framework, we have built a series of constructs that are either backwards compatible with existing restriction enzyme based vectors or utilize Gateway recombination technology for high-throughput cloning. These vectors allow for endogenous promoter or Gal4 targeted expression of transgenic proteins with or without fluorescent protein or epitope tags. In addition, we have generated constructs that facilitate transgenic splice isoform specific RNA inhibition of gene expression. We demonstrate the utility of these constructs to analyze proteins involved in nervous system development, physiology and neurodegenerative disease. We expect that these reagents will facilitate the proficiency and sophistication of Drosophila genetic analysis in both the nervous system and other tissues.
Douillard, François P; Mahony, Jennifer; Campanacci, Valérie; Cambillau, Christian; van Sinderen, Douwe
2011-09-01
Over the last 10 years, the NIsin Controlled Expression (NICE) system has been extensively used in the food-grade bacterium Lactococcus lactis subsp. cremoris to produce homologous and heterologous proteins for academic and biotechnological purposes. Although various L. lactis molecular tools have been developed, no expression vectors harboring the popular Gateway recombination system are currently available for this widely used cloning host. In this study, we constructed two expression vectors that combine the NICE and the Gateway recombination systems and we tested their applicability by recombining and over-expressing genes encoding structural proteins of lactococcal phages Tuc2009 and TP901-1. Over-expressed phage proteins were analyzed by immunoblotting and purified by His-tag affinity chromatography with protein productions yielding 2.8-3.7 mg/l of culture. This therefore is the first description of L. lactis NICE expression vectors which integrate the Gateway cloning technology and which are suitable for the production of sufficient amounts of proteins to facilitate subsequent structural and functional analyses. Copyright © 2011 Elsevier Inc. All rights reserved.
Ghorai, Santanu; Mukherjee, Anirban; Dutta, Pranab K
2010-06-01
In this brief we have proposed the multiclass data classification by computationally inexpensive discriminant analysis through vector-valued regularized kernel function approximation (VVRKFA). VVRKFA being an extension of fast regularized kernel function approximation (FRKFA), provides the vector-valued response at single step. The VVRKFA finds a linear operator and a bias vector by using a reduced kernel that maps a pattern from feature space into the low dimensional label space. The classification of patterns is carried out in this low dimensional label subspace. A test pattern is classified depending on its proximity to class centroids. The effectiveness of the proposed method is experimentally verified and compared with multiclass support vector machine (SVM) on several benchmark data sets as well as on gene microarray data for multi-category cancer classification. The results indicate the significant improvement in both training and testing time compared to that of multiclass SVM with comparable testing accuracy principally in large data sets. Experiments in this brief also serve as comparison of performance of VVRKFA with stratified random sampling and sub-sampling.
Analyzing neural responses with vector fields.
Buneo, Christopher A
2011-04-15
Analyzing changes in the shape and scale of single cell response fields is a key component of many neurophysiological studies. Typical analyses of shape change involve correlating firing rates between experimental conditions or "cross-correlating" single cell tuning curves by shifting them with respect to one another and correlating the overlapping data. Such shifting results in a loss of data, making interpretation of the resulting correlation coefficients problematic. The problem is particularly acute for two dimensional response fields, which require shifting along two axes. Here, an alternative method for quantifying response field shape and scale based on correlation of vector field representations is introduced. The merits and limitations of the methods are illustrated using both simulated and experimental data. It is shown that vector correlation provides more information on response field changes than scalar correlation without requiring field shifting and concomitant data loss. An extension of this vector field approach is also demonstrated which can be used to identify the manner in which experimental variables are encoded in studies of neural reference frames. Copyright © 2011 Elsevier B.V. All rights reserved.
Sparse representation based SAR vehicle recognition along with aspect angle.
Xing, Xiangwei; Ji, Kefeng; Zou, Huanxin; Sun, Jixiang
2014-01-01
As a method of representing the test sample with few training samples from an overcomplete dictionary, sparse representation classification (SRC) has attracted much attention in synthetic aperture radar (SAR) automatic target recognition (ATR) recently. In this paper, we develop a novel SAR vehicle recognition method based on sparse representation classification along with aspect information (SRCA), in which the correlation between the vehicle's aspect angle and the sparse representation vector is exploited. The detailed procedure presented in this paper can be summarized as follows. Initially, the sparse representation vector of a test sample is solved by sparse representation algorithm with a principle component analysis (PCA) feature-based dictionary. Then, the coefficient vector is projected onto a sparser one within a certain range of the vehicle's aspect angle. Finally, the vehicle is classified into a certain category that minimizes the reconstruction error with the novel sparse representation vector. Extensive experiments are conducted on the moving and stationary target acquisition and recognition (MSTAR) dataset and the results demonstrate that the proposed method performs robustly under the variations of depression angle and target configurations, as well as incomplete observation.
Evaluation of Cache-based Superscalar and Cacheless Vector Architectures for Scientific Computations
NASA Technical Reports Server (NTRS)
Oliker, Leonid; Carter, Jonathan; Shalf, John; Skinner, David; Ethier, Stephane; Biswas, Rupak; Djomehri, Jahed; VanderWijngaart, Rob
2003-01-01
The growing gap between sustained and peak performance for scientific applications has become a well-known problem in high performance computing. The recent development of parallel vector systems offers the potential to bridge this gap for a significant number of computational science codes and deliver a substantial increase in computing capabilities. This paper examines the intranode performance of the NEC SX6 vector processor and the cache-based IBM Power3/4 superscalar architectures across a number of key scientific computing areas. First, we present the performance of a microbenchmark suite that examines a full spectrum of low-level machine characteristics. Next, we study the behavior of the NAS Parallel Benchmarks using some simple optimizations. Finally, we evaluate the perfor- mance of several numerical codes from key scientific computing domains. Overall results demonstrate that the SX6 achieves high performance on a large fraction of our application suite and in many cases significantly outperforms the RISC-based architectures. However, certain classes of applications are not easily amenable to vectorization and would likely require extensive reengineering of both algorithm and implementation to utilize the SX6 effectively.
Precision vector control of a superconducting RF cavity driven by an injection locked magnetron
DOE Office of Scientific and Technical Information (OSTI.GOV)
Chase, Brian; Pasquinelli, Ralph; Cullerton, Ed
The technique presented in this paper enables the regulation of both radio frequency amplitude and phase in narrow band devices such as a Superconducting RF (SRF) cavity driven by constant power output devices i.e. magnetrons [1]. The ability to use low cost high efficiency magnetrons for accelerator RF power systems, with tight vector regulation, presents a substantial cost savings in both construction and operating costs - compared to current RF power system technology. An operating CW system at 2.45 GHz has been experimentally developed. Vector control of an injection locked magnetron has been extensively tested and characterized with a SRFmore » cavity as the load. Amplitude dynamic range of 30 dB, amplitude stability of 0.3% r.m.s, and phase stability of 0.26 degrees r.m.s. has been demonstrated.« less
NASA Astrophysics Data System (ADS)
Fazio, S.; Fiore, R.; Jenkovszky, L.; Lavorini, A.
2012-03-01
Exclusive diffractive production of real photons and vector mesons in ep collisions has been studied at HERA in a wide kinematic range. Here we present and discuss a Regge-type model of real photon production (deeply virtual Compton scattering), as well as production of vector mesons treated on the same footing by using an extension of a factorized Regge-pole model proposed earlier. The model has been fitted to the HERA data. Despite the very small number of the free parameters, the model gives a satisfactory description of the experimental data, both for the total cross section as a function of the photon virtuality Q2 or the energy W in the center of mass of the γ*p system, and the differential cross sections as a function of the squared four-momentum transfer t with fixed Q2 and W.
Learning atoms for materials discovery.
Zhou, Quan; Tang, Peizhe; Liu, Shenxiu; Pan, Jinbo; Yan, Qimin; Zhang, Shou-Cheng
2018-06-26
Exciting advances have been made in artificial intelligence (AI) during recent decades. Among them, applications of machine learning (ML) and deep learning techniques brought human-competitive performances in various tasks of fields, including image recognition, speech recognition, and natural language understanding. Even in Go, the ancient game of profound complexity, the AI player has already beat human world champions convincingly with and without learning from the human. In this work, we show that our unsupervised machines (Atom2Vec) can learn the basic properties of atoms by themselves from the extensive database of known compounds and materials. These learned properties are represented in terms of high-dimensional vectors, and clustering of atoms in vector space classifies them into meaningful groups consistent with human knowledge. We use the atom vectors as basic input units for neural networks and other ML models designed and trained to predict materials properties, which demonstrate significant accuracy. Copyright © 2018 the Author(s). Published by PNAS.
Genetically engineering adenoviral vectors for gene therapy.
Coughlan, Lynda
2014-01-01
Adenoviral (Ad) vectors are commonly used for various gene therapy applications. Significant advances in the genetic engineering of Ad vectors in recent years has highlighted their potential for the treatment of metastatic disease. There are several methods to genetically modify the Ad genome to incorporate retargeting peptides which will redirect the natural tropism of the viruses, including homologous recombination in bacteria or yeast. However, homologous recombination in yeast is highly efficient and can be achieved without the need for extensive cloning strategies. In addition, the method does not rely on the presence of unique restriction sites within the Ad genome and the reagents required for this method are widely available and inexpensive. Large plasmids containing the entire adenoviral genome (~36 kbp) can be modified within Saccharomyces cerevisiae yeast and genomes easily rescued in Escherichia coli hosts for analysis or amplification. A method for two-step homologous recombination in yeast is described in this chapter.
A quasi-current representation for information needs inspired by Two-State Vector Formalism
NASA Astrophysics Data System (ADS)
Wang, Panpan; Hou, Yuexian; Li, Jingfei; Zhang, Yazhou; Song, Dawei; Li, Wenjie
2017-09-01
Recently, a number of quantum theory (QT)-based information retrieval (IR) models have been proposed for modeling session search task that users issue queries continuously in order to describe their evolving information needs (IN). However, the standard formalism of QT cannot provide a complete description for users' current IN in a sense that it does not take the 'future' information into consideration. Therefore, to seek a more proper and complete representation for users' IN, we construct a representation of quasi-current IN inspired by an emerging Two-State Vector Formalism (TSVF). With the enlightenment of the completeness of TSVF, a "two-state vector" derived from the 'future' (the current query) and the 'history' (the previous query) is employed to describe users' quasi-current IN in a more complete way. Extensive experiments are conducted on the session tracks of TREC 2013 & 2014, and show that our model outperforms a series of compared IR models.
Molecular Ωc states generated from coupled meson-baryon channels
NASA Astrophysics Data System (ADS)
Debastiani, V. R.; Dias, J. M.; Liang, W. H.; Oset, E.
2018-05-01
We have investigated Ωc states that are dynamically generated from the meson-baryon interaction. We use an extension of the local hidden gauge to obtain the interaction from the exchange of vector mesons. We show that the dominant terms come from the exchange of light vectors, where the heavy quarks are spectators. This has as a consequence that heavy quark symmetry is preserved for the dominant terms in the (1 /mQ ) counting, and also that the interaction in this case can be obtained from the SU(3) chiral Lagrangians. We show that for a standard value for the cutoff regulating the loop, we obtain two states with JP=1/2 - and two more with JP=3/2 -, three of them in remarkable agreement with three experimental states in mass and width. We also make predictions at higher energies for states of vector-baryon nature.
Satellite Angular Rate Estimation From Vector Measurements
NASA Technical Reports Server (NTRS)
Azor, Ruth; Bar-Itzhack, Itzhack Y.; Harman, Richard R.
1996-01-01
This paper presents an algorithm for estimating the angular rate vector of a satellite which is based on the time derivatives of vector measurements expressed in a reference and body coordinate. The computed derivatives are fed into a spacial Kalman filter which yields an estimate of the spacecraft angular velocity. The filter, named Extended Interlaced Kalman Filter (EIKF), is an extension of the Kalman filter which, although being linear, estimates the state of a nonlinear dynamic system. It consists of two or three parallel Kalman filters whose individual estimates are fed to one another and are considered as known inputs by the other parallel filter(s). The nonlinear dynamics stem from the nonlinear differential equation that describes the rotation of a three dimensional body. Initial results, using simulated data, and real Rossi X ray Timing Explorer (RXTE) data indicate that the algorithm is efficient and robust.
Precision vector control of a superconducting RF cavity driven by an injection locked magnetron
Chase, Brian; Pasquinelli, Ralph; Cullerton, Ed; ...
2015-03-01
The technique presented in this paper enables the regulation of both radio frequency amplitude and phase in narrow band devices such as a Superconducting RF (SRF) cavity driven by constant power output devices i.e. magnetrons [1]. The ability to use low cost high efficiency magnetrons for accelerator RF power systems, with tight vector regulation, presents a substantial cost savings in both construction and operating costs - compared to current RF power system technology. An operating CW system at 2.45 GHz has been experimentally developed. Vector control of an injection locked magnetron has been extensively tested and characterized with a SRFmore » cavity as the load. Amplitude dynamic range of 30 dB, amplitude stability of 0.3% r.m.s, and phase stability of 0.26 degrees r.m.s. has been demonstrated.« less
MGRA: Motion Gesture Recognition via Accelerometer.
Hong, Feng; You, Shujuan; Wei, Meiyu; Zhang, Yongtuo; Guo, Zhongwen
2016-04-13
Accelerometers have been widely embedded in most current mobile devices, enabling easy and intuitive operations. This paper proposes a Motion Gesture Recognition system (MGRA) based on accelerometer data only, which is entirely implemented on mobile devices and can provide users with real-time interactions. A robust and unique feature set is enumerated through the time domain, the frequency domain and singular value decomposition analysis using our motion gesture set containing 11,110 traces. The best feature vector for classification is selected, taking both static and mobile scenarios into consideration. MGRA exploits support vector machine as the classifier with the best feature vector. Evaluations confirm that MGRA can accommodate a broad set of gesture variations within each class, including execution time, amplitude and non-gestural movement. Extensive evaluations confirm that MGRA achieves higher accuracy under both static and mobile scenarios and costs less computation time and energy on an LG Nexus 5 than previous methods.
Thieme, Frank; Marillonnet, Sylvestre
2014-01-01
Identification of unknown sequences that flank known sequences of interest requires PCR amplification of DNA fragments that contain the junction between the known and unknown flanking sequences. Since amplified products often contain a mixture of specific and nonspecific products, the quick and clean (QC) cloning procedure was developed to clone specific products only. QC cloning is a ligation-independent cloning procedure that relies on the exonuclease activity of T4 DNA polymerase to generate single-stranded extensions at the ends of the vector and insert. A specific feature of QC cloning is the use of vectors that contain a sequence called catching sequence that allows cloning specific products only. QC cloning is performed by a one-pot incubation of insert and vector in the presence of T4 DNA polymerase at room temperature for 10 min followed by direct transformation of the incubation mix in chemo-competent Escherichia coli cells.
Wong, Gwendolyn K L; Jim, C Y
2016-12-15
Green roof, an increasingly common constituent of urban green infrastructure, can provide multiple ecosystem services and mitigate climate-change and urban-heat-island challenges. Its adoption has been beset by a longstanding preconception of attracting urban pests like mosquitoes. As more cities may become vulnerable to emerging and re-emerging mosquito-borne infectious diseases, the knowledge gap needs to be filled. This study gauges the habitat preference of vector mosquitoes for extensive green roofs vis-à-vis positive and negative control sites in an urban setting. Seven sites in a university campus were selected to represent three experimental treatments: green roofs (GR), ground-level blue-green spaces as positive controls (PC), and bare roofs as negative controls (NC). Mosquito-trapping devices were deployed for a year from March 2015 to 2016. Human-biting mosquito species known to transmit infectious diseases in the region were identified and recorded as target species. Generalized linear models evaluated the effects of site type, season, and weather on vector-mosquito abundance. Our model revealed site type as a significant predictor of vector mosquito abundance, with considerably more vector mosquitoes captured in PC than in GR and NC. Vector abundance was higher in NC than in GR, attributed to the occasional presence of water pools in depressions of roofing membrane after rainfall. Our data also demonstrated seasonal differences in abundance. Weather variables were evaluated to assess human-vector contact risks under different weather conditions. Culex quinquefasciatus, a competent vector of diseases including lymphatic filariasis and West Nile fever, could be the most adaptable species. Our analysis demonstrates that green roofs are not particularly preferred by local vector mosquitoes compared to bare roofs and other urban spaces in a humid subtropical setting. The findings call for a better understanding of vector ecology in diverse urban landscapes to improve disease control efficacy amidst surging urbanization and changing climate. Copyright © 2016 Elsevier B.V. All rights reserved.
Suzuki, Nobuhiro; Geletka, Lynn M.; Nuss, Donald L.
2000-01-01
We have investigated whether hypoviruses, viral agents responsible for virulence attenuation (hypovirulence) of the chestnut blight fungus Cryphonectria parasitica, could serve as gene expression vectors. The infectious cDNA clone of the prototypic hypovirus CHV1-EP713 was modified to generate 20 different vector candidates. Although transient expression was achieved for a subset of vectors that contained the green fluorescent protein gene from Aequorea victoria, long-term expression (past day 8) was not observed for any vector construct. Analysis of viral RNAs recovered from transfected fungal colonies revealed that the foreign genes were readily deleted from the replicating virus, although small portions of foreign sequences were retained by some vectors after months of replication. However, the results of vector viability and progeny characterization provided unexpected new insights into essential and dispensable elements of hypovirus replication. The N-terminal portion (codons 1 to 24) of the 5′-proximal open reading frame (ORF), ORF A, was found to be required for virus replication, while the remaining 598 codons of this ORF were completely dispensable. Substantial alterations were tolerated in the pentanucleotide UAAUG that contains the ORF A termination codon and the overlapping putative initiation codon of the second of the two hypovirus ORFs, ORF B. Replication competence was maintained following either a frameshift mutation that caused a two-codon extension of ORF A or a modification that produced a single-ORF genomic organization. These results are discussed in terms of determinants of hypovirus replication, the potential utility of hypoviruses as gene expression vectors, and possible mechanisms by which hypoviruses recognize and delete foreign sequences. PMID:10906211
Vectors as Epidemiological Sentinels: Patterns of Within-Tick Borrelia burgdorferi Diversity
Walter, Katharine S.; Carpi, Giovanna; Evans, Benjamin R.; Caccone, Adalgisa; Diuk-Wasser, Maria A.
2016-01-01
Hosts including humans, other vertebrates, and arthropods, are frequently infected with heterogeneous populations of pathogens. Within-host pathogen diversity has major implications for human health, epidemiology, and pathogen evolution. However, pathogen diversity within-hosts is difficult to characterize and little is known about the levels and sources of within-host diversity maintained in natural populations of disease vectors. Here, we examine genomic variation of the Lyme disease bacteria, Borrelia burgdorferi (Bb), in 98 individual field-collected tick vectors as a model for study of within-host processes. Deep population sequencing reveals extensive and previously undocumented levels of Bb variation: the majority (~70%) of ticks harbor mixed strain infections, which we define as levels Bb diversity pre-existing in a diverse inoculum. Within-tick diversity is thus a sample of the variation present within vertebrate hosts. Within individual ticks, we detect signatures of positive selection. Genes most commonly under positive selection across ticks include those involved in dissemination in vertebrate hosts and evasion of the vertebrate immune complement. By focusing on tick-borne Bb, we show that vectors can serve as epidemiological and evolutionary sentinels: within-vector pathogen diversity can be a useful and unbiased way to survey circulating pathogen diversity and identify evolutionary processes occurring in natural transmission cycles. PMID:27414806
Supercomputer implementation of finite element algorithms for high speed compressible flows
NASA Technical Reports Server (NTRS)
Thornton, E. A.; Ramakrishnan, R.
1986-01-01
Prediction of compressible flow phenomena using the finite element method is of recent origin and considerable interest. Two shock capturing finite element formulations for high speed compressible flows are described. A Taylor-Galerkin formulation uses a Taylor series expansion in time coupled with a Galerkin weighted residual statement. The Taylor-Galerkin algorithms use explicit artificial dissipation, and the performance of three dissipation models are compared. A Petrov-Galerkin algorithm has as its basis the concepts of streamline upwinding. Vectorization strategies are developed to implement the finite element formulations on the NASA Langley VPS-32. The vectorization scheme results in finite element programs that use vectors of length of the order of the number of nodes or elements. The use of the vectorization procedure speeds up processing rates by over two orders of magnitude. The Taylor-Galerkin and Petrov-Galerkin algorithms are evaluated for 2D inviscid flows on criteria such as solution accuracy, shock resolution, computational speed and storage requirements. The convergence rates for both algorithms are enhanced by local time-stepping schemes. Extension of the vectorization procedure for predicting 2D viscous and 3D inviscid flows are demonstrated. Conclusions are drawn regarding the applicability of the finite element procedures for realistic problems that require hundreds of thousands of nodes.
NASA Technical Reports Server (NTRS)
Shaffer, Scott; Dunbar, R. Scott; Hsiao, S. Vincent; Long, David G.
1989-01-01
The NASA Scatterometer, NSCAT, is an active spaceborne radar designed to measure the normalized radar backscatter coefficient (sigma0) of the ocean surface. These measurements can, in turn, be used to infer the surface vector wind over the ocean using a geophysical model function. Several ambiguous wind vectors result because of the nature of the model function. A median-filter-based ambiguity removal algorithm will be used by the NSCAT ground data processor to select the best wind vector from the set of ambiguous wind vectors. This process is commonly known as dealiasing or ambiguity removal. The baseline NSCAT ambiguity removal algorithm and the method used to select the set of optimum parameter values are described. An extensive simulation of the NSCAT instrument and ground data processor provides a means of testing the resulting tuned algorithm. This simulation generates the ambiguous wind-field vectors expected from the instrument as it orbits over a set of realistic meoscale wind fields. The ambiguous wind field is then dealiased using the median-based ambiguity removal algorithm. Performance is measured by comparison of the unambiguous wind fields with the true wind fields. Results have shown that the median-filter-based ambiguity removal algorithm satisfies NSCAT mission requirements.
Velappan, Nileena; Fisher, Hugh E; Pesavento, Emanuele; Chasteen, Leslie; D'Angelo, Sara; Kiss, Csaba; Longmire, Michelle; Pavlik, Peter; Bradbury, Andrew R M
2010-03-01
Filamentous phage display has been extensively used to select proteins with binding properties of specific interest. Although many different display platforms using filamentous phage have been described, no comprehensive comparison of their abilities to display similar proteins has been conducted. This is particularly important for the display of cytoplasmic proteins, which are often poorly displayed with standard filamentous phage vectors. In this article, we have analyzed the ability of filamentous phage to display a stable form of green fluorescent protein and modified variants in nine different display vectors, a number of which have been previously proposed as being suitable for cytoplasmic protein display. Correct folding and display were assessed by phagemid particle fluorescence, and with anti-GFP antibodies. The poor correlation between phagemid particle fluorescence and recognition of GFP by antibodies, indicates that proteins may fold correctly without being accessible for display. The best vector used a twin arginine transporter leader to transport the displayed protein to the periplasm, and a coil-coil arrangement to link the displayed protein to g3p. This vector was able to display less robust forms of GFP, including ones with inserted epitopes, as well as fluorescent proteins of the Azami green series. It was also functional in mock selection experiments.
RNA Interference in Infectious Tropical Diseases
Hong, Young S.
2008-01-01
Introduction of double-stranded RNA (dsRNA) into some cells or organisms results in degradation of its homologous mRNA, a process called RNA interference (RNAi). The dsRNAs are processed into short interfering RNAs (siRNAs) that subsequently bind to the RNA-induced silencing complex (RISC), causing degradation of target mRNAs. Because of this sequence-specific ability to silence target genes, RNAi has been extensively used to study gene functions and has the potential to control disease pathogens or vectors. With this promise of RNAi to control pathogens and vectors, this paper reviews the current status of RNAi in protozoans, animal parasitic helminths and disease-transmitting vectors, such as insects. Many pathogens and vectors cause severe parasitic diseases in tropical regions and it is difficult to control once the host has been invaded. Intracellularly, RNAi can be highly effective in impeding parasitic development and proliferation within the host. To fully realize its potential as a means to control tropical diseases, appropriate delivery methods for RNAi should be developed, and possible off-target effects should be minimized for specific gene suppression. RNAi can also be utilized to reduce vector competence to interfere with disease transmission, as genes critical for pathogenesis of tropical diseases are knockdowned via RNAi. PMID:18344671
NASA Astrophysics Data System (ADS)
Francés, J.; Bleda, S.; Neipp, C.; Márquez, A.; Pascual, I.; Beléndez, A.
2013-03-01
The finite-difference time-domain method (FDTD) allows electromagnetic field distribution analysis as a function of time and space. The method is applied to analyze holographic volume gratings (HVGs) for the near-field distribution at optical wavelengths. Usually, this application requires the simulation of wide areas, which implies more memory and time processing. In this work, we propose a specific implementation of the FDTD method including several add-ons for a precise simulation of optical diffractive elements. Values in the near-field region are computed considering the illumination of the grating by means of a plane wave for different angles of incidence and including absorbing boundaries as well. We compare the results obtained by FDTD with those obtained using a matrix method (MM) applied to diffraction gratings. In addition, we have developed two optimized versions of the algorithm, for both CPU and GPU, in order to analyze the improvement of using the new NVIDIA Fermi GPU architecture versus highly tuned multi-core CPU as a function of the size simulation. In particular, the optimized CPU implementation takes advantage of the arithmetic and data transfer streaming SIMD (single instruction multiple data) extensions (SSE) included explicitly in the code and also of multi-threading by means of OpenMP directives. A good agreement between the results obtained using both FDTD and MM methods is obtained, thus validating our methodology. Moreover, the performance of the GPU is compared to the SSE+OpenMP CPU implementation, and it is quantitatively determined that a highly optimized CPU program can be competitive for a wider range of simulation sizes, whereas GPU computing becomes more powerful for large-scale simulations.
Ayres, Daniel L; Darling, Aaron; Zwickl, Derrick J; Beerli, Peter; Holder, Mark T; Lewis, Paul O; Huelsenbeck, John P; Ronquist, Fredrik; Swofford, David L; Cummings, Michael P; Rambaut, Andrew; Suchard, Marc A
2012-01-01
Phylogenetic inference is fundamental to our understanding of most aspects of the origin and evolution of life, and in recent years, there has been a concentration of interest in statistical approaches such as Bayesian inference and maximum likelihood estimation. Yet, for large data sets and realistic or interesting models of evolution, these approaches remain computationally demanding. High-throughput sequencing can yield data for thousands of taxa, but scaling to such problems using serial computing often necessitates the use of nonstatistical or approximate approaches. The recent emergence of graphics processing units (GPUs) provides an opportunity to leverage their excellent floating-point computational performance to accelerate statistical phylogenetic inference. A specialized library for phylogenetic calculation would allow existing software packages to make more effective use of available computer hardware, including GPUs. Adoption of a common library would also make it easier for other emerging computing architectures, such as field programmable gate arrays, to be used in the future. We present BEAGLE, an application programming interface (API) and library for high-performance statistical phylogenetic inference. The API provides a uniform interface for performing phylogenetic likelihood calculations on a variety of compute hardware platforms. The library includes a set of efficient implementations and can currently exploit hardware including GPUs using NVIDIA CUDA, central processing units (CPUs) with Streaming SIMD Extensions and related processor supplementary instruction sets, and multicore CPUs via OpenMP. To demonstrate the advantages of a common API, we have incorporated the library into several popular phylogenetic software packages. The BEAGLE library is free open source software licensed under the Lesser GPL and available from http://beagle-lib.googlecode.com. An example client program is available as public domain software.
Ayres, Daniel L.; Darling, Aaron; Zwickl, Derrick J.; Beerli, Peter; Holder, Mark T.; Lewis, Paul O.; Huelsenbeck, John P.; Ronquist, Fredrik; Swofford, David L.; Cummings, Michael P.; Rambaut, Andrew; Suchard, Marc A.
2012-01-01
Abstract Phylogenetic inference is fundamental to our understanding of most aspects of the origin and evolution of life, and in recent years, there has been a concentration of interest in statistical approaches such as Bayesian inference and maximum likelihood estimation. Yet, for large data sets and realistic or interesting models of evolution, these approaches remain computationally demanding. High-throughput sequencing can yield data for thousands of taxa, but scaling to such problems using serial computing often necessitates the use of nonstatistical or approximate approaches. The recent emergence of graphics processing units (GPUs) provides an opportunity to leverage their excellent floating-point computational performance to accelerate statistical phylogenetic inference. A specialized library for phylogenetic calculation would allow existing software packages to make more effective use of available computer hardware, including GPUs. Adoption of a common library would also make it easier for other emerging computing architectures, such as field programmable gate arrays, to be used in the future. We present BEAGLE, an application programming interface (API) and library for high-performance statistical phylogenetic inference. The API provides a uniform interface for performing phylogenetic likelihood calculations on a variety of compute hardware platforms. The library includes a set of efficient implementations and can currently exploit hardware including GPUs using NVIDIA CUDA, central processing units (CPUs) with Streaming SIMD Extensions and related processor supplementary instruction sets, and multicore CPUs via OpenMP. To demonstrate the advantages of a common API, we have incorporated the library into several popular phylogenetic software packages. The BEAGLE library is free open source software licensed under the Lesser GPL and available from http://beagle-lib.googlecode.com. An example client program is available as public domain software. PMID:21963610
Edge Detection and Geometric Methods in Computer Vision,
1985-02-01
enlightening discussion) Derivations or Eqs. 3.29, 3.31, 3.32 (some statistics) Experimental results (pictures)-- not very informative, extensive or useful. lie... neurophysiology and hardware design. If one views 9 the state space as a free vector space on the labels over the field of weights (which we take to be R), then
76 FR 3135 - Pesticide Experimental Use Permit; Receipt of Extension Application;
Federal Register 2010, 2011, 2012, 2013, 2014
2011-01-19
... ENVIRONMENTAL PROTECTION AGENCY [EPA-HQ-OPP-2009-0608; FRL-8855-3] Pesticide Experimental Use... (PIP) [Event 5307] Bacillus thuringiensis eCry3.1Ab protein and the genetic material necessary for its production (vector pSYN12274) in Event 5307 corn (SYN-[Oslash]53[Oslash]7-1) and combined and single trait...
NASA Technical Reports Server (NTRS)
Smith, R. L.; Huang, C.
1986-01-01
A recent mathematical technique for solving systems of equations is applied in a very general way to the orbit determination problem. The study of this technique, the homotopy continuation method, was motivated by the possible need to perform early orbit determination with the Tracking and Data Relay Satellite System (TDRSS), using range and Doppler tracking alone. Basically, a set of six tracking observations is continuously transformed from a set with known solution to the given set of observations with unknown solutions, and the corresponding orbit state vector is followed from the a priori estimate to the solutions. A numerical algorithm for following the state vector is developed and described in detail. Numerical examples using both real and simulated TDRSS tracking are given. A prototype early orbit determination algorithm for possible use in TDRSS orbit operations was extensively tested, and the results are described. Preliminary studies of two extensions of the method are discussed: generalization to a least-squares formulation and generalization to an exhaustive global method.
Extensions to the Dynamic Aerospace Vehicle Exchange Markup Language
NASA Technical Reports Server (NTRS)
Brian, Geoffrey J.; Jackson, E. Bruce
2011-01-01
The Dynamic Aerospace Vehicle Exchange Markup Language (DAVE-ML) is a syntactical language for exchanging flight vehicle dynamic model data. It provides a framework for encoding entire flight vehicle dynamic model data packages for exchange and/or long-term archiving. Version 2.0.1 of DAVE-ML provides much of the functionality envisioned for exchanging aerospace vehicle data; however, it is limited in only supporting scalar time-independent data. Additional functionality is required to support vector and matrix data, abstracting sub-system models, detailing dynamics system models (both discrete and continuous), and defining a dynamic data format (such as time sequenced data) for validation of dynamics system models and vehicle simulation packages. Extensions to DAVE-ML have been proposed to manage data as vectors and n-dimensional matrices, and record dynamic data in a compatible form. These capabilities will improve the clarity of data being exchanged, simplify the naming of parameters, and permit static and dynamic data to be stored using a common syntax within a single file; thereby enhancing the framework provided by DAVE-ML for exchanging entire flight vehicle dynamic simulation models.
Web Extensible Display Manager
DOE Office of Scientific and Technical Information (OSTI.GOV)
Slominski, Ryan; Larrieu, Theodore L.
Jefferson Lab's Web Extensible Display Manager (WEDM) allows staff to access EDM control system screens from a web browser in remote offices and from mobile devices. Native browser technologies are leveraged to avoid installing and managing software on remote clients such as browser plugins, tunnel applications, or an EDM environment. Since standard network ports are used firewall exceptions are minimized. To avoid security concerns from remote users modifying a control system, WEDM exposes read-only access and basic web authentication can be used to further restrict access. Updates of monitored EPICS channels are delivered via a Web Socket using a webmore » gateway. The software translates EDM description files (denoted with the edl suffix) to HTML with Scalable Vector Graphics (SVG) following the EDM's edl file vector drawing rules to create faithful screen renderings. The WEDM server parses edl files and creates the HTML equivalent in real-time allowing existing screens to work without modification. Alternatively, the familiar drag and drop EDM screen creation tool can be used to create optimized screens sized specifically for smart phones and then rendered by WEDM.« less
Image Coding Based on Address Vector Quantization.
NASA Astrophysics Data System (ADS)
Feng, Yushu
Image coding is finding increased application in teleconferencing, archiving, and remote sensing. This thesis investigates the potential of Vector Quantization (VQ), a relatively new source coding technique, for compression of monochromatic and color images. Extensions of the Vector Quantization technique to the Address Vector Quantization method have been investigated. In Vector Quantization, the image data to be encoded are first processed to yield a set of vectors. A codeword from the codebook which best matches the input image vector is then selected. Compression is achieved by replacing the image vector with the index of the code-word which produced the best match, the index is sent to the channel. Reconstruction of the image is done by using a table lookup technique, where the label is simply used as an address for a table containing the representative vectors. A code-book of representative vectors (codewords) is generated using an iterative clustering algorithm such as K-means, or the generalized Lloyd algorithm. A review of different Vector Quantization techniques are given in chapter 1. Chapter 2 gives an overview of codebook design methods including the Kohonen neural network to design codebook. During the encoding process, the correlation of the address is considered and Address Vector Quantization is developed for color image and monochrome image coding. Address VQ which includes static and dynamic processes is introduced in chapter 3. In order to overcome the problems in Hierarchical VQ, Multi-layer Address Vector Quantization is proposed in chapter 4. This approach gives the same performance as that of the normal VQ scheme but the bit rate is about 1/2 to 1/3 as that of the normal VQ method. In chapter 5, a Dynamic Finite State VQ based on a probability transition matrix to select the best subcodebook to encode the image is developed. In chapter 6, a new adaptive vector quantization scheme, suitable for color video coding, called "A Self -Organizing Adaptive VQ Technique" is presented. In addition to chapters 2 through 6 which report on new work, this dissertation includes one chapter (chapter 1) and part of chapter 2 which review previous work on VQ and image coding, respectively. Finally, a short discussion of directions for further research is presented in conclusion.
Alves, João Nuno; Muir, Elizabeth M; Andrews, Melissa R; Ward, Anneliese; Michelmore, Nicholas; Dasgupta, Debayan; Verhaagen, Joost; Moloney, Elizabeth B; Keynes, Roger J; Fawcett, James W; Rogers, John H
2014-04-30
As part of a project to express chondroitinase ABC (ChABC) in neurons of the central nervous system, we have inserted a modified ChABC gene into an adeno-associated viral (AAV) vector and injected it into the vibrissal motor cortex in adult rats to determine the extent and distribution of expression of the enzyme. A similar vector for expression of green fluorescent protein (GFP) was injected into the same location. For each vector, two versions with minor differences were used, giving similar results. After 4 weeks, the brains were stained to show GFP and products of chondroitinase digestion. Chondroitinase was widely expressed, and the AAV-ChABC and AAV-GFP vectors gave similar expression patterns in many respects, consistent with the known projections from the directly transduced neurons in vibrissal motor cortex and adjacent cingulate cortex. In addition, diffusion of vector to deeper neuronal populations led to labelling of remote projection fields which was much more extensive with AAV-ChABC than with AAV-GFP. The most notable of these populations are inferred to be neurons of cortical layer 6, projecting widely in the thalamus, and neurons of the anterior pole of the hippocampus, projecting through most of the hippocampus. We conclude that, whereas GFP does not label the thinnest axonal branches of some neuronal types, chondroitinase is efficiently secreted from these arborisations and enables their extent to be sensitively visualised. After 12 weeks, chondroitinase expression was undiminished. Copyright © 2014 Elsevier B.V. All rights reserved.
Analysis of vector wind change with respect to time for Cape Kennedy, Florida
NASA Technical Reports Server (NTRS)
Adelfang, S. I.
1978-01-01
Multivariate analysis was used to determine the joint distribution of the four variables represented by the components of the wind vector at an initial time and after a specified elapsed time is hypothesized to be quadravariate normal; the fourteen statistics of this distribution, calculated from 15 years of twice-daily rawinsonde data are presented by monthly reference periods for each month from 0 to 27 km. The hypotheses that the wind component changes with respect to time is univariate normal, that the joint distribution of wind component change with respect to time is univariate normal, that the joint distribution of wind component changes is bivariate normal, and that the modulus of vector wind change is Rayleigh are tested by comparison with observed distributions. Statistics of the conditional bivariate normal distributions of vector wind at a future time given the vector wind at an initial time are derived. Wind changes over time periods from 1 to 5 hours, calculated from Jimsphere data, are presented. Extension of the theoretical prediction (based on rawinsonde data) of wind component change standard deviation to time periods of 1 to 5 hours falls (with a few exceptions) within the 95 percentile confidence band of the population estimate obtained from the Jimsphere sample data. The joint distributions of wind change components, conditional wind components, and 1 km vector wind shear change components are illustrated by probability ellipses at the 95 percentile level.
Lara-Silva, Fabiana de Oliveira; Michalsky, Érika Monteiro; Fortes-Dias, Consuelo Latorre; Fiuza, Vanessa de Oliveira Pires; Dias, Edelberto Santos
2017-12-01
Leishmaniases are vector-borne diseases that are transmitted to humans through the bite of Leishmania-infected phlebotomine sand flies (Diptera:Psychodidae). The main proved vector of visceral leishmaniais (VL) in the New World - Lutzomyia longipalpis - is well-adapted to urban areas and has extensive distribution within the five geographical regions of Brazil. Integrated public health actions directed for the vector, domestic reservoir and humans for the control of VL are preferentially applied in municipalities with higher epidemiological risk of transmission. In this study, we evaluated the individual impact of two main vector control actions - chemical spraying and environmental management - in two districts with no reported cases of human VL. Although belonging to an endemic municipality for VL in Brazil, the integrated control actions have not been applied in these districts due to the absence of human cases. The number of L. longipalpis captured in a two-year period was used as indicator of the population density of the vector. After chemical spraying a tendency of reduction in L. longipalpis was observed but with no statistical significance compared to the control. Environmental management was effective in that reduction and it may help in the control of VL by reducing the population density of the vector in a preventive and more permanent action, perhaps associated with chemical spraying. Copyright © 2017 Elsevier B.V. All rights reserved.
Mode of Infection of Metarhizium spp. Fungus and Their Potential as Biological Control Agents
Aw, Kimberly Moon San; Hue, Seow Mun
2017-01-01
Chemical insecticides have been commonly used to control agricultural pests, termites, and biological vectors such as mosquitoes and ticks. However, the harmful impacts of toxic chemical insecticides on the environment, the development of resistance in pests and vectors towards chemical insecticides, and public concern have driven extensive research for alternatives, especially biological control agents such as fungus and bacteria. In this review, the mode of infection of Metarhizium fungus on both terrestrial and aquatic insect larvae and how these interactions have been widely employed will be outlined. The potential uses of Metarhizium anisopliae and Metarhizium acridum biological control agents and molecular approaches to increase their virulence will be discussed. PMID:29371548
High frequency vibration analysis by the complex envelope vectorization.
Giannini, O; Carcaterra, A; Sestieri, A
2007-06-01
The complex envelope displacement analysis (CEDA) is a procedure to solve high frequency vibration and vibro-acoustic problems, providing the envelope of the physical solution. CEDA is based on a variable transformation mapping the high frequency oscillations into signals of low frequency content and has been successfully applied to one-dimensional systems. However, the extension to plates and vibro-acoustic fields met serious difficulties so that a general revision of the theory was carried out, leading finally to a new method, the complex envelope vectorization (CEV). In this paper the CEV method is described, underlying merits and limits of the procedure, and a set of applications to vibration and vibro-acoustic problems of increasing complexity are presented.
A vectorized Lanczos eigensolver for high-performance computers
NASA Technical Reports Server (NTRS)
Bostic, Susan W.
1990-01-01
The computational strategies used to implement a Lanczos-based-method eigensolver on the latest generation of supercomputers are described. Several examples of structural vibration and buckling problems are presented that show the effects of using optimization techniques to increase the vectorization of the computational steps. The data storage and access schemes and the tools and strategies that best exploit the computer resources are presented. The method is implemented on the Convex C220, the Cray 2, and the Cray Y-MP computers. Results show that very good computation rates are achieved for the most computationally intensive steps of the Lanczos algorithm and that the Lanczos algorithm is many times faster than other methods extensively used in the past.
APRON: A Cellular Processor Array Simulation and Hardware Design Tool
NASA Astrophysics Data System (ADS)
Barr, David R. W.; Dudek, Piotr
2009-12-01
We present a software environment for the efficient simulation of cellular processor arrays (CPAs). This software (APRON) is used to explore algorithms that are designed for massively parallel fine-grained processor arrays, topographic multilayer neural networks, vision chips with SIMD processor arrays, and related architectures. The software uses a highly optimised core combined with a flexible compiler to provide the user with tools for the design of new processor array hardware architectures and the emulation of existing devices. We present performance benchmarks for the software processor array implemented on standard commodity microprocessors. APRON can be configured to use additional processing hardware if necessary and can be used as a complete graphical user interface and development environment for new or existing CPA systems, allowing more users to develop algorithms for CPA systems.
Applications of massively parallel computers in telemetry processing
NASA Technical Reports Server (NTRS)
El-Ghazawi, Tarek A.; Pritchard, Jim; Knoble, Gordon
1994-01-01
Telemetry processing refers to the reconstruction of full resolution raw instrumentation data with artifacts, of space and ground recording and transmission, removed. Being the first processing phase of satellite data, this process is also referred to as level-zero processing. This study is aimed at investigating the use of massively parallel computing technology in providing level-zero processing to spaceflights that adhere to the recommendations of the Consultative Committee on Space Data Systems (CCSDS). The workload characteristics, of level-zero processing, are used to identify processing requirements in high-performance computing systems. An example of level-zero functions on a SIMD MPP, such as the MasPar, is discussed. The requirements in this paper are based in part on the Earth Observing System (EOS) Data and Operation System (EDOS).
Sen, Dwaipayan; Gadkari, Rupali A; Sudha, Govindarajan; Gabriel, Nishanth; Kumar, Yesupatham Sathish; Selot, Ruchita; Samuel, Rekha; Rajalingam, Sumathi; Ramya, V.; Nair, Sukesh C.; Srinivasan, Narayanaswamy; Srivastava, Alok
2013-01-01
Abstract Recombinant adeno-associated virus vectors based on serotype 8 (AAV8) have shown significant promise for liver-directed gene therapy. However, to overcome the vector dose dependent immunotoxicity seen with AAV8 vectors, it is important to develop better AAV8 vectors that provide enhanced gene expression at significantly low vector doses. Since it is known that AAV vectors during intracellular trafficking are targeted for destruction in the cytoplasm by the host–cellular kinase/ubiquitination/proteasomal machinery, we modified specific serine/threonine kinase or ubiquitination targets on the AAV8 capsid to augment its transduction efficiency. Point mutations at specific serine (S)/threonine (T)/lysine (K) residues were introduced in the AAV8 capsid at the positions equivalent to that of the effective AAV2 mutants, generated successfully earlier. Extensive structure analysis was carried out subsequently to evaluate the structural equivalence between the two serotypes. scAAV8 vectors with the wild-type (WT) and each one of the S/T→Alanine (A) or K-Arginine (R) mutant capsids were evaluated for their liver transduction efficiency in C57BL/6 mice in vivo. Two of the AAV8-S→A mutants (S279A and S671A), and a K137R mutant vector, demonstrated significantly higher enhanced green fluorescent protein (EGFP) transcript levels (∼9- to 46-fold) in the liver compared to animals that received WT-AAV8 vectors alone. The best performing AAV8 mutant (K137R) vector also had significantly reduced ubiquitination of the viral capsid, reduced activation of markers of innate immune response, and a concomitant two-fold reduction in the levels of neutralizing antibody formation in comparison to WT-AAV8 vectors. Vector biodistribution studies revealed that the K137R mutant had a significantly higher and preferential transduction of the liver (106 vs. 7.7 vector copies/mouse diploid genome) when compared to WT-AAV8 vectors. To further study the utility of the K137R-AAV8 mutant in therapeutic gene transfer, we delivered human coagulation factor IX (h.FIX) under the control of liver-specific promoters (LP1 or hAAT) into C57BL/6 mice. The circulating levels of h.FIX:Ag were higher in all the K137R-AAV8 treated groups up to 8 weeks post-hepatic gene transfer. These studies demonstrate the feasibility of the use of this novel AAV8 vectors for potential gene therapy of hemophilia B. PMID:23442071
77 FR 26547 - Amendment/Extension of an Experimental Use Permit
Federal Register 2010, 2011, 2012, 2013, 2014
2012-05-04
...-incorporated protectant (PIP) [Event 5307] Bacillus thuringiensis eCry3.1Ab protein and the genetic material necessary for its production (vector pSYN12274) in Event 5307 corn (SYN-[Oslash]53[Oslash]7-1) and combined and single trait hybrids with one or more of the following additional PIPs: (1) [Bt11] Bacillus...
A simplified approach to construct infectious cDNA clones of a tobamovirus in a binary vector.
Junqueira, Bruna Rayane Teodoro; Nicolini, Cícero; Lucinda, Natalia; Orílio, Anelise Franco; Nagata, Tatsuya
2014-03-01
Infectious cDNA clones of RNA viruses are important tools to study molecular processes such as replication and host-virus interactions. However, the cloning steps necessary for construction of cDNAs of viral RNA genomes in binary vectors are generally laborious. In this study, a simplified method of producing an agro-infectious Pepper mild mottle virus (PMMoV) clone is described in detail. Initially, the complete genome of PMMoV was amplified by a single-step RT-PCR, cloned, and subcloned into a small plasmid vector under the T7 RNA polymerase promoter to confirm the infectivity of the cDNA clone through transcript inoculation. The complete genome was then transferred to a binary vector using a single-step, overlap-extension PCR. The selected clones were agro-infiltrated to Nicotiana benthamiana plants and showed to be infectious, causing typical PMMoV symptoms. No differences in host responses were observed when the wild-type PMMoV isolate, the T7 RNA polymerase-derived transcripts and the agroinfiltration-derived viruses were inoculated to N. benthamiana, Capsicum chinense PI 159236 and Capsicum annuum plants. Copyright © 2013 Elsevier B.V. All rights reserved.
A Modular Toolset for Recombination Transgenesis and Neurogenetic Analysis of Drosophila
Wang, Ji-Wu; Beck, Erin S.; McCabe, Brian D.
2012-01-01
Transgenic Drosophila have contributed extensively to our understanding of nervous system development, physiology and behavior in addition to being valuable models of human neurological disease. Here, we have generated a novel series of modular transgenic vectors designed to optimize and accelerate the production and analysis of transgenes in Drosophila. We constructed a novel vector backbone, pBID, that allows both phiC31 targeted transgene integration and incorporates insulator sequences to ensure specific and uniform transgene expression. Upon this framework, we have built a series of constructs that are either backwards compatible with existing restriction enzyme based vectors or utilize Gateway recombination technology for high-throughput cloning. These vectors allow for endogenous promoter or Gal4 targeted expression of transgenic proteins with or without fluorescent protein or epitope tags. In addition, we have generated constructs that facilitate transgenic splice isoform specific RNA inhibition of gene expression. We demonstrate the utility of these constructs to analyze proteins involved in nervous system development, physiology and neurodegenerative disease. We expect that these reagents will facilitate the proficiency and sophistication of Drosophila genetic analysis in both the nervous system and other tissues. PMID:22848718
Germano, Mónica Daniela; Inés Picollo, María
2015-06-01
Effective chemical control relies on reducing vector population size. However, insecticide selection pressure is often associated with the development of resistant populations that reduce control success. In treated areas, these resistant individuals present an adaptive advantage due to enhanced survival. Resistance can also lead to negative effects when the insecticide pressure ceases. In this study, the biological effects of deltamethrin resistance were assessed in the Chagas disease vector Triatoma infestans. The length of each developmental stage and complete life cycle, mating rate, and fecundity were evaluated. Susceptible and resistant insects presented similar mating rates. A reproductive cost of resistance was expressed as a lower fecundity in the resistant colony. Developmental costs in the resistant colony were in the form of a shortening of the second and third nymph stage duration and an extension of the fifth stage. A maternal effect of deltamethrin resistance is suggested as these effects were identified in resistant females and their progeny independently of the mated male's deltamethrin response. Our results suggest the presence of pleiotropic effects of deltamethrin resistance. Possible associations of these characters to other traits such as developmental delays and behavioral resistance are discussed. © 2015 The Society for Vector Ecology.
Environmental Drivers of West Nile Fever Epidemiology in Europe and Western Asia—A Review
Paz, Shlomit; Semenza, Jan C.
2013-01-01
Abiotic and biotic conditions are both important determinants of West Nile Fever (WNF) epidemiology. Ambient temperature plays an important role in the growth rates of vector populations, the interval between blood meals, viral replication rates and transmission of West Nile Virus (WNV). The contribution of precipitation is more complex and less well understood. In this paper we discuss impacts of climatic parameters (temperature, relative humidity, precipitation) and other environmental drivers (such as bird migration, land use) on WNV transmission in Europe. WNV recently became established in southeastern Europe, with a large outbreak in the summer of 2010 and recurrent outbreaks in 2011 and 2012. Abundant competent mosquito vectors, bridge vectors, infected (viremic) migrating and local (amplifying) birds are all important characteristics of WNV transmission. In addition, certain key climatic factors, such as increased ambient temperatures, and by extension climate change, may also favor WNF transmission, and they should be taken into account when evaluating the risk of disease spread in the coming years. Monitoring epidemic precursors of WNF, such as significant temperature deviations in high risk areas, could be used to trigger vector control programs and public education campaigns. PMID:23939389
NASA Astrophysics Data System (ADS)
Zhang, Chen; Yuan, Heng; Zhang, Ning; Xu, Lixia; Zhang, Jixing; Li, Bo; Fang, Jiancheng
2018-04-01
Negatively charged nitrogen vacancy (NV‑) centers in diamond have been extensively studied as high-sensitivity magnetometers, showcasing a wide range of applications. This study experimentally demonstrates a vector magnetometry scheme based on synchronous manipulation of NV‑ center ensembles in all crystal directions using double frequency microwaves (MWs) and multi-coupled-strip-lines (mCSL) waveguide. The application of the mCSL waveguide ensures a high degree of synchrony (99%) for manipulating NV‑ centers in multiple orientations in a large volume. Manipulation with double frequency MWs makes NV‑ centers of all four crystal directions involved, and additionally leads to an enhancement of the manipulation field. In this work, by monitoring the changes in the slope of the resonance line consisting of multi-axes NV‑ centers, measurement of the direction of the external field vector was demonstrated with a sensitivity of {{10}\\prime}/\\sqrt{Hz} . Based on the scheme, the fluorescence signal contrast was improved by four times higher and the sensitivity to the magnetic field strength was improved by two times. The method provides a more practical way of achieving vector sensors based on NV‑ center ensembles in diamond.
Sequence and immunogenicity of a clinically approved novel measles virus vaccine vector
Zuniga, Amando; Liniger, Mathias; Morin, Teldja Neige Azzouz; Marty, René R.; Wiegand, Marian; Ilter, Orhan; Weibel, Sara; Billeter, Martin A.; Knuchel, Marlyse C.; Naim, Hussein Y.
2013-01-01
The measles virus vaccine (MVbv) is a clinically certified and well-tolerated vaccine strain that has been given both parenterally and mucosally. It has been extensively used in children and has proven to be safe and effective in eliciting protective immunity. This specific strain was therefore chosen to generate a measles viral vector. The genome of the commercial MVbv vaccine strain was isolated, sequenced and a plasmid, p(+)MVb, enabling transcription of the viral antigenome and rescue of MVb, was constructed. Phylogenic and phenotypic analysis revealed that MVbv and the rescued MVb constitute another evolutionary branch within the hitherto classified measles vaccines. Plasmid p(+)MVb was modified by insertion of artificial MV-type transcription units (ATUs) for the generation of recombinant viruses (rMVb) expressing additional proteins. Replication characteristics and immunogenicity of rMVb vectors were similar to the parental MVbv and to other vaccine strains. The expression of the additional proteins was stable over 10 serial virus transfers, which corresponds to an amplification greater than 1020. The excellent safety record and its efficient application as aerosol may add to the usefulness of the derived vectors. PMID:23324616
Nayduch, Dana; Lee, Matthew B; Saski, Christopher A
2014-01-01
Unlike other important vectors such as mosquitoes and sandflies, genetic and genomic tools for Culicoides biting midges are lacking, despite the fact that they vector a large number of arboviruses and other pathogens impacting humans and domestic animals world-wide. In North America, female Culicoides sonorensis midges are important vectors of bluetongue virus (BTV) and epizootic hemorrhagic disease virus (EHDV), orbiviruses that cause significant disease in livestock and wildlife. Libraries of tissue-specific transcripts expressed in response to feeding and oral orbivirus challenge in C. sonorensis have previously been reported, but extensive genome-wide expression profiling in the midge has not. Here, we successfully used deep sequencing technologies to construct the first adult female C. sonorensis reference transcriptome, and utilized genome-wide expression profiling to elucidate the genetic response to blood and sucrose feeding over time. The adult female midge unigene consists of 19,041 genes, of which less than 7% are differentially expressed during the course of a sucrose meal, while up to 52% of the genes respond significantly in blood-fed midges, indicating hematophagy induces complex physiological processes. Many genes that were differentially expressed during blood feeding were associated with digestion (e.g. proteases, lipases), hematophagy (e.g., salivary proteins), and vitellogenesis, revealing many major metabolic and biological factors underlying these critical processes. Additionally, key genes in the vitellogenesis pathway were identified, which provides the first glimpse into the molecular basis of anautogeny for C. sonorensis. This is the first extensive transcriptome for this genus, which will serve as a framework for future expression studies, RNAi, and provide a rich dataset contributing to the ultimate goal of informing a reference genome assembly and annotation. Moreover, this study will serve as a foundation for subsequent studies of genome-wide expression analyses during early orbivirus infection and dissecting the molecular mechanisms behind vector competence in midges.
Beyond generalized Proca theories
NASA Astrophysics Data System (ADS)
Heisenberg, Lavinia; Kase, Ryotaro; Tsujikawa, Shinji
2016-09-01
We consider higher-order derivative interactions beyond second-order generalized Proca theories that propagate only the three desired polarizations of a massive vector field besides the two tensor polarizations from gravity. These new interactions follow the similar construction criteria to those arising in the extension of scalar-tensor Horndeski theories to Gleyzes-Langlois-Piazza-Vernizzi (GLPV) theories. On the isotropic cosmological background, we show the existence of a constraint with a vanishing Hamiltonian that removes the would-be Ostrogradski ghost. We study the behavior of linear perturbations on top of the isotropic cosmological background in the presence of a matter perfect fluid and find the same number of propagating degrees of freedom as in generalized Proca theories (two tensor polarizations, two transverse vector modes, and two scalar modes). Moreover, we obtain the conditions for the avoidance of ghosts and Laplacian instabilities of tensor, vector, and scalar perturbations. We observe key differences in the scalar sound speed, which is mixed with the matter sound speed outside the domain of generalized Proca theories.
Kinsman, Nicole; Gibbs, Ann E.; Nolan, Matt
2015-01-01
For extensive and remote coastlines, the absence of high-quality elevation models—for example, those produced with lidar—leaves some coastal populations lacking one of the essential elements for mapping shoreline positions or flood extents. Here, we compare seven different elevation products in a lowlying area in western Alaska to establish their appropriateness for coastal mapping applications that require the delineation of elevation-based vectors. We further investigate the effective use of a Structure from Motion (SfM)-derived surface model (vertical RMSE<20 cm) by generating a tidal datum-based shoreline and an inundation extent map for a 2011 flood event. Our results suggest that SfM-derived elevation products can yield elevation-based vector features that have horizontal positional uncertainties comparable to those derived from other techniques. We also provide a rule-of-thumb equation to aid in the selection of minimum elevation model specifications based on terrain slope, vertical uncertainties, and desired horizontal accuracy.
Barbu, Corentin; Dumonteil, Eric; Gourbière, Sébastien
2011-01-01
Background Chagas disease is a major neglected tropical disease with deep socio-economical effects throughout Central and South America. Vector control programs have consistently reduced domestic populations of triatomine vectors, but non-domiciliated vectors still have to be controlled efficiently. Designing control strategies targeting these vectors is challenging, as it requires a quantitative description of the spatio-temporal dynamics of village infestation, which can only be gained from combinations of extensive field studies and spatial population dynamic modelling. Methodology/Principal Findings A spatially explicit population dynamic model was combined with a two-year field study of T. dimidiata infestation dynamics in the village of Teya, Mexico. The parameterized model fitted and predicted accurately both intra-annual variation and the spatial gradient in vector abundance. Five different control strategies were then applied in concentric rings to mimic spatial design targeting the periphery of the village, where vectors were most abundant. Indoor insecticide spraying and insect screens reduced vector abundance by up to 80% (when applied to the whole village), and half of this effect was obtained when control was applied only to the 33% of households closest to the village periphery. Peri-domicile cleaning was able to eliminate up to 60% of the vectors, but at the periphery of the village it has a low effect, as it is ineffective against sylvatic insects. The use of lethal traps and the management of house attractiveness provided similar levels of control. However this required either house attractiveness to be null, or ≥5 lethal traps, at least as attractive as houses, to be installed in each household. Conclusion/Significance Insecticide and insect screens used in houses at the periphery of the village can contribute to reduce house infestation in more central untreated zones. However, this beneficial effect remains insufficient to allow for a unique spatially targeted strategy to offer protection to all households. Most efficiently, control should combine the use of insect screens in outer zones to reduce infestation by both sylvatic and peri-domiciliated vectors, and cleaning of peri-domicile in the centre of the village where sylvatic vectors are absent. The design of such spatially mixed strategies of control offers a promising avenue to reduce the economic cost associated with the control of non-domiciliated vectors. PMID:21610862
Tweed, E J; Allardice, G M; McLoone, P; Morrison, D S
2018-01-01
To investigate the relationship between socio-economic circumstances and cancer incidence in Scotland in recent years. Population-based study using cancer registry data. Data on incident cases of colorectal, lung, female breast, and prostate cancer diagnosed between 2001 and 2012 were obtained from a population-based cancer registry covering a population of approximately 2.5 million people in the West of Scotland. Socio-economic circumstances were assessed based on postcode of residence at diagnosis, using the Scottish Index of Multiple Deprivation (SIMD). For each cancer, crude and age-standardised incidence rates were calculated by quintile of SIMD score, and the number of excess cases associated with socio-economic deprivation was estimated. 93,866 cases met inclusion criteria, comprising 21,114 colorectal, 31,761 lung, 23,757 female breast, and 15,314 prostate cancers. Between 2001 and 2006, there was no consistent association between socio-economic circumstances and colorectal cancer incidence, but 2006-2012 saw an emerging deprivation gradient in both sexes. The incidence rate ratio (IRR) for colorectal cancer between most deprived and least deprived increased from 1.03 (95% confidence interval [CI] 0.91-1.16) to 1.24 (95% CI 1.11-1.39) during the study period. The incidence of lung cancer showed the strongest relationship with socio-economic circumstances, with inequalities widening across the study period among women from IRR 2.66 (95% CI 2.33-3.05) to 2.91 (95% CI 2.54-3.33) in 2001-03 and 2010-12, respectively. Breast and prostate cancer showed an inverse relationship with socio-economic circumstances, with lower incidence among people living in more deprived areas. Significant socio-economic inequalities remain in cancer incidence in the West of Scotland, and in some cases are increasing. In particular, this study has identified an emerging, previously unreported, socio-economic gradient in colorectal cancer incidence among women as well as men. Actions to prevent, mitigate, and undo health inequalities should be a public health priority. Copyright © 2017 The Authors. Published by Elsevier Ltd.. All rights reserved.
Njabo, Kevin Y; Cornel, Anthony J.; Bonneaud, Camille; Toffelmier, Erin; Sehgal, R.N.M.; Valkiūnas, Gediminas; Russell, Andrew F.; Smith, Thomas B.
2010-01-01
Malaria parasites use vertebrate hosts for asexual multiplication and Culicidae mosquitoes for sexual and asexual development, yet the literature on avian malaria remains biased towards examining the asexual stages of the life cycle in birds. To fully understand parasite evolution and mechanism of malaria transmission, knowledge of all three components of the vector-host-parasite system is essential. Little is known about avian parasite-vector associations in African rainforests where numerous species of birds are infected with avian haemosporidians of the genera Plasmodium and Haemoproteus. Here we applied high resolution melt qPCR-based techniques and nested PCR to examine the occurrence and diversity of mitochondrial cytochrome b gene sequences of haemosporidian parasites in wild-caught mosquitoes sampled across 12 sites in Cameroon. In all, 3134 mosquitoes representing 27 species were screened. Mosquitoes belonging to four genera (Aedes, Coquillettidia, Culex, and Mansonia) were infected with twenty-two parasite lineages (18 Plasmodium spp. and 4 Haemoproteus spp.). Presence of Plasmodium sporozoites in salivary glands of Coquillettidia aurites further established these mosquitoes as likely vectors. Occurrence of parasite lineages differed significantly among genera, as well as their probability of being infected with malaria across species and sites. Approximately one-third of these lineages were previously detected in other avian host species from the region, indicating that vertebrate host sharing is a common feature and that avian Plasmodium spp. vector breadth does not always accompany vertebrate-host breadth. This study suggests extensive invertebrate host shifts in mosquito-parasite interactions and that avian Plasmodium species are most likely not tightly coevolved with vector species. PMID:21134011
Alimi, Temitope O; Fuller, Douglas O; Qualls, Whitney A; Herrera, Socrates V; Arevalo-Herrera, Myriam; Quinones, Martha L; Lacerda, Marcus V G; Beier, John C
2015-08-20
Changes in land use and land cover (LULC) as well as climate are likely to affect the geographic distribution of malaria vectors and parasites in the coming decades. At present, malaria transmission is concentrated mainly in the Amazon basin where extensive agriculture, mining, and logging activities have resulted in changes to local and regional hydrology, massive loss of forest cover, and increased contact between malaria vectors and hosts. Employing presence-only records, bioclimatic, topographic, hydrologic, LULC and human population data, we modeled the distribution of malaria and two of its dominant vectors, Anopheles darlingi, and Anopheles nuneztovari s.l. in northern South America using the species distribution modeling platform Maxent. Results from our land change modeling indicate that about 70,000 km(2) of forest land would be lost by 2050 and 78,000 km(2) by 2070 compared to 2010. The Maxent model predicted zones of relatively high habitat suitability for malaria and the vectors mainly within the Amazon and along coastlines. While areas with malaria are expected to decrease in line with current downward trends, both vectors are predicted to experience range expansions in the future. Elevation, annual precipitation and temperature were influential in all models both current and future. Human population mostly affected An. darlingi distribution while LULC changes influenced An. nuneztovari s.l. distribution. As the region tackles the challenge of malaria elimination, investigations such as this could be useful for planning and management purposes and aid in predicting and addressing potential impediments to elimination.
St Laurent, Brandy; Supratman, Sukowati; Asih, Puji Budi Setia; Bretz, David; Mueller, John; Miller, Helen Catherine; Baharuddin, Amirullah; Shinta; Surya, Asik; Ngai, Michelle; Laihad, Ferdinand; Syafruddin, Din; Hawley, William A; Collins, Frank H; Lobo, Neil F
2016-04-08
Members of the Anopheles punctulatus group dominate Papua, Indonesia and Papua New Guinea (PNG), with a geographic range that extends south through Vanuatu. An. farauti and An. punctulatus are the presumed major vectors in this region. Although this group of species has been extensively studied in PNG and the southern archipelagoes within their range, their distribution, ecology and vector behaviours have not been well characterized in eastern Indonesia. Mosquitoes were collected in five villages in Jayapura province, Papua, Indonesia using human-landing collections, animal-baited tents and backpack aspirators. Mosquitoes were morphologically typed and then molecularly distinguished based on ribosomal ITS2 sequences and tested for Plasmodium falciparum and P. vivax infection using circumsporozoite ELISA and PCR. The presence and vector status of An. farauti 4 in Papua, Indonesia is confirmed here for the first time. The data indicate that this species is entering houses at a rate that increases its potential to come into contact with humans and act as a major malaria vector. An. farauti 4 was also abundant outdoors and biting humans during early evening hours. Other species collected in this area include An. farauti 1, An. hinesorum, An. koliensis, An. punctulatus, and An. tessellatus. Proboscis morphology was highly variable within each species, lending support to the notion that this characteristic is not a reliable indicator to distinguish species within the An. punctulatus group. The vector composition in Papua, Indonesia is consistent with certain northern areas of PNG, but the behaviours of anophelines sampled in this region, such as early and indoor human biting of An. farauti 4, may enable them to act as major vectors of malaria. Presumed major vectors An. farauti and An. punctulatus were not abundant among these samples. Morphological identification of anophelines in this sample was often inaccurate, highlighting the importance of using molecular analysis in conjunction with morphological investigations to update keys and training tools.
COHERENT constraints to conventional and exotic neutrino physics
NASA Astrophysics Data System (ADS)
Papoulias, D. K.; Kosmas, T. S.
2018-02-01
The process of neutral-current coherent elastic neutrino-nucleus scattering, consistent with the Standard Model (SM) expectation, has been recently measured by the COHERENT experiment at the Spallation Neutron Source. On the basis of the observed signal and our nuclear calculations for the relevant Cs and I isotopes, the extracted constraints on both conventional and exotic neutrino physics are updated. The present study concentrates on various SM extensions involving vector and tensor nonstandard interactions as well as neutrino electromagnetic properties, with an emphasis on the neutrino magnetic moment and the neutrino charge radius. Furthermore, models addressing a light sterile neutrino state and scenarios with new propagator fields—such as vector Z' and scalar bosons—are examined, and the corresponding regions excluded by the COHERENT experiment are presented.
Sorted Index Numbers for Privacy Preserving Face Recognition
NASA Astrophysics Data System (ADS)
Wang, Yongjin; Hatzinakos, Dimitrios
2009-12-01
This paper presents a novel approach for changeable and privacy preserving face recognition. We first introduce a new method of biometric matching using the sorted index numbers (SINs) of feature vectors. Since it is impossible to recover any of the exact values of the original features, the transformation from original features to the SIN vectors is noninvertible. To address the irrevocable nature of biometric signals whilst obtaining stronger privacy protection, a random projection-based method is employed in conjunction with the SIN approach to generate changeable and privacy preserving biometric templates. The effectiveness of the proposed method is demonstrated on a large generic data set, which contains images from several well-known face databases. Extensive experimentation shows that the proposed solution may improve the recognition accuracy.
Vector wind profile gust model
NASA Technical Reports Server (NTRS)
Adelfang, S. I.
1981-01-01
To enable development of a vector wind gust model suitable for orbital flight test operations and trade studies, hypotheses concerning the distributions of gust component variables were verified. Methods for verification of hypotheses that observed gust variables, including gust component magnitude, gust length, u range, and L range, are gamma distributed and presented. Observed gust modulus has been drawn from a bivariate gamma distribution that can be approximated with a Weibull distribution. Zonal and meridional gust components are bivariate gamma distributed. An analytical method for testing for bivariate gamma distributed variables is presented. Two distributions for gust modulus are described and the results of extensive hypothesis testing of one of the distributions are presented. The validity of the gamma distribution for representation of gust component variables is established.
Vector wind profile gust model
NASA Technical Reports Server (NTRS)
Adelfang, S. I.
1979-01-01
Work towards establishing a vector wind profile gust model for the Space Transportation System flight operations and trade studies is reported. To date, all the statistical and computational techniques required were established and partially implemented. An analysis of wind profile gust at Cape Kennedy within the theoretical framework is presented. The variability of theoretical and observed gust magnitude with filter type, altitude, and season is described. Various examples are presented which illustrate agreement between theoretical and observed gust percentiles. The preliminary analysis of the gust data indicates a strong variability with altitude, season, and wavelength regime. An extension of the analyses to include conditional distributions of gust magnitude given gust length, distributions of gust modulus, and phase differences between gust components has begun.
Gapinske, Michael; Tague, Nathan; Winter, Jackson; Underhill, Gregory H; Perez-Pinera, Pablo
2018-01-01
Gene editing technologies are revolutionizing fields such as biomedicine and biotechnology by providing a simple means to manipulate the genetic makeup of essentially any organism. Gene editing tools function by introducing double-stranded breaks at targeted sites within the genome, which the host cells repair preferentially by Non-Homologous End Joining. While the technologies to introduce double-stranded breaks have been extensively optimized, this progress has not been matched by the development of methods to integrate heterologous DNA at the target sites or techniques to detect and isolate cells that harbor the desired modification. We present here a technique for rapid introduction of vectors at target sites in the genome that enables efficient isolation of successfully edited cells.
2016-02-08
Data Display Markup Language HUD heads-up display IRIG Inter-Range Instrumentation Group RCC Range Commanders Council SVG Scalable Vector Graphics...T&E test and evaluation TMATS Telemetry Attributes Transfer Standard XML eXtensible Markup Language DDML Schema Validation, RCC 126-16, February...2016 viii This page intentionally left blank. DDML Schema Validation, RCC 126-16, February 2016 1 1. Introduction This Data Display Markup
Scalability, Complexity and Reliability in Quantum Information Processing
2007-03-01
hidden subgroup framework to abelian groups which are not finitely generated. An extension of the basic algorithm breaks the Buchmann-Williams...finding short lattice vectors . In [2], we showed that the generalization of the standard method --- random coset state preparation followed by fourier...sampling --- required exponential time for sufficiently non-abelian groups including the symmetric group , at least when the fourier transforms are
Eigenenergies of a Relativistic Particle in an Infinite Range Linear Potential Using WKB Method
ERIC Educational Resources Information Center
Shivalingaswamy, T.; Kagali, B. A.
2011-01-01
Energy eigenvalues for a non-relativistic particle in a linear potential well are available. In this paper we obtain the eigenenergies for a relativistic spin less particle in a similar potential using an extension of the well-known WKB method treating the potential as the time component of a four-vector potential. Since genuine bound states do…
NASA Technical Reports Server (NTRS)
Klein, M.; Reynolds, J.; Ricks, E.
1989-01-01
Load and stress recovery from transient dynamic studies are improved upon using an extended acceleration vector in the modal acceleration technique applied to structural analysis. Extension of the normal LTM (load transformation matrices) stress recovery to automatically compute margins of safety is presented with an application to the Hubble space telescope.
Good Practices for Learning to Recognize Actions Using FV and VLAD.
Wu, Jianxin; Zhang, Yu; Lin, Weiyao
2016-12-01
High dimensional representations such as Fisher vectors (FV) and vectors of locally aggregated descriptors (VLAD) have shown state-of-the-art accuracy for action recognition in videos. The high dimensionality, on the other hand, also causes computational difficulties when scaling up to large-scale video data. This paper makes three lines of contributions to learning to recognize actions using high dimensional representations. First, we reviewed several existing techniques that improve upon FV or VLAD in image classification, and performed extensive empirical evaluations to assess their applicability for action recognition. Our analyses of these empirical results show that normality and bimodality are essential to achieve high accuracy. Second, we proposed a new pooling strategy for VLAD and three simple, efficient, and effective transformations for both FV and VLAD. Both proposed methods have shown higher accuracy than the original FV/VLAD method in extensive evaluations. Third, we proposed and evaluated new feature selection and compression methods for the FV and VLAD representations. This strategy uses only 4% of the storage of the original representation, but achieves comparable or even higher accuracy. Based on these contributions, we recommend a set of good practices for action recognition in videos for practitioners in this field.
N -loop running should be combined with N -loop matching
NASA Astrophysics Data System (ADS)
Braathen, Johannes; Goodsell, Mark D.; Krauss, Manuel E.; Opferkuch, Toby; Staub, Florian
2018-01-01
We investigate the high-scale behavior of Higgs sectors beyond the Standard Model, pointing out that the proper matching of the quartic couplings before applying the renormalization group equations (RGEs) is of crucial importance for reliable predictions at larger energy scales. In particular, the common practice of leading-order parameters in the RGE evolution is insufficient to make precise statements on a given model's UV behavior, typically resulting in uncertainties of many orders of magnitude. We argue that, before applying N -loop RGEs, a matching should even be performed at N -loop order in contrast to common lore. We show both analytical and numerical results where the impact is sizable for three minimal extensions of the Standard Model: a singlet extension, a second Higgs doublet and finally vector-like quarks. We highlight that the known two-loop RGEs tend to moderate the running of their one-loop counterparts, typically delaying the appearance of Landau poles. For the addition of vector-like quarks we show that the complete two-loop matching and RGE evolution hints at a stabilization of the electroweak vacuum at high energies, in contrast to results in the literature.
CR extension from hypersurfaces of higher type
NASA Astrophysics Data System (ADS)
Baracco, Luca
2007-07-01
We prove extension of CR functions from a hypersurface M of in presence of the so-called sector property. If M has finite type in the Bloom-Graham sense, then our result is already contained in [C. Rea, Prolongement holomorphe des fonctions CR, conditions suffisantes, C. R. Acad. Sci. Paris 297 (1983) 163-166] by Rea. We think however, that the argument of our proof carries an expressive geometric meaning and deserves interest on its own right. Also, our method applies in some case to hypersurfaces of infinite type; note that for these, the classical methods fail. CR extension is treated by many authors mainly in two frames: extension in directions of iterated of commutators of CR vector fields (cf., for instance, [A. Boggess, J. Pitts, CR extension near a point of higher type, Duke Math. J. 52 (1) (1985) 67-102; A. Boggess, J.C. Polking, Holomorphic extension of CR functions, Duke Math. J. 49 (1982) 757-784. ; M.S. Baouendi, L. Rothschild, Normal forms for generic manifolds and holomorphic extension of CR functions, J. Differential Geom. 25 (1987) 431-467. ]); extension through minimality towards unprecised directions [A.E. Tumanov, Extension of CR-functions into a wedge, Mat. Sb. 181 (7) (1990) 951-964. ; A.E. Tumanov, Analytic discs and the extendibility of CR functions, in: Integral Geometry, Radon Transforms and Complex Analysis, Venice, 1996, in: Lecture Notes in Math., vol. 1684, Springer, Berlin, 1998, pp. 123-141].
The factorization of large composite numbers on the MPP
NASA Technical Reports Server (NTRS)
Mckurdy, Kathy J.; Wunderlich, Marvin C.
1987-01-01
The continued fraction method for factoring large integers (CFRAC) was an ideal algorithm to be implemented on a massively parallel computer such as the Massively Parallel Processor (MPP). After much effort, the first 60 digit number was factored on the MPP using about 6 1/2 hours of array time. Although this result added about 10 digits to the size number that could be factored using CFRAC on a serial machine, it was already badly beaten by the implementation of Davis and Holdridge on the CRAY-1 using the quadratic sieve, an algorithm which is clearly superior to CFRAC for large numbers. An algorithm is illustrated which is ideally suited to the single instruction multiple data (SIMD) massively parallel architecture and some of the modifications which were needed in order to make the parallel implementation effective and efficient are described.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Perumalla, Kalyan S.; Alam, Maksudul
A novel parallel algorithm is presented for generating random scale-free networks using the preferential-attachment model. The algorithm, named cuPPA, is custom-designed for single instruction multiple data (SIMD) style of parallel processing supported by modern processors such as graphical processing units (GPUs). To the best of our knowledge, our algorithm is the first to exploit GPUs, and also the fastest implementation available today, to generate scale free networks using the preferential attachment model. A detailed performance study is presented to understand the scalability and runtime characteristics of the cuPPA algorithm. In one of the best cases, when executed on an NVidiamore » GeForce 1080 GPU, cuPPA generates a scale free network of a billion edges in less than 2 seconds.« less
Turbulence-flame interactions in DNS of a laboratory high Karlovitz premixed turbulent jet flame
NASA Astrophysics Data System (ADS)
Wang, Haiou; Hawkes, Evatt R.; Chen, Jacqueline H.
2016-09-01
In the present work, direct numerical simulation (DNS) of a laboratory premixed turbulent jet flame was performed to study turbulence-flame interactions. The turbulent flame features moderate Reynolds number and high Karlovitz number (Ka). The orientations of the flame normal vector n, the vorticity vector ω and the principal strain rate eigenvectors ei are examined. The in-plane and out-of-plane angles are introduced to quantify the vector orientations, which also measure the flame geometry and the vortical structures. A general observation is that the distributions of these angles are more isotropic downstream as the flame and the flow become more developed. The out-of-plane angle of the flame normal vector, β, is a key parameter in developing the correction of 2D measurements to estimate the corresponding 3D quantities. The DNS results show that the correction factor is unity at the inlet and approaches its theoretical value of an isotropic distribution downstream. The alignment characteristics of n, ω and ei, which reflect the interactions of turbulence and flame, are also studied. Similar to a passive scalar gradient in non-reacting flows, the flame normal has a tendency to align with the most compressive strain rate, e3, in the flame, indicating that turbulence contributes to the production of scalar gradient. The vorticity dynamics are examined via the vortex stretching term, which was found to be the predominant source of vorticity generation balanced by dissipation, in the enstrophy transport equation. It is found that although the vorticity preferentially aligns with the intermediate strain rate, e2, the contribution of the most extensive strain rate, e1, to vortex stretching is comparable with that of the intermediate strain rate, e2. This is because the eigenvalue of the most extensive strain rate, λ1, is always large and positive. It is confirmed that the vorticity vector is preferentially positioned along the flame tangential plane, contributing to the dominance of cylindrical curvature of the flame front. Finally, the effect of heat release on the turbulence-flame interactions is examined. It is found that heat release has only limited impact on the statistics due to the minor role played by the strain rate induced by heat release rate in the current high Ka flame.
Cloning strategy for producing brush-forming protein-based polymers.
Henderson, Douglas B; Davis, Richey M; Ducker, William A; Van Cott, Kevin E
2005-01-01
Brush-forming polymers are being used in a variety of applications, and by using recombinant DNA technology, there exists the potential to produce protein-based polymers that incorporate unique structures and functions in these brush layers. Despite this potential, production of protein-based brush-forming polymers is not routinely performed. For the design and production of new protein-based polymers with optimal brush-forming properties, it would be desirable to have a cloning strategy that allows an iterative approach wherein the protein based-polymer product can be produced and evaluated, and then if necessary, it can be sequentially modified in a controlled manner to obtain optimal surface density and brush extension. In this work, we report on the development of a cloning strategy intended for the production of protein-based brush-forming polymers. This strategy is based on the assembly of modules of DNA that encode for blocks of protein-based polymers into a commercially available expression vector; there is no need for custom-modified vectors and no need for intermediate cloning vectors. Additionally, because the design of new protein-based biopolymers can be an iterative process, our method enables sequential modification of a protein-based polymer product. With at least 21 bacterial expression vectors and 11 yeast expression vectors compatible with this strategy, there are a number of options available for production of protein-based polymers. It is our intent that this strategy will aid in advancing the production of protein-based brush-forming polymers.
van den Bosch, Frank; Gottwald, Timothy R.; Alonso Chavez, Vasthi
2017-01-01
The spread of pathogens into new environments poses a considerable threat to human, animal, and plant health, and by extension, human and animal wellbeing, ecosystem function, and agricultural productivity, worldwide. Early detection through effective surveillance is a key strategy to reduce the risk of their establishment. Whilst it is well established that statistical and economic considerations are of vital importance when planning surveillance efforts, it is also important to consider epidemiological characteristics of the pathogen in question—including heterogeneities within the epidemiological system itself. One of the most pronounced realisations of this heterogeneity is seen in the case of vector-borne pathogens, which spread between ‘hosts’ and ‘vectors’—with each group possessing distinct epidemiological characteristics. As a result, an important question when planning surveillance for emerging vector-borne pathogens is where to place sampling resources in order to detect the pathogen as early as possible. We answer this question by developing a statistical function which describes the probability distributions of the prevalences of infection at first detection in both hosts and vectors. We also show how this method can be adapted in order to maximise the probability of early detection of an emerging pathogen within imposed sample size and/or cost constraints, and demonstrate its application using two simple models of vector-borne citrus pathogens. Under the assumption of a linear cost function, we find that sampling costs are generally minimised when either hosts or vectors, but not both, are sampled. PMID:28846676
Using Phage Display to Create Recombinant Antibodies.
Dasch, James R; Dasch, Amy L
2017-09-01
A variety of phage display technologies have been developed since the approach was first described for antibodies. The most widely used approaches incorporate antibody sequences into the minor coat protein pIII of the nonlytic filamentous phage fd or M13. Libraries of variable gene sequences, encoding either scFv or Fab fragments, are made by incorporating sequences into phagemid vectors. The phagemid is packaged into phage particles with the assistance of a helper phage to produce the antibody display phage. This protocol describes a method for creating a phagemid library. The multiple cloning site (MCS) of the pBluescript KS(-) phagemid vector is replaced by digestion with the restriction enzyme BssHII, followed by the insertion of four overlapping oligonucleotides to create a new MCS within the vector. Next, the 3' portion of gene III (from M13mp18) is amplified and combined with an antibody sequence using overlap extension PCR. This product is inserted into the phagemid vector to create pPDS. Two helper plasmids are also created from the modified pBluescript vector: pLINK provides the linker between the heavy and light chains, and pFABC provides the CH1 domain of the heavy chain. An antibody cDNA library is constructed from the RNA of interest and ligated into pPDS. The phagemid library is electroporated into Escherichia coli cells along with the VCS-M13 helper phage. © 2017 Cold Spring Harbor Laboratory Press.
Oettl, Sabine; Schlink, Katja
2015-10-01
The psyllid species Cacopsylla melanoneura (Förster) and Cacopsylla picta (Förster) are vectors of 'Candidatus Phytoplasma mali', the causal agent of apple proliferation, one of the economically most important apple diseases in Europe. Both vectors are present in apple orchards of South Tyrol and Trentino provinces in Northern Italy. As no direct treatment of the disease is possible, monitoring of the psyllids provides information about the vector presence in the orchards and enables targeted control. Thus, fast and reliable identification of the various psyllids occurring in the apple orchards is required. Morphological differentiation is problematic due to extensive resemblance of some psyllid species especially among females and is error-prone for nymphs. Here we present a rapid and cost-effective polymerase chain reaction-restriction fragment length polymorphism method based on the cytochrome c oxidase subunit I region for the molecular identification of the vector species as well as eight further Cacopsylla species present in the orchards. This method was verified through 98.9% consensus with morphologically identified males, through sequencing and subsequent phylogenetic analysis. In case of doubtful morphological identification of females, the method was able to provide a refined species assignment and could also remarkably facilitate the identification of nymphs. © The Authors 2015. Published by Oxford University Press on behalf of Entomological Society of America. All rights reserved. For Permissions, please email: journals.permissions@oup.com.
UDE-based control of variable-speed wind turbine systems
NASA Astrophysics Data System (ADS)
Ren, Beibei; Wang, Yeqin; Zhong, Qing-Chang
2017-01-01
In this paper, the control of a PMSG (permanent magnet synchronous generator)-based variable-speed wind turbine system with a back-to-back converter is considered. The uncertainty and disturbance estimator (UDE)-based control approach is applied to the regulation of the DC-link voltage and the control of the RSC (rotor-side converter) and the GSC (grid-side converter). For the rotor-side controller, the UDE-based vector control is developed for the RSC with PMSG control to facilitate the application of the MPPT (maximum power point tracking) algorithm for the maximum wind energy capture. For the grid-side controller, the UDE-based vector control is developed to control the GSC with the power reference generated by a UDE-based DC-link voltage controller. Compared with the conventional vector control, the UDE-based vector control can achieve reliable current decoupling control with fast response. Moreover, the UDE-based DC-link voltage regulation can achieve stable DC-link voltage under model uncertainties and external disturbances, e.g. wind speed variations. The effectiveness of the proposed UDE-based control approach is demonstrated through extensive simulation studies in the presence of coupled dynamics, model uncertainties and external disturbances under varying wind speeds. The UDE-based control is able to generate more energy, e.g. by 5% for the wind profile tested.
Multiprocessing MCNP on an IBM RS/6000 cluster
DOE Office of Scientific and Technical Information (OSTI.GOV)
McKinney, G.W.; West, J.T.
1993-01-01
The advent of high-performance computer systems has brought to maturity programming concepts like vectorization, multiprocessing, and multitasking. While there are many schools of thought as to the most significant factor in obtaining order-of-magnitude increases in performance, such speedup can only be achieved by integrating the computer system and application code. Vectorization leads to faster manipulation of arrays by overlapping instruction CPU cycles. Discrete ordinates codes, which require the solving of large matrices, have proved to be major benefactors of vectorization. Monte Carlo transport, on the other hand, typically contains numerous logic statements and requires extensive redevelopment to benefit from vectorization.more » Multiprocessing and multitasking provide additional CPU cycles via multiple processors. Such systems are generally designed with either common memory access (multitasking) or distributed memory access. In both cases, theoretical speedup, as a function of the number of processors (P) and the fraction of task time that multiprocesses (f), can be formulated using Amdahl's Law S ((f,P) = 1 f + f/P). However, for most applications this theoretical limit cannot be achieved, due to additional terms not included in Amdahl's Law. Monte Carlo transport is a natural candidate for multiprocessing, since the particle tracks are generally independent and the precision of the result increases as the square root of the number of particles tracked.« less
Dendrimers as Carriers for siRNA Delivery and Gene Silencing: A Review
Huang, Weizhe; He, Ziying
2013-01-01
RNA interference (RNAi) was first literaturally reported in 1998 and has become rapidly a promising tool for therapeutic applications in gene therapy. In a typical RNAi process, small interfering RNAs (siRNA) are used to specifically downregulate the expression of the targeted gene, known as the term “gene silencing.” One key point for successful gene silencing is to employ a safe and efficient siRNA delivery system. In this context, dendrimers are emerging as potential nonviral vectors to deliver siRNA for RNAi purpose. Dendrimers have attracted intense interest since their emanating research in the 1980s and are extensively studied as efficient DNA delivery vectors in gene transfer applications, due to their unique features based on the well-defined and multivalent structures. Knowing that DNA and RNA possess a similar structure in terms of nucleic acid framework and the electronegative nature, one can also use the excellent DNA delivery properties of dendrimers to develop effective siRNA delivery systems. In this review, the development of dendrimer-based siRNA delivery vectors is summarized, focusing on the vector features (siRNA delivery efficiency, cytotoxicity, etc.) of different types of dendrimers and the related investigations on structure-activity relationship to promote safe and efficient siRNA delivery system. PMID:24288498
Noise-induced drift in two-dimensional anisotropic systems
NASA Astrophysics Data System (ADS)
Farago, Oded
2017-10-01
We study the isothermal Brownian dynamics of a particle in a system with spatially varying diffusivity. Due to the heterogeneity of the system, the particle's mean displacement does not vanish even if it does not experience any physical force. This phenomenon has been termed "noise-induced drift," and has been extensively studied for one-dimensional systems. Here, we examine the noise-induced drift in a two-dimensional anisotropic system, characterized by a symmetric diffusion tensor with unequal diagonal elements. A general expression for the mean displacement vector is derived and presented as a sum of two vectors, depicting two distinct drifting effects. The first vector describes the tendency of the particle to drift toward the high diffusivity side in each orthogonal principal diffusion direction. This is a generalization of the well-known expression for the noise-induced drift in one-dimensional systems. The second vector represents a novel drifting effect, not found in one-dimensional systems, originating from the spatial rotation in the directions of the principal axes. The validity of the derived expressions is verified by using Langevin dynamics simulations. As a specific example, we consider the relative diffusion of two transmembrane proteins, and demonstrate that the average distance between them increases at a surprisingly fast rate of several tens of micrometers per second.
Cranking of Nuclei at Finite Temperature:
NASA Astrophysics Data System (ADS)
Bartel, J.; Bencheikh, K.; Quentin, P.
We present a generalization of the Extended Thomas Fermi (ETF) theory to fermionic systems at finite temperature and finite angular momentum. In fact the present approach is more general in the sense that it is able to treat an excited system of fermions subject to an external vector field which in the case of nuclear rotations, developed more extensively here, is simply ěc{r}×ěc{ω }.
tESA: a distributional measure for calculating semantic relatedness.
Rybinski, Maciej; Aldana-Montes, José Francisco
2016-12-28
Semantic relatedness is a measure that quantifies the strength of a semantic link between two concepts. Often, it can be efficiently approximated with methods that operate on words, which represent these concepts. Approximating semantic relatedness between texts and concepts represented by these texts is an important part of many text and knowledge processing tasks of crucial importance in the ever growing domain of biomedical informatics. The problem of most state-of-the-art methods for calculating semantic relatedness is their dependence on highly specialized, structured knowledge resources, which makes these methods poorly adaptable for many usage scenarios. On the other hand, the domain knowledge in the Life Sciences has become more and more accessible, but mostly in its unstructured form - as texts in large document collections, which makes its use more challenging for automated processing. In this paper we present tESA, an extension to a well known Explicit Semantic Relatedness (ESA) method. In our extension we use two separate sets of vectors, corresponding to different sections of the articles from the underlying corpus of documents, as opposed to the original method, which only uses a single vector space. We present an evaluation of Life Sciences domain-focused applicability of both tESA and domain-adapted Explicit Semantic Analysis. The methods are tested against a set of standard benchmarks established for the evaluation of biomedical semantic relatedness quality. Our experiments show that the propsed method achieves results comparable with or superior to the current state-of-the-art methods. Additionally, a comparative discussion of the results obtained with tESA and ESA is presented, together with a study of the adaptability of the methods to different corpora and their performance with different input parameters. Our findings suggest that combined use of the semantics from different sections (i.e. extending the original ESA methodology with the use of title vectors) of the documents of scientific corpora may be used to enhance the performance of a distributional semantic relatedness measures, which can be observed in the largest reference datasets. We also present the impact of the proposed extension on the size of distributional representations.
Vector Data Model: A New Model of HDF-EOS to Support GIS Applications in EOS
NASA Astrophysics Data System (ADS)
Chi, E.; Edmonds, R d
2001-05-01
NASA's Earth Science Data Information System (ESDIS) project has an active program of research and development of systems for the storage and management of Earth science data for Earth Observation System (EOS) mission, a key program of NASA Earth Science Enterprise. EOS has adopted an extension of the Hierarchical Data Format (HDF) as the format of choice for standard product distribution. Three new EOS specific datatypes - point, swath and grid - have been defined within the HDF framework. The enhanced data format is named HDF-EOS. Geographic Information Systems (GIS) are used by Earth scientists in EOS data product generation, visualization, and analysis. There are two major data types in GIS applications, raster and vector. The current HDF-EOS handles only raster type in the swath data model. The vector data model is identified and developed as a new HDFEOS format to meet the requirements of scientists working with EOS data products in vector format. The vector model is designed using a topological data structure, which defines the spatial relationships among points, lines, and polygons. The three major topological concepts that the vector model adopts are: a) lines connect to each other at nodes (connectivity), b) lines that connect to surround an area define a polygon (area definition), and c) lines have direction and left and right sides (contiguity). The vector model is implemented in HDF by mapping the conceptual model to HDF internal data models and structures, viz. Vdata, Vgroup, and their associated attribute structures. The point, line, and polygon geometry and attribute data are stored in similar tables. Further, the vector model utilizes the structure and product metadata, which characterize the HDF-EOS. Both types of metadata are stored as attributes in HDF-EOS files, and are encoded in text format by using Object Description Language (ODL) and stored as global attributes in HDF-EOS files. EOS has developed a series of routines for storing, retrieving, and manipulating vector data in category of access, definition, basic I/O, inquiry, and subsetting. The routines are tested and form a package, HDF-EOS/Vector. The alpha version of HDFEOS/Vector has been distributed through the HDF-EOS project web site at http://hdfeos.gsfc.nasa.gov. We are also developing translators between HDF-EOS vector format and variety of GIS formats, such as Shapefile. The HDF-EOS vector model enables EOS scientists to deliver EOS data in a way ready for Earth scientists to analyze using GIS software, and also provides EOS project a mechanism to store GIS data product in meaningful vector format with significant economy in storage.
Gold, Peter O.; Cowgill, Eric; Kreylos, Oliver; Gold, Ryan D.
2012-01-01
Three-dimensional (3D) slip vectors recorded by displaced landforms are difficult to constrain across complex fault zones, and the uncertainties associated with such measurements become increasingly challenging to assess as landforms degrade over time. We approach this problem from a remote sensing perspective by using terrestrial laser scanning (TLS) and 3D structural analysis. We have developed an integrated TLS data collection and point-based analysis workflow that incorporates accurate assessments of aleatoric and epistemic uncertainties using experimental surveys, Monte Carlo simulations, and iterative site reconstructions. Our scanning workflow and equipment requirements are optimized for single-operator surveying, and our data analysis process is largely completed using new point-based computing tools in an immersive 3D virtual reality environment. In a case study, we measured slip vector orientations at two sites along the rupture trace of the 1954 Dixie Valley earthquake (central Nevada, United States), yielding measurements that are the first direct constraints on the 3D slip vector for this event. These observations are consistent with a previous approximation of net extension direction for this event. We find that errors introduced by variables in our survey method result in <2.5 cm of variability in components of displacement, and are eclipsed by the 10–60 cm epistemic errors introduced by reconstructing the field sites to their pre-erosion geometries. Although the higher resolution TLS data sets enabled visualization and data interactivity critical for reconstructing the 3D slip vector and for assessing uncertainties, dense topographic constraints alone were not sufficient to significantly narrow the wide (<26°) range of allowable slip vector orientations that resulted from accounting for epistemic uncertainties.
Searching for transcription factor binding sites in vector spaces
2012-01-01
Background Computational approaches to transcription factor binding site identification have been actively researched in the past decade. Learning from known binding sites, new binding sites of a transcription factor in unannotated sequences can be identified. A number of search methods have been introduced over the years. However, one can rarely find one single method that performs the best on all the transcription factors. Instead, to identify the best method for a particular transcription factor, one usually has to compare a handful of methods. Hence, it is highly desirable for a method to perform automatic optimization for individual transcription factors. Results We proposed to search for transcription factor binding sites in vector spaces. This framework allows us to identify the best method for each individual transcription factor. We further introduced two novel methods, the negative-to-positive vector (NPV) and optimal discriminating vector (ODV) methods, to construct query vectors to search for binding sites in vector spaces. Extensive cross-validation experiments showed that the proposed methods significantly outperformed the ungapped likelihood under positional background method, a state-of-the-art method, and the widely-used position-specific scoring matrix method. We further demonstrated that motif subtypes of a TF can be readily identified in this framework and two variants called the k NPV and k ODV methods benefited significantly from motif subtype identification. Finally, independent validation on ChIP-seq data showed that the ODV and NPV methods significantly outperformed the other compared methods. Conclusions We conclude that the proposed framework is highly flexible. It enables the two novel methods to automatically identify a TF-specific subspace to search for binding sites. Implementations are available as source code at: http://biogrid.engr.uconn.edu/tfbs_search/. PMID:23244338
Carozza, Marlène; Rodrigues, Valérie; Unterfinger, Yves; Galea, Sandra; Coulpier, Muriel; Klonjkowski, Bernard; Thiaucourt, François; Totté, Philippe; Richardson, Jennifer
2015-01-01
Contagious bovine pleuropneumonia (CBPP), caused by Mycoplasma mycoides subsp. mycoides small colony type (MmmSC), is a devastating respiratory disease of cattle. In sub-Saharan Africa, where CBPP is enzootic, live attenuated vaccines are deployed but afford only short-lived protection. In cattle, recovery from experimental MmmSC infection has been associated with the presence of CD4(+) T lymphocytes that secrete interferon gamma in response to MmmSC, and in particular to the lipoprotein A (LppA) antigen. In an effort to develop a better vaccine against CBPP, a viral vector (Ad5-LppA) that expressed LppA was generated from human adenovirus type 5. The LppA-specific immune responses elicited by the Ad5-LppA vector were evaluated in mice, and compared to those elicited by recombinant LppA formulated with a potent adjuvant. Notably, a single administration of Ad5-LppA, but not recombinant protein, sufficed to elicit a robust LppA-specific humoral response. After a booster administration, both vector and recombinant protein elicited strong LppA-specific humoral and cell-mediated responses. Ex vivo stimulation of splenocytes induced extensive proliferation of CD4(+) T cells for mice immunized with vector or protein, and secretion of T helper 1-associated and proinflammatory cytokines for mice immunized with Ad5-LppA. Our study - by demonstrating the potential of a viral-vectored prototypic vaccine to elicit prompt and robust immune responses against a major antigen of MmmSC - represents a first step in developing a recombinant vaccine against CBPP. Copyright © 2014 Elsevier Ltd. All rights reserved.
Purification of adenoviral vectors by combined anion exchange and gel filtration chromatography.
Eglon, Marc N; Duffy, Aoife M; O'Brien, Timothy; Strappe, Padraig M
2009-11-01
Adenoviral vectors are used extensively in human gene therapy trials and in vaccine development. Large-scale GMP production requires a downstream purification process, and liquid chromatography is emerging as the most powerful mode of purification, enabling the production of vectors at a clinically relevant scale and quality. The present study describes the development of a two-step high-performance liquid chromatography (HPLC) process combining anion exchange (AIEX) and gel filtration (GF) in comparison with the caesium chloride density gradient method. HEK-293 cells were cultured in ten-layer CellStacks() and infected with 10 pfu/cell of adenoviral vector expressing green fluorescent protein (Ad5-GFP). Cell-bound virus was harvested and benzonase added to digest DNA, crude lysate was clarified by centrifugation and filtration prior to HPLC. Chromatography fractions were added to HEK-293 cells and GFP expression measured using a fluorescent plate reader. Using AIEX then GF resulted in an adenoviral vector with purity comparable to Ad5-GFP purified by CsCl, whereas the reverse process (GF-AIEX) showed a reduced purity by electrophoresis and required further buffer exchange of the product. The optimal process (AIEX-GF) resulted in a vector yield of 2.3 x 10(7) pfu/cm(2) of cell culture harvested compared to 3.3 x 10(7) pfu/cm(2) for CsCl. The process recovery for the HPLC process was 36% compared to 27.5% for CsCl and total virion to infectious particle ratios of 18 and 11, respectively, were measured. We present a simple two-step chromatography process that is capable of producing high-quality adenovirus at a titre suitable for scale-up and clinical translation.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Liu, T; Lin, H; Xu, X
Purpose: (1) To perform phase space (PS) based source modeling for Tomotherapy and Varian TrueBeam 6 MV Linacs, (2) to examine the accuracy and performance of the ARCHER Monte Carlo code on a heterogeneous computing platform with Many Integrated Core coprocessors (MIC, aka Xeon Phi) and GPUs, and (3) to explore the software micro-optimization methods. Methods: The patient-specific source of Tomotherapy and Varian TrueBeam Linacs was modeled using the PS approach. For the helical Tomotherapy case, the PS data were calculated in our previous study (Su et al. 2014 41(7) Medical Physics). For the single-view Varian TrueBeam case, we analyticallymore » derived them from the raw patient-independent PS data in IAEA’s database, partial geometry information of the jaw and MLC as well as the fluence map. The phantom was generated from DICOM images. The Monte Carlo simulation was performed by ARCHER-MIC and GPU codes, which were benchmarked against a modified parallel DPM code. Software micro-optimization was systematically conducted, and was focused on SIMD vectorization of tight for-loops and data prefetch, with the ultimate goal of increasing 512-bit register utilization and reducing memory access latency. Results: Dose calculation was performed for two clinical cases, a Tomotherapy-based prostate cancer treatment and a TrueBeam-based left breast treatment. ARCHER was verified against the DPM code. The statistical uncertainty of the dose to the PTV was less than 1%. Using double-precision, the total wall time of the multithreaded CPU code on a X5650 CPU was 339 seconds for the Tomotherapy case and 131 seconds for the TrueBeam, while on 3 5110P MICs it was reduced to 79 and 59 seconds, respectively. The single-precision GPU code on a K40 GPU took 45 seconds for the Tomotherapy dose calculation. Conclusion: We have extended ARCHER, the MIC and GPU-based Monte Carlo dose engine to Tomotherapy and Truebeam dose calculations.« less
Extended robust support vector machine based on financial risk minimization.
Takeda, Akiko; Fujiwara, Shuhei; Kanamori, Takafumi
2014-11-01
Financial risk measures have been used recently in machine learning. For example, ν-support vector machine ν-SVM) minimizes the conditional value at risk (CVaR) of margin distribution. The measure is popular in finance because of the subadditivity property, but it is very sensitive to a few outliers in the tail of the distribution. We propose a new classification method, extended robust SVM (ER-SVM), which minimizes an intermediate risk measure between the CVaR and value at risk (VaR) by expecting that the resulting model becomes less sensitive than ν-SVM to outliers. We can regard ER-SVM as an extension of robust SVM, which uses a truncated hinge loss. Numerical experiments imply the ER-SVM's possibility of achieving a better prediction performance with proper parameter setting.
A Scatter-Based Prototype Framework and Multi-Class Extension of Support Vector Machines
Jenssen, Robert; Kloft, Marius; Zien, Alexander; Sonnenburg, Sören; Müller, Klaus-Robert
2012-01-01
We provide a novel interpretation of the dual of support vector machines (SVMs) in terms of scatter with respect to class prototypes and their mean. As a key contribution, we extend this framework to multiple classes, providing a new joint Scatter SVM algorithm, at the level of its binary counterpart in the number of optimization variables. This enables us to implement computationally efficient solvers based on sequential minimal and chunking optimization. As a further contribution, the primal problem formulation is developed in terms of regularized risk minimization and the hinge loss, revealing the score function to be used in the actual classification of test patterns. We investigate Scatter SVM properties related to generalization ability, computational efficiency, sparsity and sensitivity maps, and report promising results. PMID:23118845
Tsetse Fly (G.f. fuscipes) Distribution in the Lake Victoria Basin of Uganda
Albert, Mugenyi; Wardrop, Nicola A; Atkinson, Peter M; Torr, Steve J; Welburn, Susan C
2015-01-01
Tsetse flies transmit trypanosomes, the causative agent of human and animal African trypanosomiasis. The tsetse vector is extensively distributed across sub-Saharan Africa. Trypanosomiasis maintenance is determined by the interrelationship of three elements: vertebrate host, parasite and the vector responsible for transmission. Mapping the distribution and abundance of tsetse flies assists in predicting trypanosomiasis distributions and developing rational strategies for disease and vector control. Given scarce resources to carry out regular full scale field tsetse surveys to up-date existing tsetse maps, there is a need to devise inexpensive means for regularly obtaining dependable area-wide tsetse data to guide control activities. In this study we used spatial epidemiological modelling techniques (logistic regression) involving 5000 field-based tsetse-data (G. f. fuscipes) points over an area of 40,000 km2, with satellite-derived environmental surrogates composed of precipitation, temperature, land cover, normalised difference vegetation index (NDVI) and elevation at the sub-national level. We used these extensive tsetse data to analyse the relationships between presence of tsetse (G. f. fuscipes) and environmental variables. The strength of the results was enhanced through the application of a spatial autologistic regression model (SARM). Using the SARM we showed that the probability of tsetse presence increased with proportion of forest cover and riverine vegetation. The key outputs are a predictive tsetse distribution map for the Lake Victoria basin of Uganda and an improved understanding of the association between tsetse presence and environmental variables. The predicted spatial distribution of tsetse in the Lake Victoria basin of Uganda will provide significant new information to assist with the spatial targeting of tsetse and trypanosomiasis control. PMID:25875201
Realistic model for a fifth force explaining anomaly in Be8* →8Bee+e- decay
NASA Astrophysics Data System (ADS)
Gu, Pei-Hong; He, Xiao-Gang
2017-06-01
We propose a theoretical model to explain a 6.8 σ anomaly recently reported in the opening angle and invariant mass distributions of e+e- pairs produced in excited Be8* nuclear transition to its ground state 8B e. The anomaly is explained by a fifth force mediated by a 17 MeV X boson through the decay Be8* →8Be X followed by X →e+e-. The X boson comes from extension of the standard model with two additional U(1) gauge symmetries producing a protophobic pure vector current interaction with quarks. The model also contains axial-vector current interaction. Although the existent axial-vector current interactions are strongly constrained by the measurement of parity violation in e-quark scattering, their contributions cancel out in the iso-scalar interaction for Be8* →8Be X. It is remarkable that the model parameters need to explain the anomaly survive all known low energy experimental constraints. The model may also alleviate the long-standing (g - 2)μ anomaly problem and can be probed by the LHCb experiment.
Billeter, M A; Naim, H Y; Udem, S A
2009-01-01
An overview is given on the development of technologies to allow reverse genetics of RNA viruses, i.e., the rescue of viruses from cDNA, with emphasis on nonsegmented negative-strand RNA viruses (Mononegavirales), as exemplified for measles virus (MV). Primarily, these technologies allowed site-directed mutagenesis, enabling important insights into a variety of aspects of the biology of these viruses. Concomitantly, foreign coding sequences were inserted to (a) allow localization of virus replication in vivo through marker gene expression, (b) develop candidate multivalent vaccines against measles and other pathogens, and (c) create candidate oncolytic viruses. The vector use of these viruses was experimentally encouraged by the pronounced genetic stability of the recombinants unexpected for RNA viruses, and by the high load of insertable genetic material, in excess of 6 kb. The known assets, such as the small genome size of the vector in comparison to DNA viruses proposed as vectors, the extensive clinical experience of attenuated MV as vaccine with a proven record of high safety and efficacy, and the low production cost per vaccination dose are thus favorably complemented.
Dark matter detectors as dark photon helioscopes.
An, Haipeng; Pospelov, Maxim; Pradler, Josef
2013-07-26
Light new particles with masses below 10 keV, often considered as a plausible extension of the standard model, will be emitted from the solar interior and can be detected on Earth with a variety of experimental tools. Here, we analyze the new "dark" vector state V, a massive vector boson mixed with the photon via an angle κ, that in the limit of the small mass mV has its emission spectrum strongly peaked at low energies. Thus, we utilize the constraints on the atomic ionization rate imposed by the results of the XENON10 experiment to set the limit on the parameters of this model: κ×mV<3×10(-12) eV. This makes low-threshold dark matter experiments the most sensitive dark vector helioscopes, as our result not only improves current experimental bounds from other searches by several orders of magnitude but also surpasses even the most stringent astrophysical and cosmological limits in a seven-decade-wide interval of mV. We generalize this approach to other light exotic particles and set the most stringent direct constraints on "minicharged" particles.
Dark matter as a ghost free conformal extension of Einstein theory
DOE Office of Scientific and Technical Information (OSTI.GOV)
Barvinsky, A.O., E-mail: barvin@td.lpi.ru
We discuss ghost free models of the recently suggested mimetic dark matter theory. This theory is shown to be a conformal extension of Einstein general relativity. Dark matter originates from gauging out its local Weyl invariance as an extra degree of freedom which describes a potential flow of the pressureless perfect fluid. For a positive energy density of this fluid the theory is free of ghost instabilities, which gives strong preference to stable configurations with a positive scalar curvature and trace of the matter stress tensor. Instabilities caused by caustics of the geodesic flow, inherent in this model, serve asmore » a motivation for an alternative conformal extension of Einstein theory, based on the generalized Proca vector field. A potential part of this field modifies the inflationary stage in cosmology, whereas its rotational part at the post inflationary epoch might simulate rotating flows of dark matter.« less
Breaking the polar-nonpolar division in solvation free energy prediction.
Wang, Bao; Wang, Chengzhang; Wu, Kedi; Wei, Guo-Wei
2018-02-05
Implicit solvent models divide solvation free energies into polar and nonpolar additive contributions, whereas polar and nonpolar interactions are inseparable and nonadditive. We present a feature functional theory (FFT) framework to break this ad hoc division. The essential ideas of FFT are as follows: (i) representability assumption: there exists a microscopic feature vector that can uniquely characterize and distinguish one molecule from another; (ii) feature-function relationship assumption: the macroscopic features, including solvation free energy, of a molecule is a functional of microscopic feature vectors; and (iii) similarity assumption: molecules with similar microscopic features have similar macroscopic properties, such as solvation free energies. Based on these assumptions, solvation free energy prediction is carried out in the following protocol. First, we construct a molecular microscopic feature vector that is efficient in characterizing the solvation process using quantum mechanics and Poisson-Boltzmann theory. Microscopic feature vectors are combined with macroscopic features, that is, physical observable, to form extended feature vectors. Additionally, we partition a solvation dataset into queries according to molecular compositions. Moreover, for each target molecule, we adopt a machine learning algorithm for its nearest neighbor search, based on the selected microscopic feature vectors. Finally, from the extended feature vectors of obtained nearest neighbors, we construct a functional of solvation free energy, which is employed to predict the solvation free energy of the target molecule. The proposed FFT model has been extensively validated via a large dataset of 668 molecules. The leave-one-out test gives an optimal root-mean-square error (RMSE) of 1.05 kcal/mol. FFT predictions of SAMPL0, SAMPL1, SAMPL2, SAMPL3, and SAMPL4 challenge sets deliver the RMSEs of 0.61, 1.86, 1.64, 0.86, and 1.14 kcal/mol, respectively. Using a test set of 94 molecules and its associated training set, the present approach was carefully compared with a classic solvation model based on weighted solvent accessible surface area. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.
A Study of Coronal-Interplanetary Coupling Mechanisms
1991-04-30
Magnetic Feild in Astrophys. J., Vol. 344, 478-493, 1989. 111.3. Reflection and Trapping of Transient Alfven Waves Propagating in an Isothermal...1990. VI.4. A Comparison Between Progressive Extension Method (PEM) and Iterative Method (IM) for Magnetic Feild Extrapolations in the Solar...Flight Center. Representative results are shown in the upper left panel of Figure 1 in which (a) shows the observed vector magnetic field at photospheric
Frame, Bronwyn; Warnberg, Katey; Main, Marcy; Wang, Kan
2015-01-01
Agrobacterium tumefaciens-mediated transformation is an effective method for introducing genes into maize. In this chapter, we describe a detailed protocol for genetic transformation of the maize genotype Hi II. Our starting plant material is immature embryos cocultivated with an Agrobacterium strain carrying a standard binary vector. In addition to step-by-step laboratory transformation procedures, we include extensive details in growing donor plants and caring for transgenic plants in the greenhouse.
Yeast Genetics and Biotechnological Applications
NASA Astrophysics Data System (ADS)
Mishra, Saroj; Baranwal, Richa
Yeast can be recognized as one of the very important groups of microorganisms on account of its extensive use in the fermentation industry and as a basic eukaryotic model cellular system. The yeast Saccharomyces cerevisiae has been extensively used to elucidate the genetics and regulation of several key functions in the cell such as cell mating, electron transport chain, protein trafficking, cell cycle events and others. Even before the genome sequence of the yeast was out, the structural organization and function of several of its genes was known. With the availability of the origin of replication from the 2 μm plasmid and the development of transformation system, it became the host of choice for expression of a number of important proteins. A large number of episomal and integrative shuttle vectors are available for expression of mammalian proteins. The latest developments in genomics and micro-array technology have allowed investigations of individual gene function by site-specific deletion method. The application of metabolic profiling has also assisted in understanding the cellular network operating in this yeast. This chapter is aimed at reviewing the use of this system as an experimental tool for conducting classical genetics. Various vector systems available, foreign genes expressed and the limitations as a host will be discussed. Finally, the use of various yeast enzymes in biotechnology sector will be reviewed.
UltraPse: A Universal and Extensible Software Platform for Representing Biological Sequences.
Du, Pu-Feng; Zhao, Wei; Miao, Yang-Yang; Wei, Le-Yi; Wang, Likun
2017-11-14
With the avalanche of biological sequences in public databases, one of the most challenging problems in computational biology is to predict their biological functions and cellular attributes. Most of the existing prediction algorithms can only handle fixed-length numerical vectors. Therefore, it is important to be able to represent biological sequences with various lengths using fixed-length numerical vectors. Although several algorithms, as well as software implementations, have been developed to address this problem, these existing programs can only provide a fixed number of representation modes. Every time a new sequence representation mode is developed, a new program will be needed. In this paper, we propose the UltraPse as a universal software platform for this problem. The function of the UltraPse is not only to generate various existing sequence representation modes, but also to simplify all future programming works in developing novel representation modes. The extensibility of UltraPse is particularly enhanced. It allows the users to define their own representation mode, their own physicochemical properties, or even their own types of biological sequences. Moreover, UltraPse is also the fastest software of its kind. The source code package, as well as the executables for both Linux and Windows platforms, can be downloaded from the GitHub repository.
Nmor, Jephtha C; Sunahara, Toshihiko; Goto, Kensuke; Futami, Kyoko; Sonye, George; Akweywa, Peter; Dida, Gabriel; Minakawa, Noboru
2013-01-16
Identification of malaria vector breeding sites can enhance control activities. Although associations between malaria vector breeding sites and topography are well recognized, practical models that predict breeding sites from topographic information are lacking. We used topographic variables derived from remotely sensed Digital Elevation Models (DEMs) to model the breeding sites of malaria vectors. We further compared the predictive strength of two different DEMs and evaluated the predictability of various habitat types inhabited by Anopheles larvae. Using GIS techniques, topographic variables were extracted from two DEMs: 1) Shuttle Radar Topography Mission 3 (SRTM3, 90-m resolution) and 2) the Advanced Spaceborne Thermal Emission Reflection Radiometer Global DEM (ASTER, 30-m resolution). We used data on breeding sites from an extensive field survey conducted on an island in western Kenya in 2006. Topographic variables were extracted for 826 breeding sites and for 4520 negative points that were randomly assigned. Logistic regression modelling was applied to characterize topographic features of the malaria vector breeding sites and predict their locations. Model accuracy was evaluated using the area under the receiver operating characteristics curve (AUC). All topographic variables derived from both DEMs were significantly correlated with breeding habitats except for the aspect of SRTM. The magnitude and direction of correlation for each variable were similar in the two DEMs. Multivariate models for SRTM and ASTER showed similar levels of fit indicated by Akaike information criterion (3959.3 and 3972.7, respectively), though the former was slightly better than the latter. The accuracy of prediction indicated by AUC was also similar in SRTM (0.758) and ASTER (0.755) in the training site. In the testing site, both SRTM and ASTER models showed higher AUC in the testing sites than in the training site (0.829 and 0.799, respectively). The predictability of habitat types varied. Drains, foot-prints, puddles and swamp habitat types were most predictable. Both SRTM and ASTER models had similar predictive potentials, which were sufficiently accurate to predict vector habitats. The free availability of these DEMs suggests that topographic predictive models could be widely used by vector control managers in Africa to complement malaria control strategies.
DOE Office of Scientific and Technical Information (OSTI.GOV)
McGhee, J.M.; Roberts, R.M.; Morel, J.E.
1997-06-01
A spherical harmonics research code (DANTE) has been developed which is compatible with parallel computer architectures. DANTE provides 3-D, multi-material, deterministic, transport capabilities using an arbitrary finite element mesh. The linearized Boltzmann transport equation is solved in a second order self-adjoint form utilizing a Galerkin finite element spatial differencing scheme. The core solver utilizes a preconditioned conjugate gradient algorithm. Other distinguishing features of the code include options for discrete-ordinates and simplified spherical harmonics angular differencing, an exact Marshak boundary treatment for arbitrarily oriented boundary faces, in-line matrix construction techniques to minimize memory consumption, and an effective diffusion based preconditioner formore » scattering dominated problems. Algorithm efficiency is demonstrated for a massively parallel SIMD architecture (CM-5), and compatibility with MPP multiprocessor platforms or workstation clusters is anticipated.« less
Dense and Sparse Matrix Operations on the Cell Processor
DOE Office of Scientific and Technical Information (OSTI.GOV)
Williams, Samuel W.; Shalf, John; Oliker, Leonid
2005-05-01
The slowing pace of commodity microprocessor performance improvements combined with ever-increasing chip power demands has become of utmost concern to computational scientists. Therefore, the high performance computing community is examining alternative architectures that address the limitations of modern superscalar designs. In this work, we examine STI's forthcoming Cell processor: a novel, low-power architecture that combines a PowerPC core with eight independent SIMD processing units coupled with a software-controlled memory to offer high FLOP/s/Watt. Since neither Cell hardware nor cycle-accurate simulators are currently publicly available, we develop an analytic framework to predict Cell performance on dense and sparse matrix operations, usingmore » a variety of algorithmic approaches. Results demonstrate Cell's potential to deliver more than an order of magnitude better GFLOP/s per watt performance, when compared with the Intel Itanium2 and Cray X1 processors.« less
A programmable computational image sensor for high-speed vision
NASA Astrophysics Data System (ADS)
Yang, Jie; Shi, Cong; Long, Xitian; Wu, Nanjian
2013-08-01
In this paper we present a programmable computational image sensor for high-speed vision. This computational image sensor contains four main blocks: an image pixel array, a massively parallel processing element (PE) array, a row processor (RP) array and a RISC core. The pixel-parallel PE is responsible for transferring, storing and processing image raw data in a SIMD fashion with its own programming language. The RPs are one dimensional array of simplified RISC cores, it can carry out complex arithmetic and logic operations. The PE array and RP array can finish great amount of computation with few instruction cycles and therefore satisfy the low- and middle-level high-speed image processing requirement. The RISC core controls the whole system operation and finishes some high-level image processing algorithms. We utilize a simplified AHB bus as the system bus to connect our major components. Programming language and corresponding tool chain for this computational image sensor are also developed.
A biconjugate gradient type algorithm on massively parallel architectures
NASA Technical Reports Server (NTRS)
Freund, Roland W.; Hochbruck, Marlis
1991-01-01
The biconjugate gradient (BCG) method is the natural generalization of the classical conjugate gradient algorithm for Hermitian positive definite matrices to general non-Hermitian linear systems. Unfortunately, the original BCG algorithm is susceptible to possible breakdowns and numerical instabilities. Recently, Freund and Nachtigal have proposed a novel BCG type approach, the quasi-minimal residual method (QMR), which overcomes the problems of BCG. Here, an implementation is presented of QMR based on an s-step version of the nonsymmetric look-ahead Lanczos algorithm. The main feature of the s-step Lanczos algorithm is that, in general, all inner products, except for one, can be computed in parallel at the end of each block; this is unlike the other standard Lanczos process where inner products are generated sequentially. The resulting implementation of QMR is particularly attractive on massively parallel SIMD architectures, such as the Connection Machine.
A heuristic for deriving the optimal number and placement of reconnaissance sensors
NASA Astrophysics Data System (ADS)
Nanda, S.; Weeks, J.; Archer, M.
2008-04-01
A key to mastering asymmetric warfare is the acquisition of accurate intelligence on adversaries and their assets in urban and open battlefields. To achieve this, one needs adequate numbers of tactical sensors placed in locations to optimize coverage, where optimality is realized by covering a given area of interest with the least number of sensors, or covering the largest possible subsection of an area of interest with a fixed set of sensors. Unfortunately, neither problem admits a polynomial time algorithm as a solution, and therefore, the placement of such sensors must utilize intelligent heuristics instead. In this paper, we present a scheme implemented on parallel SIMD processing architectures to yield significantly faster results, and that is highly scalable with respect to dynamic changes in the area of interest. Furthermore, the solution to the first problem immediately translates to serve as a solution to the latter if and when any sensors are rendered inoperable.
Targeted genome editing in a quail cell line using a customized CRISPR/Cas9 system.
Ahn, Jinsoo; Lee, Joonbum; Park, Ju Yeon; Oh, Keon Bong; Hwang, Seongsoo; Lee, Chang-Won; Lee, Kichoon
2017-05-01
Soon after RNA-guided Cas9 (CRISPR-associated protein 9) endonuclease opened a new era of targeted genome editing, the CRISPR/Cas9 platform began to be extensively used to modify genes in various types of cells and organisms. However, successful CRISPR/Cas9-mediated insertion/deletion (indel) mutation remains to be demonstrated in avian cell lines. The objective of this study was to design a poultry-specific CRISPR/Cas9 system to efficiently introduce targeted deletion mutation in chromosomes of the quail muscle clone 7 (QM7) cell line using a customized quail CRISPR vector. In this study, two avian-specific promoters, quail 7SK (q7SK) promoter and CBh promoter, the hybrid form of cytomegalovirus and chicken β-actin promoters, were cloned into a CRISPR vector for the expression of guide RNA and Cas9 protein, respectively. Then, guide RNA, which was designed to target 20-base pair (bp) nucleotides in the quail melanophilin (MLPH) locus, was ligated to the modified CRISPR vector and transfected to QM7 cells. Our results showed multiple indel mutations in the quail MLPH locus in nearly half of the alleles being tested, suggesting the high efficiency of the system for targeted gene modification. The new CRISPR vector developed from this study has the potential application to generate knockout avian cell lines and knockout poultry. © 2016 Poultry Science Association Inc.
Lõhmus, Mare; Lindström, Anders; Björklund, Mats
2012-01-01
Species in the Culex pipiens complex are common almost all over the world and represent important vectors for many serious zoonotic diseases. Even if, at the moment, many of the pathogens potentially transmitted by Cx. pipiens are not a problem in northern Europe, they may, with increasing temperatures and changing ecosystems caused by climate change, move northward in the future. Therefore, the question whether or not the Cx. pipiens populations in northern Europe will be competent vectors for them is of high importance. One way to estimate the similarity and the rate of contact between European Cx. pipiens populations is to look at the gene exchange between these populations. To test the genetic diversity and degree of differentiation between European Cx. pipiens populations, we used eight microsatellite markers in 10 mosquito populations originating from northern, central, and southern Europe. We found that three of the analyzed populations were very different from the rest of the populations and they also greatly differed from each other. When these three populations were removed, the variance among the rest of the populations was low, suggesting an extensive historic gene flow between many European Cx. pipiens populations. This suggests that infectious diseases spread by this species may not be associated with a certain vector genotype but rather with suitable environmental conditions. Consequently, we would expect these pathogens to disperse northward with favorable climatic parameters.
NASA Astrophysics Data System (ADS)
Ma, Xu; Li, Yanqiu; Guo, Xuejia; Dong, Lisong
2012-03-01
Optical proximity correction (OPC) and phase shifting mask (PSM) are the most widely used resolution enhancement techniques (RET) in the semiconductor industry. Recently, a set of OPC and PSM optimization algorithms have been developed to solve for the inverse lithography problem, which are only designed for the nominal imaging parameters without giving sufficient attention to the process variations due to the aberrations, defocus and dose variation. However, the effects of process variations existing in the practical optical lithography systems become more pronounced as the critical dimension (CD) continuously shrinks. On the other hand, the lithography systems with larger NA (NA>0.6) are now extensively used, rendering the scalar imaging models inadequate to describe the vector nature of the electromagnetic field in the current optical lithography systems. In order to tackle the above problems, this paper focuses on developing robust gradient-based OPC and PSM optimization algorithms to the process variations under a vector imaging model. To achieve this goal, an integrative and analytic vector imaging model is applied to formulate the optimization problem, where the effects of process variations are explicitly incorporated in the optimization framework. The steepest descent algorithm is used to optimize the mask iteratively. In order to improve the efficiency of the proposed algorithms, a set of algorithm acceleration techniques (AAT) are exploited during the optimization procedure.
Multiprocessing MCNP on an IBN RS/6000 cluster
DOE Office of Scientific and Technical Information (OSTI.GOV)
McKinney, G.W.; West, J.T.
1993-01-01
The advent of high-performance computer systems has brought to maturity programming concepts like vectorization, multiprocessing, and multitasking. While there are many schools of thought as to the most significant factor in obtaining order-of-magnitude increases in performance, such speedup can only be achieved by integrating the computer system and application code. Vectorization leads to faster manipulation of arrays by overlapping instruction CPU cycles. Discrete ordinates codes, which require the solving of large matrices, have proved to be major benefactors of vectorization. Monte Carlo transport, on the other hand, typically contains numerous logic statements and requires extensive redevelopment to benefit from vectorization.more » Multiprocessing and multitasking provide additional CPU cycles via multiple processors. Such systems are generally designed with either common memory access (multitasking) or distributed memory access. In both cases, theoretical speedup, as a function of the number of processors P and the fraction f of task time that multiprocesses, can be formulated using Amdahl's law: S(f, P) =1/(1-f+f/P). However, for most applications, this theoretical limit cannot be achieved because of additional terms (e.g., multitasking overhead, memory overlap, etc.) that are not included in Amdahl's law. Monte Carlo transport is a natural candidate for multiprocessing because the particle tracks are generally independent, and the precision of the result increases as the square Foot of the number of particles tracked.« less
Multiprocessing MCNP on an IBM RS/6000 cluster
DOE Office of Scientific and Technical Information (OSTI.GOV)
McKinney, G.W.; West, J.T.
1993-03-01
The advent of high-performance computer systems has brought to maturity programming concepts like vectorization, multiprocessing, and multitasking. While there are many schools of thought as to the most significant factor in obtaining order-of-magnitude increases in performance, such speedup can only be achieved by integrating the computer system and application code. Vectorization leads to faster manipulation of arrays by overlapping instruction CPU cycles. Discrete ordinates codes, which require the solving of large matrices, have proved to be major benefactors of vectorization. Monte Carlo transport, on the other hand, typically contains numerous logic statements and requires extensive redevelopment to benefit from vectorization.more » Multiprocessing and multitasking provide additional CPU cycles via multiple processors. Such systems are generally designed with either common memory access (multitasking) or distributed memory access. In both cases, theoretical speedup, as a function of the number of processors (P) and the fraction of task time that multiprocesses (f), can be formulated using Amdahl`s Law S ((f,P) = 1 f + f/P). However, for most applications this theoretical limit cannot be achieved, due to additional terms not included in Amdahl`s Law. Monte Carlo transport is a natural candidate for multiprocessing, since the particle tracks are generally independent and the precision of the result increases as the square root of the number of particles tracked.« less
Fredericks, Anthony C.; Fernandez-Sesma, Ana
2015-01-01
Dengue virus (DENV) spreads to humans through the bite of an infected Aedes aegypti or Aedes albopictus mosquito and is a growing public health threat to both industrialized and developing nations worldwide. Outbreaks of autochthonous dengue in the United States occurred extensively in the past but over the past three decades have again taken place in Florida, Hawai’i, and Texas as well as in American Samoa, Guam, Northern Mariana Islands, Puerto Rico, and the US Virgin Islands. As the Aedes vectors spread worldwide it is anticipated that DENV as well as other viruses also transmitted by these vectors, such as Chikungunya virus (CHKV), will invade new areas of the world, including the US. In this review, we describe the current burden of dengue disease worldwide and the potential introduction of DENV and CHKV into different areas of the US. Of these areas, the state of California saw the arrival and spread of the Aedes aegypti vector beginning in 2013. This invasion presents a developing situation when considering the state’s number of imported dengue cases and proximity to northern Mexico as well as the rising specter of chikungunya in the Western hemisphere. The distribution of Aedes vectors in California as well as a discussion of several factors contributing to the risk of dengue importation are discussed and evaluated. PMID:25960096
Humbert, Olivier; Chan, Frieda; Rajawat, Yogendra S.; Torgerson, Troy R.; Burtner, Christopher R.; Hubbard, Nicholas W.; Humphrys, Daniel; Norgaard, Zachary K.; O’Donnell, Patricia; Adair, Jennifer E.; Trobridge, Grant D.; Scharenberg, Andrew M.; Felsburg, Peter J.; Rawlings, David J.
2018-01-01
Hematopoietic stem-cell gene therapy is a promising treatment of X-linked severe combined immunodeficiency disease (SCID-X1), but currently, it requires recipient conditioning, extensive cell manipulation, and sophisticated facilities. With these limitations in mind, we explored a simpler therapeutic approach to SCID-X1 treatment by direct IV administration of foamy virus (FV) vectors in the canine model. FV vectors were used because they have a favorable integration site profile and are resistant to serum inactivation. Here, we show improved efficacy of our in vivo gene therapy platform by mobilization with granulocyte colony-stimulating factor (G-CSF) and AMD3100 before injection of an optimized FV vector incorporating the human phosphoglycerate kinase enhancerless promoter. G-CSF/AMD3100 mobilization before FV vector delivery accelerated kinetics of CD3+ lymphocyte recovery, promoted thymopoiesis, and increased immune clonal diversity. Gene-corrected T lymphocytes exhibited a normal CD4:CD8 ratio and a broad T-cell receptor repertoire and showed restored γC-dependent signaling function. Treated animals showed normal primary and secondary antibody responses to bacteriophage immunization and evidence for immunoglobulin class switching. These results demonstrate safety and efficacy of an accessible, portable, and translatable platform with no conditioning regimen for the treatment of SCID-X1 and other genetic diseases. PMID:29720491
NASA Astrophysics Data System (ADS)
Marco, F. J.; Martínez, M. J.; López, J. A.
2015-04-01
The high quality of Hipparcos data in position, proper motion, and parallax has allowed for studies about stellar kinematics with the aim of achieving a better physical understanding of our galaxy, based on accurate calculus of the Ogorodnikov-Milne model (OMM) parameters. The use of discrete least squares is the most common adjustment method, but it may lead to errors mainly because of the inhomogeneous spatial distribution of the data. We present an example of the instability of this method using the case of a function given by a linear combination of Legendre polynomials. These polynomials are basic in the use of vector spherical harmonics, which have been used to compute the OMM parameters by several authors, such as Makarov & Murphy, Mignard & Klioner, and Vityazev & Tsvetkov. To overcome the former problem, we propose the use of a mixed method (see Marco et al.) that includes the extension of the functions of residuals to any point on the celestial sphere. The goal is to be able to work with continuous variables in the calculation of the coefficients of the vector spherical harmonic developments with stability and efficiency. We apply this mixed procedure to the study of the kinematics of the stars in our Galaxy, employing the Hipparcos velocity field data to obtain the OMM parameters. Previously, we tested the method by perturbing the Vectorial Spherical Harmonics model as well as the velocity vector field.
A Review of Methods for Detection of Hepatozoon Infection in Carnivores and Arthropod Vectors.
Modrý, David; Beck, Relja; Hrazdilová, Kristýna; Baneth, Gad
2017-01-01
Vector-borne protists of the genus Hepatozoon belong to the apicomplexan suborder Adeleorina. The taxonomy of Hepatozoon is unsettled and different phylogenetic clades probably represent evolutionary units deserving the status of separate genera. Throughout our review, we focus on the monophyletic assemblage of Hepatozoon spp. from carnivores, classified as Hepatozoon sensu stricto that includes important pathogens of domestic and free-ranging canine and feline hosts. We provide an overview of diagnostic methods and approaches from classical detection in biological materials, through serological tests to nucleic acid amplification tests (NAATs). Critical review of used primers for the 18S rDNA is provided, together with information on individual primer pairs. Extension of used NAATs target to cover also mitochondrial genes is suggested as a key step in understanding the diversity and molecular epidemiology of Hepatozoon infections in mammals.
Glyph-based analysis of multimodal directional distributions in vector field ensembles
NASA Astrophysics Data System (ADS)
Jarema, Mihaela; Demir, Ismail; Kehrer, Johannes; Westermann, Rüdiger
2015-04-01
Ensemble simulations are increasingly often performed in the geosciences in order to study the uncertainty and variability of model predictions. Describing ensemble data by mean and standard deviation can be misleading in case of multimodal distributions. We present first results of a glyph-based visualization of multimodal directional distributions in 2D and 3D vector ensemble data. Directional information on the circle/sphere is modeled using mixtures of probability density functions (pdfs), which enables us to characterize the distributions with relatively few parameters. The resulting mixture models are represented by 2D and 3D lobular glyphs showing direction, spread and strength of each principal mode of the distributions. A 3D extension of our approach is realized by means of an efficient GPU rendering technique. We demonstrate our method in the context of ensemble weather simulations.
NASA Astrophysics Data System (ADS)
Epis, Sara; Porretta, Daniele; Mastrantonio, Valentina; Urbanelli, Sandra; Sassera, Davide; De Marco, Leone; Mereghetti, Valeria; Montagna, Matteo; Ricci, Irene; Favia, Guido; Bandi, Claudio
2014-12-01
In insects, ABC transporters have been shown to contribute to defence/resistance to insecticides by reducing toxic concentrations in cells/tissues. Despite the extensive studies about this detoxifying mechanism, the temporal patterns of ABC transporter activation have been poorly investigated. Using the malaria vector Anopheles stephensi as a study system, we investigated the expression profile of ABC genes belonging to different subfamilies in permethrin-treated larvae at different time points (30 min to 48 h). Our results showed that the expression of ABCB and ABCG subfamily genes was upregulated at 1 h after treatment, with the highest expression observed at 6 h. Therefore, future investigations on the temporal dynamics of ABC gene expression will allow a better implementation of insecticide treatment regimens, including the use of specific inhibitors of ABC efflux pumps.
Shelnutt, Leslie M; Balakrishnan, Nandhakumar; DeVanna, Justin; Batey, Kenneth L; Breitschwerdt, Edward B
2017-03-01
As a result of extensive field-related activities, military working dogs (MWDs) have an increased occupational risk for acquiring vector-borne infectious diseases. Indirect fluorescent antibody, Bartonella alpha-proteobacteria growth medium enrichment culture, and 16-23S Bartonella intergenic transcribed spacer polymerase chain reaction were performed using blood, serum, or tissue specimens. Endocarditis was diagnosed in three MWDs infected with Bartonella vinsonii subspecies (subsp.) berkhoffii genotype III. One dog was also infected with Bartonella rochalimae. B. vinsonii subsp. berkhoffii genotype III may represent an occupational risk for MWDs that develop endocarditis or myocarditis. Comprehensive periodic screening for canine vector-borne infections, in particular occult infections caused by Bartonella spp, is prudent to avoid serious or life-threating illnesses. Reprint & Copyright © 2017 Association of Military Surgeons of the U.S.
The new MSFC Solar vector magnetograph. Center director's discretionary fund
NASA Technical Reports Server (NTRS)
Hagyard, M. J.; West, E. A.; Cumings, N. P.
1984-01-01
The unique MSFC solar vector magnetograph allows measurements of all three components of the Sun's photospheric magnetic field over a wide field-of-view with spatial resolution determined by a 2.7 x 2.7 arc second pixel size. This system underwent extensive modifications to improve its sensitivity and temporal response. The modifications included replacing an SEC vidicon detector with a solid-state CCD camera; replacing the original digital logic circuitry with an electronic controller and a computer to provide complete, programmable control over the entire operation of the magnetograph; and installing a new polarimeter which consists of a single electro-optical modulator coupled with interchangeable waveplates mounted on a rotating assembly. The system is described and results of calibrations and tests are presented. Initial observations of solar magnetic fields with the new magnetograph are presented.
Cloud identification using genetic algorithms and massively parallel computation
NASA Technical Reports Server (NTRS)
Buckles, Bill P.; Petry, Frederick E.
1996-01-01
As a Guest Computational Investigator under the NASA administered component of the High Performance Computing and Communication Program, we implemented a massively parallel genetic algorithm on the MasPar SIMD computer. Experiments were conducted using Earth Science data in the domains of meteorology and oceanography. Results obtained in these domains are competitive with, and in most cases better than, similar problems solved using other methods. In the meteorological domain, we chose to identify clouds using AVHRR spectral data. Four cloud speciations were used although most researchers settle for three. Results were remarkedly consistent across all tests (91% accuracy). Refinements of this method may lead to more timely and complete information for Global Circulation Models (GCMS) that are prevalent in weather forecasting and global environment studies. In the oceanographic domain, we chose to identify ocean currents from a spectrometer having similar characteristics to AVHRR. Here the results were mixed (60% to 80% accuracy). Given that one is willing to run the experiment several times (say 10), then it is acceptable to claim the higher accuracy rating. This problem has never been successfully automated. Therefore, these results are encouraging even though less impressive than the cloud experiment. Successful conclusion of an automated ocean current detection system would impact coastal fishing, naval tactics, and the study of micro-climates. Finally we contributed to the basic knowledge of GA (genetic algorithm) behavior in parallel environments. We developed better knowledge of the use of subpopulations in the context of shared breeding pools and the migration of individuals. Rigorous experiments were conducted based on quantifiable performance criteria. While much of the work confirmed current wisdom, for the first time we were able to submit conclusive evidence. The software developed under this grant was placed in the public domain. An extensive user's manual was written and distributed nationwide to scientists whose work might benefit from its availability. Several papers, including two journal articles, were produced.
Quantum theory of multiple-input-multiple-output Markovian feedback with diffusive measurements
DOE Office of Scientific and Technical Information (OSTI.GOV)
Chia, A.; Wiseman, H. M.
2011-07-15
Feedback control engineers have been interested in multiple-input-multiple-output (MIMO) extensions of single-input-single-output (SISO) results of various kinds due to its rich mathematical structure and practical applications. An outstanding problem in quantum feedback control is the extension of the SISO theory of Markovian feedback by Wiseman and Milburn [Phys. Rev. Lett. 70, 548 (1993)] to multiple inputs and multiple outputs. Here we generalize the SISO homodyne-mediated feedback theory to allow for multiple inputs, multiple outputs, and arbitrary diffusive quantum measurements. We thus obtain a MIMO framework which resembles the SISO theory and whose additional mathematical structure is highlighted by the extensivemore » use of vector-operator algebra.« less
NASA Astrophysics Data System (ADS)
Magnin, H.; Coulomb, J. L.
1993-03-01
Electromagnetic field computation with the Finite Element (FE) method implies solving of large linear systems of equations. Performances and memory capacities of today computers allow to achieve three-dimensional FE discretizations of electromagnetic problems, but the number of unknowns grows high. So, to improve time to the numerical solution of the linear system(s) thus arising, the use of parallel and/or vector computers has to be envisaged. In this paper, the main constitutive steps of the Pre-conditioned Conjugate Gradient algorithm (PCG) are analysed. After a short recall of our previous work concerning their improvement by use of vector and parallel computations, we show some speedup limitations due to the sparse row-wise matrix storage scheme employed. Then, an extension of this matrix representation is proposed, leading to introduce redundant storage of non-zero coefficients. In spite of the “memory waste” thus implied, it is shown how this extension can be successfully employed to increase the speedup due to parallelism and vectorization on the whole algorithm, and in particular to derive a parallel preconditioner. La résolution par la méthode des éléments finis des équations de l'électromagnétisme conduit à résoudre de grands systèmes d'équations linéaires. Les capacités mémoire et les performances actuelles des systèmes informatiques permettent de traiter les problèmes électromagnétiques par discrétisation tridimensionnelle, mais alors le nombre d'inconnues devient très élevé. Ainsi, la résolution en un temps raisonnable des équations linéaires associées à de telles discrétisations conduit à envisager l'emploi d'ordinateurs à architecture parallèle. Dans cet article, les différentes étapes constitutives de l'algorithme du gradient conjugué préconditionné (GCP) sont analysées. Après un court rappel de nos travaux antérieurs concemant leur amélioration par utilisation de traitements parallèles et vectoriels, nous montrons les limitations du gain de temps dues au mode de stockage matriciel utilisé : la représentation creuse dite “Morse”. Nous proposons alors une extension de ce mode de stockage, conduisant à l'introduction de redondance au niveau du rangement des termes matriciels en mémoire. Malgré le “gaspillage” mémoire ainsi occasionné, il apparait que cette extension peut être mise à profit pour augmenter sensiblement les gains par parallélisation et vectorisation de l'ensemble de l'algorithme du gradient conjugué, et notamment pour la réalisation d'un pré-conditionnement parallèle.
de Miranda, Renata Lima; de Castro, Jacqueline Ribeiro; Olegário, Maria Marlene Martins; Beletti, Marcelo Emílio; Mundim, Antonio Vicente; O'Dwyer, Lucia Helena; Eyal, Osnat; Talmi-Frank, Dalit; Cury, Márcia Cristina; Baneth, Gad
2011-05-11
Canine hepatozoonosis is a tick-borne disease caused by protozoans of the genus Hepatozoon. Several tick species have been implicated as potential vectors. Therefore, extensive studies are needed to determine the 'natural' endemic cycle of this parasite. This paper presents the first report of the presence of Hepatozoon canis oocysts in Rhipicephalus (Boophilus) microplus collected from an infected dog. Copyright © 2011 Elsevier B.V. All rights reserved.
High speed data transmission coaxial-cable in the space communication system
NASA Astrophysics Data System (ADS)
Su, Haohang; Huang, Jing
2018-01-01
An effective method is proved based on the scattering parameter of high speed 8-core coaxial-cable measured by vector network analyzer, and the semi-physical simulation is made to receive the eye diagram at different data transmission rate. The result can be apply to analysis decay and distortion of the signal through the coaxial-cable at high frequency, and can extensively design for electromagnetic compatibility of high-speed data transmission system.
Designing a Soluble Near Full-Length HIV-1 GP41 Trimer
2012-11-26
envelope; gp41 trimer; bacteriophage T4 display; prehairpin fusion intermediate. Background: The envelope glycoprotein gp41 is a key component of...protein into trimers and defined oligomers. These gp41 trimers were displayed on bacteriophage T4 capsid nanoparticles by attaching to the small...Construction of the Expression Vectors —All the gp41 constructs were generated by splicing-by- overlap extension PCR using wild-type HXB2 gp41 DNA
An Example of Linear Mappings: Extension to Rhotrices
ERIC Educational Resources Information Center
Aminu, Abdulhadi
2010-01-01
Let U and V be vector spaces. A mapping T : U [right arrow] V is linear if for each u[subscript 1], u[subscript 2] [is an element of] U and each scalar alpha; T(u[subscript 1] + u[subscript 2]) = T(u[subscript 1] + T(u[subscript 2]) and T(alpha u[subscript 1]) = alpha T(u[subscript 1]). We extend this mapping to the case when U and V are rhotrix…
Geographic Distribution and Ecology of Potential Malaria Vectors in the Republic of Korea
2009-05-01
species . Figure 4 shows a minimal spanning tree of the non- metric multidimensional scaling analysis of the means of the Þrst 15 principal components...to develop ecological niche models (ENMs) of the potential geographic distribution for eight anopheline species known to occur there. The areas...predicted suitable for the Hyrcanus Group species were the most extensive for Anopheles sinensis Wiedemann, An. kleini Rueda, An. belenrae Rueda, and An
Leucocytozoonosis in Canada Geese at the Seney National Wildlife Refuge
Herman, C.M.; Barrow, J.H.; Tarshis, I.B.
1975-01-01
A history is given of the Seney National Wildlife Refuge and the losses of goslings of Canada geese (Branta canadensis) recorded since inception of the refuge in 1935. Since 1960, when more reliable data became available, losses have been extensive every 4 years. Gosling deaths are attributed to the infection with Leucocytozoon simondi. The blackfly (Simulium innocens) is considered to be the prime vector in the transmission of this blood parasite to goslings.
On the biomechanical analysis of the calories expended in a straight boxing jab
2017-01-01
Boxing and related sports activities have become a standard workout regime at many fitness studios worldwide. Oftentimes, people are interested in the calories expended during these workouts. This note focuses on determining the calories in a boxer's jab, using kinematic vector-loop relations and basic work–energy principles. Numerical simulations are undertaken to illustrate the basic model. Multi-limb extensions of the model are also discussed. PMID:28404871
Measurement of the Michel rho parameter in direct muon decay
DOE Office of Scientific and Technical Information (OSTI.GOV)
Piilonen, Leo; Haim, D.; Lee, F. S.
1997-05-20
We report on the status of LAMPF experiment E-1240 to measure the Michel {rho} parameter in direct muon decay. This experiment ran in 1993, and the data are currently being analyzed. The expected precision on the {rho} parameter is {+-}0.0008. This result will provide better constraints on new physics, particularly on the charged vector bosons' mixing angle {zeta} in the manifestly left-right symmetric extension of the Standard Model.
Bridges, Thomas J.
2016-01-01
Multiphase wavetrains are multiperiodic travelling waves with a set of distinct wavenumbers and distinct frequencies. In conservative systems, such families are associated with the conservation of wave action or other conservation law. At generic points (where the Jacobian of the wave action flux is non-degenerate), modulation of the wavetrain leads to the dispersionless multiphase conservation of wave action. The main result of this paper is that modulation of the multiphase wavetrain, when the Jacobian of the wave action flux vector is singular, morphs the vector-valued conservation law into the scalar Korteweg–de Vries (KdV) equation. The coefficients in the emergent KdV equation have a geometrical interpretation in terms of projection of the vector components of the conservation law. The theory herein is restricted to two phases to simplify presentation, with extensions to any finite dimension discussed in the concluding remarks. Two applications of the theory are presented: a coupled nonlinear Schrödinger equation and two-layer shallow-water hydrodynamics with a free surface. Both have two-phase solutions where criticality and the properties of the emergent KdV equation can be determined analytically. PMID:28119546
NASA Technical Reports Server (NTRS)
Strickland, Mark E.; Bundick, W. Thomas; Messina, Michael D.; Hoffler, Keith D.; Carzoo, Susan W.; Yeager, Jessie C.; Beissner, Fred L., Jr.
1996-01-01
The 'f18harv' six degree-of-freedom nonlinear batch simulation used to support research in advanced control laws and flight dynamics issues as part of NASA's High Alpha Technology Program is described in this report. This simulation models an F/A-18 airplane modified to incorporate a multi-axis thrust-vectoring system for augmented pitch and yaw control power and actuated forebody strakes for enhanced aerodynamic yaw control power. The modified configuration is known as the High Alpha Research Vehicle (HARV). The 'f18harv' simulation was an outgrowth of the 'f18bas' simulation which modeled the basic F/A-18 with a preliminary version of a thrust-vectoring system designed for the HARV. The preliminary version consisted of two thrust-vectoring vanes per engine nozzle compared with the three vanes per engine actually employed on the F/A-18 HARV. The modeled flight envelope is extensive in that the aerodynamic database covers an angle-of-attack range of -10 degrees to +90 degrees, sideslip range of -20 degrees to +20 degrees, a Mach Number range between 0.0 and 2.0, and an altitude range between 0 and 60,000 feet.
Relevance Vector Machine Learning for Neonate Pain Intensity Assessment Using Digital Imaging
Gholami, Behnood; Tannenbaum, Allen R.
2011-01-01
Pain assessment in patients who are unable to verbally communicate is a challenging problem. The fundamental limitations in pain assessment in neonates stem from subjective assessment criteria, rather than quantifiable and measurable data. This often results in poor quality and inconsistent treatment of patient pain management. Recent advancements in pattern recognition techniques using relevance vector machine (RVM) learning techniques can assist medical staff in assessing pain by constantly monitoring the patient and providing the clinician with quantifiable data for pain management. The RVM classification technique is a Bayesian extension of the support vector machine (SVM) algorithm, which achieves comparable performance to SVM while providing posterior probabilities for class memberships and a sparser model. If classes represent “pure” facial expressions (i.e., extreme expressions that an observer can identify with a high degree of confidence), then the posterior probability of the membership of some intermediate facial expression to a class can provide an estimate of the intensity of such an expression. In this paper, we use the RVM classification technique to distinguish pain from nonpain in neonates as well as assess their pain intensity levels. We also correlate our results with the pain intensity assessed by expert and nonexpert human examiners. PMID:20172803
Recursive feature selection with significant variables of support vectors.
Tsai, Chen-An; Huang, Chien-Hsun; Chang, Ching-Wei; Chen, Chun-Houh
2012-01-01
The development of DNA microarray makes researchers screen thousands of genes simultaneously and it also helps determine high- and low-expression level genes in normal and disease tissues. Selecting relevant genes for cancer classification is an important issue. Most of the gene selection methods use univariate ranking criteria and arbitrarily choose a threshold to choose genes. However, the parameter setting may not be compatible to the selected classification algorithms. In this paper, we propose a new gene selection method (SVM-t) based on the use of t-statistics embedded in support vector machine. We compared the performance to two similar SVM-based methods: SVM recursive feature elimination (SVMRFE) and recursive support vector machine (RSVM). The three methods were compared based on extensive simulation experiments and analyses of two published microarray datasets. In the simulation experiments, we found that the proposed method is more robust in selecting informative genes than SVMRFE and RSVM and capable to attain good classification performance when the variations of informative and noninformative genes are different. In the analysis of two microarray datasets, the proposed method yields better performance in identifying fewer genes with good prediction accuracy, compared to SVMRFE and RSVM.
NASA Astrophysics Data System (ADS)
Wang, Qiqi; Rigas, Georgios; Esclapez, Lucas; Magri, Luca; Blonigan, Patrick
2016-11-01
Bluff body flows are of fundamental importance to many engineering applications involving massive flow separation and in particular the transport industry. Coherent flow structures emanating in the wake of three-dimensional bluff bodies, such as cars, trucks and lorries, are directly linked to increased aerodynamic drag, noise and structural fatigue. For low Reynolds laminar and transitional regimes, hydrodynamic stability theory has aided the understanding and prediction of the unstable dynamics. In the same framework, sensitivity analysis provides the means for efficient and optimal control, provided the unstable modes can be accurately predicted. However, these methodologies are limited to laminar regimes where only a few unstable modes manifest. Here we extend the stability analysis to low-dimensional chaotic regimes by computing the Lyapunov covariant vectors and their associated Lyapunov exponents. We compare them to eigenvectors and eigenvalues computed in traditional hydrodynamic stability analysis. Computing Lyapunov covariant vectors and Lyapunov exponents also enables the extension of sensitivity analysis to chaotic flows via the shadowing method. We compare the computed shadowing sensitivities to traditional sensitivity analysis. These Lyapunov based methodologies do not rely on mean flow assumptions, and are mathematically rigorous for calculating sensitivities of fully unsteady flow simulations.
Li, Ji; Hu, Guoqing; Zhou, Yonghong; Zou, Chong; Peng, Wei; Alam Sm, Jahangir
2016-10-14
A piezo-resistive pressure sensor is made of silicon, the nature of which is considerably influenced by ambient temperature. The effect of temperature should be eliminated during the working period in expectation of linear output. To deal with this issue, an approach consists of a hybrid kernel Least Squares Support Vector Machine (LSSVM) optimized by a chaotic ions motion algorithm presented. To achieve the learning and generalization for excellent performance, a hybrid kernel function, constructed by a local kernel as Radial Basis Function (RBF) kernel, and a global kernel as polynomial kernel is incorporated into the Least Squares Support Vector Machine. The chaotic ions motion algorithm is introduced to find the best hyper-parameters of the Least Squares Support Vector Machine. The temperature data from a calibration experiment is conducted to validate the proposed method. With attention on algorithm robustness and engineering applications, the compensation result shows the proposed scheme outperforms other compared methods on several performance measures as maximum absolute relative error, minimum absolute relative error mean and variance of the averaged value on fifty runs. Furthermore, the proposed temperature compensation approach lays a foundation for more extensive research.
A three-dimensional nonlinear Timoshenko beam based on the core-congruential formulation
NASA Technical Reports Server (NTRS)
Crivelli, Luis A.; Felippa, Carlos A.
1992-01-01
A three-dimensional, geometrically nonlinear two-node Timoshenkoo beam element based on the total Larangrian description is derived. The element behavior is assumed to be linear elastic, but no restrictions are placed on magnitude of finite rotations. The resulting element has twelve degrees of freedom: six translational components and six rotational-vector components. The formulation uses the Green-Lagrange strains and second Piola-Kirchhoff stresses as energy-conjugate variables and accounts for the bending-stretching and bending-torsional coupling effects without special provisions. The core-congruential formulation (CCF) is used to derived the discrete equations in a staged manner. Core equations involving the internal force vector and tangent stiffness matrix are developed at the particle level. A sequence of matrix transformations carries these equations to beam cross-sections and finally to the element nodal degrees of freedom. The choice of finite rotation measure is made in the next-to-last transformation stage, and the choice of over-the-element interpolation in the last one. The tangent stiffness matrix is found to retain symmetry if the rotational vector is chosen to measure finite rotations. An extensive set of numerical examples is presented to test and validate the present element.
Acoustic communication in insect disease vectors
Vigoder, Felipe de Mello; Ritchie, Michael Gordon; Gibson, Gabriella; Peixoto, Alexandre Afranio
2013-01-01
Acoustic signalling has been extensively studied in insect species, which has led to a better understanding of sexual communication, sexual selection and modes of speciation. The significance of acoustic signals for a blood-sucking insect was first reported in the XIX century by Christopher Johnston, studying the hearing organs of mosquitoes, but has received relatively little attention in other disease vectors until recently. Acoustic signals are often associated with mating behaviour and sexual selection and changes in signalling can lead to rapid evolutionary divergence and may ultimately contribute to the process of speciation. Songs can also have implications for the success of novel methods of disease control such as determining the mating competitiveness of modified insects used for mass-release control programs. Species-specific sound “signatures” may help identify incipient species within species complexes that may be of epidemiological significance, e.g. of higher vectorial capacity, thereby enabling the application of more focussed control measures to optimise the reduction of pathogen transmission. Although the study of acoustic communication in insect vectors has been relatively limited, this review of research demonstrates their value as models for understanding both the functional and evolutionary significance of acoustic communication in insects. PMID:24473800
An upwind, kinetic flux-vector splitting method for flows in chemical and thermal non-equilibrium
NASA Technical Reports Server (NTRS)
Eppard, W. M.; Grossman, B.
1993-01-01
We have developed new upwind kinetic difference schemes for flows with non-equilibrium thermodynamics and chemistry. These schemes are derived from the Boltzmann equation with the resulting Euler schemes developed as moments of the discretized Boltzmann scheme with a locally Maxwellian velocity distribution. Splitting the velocity distribution at the Boltzmann level is seen to result in a flux-split Euler scheme and is called Kinetic Flux Vector Splitting (KFVS). Extensions to flows with finite-rate chemistry and vibrational relaxation is accomplished utilizing nonequilibrium kinetic theory. Computational examples are presented comparing KFVS with the schemes of Van Leer and Roe for a quasi-one-dimensional flow through a supersonic diffuser, inviscid flow through two-dimensional inlet, and viscous flow over a cone at zero angle-of-attack. Calculations are also shown for the transonic flow over a bump in a channel and the transonic flow over an NACA 0012 airfoil. The results show that even though the KFVS scheme is a Riemann solver at the kinetic level, its behavior at the Euler level is more similar to the existing flux-vector splitting algorithms than to the flux-difference splitting scheme of Roe.
Wen, Zaidao; Hou, Zaidao; Jiao, Licheng
2017-11-01
Discriminative dictionary learning (DDL) framework has been widely used in image classification which aims to learn some class-specific feature vectors as well as a representative dictionary according to a set of labeled training samples. However, interclass similarities and intraclass variances among input samples and learned features will generally weaken the representability of dictionary and the discrimination of feature vectors so as to degrade the classification performance. Therefore, how to explicitly represent them becomes an important issue. In this paper, we present a novel DDL framework with two-level low rank and group sparse decomposition model. In the first level, we learn a class-shared and several class-specific dictionaries, where a low rank and a group sparse regularization are, respectively, imposed on the corresponding feature matrices. In the second level, the class-specific feature matrix will be further decomposed into a low rank and a sparse matrix so that intraclass variances can be separated to concentrate the corresponding feature vectors. Extensive experimental results demonstrate the effectiveness of our model. Compared with the other state-of-the-arts on several popular image databases, our model can achieve a competitive or better performance in terms of the classification accuracy.
Tensor gauge condition and tensor field decomposition
NASA Astrophysics Data System (ADS)
Zhu, Ben-Chao; Chen, Xiang-Song
2015-10-01
We discuss various proposals of separating a tensor field into pure-gauge and gauge-invariant components. Such tensor field decomposition is intimately related to the effort of identifying the real gravitational degrees of freedom out of the metric tensor in Einstein’s general relativity. We show that as for a vector field, the tensor field decomposition has exact correspondence to and can be derived from the gauge-fixing approach. The complication for the tensor field, however, is that there are infinitely many complete gauge conditions in contrast to the uniqueness of Coulomb gauge for a vector field. The cause of such complication, as we reveal, is the emergence of a peculiar gauge-invariant pure-gauge construction for any gauge field of spin ≥ 2. We make an extensive exploration of the complete tensor gauge conditions and their corresponding tensor field decompositions, regarding mathematical structures, equations of motion for the fields and nonlinear properties. Apparently, no single choice is superior in all aspects, due to an awkward fact that no gauge-fixing can reduce a tensor field to be purely dynamical (i.e. transverse and traceless), as can the Coulomb gauge in a vector case.
Alcaide, Miguel; Rico, Ciro; Ruiz, Santiago; Soriguer, Ramón; Muñoz, Joaquín; Figuerola, Jordi
2009-01-01
Emerging infectious diseases represent a challenge for global economies and public health. About one fourth of the last pandemics have been originated by the spread of vector-borne pathogens. In this sense, the advent of modern molecular techniques has enhanced our capabilities to understand vector-host interactions and disease ecology. However, host identification protocols have poorly profited of international DNA barcoding initiatives and/or have focused exclusively on a limited array of vector species. Therefore, ascertaining the potential afforded by DNA barcoding tools in other vector-host systems of human and veterinary importance would represent a major advance in tracking pathogen life cycles and hosts. Here, we show the applicability of a novel and efficient molecular method for the identification of the vertebrate host's DNA contained in the midgut of blood-feeding arthropods. To this end, we designed a eukaryote-universal forward primer and a vertebrate-specific reverse primer to selectively amplify 758 base pairs (bp) of the vertebrate mitochondrial Cytochrome c Oxidase Subunit I (COI) gene. Our method was validated using both extensive sequence surveys from the public domain and Polymerase Chain Reaction (PCR) experiments carried out over specimens from different Classes of vertebrates (Mammalia, Aves, Reptilia and Amphibia) and invertebrate ectoparasites (Arachnida and Insecta). The analysis of mosquito, culicoid, phlebotomie, sucking bugs, and tick bloodmeals revealed up to 40 vertebrate hosts, including 23 avian, 16 mammalian and one reptilian species. Importantly, the inspection and analysis of direct sequencing electropherograms also assisted the resolving of mixed bloodmeals. We therefore provide a universal and high-throughput diagnostic tool for the study of the ecology of haematophagous invertebrates in relation to their vertebrate hosts. Such information is crucial to support the efficient management of initiatives aimed at reducing epidemiologic risks of arthropod vector-borne pathogens, a priority for public health. PMID:19768113
GuhaSarkar, Dwijit; Neiswender, James; Su, Qin; Gao, Guangping; Sena-Esteves, Miguel
2017-02-01
The highly invasive property of glioblastoma (GBM) cells and genetic heterogeneity are largely responsible for tumor recurrence after the current standard-of-care treatment and thus a direct cause of death. Previously, we have shown that intracranial interferon-beta (IFN-β) gene therapy by locally administered adeno-associated viral vectors (AAV) successfully treats noninvasive orthotopic glioblastoma models. Here, we extend these findings by testing this approach in invasive human GBM xenograft and syngeneic mouse models. First, we show that a single intracranial injection of AAV encoding human IFN-β eliminates invasive human GBM8 tumors and promotes long-term survival. Next, we screened five AAV-IFN-β vectors with different promoters to drive safe expression of mouse IFN-β in the brain in the context of syngeneic GL261 tumors. Two AAV-IFN-β vectors were excluded due to safety concerns, but therapeutic studies with the other three vectors showed extensive tumor cell death, activation of microglia surrounding the tumors, and a 56% increase in median survival of the animals treated with AAV/P2-Int-mIFN-β vector. We also assessed the therapeutic effect of combining AAV-IFN-β therapy with temozolomide (TMZ). As TMZ affects DNA replication, an event that is crucial for second-strand DNA synthesis of single-stranded AAV vectors before active transcription, we tested two TMZ treatment regimens. Treatment with TMZ prior to AAV-IFN-β abrogated any benefit from the latter, while the reverse order of treatment doubled the median survival compared to controls. These studies demonstrate the therapeutic potential of intracranial AAV-IFN-β therapy in a highly migratory GBM model as well as in a syngeneic mouse model and that combination with TMZ is likely to enhance its antitumor potency. © 2016 The Authors. Published by FEBS Press and John Wiley & Sons Ltd.
The determination of high-resolution spatio-temporal glacier motion fields from time-lapse sequences
NASA Astrophysics Data System (ADS)
Schwalbe, Ellen; Maas, Hans-Gerd
2017-12-01
This paper presents a comprehensive method for the determination of glacier surface motion vector fields at high spatial and temporal resolution. These vector fields can be derived from monocular terrestrial camera image sequences and are a valuable data source for glaciological analysis of the motion behaviour of glaciers. The measurement concepts for the acquisition of image sequences are presented, and an automated monoscopic image sequence processing chain is developed. Motion vector fields can be derived with high precision by applying automatic subpixel-accuracy image matching techniques on grey value patterns in the image sequences. Well-established matching techniques have been adapted to the special characteristics of the glacier data in order to achieve high reliability in automatic image sequence processing, including the handling of moving shadows as well as motion effects induced by small instabilities in the camera set-up. Suitable geo-referencing techniques were developed to transform image measurements into a reference coordinate system.The result of monoscopic image sequence analysis is a dense raster of glacier surface point trajectories for each image sequence. Each translation vector component in these trajectories can be determined with an accuracy of a few centimetres for points at a distance of several kilometres from the camera. Extensive practical validation experiments have shown that motion vector and trajectory fields derived from monocular image sequences can be used for the determination of high-resolution velocity fields of glaciers, including the analysis of tidal effects on glacier movement, the investigation of a glacier's motion behaviour during calving events, the determination of the position and migration of the grounding line and the detection of subglacial channels during glacier lake outburst floods.
Walsh, David P; Murphy, Robert D; Panarella, Angela; Raftery, Rosanne M; Cavanagh, Brenton; Simpson, Jeremy C; O'Brien, Fergal J; Heise, Andreas; Cryan, Sally-Ann
2018-05-07
The field of tissue engineering is increasingly recognizing that gene therapy can be employed for modulating in vivo cellular response thereby guiding tissue regeneration. However, the field lacks a versatile and biocompatible gene delivery platform capable of efficiently delivering transgenes to mesenchymal stem cells (MSCs), a cell type often refractory to transfection. Herein, we describe the extensive and systematic exploration of three architectural variations of star-shaped poly(l-lysine) polypeptide (star-PLL) with varying number and length of poly(l-lysine) arms as potential nonviral gene delivery vectors for MSCs. We demonstrate that star-PLL vectors are capable of self-assembling with pDNA to form stable, cationic nanomedicines. Utilizing high content screening, live cell imaging, and mechanistic uptake studies we confirm the intracellular delivery of pDNA by star-PLLs to MSCs is a rapid process, which likely proceeds via a clathrin-independent mechanism. We identify a star-PLL composition with 64 poly(l-lysine) arms and five l-lysine subunits per arm as a particularly efficient vector that is capable of delivering both reporter genes and the therapeutic transgenes bone morphogenetic protein-2 and vascular endothelial growth factor to MSCs. This composition facilitated a 1000-fold increase in transgene expression in MSCs compared to its linear analogue, linear poly(l-lysine). Furthermore, it demonstrated comparable transgene expression to the widely used vector polyethylenimine using a lower pDNA dose with significantly less cytotoxicity. Overall, this study illustrates the ability of the star-PLL vectors to facilitate efficient, nontoxic nucleic acid delivery to MSCs thereby functioning as an innovative nanomedicine platform for tissue engineering applications.
Barbu, Corentin; Dumonteil, Eric; Gourbière, Sébastien
2010-01-01
Background Chagas disease is a major parasitic disease in Latin America, prevented in part by vector control programs that reduce domestic populations of triatomines. However, the design of control strategies adapted to non-domiciliated vectors, such as Triatoma dimidiata, remains a challenge because it requires an accurate description of their spatio-temporal distributions, and a proper understanding of the underlying dispersal processes. Methodology/Principal Findings We combined extensive spatio-temporal data sets describing house infestation dynamics by T. dimidiata within a village, and spatially explicit population dynamics models in a selection model approach. Several models were implemented to provide theoretical predictions under different hypotheses on the origin of the dispersers and their dispersal characteristics, which we compared with the spatio-temporal pattern of infestation observed in the field. The best models fitted the dynamic of infestation described by a one year time-series, and also predicted with a very good accuracy the infestation process observed during a second replicate one year time-series. The parameterized models gave key insights into the dispersal of these vectors. i) About 55% of the triatomines infesting houses came from the peridomestic habitat, the rest corresponding to immigration from the sylvatic habitat, ii) dispersing triatomines were 5–15 times more attracted by houses than by peridomestic area, and iii) the moving individuals spread on average over rather small distances, typically 40–60 m/15 days. Conclusion/Significance Since these dispersal characteristics are associated with much higher abundance of insects in the periphery of the village, we discuss the possibility that spatially targeted interventions allow for optimizing the efficacy of vector control activities within villages. Such optimization could prove very useful in the context of limited resources devoted to vector control. PMID:20689823
Detection of Invasive Mosquito Vectors Using Environmental DNA (eDNA) from Water Samples
Schneider, Judith; Valentini, Alice; Dejean, Tony; Montarsi, Fabrizio; Taberlet, Pierre
2016-01-01
Repeated introductions and spread of invasive mosquito species (IMS) have been recorded on a large scale these last decades worldwide. In this context, members of the mosquito genus Aedes can present serious risks to public health as they have or may develop vector competence for various viral diseases. While the Tiger mosquito (Aedes albopictus) is a well-known vector for e.g. dengue and chikungunya viruses, the Asian bush mosquito (Ae. j. japonicus) and Ae. koreicus have shown vector competence in the field and the laboratory for a number of viruses including dengue, West Nile fever and Japanese encephalitis. Early detection and identification is therefore crucial for successful eradication or control strategies. Traditional specific identification and monitoring of different and/or cryptic life stages of the invasive Aedes species based on morphological grounds may lead to misidentifications, and are problematic when extensive surveillance is needed. In this study, we developed, tested and applied an environmental DNA (eDNA) approach for the detection of three IMS, based on water samples collected in the field in several European countries. We compared real-time quantitative PCR (qPCR) assays specific for these three species and an eDNA metabarcoding approach with traditional sampling, and discussed the advantages and limitations of these methods. Detection probabilities for eDNA-based approaches were in most of the specific comparisons higher than for traditional survey and the results were congruent between both molecular methods, confirming the reliability and efficiency of alternative eDNA-based techniques for the early and unambiguous detection and surveillance of invasive mosquito vectors. The ease of water sampling procedures in the eDNA approach tested here allows the development of large-scale monitoring and surveillance programs of IMS, especially using citizen science projects. PMID:27626642
Hartman, Zachary C; Appledorn, Daniel M; Amalfitano, Andrea
2008-03-01
Extensively characterized, modified, and employed for a variety of purposes, adenovirus (Ad) vectors are generally regarded as having great potential by many applied virologists who wish to manipulate and use viral biology to achieve beneficial clinical outcomes. Despite widespread functional prominence and utility (i.e., Ad-based clinical trials have begun to progress to critical Phase III levels, it has recently become apparent that investigations regarding the innate immune response to Ads may reveal not only reasons behind previous failures, but also reveal novel insights that will allow for safer, more efficacious uses of this important gene transfer platform. Insights gained by the exploration of Ad induced innate immune responses will likely be most important to the fields of vaccine development, since Ad-based vaccines are regarded as one of the more promising vaccine platforms in development today. Adenovirus is currently known to interact with several different extracellular, intracellular, and membrane-bound innate immune sensing systems. Past and recent studies involving manipulation of the Ad infectious cycle as well as use of different mutants have shed light on some of the initiation mechanisms underlying Ad induced immune responses. More recent studies using microarray-based analyses, genetically modified cell lines and/or mouse mutants, and advanced generation Ad vectors have revealed important new insights into the scope and mechanism of this cellular defensive response. This review is an attempt to synthesize these studies, update Ad biologists to the current knowledge surrounding these increasingly important issues, as well as highlight areas where future research should be directed. It should also serve as a sobering reality to researchers exploring the use of any gene transfer vector, as to the complexities potentially involved when contemplating use of such vectors for human applications.
Euler-Vector Clustering of GPS Velocities Defines Microplate Geometry in Southwest Japan
NASA Astrophysics Data System (ADS)
Savage, J. C.
2018-02-01
I have used Euler-vector clustering to assign 469 GEONET stations in southwest Japan to k clusters (k = 2, 3,..., 9) so that, for any k, the velocities of stations within each cluster are most consistent with rigid-block motion on a sphere. That is, I attempt to explain the raw (i.e., uncorrected for strain accumulation), 1996-2006 velocities of those 469 Global Positioning System stations by rigid motion of k clusters on the surface of a spherical Earth. Because block geometry is maintained as strain accumulates, Euler-vector clustering may better approximate the block geometry than the values of the associated Euler vectors. The microplate solution for each k is constructed by merging contiguous clusters that have closely similar Euler vectors. The best solution consists of three microplates arranged along the Nankaido Trough-Ryukyu Trench between the Amurian and Philippine Sea Plates. One of these microplates, the South Kyushu Microplate (an extension of the Ryukyu forearc into the southeast corner of Kyushu), had previously been identified from paleomagnetic rotations. Relative to ITRF2000 the three microplates rotate at different rates about neighboring poles located close to the northwest corner of Shikoku. The microplate model is identical to that proposed in the block model of Wallace et al. (2009, https://doi.org/10.1130/G2522A.1) except in southernmost Kyushu. On Shikoku and Honshu, but not Kyushu, the microplate model is consistent with that proposed in the block models of Nishimura and Hashimoto (2006, https://doi.org/10.1016/j.tecto.2006.04.017) and Loveless and Meade (2010, https://doi.org/10.1029/2008JB006248) without the low-slip-rate boundaries proposed in the latter.
Detection of Invasive Mosquito Vectors Using Environmental DNA (eDNA) from Water Samples.
Schneider, Judith; Valentini, Alice; Dejean, Tony; Montarsi, Fabrizio; Taberlet, Pierre; Glaizot, Olivier; Fumagalli, Luca
2016-01-01
Repeated introductions and spread of invasive mosquito species (IMS) have been recorded on a large scale these last decades worldwide. In this context, members of the mosquito genus Aedes can present serious risks to public health as they have or may develop vector competence for various viral diseases. While the Tiger mosquito (Aedes albopictus) is a well-known vector for e.g. dengue and chikungunya viruses, the Asian bush mosquito (Ae. j. japonicus) and Ae. koreicus have shown vector competence in the field and the laboratory for a number of viruses including dengue, West Nile fever and Japanese encephalitis. Early detection and identification is therefore crucial for successful eradication or control strategies. Traditional specific identification and monitoring of different and/or cryptic life stages of the invasive Aedes species based on morphological grounds may lead to misidentifications, and are problematic when extensive surveillance is needed. In this study, we developed, tested and applied an environmental DNA (eDNA) approach for the detection of three IMS, based on water samples collected in the field in several European countries. We compared real-time quantitative PCR (qPCR) assays specific for these three species and an eDNA metabarcoding approach with traditional sampling, and discussed the advantages and limitations of these methods. Detection probabilities for eDNA-based approaches were in most of the specific comparisons higher than for traditional survey and the results were congruent between both molecular methods, confirming the reliability and efficiency of alternative eDNA-based techniques for the early and unambiguous detection and surveillance of invasive mosquito vectors. The ease of water sampling procedures in the eDNA approach tested here allows the development of large-scale monitoring and surveillance programs of IMS, especially using citizen science projects.
Hartman, Zachary C.; Appledorn, Daniel M.; Amalfitano, Andrea
2013-01-01
Extensively characterized, modified, and employed for a variety of purposes, Adenovirus (Ad) vectors are generally regarded as having great potential by many applied virologists who wish to manipulate and use viral biology to achieve beneficial clinical outcomes. Despite widespread functional prominence and utility, (i.e.: Ad based clinical trials have begun to progress to critical Phase III levels, it has recently become apparent that investigations regarding the innate immune response to Ads may reveal not only reasons behind previous failures, but also reveal novel insights that will allow for safer, more efficacious uses of this important gene transfer platform. Insights gained by the exploration of Ad induced innate immune responses will likely be most important to the fields of vaccine development, since Ad based vaccines are highly acknowledged as one of the more promising vaccine platforms in development today. Adenovirus is currently known to interact with several different extracellular, intracellular, and membrane bound innate immune sensing systems. Past and recent studies involving manipulation of the Ad infectious cycle as well as use of different mutants have shed light on some of the initiation mechanisms underlying Ad induced immune responses. More recent studies using microarray based analyses, genetically modified cell lines and/or mouse mutants, and advanced generation Ad vectors have revealed important new insights into the scope and mechanism of this cellular defensive response. This review is an attempt to synthesize these studies, update Ad biologists to the current knowledge surrounding these increasingly important issues, as well point areas where future research should be directed. It should also serve as a sobering reality to researchers exploring the use of any gene transfer vector, as to the complexities potentially involved when contemplating use of such vectors for human applications. PMID:18036698
Wan, Shibiao; Mak, Man-Wai; Kung, Sun-Yuan
2014-01-01
Protein subcellular localization prediction, as an essential step to elucidate the functions in vivo of proteins and identify drugs targets, has been extensively studied in previous decades. Instead of only determining subcellular localization of single-label proteins, recent studies have focused on predicting both single- and multi-location proteins. Computational methods based on Gene Ontology (GO) have been demonstrated to be superior to methods based on other features. However, existing GO-based methods focus on the occurrences of GO terms and disregard their relationships. This paper proposes a multi-label subcellular-localization predictor, namely HybridGO-Loc, that leverages not only the GO term occurrences but also the inter-term relationships. This is achieved by hybridizing the GO frequencies of occurrences and the semantic similarity between GO terms. Given a protein, a set of GO terms are retrieved by searching against the gene ontology database, using the accession numbers of homologous proteins obtained via BLAST search as the keys. The frequency of GO occurrences and semantic similarity (SS) between GO terms are used to formulate frequency vectors and semantic similarity vectors, respectively, which are subsequently hybridized to construct fusion vectors. An adaptive-decision based multi-label support vector machine (SVM) classifier is proposed to classify the fusion vectors. Experimental results based on recent benchmark datasets and a new dataset containing novel proteins show that the proposed hybrid-feature predictor significantly outperforms predictors based on individual GO features as well as other state-of-the-art predictors. For readers' convenience, the HybridGO-Loc server, which is for predicting virus or plant proteins, is available online at http://bioinfo.eie.polyu.edu.hk/HybridGoServer/.
An extension of the finite cell method using boolean operations
NASA Astrophysics Data System (ADS)
Abedian, Alireza; Düster, Alexander
2017-05-01
In the finite cell method, the fictitious domain approach is combined with high-order finite elements. The geometry of the problem is taken into account by integrating the finite cell formulation over the physical domain to obtain the corresponding stiffness matrix and load vector. In this contribution, an extension of the FCM is presented wherein both the physical and fictitious domain of an element are simultaneously evaluated during the integration. In the proposed extension of the finite cell method, the contribution of the stiffness matrix over the fictitious domain is subtracted from the cell, resulting in the desired stiffness matrix which reflects the contribution of the physical domain only. This method results in an exponential rate of convergence for porous domain problems with a smooth solution and accurate integration. In addition, it reduces the computational cost, especially when applying adaptive integration schemes based on the quadtree/octree. Based on 2D and 3D problems of linear elastostatics, numerical examples serve to demonstrate the efficiency and accuracy of the proposed method.
Extension and transtension in the plate boundary zone of the northeastern Caribbean
DOE Office of Scientific and Technical Information (OSTI.GOV)
Speed, R.C.; Larue, D.K.
1991-03-01
The authors propose that the Caribbean (Ca)-North American (NA) plate boundary zone (pbz) from the Puerto Rico Trench to the Venezuelan Basin from Mona Canyon east has been in left-transtension over the last 15-20 ma. A boundary-normal component of extension occurs throughout the pbz and is a principal cause of the Puerto Rico Trench. Such extension is due to WNW velocity of NA-Ca and the northward pullaway of NA from its S-dipping slab, which is below Puerto Rico. Strike slip motion may be taken up among terranes in the pbz by rigid CCW rotation and by oblique slip at theirmore » boundaries. Rotation of the largest terrane, Puerto Rico-Virgin Islands (PRVI), has caused such major structures as the Muertos thrust and Anegada Passage. The model implies NA-Ca velocity estimated from Cayman transforms is more accurate than that from slip vectors from seisms in the NA slab.« less
Making the most of cloud storage - a toolkit for exploitation by WLCG experiments
NASA Astrophysics Data System (ADS)
Alvarez Ayllon, Alejandro; Arsuaga Rios, Maria; Bitzes, Georgios; Furano, Fabrizio; Keeble, Oliver; Manzi, Andrea
2017-10-01
Understanding how cloud storage can be effectively used, either standalone or in support of its associated compute, is now an important consideration for WLCG. We report on a suite of extensions to familiar tools targeted at enabling the integration of cloud object stores into traditional grid infrastructures and workflows. Notable updates include support for a number of object store flavours in FTS3, Davix and gfal2, including mitigations for lack of vector reads; the extension of Dynafed to operate as a bridge between grid and cloud domains; protocol translation in FTS3; the implementation of extensions to DPM (also implemented by the dCache project) to allow 3rd party transfers over HTTP. The result is a toolkit which facilitates data movement and access between grid and cloud infrastructures, broadening the range of workflows suitable for cloud. We report on deployment scenarios and prototype experience, explaining how, for example, an Amazon S3 or Azure allocation can be exploited by grid workflows.
Geometric and Topological Methods for Quantum Field Theory
NASA Astrophysics Data System (ADS)
Cardona, Alexander; Contreras, Iván.; Reyes-Lega, Andrés. F.
2013-05-01
Introduction; 1. A brief introduction to Dirac manifolds Henrique Bursztyn; 2. Differential geometry of holomorphic vector bundles on a curve Florent Schaffhauser; 3. Paths towards an extension of Chern-Weil calculus to a class of infinite dimensional vector bundles Sylvie Paycha; 4. Introduction to Feynman integrals Stefan Weinzierl; 5. Iterated integrals in quantum field theory Francis Brown; 6. Geometric issues in quantum field theory and string theory Luis J. Boya; 7. Geometric aspects of the standard model and the mysteries of matter Florian Scheck; 8. Absence of singular continuous spectrum for some geometric Laplacians Leonardo A. Cano García; 9. Models for formal groupoids Iván Contreras; 10. Elliptic PDEs and smoothness of weakly Einstein metrics of Hölder regularity Andrés Vargas; 11. Regularized traces and the index formula for manifolds with boundary Alexander Cardona and César Del Corral; Index.
NASA Technical Reports Server (NTRS)
Minster, J. B.; Jordan, T. H.
1977-01-01
A data set comprising 110 spreading rates, 78 transform fault azimuths and 142 earthquake slip vectors was inverted to yield a new instantaneous plate motion model, designated RM2. The mean averaging interval for the relative motion data was reduced to less than 3 My. A detailed comparison of RM2 with angular velocity vectors which best fit the data along individual plate boundaries indicates that RM2 performs close to optimally in most regions, with several notable exceptions. On the other hand, a previous estimate (RM1) failed to satisfy an extensive set of new data collected in the South Atlantic Ocean. It is shown that RM1 incorrectly predicts the plate kinematics in the South Atlantic because the presently available data are inconsistent with the plate geometry assumed in deriving RM1. It is demonstrated that this inconsistency can be remedied by postulating the existence of internal deformation with the Indian plate, although alternate explanations are possible.
Hawking radiation of a vector field and gravitational anomalies
DOE Office of Scientific and Technical Information (OSTI.GOV)
Murata, Keiju; Miyamoto, Umpei
2007-10-15
Recently, the relation between Hawking radiation and gravitational anomalies has been used to estimate the flux of Hawking radiation for a large class of black objects. In this paper, we extend the formalism, originally proposed by Robinson and Wilczek, to the Hawking radiation of vector particles (photons). It is explicitly shown, with the Hamiltonian formalism, that the theory of an electromagnetic field on d-dimensional spherical black holes reduces to one of an infinite number of massive complex scalar fields on 2-dimensional spacetime, for which the usual anomaly-cancellation method is available. It is found that the total energy emitted from themore » horizon for the electromagnetic field is just (d-2) times that for a scalar field. The results support the picture that Hawking radiation can be regarded as an anomaly eliminator on horizons. Possible extensions and applications of the analysis are discussed.« less
Costs and Cost-Effectiveness of Plasmodium vivax Control.
White, Michael T; Yeung, Shunmay; Patouillard, Edith; Cibulskis, Richard
2016-12-28
The continued success of efforts to reduce the global malaria burden will require sustained funding for interventions specifically targeting Plasmodium vivax The optimal use of limited financial resources necessitates cost and cost-effectiveness analyses of strategies for diagnosing and treating P. vivax and vector control tools. Herein, we review the existing published evidence on the costs and cost-effectiveness of interventions for controlling P. vivax, identifying nine studies focused on diagnosis and treatment and seven studies focused on vector control. Although many of the results from the much more extensive P. falciparum literature can be applied to P. vivax, it is not always possible to extrapolate results from P. falciparum-specific cost-effectiveness analyses. Notably, there is a need for additional studies to evaluate the potential cost-effectiveness of radical cure with primaquine for the prevention of P. vivax relapses with glucose-6-phosphate dehydrogenase testing. © The American Society of Tropical Medicine and Hygiene.
Costs and Cost-Effectiveness of Plasmodium vivax Control
White, Michael T.; Yeung, Shunmay; Patouillard, Edith; Cibulskis, Richard
2016-01-01
The continued success of efforts to reduce the global malaria burden will require sustained funding for interventions specifically targeting Plasmodium vivax. The optimal use of limited financial resources necessitates cost and cost-effectiveness analyses of strategies for diagnosing and treating P. vivax and vector control tools. Herein, we review the existing published evidence on the costs and cost-effectiveness of interventions for controlling P. vivax, identifying nine studies focused on diagnosis and treatment and seven studies focused on vector control. Although many of the results from the much more extensive P. falciparum literature can be applied to P. vivax, it is not always possible to extrapolate results from P. falciparum–specific cost-effectiveness analyses. Notably, there is a need for additional studies to evaluate the potential cost-effectiveness of radical cure with primaquine for the prevention of P. vivax relapses with glucose-6-phosphate dehydrogenase testing. PMID:28025283
Semantically enabled image similarity search
NASA Astrophysics Data System (ADS)
Casterline, May V.; Emerick, Timothy; Sadeghi, Kolia; Gosse, C. A.; Bartlett, Brent; Casey, Jason
2015-05-01
Georeferenced data of various modalities are increasingly available for intelligence and commercial use, however effectively exploiting these sources demands a unified data space capable of capturing the unique contribution of each input. This work presents a suite of software tools for representing geospatial vector data and overhead imagery in a shared high-dimension vector or embedding" space that supports fused learning and similarity search across dissimilar modalities. While the approach is suitable for fusing arbitrary input types, including free text, the present work exploits the obvious but computationally difficult relationship between GIS and overhead imagery. GIS is comprised of temporally-smoothed but information-limited content of a GIS, while overhead imagery provides an information-rich but temporally-limited perspective. This processing framework includes some important extensions of concepts in literature but, more critically, presents a means to accomplish them as a unified framework at scale on commodity cloud architectures.
Detecting double compression of audio signal
NASA Astrophysics Data System (ADS)
Yang, Rui; Shi, Yun Q.; Huang, Jiwu
2010-01-01
MP3 is the most popular audio format nowadays in our daily life, for example music downloaded from the Internet and file saved in the digital recorder are often in MP3 format. However, low bitrate MP3s are often transcoded to high bitrate since high bitrate ones are of high commercial value. Also audio recording in digital recorder can be doctored easily by pervasive audio editing software. This paper presents two methods for the detection of double MP3 compression. The methods are essential for finding out fake-quality MP3 and audio forensics. The proposed methods use support vector machine classifiers with feature vectors formed by the distributions of the first digits of the quantized MDCT (modified discrete cosine transform) coefficients. Extensive experiments demonstrate the effectiveness of the proposed methods. To the best of our knowledge, this piece of work is the first one to detect double compression of audio signal.
Some Quantum Symmetries and Their Breaking II
NASA Astrophysics Data System (ADS)
Selesnick, S. A.
2013-04-01
We consider symmetry breaking in the context of vector bundle theory, which arises quite naturally not only when attempting to "gauge" symmetry groups, but also as a means of localizing those global symmetry breaking effects known as spontaneous. We review such spontaneous symmetry breaking first for a simplified version of the Goldstone scenario for the case of global symmetries, and then in a localized form which is applied to a derivation of some of the phenomena associated with superconduction in both its forms, type I and type II. We then extend these procedures to effect the Higgs mechanism of electroweak theory, and finally we describe an extension to the flavor symmetries of the lightest quarks, including a brief discussion of CP-violation in the neutral kaon system. A largely self-contained primer of vector bundle theory is provided in Sect. 4, which supplies most of the results required thereafter.
Genetic modification of cells for transplantation.
Lai, Yi; Drobinskaya, Irina; Kolossov, Eugen; Chen, Chunguang; Linn, Thomas
2008-01-14
Progress in gene therapy has produced promising results that translate experimental research into clinical treatment. Gene modification has been extensively employed in cell transplantation. The main barrier is an effective gene delivery system. Several viral vectors were utilized in end-stage differentiated cells. Recently, successful applications were described with adenovirus-associated vectors. As an alternative, embryonic stem cell- and stem cell-like systems were established for generation of tissue-specified gene-modified cells. Owing to the feasibility for genetic manipulations and the self-renewing potency of these cells they can be used in a way enabling large-scale in vitro production. This approach offers the establishment of in vitro cell culture systems that will deliver sufficient amounts of highly purified, immunoautologous cells suitable for application in regenerative medicine. In this review, the current technology of gene delivery systems to cells is recapitulated and the latest developments for cell transplantation are discussed.
The airborne laser ranging system, its capabilities and applications
NASA Technical Reports Server (NTRS)
Kahn, W. D.; Degnan, J. J.; Englar, T. S., Jr.
1982-01-01
The airborne laser ranging system is a multibeam short pulse laser ranging system on board an aircraft. It simultaneously measures the distances between the aircraft and six laser retroreflectors (targets) deployed on the Earth's surface. The system can interrogate over 100 targets distributed over an area of 25,000 sq, kilometers in a matter of hours. Potentially, a total of 1.3 million individual range measurements can be made in a six hour flight. The precision of these range measurements is approximately + or - 1 cm. These measurements are used in procedure which is basically an extension of trilateration techniques to derive the intersite vector between the laser ground targets. By repeating the estimation of the intersite vector, strain and strain rate errors can be estimated. These quantities are essential for crustal dynamic studies which include determination and monitoring of regional strain in the vicinity of active fault zones, land subsidence, and edifice building preceding volcanic eruptions.
Hemakom, Apit; Goverdovsky, Valentin; Looney, David; Mandic, Danilo P
2016-04-13
An extension to multivariate empirical mode decomposition (MEMD), termed adaptive-projection intrinsically transformed MEMD (APIT-MEMD), is proposed to cater for power imbalances and inter-channel correlations in real-world multichannel data. It is shown that the APIT-MEMD exhibits similar or better performance than MEMD for a large number of projection vectors, whereas it outperforms MEMD for the critical case of a small number of projection vectors within the sifting algorithm. We also employ the noise-assisted APIT-MEMD within our proposed intrinsic multiscale analysis framework and illustrate the advantages of such an approach in notoriously noise-dominated cooperative brain-computer interface (BCI) based on the steady-state visual evoked potentials and the P300 responses. Finally, we show that for a joint cognitive BCI task, the proposed intrinsic multiscale analysis framework improves system performance in terms of the information transfer rate. © 2016 The Author(s).
ViSBARD: Visual System for Browsing, Analysis and Retrieval of Data
NASA Astrophysics Data System (ADS)
Roberts, D. Aaron; Boller, Ryan; Rezapkin, V.; Coleman, J.; McGuire, R.; Goldstein, M.; Kalb, V.; Kulkarni, R.; Luckyanova, M.; Byrnes, J.; Kerbel, U.; Candey, R.; Holmes, C.; Chimiak, R.; Harris, B.
2018-04-01
ViSBARD interactively visualizes and analyzes space physics data. It provides an interactive integrated 3-D and 2-D environment to determine correlations between measurements across many spacecraft. It supports a variety of spacecraft data products and MHD models and is easily extensible to others. ViSBARD provides a way of visualizing multiple vector and scalar quantities as measured by many spacecraft at once. The data are displayed three-dimesionally along the orbits which may be displayed either as connected lines or as points. The data display allows the rapid determination of vector configurations, correlations between many measurements at multiple points, and global relationships. With the addition of magnetohydrodynamic (MHD) model data, this environment can also be used to validate simulation results with observed data, use simulated data to provide a global context for sparse observed data, and apply feature detection techniques to the simulated data.
Recommended coordinate systems for thin spherocylindrical lenses.
Deal, F C; Toop, J
1993-05-01
Because the set of thin spherocylindrical lenses forms a vector space, any such lens can be expressed in terms of its cartesian coordinates with respect to whatever set of basis lenses we may choose. Two types of cartesian coordinate systems have become prominent, those having coordinates associated with the lens power matrix and those having coordinates associated with the Humphrey Vision Analyzer. This paper emphasizes the value of a particular cartesian coordinate system of the latter type, and the cylindrical coordinate system related to it, by showing how it can simplify the trigonometry of adding lenses and how it preserves symmetry in depicting the sets of all spherical lenses, all Jackson crossed-cylinders, and all cylindrical lenses. It also discusses appropriate coordinates for keeping statistics on lenses and shows that an easy extension of the lens vector space to include general optical systems is not possible.
Ghost imaging with paired x-ray photons
NASA Astrophysics Data System (ADS)
Schori, A.; Borodin, D.; Tamasaku, K.; Shwartz, S.
2018-06-01
We report the experimental observation of ghost imaging with paired x-ray photons, which are generated by parametric downconversion. We use the one-to-one relation between the photon energies and the emission angles and the anticorrelation between the k -vectors of the signal and the idler photons to reconstruct the images of slits with nominally zero background levels. Further extension of our procedure can be used for the observation of various quantum phenomena at x-ray wavelengths.
On the biomechanical analysis of the calories expended in a straight boxing jab.
Zohdi, T I
2017-04-01
Boxing and related sports activities have become a standard workout regime at many fitness studios worldwide. Oftentimes, people are interested in the calories expended during these workouts. This note focuses on determining the calories in a boxer's jab, using kinematic vector-loop relations and basic work-energy principles. Numerical simulations are undertaken to illustrate the basic model. Multi-limb extensions of the model are also discussed. © 2017 The Author(s).
NASA Technical Reports Server (NTRS)
Shuen, Jian-Shun; Liou, Meng-Sing; Van Leer, Bram
1989-01-01
The extension of the known flux-vector and flux-difference splittings to real gases via rigorous mathematical procedures is demonstrated. Formulations of both equilibrium and finite-rate chemistry for real-gas flows are described, with emphasis on derivations of finite-rate chemistry. Split-flux formulas from other authors are examined. A second-order upwind-based TVD scheme is adopted to eliminate oscillations and to obtain a sharp representation of discontinuities.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Benioff, Paul
This paper describes the effects of a complex scalar scaling field on quantum mechanics. The field origin is an extension of the gauge freedom for basis choice in gauge theories to the underlying scalar field. The extension is based on the idea that the value of a number at one space time point does not determine the value at another point. This, combined with the description of mathematical systems as structures of different types, results in the presence of separate number fields and vector spaces as structures, at different space time locations. Complex number structures and vector spaces at eachmore » location are scaled by a complex space time dependent scaling factor. The effect of this scaling factor on several physical and geometric quantities has been described in other work. Here the emphasis is on quantum mechanics of one and two particles, their states and properties. Multiparticle states are also briefly described. The effect shows as a complex, nonunitary, scalar field connection on a fiber bundle description of nonrelativistic quantum mechanics. Here, the lack of physical evidence for the presence of this field so far means that the coupling constant of this field to fermions is very small. It also means that the gradient of the field must be very small in a local region of cosmological space and time. Outside this region, there are no restrictions on the field gradient.« less
Effects of a scalar scaling field on quantum mechanics
Benioff, Paul
2016-04-18
This paper describes the effects of a complex scalar scaling field on quantum mechanics. The field origin is an extension of the gauge freedom for basis choice in gauge theories to the underlying scalar field. The extension is based on the idea that the value of a number at one space time point does not determine the value at another point. This, combined with the description of mathematical systems as structures of different types, results in the presence of separate number fields and vector spaces as structures, at different space time locations. Complex number structures and vector spaces at eachmore » location are scaled by a complex space time dependent scaling factor. The effect of this scaling factor on several physical and geometric quantities has been described in other work. Here the emphasis is on quantum mechanics of one and two particles, their states and properties. Multiparticle states are also briefly described. The effect shows as a complex, nonunitary, scalar field connection on a fiber bundle description of nonrelativistic quantum mechanics. Here, the lack of physical evidence for the presence of this field so far means that the coupling constant of this field to fermions is very small. It also means that the gradient of the field must be very small in a local region of cosmological space and time. Outside this region, there are no restrictions on the field gradient.« less
DOE Office of Scientific and Technical Information (OSTI.GOV)
Haraldsdóttir, Hulda S.; Fleming, Ronan M. T.
Conserved moieties are groups of atoms that remain intact in all reactions of a metabolic network. Identification of conserved moieties gives insight into the structure and function of metabolic networks and facilitates metabolic modelling. All moiety conservation relations can be represented as nonnegative integer vectors in the left null space of the stoichiometric matrix corresponding to a biochemical network. Algorithms exist to compute such vectors based only on reaction stoichiometry but their computational complexity has limited their application to relatively small metabolic networks. Moreover, the vectors returned by existing algorithms do not, in general, represent conservation of a specific moietymore » with a defined atomic structure. Here, we show that identification of conserved moieties requires data on reaction atom mappings in addition to stoichiometry. We present a novel method to identify conserved moieties in metabolic networks by graph theoretical analysis of their underlying atom transition networks. Our method returns the exact group of atoms belonging to each conserved moiety as well as the corresponding vector in the left null space of the stoichiometric matrix. It can be implemented as a pipeline of polynomial time algorithms. Our implementation completes in under five minutes on a metabolic network with more than 4,000 mass balanced reactions. The scalability of the method enables extension of existing applications for moiety conservation relations to genome-scale metabolic networks. Finally, we also give examples of new applications made possible by elucidating the atomic structure of conserved moieties.« less
Deciphering Babesia-Vector Interactions.
Antunes, Sandra; Rosa, Catarina; Couto, Joana; Ferrolho, Joana; Domingos, Ana
2017-01-01
Understanding host-pathogen-tick interactions remains a vitally important issue that might be better understood by basic research focused on each of the dyad interplays. Pathogens gain access to either the vector or host during tick feeding when ticks are confronted with strong hemostatic, inflammatory and immune responses. A prominent example of this is the Babesia spp.-tick-vertebrate host relationship. Babesia spp. are intraerythrocytic apicomplexan organisms spread worldwide, with a complex life cycle. The presence of transovarial transmission in almost all the Babesia species is the main difference between their life cycle and that of other piroplasmida. With more than 100 species described so far, Babesia are the second most commonly found blood parasite of mammals after trypanosomes. The prevalence of Babesia spp. infection is increasing worldwide and is currently classified as an emerging zoonosis. Babesia microti and Babesia divergens are the most frequent etiological agents associated with human babesiosis in North America and Europe, respectively. Although the Babesia -tick system has been extensively researched, the currently available prophylactic and control methods are not efficient, and chemotherapeutic treatment is limited. Studying the molecular changes induced by the presence of Babesia in the vector will not only elucidate the strategies used by the protozoa to overcome mechanical and immune barriers, but will also contribute toward the discovery of important tick molecules that have a role in vector capacity. This review provides an overview of the identified molecules involved in Babesia -tick interactions, with an emphasis on the fundamentally important ones for pathogen acquisition and transmission.
Deciphering Babesia-Vector Interactions
Antunes, Sandra; Rosa, Catarina; Couto, Joana; Ferrolho, Joana; Domingos, Ana
2017-01-01
Understanding host-pathogen-tick interactions remains a vitally important issue that might be better understood by basic research focused on each of the dyad interplays. Pathogens gain access to either the vector or host during tick feeding when ticks are confronted with strong hemostatic, inflammatory and immune responses. A prominent example of this is the Babesia spp.—tick—vertebrate host relationship. Babesia spp. are intraerythrocytic apicomplexan organisms spread worldwide, with a complex life cycle. The presence of transovarial transmission in almost all the Babesia species is the main difference between their life cycle and that of other piroplasmida. With more than 100 species described so far, Babesia are the second most commonly found blood parasite of mammals after trypanosomes. The prevalence of Babesia spp. infection is increasing worldwide and is currently classified as an emerging zoonosis. Babesia microti and Babesia divergens are the most frequent etiological agents associated with human babesiosis in North America and Europe, respectively. Although the Babesia-tick system has been extensively researched, the currently available prophylactic and control methods are not efficient, and chemotherapeutic treatment is limited. Studying the molecular changes induced by the presence of Babesia in the vector will not only elucidate the strategies used by the protozoa to overcome mechanical and immune barriers, but will also contribute toward the discovery of important tick molecules that have a role in vector capacity. This review provides an overview of the identified molecules involved in Babesia-tick interactions, with an emphasis on the fundamentally important ones for pathogen acquisition and transmission. PMID:29034218
Haraldsdóttir, Hulda S.; Fleming, Ronan M. T.
2016-01-01
Conserved moieties are groups of atoms that remain intact in all reactions of a metabolic network. Identification of conserved moieties gives insight into the structure and function of metabolic networks and facilitates metabolic modelling. All moiety conservation relations can be represented as nonnegative integer vectors in the left null space of the stoichiometric matrix corresponding to a biochemical network. Algorithms exist to compute such vectors based only on reaction stoichiometry but their computational complexity has limited their application to relatively small metabolic networks. Moreover, the vectors returned by existing algorithms do not, in general, represent conservation of a specific moiety with a defined atomic structure. Here, we show that identification of conserved moieties requires data on reaction atom mappings in addition to stoichiometry. We present a novel method to identify conserved moieties in metabolic networks by graph theoretical analysis of their underlying atom transition networks. Our method returns the exact group of atoms belonging to each conserved moiety as well as the corresponding vector in the left null space of the stoichiometric matrix. It can be implemented as a pipeline of polynomial time algorithms. Our implementation completes in under five minutes on a metabolic network with more than 4,000 mass balanced reactions. The scalability of the method enables extension of existing applications for moiety conservation relations to genome-scale metabolic networks. We also give examples of new applications made possible by elucidating the atomic structure of conserved moieties. PMID:27870845
Rational approximations from power series of vector-valued meromorphic functions
NASA Technical Reports Server (NTRS)
Sidi, Avram
1992-01-01
Let F(z) be a vector-valued function, F: C yields C(sup N), which is analytic at z = 0 and meromorphic in a neighborhood of z = 0, and let its Maclaurin series be given. In this work we developed vector-valued rational approximation procedures for F(z) by applying vector extrapolation methods to the sequence of partial sums of its Maclaurin series. We analyzed some of the algebraic and analytic properties of the rational approximations thus obtained, and showed that they were akin to Pade approximations. In particular, we proved a Koenig type theorem concerning their poles and a de Montessus type theorem concerning their uniform convergence. We showed how optical approximations to multiple poles and to Laurent expansions about these poles can be constructed. Extensions of the procedures above and the accompanying theoretical results to functions defined in arbitrary linear spaces was also considered. One of the most interesting and immediate applications of the results of this work is to the matrix eigenvalue problem. In a forthcoming paper we exploited the developments of the present work to devise bona fide generalizations of the classical power method that are especially suitable for very large and sparse matrices. These generalizations can be used to approximate simultaneously several of the largest distinct eigenvalues and corresponding eigenvectors and invariant subspaces of arbitrary matrices which may or may not be diagonalizable, and are very closely related with known Krylov subspace methods.
Cloning-independent plasmid construction for genetic studies in streptococci
Xie, Zhoujie; Qi, Fengxia; Merritt, Justin
2013-01-01
Shuttle plasmids are among the few routinely utilized tools in the Streptococcus mutans genetic system that still require the use of classical cloning methodologies and intermediate hosts for genetic manipulation. Accordingly, it typically requires considerably less time and effort to introduce mutations onto the S. mutans chromosome than it does to construct shuttle vectors for expressing genes in trans. Occasionally, shuttle vector constructs also exhibit toxicity in E. coli, which prevents their proper assembly. To circumvent these limitations, we modified a prolonged overlap extension PCR (POE-PCR) protocol to facilitate direct plasmid assembly in S. mutans. Using solely PCR, we created the reporter vector pZX7, which contains a single minimal streptococcal replication origin and harbors a spectinomycin resistance cassette and the gusA gene encoding β-glucuronidase. We compared the efficiency of pZX7 assembly using multiple strains of S. mutans and were able to obtain from 5×103 – 2×105 CFU/μg PCR product. Likewise, we used pZX7 to further demonstrate that Streptococcus sanguinis and Streptococcus gordonii are also excellent hosts for cloning-independent plasmid assembly, which suggests that this system is likely to function in numerous other streptococci. Consequently, it should be possible to completely forgo the use of E. coli – Streptococcus shuttle vectors in many streptococcal species, thereby decreasing the time and effort required to assemble constructs and eliminating any toxicity issues associated with intermediate hosts. PMID:23673081
Cloning-independent plasmid construction for genetic studies in streptococci.
Xie, Zhoujie; Qi, Fengxia; Merritt, Justin
2013-08-01
Shuttle plasmids are among the few routinely utilized tools in the Streptococcus mutans genetic system that still require the use of classical cloning methodologies and intermediate hosts for genetic manipulation. Accordingly, it typically requires considerably less time and effort to introduce mutations onto the S. mutans chromosome than it does to construct shuttle vectors for expressing genes in trans. Occasionally, shuttle vector constructs also exhibit toxicity in Escherichia coli, which prevents their proper assembly. To circumvent these limitations, we modified a prolonged overlap extension PCR (POE-PCR) protocol to facilitate direct plasmid assembly in S. mutans. Using solely PCR, we created the reporter vector pZX7, which contains a single minimal streptococcal replication origin and harbors a spectinomycin resistance cassette and the gusA gene encoding β-glucuronidase. We compared the efficiency of pZX7 assembly using multiple strains of S. mutans and were able to obtain from 5 × 10³ to 2 × 10⁵ CFU/μg PCR product. Likewise, we used pZX7 to further demonstrate that Streptococcus sanguinis and Streptococcus gordonii are also excellent hosts for cloning-independent plasmid assembly, which suggests that this system is likely to function in numerous other streptococci. Consequently, it should be possible to completely forgo the use of E. coli-Streptococcus shuttle vectors in many streptococcal species, thereby decreasing the time and effort required to assemble constructs and eliminating any toxicity issues associated with intermediate hosts. Copyright © 2013 Elsevier B.V. All rights reserved.
Mulamba, Charles; Riveron, Jacob M.; Ibrahim, Sulaiman S.; Irving, Helen; Barnes, Kayla G.; Mukwaya, Louis G.; Birungi, Josephine; Wondji, Charles S.
2014-01-01
Background Establishing the extent, geographical distribution and mechanisms of insecticide resistance in malaria vectors is a prerequisite for resistance management. Here, we report a widespread distribution of insecticide resistance in the major malaria vector An. funestus across Uganda and western Kenya under the control of metabolic resistance mechanisms. Methodology/Principal Findings Female An. funestus collected throughout Uganda and western Kenya exhibited a Plasmodium infection rate between 4.2 to 10.4%. Widespread resistance against both type I (permethrin) and II (deltamethrin) pyrethroids and DDT was observed across Uganda and western Kenya. All populations remain highly susceptible to carbamate, organophosphate and dieldrin insecticides. Knockdown resistance plays no role in the pyrethroid and DDT resistance as no kdr mutation associated with resistance was detected despite the presence of a F1021C replacement. Additionally, no signature of selection was observed on the sodium channel gene. Synergist assays and qRT-PCR indicated that metabolic resistance plays a major role notably through elevated expression of cytochrome P450s. DDT resistance mechanisms differ from West Africa as the L119F-GSTe2 mutation only explains a small proportion of the genetic variance to DDT resistance. Conclusion The extensive distribution of pyrethroid and DDT resistance in East African An. funestus populations represents a challenge to the control of this vector. However, the observed carbamate and organophosphate susceptibility offers alternative solutions for resistance management. PMID:25333491
Image velocimetry for clouds with relaxation labeling based on deformation consistency
NASA Astrophysics Data System (ADS)
Horinouchi, Takeshi; Murakami, Shin-ya; Kouyama, Toru; Ogohara, Kazunori; Yamazaki, Atsushi; Yamada, Manabu; Watanabe, Shigeto
2017-08-01
Correlation-based cloud tracking has been extensively used to measure atmospheric winds, but still difficulty remains. In this study, aiming at developing a cloud tracking system for Akatsuki, an artificial satellite orbiting Venus, a formulation is developed for improving the relaxation labeling technique to select appropriate peaks of cross-correlation surfaces which tend to have multiple peaks. The formulation makes an explicit use of consistency inherent in the type of cross-correlation method where template sub-images are slid without deformation; if the resultant motion vectors indicate a too-large deformation, it is contradictory to the assumption of the method. The deformation consistency is exploited further to develop two post processes; one clusters the motion vectors into groups within each of which the consistency is perfect, and the other extends the groups using the original candidate lists. These processes are useful to eliminate erroneous vectors, distinguish motion vectors at different altitudes, and detect phase velocities of waves in fluids such as atmospheric gravity waves. As a basis of the relaxation labeling and the post processes as well as uncertainty estimation, the necessity to find isolated (well-separated) peaks of cross-correlation surfaces is argued, and an algorithm to realize it is presented. All the methods are implemented, and their effectiveness is demonstrated with initial images obtained by the ultraviolet imager onboard Akatsuki. Since the deformation consistency regards the logical consistency inherent in template matching methods, it should have broad application beyond cloud tracking.
Haraldsdóttir, Hulda S.; Fleming, Ronan M. T.
2016-11-21
Conserved moieties are groups of atoms that remain intact in all reactions of a metabolic network. Identification of conserved moieties gives insight into the structure and function of metabolic networks and facilitates metabolic modelling. All moiety conservation relations can be represented as nonnegative integer vectors in the left null space of the stoichiometric matrix corresponding to a biochemical network. Algorithms exist to compute such vectors based only on reaction stoichiometry but their computational complexity has limited their application to relatively small metabolic networks. Moreover, the vectors returned by existing algorithms do not, in general, represent conservation of a specific moietymore » with a defined atomic structure. Here, we show that identification of conserved moieties requires data on reaction atom mappings in addition to stoichiometry. We present a novel method to identify conserved moieties in metabolic networks by graph theoretical analysis of their underlying atom transition networks. Our method returns the exact group of atoms belonging to each conserved moiety as well as the corresponding vector in the left null space of the stoichiometric matrix. It can be implemented as a pipeline of polynomial time algorithms. Our implementation completes in under five minutes on a metabolic network with more than 4,000 mass balanced reactions. The scalability of the method enables extension of existing applications for moiety conservation relations to genome-scale metabolic networks. Finally, we also give examples of new applications made possible by elucidating the atomic structure of conserved moieties.« less
Haraldsdóttir, Hulda S; Fleming, Ronan M T
2016-11-01
Conserved moieties are groups of atoms that remain intact in all reactions of a metabolic network. Identification of conserved moieties gives insight into the structure and function of metabolic networks and facilitates metabolic modelling. All moiety conservation relations can be represented as nonnegative integer vectors in the left null space of the stoichiometric matrix corresponding to a biochemical network. Algorithms exist to compute such vectors based only on reaction stoichiometry but their computational complexity has limited their application to relatively small metabolic networks. Moreover, the vectors returned by existing algorithms do not, in general, represent conservation of a specific moiety with a defined atomic structure. Here, we show that identification of conserved moieties requires data on reaction atom mappings in addition to stoichiometry. We present a novel method to identify conserved moieties in metabolic networks by graph theoretical analysis of their underlying atom transition networks. Our method returns the exact group of atoms belonging to each conserved moiety as well as the corresponding vector in the left null space of the stoichiometric matrix. It can be implemented as a pipeline of polynomial time algorithms. Our implementation completes in under five minutes on a metabolic network with more than 4,000 mass balanced reactions. The scalability of the method enables extension of existing applications for moiety conservation relations to genome-scale metabolic networks. We also give examples of new applications made possible by elucidating the atomic structure of conserved moieties.
Establishment of Aedes albopictus (Diptera: Culicidae) in the Florida Keys, 2001-2017.
Murray, Heidi L; Pruszynski, Catherine A; Leal, Andrea L; Hribar, Lawrence J
2018-06-23
The presence of Aedes albopictus (Skuse) was first reported in the Florida Keys in 1993. Despite extensive surveillance, the Florida Keys Mosquito Control District (FKMCD) only collected specimens occasionally on a few islands, some years finding no evidence of the invasive species. In 2013-2017, FKMCD witnessed a sudden increase in population size and geographic extent of Ae. albopictus. Samples of Ae. albopictus have now been identified on 30 different islands in the Florida Keys. Three islands in particular (Key Largo, Big Pine Key, and Stock Island) have produced multiple positive samples during at least 4 of the last 5 yr, suggesting establishment of the invasive species. FKMCD continues to monitor Ae. albopictus throughout the Keys and make extensive efforts to reduce population abundance and geographic extent of this disease vector.
Synthetic lipoprotein as nano-material vehicle in the targeted drug delivery.
Zhang, Xueqin; Huang, Gangliang
2017-12-01
High-density lipoprotein (HDL) and low-density lipoprotein (LDL), as human endogenous lipoprotein particles, have low toxicity, high selectivity, and good safety. They can avoid the recognition and clearance of human reticuloendothelial system. These synthetic lipoproteins (sLPs) have been attracted extensive attention as the nanovectors for tumor-targeted drug and gene delivery. Herein, recent advances in the field of anticancer based on these two lipid proteins and recombinant lipoproteins (rLPs) as target delivery vectors were analyzed and discussed.
1993-08-27
rever"_? if necessary and identify by block number) FIELD SUB- GROUP Electromagnetic wave scattering, radiation boundary -. ... conditions, finite...international engineering electromagnetics symposia and in related journals has risen from a level of less than 10 per year (published primarily by my group ) to...Rzpoxs and Non -Refereed Papers: 3, as follows- I. D. S. Katz, A. Taflove, J. P. Brooks and E. Harrigan, "Large-scale methods in computational
2008-04-16
Zhen (Edward) Hu Peng (Peter) Zhang Yu Song Amanpreet Singh Saini Corey Cooke April 16, 2006 Department of Electrical and Computer Engineering Center...and RF frequency agility is the most challenging issue for spectrum sensing. The radio under development is an ultra-wideband software -defined radio...PC USB programming cable and accom- panying PC software as well as download test vectors to the waveform memory module, as shown in Figure 3.25,3I
Measurement of the Michel rho parameter in direct muon decay
DOE Office of Scientific and Technical Information (OSTI.GOV)
Piilonen, Leo; Haim, D.; Zhang, Y.
1997-05-01
We report on the status of LAMPF experiment E-1240 to measure the Michel {rho} parameter in direct muon decay. This experiment ran in 1993, and the data are currently being analyzed. The expected precision on the {rho} parameter is {plus_minus}0.0008. This result will provide better constraints on new physics, particularly on the charged vector bosons{close_quote} mixing angle {zeta} in the manifestly left-right symmetric extension of the Standard Model. {copyright} {ital 1997 American Institute of Physics.}
Poly(amidoamine) (PAMAM) dendrimers: from biomimicry to drug delivery and biomedical applications.
Esfand, R; Tomalia, D A.
2001-04-01
Poly(amidoamine) (PAMAM) dendrimers are the first complete dendrimer family to be synthesized, characterized and commercialized. Based on this extensive activity, they are recognized as a unique new class of synthetic nanostructures. Dendrimers allow the precise control of size, shape and placement of functional groups that is desirable for many life science applications. From this perspective, this review focuses on crucial properties of biomimetic dendrimers that will broaden the potential for their use as macromolecular vectors in novel drug delivery and biomedical applications.
2009-01-16
i0ii ••• xNx ] T (5.11) Construct channel matrix H(NX+I)X(NP+I)’ where (•)<, denotes the entry in the i-th row and j-th column of the matrix or vector...should be minimized. The entries in x outside integration window constitute x/ as, X; = [ar0 • • E/Vjo-l xN,n+N,+l • • • xNx ] T (5.22) and the