Science.gov

Sample records for detector alignment algorithm

  1. Alignment of the ATLAS inner detector tracking system

    NASA Astrophysics Data System (ADS)

    Kollár, Daniel; ATLAS Collaboration

    2010-04-01

    The Large Hadron Collider (LHC) at CERN is the world's largest particle accelerator. ATLAS is one of the two general purpose experiments. The inner tracking system of ATLAS, the Inner Detector, is built on two technologies: silicon detectors and drift tube based detectors. The required precision for the alignment of the most sensitive coordinates of the Silicon sensors is just a few microns. Therefore the alignment of the ATLAS Inner Detector is performed using complex algorithms requiring extensive CPU and memory usage. The proposed alignment algorithms were exercised on several applications. This proceedings present the outline of the alignment approach and results from Cosmic Ray runs and large scale computing simulation of physics samples mimicking the ATLAS operation during real data-taking. The full alignment chain was tested using these samples and alignment constants were produced and validated within 24 hours. Early alignment of the ATLAS Inner Detector is provided even before the LHC start up by analysing Cosmic Ray data.

  2. Internal Alignment of the SLD Vertex Detector

    SciTech Connect

    Jackson, D.J.; Wickens, F.J.; Su, D.; /SLAC

    2007-12-03

    The tracking resolution and vertex finding capabilities of the SLD experiment depended upon a precise knowledge of the location and orientation of the elements of the SLD pixel vertex detector (VXD3) in 3D space. At the heart of the procedure described here to align the 96 CCDs is the matrix inversion technique of singular value decomposition (SVD). This tool was employed to unfold the detector geometry corrections from the track data in the VXD3. The algorithm was adapted to perform an optimal {chi}{sup 2} minimization by careful treatment of the track hit residual measurement errors. The tracking resolution obtained with the aligned geometry achieved the design performance. Comments are given on how this method could be used for other trackers.

  3. Alignment of the ATLAS inner detector tracking system

    NASA Astrophysics Data System (ADS)

    Moles-Valls, Regina

    2010-05-01

    The CERN's Large Hadron Collider (LHC) is the world largest particle accelerator. ATLAS (A Toroidal LHC ApparatuS) is one of the two general purpose experiments equipped with a charged particle tracking system built on two technologies: silicon and drift tube based detectors, composing the ATLAS Inner Detector (ID). The alignment of the tracking system poses a challenge as one should solve a linear equation with almost 36 000 degrees of freedom. The required precision for the alignment of the most sensitive coordinates of the silicon sensors is just few microns. This limit comes from the requirement that the misalignment should not worsen the resolution of the track parameter measurements by more than 20%. Therefore the alignment of the ATLAS ID requires complex algorithms with extensive CPU and memory usage. So far the proposed alignment algorithms are exercised on several applications. We will present the outline of the alignment approach and results from Cosmic Ray runs and large scale computing simulation of physics samples mimicking the ATLAS operation during real data taking. For the later application the trigger of the experiment is simulated and the event filter is applied in order to produce an alignment input data stream. The full alignment chain is tested using that stream and alignment constants are produced and validated within 24 h. Cosmic ray data serves to produce an early alignment of the real ATLAS Inner Detector even before the LHC start up. Beyond all tracking information, the assembly survey database contains essential information in order to determine the relative position of one module with respect to its neighbors. Finally a hardware system measuring an array of grid lines in the modules support structure with a Frequency Scan Interferometer monitors short time system deformations.

  4. Alignment of the Fermilab D0 Detector

    SciTech Connect

    Babatunde O'Sheg Oshinowo

    2001-07-20

    The Fermilab D0 detector was used for the discovery of the top quark during Run I in 1996. It is currently being upgraded to exploit the physics potential to be presented by the Main Injector and the Tevatron Collider during Run II in the Fall of 2000. Some of the essential elements of this upgrade is the upgrade of the Solenoid Magnet, the Central Fiber Tracker, the Preshower Detectors, the Calorimeter System, and the Muon System. This paper discusses the survey and alignment of the these detectors with emphasis on the Muon detector system. The alignment accuracy is specified as better than 0.5mm. A combination of the Laser Tracker, BETS, and V-STARS systems are used for the survey.

  5. Alignment algorithms for planar optical waveguides

    NASA Astrophysics Data System (ADS)

    Zheng, Yu; Duan, Ji-an

    2012-10-01

    Planar optical waveguides are the key elements in a modern, high-speed optical network. An important problem facing the optical fiber communication system is optical-axis alignment and coupling between waveguide chips and transmission fibers. The advantages and disadvantages of the various algorithms used for the optical-axis alignment, namely, hill-climbing, pattern search, and genetic algorithm are analyzed. A new optical-axis alignment for planar optical waveguides is presented which is a composite of a genetic algorithm and a pattern search algorithm. Experiments have proved the proposed alignment's feasibility; compared with hill climbing, the search process can reduce the number of movements by 88% and reduce the search time by 83%. Moreover, the search success rate in the experiment can reach 100%.

  6. Alignment algorithm for homology modeling and threading.

    PubMed Central

    Alexandrov, N. N.; Luethy, R.

    1998-01-01

    A DNA/protein sequence comparison is a popular computational tool for molecular biologists. Finding a good alignment implies an evolutionary and/or functional relationship between proteins or genomic loci. Sequential similarity between two proteins indicates their structural resemblance, providing a practical approach for structural modeling, when structure of one of these proteins is known. The first step in the homology modeling is a construction of an accurate sequence alignment. The commonly used alignment algorithms do not provide an adequate treatment of the structurally mismatched residues in locally dissimilar regions. We propose a simple modification of the existing alignment algorithm which treats these regions properly and demonstrate how this modification improves sequence alignments in real proteins. PMID:9521100

  7. An algorithm for linear metabolic pathway alignment.

    PubMed

    Chen, Ming; Hofestaedt, Ralf

    2005-01-01

    Metabolic pathway alignment represents one of the most powerful tools for comparative analysis of metabolism. It involves recognition of metabolites common to a set of functionally-related metabolic pathways, interpretation of biological evolution processes and determination of alternative metabolic pathways. Moreover, it is of assistance in function prediction and metabolism modeling. Although research on genomic sequence alignment is extensive, the problem of aligning metabolic pathways has received less attention. We are motivated to develop an algorithm of metabolic pathway alignment to reveal the similarities between metabolic pathways. A new definition of the metabolic pathway is introduced. The algorithm has been implemented into the PathAligner system; its web-based interface is available at http://bibiserv.techfak.uni-bielefeld.de/pathaligner/.

  8. New Attitude Sensor Alignment Calibration Algorithms

    NASA Technical Reports Server (NTRS)

    Hashmall, Joseph A.; Sedlak, Joseph E.; Harman, Richard (Technical Monitor)

    2002-01-01

    Accurate spacecraft attitudes may only be obtained if the primary attitude sensors are well calibrated. Launch shock, relaxation of gravitational stresses and similar effects often produce large enough alignment shifts so that on-orbit alignment calibration is necessary if attitude accuracy requirements are to be met. A variety of attitude sensor alignment algorithms have been developed to meet the need for on-orbit calibration. Two new algorithms are presented here: ALICAL and ALIQUEST. Each of these has advantages in particular circumstances. ALICAL is an attitude independent algorithm that uses near simultaneous measurements from two or more sensors to produce accurate sensor alignments. For each set of simultaneous observations the attitude is overdetermined. The information content of the extra degrees of freedom can be combined over numerous sets to provide the sensor alignments. ALIQUEST is an attitude dependent algorithm that combines sensor and attitude data into a loss function that has the same mathematical form as the Wahba problem. Alignments can then be determined using any of the algorithms (such as the QUEST quaternion estimator) that have been developed to solve the Wahba problem for attitude. Results from the use of these methods on active missions are presented.

  9. Algorithms for Automatic Alignment of Arrays

    NASA Technical Reports Server (NTRS)

    Chatterjee, Siddhartha; Gilbert, John R.; Oliker, Leonid; Schreiber, Robert; Sheffler, Thomas J.

    1996-01-01

    Aggregate data objects (such as arrays) are distributed across the processor memories when compiling a data-parallel language for a distributed-memory machine. The mapping determines the amount of communication needed to bring operands of parallel operations into alignment with each other. A common approach is to break the mapping into two stages: an alignment that maps all the objects to an abstract template, followed by a distribution that maps the template to the processors. This paper describes algorithms for solving the various facets of the alignment problem: axis and stride alignment, static and mobile offset alignment, and replication labeling. We show that optimal axis and stride alignment is NP-complete for general program graphs, and give a heuristic method that can explore the space of possible solutions in a number of ways. We show that some of these strategies can give better solutions than a simple greedy approach proposed earlier. We also show how local graph contractions can reduce the size of the problem significantly without changing the best solution. This allows more complex and effective heuristics to be used. We show how to model the static offset alignment problem using linear programming, and we show that loop-dependent mobile offset alignment is sometimes necessary for optimum performance. We describe an algorithm with for determining mobile alignments for objects within do loops. We also identify situations in which replicated alignment is either required by the program itself or can be used to improve performance. We describe an algorithm based on network flow that replicates objects so as to minimize the total amount of broadcast communication in replication.

  10. Two Hybrid Algorithms for Multiple Sequence Alignment

    NASA Astrophysics Data System (ADS)

    Naznin, Farhana; Sarker, Ruhul; Essam, Daryl

    2010-01-01

    In order to design life saving drugs, such as cancer drugs, the design of Protein or DNA structures has to be accurate. These structures depend on Multiple Sequence Alignment (MSA). MSA is used to find the accurate structure of Protein and DNA sequences from existing approximately correct sequences. To overcome the overly greedy nature of the well known global progressive alignment method for multiple sequence alignment, we have proposed two different algorithms in this paper; one is using an iterative approach with a progressive alignment method (PAMIM) and the second one is using a genetic algorithm with a progressive alignment method (PAMGA). Both of our methods started with a "kmer" distance table to generate single guide-tree. In the iterative approach, we have introduced two new techniques: the first technique is to generate Guide-trees with randomly selected sequences and the second is of shuffling the sequences inside that tree. The output of the tree is a multiple sequence alignment which has been evaluated by the Sum of Pairs Method (SPM) considering the real value data from PAM250. In our second GA approach, these two techniques are used to generate an initial population and also two different approaches of genetic operators are implemented in crossovers and mutation. To test the performance of our two algorithms, we have compared these with the existing well known methods: T-Coffee, MUSCEL, MAFFT and Probcon, using BAliBase benchmarks. The experimental results show that the first algorithm works well for some situations, where other existing methods face difficulties in obtaining better solutions. The proposed second method works well compared to the existing methods for all situations and it shows better performance over the first one.

  11. Comparison of Beam-Based Alignment Algorithms for the ILC

    SciTech Connect

    Smith, J.C.; Gibbons, L.; Patterson, J.R.; Rubin, D.L.; Sagan, D.; Tenenbaum, P.; /SLAC

    2006-03-15

    The main linac of the International Linear Collider (ILC) requires more sophisticated alignment techniques than those provided by survey alone. Various Beam-Based Alignment (BBA) algorithms have been proposed to achieve the desired low emittance preservation. Dispersion Free Steering, Ballistic Alignment and the Kubo method are compared. Alignment algorithms are also tested in the presence of an Earth-like stray field.

  12. DETECTORS AND EXPERIMENTAL METHODS: Software alignment of the BESIII main drift chamber using the Kalman Filter method

    NASA Astrophysics Data System (ADS)

    Wang, Ji-Ke; Mao, Ze-Pu; Bian, Jian-Ming; Cao, Guo-Fu; Cao, Xue-Xiang; Chen, Shen-Jian; Deng, Zi-Yan; Fu, Cheng-Dong; Gao, Yuan-Ning; He, Kang-Lin; He, Miao; Hua, Chun-Fei; Huang, Bin; Huang, Xing-Tao; Ji, Xiao-Bin; Li, Fei; Li, Hai-Bo; Li, Wei-Dong; Liang, Yu-Tie; Liu, Chun-Xiu; Liu, Huai-Min; Liu, Suo; Liu, Ying-Jie; Ma, Qiu-Mei; Ma, Xiang; Mao, Ya-Jun; Mo, Xiao-Hu; Pan, Ming-Hua; Pang, Cai-Ying; Ping, Rong-Gang; Qin, Ya-Hong; Qiu, Jin-Fa; Sun, Sheng-Sen; Sun, Yong-Zhao; Wang, Liang-Liang; Wen, Shuo-Pin; Wu, Ling-Hui; Xie, Yu-Guang; Xu, Min; Yan, Liang; You, Zheng-Yun; Yuan, Chang-Zheng; Yuan, Ye; Zhang, Bing-Yun; Zhang, Chang-Chun; Zhang, Jian-Yong; Zhang, Xue-Yao; Zhang, Yao; Zheng, Yang-Heng; Zhu, Ke-Jun; Zhu, Yong-Sheng; Zhu, Zhi-Li; Zou, Jia-Heng

    2009-03-01

    Software alignment is quite important for a tracking detector to reach its ultimate position accuracy and momentum resolution. We developed a new alignment algorithm for the BESIII Main Drift Chamber using the Kalman Filter method. Two different types of data which are helix tracks and straight tracks are used to test this algorithm, and the results show that the design and implementation is successful.

  13. An Improved Inertial Frame Alignment Algorithm Based on Horizontal Alignment Information for Marine SINS.

    PubMed

    Che, Yanting; Wang, Qiuying; Gao, Wei; Yu, Fei

    2015-01-01

    In this paper, an improved inertial frame alignment algorithm for a marine SINS under mooring conditions is proposed, which significantly improves accuracy. Since the horizontal alignment is easy to complete, and a characteristic of gravity is that its component in the horizontal plane is zero, we use a clever method to improve the conventional inertial alignment algorithm. Firstly, a large misalignment angle model and a dimensionality reduction Gauss-Hermite filter are employed to establish the fine horizontal reference frame. Based on this, the projection of the gravity in the body inertial coordinate frame can be calculated easily. Then, the initial alignment algorithm is accomplished through an inertial frame alignment algorithm. The simulation and experiment results show that the improved initial alignment algorithm performs better than the conventional inertial alignment algorithm, and meets the accuracy requirements of a medium-accuracy marine SINS.

  14. An Improved Inertial Frame Alignment Algorithm Based on Horizontal Alignment Information for Marine SINS

    PubMed Central

    Che, Yanting; Wang, Qiuying; Gao, Wei; Yu, Fei

    2015-01-01

    In this paper, an improved inertial frame alignment algorithm for a marine SINS under mooring conditions is proposed, which significantly improves accuracy. Since the horizontal alignment is easy to complete, and a characteristic of gravity is that its component in the horizontal plane is zero, we use a clever method to improve the conventional inertial alignment algorithm. Firstly, a large misalignment angle model and a dimensionality reduction Gauss-Hermite filter are employed to establish the fine horizontal reference frame. Based on this, the projection of the gravity in the body inertial coordinate frame can be calculated easily. Then, the initial alignment algorithm is accomplished through an inertial frame alignment algorithm. The simulation and experiment results show that the improved initial alignment algorithm performs better than the conventional inertial alignment algorithm, and meets the accuracy requirements of a medium-accuracy marine SINS. PMID:26445048

  15. Monitoring of absolute mirror alignment at COMPASS RICH-1 detector

    NASA Astrophysics Data System (ADS)

    Alexeev, M.; Birsa, R.; Bradamante, F.; Bressan, A.; Chiosso, M.; Ciliberti, P.; Dalla Torre, S.; Denisov, O.; Duic, V.; Ferrero, A.; Finger, M.; Finger, M.; Gayde, J. Ch.; Giorgi, M.; Gobbo, B.; Levorato, S.; Maggiora, A.; Martin, A.; Menon, G.; Panzieri, D.; Pesaro, G.; Polak, J.; Rocco, E.; Sbrizzai, G.; Schiavon, P.; Slunecka, M.; Sozzi, F.; Steiger, L.; Sulc, M.; Takekawa, S.; Tessarotto, F.

    2014-12-01

    The gaseous COMPASS RICH-1 detector uses two spherical mirror surfaces, segmented into 116 individual mirrors, to focus the Cherenkov photons onto the detector plane. Any mirror misalignment directly affects the detector resolution. The on-line Continuous Line Alignment and Monitoring (CLAM) photogrammetry-based method has been implemented to measure the alignment of individual mirrors which can be characterized by the center of curvature. The mirror wall reflects a regular grid of retroreflective strips placed inside the detector vessel. Then, the position of each mirror is determined from the image of the grid reflection. The images are collected by four cameras. Any small mirror misalignment results in changes of the grid lines' positions in the image. The accuracy limits of the CLAM method were checked by laser interferometry and are below 0.1 mrad.

  16. A statistical algorithm for assessing cellular alignment.

    PubMed

    Nectow, Alexander R; Gil, Eun Seok; Kaplan, David L; Kilmer, Misha E

    2013-03-01

    Current statistical techniques for analyzing cellular alignment data in the fields of biomaterials and tissue engineering are limited because of heuristic and less quantitative approaches. For example, generally a cutoff degree limit (commonly 20 degrees) is arbitrarily defined within which cells are considered "aligned." The effectiveness of a patterned biomaterial in guiding the alignment of cells, such as neurons, is often critical to predict relationships between the biomaterial design and biological outcomes, both in vitro and in vivo. This becomes particularly important in the case of peripheral neurons, which require precise axon guidance to obtain successful regenerative outcomes. To address this issue, we have developed a protocol for processing cellular alignment data sets, which implicitly determines an "angle of alignment." This was accomplished as follows: cells "aligning" with an underlying, anisotropic scaffold display uniformly distributed angles up to a cutoff point determined by how effective the biomaterial is in aligning cells. Therefore, this fact was then used to determine where an alignment angle data set diverges from a uniform distribution. This was accomplished by measuring the spacing between the collected, increasingly ordered angles and analyzing their underlying distributions using a normalized cumulative periodogram criterion. The proposed protocol offers a novel way to implicitly define cellular alignment, with respect to various anisotropic biomaterials. This method may also offer an alternative to assess cellular alignment, which could offer improved predictive measures related to biological outcomes. Furthermore, the approach described can be used for a broad range of cell types grown on 2D surfaces, but would not be applicable to 3D scaffold systems in the present format.

  17. An enhanced algorithm for multiple sequence alignment of protein sequences using genetic algorithm

    PubMed Central

    Kumar, Manish

    2015-01-01

    One of the most fundamental operations in biological sequence analysis is multiple sequence alignment (MSA). The basic of multiple sequence alignment problems is to determine the most biologically plausible alignments of protein or DNA sequences. In this paper, an alignment method using genetic algorithm for multiple sequence alignment has been proposed. Two different genetic operators mainly crossover and mutation were defined and implemented with the proposed method in order to know the population evolution and quality of the sequence aligned. The proposed method is assessed with protein benchmark dataset, e.g., BALIBASE, by comparing the obtained results to those obtained with other alignment algorithms, e.g., SAGA, RBT-GA, PRRP, HMMT, SB-PIMA, CLUSTALX, CLUSTAL W, DIALIGN and PILEUP8 etc. Experiments on a wide range of data have shown that the proposed algorithm is much better (it terms of score) than previously proposed algorithms in its ability to achieve high alignment quality. PMID:27065770

  18. An adaptive phase alignment algorithm for cartesian feedback loops

    NASA Astrophysics Data System (ADS)

    Gimeno-Martin, A.; Pardo-Martin, J.; Ortega-Gonzalez, F.

    2010-01-01

    An adaptive algorithm to correct phase misalignments in Cartesian feedback linearization loops for power amplifiers has been presented. It yields an error smaller than 0.035 rad between forward and feedback loop signals once convergence is reached. Because this algorithm enables a feedback system to process forward and feedback samples belonging to almost the same algorithm iteration, it is suitable to improve the performance not only of power amplifiers but also any other digital feedback system for communications systems and circuits such as all digital phase locked loops. Synchronizing forward and feedback paths of Cartesian feedback loops takes a small period of time after the system starts up. The phase alignment algorithm needs to converge before the feedback Cartesian loop can start its ideal behavior. However, once the steady state is reached, both paths can be considered synchronized, and the Cartesian feedback loop will only depend on the loop parameters (open-loop gain, loop bandwidth, etc.). It means that the linearization process will also depend only on these parameters since the misalignment effect disappears. Therefore, this algorithm relieves the power amplifier linearizer circuit design of any task required for solving phase misalignment effects inherent to Cartesian feedback systems. Furthermore, when a feedback Cartesian loop has to be designed, the designer can consider that forward and feedback paths are synchronized, since the phase alignment algorithm will do this task. This will reduce the simulation complexity. Then, all efforts are applied to determining the suitable loop parameters that will make the linearization process more efficient.

  19. Radar Image and Rain-gauge Alignment using the Multi-resolution Viscous Alignment (MVA) Algorithm

    NASA Astrophysics Data System (ADS)

    Chatdarong, V.

    2007-12-01

    Rainfall is a complex environmental variable that is difficult to describe either deterministically or statistically. To understand rainfall behaviors, many types of instruments are employed to detect and collect rainfall information. Among them, radar seems to provide the most comprehensive rainfall measurement at fine spatial and temporal resolution and over a relatively wide area. Nevertheless, it does not detects surface rainfall directly like what rain-gauge does. The accuracy radar rainfall, therefore, depends greatly on the Z-R relationship which convert radar reflectivity (Z) to surface rainrate (R). This calibration is usually done by fitting the rain-gauge data with the corresponding radar reflectivity using the regression analysis. To best fit the data, the radar reflectivity at neighbor pixels are usually used to best match the rain-gauge data. However, when applying the Z-R relationship to the radar image, there is no position adjustment despite the calibration technique. Hence, it is desirable to adjust the position of the radar reflectivity images prior to applying the Z-R relationship to improve the accuracy of the rainfall estimation. In this research, the Multi-resolution Viscous Alignment (MVA) algorithm is applied to best align radar reflectivity images to rain-gauge data in order to improve rainfall estimation from the Z-R relationship. The MVA algorithm solves the motion estimation problems using a Bayesian formulation to minimize misfits between two data sets. In general, the problem are ill-posed; therefore, some regularizations and constraints based on smoothness and non-divergence assumptions are employed. This algorithm is superior to the conventional techniques and correlation based techniques. It is fast, robust, easy to implement, and does not require data training. In addition, it can handle higher-order, missing data, and small-scale deformations. The algorithm provides spatially dense, consistency, and smooth transition vector. The

  20. Multiple sequence alignment algorithm based on a dispersion graph and ant colony algorithm.

    PubMed

    Chen, Weiyang; Liao, Bo; Zhu, Wen; Xiang, Xuyu

    2009-10-01

    In this article, we describe a representation for the processes of multiple sequences alignment (MSA) and used it to solve the problem of MSA. By this representation, we took every possible aligning result into account by defining the representation of gap insertion, the value of heuristic information in every optional path and scoring rule. On the basis of the proposed multidimensional graph, we used the ant colony algorithm to find the better path that denotes a better aligning result. In our article, we proposed the instance of three-dimensional graph and four-dimensional graph and advanced a special ichnographic representation to analyze MSA. It is yet only an experimental software, and we gave an example for finding the best aligning result by three-dimensional graph and ant colony algorithm. Experimental results show that our method can improve the solution quality on MSA benchmarks. PMID:19130503

  1. Linac Alignment Algorithm: Analysis on 1-to-1 Steering

    SciTech Connect

    Sun, Yipeng; Adolphsen, Chris; /SLAC

    2011-08-19

    In a linear accelerator, it is important to achieve a good alignment between all of its components (such as quadrupoles, RF cavities, beam position monitors et al.), in order to better preserve the beam quality during acceleration. After the survey of the main linac components, there are several beam-based alignment (BBA) techniques to be applied, to further optimize the beam trajectory and calculate the corresponding steering magnets strength. Among these techniques the most simple and straightforward one is the one-to-one (1-to-1) steering technique, which steers the beam from quad center to center, and removes the betatron oscillation from quad focusing. For a future linear collider such as the International Linear Collider (ILC), the initial beam emittance is very small in the vertical plane (flat beam with {gamma}{epsilon}{sub y} = 20-40nm), which means the alignment requirement is very tight. In this note, we evaluate the emittance growth with one-to-one correction algorithm employed, both analytically and numerically. Then the ILC main linac accelerator is taken as an example to compare the vertical emittance growth after 1-to-1 steering, both from analytical formulae and multi-particle tracking simulation. It is demonstrated that the estimated emittance growth from the derived formulae agrees well with the results from numerical simulation, with and without acceleration, respectively.

  2. Algorithm for Aligning an Array of Receiving Radio Antennas

    NASA Technical Reports Server (NTRS)

    Rogstad, David

    2006-01-01

    A digital-signal-processing algorithm (somewhat arbitrarily) called SUMPLE has been devised as a means of aligning the outputs of multiple receiving radio antennas in a large array for the purpose of receiving a weak signal transmitted by a single distant source. As used here, aligning signifies adjusting the delays and phases of the outputs from the various antennas so that their relatively weak replicas of the desired signal can be added coherently to increase the signal-to-noise ratio (SNR) for improved reception, as though one had a single larger antenna. The method was devised to enhance spacecraft-tracking and telemetry operations in NASA's Deep Space Network (DSN); the method could also be useful in such other applications as both satellite and terrestrial radio communications and radio astronomy. Heretofore, most commonly, alignment has been effected by a process that involves correlation of signals in pairs. This approach necessitates the use of a large amount of hardware most notably, the N(N - 1)/2 correlators needed to process signals from all possible pairs of N antennas. Moreover, because the incoming signals typically have low SNRs, the delay and phase adjustments are poorly determined from the pairwise correlations. SUMPLE also involves correlations, but the correlations are not performed in pairs. Instead, in a partly iterative process, each signal is appropriately weighted and then correlated with a composite signal equal to the sum of the other signals (see Figure 1). One benefit of this approach is that only N correlators are needed; in an array of N much greater than 1 antennas, this results in a significant reduction of the amount of hardware. Another benefit is that once the array achieves coherence, the correlation SNR is N - 1 times that of a pair of antennas.

  3. Effective decomposition algorithm for self-aligned double patterning lithography

    NASA Astrophysics Data System (ADS)

    Zhang, Hongbo; Du, Yuelin; Wong, Martin D. F.; Topaloglu, Rasit; Conley, Will

    2011-04-01

    Self-aligned double patterning (SADP) lithography is a novel lithography technology that has the intrinsic capability to reduce the overlay in the double patterning lithography (DPL). Although SADP is the critical technology to solve the lithography difficulties in sub-32nm 2D design, the questions - how to decompose a layout with reasonable overlay and how to perform a decomposability check - are still two open problems with no published work. In this paper, by formulating the problem into a SAT formation, we can answer the above two questions optimally. This is the first published paper with detailed algorithm to perform the SADP decomposition. In a layout, we can efficiently check whether a layout is decomposable. For a decomposable layout, our algorithm guarantees to find a decomposition solution with reasonable overlay reduction requirement. With little changes on the clauses in the SAT formula, we can address the decomposition problem for both the positive tone process and the negative tone process. Experimental results validate our method, and decomposition results for Nangate Open Cell Library and larger test cases are also provided with competitive run times.

  4. DETECTORS AND EXPERIMENTAL METHODS: BESIII track fitting algorithm

    NASA Astrophysics Data System (ADS)

    Wang, Ji-Ke; Mao, Ze-Pu; Bian, Jian-Ming; Cao, Guo-Fu; Cao, Xue-Xiang; Chen, Shen-Jian; Deng, Zi-Yan; Fu, Cheng-Dong; Gao, Yuan-Ning; He, Kang-Lin; He, Miao; Hua, Chun-Fei; Huang, Bin; Huang, Xing-Tao; Ji, Xiao-Bin; Li, Fei; Li, Bai-Bo; Li, Wei-Dong; Liang, Yu-Tie; Liu, Chun-Xiu; Liu, Huai-Min; Liu, Suo; Liu, Ying-Jie; Ma, Qiu-Mei; Ma, Xiang; Mao, Ya-Jun; Mo, Xiao-Hu; Pan, Ming-Hua; Pang, Cai-Ying; Ping, Rong-Gang; Qin, Ya-Hong; Qiu, Jin-Fa; Sun, Sheng-Sen; Sun, Yong-Zhao; Wang, Liang-Liang; Wen, Shuo-Pin; Wu, Ling-Hui; Xie, Yu-Guang; Xu, Min; Yan, Liang; You, Zheng-Yun; Yuan, Chang-Zheng; Yuan, Ye; Zhang, Bing-Yun; Zhang, Chang-Chun; Zhang, Jian-Yong; Zhang, Xue-Yao; Zhang, Yao; Zheng, Yang-Heng; Zhu, Ke-Jun; Zhu, Yong-Sheng; Zhu, Zhi-Li; Zou, Jia-Heng

    2009-10-01

    A track fitting algorithm based on the Kalman filter method has been developed for BESIII of BEPCII. The effects of multiple scattering and energy loss when the charged particles go through the detector, non-uniformity of magnetic field (NUMF) and wire sag, etc., have been carefully handled. This algorithm works well and the performance satisfies the physical requirements tested by the simulation data.

  5. Study on the technology of mutual alignment based on the four-quadrant photo electric detector

    NASA Astrophysics Data System (ADS)

    Hu, Ya-bin; Wang, Miao

    2015-11-01

    Panoramic stereo cameras and laser radars have their own coordinate system in the dynamic spatial sensing area and they have to determine the position relationship between each other through joint calibration. As using the traditional technology of mutual alignment based on the telescope cross wire is tedious and requires high operating skills, a new method of mutual alignment using lasers and four-quadrant photo electric detectors is provided after analyzing the working principle of four-quadrant photo electric detectors. Firstly make the laser beam irradiate the active area of the four-quadrant photo electric detector through coarse aiming. Then the center of a light spot offset relative to the center of the active area can be obtained according to the output voltage of four quadrants. The pose of two instruments can be adjusted properly to realize mutual alignment. The experimental results indicate that the alignment accuracy of four-quadrant detectors can meet the requirements of mutual alignment, which provides a new idea for joint calibration.

  6. The GMT detector alignment in the STAR experiment

    NASA Astrophysics Data System (ADS)

    Ermakov, N.; STAR Collaboration

    2016-02-01

    The Solenoidal Tracker At RHIC (STAR) uses the Time Projection Chamber (TPC) to perform tracking and particle identification. In order to improve the corrections (such as space charge) and monitor non-static distortions of the TPC, GEM-based chambers (GMT) were installed at eight locations outside the TPC where they will provide optimal sensitivity to the distortions. In order to reach this goal, the ionization clusters were measured by using the ADC signals in each module. The positions of clusters and their deviations from track projections enabled alignment of the GMT modules with respect to TPC to an accuracy ∼ 200μm.

  7. Divergence detectors for multitarget tracking algorithms

    NASA Astrophysics Data System (ADS)

    Mahler, Ronald

    2013-05-01

    Single-target tracking filters will typically diverge when their internal measurement or motion models deviate too much from the actual models. Niu, Varshney, Alford, Bubalo, Jones, and Scalzo have proposed a metric-- the normalized innovation squared (NIS)--that recursively estimates the degree of nonlinearity in a single-target tracking problem by detecting filter divergence. This paper establishes the following: (1) NIS can be extended to generalized NIS (GNIS), which addresses more general nonlinearities; (2) NIS and GNIS are actually anomaly detectors, rather than filter-divergence detectors; (3) NIS can be heuristically generalized to a multitarget NIS (MNIS) metric; (4) GNIS also can be rigorously extended to multitarget problems via the multitarget GNIS (MGNIS); (5) explicit, computationally tractable formulas for MGNIS can be derived for use with CPHD and PHD filters; and thus (6) these formulas can be employed as anomaly detectors for use with these filters.

  8. Alignment of the Near Detector scintillator modules using cosmic ray muons

    SciTech Connect

    Ospanov, Rustem; Lang, Karol; /Texas U.

    2008-05-01

    The authors describe the procedures and the results of the first alignment of the Near Detector. Using 15.5 million cosmic ray muon tracks, collected from October, 2004 through early january, 2005, they derive the effective transverse positions of the calorimeter scintillator modules. The residuals from straight line fits indicate that the current alignment has achieved better than 1 mm precision. They estimate the size of the remaining misalignment and using tracks recorded with a magnetic field test the effect of the magnetic field on the alignment.

  9. A comprehensive evaluation of alignment algorithms in the context of RNA-seq.

    PubMed

    Lindner, Robert; Friedel, Caroline C

    2012-01-01

    Transcriptome sequencing (RNA-Seq) overcomes limitations of previously used RNA quantification methods and provides one experimental framework for both high-throughput characterization and quantification of transcripts at the nucleotide level. The first step and a major challenge in the analysis of such experiments is the mapping of sequencing reads to a transcriptomic origin including the identification of splicing events. In recent years, a large number of such mapping algorithms have been developed, all of which have in common that they require algorithms for aligning a vast number of reads to genomic or transcriptomic sequences. Although the FM-index based aligner Bowtie has become a de facto standard within mapping pipelines, a much larger number of possible alignment algorithms have been developed also including other variants of FM-index based aligners. Accordingly, developers and users of RNA-seq mapping pipelines have the choice among a large number of available alignment algorithms. To provide guidance in the choice of alignment algorithms for these purposes, we evaluated the performance of 14 widely used alignment programs from three different algorithmic classes: algorithms using either hashing of the reference transcriptome, hashing of reads, or a compressed FM-index representation of the genome. Here, special emphasis was placed on both precision and recall and the performance for different read lengths and numbers of mismatches and indels in a read. Our results clearly showed the significant reduction in memory footprint and runtime provided by FM-index based aligners at a precision and recall comparable to the best hash table based aligners. Furthermore, the recently developed Bowtie 2 alignment algorithm shows a remarkable tolerance to both sequencing errors and indels, thus, essentially making hash-based aligners obsolete.

  10. Retention Time Alignment of LC/MS Data by a Divide-and-Conquer Algorithm

    NASA Astrophysics Data System (ADS)

    Zhang, Zhongqi

    2012-04-01

    Liquid chromatography-mass spectrometry (LC/MS) has become the method of choice for characterizing complex mixtures. These analyses often involve quantitative comparison of components in multiple samples. To achieve automated sample comparison, the components of interest must be detected and identified, and their retention times aligned and peak areas calculated. This article describes a simple pairwise iterative retention time alignment algorithm, based on the divide-and-conquer approach, for alignment of ion features detected in LC/MS experiments. In this iterative algorithm, ion features in the sample run are first aligned with features in the reference run by applying a single constant shift of retention time. The sample chromatogram is then divided into two shorter chromatograms, which are aligned to the reference chromatogram the same way. Each shorter chromatogram is further divided into even shorter chromatograms. This process continues until each chromatogram is sufficiently narrow so that ion features within it have a similar retention time shift. In six pairwise LC/MS alignment examples containing a total of 6507 confirmed true corresponding feature pairs with retention time shifts up to five peak widths, the algorithm successfully aligned these features with an error rate of 0.2%. The alignment algorithm is demonstrated to be fast, robust, fully automatic, and superior to other algorithms. After alignment and gap-filling of detected ion features, their abundances can be tabulated for direct comparison between samples.

  11. A rapid protein structure alignment algorithm based on a text modeling technique

    PubMed Central

    Razmara, Jafar; Deris, Safaai; Parvizpour, Sepideh

    2011-01-01

    Structural alignment of proteins is widely used in various fields of structural biology. In order to further improve the quality of alignment, we describe an algorithm for structural alignment based on text modelling techniques. The technique firstly superimposes secondary structure elements of two proteins and then, models the 3D-structure of the protein in a sequence of alphabets. These sequences are utilized by a step-by-step sequence alignment procedure to align two protein structures. A benchmark test was organized on a set of 200 non-homologous proteins to evaluate the program and compare it to state of the art programs, e.g. CE, SAL, TM-align and 3D-BLAST. On average, the results of all-against-all structure comparison by the program have a competitive accuracy with CE and TM-align where the algorithm has a high running speed like 3D-BLAST. PMID:21814392

  12. Photon counting detector array algorithms for deep space optical communications

    NASA Astrophysics Data System (ADS)

    Srinivasan, Meera; Andrews, Kenneth S.; Farr, William H.; Wong, Andre

    2016-03-01

    For deep-space optical communications systems utilizing an uplink optical beacon, a single-photon-counting detector array on the flight terminal can be used to simultaneously perform uplink tracking and communications as well as accurate downlink pointing at photon-starved (pW=m2) power levels. In this paper, we discuss concepts and algorithms for uplink signal acquisition, tracking, and parameter estimation using a photon-counting camera. Statistical models of detector output data and signal processing algorithms are presented, incorporating realistic effects such as Earth background and detector/readout blocking. Analysis and simulation results are validated against measured laboratory data using state-of-the-art commercial photon-counting detector arrays, demonstrating sub-microradian tracking errors under channel conditions representative of deep space optical links.

  13. Alignment of sources and detectors on breast surface for noncontact diffuse correlation tomography of breast tumors

    PubMed Central

    Huang, Chong; Lin, Yu; He, Lian; Irwin, Daniel; Szabunio, Margaret M.; Yu, Guoqiang

    2016-01-01

    Noncontact diffuse correlation tomography (ncDCT) is an emerging technology for 3D imaging of deep tissue blood flow distribution without distorting hemodynamic properties. To adapt the ncDCT for imaging in vivo breast tumors, we designed a motorized ncDCT probe to scan over the breast surface. A computer-aided design (CAD)-based approach was proposed to create solid volume mesh from arbitrary breast surface obtained by a commercial 3D camera. The sources and detectors of ncDCT were aligned on the breast surface through ray tracing to mimic the ncDCT scanning with CAD software. The generated breast volume mesh along with the boundary data of ncDCT at the aligned source and detector pairs were used for finite-element-method-based flow image reconstruction. We evaluated the accuracy of source alignments on mannequin and human breasts; largest alignment errors were less than 10% in both tangential and radial directions of scanning. The impact of alignment errors (assigned 10%) on the tumor reconstruction was estimated using computer simulations. The deviations of simulated tumor location and blood flow contrast resulted from the alignment errors were 0.77 mm (less than the node distance of 1 mm) and 1%, respectively, which result in minor impact on flow image reconstruction. Finally, a case study on a human breast tumor was conducted and a tumor-to-normal flow contrast was reconstructed, demonstrating the feasibility of ncDCT in clinical application. PMID:26479823

  14. An Accurate Scalable Template-based Alignment Algorithm.

    PubMed

    Gardner, David P; Xu, Weijia; Miranker, Daniel P; Ozer, Stuart; Cannone, Jamie J; Gutell, Robin R

    2012-12-31

    The rapid determination of nucleic acid sequences is increasing the number of sequences that are available. Inherent in a template or seed alignment is the culmination of structural and functional constraints that are selecting those mutations that are viable during the evolution of the RNA. While we might not understand these structural and functional, template-based alignment programs utilize the patterns of sequence conservation to encapsulate the characteristics of viable RNA sequences that are aligned properly. We have developed a program that utilizes the different dimensions of information in rCAD, a large RNA informatics resource, to establish a profile for each position in an alignment. The most significant include sequence identity and column composition in different phylogenetic taxa. We have compared our methods with a maximum of eight alternative alignment methods on different sets of 16S and 23S rRNA sequences with sequence percent identities ranging from 50% to 100%. The results showed that CRWAlign outperformed the other alignment methods in both speed and accuracy. A web-based alignment server is available at http://www.rna.ccbb.utexas.edu/SAE/2F/CRWAlign.

  15. Algorithm Implementation for a Prototype Time-Encoded Signature Detector

    SciTech Connect

    Mercier, Theresa M.; Runkle, Robert C.; Stephens, Daniel L.; Hyronimus, Brian J.; Morris, Scott J.; Seifert, Allen; Wyatt, Cory R.

    2007-12-31

    The authors constructed a prototype Time-Encoded Signature (TES) system, complete with automated detection algorithms, useful for the detection of point-like, gamma-ray sources in search applications where detectors observe large variability in background count rates beyond statistical (Poisson) noise. The person-carried TES instrument consists of two Cesium Iodide scintillators placed on opposite sides of a Tungsten shield. This geometry mitigates systematic background variation, and induces a unique signature upon encountering point-like sources. This manuscript focuses on the development of detection algorithms that both identify point-source signatures and are computationally simple. The latter constraint derives from the instrument’s mobile (and thus low power) operation. The authors evaluated algorithms on both simulated and field data. The results of this analysis demonstrate the ability to detect sources at a wide range of source-detector distances using computationally simple algorithms.

  16. Alignment algorithms and per-particle CTF correction for single particle cryo-electron tomography.

    PubMed

    Galaz-Montoya, Jesús G; Hecksel, Corey W; Baldwin, Philip R; Wang, Eryu; Weaver, Scott C; Schmid, Michael F; Ludtke, Steven J; Chiu, Wah

    2016-06-01

    Single particle cryo-electron tomography (cryoSPT) extracts features from cryo-electron tomograms, followed by 3D classification, alignment and averaging to generate improved 3D density maps of such features. Robust methods to correct for the contrast transfer function (CTF) of the electron microscope are necessary for cryoSPT to reach its resolution potential. Many factors can make CTF correction for cryoSPT challenging, such as lack of eucentricity of the specimen stage, inherent low dose per image, specimen charging, beam-induced specimen motions, and defocus gradients resulting both from specimen tilting and from unpredictable ice thickness variations. Current CTF correction methods for cryoET make at least one of the following assumptions: that the defocus at the center of the image is the same across the images of a tiltseries, that the particles all lie at the same Z-height in the embedding ice, and/or that the specimen, the cryo-electron microscopy (cryoEM) grid and/or the carbon support are flat. These experimental conditions are not always met. We have developed a CTF correction algorithm for cryoSPT without making any of the aforementioned assumptions. We also introduce speed and accuracy improvements and a higher degree of automation to the subtomogram averaging algorithms available in EMAN2. Using motion-corrected images of isolated virus particles as a benchmark specimen, recorded with a DE20 direct detection camera, we show that our CTF correction and subtomogram alignment routines can yield subtomogram averages close to 4/5 Nyquist frequency of the detector under our experimental conditions. PMID:27016284

  17. Alignment algorithms and per-particle CTF correction for single particle cryo-electron tomography.

    PubMed

    Galaz-Montoya, Jesús G; Hecksel, Corey W; Baldwin, Philip R; Wang, Eryu; Weaver, Scott C; Schmid, Michael F; Ludtke, Steven J; Chiu, Wah

    2016-06-01

    Single particle cryo-electron tomography (cryoSPT) extracts features from cryo-electron tomograms, followed by 3D classification, alignment and averaging to generate improved 3D density maps of such features. Robust methods to correct for the contrast transfer function (CTF) of the electron microscope are necessary for cryoSPT to reach its resolution potential. Many factors can make CTF correction for cryoSPT challenging, such as lack of eucentricity of the specimen stage, inherent low dose per image, specimen charging, beam-induced specimen motions, and defocus gradients resulting both from specimen tilting and from unpredictable ice thickness variations. Current CTF correction methods for cryoET make at least one of the following assumptions: that the defocus at the center of the image is the same across the images of a tiltseries, that the particles all lie at the same Z-height in the embedding ice, and/or that the specimen, the cryo-electron microscopy (cryoEM) grid and/or the carbon support are flat. These experimental conditions are not always met. We have developed a CTF correction algorithm for cryoSPT without making any of the aforementioned assumptions. We also introduce speed and accuracy improvements and a higher degree of automation to the subtomogram averaging algorithms available in EMAN2. Using motion-corrected images of isolated virus particles as a benchmark specimen, recorded with a DE20 direct detection camera, we show that our CTF correction and subtomogram alignment routines can yield subtomogram averages close to 4/5 Nyquist frequency of the detector under our experimental conditions.

  18. Hohlraum Target Alignment from X-ray Detector Images using Starburst Design Patterns

    SciTech Connect

    Leach, R R; Conder, A; Edwards, O; Kroll, J; Kozioziemski, B; Mapoles, E; McGuigan, D; Wilhelmsen, K

    2010-12-14

    National Ignition Facility (NIF) is a high-energy laser facility comprised of 192 laser beams focused with enough power and precision on a hydrogen-filled spherical, cryogenic target to initiate a fusion reaction. The target container, or hohlraum, must be accurately aligned to an x-ray imaging system to allow careful monitoring of the frozen fuel layer in the target. To achieve alignment, x-ray images are acquired through starburst-shaped windows cut into opposite sides of the hohlraum. When the hohlraum is in alignment, the starburst pattern pairs match nearly exactly and allow a clear view of the ice layer formation on the edge of the target capsule. During the alignment process, x-ray image analysis is applied to determine the direction and magnitude of adjustment required. X-ray detector and source are moved in concert during the alignment process. The automated pointing alignment system described here is both accurate and efficient. In this paper, we describe the control and associated image processing that enables automation of the starburst pointing alignment.

  19. Experiences and evolutions of the ALICE DAQ Detector Algorithms framework

    NASA Astrophysics Data System (ADS)

    Chapeland, Sylvain; Carena, Franco; Carena, Wisla; Chibante Barroso, Vasco; Costa, Filippo; Denes, Ervin; Divia, Roberto; Fuchs, Ulrich; Grigore, Alexandru; Simonetti, Giuseppe; Soos, Csaba; Telesca, Adriana; Vande Vyvre, Pierre; von Haller, Barthelemy

    2012-12-01

    ALICE (A Large Ion Collider Experiment) is the heavy-ion detector studying the physics of strongly interacting matter and the quark-gluon plasma at the CERN LHC (Large Hadron Collider). The 18 ALICE sub-detectors are regularly calibrated in order to achieve most accurate physics measurements. Some of these procedures are done online in the DAQ (Data Acquisition System) so that calibration results can be directly used for detector electronics configuration before physics data taking, at run time for online event monitoring, and offline for data analysis. A framework was designed to collect statistics and compute calibration parameters, and has been used in production since 2008. This paper focuses on the recent features developed to benefit from the multi-cores architecture of CPUs, and to optimize the processing power available for the calibration tasks. It involves some C++ base classes to effectively implement detector specific code, with independent processing of events in parallel threads and aggregation of partial results. The Detector Algorithm (DA) framework provides utility interfaces for handling of input and output (configuration, monitored physics data, results, logging), and self-documentation of the produced executable. New algorithms are created quickly by inheritance of base functionality and implementation of few ad-hoc virtual members, while the framework features are kept expandable thanks to the isolation of the detector calibration code. The DA control system also handles unexpected processes behaviour, logs execution status, and collects performance statistics.

  20. Predicting the accuracy of multiple sequence alignment algorithms by using computational intelligent techniques

    PubMed Central

    Ortuño, Francisco M.; Valenzuela, Olga; Pomares, Hector; Rojas, Fernando; Florido, Javier P.; Urquiza, Jose M.

    2013-01-01

    Multiple sequence alignments (MSAs) have become one of the most studied approaches in bioinformatics to perform other outstanding tasks such as structure prediction, biological function analysis or next-generation sequencing. However, current MSA algorithms do not always provide consistent solutions, since alignments become increasingly difficult when dealing with low similarity sequences. As widely known, these algorithms directly depend on specific features of the sequences, causing relevant influence on the alignment accuracy. Many MSA tools have been recently designed but it is not possible to know in advance which one is the most suitable for a particular set of sequences. In this work, we analyze some of the most used algorithms presented in the bibliography and their dependences on several features. A novel intelligent algorithm based on least square support vector machine is then developed to predict how accurate each alignment could be, depending on its analyzed features. This algorithm is performed with a dataset of 2180 MSAs. The proposed system first estimates the accuracy of possible alignments. The most promising methodologies are then selected in order to align each set of sequences. Since only one selected algorithm is run, the computational time is not excessively increased. PMID:23066102

  1. Node Handprinting: A Scalable and Accurate Algorithm for Aligning Multiple Biological Networks.

    PubMed

    Radu, Alex; Charleston, Michael

    2015-07-01

    Due to recent advancements in high-throughput sequencing technologies, progressively more protein-protein interactions have been identified for a growing number of species. Subsequently, the protein-protein interaction networks for these species have been further refined. The increase in the quality and availability of these networks has in turn brought a demand for efficient methods to analyze such networks. The pairwise alignment of these networks has been moderately investigated, with numerous algorithms available, but there is very little progress in the field of multiple network alignment. Multiple alignment of networks from different organisms is ideal at finding abnormally conserved or disparate subnetworks. We present a fast and accurate algorithmic approach, Node Handprinting (NH), based on our previous work with Node Fingerprinting, which enables quick and accurate alignment of multiple networks. We also propose two new metrics for the analysis of multiple alignments, as the current metrics are not as sophisticated as their pairwise alignment counterparts. To assess the performance of NH, we use previously aligned datasets as well as protein interaction networks generated from the public database BioGRID. Our results indicate that NH compares favorably with current methodologies and is the only algorithm capable of performing the more complex alignments.

  2. A hybrid retention time alignment algorithm for SWATH-MS data.

    PubMed

    Wu, Long; Amon, Sabine; Lam, Henry

    2016-08-01

    Recently, data-independent acquisition (DIA) MS has gained popularity as a qualitative-quantitative workflow for proteomics. One outstanding problem in the analysis of DIA-MS data is alignment of chromatographic retention times across multiple samples, which facilitates peptide identification and accurate quantification. Here, we present a novel hybrid (profile-based and feature-based) algorithm for LC-MS alignment and test it on sequential windowed acquisition of all theoretical fragment ion mass spectra (SWATH) (a type of DIA) data. Our algorithm uses a profile-based dynamic time warping algorithm to obtain a coarse alignment and corrects large retention time shifts, and then uses a feature-based bipartite matching algorithm to match feature to feature at a fine scale. We evaluated our method by comparing our aligned feature pairs to peptide identification results of pseudo-MS2 spectra exported by DIA-Umpire, a recently reported tool for deconvoluting DIA-MS data. We proposed that our method can be used to align DIA-MS data prior to identification, and the alignment can be used to delete noise peaks or screen for differentially changed features. We found that a simple alignment-enabled denoising scheme can reduce the number of pseudo-MS2 spectra exported by DIA-Umpire by up to around 40%, while retaining a comparable number of identifications. Finally, we demonstrated the utility of our tool for accurate label-free relative quantification across multiple SWATH runs.

  3. A hybrid retention time alignment algorithm for SWATH-MS data.

    PubMed

    Wu, Long; Amon, Sabine; Lam, Henry

    2016-08-01

    Recently, data-independent acquisition (DIA) MS has gained popularity as a qualitative-quantitative workflow for proteomics. One outstanding problem in the analysis of DIA-MS data is alignment of chromatographic retention times across multiple samples, which facilitates peptide identification and accurate quantification. Here, we present a novel hybrid (profile-based and feature-based) algorithm for LC-MS alignment and test it on sequential windowed acquisition of all theoretical fragment ion mass spectra (SWATH) (a type of DIA) data. Our algorithm uses a profile-based dynamic time warping algorithm to obtain a coarse alignment and corrects large retention time shifts, and then uses a feature-based bipartite matching algorithm to match feature to feature at a fine scale. We evaluated our method by comparing our aligned feature pairs to peptide identification results of pseudo-MS2 spectra exported by DIA-Umpire, a recently reported tool for deconvoluting DIA-MS data. We proposed that our method can be used to align DIA-MS data prior to identification, and the alignment can be used to delete noise peaks or screen for differentially changed features. We found that a simple alignment-enabled denoising scheme can reduce the number of pseudo-MS2 spectra exported by DIA-Umpire by up to around 40%, while retaining a comparable number of identifications. Finally, we demonstrated the utility of our tool for accurate label-free relative quantification across multiple SWATH runs. PMID:27302277

  4. A Self-Alignment Algorithm for SINS Based on Gravitational Apparent Motion and Sensor Data Denoising

    PubMed Central

    Liu, Yiting; Xu, Xiaosu; Liu, Xixiang; Yao, Yiqing; Wu, Liang; Sun, Jin

    2015-01-01

    Initial alignment is always a key topic and difficult to achieve in an inertial navigation system (INS). In this paper a novel self-initial alignment algorithm is proposed using gravitational apparent motion vectors at three different moments and vector-operation. Simulation and analysis showed that this method easily suffers from the random noise contained in accelerometer measurements which are used to construct apparent motion directly. Aiming to resolve this problem, an online sensor data denoising method based on a Kalman filter is proposed and a novel reconstruction method for apparent motion is designed to avoid the collinearity among vectors participating in the alignment solution. Simulation, turntable tests and vehicle tests indicate that the proposed alignment algorithm can fulfill initial alignment of strapdown INS (SINS) under both static and swinging conditions. The accuracy can either reach or approach the theoretical values determined by sensor precision under static or swinging conditions. PMID:25923932

  5. A Self-Alignment Algorithm for SINS Based on Gravitational Apparent Motion and Sensor Data Denoising.

    PubMed

    Liu, Yiting; Xu, Xiaosu; Liu, Xixiang; Yao, Yiqing; Wu, Liang; Sun, Jin

    2015-01-01

    Initial alignment is always a key topic and difficult to achieve in an inertial navigation system (INS). In this paper a novel self-initial alignment algorithm is proposed using gravitational apparent motion vectors at three different moments and vector-operation. Simulation and analysis showed that this method easily suffers from the random noise contained in accelerometer measurements which are used to construct apparent motion directly. Aiming to resolve this problem, an online sensor data denoising method based on a Kalman filter is proposed and a novel reconstruction method for apparent motion is designed to avoid the collinearity among vectors participating in the alignment solution. Simulation, turntable tests and vehicle tests indicate that the proposed alignment algorithm can fulfill initial alignment of strapdown INS (SINS) under both static and swinging conditions. The accuracy can either reach or approach the theoretical values determined by sensor precision under static or swinging conditions. PMID:25923932

  6. Protein alignment algorithms with an efficient backtracking routine on multiple GPUs

    PubMed Central

    2011-01-01

    Background Pairwise sequence alignment methods are widely used in biological research. The increasing number of sequences is perceived as one of the upcoming challenges for sequence alignment methods in the nearest future. To overcome this challenge several GPU (Graphics Processing Unit) computing approaches have been proposed lately. These solutions show a great potential of a GPU platform but in most cases address the problem of sequence database scanning and computing only the alignment score whereas the alignment itself is omitted. Thus, the need arose to implement the global and semiglobal Needleman-Wunsch, and Smith-Waterman algorithms with a backtracking procedure which is needed to construct the alignment. Results In this paper we present the solution that performs the alignment of every given sequence pair, which is a required step for progressive multiple sequence alignment methods, as well as for DNA recognition at the DNA assembly stage. Performed tests show that the implementation, with performance up to 6.3 GCUPS on a single GPU for affine gap penalties, is very efficient in comparison to other CPU and GPU-based solutions. Moreover, multiple GPUs support with load balancing makes the application very scalable. Conclusions The article shows that the backtracking procedure of the sequence alignment algorithms may be designed to fit in with the GPU architecture. Therefore, our algorithm, apart from scores, is able to compute pairwise alignments. This opens a wide range of new possibilities, allowing other methods from the area of molecular biology to take advantage of the new computational architecture. Performed tests show that the efficiency of the implementation is excellent. Moreover, the speed of our GPU-based algorithms can be almost linearly increased when using more than one graphics card. PMID:21599912

  7. Neurient: An Algorithm for Automatic Tracing of Confluent Neuronal Images to Determine Alignment

    PubMed Central

    Mitchel, J.A.; Martin, I.S.

    2013-01-01

    A goal of neural tissue engineering is the development and evaluation of materials that guide neuronal growth and alignment. However, the methods available to quantitatively evaluate the response of neurons to guidance materials are limited and/or expensive, and may require manual tracing to be performed by the researcher. We have developed an open source, automated Matlab-based algorithm, building on previously published methods, to trace and quantify alignment of fluorescent images of neurons in culture. The algorithm is divided into three phases, including computation of a lookup table which contains directional information for each image, location of a set of seed points which may lie along neurite centerlines, and tracing neurites starting with each seed point and indexing into the lookup table. This method was used to obtain quantitative alignment data for complex images of densely cultured neurons. Complete automation of tracing allows for unsupervised processing of large numbers of images. Following image processing with our algorithm, available metrics to quantify neurite alignment include angular histograms, percent of neurite segments in a given direction, and mean neurite angle. The alignment information obtained from traced images can be used to compare the response of neurons to a range of conditions. This tracing algorithm is freely available to the scientific community under the name Neurient, and its implementation in Matlab allows a wide range of researchers to use a standardized, open source method to quantitatively evaluate the alignment of dense neuronal cultures. PMID:23384629

  8. GreedyPlus: An Algorithm for the Alignment of Interface Interaction Networks

    PubMed Central

    Law, Brian; Bader, Gary D.

    2015-01-01

    The increasing ease and accuracy of protein-protein interaction detection has resulted in the ability to map the interactomes of multiple species. We now have an opportunity to compare species to better understand how interactomes evolve. As DNA and protein sequence alignment algorithms were required for comparative genomics, network alignment algorithms are required for comparative interactomics. A number of network alignment methods have been developed for protein-protein interaction networks, where proteins are represented as vertices linked by edges if they interact. Recently, protein interactions have been mapped at the level of amino acid positions, which can be represented as an interface-interaction network (IIN), where vertices represent binding sites, such as protein domains and short sequence motifs. However, current algorithms are not designed to align these networks and generally fail to do so in practice. We present a greedy algorithm, GreedyPlus, for IIN alignment, combining data from diverse sources, including network, protein and binding site properties, to identify putative orthologous relationships between interfaces in available worm and yeast data. GreedyPlus is fast and simple, allowing for easy customization of behaviour, yet still capable of generating biologically meaningful network alignments. PMID:26165520

  9. Fast local motion estimation algorithm using elementary motion detectors

    NASA Astrophysics Data System (ADS)

    Nakamura, Eiji; Nakamura, Takehito; Sawada, Katsutoshi

    2003-06-01

    This paper presnts a fast local motion estimation algorithm based on so called elementary motion detectors or EMDs. EMDs, modeling insect"s visual signal processing systems, have low computational complexity aspects and can thus be key components to realize such a fast local motion estimation algorithm. The contribution of the presented work is to introduce dual parameter estimators or DPEs by configuring EMDs so that they can estimate local motions in terms of both direction and speed mode parameters simultaneously. The estimated local motion vectors are displayed as arrows superimposed over video image frames. The developed algorithm is implmented in a DirectShow application by using Mircosoft"s DirectX runtime library and is evaluated using various types of video image sequences. It is found to be able to estimate local motion vectors in real time even in moderate PC computing platforms and hece no high profile hardware devices are needed for its real time operation.

  10. Design of multiple sequence alignment algorithms on parallel, distributed memory supercomputers.

    PubMed

    Church, Philip C; Goscinski, Andrzej; Holt, Kathryn; Inouye, Michael; Ghoting, Amol; Makarychev, Konstantin; Reumann, Matthias

    2011-01-01

    The challenge of comparing two or more genomes that have undergone recombination and substantial amounts of segmental loss and gain has recently been addressed for small numbers of genomes. However, datasets of hundreds of genomes are now common and their sizes will only increase in the future. Multiple sequence alignment of hundreds of genomes remains an intractable problem due to quadratic increases in compute time and memory footprint. To date, most alignment algorithms are designed for commodity clusters without parallelism. Hence, we propose the design of a multiple sequence alignment algorithm on massively parallel, distributed memory supercomputers to enable research into comparative genomics on large data sets. Following the methodology of the sequential progressiveMauve algorithm, we design data structures including sequences and sorted k-mer lists on the IBM Blue Gene/P supercomputer (BG/P). Preliminary results show that we can reduce the memory footprint so that we can potentially align over 250 bacterial genomes on a single BG/P compute node. We verify our results on a dataset of E.coli, Shigella and S.pneumoniae genomes. Our implementation returns results matching those of the original algorithm but in 1/2 the time and with 1/4 the memory footprint for scaffold building. In this study, we have laid the basis for multiple sequence alignment of large-scale datasets on a massively parallel, distributed memory supercomputer, thus enabling comparison of hundreds instead of a few genome sequences within reasonable time. PMID:22254462

  11. Design of multiple sequence alignment algorithms on parallel, distributed memory supercomputers.

    PubMed

    Church, Philip C; Goscinski, Andrzej; Holt, Kathryn; Inouye, Michael; Ghoting, Amol; Makarychev, Konstantin; Reumann, Matthias

    2011-01-01

    The challenge of comparing two or more genomes that have undergone recombination and substantial amounts of segmental loss and gain has recently been addressed for small numbers of genomes. However, datasets of hundreds of genomes are now common and their sizes will only increase in the future. Multiple sequence alignment of hundreds of genomes remains an intractable problem due to quadratic increases in compute time and memory footprint. To date, most alignment algorithms are designed for commodity clusters without parallelism. Hence, we propose the design of a multiple sequence alignment algorithm on massively parallel, distributed memory supercomputers to enable research into comparative genomics on large data sets. Following the methodology of the sequential progressiveMauve algorithm, we design data structures including sequences and sorted k-mer lists on the IBM Blue Gene/P supercomputer (BG/P). Preliminary results show that we can reduce the memory footprint so that we can potentially align over 250 bacterial genomes on a single BG/P compute node. We verify our results on a dataset of E.coli, Shigella and S.pneumoniae genomes. Our implementation returns results matching those of the original algorithm but in 1/2 the time and with 1/4 the memory footprint for scaffold building. In this study, we have laid the basis for multiple sequence alignment of large-scale datasets on a massively parallel, distributed memory supercomputer, thus enabling comparison of hundreds instead of a few genome sequences within reasonable time.

  12. Improvement in accuracy of multiple sequence alignment using novel group-to-group sequence alignment algorithm with piecewise linear gap cost

    PubMed Central

    Yamada, Shinsuke; Gotoh, Osamu; Yamana, Hayato

    2006-01-01

    Background Multiple sequence alignment (MSA) is a useful tool in bioinformatics. Although many MSA algorithms have been developed, there is still room for improvement in accuracy and speed. In the alignment of a family of protein sequences, global MSA algorithms perform better than local ones in many cases, while local ones perform better than global ones when some sequences have long insertions or deletions (indels) relative to others. Many recent leading MSA algorithms have incorporated pairwise alignment information obtained from a mixture of sources into their scoring system to improve accuracy of alignment containing long indels. Results We propose a novel group-to-group sequence alignment algorithm that uses a piecewise linear gap cost. We developed a program called PRIME, which employs our proposed algorithm to optimize the well-defined sum-of-pairs score. PRIME stands for Profile-based Randomized Iteration MEthod. We evaluated PRIME and some recent MSA programs using BAliBASE version 3.0 and PREFAB version 4.0 benchmarks. The results of benchmark tests showed that PRIME can construct accurate alignments comparable to the most accurate programs currently available, including L-INS-i of MAFFT, ProbCons, and T-Coffee. Conclusion PRIME enables users to construct accurate alignments without having to employ pairwise alignment information. PRIME is available at . PMID:17137519

  13. Centroid Detector Assembly for the AXAF-I Alignment Test System

    NASA Technical Reports Server (NTRS)

    Glenn, Paul

    1995-01-01

    The High Resolution Mirror Assembly (HRMA) of the Advanced X-ray Astrophysics Facility (imaging) (AXAF-I) consists of four nested paraboloids and four nested hyperboloids, all of meter-class size, and all of which are to be assembled and aligned in a special 15 meter tower at Eastman Kodak Company in Rochester, NY. The goals of the alignment are (1) to make the images of the four telescopes coincident; (2) to remove coma from each image individually; and (3) to control and determine the final position of the composite focus. This will be accomplished by the HRMA Aligment Test System (HATS) which is essentially a scanning Hartmann test system. The scanning laser source and the focal plane of the HATS are part of the Centroid Detector Assembly (CDA) which also includes processing electronics and software. In this paper we discuss the design and the measured performance of the CDA.

  14. A global optimization algorithm for protein surface alignment

    PubMed Central

    2010-01-01

    Background A relevant problem in drug design is the comparison and recognition of protein binding sites. Binding sites recognition is generally based on geometry often combined with physico-chemical properties of the site since the conformation, size and chemical composition of the protein surface are all relevant for the interaction with a specific ligand. Several matching strategies have been designed for the recognition of protein-ligand binding sites and of protein-protein interfaces but the problem cannot be considered solved. Results In this paper we propose a new method for local structural alignment of protein surfaces based on continuous global optimization techniques. Given the three-dimensional structures of two proteins, the method finds the isometric transformation (rotation plus translation) that best superimposes active regions of two structures. We draw our inspiration from the well-known Iterative Closest Point (ICP) method for three-dimensional (3D) shapes registration. Our main contribution is in the adoption of a controlled random search as a more efficient global optimization approach along with a new dissimilarity measure. The reported computational experience and comparison show viability of the proposed approach. Conclusions Our method performs well to detect similarity in binding sites when this in fact exists. In the future we plan to do a more comprehensive evaluation of the method by considering large datasets of non-redundant proteins and applying a clustering technique to the results of all comparisons to classify binding sites. PMID:20920230

  15. Introduction of a distance cut-off into structural alignment by the double dynamic programming algorithm.

    PubMed

    Toh, H

    1997-08-01

    Two approximations were introduced into the double dynamic programming algorithm, in order to reduce the computational time for structural alignment. One of them was the so-called distance cut-off, which approximately describes the structural environment of each residue by its local environment. In the approximation, a sphere with a given radius is placed at the center of the side chain of each residue. The local environment of a residue is constituted only by the residues with side chain centers that are present within the sphere, which is expressed by a set of center-to-center distances from the side chain of the residue to those of all the other constituent residues. The residues outside the sphere are neglected from the local environment. Another approximation is associated with the distance cut-off, which is referred to here as the delta N cut-off. If two local environments are similar to each other, the numbers of residues constituting the environments are expected to be similar. The delta N cut-off was introduced based on the idea. If the difference between the numbers of the constituent residues of two local environments is greater than a given threshold value, delta N, the evaluation of the similarity between the local environments is skipped. The introduction of the two approximations dramatically reduced the computational time for structural alignment by the double dynamic programming algorithm. However, the approximations also decreased the accuracy of the alignment. To improve the accuracy with the approximations, a program with a two-step alignment algorithm was constructed. At first, an alignment was roughly constructed with the approximations. Then, the epsilon-suboptimal region for the alignment was determined. Finally, the double dynamic programming algorithm with full structural environments was applied to the residue pairs within the epsilon-suboptimal region to produce an improved alignment.

  16. Low complexity interference alignment algorithms for desired signal power maximization problem of MIMO channels

    NASA Astrophysics Data System (ADS)

    Sun, Cong; Yang, Yunchuan; Yuan, Yaxiang

    2012-12-01

    In this article, we investigate the interference alignment (IA) solution for a K-user MIMO interference channel. Proper users' precoders and decoders are designed through a desired signal power maximization model with IA conditions as constraints, which forms a complex matrix optimization problem. We propose two low complexity algorithms, both of which apply the Courant penalty function technique to combine the leakage interference and the desired signal power together as the new objective function. The first proposed algorithm is the modified alternating minimization algorithm (MAMA), where each subproblem has closed-form solution with an eigenvalue decomposition. To further reduce algorithm complexity, we propose a hybrid algorithm which consists of two parts. As the first part, the algorithm iterates with Householder transformation to preserve the orthogonality of precoders and decoders. In each iteration, the matrix optimization problem is considered in a sequence of 2D subspaces, which leads to one dimensional optimization subproblems. From any initial point, this algorithm obtains precoders and decoders with low leakage interference in short time. In the second part, to exploit the advantage of MAMA, it continues to iterate to perfectly align the interference from the output point of the first part. Analysis shows that in one iteration generally both proposed two algorithms have lower computational complexity than the existed maximum signal power (MSP) algorithm, and the hybrid algorithm enjoys lower complexity than MAMA. Simulations reveal that both proposed algorithms achieve similar performances as the MSP algorithm with less executing time, and show better performances than the existed alternating minimization algorithm in terms of sum rate. Besides, from the view of convergence rate, simulation results show that the MAMA enjoys fastest speed with respect to a certain sum rate value, while hybrid algorithm converges fastest to eliminate interference.

  17. SMETANA: Accurate and Scalable Algorithm for Probabilistic Alignment of Large-Scale Biological Networks

    PubMed Central

    Sahraeian, Sayed Mohammad Ebrahim; Yoon, Byung-Jun

    2013-01-01

    In this paper we introduce an efficient algorithm for alignment of multiple large-scale biological networks. In this scheme, we first compute a probabilistic similarity measure between nodes that belong to different networks using a semi-Markov random walk model. The estimated probabilities are further enhanced by incorporating the local and the cross-species network similarity information through the use of two different types of probabilistic consistency transformations. The transformed alignment probabilities are used to predict the alignment of multiple networks based on a greedy approach. We demonstrate that the proposed algorithm, called SMETANA, outperforms many state-of-the-art network alignment techniques, in terms of computational efficiency, alignment accuracy, and scalability. Our experiments show that SMETANA can easily align tens of genome-scale networks with thousands of nodes on a personal computer without any difficulty. The source code of SMETANA is available upon request. The source code of SMETANA can be downloaded from http://www.ece.tamu.edu/~bjyoon/SMETANA/. PMID:23874484

  18. A distributed Canny edge detector: algorithm and FPGA implementation.

    PubMed

    Xu, Qian; Varadarajan, Srenivas; Chakrabarti, Chaitali; Karam, Lina J

    2014-07-01

    The Canny edge detector is one of the most widely used edge detection algorithms due to its superior performance. Unfortunately, not only is it computationally more intensive as compared with other edge detection algorithms, but it also has a higher latency because it is based on frame-level statistics. In this paper, we propose a mechanism to implement the Canny algorithm at the block level without any loss in edge detection performance compared with the original frame-level Canny algorithm. Directly applying the original Canny algorithm at the block-level leads to excessive edges in smooth regions and to loss of significant edges in high-detailed regions since the original Canny computes the high and low thresholds based on the frame-level statistics. To solve this problem, we present a distributed Canny edge detection algorithm that adaptively computes the edge detection thresholds based on the block type and the local distribution of the gradients in the image block. In addition, the new algorithm uses a nonuniform gradient magnitude histogram to compute block-based hysteresis thresholds. The resulting block-based algorithm has a significantly reduced latency and can be easily integrated with other block-based image codecs. It is capable of supporting fast edge detection of images and videos with high resolutions, including full-HD since the latency is now a function of the block size instead of the frame size. In addition, quantitative conformance evaluations and subjective tests show that the edge detection performance of the proposed algorithm is better than the original frame-based algorithm, especially when noise is present in the images. Finally, this algorithm is implemented using a 32 computing engine architecture and is synthesized on the Xilinx Virtex-5 FPGA. The synthesized architecture takes only 0.721 ms (including the SRAM READ/WRITE time and the computation time) to detect edges of 512 × 512 images in the USC SIPI database when clocked at 100

  19. A distributed Canny edge detector: algorithm and FPGA implementation.

    PubMed

    Xu, Qian; Varadarajan, Srenivas; Chakrabarti, Chaitali; Karam, Lina J

    2014-07-01

    The Canny edge detector is one of the most widely used edge detection algorithms due to its superior performance. Unfortunately, not only is it computationally more intensive as compared with other edge detection algorithms, but it also has a higher latency because it is based on frame-level statistics. In this paper, we propose a mechanism to implement the Canny algorithm at the block level without any loss in edge detection performance compared with the original frame-level Canny algorithm. Directly applying the original Canny algorithm at the block-level leads to excessive edges in smooth regions and to loss of significant edges in high-detailed regions since the original Canny computes the high and low thresholds based on the frame-level statistics. To solve this problem, we present a distributed Canny edge detection algorithm that adaptively computes the edge detection thresholds based on the block type and the local distribution of the gradients in the image block. In addition, the new algorithm uses a nonuniform gradient magnitude histogram to compute block-based hysteresis thresholds. The resulting block-based algorithm has a significantly reduced latency and can be easily integrated with other block-based image codecs. It is capable of supporting fast edge detection of images and videos with high resolutions, including full-HD since the latency is now a function of the block size instead of the frame size. In addition, quantitative conformance evaluations and subjective tests show that the edge detection performance of the proposed algorithm is better than the original frame-based algorithm, especially when noise is present in the images. Finally, this algorithm is implemented using a 32 computing engine architecture and is synthesized on the Xilinx Virtex-5 FPGA. The synthesized architecture takes only 0.721 ms (including the SRAM READ/WRITE time and the computation time) to detect edges of 512 × 512 images in the USC SIPI database when clocked at 100

  20. Assessing Activity Pattern Similarity with Multidimensional Sequence Alignment based on a Multiobjective Optimization Evolutionary Algorithm

    PubMed Central

    Kwan, Mei-Po; Xiao, Ningchuan; Ding, Guoxiang

    2015-01-01

    Due to the complexity and multidimensional characteristics of human activities, assessing the similarity of human activity patterns and classifying individuals with similar patterns remains highly challenging. This paper presents a new and unique methodology for evaluating the similarity among individual activity patterns. It conceptualizes multidimensional sequence alignment (MDSA) as a multiobjective optimization problem, and solves this problem with an evolutionary algorithm. The study utilizes sequence alignment to code multiple facets of human activities into multidimensional sequences, and to treat similarity assessment as a multiobjective optimization problem that aims to minimize the alignment cost for all dimensions simultaneously. A multiobjective optimization evolutionary algorithm (MOEA) is used to generate a diverse set of optimal or near-optimal alignment solutions. Evolutionary operators are specifically designed for this problem, and a local search method also is incorporated to improve the search ability of the algorithm. We demonstrate the effectiveness of our method by comparing it with a popular existing method called ClustalG using a set of 50 sequences. The results indicate that our method outperforms the existing method for most of our selected cases. The multiobjective evolutionary algorithm presented in this paper provides an effective approach for assessing activity pattern similarity, and a foundation for identifying distinctive groups of individuals with similar activity patterns. PMID:26190858

  1. Genetic Algorithm Phase Retrieval for the Systematic Image-Based Optical Alignment Testbed

    NASA Technical Reports Server (NTRS)

    Rakoczy, John; Steincamp, James; Taylor, Jaime

    2003-01-01

    A reduced surrogate, one point crossover genetic algorithm with random rank-based selection was used successfully to estimate the multiple phases of a segmented optical system modeled on the seven-mirror Systematic Image-Based Optical Alignment testbed located at NASA's Marshall Space Flight Center.

  2. Review of alignment and SNP calling algorithms for next-generation sequencing data.

    PubMed

    Mielczarek, M; Szyda, J

    2016-02-01

    Application of the massive parallel sequencing technology has become one of the most important issues in life sciences. Therefore, it was crucial to develop bioinformatics tools for next-generation sequencing (NGS) data processing. Currently, two of the most significant tasks include alignment to a reference genome and detection of single nucleotide polymorphisms (SNPs). In many types of genomic analyses, great numbers of reads need to be mapped to the reference genome; therefore, selection of the aligner is an essential step in NGS pipelines. Two main algorithms-suffix tries and hash tables-have been introduced for this purpose. Suffix array-based aligners are memory-efficient and work faster than hash-based aligners, but they are less accurate. In contrast, hash table algorithms tend to be slower, but more sensitive. SNP and genotype callers may also be divided into two main different approaches: heuristic and probabilistic methods. A variety of software has been subsequently developed over the past several years. In this paper, we briefly review the current development of NGS data processing algorithms and present the available software.

  3. ChromAlign: A two-step algorithmic procedure for time alignment of three-dimensional LC-MS chromatographic surfaces.

    PubMed

    Sadygov, Rovshan G; Maroto, Fernando Martin; Hühmer, Andreas F R

    2006-12-15

    We present an algorithmic approach to align three-dimensional chromatographic surfaces of LC-MS data of complex mixture samples. The approach consists of two steps. In the first step, we prealign chromatographic profiles: two-dimensional projections of chromatographic surfaces. This is accomplished by correlation analysis using fast Fourier transforms. In this step, a temporal offset that maximizes the overlap and dot product between two chromatographic profiles is determined. In the second step, the algorithm generates correlation matrix elements between full mass scans of the reference and sample chromatographic surfaces. The temporal offset from the first step indicates a range of the mass scans that are possibly correlated, then the correlation matrix is calculated only for these mass scans. The correlation matrix carries information on highly correlated scans, but it does not itself determine the scan or time alignment. Alignment is determined as a path in the correlation matrix that maximizes the sum of the correlation matrix elements. The computational complexity of the optimal path generation problem is reduced by the use of dynamic programming. The program produces time-aligned surfaces. The use of the temporal offset from the first step in the second step reduces the computation time for generating the correlation matrix and speeds up the process. The algorithm has been implemented in a program, ChromAlign, developed in C++ language for the .NET2 environment in WINDOWS XP. In this work, we demonstrate the applications of ChromAlign to alignment of LC-MS surfaces of several datasets: a mixture of known proteins, samples from digests of surface proteins of T-cells, and samples prepared from digests of cerebrospinal fluid. ChromAlign accurately aligns the LC-MS surfaces we studied. In these examples, we discuss various aspects of the alignment by ChromAlign, such as constant time axis shifts and warping of chromatographic surfaces.

  4. Evaluation of Laser Based Alignment Algorithms Under Additive Random and Diffraction Noise

    SciTech Connect

    McClay, W A; Awwal, A; Wilhelmsen, K; Ferguson, W; McGee, M; Miller, M

    2004-09-30

    The purpose of the automatic alignment algorithm at the National Ignition Facility (NIF) is to determine the position of a laser beam based on the position of beam features from video images. The position information obtained is used to command motors and attenuators to adjust the beam lines to the desired position, which facilitates the alignment of all 192 beams. One of the goals of the algorithm development effort is to ascertain the performance, reliability, and uncertainty of the position measurement. This paper describes a method of evaluating the performance of algorithms using Monte Carlo simulation. In particular we show the application of this technique to the LM1{_}LM3 algorithm, which determines the position of a series of two beam light sources. The performance of the algorithm was evaluated for an ensemble of over 900 simulated images with varying image intensities and noise counts, as well as varying diffraction noise amplitude and frequency. The performance of the algorithm on the image data set had a tolerance well beneath the 0.5-pixel system requirement.

  5. Application of a clustering-based peak alignment algorithm to analyze various DNA fingerprinting data.

    PubMed

    Ishii, Satoshi; Kadota, Koji; Senoo, Keishi

    2009-09-01

    DNA fingerprinting analysis such as amplified ribosomal DNA restriction analysis (ARDRA), repetitive extragenic palindromic PCR (rep-PCR), ribosomal intergenic spacer analysis (RISA), and denaturing gradient gel electrophoresis (DGGE) are frequently used in various fields of microbiology. The major difficulty in DNA fingerprinting data analysis is the alignment of multiple peak sets. We report here an R program for a clustering-based peak alignment algorithm, and its application to analyze various DNA fingerprinting data, such as ARDRA, rep-PCR, RISA, and DGGE data. The results obtained by our clustering algorithm and by BioNumerics software showed high similarity. Since several R packages have been established to statistically analyze various biological data, the distance matrix obtained by our R program can be used for subsequent statistical analyses, some of which were not previously performed but are useful in DNA fingerprinting studies.

  6. Multiple sequence alignment based on combining genetic algorithm with chaotic sequences.

    PubMed

    Gao, C; Wang, B; Zhou, C J; Zhang, Q

    2016-01-01

    In bioinformatics, sequence alignment is one of the most common problems. Multiple sequence alignment is an NP (nondeterministic polynomial time) problem, which requires further study and exploration. The chaos optimization algorithm is a type of chaos theory, and a procedure for combining the genetic algorithm (GA), which uses ergodicity, and inherent randomness of chaotic iteration. It is an efficient method to solve the basic premature phenomenon of the GA. Applying the Logistic map to the GA and using chaotic sequences to carry out the chaotic perturbation can improve the convergence of the basic GA. In addition, the random tournament selection and optimal preservation strategy are used in the GA. Experimental evidence indicates good results for this process. PMID:27420977

  7. Multiple sequence alignment based on combining genetic algorithm with chaotic sequences.

    PubMed

    Gao, C; Wang, B; Zhou, C J; Zhang, Q

    2016-06-24

    In bioinformatics, sequence alignment is one of the most common problems. Multiple sequence alignment is an NP (nondeterministic polynomial time) problem, which requires further study and exploration. The chaos optimization algorithm is a type of chaos theory, and a procedure for combining the genetic algorithm (GA), which uses ergodicity, and inherent randomness of chaotic iteration. It is an efficient method to solve the basic premature phenomenon of the GA. Applying the Logistic map to the GA and using chaotic sequences to carry out the chaotic perturbation can improve the convergence of the basic GA. In addition, the random tournament selection and optimal preservation strategy are used in the GA. Experimental evidence indicates good results for this process.

  8. A probabilistic coding based quantum genetic algorithm for multiple sequence alignment.

    PubMed

    Huo, Hongwei; Xie, Qiaoluan; Shen, Xubang; Stojkovic, Vojislav

    2008-01-01

    This paper presents an original Quantum Genetic algorithm for Multiple sequence ALIGNment (QGMALIGN) that combines a genetic algorithm and a quantum algorithm. A quantum probabilistic coding is designed for representing the multiple sequence alignment. A quantum rotation gate as a mutation operator is used to guide the quantum state evolution. Six genetic operators are designed on the coding basis to improve the solution during the evolutionary process. The features of implicit parallelism and state superposition in quantum mechanics and the global search capability of the genetic algorithm are exploited to get efficient computation. A set of well known test cases from BAliBASE2.0 is used as reference to evaluate the efficiency of the QGMALIGN optimization. The QGMALIGN results have been compared with the most popular methods (CLUSTALX, SAGA, DIALIGN, SB_PIMA, and QGMALIGN) results. The QGMALIGN results show that QGMALIGN performs well on the presenting biological data. The addition of genetic operators to the quantum algorithm lowers the cost of overall running time.

  9. Experimental Results in the Comparison of Search Algorithms Used with Room Temperature Detectors

    SciTech Connect

    Guss, P., Yuan, D., Cutler, M., Beller, D.

    2010-11-01

    Analysis of time sequence data was run for several higher resolution scintillation detectors using a variety of search algorithms, and results were obtained in predicting the relative performance for these detectors, which included a slightly superior performance by CeBr{sub 3}. Analysis of several search algorithms shows that inclusion of the RSPRT methodology can improve sensitivity.

  10. Phase Retrieval Using a Genetic Algorithm on the Systematic Image-Based Optical Alignment Testbed

    NASA Technical Reports Server (NTRS)

    Taylor, Jaime R.

    2003-01-01

    NASA s Marshall Space Flight Center s Systematic Image-Based Optical Alignment (SIBOA) Testbed was developed to test phase retrieval algorithms and hardware techniques. Individuals working with the facility developed the idea of implementing phase retrieval by breaking the determination of the tip/tilt of each mirror apart from the piston motion (or translation) of each mirror. Presented in this report is an algorithm that determines the optimal phase correction associated only with the piston motion of the mirrors. A description of the Phase Retrieval problem is first presented. The Systematic Image-Based Optical Alignment (SIBOA) Testbeb is then described. A Discrete Fourier Transform (DFT) is necessary to transfer the incoming wavefront (or estimate of phase error) into the spatial frequency domain to compare it with the image. A method for reducing the DFT to seven scalar/matrix multiplications is presented. A genetic algorithm is then used to search for the phase error. The results of this new algorithm on a test problem are presented.

  11. Evaluation of GMI and PMI diffeomorphic-based demons algorithms for aligning PET and CT Images.

    PubMed

    Yang, Juan; Wang, Hongjun; Zhang, You; Yin, Yong

    2015-01-01

    Fusion of anatomic information in computed tomography (CT) and functional information in 18F-FDG positron emission tomography (PET) is crucial for accurate differentiation of tumor from benign masses, designing radiotherapy treatment plan and staging of cancer. Although current PET and CT images can be acquired from combined 18F-FDG PET/CT scanner, the two acquisitions are scanned separately and take a long time, which may induce potential positional errors in global and local caused by respiratory motion or organ peristalsis. So registration (alignment) of whole-body PET and CT images is a prerequisite for their meaningful fusion. The purpose of this study was to assess the performance of two multimodal registration algorithms for aligning PET and CT images. The proposed gradient of mutual information (GMI)-based demons algorithm, which incorporated the GMI between two images as an external force to facilitate the alignment, was compared with the point-wise mutual information (PMI) diffeomorphic-based demons algorithm whose external force was modified by replacing the image intensity difference in diffeomorphic demons algorithm with the PMI to make it appropriate for multimodal image registration. Eight patients with esophageal cancer(s) were enrolled in this IRB-approved study. Whole-body PET and CT images were acquired from a combined 18F-FDG PET/CT scanner for each patient. The modified Hausdorff distance (d(MH)) was used to evaluate the registration accuracy of the two algorithms. Of all patients, the mean values and standard deviations (SDs) of d(MH) were 6.65 (± 1.90) voxels and 6.01 (± 1.90) after the GMI-based demons and the PMI diffeomorphic-based demons registration algorithms respectively. Preliminary results on oncological patients showed that the respiratory motion and organ peristalsis in PET/CT esophageal images could not be neglected, although a combined 18F-FDG PET/CT scanner was used for image acquisition. The PMI diffeomorphic-based demons

  12. Alignment, segmentation and 3-D reconstruction of serial sections based on automated algorithm

    NASA Astrophysics Data System (ADS)

    Bian, Weiguo; Tang, Shaojie; Xu, Qiong; Lian, Qin; Wang, Jin; Li, Dichen

    2012-12-01

    A well-defined three-dimensional (3-D) reconstruction of bone-cartilage transitional structures is crucial for the osteochondral restoration. This paper presents an accurate, computationally efficient and fully-automated algorithm for the alignment and segmentation of two-dimensional (2-D) serial to construct the 3-D model of bone-cartilage transitional structures. Entire system includes the following five components: (1) image harvest, (2) image registration, (3) image segmentation, (4) 3-D reconstruction and visualization, and (5) evaluation. A computer program was developed in the environment of Matlab for the automatic alignment and segmentation of serial sections. Automatic alignment algorithm based on the position's cross-correlation of the anatomical characteristic feature points of two sequential sections. A method combining an automatic segmentation and an image threshold processing was applied to capture the regions and structures of interest. SEM micrograph and 3-D model reconstructed directly in digital microscope were used to evaluate the reliability and accuracy of this strategy. The morphology of 3-D model constructed by serial sections is consistent with the results of SEM micrograph and 3-D model of digital microscope.

  13. Successive approximation algorithm for beam-position-monitor-based LHC collimator alignment

    NASA Astrophysics Data System (ADS)

    Valentino, Gianluca; Nosych, Andriy A.; Bruce, Roderik; Gasior, Marek; Mirarchi, Daniele; Redaelli, Stefano; Salvachua, Belen; Wollmann, Daniel

    2014-02-01

    Collimators with embedded beam position monitor (BPM) button electrodes will be installed in the Large Hadron Collider (LHC) during the current long shutdown period. For the subsequent operation, BPMs will allow the collimator jaws to be kept centered around the beam orbit. In this manner, a better beam cleaning efficiency and machine protection can be provided at unprecedented higher beam energies and intensities. A collimator alignment algorithm is proposed to center the jaws automatically around the beam. The algorithm is based on successive approximation and takes into account a correction of the nonlinear BPM sensitivity to beam displacement and an asymmetry of the electronic channels processing the BPM electrode signals. A software implementation was tested with a prototype collimator in the Super Proton Synchrotron. This paper presents results of the tests along with some considerations for eventual operation in the LHC.

  14. Alignment of three-dimensional molecules using an image recognition algorithm.

    PubMed

    Richmond, Nicola J; Willett, Peter; Clark, Robert D

    2004-10-01

    This paper describes a novel approach, based on image recognition in two dimensions, for the atom-based alignment of two rigid molecules in three dimensions. The atoms are characterised by their partial charges and their positions relative to the remaining atoms in the molecule. Based on this information, a cost of matching a pair of atoms, one from each molecule, is assigned to all possible pairs. A preliminary set of intermolecular atom equivalences that minimises the total atom matching cost is then determined using an algorithm for solving the linear assignment problem. Several geometric heuristics are described that aim to reduce the number of atom equivalences that are inconsistent with the 3D structures. Those that remain are used to calculate an alignment transformation that achieves an optimal superposition of atoms that have a similar local geometry and partial charge. This alignment is then refined by calculating a new set of equivalences consisting of atom pairs that are approximately overlaid, irrespective of partial charge. A range of examples is provided to demonstrate the efficiency and effectiveness of the method.

  15. QuickProbs—A Fast Multiple Sequence Alignment Algorithm Designed for Graphics Processors

    PubMed Central

    Gudyś, Adam; Deorowicz, Sebastian

    2014-01-01

    Multiple sequence alignment is a crucial task in a number of biological analyses like secondary structure prediction, domain searching, phylogeny, etc. MSAProbs is currently the most accurate alignment algorithm, but its effectiveness is obtained at the expense of computational time. In the paper we present QuickProbs, the variant of MSAProbs customised for graphics processors. We selected the two most time consuming stages of MSAProbs to be redesigned for GPU execution: the posterior matrices calculation and the consistency transformation. Experiments on three popular benchmarks (BAliBASE, PREFAB, OXBench-X) on quad-core PC equipped with high-end graphics card show QuickProbs to be 5.7 to 9.7 times faster than original CPU-parallel MSAProbs. Additional tests performed on several protein families from Pfam database give overall speed-up of 6.7. Compared to other algorithms like MAFFT, MUSCLE, or ClustalW, QuickProbs proved to be much more accurate at similar speed. Additionally we introduce a tuned variant of QuickProbs which is significantly more accurate on sets of distantly related sequences than MSAProbs without exceeding its computation time. The GPU part of QuickProbs was implemented in OpenCL, thus the package is suitable for graphics processors produced by all major vendors. PMID:24586435

  16. Search algorithm complexity modeling with application to image alignment and matching

    NASA Astrophysics Data System (ADS)

    DelMarco, Stephen

    2014-05-01

    Search algorithm complexity modeling, in the form of penetration rate estimation, provides a useful way to estimate search efficiency in application domains which involve searching over a hypothesis space of reference templates or models, as in model-based object recognition, automatic target recognition, and biometric recognition. The penetration rate quantifies the expected portion of the database that must be searched, and is useful for estimating search algorithm computational requirements. In this paper we perform mathematical modeling to derive general equations for penetration rate estimates that are applicable to a wide range of recognition problems. We extend previous penetration rate analyses to use more general probabilistic modeling assumptions. In particular we provide penetration rate equations within the framework of a model-based image alignment application domain in which a prioritized hierarchical grid search is used to rank subspace bins based on matching probability. We derive general equations, and provide special cases based on simplifying assumptions. We show how previously-derived penetration rate equations are special cases of the general formulation. We apply the analysis to model-based logo image alignment in which a hierarchical grid search is used over a geometric misalignment transform hypothesis space. We present numerical results validating the modeling assumptions and derived formulation.

  17. An algorithm for automatic crystal identification in pixelated scintillation detectors using thin plate splines and Gaussian mixture models.

    PubMed

    Schellenberg, Graham; Stortz, Greg; Goertzen, Andrew L

    2016-02-01

    A typical positron emission tomography detector is comprised of a scintillator crystal array coupled to a photodetector array or other position sensitive detector. Such detectors using light sharing to read out crystal elements require the creation of a crystal lookup table (CLUT) that maps the detector response to the crystal of interaction based on the x-y position of the event calculated through Anger-type logic. It is vital for system performance that these CLUTs be accurate so that the location of events can be accurately identified and so that crystal-specific corrections, such as energy windowing or time alignment, can be applied. While using manual segmentation of the flood image to create the CLUT is a simple and reliable approach, it is both tedious and time consuming for systems with large numbers of crystal elements. In this work we describe the development of an automated algorithm for CLUT generation that uses a Gaussian mixture model paired with thin plate splines (TPS) to iteratively fit a crystal layout template that includes the crystal numbering pattern. Starting from a region of stability, Gaussians are individually fit to data corresponding to crystal locations while simultaneously updating a TPS for predicting future Gaussian locations at the edge of a region of interest that grows as individual Gaussians converge to crystal locations. The algorithm was tested with flood image data collected from 16 detector modules, each consisting of a 409 crystal dual-layer offset LYSO crystal array readout by a 32 pixel SiPM array. For these detector flood images, depending on user defined input parameters, the algorithm runtime ranged between 17.5-82.5 s per detector on a single core of an Intel i7 processor. The method maintained an accuracy above 99.8% across all tests, with the majority of errors being localized to error prone corner regions. This method can be easily extended for use with other detector types through adjustment of the initial

  18. An algorithm for automatic crystal identification in pixelated scintillation detectors using thin plate splines and Gaussian mixture models

    NASA Astrophysics Data System (ADS)

    Schellenberg, Graham; Stortz, Greg; Goertzen, Andrew L.

    2016-02-01

    A typical positron emission tomography detector is comprised of a scintillator crystal array coupled to a photodetector array or other position sensitive detector. Such detectors using light sharing to read out crystal elements require the creation of a crystal lookup table (CLUT) that maps the detector response to the crystal of interaction based on the x-y position of the event calculated through Anger-type logic. It is vital for system performance that these CLUTs be accurate so that the location of events can be accurately identified and so that crystal-specific corrections, such as energy windowing or time alignment, can be applied. While using manual segmentation of the flood image to create the CLUT is a simple and reliable approach, it is both tedious and time consuming for systems with large numbers of crystal elements. In this work we describe the development of an automated algorithm for CLUT generation that uses a Gaussian mixture model paired with thin plate splines (TPS) to iteratively fit a crystal layout template that includes the crystal numbering pattern. Starting from a region of stability, Gaussians are individually fit to data corresponding to crystal locations while simultaneously updating a TPS for predicting future Gaussian locations at the edge of a region of interest that grows as individual Gaussians converge to crystal locations. The algorithm was tested with flood image data collected from 16 detector modules, each consisting of a 409 crystal dual-layer offset LYSO crystal array readout by a 32 pixel SiPM array. For these detector flood images, depending on user defined input parameters, the algorithm runtime ranged between 17.5-82.5 s per detector on a single core of an Intel i7 processor. The method maintained an accuracy above 99.8% across all tests, with the majority of errors being localized to error prone corner regions. This method can be easily extended for use with other detector types through adjustment of the initial

  19. Iterative most-likely point registration (IMLP): a robust algorithm for computing optimal shape alignment.

    PubMed

    Billings, Seth D; Boctor, Emad M; Taylor, Russell H

    2015-01-01

    We present a probabilistic registration algorithm that robustly solves the problem of rigid-body alignment between two shapes with high accuracy, by aptly modeling measurement noise in each shape, whether isotropic or anisotropic. For point-cloud shapes, the probabilistic framework additionally enables modeling locally-linear surface regions in the vicinity of each point to further improve registration accuracy. The proposed Iterative Most-Likely Point (IMLP) algorithm is formed as a variant of the popular Iterative Closest Point (ICP) algorithm, which iterates between point-correspondence and point-registration steps. IMLP's probabilistic framework is used to incorporate a generalized noise model into both the correspondence and the registration phases of the algorithm, hence its name as a most-likely point method rather than a closest-point method. To efficiently compute the most-likely correspondences, we devise a novel search strategy based on a principal direction (PD)-tree search. We also propose a new approach to solve the generalized total-least-squares (GTLS) sub-problem of the registration phase, wherein the point correspondences are registered under a generalized noise model. Our GTLS approach has improved accuracy, efficiency, and stability compared to prior methods presented for this problem and offers a straightforward implementation using standard least squares. We evaluate the performance of IMLP relative to a large number of prior algorithms including ICP, a robust variant on ICP, Generalized ICP (GICP), and Coherent Point Drift (CPD), as well as drawing close comparison with the prior anisotropic registration methods of GTLS-ICP and A-ICP. The performance of IMLP is shown to be superior with respect to these algorithms over a wide range of noise conditions, outliers, and misalignments using both mesh and point-cloud representations of various shapes.

  20. Iterative Most-Likely Point Registration (IMLP): A Robust Algorithm for Computing Optimal Shape Alignment

    PubMed Central

    Billings, Seth D.; Boctor, Emad M.; Taylor, Russell H.

    2015-01-01

    We present a probabilistic registration algorithm that robustly solves the problem of rigid-body alignment between two shapes with high accuracy, by aptly modeling measurement noise in each shape, whether isotropic or anisotropic. For point-cloud shapes, the probabilistic framework additionally enables modeling locally-linear surface regions in the vicinity of each point to further improve registration accuracy. The proposed Iterative Most-Likely Point (IMLP) algorithm is formed as a variant of the popular Iterative Closest Point (ICP) algorithm, which iterates between point-correspondence and point-registration steps. IMLP’s probabilistic framework is used to incorporate a generalized noise model into both the correspondence and the registration phases of the algorithm, hence its name as a most-likely point method rather than a closest-point method. To efficiently compute the most-likely correspondences, we devise a novel search strategy based on a principal direction (PD)-tree search. We also propose a new approach to solve the generalized total-least-squares (GTLS) sub-problem of the registration phase, wherein the point correspondences are registered under a generalized noise model. Our GTLS approach has improved accuracy, efficiency, and stability compared to prior methods presented for this problem and offers a straightforward implementation using standard least squares. We evaluate the performance of IMLP relative to a large number of prior algorithms including ICP, a robust variant on ICP, Generalized ICP (GICP), and Coherent Point Drift (CPD), as well as drawing close comparison with the prior anisotropic registration methods of GTLS-ICP and A-ICP. The performance of IMLP is shown to be superior with respect to these algorithms over a wide range of noise conditions, outliers, and misalignments using both mesh and point-cloud representations of various shapes. PMID:25748700

  1. FastDIRC: a fast Monte Carlo and reconstruction algorithm for DIRC detectors

    NASA Astrophysics Data System (ADS)

    Hardin, J.; Williams, M.

    2016-10-01

    FastDIRC is a novel fast Monte Carlo and reconstruction algorithm for DIRC detectors. A DIRC employs rectangular fused-silica bars both as Cherenkov radiators and as light guides. Cherenkov-photon imaging and time-of-propagation information are utilized by a DIRC to identify charged particles. GEANT4-based DIRC Monte Carlo simulations are extremely CPU intensive. The FastDIRC algorithm permits fully simulating a DIRC detector more than 10 000 times faster than using GEANT4. This facilitates designing a DIRC-reconstruction algorithm that improves the Cherenkov-angle resolution of a DIRC detector by ≈ 30% compared to existing algorithms. FastDIRC also greatly reduces the time required to study competing DIRC-detector designs.

  2. Adaptive Waveform Correlation Detectors for Arrays: Algorithms for Autonomous Calibration

    SciTech Connect

    Ringdal, F; Harris, D B; Dodge, D; Gibbons, S J

    2009-07-23

    Waveform correlation detectors compare a signal template with successive windows of a continuous data stream and report a detection when the correlation coefficient, or some comparable detection statistic, exceeds a specified threshold. Since correlation detectors exploit the fine structure of the full waveform, they are exquisitely sensitive when compared to power (STA/LTA) detectors. The drawback of correlation detectors is that they require complete knowledge of the signal to be detected, which limits such methods to instances of seismicity in which a very similar signal has already been observed by every station used. Such instances include earthquake swarms, aftershock sequences, repeating industrial seismicity, and many other forms of controlled explosions. The reduction in the detection threshold is even greater when the techniques are applied to arrays since stacking can be performed on the individual channel correlation traces to achieve significant array gain. In previous years we have characterized the decrease in detection threshold afforded by correlation detection across an array or network when observations of a previous event provide an adequate template for signals from subsequent events located near the calibration event. Last year we examined two related issues: (1) the size of the source region calibration footprint afforded by a master event, and (2) the use of temporally incoherent detectors designed to detect the gross envelope structure of the signal to extend the footprint. In Case 1, results from the PETROBAR-1 marine refraction profile indicated that array correlation gain was usable at inter-source separations out to one or two wavelengths. In Case 2, we found that incoherent detectors developed from a magnitude 6 event near Svalbard were successful at detecting aftershocks where correlation detectors derived from individual aftershocks were not. Incoherent detectors might provide 'seed' events for correlation detectors that then could

  3. Conception and design of a control and monitoring system for the mirror alignment of the CBM RICH detector

    NASA Astrophysics Data System (ADS)

    Bendarouach, J.

    2016-08-01

    The Compressed Baryonic Matter (CBM) experiment at the future Facility for Anti-proton and Ion Research (FAIR) complex will investigate the phase diagram of strongly interacting matter at high baryon density and moderate temperatures created in A+A collisions. For the SIS100 accelerator, the foreseen beam energy will range up to 11 AGeV for the heaviest nuclei. One of the key detector components required for the CBM physics program is the Ring Imaging CHerenkov (RICH) detector, which is developed for efficient and clean electron identification and pion suppression. An important aspect to guarantee a stable operation of the RICH detector is the alignment of the mirrors. A qualitative alignment control procedure for the mirror system has been implemented in the CBM RICH prototype detector and tested under real conditions at the CERN PS/T9 beamline. Collected data and results of image processing are reviewed and discussed. In parallel a quantitative method using recorded data has also been employed to compute mirror displacements of the RICH mirrors. Results based on simulated events and the limits of the method are presented and discussed as well. If mirror misalignment is detected, it can be subsequently included and rectified by correction routines. A first correction routine is presented and a comparison between misaligned, corrected and ideal geometries is shown.

  4. Genetic algorithm based fast alignment method for strap-down inertial navigation system with large azimuth misalignment.

    PubMed

    He, Hongyang; Xu, Jiangning; Qin, Fangjun; Li, Feng

    2015-11-01

    In order to shorten the alignment time and eliminate the small initial misalignment limit for compass alignment of strap-down inertial navigation system (SINS), which is sometimes not easy to satisfy when the ship is moored or anchored, an optimal model based time-varying parameter compass alignment algorithm is proposed in this paper. The contributions of the work presented here are twofold. First, the optimization of compass alignment parameters, which involves a lot of trial-and-error traditionally, is achieved based on genetic algorithm. On this basis, second, the optimal parameter varying model is established by least-square polynomial fitting. Experiments are performed with a navigational grade fiber optical gyroscope SINS, which validate the efficiency of the proposed method. PMID:26628165

  5. Genetic algorithm based fast alignment method for strap-down inertial navigation system with large azimuth misalignment

    NASA Astrophysics Data System (ADS)

    He, Hongyang; Xu, Jiangning; Qin, Fangjun; Li, Feng

    2015-11-01

    In order to shorten the alignment time and eliminate the small initial misalignment limit for compass alignment of strap-down inertial navigation system (SINS), which is sometimes not easy to satisfy when the ship is moored or anchored, an optimal model based time-varying parameter compass alignment algorithm is proposed in this paper. The contributions of the work presented here are twofold. First, the optimization of compass alignment parameters, which involves a lot of trial-and-error traditionally, is achieved based on genetic algorithm. On this basis, second, the optimal parameter varying model is established by least-square polynomial fitting. Experiments are performed with a navigational grade fiber optical gyroscope SINS, which validate the efficiency of the proposed method.

  6. Genetic Algorithm Phase Retrieval for the Systematic Image-Based Optical Alignment Testbed

    NASA Technical Reports Server (NTRS)

    Taylor, Jaime; Rakoczy, John; Steincamp, James

    2003-01-01

    Phase retrieval requires calculation of the real-valued phase of the pupil fimction from the image intensity distribution and characteristics of an optical system. Genetic 'algorithms were used to solve two one-dimensional phase retrieval problem. A GA successfully estimated the coefficients of a polynomial expansion of the phase when the number of coefficients was correctly specified. A GA also successfully estimated the multiple p h e s of a segmented optical system analogous to the seven-mirror Systematic Image-Based Optical Alignment (SIBOA) testbed located at NASA s Marshall Space Flight Center. The SIBOA testbed was developed to investigate phase retrieval techniques. Tiphilt and piston motions of the mirrors accomplish phase corrections. A constant phase over each mirror can be achieved by an independent tip/tilt correction: the phase Conection term can then be factored out of the Discrete Fourier Tranform (DFT), greatly reducing computations.

  7. Deblurring algorithms accounting for the finite detector size in photoacoustic tomography.

    PubMed

    Roitner, Heinz; Haltmeier, Markus; Nuster, Robert; O'Leary, Dianne P; Berer, Thomas; Paltauf, Guenther; Grün, Hubert; Burgholzer, Peter

    2014-05-01

    Most reconstruction algorithms for photoacoustic tomography, like back projection or time reversal, work ideally for point-like detectors. For real detectors, which integrate the pressure over their finite size, images reconstructed by these algorithms show some blurring. Iterative reconstruction algorithms using an imaging matrix can take the finite size of real detectors directly into account, but the numerical effort is significantly higher compared to the use of direct algorithms. For spherical or cylindrical detection surfaces, the blurring caused by a finite detector size is proportional to the distance from the rotation center (spin blur) and is equal to the detector size at the detection surface. In this work, we apply deconvolution algorithms to reduce this type of blurring on simulated and on experimental data. Two particular deconvolution methods are compared, which both utilize the fact that a representation of the blurred image in polar coordinates decouples pixels at different radii from the rotation center. Experimental data have been obtained with a flat, rectangular piezoelectric detector measuring signals around a plastisol cylinder containing various small photoacoustic sources with variable distance from the center. Both simulated and experimental results demonstrate a nearly complete elimination of spin blur. PMID:24853146

  8. Alignment procedure for detector integration and characterization of the CaSSIS instrument onboard the TGO mission

    NASA Astrophysics Data System (ADS)

    De Sio, Antonio; Da Deppo, Vania; Gambicorti, Lisa; Gerber, Michael; Ziethe, Ruth; Cremonese, Gabriele; Thomas, Nicolas

    2016-07-01

    The Colour and Stereo Surface Imaging System (CaSSIS) is a high-resolution camera for the ESA ExoMars Trace Gas Orbiter mission launched in March 2016. CaSSIS is capable of acquiring color stereo images of features on the surface of Mars to better understand the processes related to trace gas emission. The optical configuration of CaSSIS is based on a three-mirror anastigmatic off-axis imager with a relay mirror; to attain telecentric features and to maintain compact the design, the relay mirror has power. The University of Bern had the task of detector integration and characterization of CaSSIS focal plane. An OGSE (Optical Ground Support Equipment) characterization facility was set up for this purpose. A pinhole, imaged through an off-axis paraboloidal mirror, is used to produce a collimated beam. In this work, the procedures to align the OGSE and to link together the positions of each optical element will be presented. A global Reference System (RS) has been defined using an optical cube placed on the optical bench (OB) and linked to gravity through its X component; this global RS is used to correlate the alignment of the optical components. The main steps to characterize the position of the object to that of the CaSSIS focal plane have been repeated to guide and to verify the operations performed during the alignment procedures. A calculation system has been designed to work on the optical setup and on the detector simultaneously, and to compute online the new position of the focus plane with respect to the detector. Final results will be shown and discussed.

  9. Performance improvements of wavelength-shifting-fiber neutron detectors using high-resolution positioning algorithms

    DOE PAGES

    Wang, C. L.

    2016-05-17

    On the basis of FluoroBancroft linear-algebraic method [S.B. Andersson, Opt. Exp. 16, 18714 (2008)] three highly-resolved positioning methodswere proposed for wavelength-shifting fiber (WLSF) neutron detectors. Using a Gaussian or exponential-decay light-response function (LRF), the non-linear relation of photon-number profiles vs. x-pixels was linearized and neutron positions were determined. The proposed algorithms give an average 0.03-0.08 pixel position error, much smaller than that (0.29 pixel) from a traditional maximum photon algorithm (MPA). The new algorithms result in better detector uniformity, less position misassignment (ghosting), better spatial resolution, and an equivalent or better instrument resolution in powder diffraction than the MPA. Moreover,more » these characters will facilitate broader applications of WLSF detectors at time-of-flight neutron powder diffraction beamlines, including single-crystal diffraction and texture analysis.« less

  10. Medical image reconstruction algorithm based on the geometric information between sensor detector and ROI

    NASA Astrophysics Data System (ADS)

    Ham, Woonchul; Song, Chulgyu; Lee, Kangsan; Roh, Seungkuk

    2016-05-01

    In this paper, we propose a new image reconstruction algorithm considering the geometric information of acoustic sources and senor detector and review the two-step reconstruction algorithm which was previously proposed based on the geometrical information of ROI(region of interest) considering the finite size of acoustic sensor element. In a new image reconstruction algorithm, not only mathematical analysis is very simple but also its software implementation is very easy because we don't need to use the FFT. We verify the effectiveness of the proposed reconstruction algorithm by showing the simulation results by using Matlab k-wave toolkit.

  11. Multipoint alignment monitoring with amorphous silicon position detectors in a complex light path

    NASA Astrophysics Data System (ADS)

    Alberdi, J.; Arce, P.; Barcala, J. M.; Calvo, E.; Ferrando, A.; Josa, M. I.; Molinero, A.; Navarrete, J.; Oller, J. C.; Yuste, C.; Calderón, A.; Gómez, G.; González-Sánchez, F. J.; Martínez-Rivero, C.; Matorras, F.; Rodrigo, T.; Ruiz-Árbol, P.; Sobrón, M.; Vila, I.; Virto, A. L.

    2010-12-01

    This document presents an application of the new generation of amorphous silicon position detecting (ASPD) sensors to multipoint alignment. Twelve units are monitored along a 20 m long laser beam, where the light path is deflected by 90° using a pentaprism.

  12. Human emotion detector based on genetic algorithm using lip features

    NASA Astrophysics Data System (ADS)

    Brown, Terrence; Fetanat, Gholamreza; Homaifar, Abdollah; Tsou, Brian; Mendoza-Schrock, Olga

    2010-04-01

    We predicted human emotion using a Genetic Algorithm (GA) based lip feature extractor from facial images to classify all seven universal emotions of fear, happiness, dislike, surprise, anger, sadness and neutrality. First, we isolated the mouth from the input images using special methods, such as Region of Interest (ROI) acquisition, grayscaling, histogram equalization, filtering, and edge detection. Next, the GA determined the optimal or near optimal ellipse parameters that circumvent and separate the mouth into upper and lower lips. The two ellipses then went through fitness calculation and were followed by training using a database of Japanese women's faces expressing all seven emotions. Finally, our proposed algorithm was tested using a published database consisting of emotions from several persons. The final results were then presented in confusion matrices. Our results showed an accuracy that varies from 20% to 60% for each of the seven emotions. The errors were mainly due to inaccuracies in the classification, and also due to the different expressions in the given emotion database. Detailed analysis of these errors pointed to the limitation of detecting emotion based on the lip features alone. Similar work [1] has been done in the literature for emotion detection in only one person, we have successfully extended our GA based solution to include several subjects.

  13. A multiuser detector based on artificial bee colony algorithm for DS-UWB systems.

    PubMed

    Yin, Zhendong; Liu, Xiaohui; Wu, Zhilu

    2013-01-01

    Artificial Bee Colony (ABC) algorithm is an optimization algorithm based on the intelligent behavior of honey bee swarm. The ABC algorithm was developed to solve optimizing numerical problems and revealed premising results in processing time and solution quality. In ABC, a colony of artificial bees search for rich artificial food sources; the optimizing numerical problems are converted to the problem of finding the best parameter which minimizes an objective function. Then, the artificial bees randomly discover a population of initial solutions and then iteratively improve them by employing the behavior: moving towards better solutions by means of a neighbor search mechanism while abandoning poor solutions. In this paper, an efficient multiuser detector based on a suboptimal code mapping multiuser detector and artificial bee colony algorithm (SCM-ABC-MUD) is proposed and implemented in direct-sequence ultra-wideband (DS-UWB) systems under the additive white Gaussian noise (AWGN) channel. The simulation results demonstrate that the BER and the near-far effect resistance performances of this proposed algorithm are quite close to those of the optimum multiuser detector (OMD) while its computational complexity is much lower than that of OMD. Furthermore, the BER performance of SCM-ABC-MUD is not sensitive to the number of active users and can obtain a large system capacity. PMID:23983638

  14. Applying a generalized Hough-Transform algorithm within a GIS environment to detect earthquake alignments. (Examples in the Betics)

    NASA Astrophysics Data System (ADS)

    José Vicente, Pérez-Peña; Alicia, Jiménez-Gutiérrez; José Miguel, Azañón; Jorge, Delgado; Guillermo, Booth-Rea

    2013-04-01

    Studies of the distribution of the seismicity are very useful in order to recognize active areas, imagine fault geometries, and to relate earthquake activity to particular tectonic structures. The identification of straight-linear earthquake-epicentres alignments can reflect underlying active tectonic structures as faults. Nevertheless, these point-alignments become complicated to detect with diffuse seismic patterns in areas of low to moderate seismicity. In such cases, it is necessary to apply specific methods to detect and analyze preferential earthquakes alignments. The Hough Transform (HT) is a method that has widely used to detect lines in digital images. Despite of this technique was initially developed to work with pixels from digital images, a generalized algorithm based in the HT could be used to detect specific alignments in a disperse point distribution such as earthquake events. This method focuses in to reduce the number of possible lines by analyzing only those with mathematical significance. In this work we presented a GIS integrated methodology to apply a generalized HT to point distributions. In order to test the algorithm, we presented examples from the Betic Cordillera (SE of Spain), where the seismicity is low to moderate (< 5Mb) and geographically disperse

  15. Optimization of Proton CT Detector System and Image Reconstruction Algorithm for On-Line Proton Therapy.

    PubMed

    Lee, Chae Young; Song, Hankyeol; Park, Chan Woo; Chung, Yong Hyun; Kim, Jin Sung; Park, Justin C

    2016-01-01

    The purposes of this study were to optimize a proton computed tomography system (pCT) for proton range verification and to confirm the pCT image reconstruction algorithm based on projection images generated with optimized parameters. For this purpose, we developed a new pCT scanner using the Geometry and Tracking (GEANT) 4.9.6 simulation toolkit. GEANT4 simulations were performed to optimize the geometric parameters representing the detector thickness and the distance between the detectors for pCT. The system consisted of four silicon strip detectors for particle tracking and a calorimeter to measure the residual energies of the individual protons. The optimized pCT system design was then adjusted to ensure that the solution to a CS-based convex optimization problem would converge to yield the desired pCT images after a reasonable number of iterative corrections. In particular, we used a total variation-based formulation that has been useful in exploiting prior knowledge about the minimal variations of proton attenuation characteristics in the human body. Examinations performed using our CS algorithm showed that high-quality pCT images could be reconstructed using sets of 72 projections within 20 iterations and without any streaks or noise, which can be caused by under-sampling and proton starvation. Moreover, the images yielded by this CS algorithm were found to be of higher quality than those obtained using other reconstruction algorithms. The optimized pCT scanner system demonstrated the potential to perform high-quality pCT during on-line image-guided proton therapy, without increasing the imaging dose, by applying our CS based proton CT reconstruction algorithm. Further, we make our optimized detector system and CS-based proton CT reconstruction algorithm potentially useful in on-line proton therapy.

  16. Optimization of Proton CT Detector System and Image Reconstruction Algorithm for On-Line Proton Therapy.

    PubMed

    Lee, Chae Young; Song, Hankyeol; Park, Chan Woo; Chung, Yong Hyun; Kim, Jin Sung; Park, Justin C

    2016-01-01

    The purposes of this study were to optimize a proton computed tomography system (pCT) for proton range verification and to confirm the pCT image reconstruction algorithm based on projection images generated with optimized parameters. For this purpose, we developed a new pCT scanner using the Geometry and Tracking (GEANT) 4.9.6 simulation toolkit. GEANT4 simulations were performed to optimize the geometric parameters representing the detector thickness and the distance between the detectors for pCT. The system consisted of four silicon strip detectors for particle tracking and a calorimeter to measure the residual energies of the individual protons. The optimized pCT system design was then adjusted to ensure that the solution to a CS-based convex optimization problem would converge to yield the desired pCT images after a reasonable number of iterative corrections. In particular, we used a total variation-based formulation that has been useful in exploiting prior knowledge about the minimal variations of proton attenuation characteristics in the human body. Examinations performed using our CS algorithm showed that high-quality pCT images could be reconstructed using sets of 72 projections within 20 iterations and without any streaks or noise, which can be caused by under-sampling and proton starvation. Moreover, the images yielded by this CS algorithm were found to be of higher quality than those obtained using other reconstruction algorithms. The optimized pCT scanner system demonstrated the potential to perform high-quality pCT during on-line image-guided proton therapy, without increasing the imaging dose, by applying our CS based proton CT reconstruction algorithm. Further, we make our optimized detector system and CS-based proton CT reconstruction algorithm potentially useful in on-line proton therapy. PMID:27243822

  17. CONREAL: conserved regulatory elements anchored alignment algorithm for identification of transcription factor binding sites by phylogenetic footprinting.

    PubMed

    Berezikov, Eugene; Guryev, Victor; Plasterk, Ronald H A; Cuppen, Edwin

    2004-01-01

    Prediction of transcription-factor target sites in promoters remains difficult due to the short length and degeneracy of the target sequences. Although the use of orthologous sequences and phylogenetic footprinting approaches may help in the recognition of conserved and potentially functional sequences, correct alignment of the short transcription-factor binding sites can be problematic for established algorithms, especially when aligning more divergent species. Here, we report a novel phylogenetic footprinting approach, CONREAL, that uses biologically relevant information, that is, potential transcription-factor binding sites as represented by positional weight matrices, to establish anchors between orthologous sequences and to guide promoter sequence alignment. Comparison of the performance of CONREAL with the global alignment programs LAGAN and AVID using a reference data set, shows that CONREAL performs equally well for closely related species like rodents and human, and has a clear added value for aligning promoter elements of more divergent species like human and fish, as it identifies conserved transcription-factor binding sites that are not found by other methods. CONREAL is accessible via a Web interface at http://conreal.niob.knaw.nl/.

  18. PET/CT alignment calibration with a non-radioactive phantom and the intrinsic 176Lu radiation of PET detector

    NASA Astrophysics Data System (ADS)

    Wei, Qingyang; Ma, Tianyu; Wang, Shi; Liu, Yaqiang; Gu, Yu; Dai, Tiantian

    2016-11-01

    Positron emission tomography/computed tomography (PET/CT) is an important tool for clinical studies and pre-clinical researches which provides both functional and anatomical images. To achieve high quality co-registered PET/CT images, alignment calibration of PET and CT scanner is a critical procedure. The existing methods reported use positron source phantoms imaged both by PET and CT scanner and then derive the transformation matrix from the reconstructed images of the two modalities. In this paper, a novel PET/CT alignment calibration method with a non-radioactive phantom and the intrinsic 176Lu radiation of the PET detector was developed. Firstly, a multi-tungsten-alloy-sphere phantom without positron source was designed and imaged by CT and the PET scanner using intrinsic 176Lu radiation included in LYSO. Secondly, the centroids of the spheres were derived and matched by an automatic program. Lastly, the rotation matrix and the translation vector were calculated by least-square fitting of the centroid data. The proposed method was employed in an animal PET/CT system (InliView-3000) developed in our lab. Experimental results showed that the proposed method achieves high accuracy and is feasible to replace the conventional positron source based methods.

  19. Analysis of Full Charge Reconstruction Algorithms for X-Ray Pixelated Detectors

    SciTech Connect

    Baumbaugh, A.; Carini, G.; Deptuch, G.; Grybos, P.; Hoff, J.; Siddons, P., Maj.; Szczygiel, R.; Trimpl, M.; Yarema, R.; /Fermilab

    2012-05-21

    Existence of the natural diffusive spread of charge carriers on the course of their drift towards collecting electrodes in planar, segmented detectors results in a division of the original cloud of carriers between neighboring channels. This paper presents the analysis of algorithms, implementable with reasonable circuit resources, whose task is to prevent degradation of the detective quantum efficiency in highly granular, digital pixel detectors. The immediate motivation of the work is a photon science application requesting simultaneous timing spectroscopy and 2D position sensitivity. Leading edge discrimination, provided it can be freed from uncertainties associated with the charge sharing, is used for timing the events. Analyzed solutions can naturally be extended to the amplitude spectroscopy with pixel detectors.

  20. Analysis of full charge reconstruction algorithms for x-ray pixelated detectors

    SciTech Connect

    Baumbaugh, A.; Carini, G.; Deptuch, G.; Grybos, P.; Hoff, J.; Siddons, P., Maj.; Szczygiel, R.; Trimpl, M.; Yarema, R.; /Fermilab

    2011-11-01

    Existence of the natural diffusive spread of charge carriers on the course of their drift towards collecting electrodes in planar, segmented detectors results in a division of the original cloud of carriers between neighboring channels. This paper presents the analysis of algorithms, implementable with reasonable circuit resources, whose task is to prevent degradation of the detective quantum efficiency in highly granular, digital pixel detectors. The immediate motivation of the work is a photon science application requesting simultaneous timing spectroscopy and 2D position sensitivity. Leading edge discrimination, provided it can be freed from uncertainties associated with the charge sharing, is used for timing the events. Analyzed solutions can naturally be extended to the amplitude spectroscopy with pixel detectors.

  1. Quadrupole Alignment and Trajectory Correction for Future Linear Colliders: SLC Tests of a Dispersion-Free Steering Algorithm

    SciTech Connect

    Assmann, R

    2004-06-08

    The feasibility of future linear colliders depends on achieving very tight alignment and steering tolerances. All proposals (NLC, JLC, CLIC, TESLA and S-BAND) currently require a total emittance growth in the main linac of less than 30-100% [1]. This should be compared with a 100% emittance growth in the much smaller SLC linac [2]. Major advances in alignment and beam steering techniques beyond those used in the SLC are necessary for the next generation of linear colliders. In this paper, we present an experimental study of quadrupole alignment with a dispersion-free steering algorithm. A closely related method (wakefield-free steering) takes into account wakefield effects [3]. However, this method can not be studied at the SLC. The requirements for future linear colliders lead to new and unconventional ideas about alignment and beam steering. For example, no dipole correctors are foreseen for the standard trajectory correction in the NLC [4]; beam steering will be done by moving the quadrupole positions with magnet movers. This illustrates the close symbiosis between alignment, beam steering and beam dynamics that will emerge. It is no longer possible to consider the accelerator alignment as static with only a few surveys and realignments per year. The alignment in future linear colliders will be a dynamic process in which the whole linac, with thousands of beam-line elements, is aligned in a few hours or minutes, while the required accuracy of about 5 pm for the NLC quadrupole alignment [4] is a factor of 20 higher than in existing accelerators. The major task in alignment and steering is the accurate determination of the optimum beam-line position. Ideally one would like all elements to be aligned along a straight line. However, this is not practical. Instead a ''smooth curve'' is acceptable as long as its wavelength is much longer than the betatron wavelength of the accelerated beam. Conventional alignment methods are limited in accuracy by errors in the survey

  2. Snapshots: a novel local surface descriptor and matching algorithm for robust 3D surface alignment.

    PubMed

    Malassiotis, Sotiris; Strintzis, Michael G

    2007-07-01

    In this paper, a novel local surface descriptor is proposed and applied to the problem of aligning partial views of a 3D object. The descriptor is based on taking "snapshots" of the surface over each point using a virtual camera oriented perpendicularly to the surface. This representation has the advantage of imposing minimal loss of information be robust to self-occlusions and also be very efficient to compute. Then, we describe an efficient search technique to deal with the rotation ambiguity of our representation and experimentally demonstrate the benefits of our approaches which are pronounced especially when we align views with small overlap. PMID:17496386

  3. Simple algorithms for digital pulse-shape discrimination with liquid scintillation detectors

    NASA Astrophysics Data System (ADS)

    Alharbi, T.

    2015-01-01

    The development of compact, battery-powered digital liquid scintillation neutron detection systems for field applications requires digital pulse processing (DPP) algorithms with minimum computational overhead. To meet this demand, two DPP algorithms for the discrimination of neutron and γ-rays with liquid scintillation detectors were developed and examined by using a NE213 liquid scintillation detector in a mixed radiation field. The first algorithm is based on the relation between the amplitude of a current pulse at the output of a photomultiplier tube and the amount of charge contained in the pulse. A figure-of-merit (FOM) value of 0.98 with 450 keVee (electron equivalent energy) energy threshold was achieved with this method when pulses were sampled at 250 MSample/s and with 8-bit resolution. Compared to the similar method of charge-comparison this method requires only a single integration window, thereby reducing the amount of computations by approximately 40%. The second approach is a digital version of the trailing-edge constant-fraction discrimination method. A FOM value of 0.84 with an energy threshold of 450 keVee was achieved with this method. In comparison with the similar method of rise-time discrimination this method requires a single time pick-off, thereby reducing the amount of computations by approximately 50%. The algorithms described in this work are useful for developing portable detection systems for applications such as homeland security, radiation dosimetry and environmental monitoring.

  4. MeV Gamma Ray Detection Algorithms for Stacked Silicon Detectors

    NASA Technical Reports Server (NTRS)

    McMurray, Robert E. Jr.; Hubbard, G. Scott; Wercinski, Paul F.; Keller, Robert G.

    1993-01-01

    By making use of the signature of a gamma ray event as it appears in N = 5 to 20 lithium-drifted silicon detectors and applying smart selection algorithms, gamma rays in the energy range of 1 to 8 MeV can be detected with good efficiency and selectivity. Examples of the types of algorithms used for different energy regions include the simple sum mode, the sum-coincidence mode used in segmented detectors, unique variations on sum-coincidence for an N-dimensional vector event, and a new and extremely useful mode for double escape peak spectroscopy at pair-production energies. The latter algorithm yields a spectrum similar to that of the pair spectrometer, but without the need of the dual external segments for double escape coincidence, and without the large loss in efficiency of double escape events. Background events due to Compton scattering are largely suppressed. Monte Carlo calculations were used to model the gamma ray interactions in the silicon, in order to enable testing of a wide array of different algorithms on the event N-vectors for a large-N stack.

  5. Alignment validation

    SciTech Connect

    ALICE; ATLAS; CMS; LHCb; Golling, Tobias

    2008-09-06

    The four experiments, ALICE, ATLAS, CMS and LHCb are currently under constructionat CERN. They will study the products of proton-proton collisions at the Large Hadron Collider. All experiments are equipped with sophisticated tracking systems, unprecedented in size and complexity. Full exploitation of both the inner detector andthe muon system requires an accurate alignment of all detector elements. Alignmentinformation is deduced from dedicated hardware alignment systems and the reconstruction of charged particles. However, the system is degenerate which means the data is insufficient to constrain all alignment degrees of freedom, so the techniques are prone to converging on wrong geometries. This deficiency necessitates validation and monitoring of the alignment. An exhaustive discussion of means to validate is subject to this document, including examples and plans from all four LHC experiments, as well as other high energy experiments.

  6. Prediction of Antimicrobial Peptides Based on Sequence Alignment and Support Vector Machine-Pairwise Algorithm Utilizing LZ-Complexity

    PubMed Central

    Shahrudin, Shahriza

    2015-01-01

    This study concerns an attempt to establish a new method for predicting antimicrobial peptides (AMPs) which are important to the immune system. Recently, researchers are interested in designing alternative drugs based on AMPs because they have found that a large number of bacterial strains have become resistant to available antibiotics. However, researchers have encountered obstacles in the AMPs designing process as experiments to extract AMPs from protein sequences are costly and require a long set-up time. Therefore, a computational tool for AMPs prediction is needed to resolve this problem. In this study, an integrated algorithm is newly introduced to predict AMPs by integrating sequence alignment and support vector machine- (SVM-) LZ complexity pairwise algorithm. It was observed that, when all sequences in the training set are used, the sensitivity of the proposed algorithm is 95.28% in jackknife test and 87.59% in independent test, while the sensitivity obtained for jackknife test and independent test is 88.74% and 78.70%, respectively, when only the sequences that has less than 70% similarity are used. Applying the proposed algorithm may allow researchers to effectively predict AMPs from unknown protein peptide sequences with higher sensitivity. PMID:25802839

  7. Development of a SiPM-based PET detector using a digital positioning algorithm

    NASA Astrophysics Data System (ADS)

    Lee, Jin Hyung; Lee, Seung-Jae; An, Su Jung; Kim, Hyun-Il; Chung, Yong Hyun

    2016-05-01

    A decreased number of readout method is investigated here to provide precise pixel information for small-animal positron emission tomography (PET). Small-animal PET consists of eight modules, each being composed of a 3 × 3 array of 2 mm × 2 mm × 20 mm lutetium yttrium orthosilicate (LYSO) crystals optically coupled to a 2 × 2 array of 3 mm × 3 mm silicon photomultipliers (SiPMs). The number of readout channels is reduced by one-quarter that of the conventional method by applying a simplified pixel-determination algorithm. The performances of the PET system and detector module were evaluated with experimental verifications. In the results, all pixels of the 3 × 3 LYSO array were decoded well, and the performances of the PET detector module were measured.

  8. Alignment of nucleotide or amino acid sequences on microcomputers, using a modification of Sellers' (1974) algorithm which avoids the need for calculation of the complete distance matrix.

    PubMed

    Tyson, H; Haley, B

    1985-10-01

    A program to calculate optimum alignment between two sequences, which may be DNA, amino acid or other information, has been written in PASCAL. The Sellers' algorithm for calculating distance between sequences has been modified to reduce its demands on microcomputer memory space by more than half. Gap penalties and mismatch scores are user-adjustable. In 48 K of memory the program aligns sequences up to 170 elements in length; optimum alignment and total distance between a pair of sequences are displayed. The program aligns longer sequences by subdivision of both sequences into corresponding, overlapping sections. Section length and amount of section overlap are user-defined. More importantly, extension of this modification of Sellers' algorithm to align longer sequences, given hardware and compilers/languages capable of using a larger memory space (e.g. 640 K), shows that it is now possible to align, without subdivision, sequences with up to 700 elements each. The increase in computation time for this program with increasing sequence lengths aligned without subdivision is curvilinear, but total times are essentially dependent on hardware/language/compiler combinations. The statistical significance of an alignment is examined with conventional Monte Carlo approaches. PMID:3852712

  9. Clustering and Differential Alignment Algorithm: Identification of Early Stage Regulators in the Arabidopsis thaliana Iron Deficiency Response

    PubMed Central

    Muhammad, Durreshahwar; Foret, Jessica; Brady, Siobhan M.; Ducoste, Joel J.; Tuck, James; Long, Terri A.; Williams, Cranos

    2015-01-01

    Time course transcriptome datasets are commonly used to predict key gene regulators associated with stress responses and to explore gene functionality. Techniques developed to extract causal relationships between genes from high throughput time course expression data are limited by low signal levels coupled with noise and sparseness in time points. We deal with these limitations by proposing the Cluster and Differential Alignment Algorithm (CDAA). This algorithm was designed to process transcriptome data by first grouping genes based on stages of activity and then using similarities in gene expression to predict influential connections between individual genes. Regulatory relationships are assigned based on pairwise alignment scores generated using the expression patterns of two genes and some inferred delay between the regulator and the observed activity of the target. We applied the CDAA to an iron deficiency time course microarray dataset to identify regulators that influence 7 target transcription factors known to participate in the Arabidopsis thaliana iron deficiency response. The algorithm predicted that 7 regulators previously unlinked to iron homeostasis influence the expression of these known transcription factors. We validated over half of predicted influential relationships using qRT-PCR expression analysis in mutant backgrounds. One predicted regulator-target relationship was shown to be a direct binding interaction according to yeast one-hybrid (Y1H) analysis. These results serve as a proof of concept emphasizing the utility of the CDAA for identifying unknown or missing nodes in regulatory cascades, providing the fundamental knowledge needed for constructing predictive gene regulatory networks. We propose that this tool can be used successfully for similar time course datasets to extract additional information and infer reliable regulatory connections for individual genes. PMID:26317202

  10. ANL CT Image Reconstruction Algorithm for Utilizing Digital X-ray Detector Array

    2004-08-05

    Reconstructs X-ray computed tomographic images from large data sets known as 16-bit binary sinograms. The algorithm uses the concept of generation of an image from carefully obtained multiple l-D or 2-0 X-ray projections. The individual projections are filtered using a digital Fast Fourier Transform. The literature refers to this as filtered back projection. The software is capable of processing a large file for reconstructing single images or volumetnc (3-D) images from large area high resolutionmore » digital X-ray detectors.« less

  11. NORSAR Final Scientific Report Adaptive Waveform Correlation Detectors for Arrays: Algorithms for Autonomous Calibration

    SciTech Connect

    Gibbons, S J; Ringdal, F; Harris, D B

    2009-04-16

    Correlation detection is a relatively new approach in seismology that offers significant advantages in increased sensitivity and event screening over standard energy detection algorithms. The basic concept is that a representative event waveform is used as a template (i.e. matched filter) that is correlated against a continuous, possibly multichannel, data stream to detect new occurrences of that same signal. These algorithms are therefore effective at detecting repeating events, such as explosions and aftershocks at a specific location. This final report summarizes the results of a three-year cooperative project undertaken by NORSAR and Lawrence Livermore National Laboratory. The overall objective has been to develop and test a new advanced, automatic approach to seismic detection using waveform correlation. The principal goal is to develop an adaptive processing algorithm. By this we mean that the detector is initiated using a basic set of reference ('master') events to be used in the correlation process, and then an automatic algorithm is applied successively to provide improved performance by extending the set of master events selectively and strategically. These additional master events are generated by an independent, conventional detection system. A periodic analyst review will then be applied to verify the performance and, if necessary, adjust and consolidate the master event set. A primary focus of this project has been the application of waveform correlation techniques to seismic arrays. The basic procedure is to perform correlation on the individual channels, and then stack the correlation traces using zero-delay beam forming. Array methods such as frequency-wavenumber analysis can be applied to this set of correlation traces to help guarantee the validity of detections and lower the detection threshold. In principle, the deployment of correlation detectors against seismically active regions could involve very large numbers of very specific detectors. To

  12. Performance Assessment of the Optical Transient Detector and Lightning Imaging Sensor. Part 2; Clustering Algorithm

    NASA Technical Reports Server (NTRS)

    Mach, Douglas M.; Christian, Hugh J.; Blakeslee, Richard; Boccippio, Dennis J.; Goodman, Steve J.; Boeck, William

    2006-01-01

    We describe the clustering algorithm used by the Lightning Imaging Sensor (LIS) and the Optical Transient Detector (OTD) for combining the lightning pulse data into events, groups, flashes, and areas. Events are single pixels that exceed the LIS/OTD background level during a single frame (2 ms). Groups are clusters of events that occur within the same frame and in adjacent pixels. Flashes are clusters of groups that occur within 330 ms and either 5.5 km (for LIS) or 16.5 km (for OTD) of each other. Areas are clusters of flashes that occur within 16.5 km of each other. Many investigators are utilizing the LIS/OTD flash data; therefore, we test how variations in the algorithms for the event group and group-flash clustering affect the flash count for a subset of the LIS data. We divided the subset into areas with low (1-3), medium (4-15), high (16-63), and very high (64+) flashes to see how changes in the clustering parameters affect the flash rates in these different sizes of areas. We found that as long as the cluster parameters are within about a factor of two of the current values, the flash counts do not change by more than about 20%. Therefore, the flash clustering algorithm used by the LIS and OTD sensors create flash rates that are relatively insensitive to reasonable variations in the clustering algorithms.

  13. Robust algorithm to locate heart beats from multiple physiological waveforms by individual signal detector voting.

    PubMed

    Galeotti, Loriano; Scully, Christopher G; Vicente, Jose; Johannesen, Lars; Strauss, David G

    2015-08-01

    Alarm fatigue is a top medical device hazard in patient monitoring that could be reduced by merging physiological information from multiple sensors, minimizing the impact of a single sensor failing. We developed a heart beat detection algorithm that utilizes multi-modal physiological signals (e.g. electrocardiogram, blood pressure, stroke volume, photoplethysmogram and electro-encephalogram) by merging the heart beats obtained from signal-specific detectors. We used the PhysioNet/Computing in Cardiology Challenge 2014 training set to develop the algorithm, and we refined it with a mix of signals from the multiparameter intelligent monitoring in intensive care (MIMIC II) database and artificially disrupted waveforms. The algorithm had an average sensitivity of 95.67% and positive predictive value (PPV) of 92.28% when applied to the PhysioNet/Computing in Cardiology Challenge 2014 200 record training set. On a refined dataset obtained by removing 5 records with arrhythmias and inconsistent reference annotations we obtained an average sensitivity of 97.43% and PPV of 94.17%. Algorithm performance was assessed with the Physionet Challenge 2014 test set that consisted of 200 records (each up to 10 min length) containing multiple physiological signals and reference annotations verified by the PhysioNet/Computing in Cardiology Challenge 2014 organizers. Our algorithm had a sensitivity of 92.74% and PPV of 87.37% computed over all annotated beats, and a record average sensitivity of 91.08%, PPV of 86.96% and an overall score (average of all 4 measures) of 89.53%. Our algorithm is an example of a data fusion approach that can improve patient monitoring and reduce false alarms by reducing the effect of individual signal failures. PMID:26218439

  14. Detectors

    DOEpatents

    Orr, Christopher Henry; Luff, Craig Janson; Dockray, Thomas; Macarthur, Duncan Whittemore; Bounds, John Alan; Allander, Krag

    2002-01-01

    The apparatus and method provide techniques through which both alpha and beta emission determinations can be made simultaneously using a simple detector structure. The technique uses a beta detector covered in an electrically conducting material, the electrically conducting material discharging ions generated by alpha emissions, and as a consequence providing a measure of those alpha emissions. The technique also offers improved mountings for alpha detectors and other forms of detectors against vibration and the consequential effects vibration has on measurement accuracy.

  15. Remote Evaluation of Rotational Velocity Using a Quadrant Photo-Detector and a DSC Algorithm.

    PubMed

    Zeng, Xiangkai; Zhu, Zhixiong; Chen, Yang

    2016-04-25

    This paper presents an approach to remotely evaluate the rotational velocity of a measured object by using a quadrant photo-detector and a differential subtraction correlation (DSC) algorithm. The rotational velocity of a rotating object is determined by two temporal-delay numbers at the minima of two DSCs that are derived from the four output signals of the quadrant photo-detector, and the sign of the calculated rotational velocity directly represents the rotational direction. The DSC algorithm does not require any multiplication operations. Experimental calculations were performed to confirm the proposed evaluation method. The calculated rotational velocity, including its amplitude and direction, showed good agreement with the given one, which had an amplitude error of ~0.3%, and had over 1100 times the efficiency of the traditional cross-correlation method in the case of data number N > 4800. The confirmations have shown that the remote evaluation of rotational velocity can be done without any circular division disk, and that it has much fewer error sources, making it simple, accurate and effective for remotely evaluating rotational velocity.

  16. Remote Evaluation of Rotational Velocity Using a Quadrant Photo-Detector and a DSC Algorithm

    PubMed Central

    Zeng, Xiangkai; Zhu, Zhixiong; Chen, Yang

    2016-01-01

    This paper presents an approach to remotely evaluate the rotational velocity of a measured object by using a quadrant photo-detector and a differential subtraction correlation (DSC) algorithm. The rotational velocity of a rotating object is determined by two temporal-delay numbers at the minima of two DSCs that are derived from the four output signals of the quadrant photo-detector, and the sign of the calculated rotational velocity directly represents the rotational direction. The DSC algorithm does not require any multiplication operations. Experimental calculations were performed to confirm the proposed evaluation method. The calculated rotational velocity, including its amplitude and direction, showed good agreement with the given one, which had an amplitude error of ~0.3%, and had over 1100 times the efficiency of the traditional cross-correlation method in the case of data number N > 4800. The confirmations have shown that the remote evaluation of rotational velocity can be done without any circular division disk, and that it has much fewer error sources, making it simple, accurate and effective for remotely evaluating rotational velocity. PMID:27120607

  17. A region segmentation based algorithm for building a crystal position lookup table in a scintillation detector

    NASA Astrophysics Data System (ADS)

    Wang, Hai-Peng; Yun, Ming-Kai; Liu, Shuang-Quan; Fan, Xin; Cao, Xue-Xiang; Chai, Pei; Shan, Bao-Ci

    2015-03-01

    In a scintillation detector, scintillation crystals are typically made into a 2-dimensional modular array. The location of incident gamma-ray needs be calibrated due to spatial response nonlinearity. Generally, position histograms-the characteristic flood response of scintillation detectors-are used for position calibration. In this paper, a position calibration method based on a crystal position lookup table which maps the inaccurate location calculated by Anger logic to the exact hitting crystal position has been proposed. Firstly, the position histogram is preprocessed, such as noise reduction and image enhancement. Then the processed position histogram is segmented into disconnected regions, and crystal marking points are labeled by finding the centroids of regions. Finally, crystal boundaries are determined and the crystal position lookup table is generated. The scheme is evaluated by the whole-body positron emission tomography (PET) scanner and breast dedicated single photon emission computed tomography scanner developed by the Institute of High Energy Physics, Chinese Academy of Sciences. The results demonstrate that the algorithm is accurate, efficient, robust and applicable to any configurations of scintillation detector. Supported by National Natural Science Foundation of China (81101175) and XIE Jia-Lin Foundation of Institute of High Energy Physics (Y3546360U2)

  18. Technical note: A physical phantom for assessment of accuracy of deformable alignment algorithms

    SciTech Connect

    Kashani, Rojano; Hub, Martina; Kessler, Marc L.; Balter, James M.

    2007-07-15

    The purpose of this study was to investigate the feasibility of a simple deformable phantom as a QA tool for testing and validation of deformable image registration algorithms. A diagnostic thoracic imaging phantom with a deformable foam insert was used in this study. Small plastic markers were distributed through the foam to create a lattice with a measurable deformation as the ground truth data for all comparisons. The foam was compressed in the superior-inferior direction using a one-dimensional drive stage pushing a flat 'diaphragm' to create deformations similar to those from inhale and exhale states. Images were acquired at different compressions of the foam and the location of every marker was manually identified on each image volume to establish a known deformation field with a known accuracy. The markers were removed digitally from corresponding images prior to registration. Different image registration algorithms were tested using this method. Repeat measurement of marker positions showed an accuracy of better than 1 mm in identification of the reference marks. Testing the method on several image registration algorithms showed that the system is capable of evaluating errors quantitatively. This phantom is able to quantitatively assess the accuracy of deformable image registration, using a measure of accuracy that is independent of the signals that drive the deformation parameters.

  19. Statistically significant performance results of a mine detector and fusion algorithm from an x-band high-resolution SAR

    NASA Astrophysics Data System (ADS)

    Williams, Arnold C.; Pachowicz, Peter W.

    2004-09-01

    Current mine detection research indicates that no single sensor or single look from a sensor will detect mines/minefields in a real-time manner at a performance level suitable for a forward maneuver unit. Hence, the integrated development of detectors and fusion algorithms are of primary importance. A problem in this development process has been the evaluation of these algorithms with relatively small data sets, leading to anecdotal and frequently over trained results. These anecdotal results are often unreliable and conflicting among various sensors and algorithms. Consequently, the physical phenomena that ought to be exploited and the performance benefits of this exploitation are often ambiguous. The Army RDECOM CERDEC Night Vision Laboratory and Electron Sensors Directorate has collected large amounts of multisensor data such that statistically significant evaluations of detection and fusion algorithms can be obtained. Even with these large data sets care must be taken in algorithm design and data processing to achieve statistically significant performance results for combined detectors and fusion algorithms. This paper discusses statistically significant detection and combined multilook fusion results for the Ellipse Detector (ED) and the Piecewise Level Fusion Algorithm (PLFA). These statistically significant performance results are characterized by ROC curves that have been obtained through processing this multilook data for the high resolution SAR data of the Veridian X-Band radar. We discuss the implications of these results on mine detection and the importance of statistical significance, sample size, ground truth, and algorithm design in performance evaluation.

  20. Improved event positioning in a gamma ray detector using an iterative position-weighted centre-of-gravity algorithm.

    PubMed

    Liu, Chen-Yi; Goertzen, Andrew L

    2013-07-21

    An iterative position-weighted centre-of-gravity algorithm was developed and tested for positioning events in a silicon photomultiplier (SiPM)-based scintillation detector for positron emission tomography. The algorithm used a Gaussian-based weighting function centred at the current estimate of the event location. The algorithm was applied to the signals from a 4 × 4 array of SiPM detectors that used individual channel readout and a LYSO:Ce scintillator array. Three scintillator array configurations were tested: single layer with 3.17 mm crystal pitch, matched to the SiPM size; single layer with 1.5 mm crystal pitch; and dual layer with 1.67 mm crystal pitch and a ½ crystal offset in the X and Y directions between the two layers. The flood histograms generated by this algorithm were shown to be superior to those generated by the standard centre of gravity. The width of the Gaussian weighting function of the algorithm was optimized for different scintillator array setups. The optimal width of the Gaussian curve was found to depend on the amount of light spread. The algorithm required less than 20 iterations to calculate the position of an event. The rapid convergence of this algorithm will readily allow for implementation on a front-end detector processing field programmable gate array for use in improved real-time event positioning and identification.

  1. Chirplet Clustering Algorithm for Black Hole Coalescence Signatures in Gravitational Wave Detectors

    NASA Astrophysics Data System (ADS)

    Nemtzow, Zachary; Chassande-Mottin, Eric; Mohapatra, Satyanarayan R. P.; Cadonati, Laura

    2012-03-01

    Within this decade, gravitational waves will become new astrophysical messengers with which we can learn about our universe. Gravitational wave emission from the coalescence of massive bodies is projected to be a promising source for the next generation of gravitational wave detectors: advanced LIGO and advanced Virgo. We describe a method for the detection of binary black hole coalescences using a chirplet template bank, Chirplet Omega. By appropriately clustering the linearly variant frequency sin-Gaussian pixels the algorithm uses to decompose the data, the signal to noise ratio SNR of events extended in time can be significantly increased. We present such a clustering method and discuss its impacts on performance and detectability of binary black hole coalescences in ground based gravitational wave interferometers.

  2. Nearest Alignment Space Termination

    2006-07-13

    Near Alignment Space Termination (NAST) is the Greengenes algorithm that matches up submitted sequences with the Greengenes database to look for similarities and align the submitted sequences based on those similarities.

  3. GSTAMIDS pulsed magnetic induction metal detector: hardware description and data processing algorithms

    NASA Astrophysics Data System (ADS)

    Sower, Gary D.; Kilgore, Roger; Eberly, John

    2001-10-01

    into the GSTAMIDS sensor modules. This is a time-domain, transient signal metal detector that gives target signal response information of a different nature than that from more conventional continuous-wave (CW) metal detectors. The magnetic design of the GSTAMIDS PMI has very broad-band radiation properties that allow for the required transient eddy current responses in the metallic targets. The design of this detector is unique in that it allows processing of the received signals from targets to begin at the very start of the eddy current decays (t = 0). This then gives the ability to measure and quantify up to three decay terms in the target response, which features unambiguously identify the particular threat target. The results of the data processing algorithms that are used to extract the features used for mine detection are included herein to more clearly show the mine signals.

  4. Adaptive algorithms of position and energy reconstruction in Anger-camera type detectors: experimental data processing in ANTS

    NASA Astrophysics Data System (ADS)

    Morozov, A.; Defendi, I.; Engels, R.; Fraga, F. A. F.; Fraga, M. M. F. R.; Gongadze, A.; Guerard, B.; Jurkovic, M.; Kemmerling, G.; Manzin, G.; Margato, L. M. S.; Niko, H.; Pereira, L.; Petrillo, C.; Peyaud, A.; Piscitelli, F.; Raspino, D.; Rhodes, N. J.; Sacchetti, F.; Schooneveld, E. M.; Solovov, V.; Van Esch, P.; Zeitelhack, K.

    2013-05-01

    The software package ANTS (Anger-camera type Neutron detector: Toolkit for Simulations), developed for simulation of Anger-type gaseous detectors for thermal neutron imaging was extended to include a module for experimental data processing. Data recorded with a sensor array containing up to 100 photomultiplier tubes (PMT) or silicon photomultipliers (SiPM) in a custom configuration can be loaded and the positions and energies of the events can be reconstructed using the Center-of-Gravity, Maximum Likelihood or Least Squares algorithm. A particular strength of the new module is the ability to reconstruct the light response functions and relative gains of the photomultipliers from flood field illumination data using adaptive algorithms. The performance of the module is demonstrated with simulated data generated in ANTS and experimental data recorded with a 19 PMT neutron detector. The package executables are publicly available at http://coimbra.lip.pt/~andrei/

  5. Data Retrieval Algorithms for Validating the Optical Transient Detector and the Lightning Imaging Sensor

    NASA Technical Reports Server (NTRS)

    Koshak, W. J.; Blakeslee, R. J.; Bailey, J. C.

    2000-01-01

    A linear algebraic solution is provided for the problem of retrieving the location and time of occurrence of lightning ground strikes from an Advanced Lightning Direction Finder (ALDF) network. The ALDF network measures field strength, magnetic bearing, and arrival time of lightning radio emissions. Solutions for the plane (i.e., no earth curvature) are provided that implement all of these measurements. The accuracy of the retrieval method is tested using computer-simulated datasets, and the relative influence of bearing and arrival time data an the outcome of the final solution is formally demonstrated. The algorithm is sufficiently accurate to validate NASA:s Optical Transient Detector and Lightning Imaging Sensor. A quadratic planar solution that is useful when only three arrival time measurements are available is also introduced. The algebra of the quadratic root results are examined in detail to clarify what portions of the analysis region lead to fundamental ambiguities in sc)iirce location, Complex root results are shown to be associated with the presence of measurement errors when the lightning source lies near an outer sensor baseline of the ALDF network. For arbitrary noncollinear network geometries and in the absence of measurement errors, it is shown that the two quadratic roots are equivalent (no source location ambiguity) on the outer sensor baselines. The accuracy of the quadratic planar method is tested with computer-generated datasets, and the results are generally better than those obtained from the three-station linear planar method when bearing errors are about 2 deg.

  6. Performance of the reconstruction algorithms of the FIRST experiment pixel sensors vertex detector

    NASA Astrophysics Data System (ADS)

    Rescigno, R.; Finck, Ch.; Juliani, D.; Spiriti, E.; Baudot, J.; Abou-Haidar, Z.; Agodi, C.; Alvarez, M. A. G.; Aumann, T.; Battistoni, G.; Bocci, A.; Böhlen, T. T.; Boudard, A.; Brunetti, A.; Carpinelli, M.; Cirrone, G. A. P.; Cortes-Giraldo, M. A.; Cuttone, G.; De Napoli, M.; Durante, M.; Gallardo, M. I.; Golosio, B.; Iarocci, E.; Iazzi, F.; Ickert, G.; Introzzi, R.; Krimmer, J.; Kurz, N.; Labalme, M.; Leifels, Y.; Le Fevre, A.; Leray, S.; Marchetto, F.; Monaco, V.; Morone, M. C.; Oliva, P.; Paoloni, A.; Patera, V.; Piersanti, L.; Pleskac, R.; Quesada, J. M.; Randazzo, N.; Romano, F.; Rossi, D.; Rousseau, M.; Sacchi, R.; Sala, P.; Sarti, A.; Scheidenberger, C.; Schuy, C.; Sciubba, A.; Sfienti, C.; Simon, H.; Sipala, V.; Tropea, S.; Vanstalle, M.; Younis, H.

    2014-12-01

    Hadrontherapy treatments use charged particles (e.g. protons and carbon ions) to treat tumors. During a therapeutic treatment with carbon ions, the beam undergoes nuclear fragmentation processes giving rise to significant yields of secondary charged particles. An accurate prediction of these production rates is necessary to estimate precisely the dose deposited into the tumours and the surrounding healthy tissues. Nowadays, a limited set of double differential carbon fragmentation cross-section is available. Experimental data are necessary to benchmark Monte Carlo simulations for their use in hadrontherapy. The purpose of the FIRST experiment is to study nuclear fragmentation processes of ions with kinetic energy in the range from 100 to 1000 MeV/u. Tracks are reconstructed using information from a pixel silicon detector based on the CMOS technology. The performances achieved using this device for hadrontherapy purpose are discussed. For each reconstruction step (clustering, tracking and vertexing), different methods are implemented. The algorithm performances and the accuracy on reconstructed observables are evaluated on the basis of simulated and experimental data.

  7. Design of an advanced positron emission tomography detector system and algorithms for imaging small animal models of human disease

    NASA Astrophysics Data System (ADS)

    Foudray, Angela Marie Klohs

    Detecting, quantifying and visualizing biochemical mechanism in a living system without perturbing function is the goal of the instrument and algorithms designed in this thesis. Biochemical mechanisms of cells have long been known to be dependent on the signals they receive from their environment. Studying biological processes of cells in-vitro can vastly distort their function, since you are removing them from their natural chemical signaling environment. Mice have become the biological system of choice for various areas of biomedical research due to their genetic and physiological similarities with humans, the relatively low cost of their care, and their quick breeding cycle. Drug development and efficacy assessment along with disease detection, management, and mechanism research all have benefited from the use of small animal models of human disease. A high resolution, high sensitivity, three-dimensional (3D) positioning positron emission tomography (PET) detector system was designed through device characterization and Monte Carlo simulation. Position-sensitive avalanche photodiodes (PSAPDs) were characterized in various packaging configurations; coupled to various configurations of lutetium oxyorthosilicate (LSO) scintillation crystals. Forty novelly packaged final design devices were constructed and characterized, each providing characteristics superior to commercially available scintillation detectors used in small animal imaging systems: ˜1mm crystal identification, 14-15% of 511 keV energy resolution, and averaging 1.9 to 5.6 ns coincidence time resolution. A closed-cornered box-shaped detector configuration was found to provide optimal photon sensitivity (˜10.5% in the central plane) using dual LSO-PSAPD scintillation detector modules and Monte Carlo simulation. Standard figures of merit were used to determine optimal system acquisition parameters. A realistic model for constituent devices was developed for understanding the signals reported by the

  8. Study and optimization of positioning algorithms for monolithic PET detectors blocks

    NASA Astrophysics Data System (ADS)

    Garcia de Acilu, P.; Sarasola, I.; Canadas, M.; Cuerdo, R.; Rato Mendes, P.; Romero, L.; Willmott, C.

    2012-06-01

    We are developing a PET insert for existing MRI equipment to be used in clinical PET/MR studies of the human brain. The proposed scanner is based on annihilation gamma detection with monolithic blocks of cerium-doped lutetium yttrium orthosilicate (LYSO:Ce) coupled to magnetically-compatible avalanche photodiodes (APD) matrices. The light distribution generated on the LYSO:Ce block provides the impinging position of the 511 keV photons by means of a positioning algorithm. Several positioning methods, from the simplest Anger Logic to more sophisticate supervised-learning Neural Networks (NN), can be implemented to extract the incidence position of gammas directly from the APD signals. Finally, an optimal method based on a two-step Feed-Forward Neural Network has been selected. It allows us to reach a resolution at detector level of 2 mm, and acquire images of point sources using a first BrainPET prototype consisting of two monolithic blocks working in coincidence. Neural networks provide a straightforward positioning of the acquired data once they have been trained, however the training process is usually time-consuming. In order to obtain an efficient positioning method for the complete scanner it was necessary to find a training procedure that reduces the data acquisition and processing time without introducing a noticeable degradation of the spatial resolution. A grouping process and posterior selection of the training data have been done regarding the similitude of the light distribution of events which have one common incident coordinate (transversal or longitudinal). By doing this, the amount of training data can be reduced to about 5% of the initial number with a degradation of spatial resolution lower than 10%.

  9. Two Simple and Efficient Algorithms to Compute the SP-Score Objective Function of a Multiple Sequence Alignment

    PubMed Central

    Ranwez, Vincent

    2016-01-01

    Background Multiple sequence alignment (MSA) is a crucial step in many molecular analyses and many MSA tools have been developed. Most of them use a greedy approach to construct a first alignment that is then refined by optimizing the sum of pair score (SP-score). The SP-score estimation is thus a bottleneck for most MSA tools since it is repeatedly required and is time consuming. Results Given an alignment of n sequences and L sites, I introduce here optimized solutions reaching O(nL) time complexity for affine gap cost, instead of O(n2L), which are easy to implement. PMID:27505054

  10. Spectrum correction algorithm for detectors in airborne radioactivity monitoring equipment NH-UAV based on a ratio processing method

    NASA Astrophysics Data System (ADS)

    Cao, Ye; Tang, Xiao-Bin; Wang, Peng; Meng, Jia; Huang, Xi; Wen, Liang-Sheng; Chen, Da

    2015-10-01

    The unmanned aerial vehicle (UAV) radiation monitoring method plays an important role in nuclear accidents emergency. In this research, a spectrum correction algorithm about the UAV airborne radioactivity monitoring equipment NH-UAV was studied to measure the radioactive nuclides within a small area in real time and in a fixed place. The simulation spectra of the high-purity germanium (HPGe) detector and the lanthanum bromide (LaBr3) detector in the equipment were obtained using the Monte Carlo technique. Spectrum correction coefficients were calculated after performing ratio processing techniques about the net peak areas between the double detectors on the detection spectrum of the LaBr3 detector according to the accuracy of the detection spectrum of the HPGe detector. The relationship between the spectrum correction coefficient and the size of the source term was also investigated. A good linear relation exists between the spectrum correction coefficient and the corresponding energy (R2=0.9765). The maximum relative deviation from the real condition reduced from 1.65 to 0.035. The spectrum correction method was verified as feasible.

  11. CUDA ClustalW: An efficient parallel algorithm for progressive multiple sequence alignment on Multi-GPUs.

    PubMed

    Hung, Che-Lun; Lin, Yu-Shiang; Lin, Chun-Yuan; Chung, Yeh-Ching; Chung, Yi-Fang

    2015-10-01

    For biological applications, sequence alignment is an important strategy to analyze DNA and protein sequences. Multiple sequence alignment is an essential methodology to study biological data, such as homology modeling, phylogenetic reconstruction and etc. However, multiple sequence alignment is a NP-hard problem. In the past decades, progressive approach has been proposed to successfully align multiple sequences by adopting iterative pairwise alignments. Due to rapid growth of the next generation sequencing technologies, a large number of sequences can be produced in a short period of time. When the problem instance is large, progressive alignment will be time consuming. Parallel computing is a suitable solution for such applications, and GPU is one of the important architectures for contemporary parallel computing researches. Therefore, we proposed a GPU version of ClustalW v2.0.11, called CUDA ClustalW v1.0, in this work. From the experiment results, it can be seen that the CUDA ClustalW v1.0 can achieve more than 33× speedups for overall execution time by comparing to ClustalW v2.0.11.

  12. Classical two-dimensional numerical algorithm for ?-Induced charge carrier advection-diffusion in Medipix-3 silicon pixel detectors

    NASA Astrophysics Data System (ADS)

    Biamonte, Mason; Idarraga, John

    2013-04-01

    A classical hybrid alternating-direction implicit difference scheme is used to simulate two-dimensional charge carrier advection-diffusion induced by alpha particles incident upon silicon pixel detectors at room temperature in vacuum. A mapping between the results of the simulation and a projection of the cluster size for each incident alpha is constructed. The error between the simulation and the experimental data diminishes with the increase in the applied voltage for the pixels in the central region of the cluster. Simulated peripheral pixel TOT values do not match the data for any value of applied voltage, suggesting possible modifications to the current algorithm from first principles. Coulomb repulsion between charge carriers is built into the algorithm using the Barnes-Hut tree algorithm. The plasma effect arising from the initial presence of holes in the silicon is incorporated into the simulation. The error between the simulation and the data helps identify physics not accounted for in standard literature simulation techniques.

  13. Internal Transcribed Spacer rRNA Gene-Based Phylogenetic Reconstruction Using Algorithms with Local and Global Sequence Alignment for Black Yeasts and Their Relatives

    PubMed Central

    Caligiorne, R. B.; Licinio, P.; Dupont, J.; de Hoog, G. S.

    2005-01-01

    Sequences of rRNA gene internal transcribed spacer (ITS) of a standard set of black yeast-like fungal pathogens were compared using two methods: local and global alignments. The latter is based on DNA-walk divergence analysis. This method has become recently available as an algorithm (DNAWD program) which converts sequences into three-dimensional walks. The walks are compared with, or fit to, each other generating global alignments. The DNA-walk geometry defines a proper metric used to create a distance matrix appropriated for phylogenetic reconstruction. In this work, the analyses were carried out for species currently classified in Capronia, Cladophialophora, Exophiala, Fonsecaea, Phialophora, and Ramichloridium. Main groups were verified by small-subunit rRNA gene data. DNAWD applied to ITS2 alone enabled species recognition as well as phylogenetic reconstruction reflecting clades discriminated in small-subunit rRNA gene phylogeny, which was not possible with any other algorithm using local alignment for the same data set. It is concluded that DNAWD provides rapid insight into broader relationships between groups using genes that otherwise would be hardly usable for this purpose. PMID:15956403

  14. Alignment of the ATLAS silicon tracker

    NASA Astrophysics Data System (ADS)

    Morley, Anthony

    2008-10-01

    ATLAS is one of the four experiments currently under preparation at Large Hadron Collider. Charged particle track reconstruction in the ATLAS Inner Detector is performed both with silicon and drift-tube-based detectors. The alignment of the ATLAS tracking system is one of the challenges that the experiment must overcome in order to achieve its physics goals. This requires the determination of almost 35 000 degrees of freedom. The precision required for the most sensitive coordinate of the silicon devices is of the order of few microns. This precision will be attained with a combination of two techniques: a hardware system with Frequency Scan Interferometers, and track-based alignment. The latter requires the application of complex alignment algorithms that can be both CPU and memory intensive due to the possible requirement of large matrix inversion or many iterations. The alignment algorithms have been already exercised on several challenges such as a Combined Test Beam, cosmic ray runs and large scale computing simulation of physics samples. This note reports on the methods, their computing requirements and preliminary results.

  15. A simple methodology for characterization of germanium coaxial detectors by using Monte Carlo simulation and evolutionary algorithms.

    PubMed

    Guerra, J G; Rubiano, J G; Winter, G; Guerra, A G; Alonso, H; Arnedo, M A; Tejera, A; Gil, J M; Rodríguez, R; Martel, P; Bolivar, J P

    2015-11-01

    The determination in a sample of the activity concentration of a specific radionuclide by gamma spectrometry needs to know the full energy peak efficiency (FEPE) for the energy of interest. The difficulties related to the experimental calibration make it advisable to have alternative methods for FEPE determination, such as the simulation of the transport of photons in the crystal by the Monte Carlo method, which requires an accurate knowledge of the characteristics and geometry of the detector. The characterization process is mainly carried out by Canberra Industries Inc. using proprietary techniques and methodologies developed by that company. It is a costly procedure (due to shipping and to the cost of the process itself) and for some research laboratories an alternative in situ procedure can be very useful. The main goal of this paper is to find an alternative to this costly characterization process, by establishing a method for optimizing the parameters of characterizing the detector, through a computational procedure which could be reproduced at a standard research lab. This method consists in the determination of the detector geometric parameters by using Monte Carlo simulation in parallel with an optimization process, based on evolutionary algorithms, starting from a set of reference FEPEs determined experimentally or computationally. The proposed method has proven to be effective and simple to implement. It provides a set of characterization parameters which it has been successfully validated for different source-detector geometries, and also for a wide range of environmental samples and certified materials.

  16. A simple methodology for characterization of germanium coaxial detectors by using Monte Carlo simulation and evolutionary algorithms.

    PubMed

    Guerra, J G; Rubiano, J G; Winter, G; Guerra, A G; Alonso, H; Arnedo, M A; Tejera, A; Gil, J M; Rodríguez, R; Martel, P; Bolivar, J P

    2015-11-01

    The determination in a sample of the activity concentration of a specific radionuclide by gamma spectrometry needs to know the full energy peak efficiency (FEPE) for the energy of interest. The difficulties related to the experimental calibration make it advisable to have alternative methods for FEPE determination, such as the simulation of the transport of photons in the crystal by the Monte Carlo method, which requires an accurate knowledge of the characteristics and geometry of the detector. The characterization process is mainly carried out by Canberra Industries Inc. using proprietary techniques and methodologies developed by that company. It is a costly procedure (due to shipping and to the cost of the process itself) and for some research laboratories an alternative in situ procedure can be very useful. The main goal of this paper is to find an alternative to this costly characterization process, by establishing a method for optimizing the parameters of characterizing the detector, through a computational procedure which could be reproduced at a standard research lab. This method consists in the determination of the detector geometric parameters by using Monte Carlo simulation in parallel with an optimization process, based on evolutionary algorithms, starting from a set of reference FEPEs determined experimentally or computationally. The proposed method has proven to be effective and simple to implement. It provides a set of characterization parameters which it has been successfully validated for different source-detector geometries, and also for a wide range of environmental samples and certified materials. PMID:26188622

  17. Precision alignment device

    DOEpatents

    Jones, Nelson E.

    1990-01-01

    Apparatus for providing automatic alignment of beam devices having an associated structure for directing, collimating, focusing, reflecting, or otherwise modifying the main beam. A reference laser is attached to the structure enclosing the main beam producing apparatus and produces a reference beam substantially parallel to the main beam. Detector modules containing optical switching devices and optical detectors are positioned in the path of the reference beam and are effective to produce an electrical output indicative of the alignment of the main beam. This electrical output drives servomotor operated adjustment screws to adjust the position of elements of the structure associated with the main beam to maintain alignment of the main beam.

  18. Precision alignment device

    DOEpatents

    Jones, N.E.

    1988-03-10

    Apparatus for providing automatic alignment of beam devices having an associated structure for directing, collimating, focusing, reflecting, or otherwise modifying the main beam. A reference laser is attached to the structure enclosing the main beam producing apparatus and produces a reference beam substantially parallel to the main beam. Detector modules containing optical switching devices and optical detectors are positioned in the path of the reference beam and are effective to produce an electrical output indicative of the alignment of the main beam. This electrical output drives servomotor operated adjustment screws to adjust the position of elements of the structure associated with the main beam to maintain alignment of the main beam. 5 figs.

  19. Evaluation of Origin Ensemble algorithm for image reconstruction for pixelated solid-state detectors with large number of channels

    NASA Astrophysics Data System (ADS)

    Kolstein, M.; De Lorenzo, G.; Mikhaylova, E.; Chmeissani, M.; Ariño, G.; Calderón, Y.; Ozsahin, I.; Uzun, D.

    2013-04-01

    The Voxel Imaging PET (VIP) Pathfinder project intends to show the advantages of using pixelated solid-state technology for nuclear medicine applications. It proposes designs for Positron Emission Tomography (PET), Positron Emission Mammography (PEM) and Compton gamma camera detectors with a large number of signal channels (of the order of 106). For PET scanners, conventional algorithms like Filtered Back-Projection (FBP) and Ordered Subset Expectation Maximization (OSEM) are straightforward to use and give good results. However, FBP presents difficulties for detectors with limited angular coverage like PEM and Compton gamma cameras, whereas OSEM has an impractically large time and memory consumption for a Compton gamma camera with a large number of channels. In this article, the Origin Ensemble (OE) algorithm is evaluated as an alternative algorithm for image reconstruction. Monte Carlo simulations of the PET design are used to compare the performance of OE, FBP and OSEM in terms of the bias, variance and average mean squared error (MSE) image quality metrics. For the PEM and Compton camera designs, results obtained with OE are presented.

  20. Imaging, Detection, and Identification Algorithms for Position-Sensitive Gamma-Ray Detectors

    NASA Astrophysics Data System (ADS)

    Wahl, Christopher G.

    Three-dimensional-position-sensitive semiconductors record both the locations and energies of gamma-ray interactions with high resolution, enabling spectroscopy and imaging of gamma-ray-emitting materials. Imaging enables the detection of point sources of gamma rays in an otherwise extended-source background, even when the background spectrum is unknown and may share the point source's spectrum. The generalized likelihood ratio test (GLRT) and source-intensity test (SIT) are applied to this situation to detect one-or-more unshielded point sources from a library of isotopes in a spectrally unknown or known background when the background intensity varies spatially by a factor of two or less. In addition to estimating the number of sources present, their activities, isotopes, and directions from the detector are estimated. Experimental and some simulated results are presented for a single detector and an 18-detector array of 2 cm by 2 cm by 1.5 cm CdZnTe crystals and compared with the performance of spectral-only detection when the background and source are assumed to be spectrally different. Furthermore, the expected detection performance of the 18-detector array system is investigated statistically using experimental data in the case where the background is distinct spectrally from the point source and the possible source location and isotopic identity are known. Including imaging gave at least 7% higher SNR compared to ignoring the image dimension. Also, imaging methods based on the maximum-likelihood, expectation-maximization method are introduced to determine the spatial distribution of isotopes and to find the activity distributions within targets moving with known motion through a radioactive background. Software has also been developed to support the analysis of the data from 3D-position-sensitive spectroscopic systems, for a range of detector designs and applications. The software design and unique features that allow fast multidimensional data analysis are

  1. A complexity-performance-balanced multiuser detector based on artificial fish swarm algorithm for DS-UWB systems in the AWGN and multipath environments

    NASA Astrophysics Data System (ADS)

    Yin, Zhendong; Zong, Zhiyuan; Sun, Hongjian; Wu, Zhilu; Yang, Zhutian

    2012-12-01

    In this article, an efficient multiuser detector based on the artificial fish swarm algorithm (AFSA-MUD) is proposed and investigated for direct-sequence ultrawideband systems under different channels: the additive white Gaussian noise channel and the IEEE 802.15.3a multipath channel. From the literature review, the issues that the computational complexity of classical optimum multiuser detection (OMD) rises exponentially with the number of users and the bit error rate (BER) performance of other sub-optimal multiuser detectors is not satisfactory, still need to be solved. This proposed method can make a good tradeoff between complexity and performance through the various behaviors of artificial fishes in the simplified Euclidean solution space, which is constructed by the solutions of some sub-optimal multiuser detectors. Here, these sub-optimal detectors are minimum mean square error detector, decorrelating detector, and successive interference cancellation detector. As a result of this novel scheme, the convergence speed of AFSA-MUD is greatly accelerated and the number of iterations is also significantly reduced. The experimental results demonstrate that the BER performance and the near-far effect resistance of this proposed algorithm are quite close to those of OMD, while its computational complexity is much lower than the traditional OMD. Moreover, as the number of active users increases, the BER performance of AFSA-MUD is almost the same as that of OMD.

  2. Alignability of Optical Interconnects

    NASA Astrophysics Data System (ADS)

    Beech, Russell Scott

    With the continuing drive towards higher speed, density, and functionality in electronics, electrical interconnects become inadequate. Due to optics' high speed and bandwidth, freedom from capacitive loading effects, and freedom from crosstalk, optical interconnects can meet more stringent interconnect requirements. But, an optical interconnect requires additional components, such as an optical source and detector, lenses, holographic elements, etc. Fabrication and assembly of an optical interconnect requires precise alignment of these components. The successful development and deployment of optical interconnects depend on how easily the interconnect components can be aligned and/or how tolerant the interconnect is to misalignments. In this thesis, a method of quantitatively specifying the relative difficulty of properly aligning an optical interconnect is described. Ways of using this theory of alignment to obtain design and packaging guidelines for optical interconnects are examined. The measure of the ease with which an optical interconnect can be aligned, called the alignability, uses the efficiency of power transfer as a measure of alignment quality. The alignability is related to interconnect package design through the overall cost measure, which depends upon various physical parameters of the interconnect, such as the cost of the components and the time required for fabrication and alignment. Through a mutual dependence on detector size, the relationship between an interconnect's alignability and its bandwidth, signal-to-noise ratio, and bit-error -rate is examined. The results indicate that a range of device sizes exists for which given performance threshold values are satisfied. Next, the alignability of integrated planar-optic backplanes is analyzed in detail. The resulting data show that the alignability can be optimized by varying the substrate thickness or the angle of reflection. By including the effects of crosstalk, in a multi-channel backplane, the

  3. Finding local structural similarities among families of unrelated protein structures: a generic non-linear alignment algorithm.

    PubMed

    Lehtonen, J V; Denessiouk, K; May, A C; Johnson, M S

    1999-02-15

    We have developed a generic tool for the automatic identification of regions of local structural similarity in unrelated proteins having different folds, as well as for defining more global similarities that result from homologous protein structures. The computer program GENFIT has evolved from the genetic algorithm-based three-dimensional protein structure comparison program GA_FIT. GENFIT, however, can locate and superimpose regions of local structural homology regardless of their position in a pair of structures, the fold topology, or the chain direction. Furthermore, it is possible to restrict the search to a volume centered about a region of interest (e.g., catalytic site, ligand-binding site) in two protein structures. We present a number of examples to illustrate the function of the program, which is a parallel processing implementation designed for distribution to multiple machines over a local network or to run on a single multiprocessor computer.

  4. Pairwise Sequence Alignment Library

    SciTech Connect

    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, a 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.

  5. Pairwise Sequence Alignment Library

    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 footprintmore » 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, a 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

  6. ANDI-03: a genetic algorithm tool for the analysis of activation detector data to unfold high-energy neutron spectra.

    PubMed

    Mukherjee, Bhaskar

    2004-01-01

    The thresholds of (n,xn) reactions in various activation detectors are commonly used to unfold the neutron spectra covering a broad energy span, i.e. from thermal to several hundreds of MeV. The saturation activities of the daughter nuclides (i.e. reaction products) serve as the input data of specific spectra unfolding codes, such as SAND-II and LOUHI-83. However, most spectra unfolding codes, including the above, require an a priori (guess) spectrum to starting up the unfolding procedure of an unknown spectrum. The accuracy and exactness of the resulting spectrum primarily depends on the subjectively chosen guess spectrum. On the other hand, the Genetic Algorithm (GA)-based spectra unfolding technique ANDI-03 (Activation-detector Neutron DIfferentiation) presented in this report does not require a specific starting parameter. The GA is a robust problem-solving tool, which emulates the Darwinian Theory of Evolution prevailing in the realm of biological world and is ideally suited to optimise complex objective functions globally in a large multidimensional solution space. The activation data of the 27Al(n,alpha)24Na, 116In(n,gamma)116mIn, 12C(n,2n)11C and 209Bi(n,xn)(210-x)Bi reactions recorded at the high-energy neutron field of the ISIS Spallation source (Rutherford Appleton Laboratory, UK) was obtained from literature and by applying the ANDI-03 GA tool, these data were used to unfold the neutron spectra. The total neutron fluence derived from the neutron spectrum unfolded using GA technique (ANDI-03) agreed within +/-6.9% (at shield top level) and +/-27.2% (behind a 60 cm thick concrete shield) with the same unfolded with the SAND-II code.

  7. ANDI-03: a genetic algorithm tool for the analysis of activation detector data to unfold high-energy neutron spectra.

    PubMed

    Mukherjee, Bhaskar

    2004-01-01

    The thresholds of (n,xn) reactions in various activation detectors are commonly used to unfold the neutron spectra covering a broad energy span, i.e. from thermal to several hundreds of MeV. The saturation activities of the daughter nuclides (i.e. reaction products) serve as the input data of specific spectra unfolding codes, such as SAND-II and LOUHI-83. However, most spectra unfolding codes, including the above, require an a priori (guess) spectrum to starting up the unfolding procedure of an unknown spectrum. The accuracy and exactness of the resulting spectrum primarily depends on the subjectively chosen guess spectrum. On the other hand, the Genetic Algorithm (GA)-based spectra unfolding technique ANDI-03 (Activation-detector Neutron DIfferentiation) presented in this report does not require a specific starting parameter. The GA is a robust problem-solving tool, which emulates the Darwinian Theory of Evolution prevailing in the realm of biological world and is ideally suited to optimise complex objective functions globally in a large multidimensional solution space. The activation data of the 27Al(n,alpha)24Na, 116In(n,gamma)116mIn, 12C(n,2n)11C and 209Bi(n,xn)(210-x)Bi reactions recorded at the high-energy neutron field of the ISIS Spallation source (Rutherford Appleton Laboratory, UK) was obtained from literature and by applying the ANDI-03 GA tool, these data were used to unfold the neutron spectra. The total neutron fluence derived from the neutron spectrum unfolded using GA technique (ANDI-03) agreed within +/-6.9% (at shield top level) and +/-27.2% (behind a 60 cm thick concrete shield) with the same unfolded with the SAND-II code. PMID:15353654

  8. Monte Carlo simulation using the PENELOPE code with an ant colony algorithm to study MOSFET detectors

    NASA Astrophysics Data System (ADS)

    Carvajal, M. A.; García-Pareja, S.; Guirado, D.; Vilches, M.; Anguiano, M.; Palma, A. J.; Lallena, A. M.

    2009-10-01

    In this work we have developed a simulation tool, based on the PENELOPE code, to study the response of MOSFET devices to irradiation with high-energy photons. The energy deposited in the extremely thin silicon dioxide layer has been calculated. To reduce the statistical uncertainties, an ant colony algorithm has been implemented to drive the application of splitting and Russian roulette as variance reduction techniques. In this way, the uncertainty has been reduced by a factor of ~5, while the efficiency is increased by a factor of above 20. As an application, we have studied the dependence of the response of the pMOS transistor 3N163, used as a dosimeter, with the incidence angle of the radiation for three common photons sources used in radiotherapy: a 60Co Theratron-780 and the 6 and 18 MV beams produced by a Mevatron KDS LINAC. Experimental and simulated results have been obtained for gantry angles of 0o, 15o, 30o, 45o, 60o and 75o. The agreement obtained has permitted validation of the simulation tool. We have studied how to reduce the angular dependence of the MOSFET response by using an additional encapsulation made of brass in the case of the two LINAC qualities considered.

  9. Monte Carlo simulation using the PENELOPE code with an ant colony algorithm to study MOSFET detectors.

    PubMed

    Carvajal, M A; García-Pareja, S; Guirado, D; Vilches, M; Anguiano, M; Palma, A J; Lallena, A M

    2009-10-21

    In this work we have developed a simulation tool, based on the PENELOPE code, to study the response of MOSFET devices to irradiation with high-energy photons. The energy deposited in the extremely thin silicon dioxide layer has been calculated. To reduce the statistical uncertainties, an ant colony algorithm has been implemented to drive the application of splitting and Russian roulette as variance reduction techniques. In this way, the uncertainty has been reduced by a factor of approximately 5, while the efficiency is increased by a factor of above 20. As an application, we have studied the dependence of the response of the pMOS transistor 3N163, used as a dosimeter, with the incidence angle of the radiation for three common photons sources used in radiotherapy: a (60)Co Theratron-780 and the 6 and 18 MV beams produced by a Mevatron KDS LINAC. Experimental and simulated results have been obtained for gantry angles of 0 degrees, 15 degrees, 30 degrees, 45 degrees, 60 degrees and 75 degrees. The agreement obtained has permitted validation of the simulation tool. We have studied how to reduce the angular dependence of the MOSFET response by using an additional encapsulation made of brass in the case of the two LINAC qualities considered. PMID:19794247

  10. ALDF Data Retrieval Algorithms for Validating the Optical Transient Detector (OTD) and the Lightning Imaging Sensor (LIS)

    NASA Technical Reports Server (NTRS)

    Koshak, W. J.; Blakeslee, R. J.; Bailey, J. C.

    1997-01-01

    A linear algebraic solution is provided for the problem of retrieving the location and time of occurrence of lightning ground strikes from in Advanced Lightning Direction Finder (ALDF) network. The ALDF network measures field strength, magnetic bearing, and arrival time of lightning radio emissions and solutions for the plane (i.e.. no Earth curvature) are provided that implement all of these measurements. The accuracy of the retrieval method is tested using computer-simulated data sets and the relative influence of bearing and arrival time data on the outcome of the final solution is formally demonstrated. The algorithm is sufficiently accurate to validate NASA's Optical Transient Detector (OTD) and Lightning Imaging System (LIS). We also introduce a quadratic planar solution that is useful when only three arrival time measurements are available. The algebra of the quadratic root results are examined in detail to clarify what portions of the analysis region lead to fundamental ambiguities in source location. Complex root results are shown to be associated with the presence of measurement errors when the lightning source lies near an outer sensor baseline of the ALDF network. For arbitrary noncollinear network geometries and in the absence of measurement errors, it is shown that the two quadratic roots are equivalent (no source location ambiguity) on the outer sensor baselines. The accuracy of the quadratic planar method is tested with computer-generated data sets and the results are generally better than those obtained from the three station linear planar method when bearing errors are about 2 degrees.

  11. A personal neutron monitoring system based on CR-39 recoil proton track detectors: assessment of Hp(10) using image process algorithms.

    PubMed

    Bedogni, R; Fantuzzi, E

    2002-01-01

    At the Individual Monitoring Service (IMS) of the ENEA Institute for Radiation Protection (IRP), the Hp(10) fast neutron dosemeter consists of a CR-39 (PADC, poly allyl diglycol carbonate) recoil protons track detector. The tracks across the detector surface are magnified through a chemical etching procedure and counted by a semi-automated system which consists of a microscope, a camera and a PC. A new analysis system, based on the National Instruments vision tools, was developed. The track area distribution for each reading field is recorded and numerical algorithms were developed in order to correct the energy dependence of the response and to recognise the tracks due to the background. This improves the dose evaluation system in terms of accuracy and discrimination or the background. PMID:12382731

  12. Pareto optimal pairwise sequence alignment.

    PubMed

    DeRonne, Kevin W; Karypis, George

    2013-01-01

    Sequence alignment using evolutionary profiles is a commonly employed tool when investigating a protein. Many profile-profile scoring functions have been developed for use in such alignments, but there has not yet been a comprehensive study of Pareto optimal pairwise alignments for combining multiple such functions. We show that the problem of generating Pareto optimal pairwise alignments has an optimal substructure property, and develop an efficient algorithm for generating Pareto optimal frontiers of pairwise alignments. All possible sets of two, three, and four profile scoring functions are used from a pool of 11 functions and applied to 588 pairs of proteins in the ce_ref data set. The performance of the best objective combinations on ce_ref is also evaluated on an independent set of 913 protein pairs extracted from the BAliBASE RV11 data set. Our dynamic-programming-based heuristic approach produces approximated Pareto optimal frontiers of pairwise alignments that contain comparable alignments to those on the exact frontier, but on average in less than 1/58th the time in the case of four objectives. Our results show that the Pareto frontiers contain alignments whose quality is better than the alignments obtained by single objectives. However, the task of identifying a single high-quality alignment among those in the Pareto frontier remains challenging.

  13. Implementation of a Parallel Protein Structure Alignment Service on Cloud

    PubMed Central

    Hung, Che-Lun; Lin, Yaw-Ling

    2013-01-01

    Protein structure alignment has become an important strategy by which to identify evolutionary relationships between protein sequences. Several alignment tools are currently available for online comparison of protein structures. In this paper, we propose a parallel protein structure alignment service based on the Hadoop distribution framework. This service includes a protein structure alignment algorithm, a refinement algorithm, and a MapReduce programming model. The refinement algorithm refines the result of alignment. To process vast numbers of protein structures in parallel, the alignment and refinement algorithms are implemented using MapReduce. We analyzed and compared the structure alignments produced by different methods using a dataset randomly selected from the PDB database. The experimental results verify that the proposed algorithm refines the resulting alignments more accurately than existing algorithms. Meanwhile, the computational performance of the proposed service is proportional to the number of processors used in our cloud platform. PMID:23671842

  14. Implementation of a parallel protein structure alignment service on cloud.

    PubMed

    Hung, Che-Lun; Lin, Yaw-Ling

    2013-01-01

    Protein structure alignment has become an important strategy by which to identify evolutionary relationships between protein sequences. Several alignment tools are currently available for online comparison of protein structures. In this paper, we propose a parallel protein structure alignment service based on the Hadoop distribution framework. This service includes a protein structure alignment algorithm, a refinement algorithm, and a MapReduce programming model. The refinement algorithm refines the result of alignment. To process vast numbers of protein structures in parallel, the alignment and refinement algorithms are implemented using MapReduce. We analyzed and compared the structure alignments produced by different methods using a dataset randomly selected from the PDB database. The experimental results verify that the proposed algorithm refines the resulting alignments more accurately than existing algorithms. Meanwhile, the computational performance of the proposed service is proportional to the number of processors used in our cloud platform. PMID:23671842

  15. MUSE optical alignment procedure

    NASA Astrophysics Data System (ADS)

    Laurent, Florence; Renault, Edgard; Loupias, Magali; Kosmalski, Johan; Anwand, Heiko; Bacon, Roland; Boudon, Didier; Caillier, Patrick; Daguisé, Eric; Dubois, Jean-Pierre; Dupuy, Christophe; Kelz, Andreas; Lizon, Jean-Louis; Nicklas, Harald; Parès, Laurent; Remillieux, Alban; Seifert, Walter; Valentin, Hervé; Xu, Wenli

    2012-09-01

    MUSE (Multi Unit Spectroscopic Explorer) is a second generation VLT integral field spectrograph (1x1arcmin² Field of View) developed for the European Southern Observatory (ESO), operating in the visible wavelength range (0.465-0.93 μm). A consortium of seven institutes is currently assembling and testing MUSE in the Integration Hall of the Observatoire de Lyon for the Preliminary Acceptance in Europe, scheduled for 2013. MUSE is composed of several subsystems which are under the responsibility of each institute. The Fore Optics derotates and anamorphoses the image at the focal plane. A Splitting and Relay Optics feed the 24 identical Integral Field Units (IFU), that are mounted within a large monolithic instrument mechanical structure. Each IFU incorporates an image slicer, a fully refractive spectrograph with VPH-grating and a detector system connected to a global vacuum and cryogenic system. During 2011, all MUSE subsystems were integrated, aligned and tested independently in each institute. After validations, the systems were shipped to the P.I. institute at Lyon and were assembled in the Integration Hall This paper describes the end-to-end optical alignment procedure of the MUSE instrument. The design strategy, mixing an optical alignment by manufacturing (plug and play approach) and few adjustments on key components, is presented. We depict the alignment method for identifying the optical axis using several references located in pupil and image planes. All tools required to perform the global alignment between each subsystem are described. The success of this alignment approach is demonstrated by the good results for the MUSE image quality. MUSE commissioning at the VLT (Very Large Telescope) is planned for 2013.

  16. Algorithms for minimization of charge sharing effects in a hybrid pixel detector taking into account hardware limitations in deep submicron technology

    NASA Astrophysics Data System (ADS)

    Maj, P.; Baumbaugh, A.; Deptuch, G.; Grybos, P.; Szczygiel, R.

    2012-12-01

    Charge sharing is the main limitation of pixel detectors used in spectroscopic applications, noting that this applies to both time and amplitude/energy spectroscopy. Even though, charge sharing was the subject of many studies, there is still no ultimate solution which could be implemented in the hardware to suppress the negative effects of charge sharing. This is mainly because of strong demand on low power dissipation and small silicon area of a single pixel. The first solution of this problem was proposed by CERN and consequently it was implemented in the Medipix III chip. However, due to pixel-to-pixel threshold dispersions and some imperfections of the simplified algorithm, the hit allocation was not functioning properly. We are presenting novel algorithms which allow proper hit allocation even at the presence of charge sharing. They can be implemented in an integrated circuit using a deep submicron technology. In performed simulations, we assumed not only diffusive charge spread occurring in the course of charge drifting towards the electrodes but also limitations in the readout electronics, i.e. signal fluctuations due to noise and mismatch (gain and offsets). The simulations show that using, for example, a silicon pixel detector in the low X-ray energy range, we have been able to perform proper hit position identification and use the information from summing inter-pixel nodes for spectroscopy measurements.

  17. Classification of gasoline data obtained by gas chromatography using a piecewise alignment algorithm combined with feature selection and principal component analysis

    SciTech Connect

    Pierce, Karisa M.; Hope, Janiece L.; Johnson, Kevin J.; Wright, Bob W.; Synovec, Robert E.

    2005-11-25

    A fast and objective chemometric classification method is developed and applied to the analysis of gas chromatography (GC) data from five commercial gasoline samples. The gasoline samples serve as model mixtures, whereas the focus is on the development and demonstration of the classification method. The method is based on objective retention time alignment (referred to as piecewise alignment) coupled with analysis of variance (ANOVA) feature selection prior to classification by principal component analysis (PCA) using optimal parameters. The degree-of-class-separation is used as a metric to objectively optimize the alignment and feature selection parameters using a suitable training set thereby reducing user subjectivity, as well as to indicate the success of the PCA clustering and classification. The degree-of-class-separation is calculated using Euclidean distances between the PCA scores of a subset of the replicate runs from two of the five fuel types, i.e., the training set. The unaligned training set that was directly submitted to PCA had a low degree-of-class-separation (0.4), and the PCA scores plot for the raw training set combined with the raw test set failed to correctly cluster the five sample types. After submitting the training set to piecewise alignment, the degree-of-class-separation increased (1.2), but when the same alignment parameters were applied to the training set combined with the test set, the scores plot clustering still did not yield five distinct groups. Applying feature selection to the unaligned training set increased the degree-of-class-separation (4.8), but chemical variations were still obscured by retention time variation and when the same feature selection conditions were used for the training set combined with the test set, only one of the five fuels was clustered correctly. However, piecewise alignment coupled with feature selection yielded a reasonably optimal degree-of-class-separation for the training set (9.2), and when the

  18. Lord-Wingersky Algorithm Version 2.0 for Hierarchical Item Factor Models with Applications in Test Scoring, Scale Alignment, and Model Fit Testing. CRESST Report 830

    ERIC Educational Resources Information Center

    Cai, Li

    2013-01-01

    Lord and Wingersky's (1984) recursive algorithm for creating summed score based likelihoods and posteriors has a proven track record in unidimensional item response theory (IRT) applications. Extending the recursive algorithm to handle multidimensionality is relatively simple, especially with fixed quadrature because the recursions can be defined…

  19. Technical Note: Modification of the standard gain correction algorithm to compensate for the number of used reference flat frames in detector performance studies

    SciTech Connect

    Konstantinidis, Anastasios C.; Olivo, Alessandro; Speller, Robert D.

    2011-12-15

    Purpose: The x-ray performance evaluation of digital x-ray detectors is based on the calculation of the modulation transfer function (MTF), the noise power spectrum (NPS), and the resultant detective quantum efficiency (DQE). The flat images used for the extraction of the NPS should not contain any fixed pattern noise (FPN) to avoid contamination from nonstochastic processes. The ''gold standard'' method used for the reduction of the FPN (i.e., the different gain between pixels) in linear x-ray detectors is based on normalization with an average reference flat-field. However, the noise in the corrected image depends on the number of flat frames used for the average flat image. The aim of this study is to modify the standard gain correction algorithm to make it independent on the used reference flat frames. Methods: Many publications suggest the use of 10-16 reference flat frames, while other studies use higher numbers (e.g., 48 frames) to reduce the propagated noise from the average flat image. This study quantifies experimentally the effect of the number of used reference flat frames on the NPS and DQE values and appropriately modifies the gain correction algorithm to compensate for this effect. Results: It is shown that using the suggested gain correction algorithm a minimum number of reference flat frames (i.e., down to one frame) can be used to eliminate the FPN from the raw flat image. This saves computer memory and time during the x-ray performance evaluation. Conclusions: The authors show that the method presented in the study (a) leads to the maximum DQE value that one would have by using the conventional method and very large number of frames and (b) has been compared to an independent gain correction method based on the subtraction of flat-field images, leading to identical DQE values. They believe this provides robust validation of the proposed method.

  20. Alignment fixture

    DOEpatents

    Bell, Grover C.; Gibson, O. Theodore

    1980-01-01

    A part alignment fixture is provided which may be used for precise variable lateral and tilt alignment relative to the fixture base of various shaped parts. The fixture may be used as a part holder for machining or inspection of parts or alignment of parts during assembly and the like. The fixture includes a precisely machined diameter disc-shaped hub adapted to receive the part to be aligned. The hub is nested in a guide plate which is adapted to carry two oppositely disposed pairs of positioning wedges so that the wedges may be reciprocatively positioned by means of respective micrometer screws. The sloping faces of the wedges contact the hub at respective quadrants of the hub periphery. The lateral position of the hub relative to the guide plate is adjusted by positioning the wedges with the associated micrometer screws. The tilt of the part is adjusted relative to a base plate, to which the guide plate is pivotally connected by means of a holding plate. Two pairs of oppositely disposed wedges are mounted for reciprocative lateral positioning by means of separate micrometer screws between flanges of the guide plate and the base plate. Once the wedges are positioned to achieve the proper tilt of the part or hub on which the part is mounted relative to the base plate, the fixture may be bolted to a machining, inspection, or assembly device.

  1. Curriculum Alignment.

    ERIC Educational Resources Information Center

    Crowell, Ronald; Tissot, Paula

    Curriculum alignment (CA) refers to the congruence of all the elements of a school's curriculum: curriculum goals; instructional program--what is taught and the materials used; and tests used to judge outcomes. CA can be a very powerful can be a very powerful factor in improving schools. Although further research is needed on CA, there is…

  2. Development of adaptive noise reduction filter algorithm for pediatric body images in a multi-detector CT

    NASA Astrophysics Data System (ADS)

    Nishimaru, Eiji; Ichikawa, Katsuhiro; Okita, Izumi; Ninomiya, Yuuji; Tomoshige, Yukihiro; Kurokawa, Takehiro; Ono, Yutaka; Nakamura, Yuko; Suzuki, Masayuki

    2008-03-01

    Recently, several kinds of post-processing image filters which reduce the noise of computed tomography (CT) images have been proposed. However, these image filters are mostly for adults. Because these are not very effective in small (< 20 cm) display fields of view (FOV), we cannot use them for pediatric body images (e.g., premature babies and infant children). We have developed a new noise reduction filter algorithm for pediatric body CT images. This algorithm is based on a 3D post-processing in which the output pixel values are calculated by nonlinear interpolation in z-directions on original volumetric-data-sets. This algorithm does not need the in-plane (axial plane) processing, so the spatial resolution does not change. From the phantom studies, our algorithm could reduce SD up to 40% without affecting the spatial resolution of x-y plane and z-axis, and improved the CNR up to 30%. This newly developed filter algorithm will be useful for the diagnosis and radiation dose reduction of the pediatric body CT images.

  3. Muon tomography imaging algorithms for nuclear threat detection inside large volume containers with the Muon Portal detector

    NASA Astrophysics Data System (ADS)

    Riggi, S.; Antonuccio-Delogu, V.; Bandieramonte, M.; Becciani, U.; Costa, A.; La Rocca, P.; Massimino, P.; Petta, C.; Pistagna, C.; Riggi, F.; Sciacca, E.; Vitello, F.

    2013-11-01

    Muon tomographic visualization techniques try to reconstruct a 3D image as close as possible to the real localization of the objects being probed. Statistical algorithms under test for the reconstruction of muon tomographic images in the Muon Portal Project are discussed here. Autocorrelation analysis and clustering algorithms have been employed within the context of methods based on the Point Of Closest Approach (POCA) reconstruction tool. An iterative method based on the log-likelihood approach was also implemented. Relative merits of all such methods are discussed, with reference to full GEANT4 simulations of different scenarios, incorporating medium and high-Z objects inside a container.

  4. Aligning Greek-English parallel texts

    NASA Astrophysics Data System (ADS)

    Galiotou, Eleni; Koronakis, George; Lazari, Vassiliki

    2015-02-01

    In this paper, we discuss issues concerning the alignment of parallel texts written in languages with different alphabets based on an experiment of aligning texts from the proceedings of the European Parliament in Greek and English. First, we describe our implementation of the k-vec algorithm and its application to the bilingual corpus. Then the output of the algorithm is used as a starting point for an alignment procedure at a sentence level which also takes into account mark-ups of meta-information. The results of the implementation are compared to those of the application of the Church and Gale alignment algorithm on the Europarl corpus. The conclusions of this comparison can give useful insights as for the efficiency of alignment algorithms when applied to the particular bilingual corpus.

  5. Simultaneous Alignment and Folding of Protein Sequences

    PubMed Central

    Waldispühl, Jérôme; O'Donnell, Charles W.; Will, Sebastian; Devadas, Srinivas; Backofen, Rolf

    2014-01-01

    Abstract Accurate comparative analysis tools for low-homology proteins remains a difficult challenge in computational biology, especially sequence alignment and consensus folding problems. We present partiFold-Align, the first algorithm for simultaneous alignment and consensus folding of unaligned protein sequences; the algorithm's complexity is polynomial in time and space. Algorithmically, partiFold-Align exploits sparsity in the set of super-secondary structure pairings and alignment candidates to achieve an effectively cubic running time for simultaneous pairwise alignment and folding. We demonstrate the efficacy of these techniques on transmembrane β-barrel proteins, an important yet difficult class of proteins with few known three-dimensional structures. Testing against structurally derived sequence alignments, partiFold-Align significantly outperforms state-of-the-art pairwise and multiple sequence alignment tools in the most difficult low-sequence homology case. It also improves secondary structure prediction where current approaches fail. Importantly, partiFold-Align requires no prior training. These general techniques are widely applicable to many more protein families (partiFold-Align is available at http://partifold.csail.mit.edu/). PMID:24766258

  6. ALIGNING JIG

    DOEpatents

    Culver, J.S.; Tunnell, W.C.

    1958-08-01

    A jig or device is described for setting or aligning an opening in one member relative to another member or structure, with a predetermined offset, or it may be used for measuring the amount of offset with which the parts have previously been sct. This jig comprises two blocks rabbeted to each other, with means for securing thc upper block to the lower block. The upper block has fingers for contacting one of the members to be a1igmed, the lower block is designed to ride in grooves within the reference member, and calibration marks are provided to determine the amount of offset. This jig is specially designed to align the collimating slits of a mass spectrometer.

  7. Reliable automatic alignment of tomographic projection data by passive auto-focus

    SciTech Connect

    Kingston, A.; Sakellariou, A.; Varslot, T.; Myers, G.; Sheppard, A.

    2011-09-15

    Purpose: The authors present a robust algorithm that removes the blurring and double-edge artifacts in high-resolution computed tomography (CT) images that are caused by misaligned scanner components. This alleviates the time-consuming process of physically aligning hardware, which is of particular benefit if components are moved or swapped frequently. Methods: The proposed method uses the experimental data itself for calibration. A parameterized model of the scanner geometry is constructed and the parameters are varied until the sharpest 3D reconstruction is found. The concept is similar to passive auto-focus algorithms of digital optical instruments. The parameters are used to remap the projection data from the physical detector to a virtual aligned detector. This is followed by a standard reconstruction algorithm, namely the Feldkamp algorithm. Feldkamp et al.[J. Opt. Soc. Am. A 1, 612-619 (1984)]. Results: An example implementation is given for a rabbit liver specimen that was collected with a circular trajectory. The optimal parameters were determined in less computation time than that for a full reconstruction. The example serves to demonstrate that (a) sharpness is an appropriate measure for projection alignment, (b) our parameterization is sufficient to characterize misalignments for cone-beam CT, and (c) the procedure determines parameter values with sufficient precision to remove the associated artifacts. Conclusions: The algorithm is fully tested and implemented for regular use at The Australian National University micro-CT facility for both circular and helical trajectories. It can in principle be applied to more general imaging geometries and modalities. It is as robust as manual alignment but more precise since we have quantified the effect of misalignment.

  8. Image alignment

    SciTech Connect

    Dowell, Larry Jonathan

    2014-04-22

    Disclosed is a method and device for aligning at least two digital images. An embodiment may use frequency-domain transforms of small tiles created from each image to identify substantially similar, "distinguishing" features within each of the images, and then align the images together based on the location of the distinguishing features. To accomplish this, an embodiment may create equal sized tile sub-images for each image. A "key" for each tile may be created by performing a frequency-domain transform calculation on each tile. A information-distance difference between each possible pair of tiles on each image may be calculated to identify distinguishing features. From analysis of the information-distance differences of the pairs of tiles, a subset of tiles with high discrimination metrics in relation to other tiles may be located for each image. The subset of distinguishing tiles for each image may then be compared to locate tiles with substantially similar keys and/or information-distance metrics to other tiles of other images. Once similar tiles are located for each image, the images may be aligned in relation to the identified similar tiles.

  9. GramAlign: fast alignment driven by grammar-based phylogeny.

    PubMed

    Russell, David J

    2014-01-01

    Multiple sequence alignment involves identifying related subsequences among biological sequences. When matches are found, the associated pieces are shifted so that when sequences are presented as successive rows-one sequence per row-homologous residues line-up in columns. Exact alignment of more than a few sequences is known to be computationally prohibitive. Thus many heuristic algorithms have been developed to produce good alignments in an efficient amount of time by determining an order by which pairs of sequences are progressively aligned and merged. GRAMALIGN is such a progressive alignment algorithm that uses a grammar-based relative complexity distance metric to determine the alignment order. This technique allows for a computationally efficient and scalable program useful for aligning both large numbers of sequences and sets of long sequences quickly. The GRAMALIGN software is available at http://bioinfo.unl.edu/gramalign.php for both source code download and a web-based alignment server.

  10. Lord-Wingersky Algorithm Version 2.0 for Hierarchical Item Factor Models with Applications in Test Scoring, Scale Alignment, and Model Fit Testing

    PubMed Central

    Cai, Li

    2014-01-01

    Lord and Wingersky’s (1984) recursive algorithm for creating summed score based likelihoods and posteriors has a proven track record in unidimensional item response theory (IRT) applications. Extending the recursive algorithm to handle multidimensionality is relatively simple, especially with fixed quadrature because the recursions can be defined on a grid formed by direct products of quadrature points. However, the increase in computational burden remains exponential in the number of dimensions, making the implementation of the recursive algorithm cumbersome for truly high dimensional models. In this paper, a dimension reduction method that is specific to the Lord-Wingersky recursions is developed. This method can take advantage of the restrictions implied by hierarchical item factor models, e.g., the bifactor model, the testlet model, or the two-tier model, such that a version of the Lord-Wingersky recursive algorithm can operate on a dramatically reduced set of quadrature points. For instance, in a bifactor model, the dimension of integration is always equal to 2, regardless of the number of factors. The new algorithm not only provides an effective mechanism to produce summed score to IRT scaled score translation tables properly adjusted for residual dependence, but leads to new applications in test scoring, linking, and model fit checking as well. Simulated and empirical examples are used to illustrate the new applications. PMID:25233839

  11. Lord-Wingersky Algorithm Version 2.0 for Hierarchical Item Factor Models with Applications in Test Scoring, Scale Alignment, and Model Fit Testing.

    PubMed

    Cai, Li

    2015-06-01

    Lord and Wingersky's (Appl Psychol Meas 8:453-461, 1984) recursive algorithm for creating summed score based likelihoods and posteriors has a proven track record in unidimensional item response theory (IRT) applications. Extending the recursive algorithm to handle multidimensionality is relatively simple, especially with fixed quadrature because the recursions can be defined on a grid formed by direct products of quadrature points. However, the increase in computational burden remains exponential in the number of dimensions, making the implementation of the recursive algorithm cumbersome for truly high-dimensional models. In this paper, a dimension reduction method that is specific to the Lord-Wingersky recursions is developed. This method can take advantage of the restrictions implied by hierarchical item factor models, e.g., the bifactor model, the testlet model, or the two-tier model, such that a version of the Lord-Wingersky recursive algorithm can operate on a dramatically reduced set of quadrature points. For instance, in a bifactor model, the dimension of integration is always equal to 2, regardless of the number of factors. The new algorithm not only provides an effective mechanism to produce summed score to IRT scaled score translation tables properly adjusted for residual dependence, but leads to new applications in test scoring, linking, and model fit checking as well. Simulated and empirical examples are used to illustrate the new applications.

  12. CATO: The Clone Alignment Tool.

    PubMed

    Henstock, Peter V; LaPan, Peter

    2016-01-01

    High-throughput cloning efforts produce large numbers of sequences that need to be aligned, edited, compared with reference sequences, and organized as files and selected clones. Different pieces of software are typically required to perform each of these tasks. We have designed a single piece of software, CATO, the Clone Alignment Tool, that allows a user to align, evaluate, edit, and select clone sequences based on comparisons to reference sequences. The input and output are designed to be compatible with standard data formats, and thus suitable for integration into a clone processing pipeline. CATO provides both sequence alignment and visualizations to facilitate the analysis of cloning experiments. The alignment algorithm matches each of the relevant candidate sequences against each reference sequence. The visualization portion displays three levels of matching: 1) a top-level summary of the top candidate sequences aligned to each reference sequence, 2) a focused alignment view with the nucleotides of matched sequences displayed against one reference sequence, and 3) a pair-wise alignment of a single reference and candidate sequence pair. Users can select the minimum matching criteria for valid clones, edit or swap reference sequences, and export the results to a summary file as part of the high-throughput cloning workflow.

  13. CATO: The Clone Alignment Tool.

    PubMed

    Henstock, Peter V; LaPan, Peter

    2016-01-01

    High-throughput cloning efforts produce large numbers of sequences that need to be aligned, edited, compared with reference sequences, and organized as files and selected clones. Different pieces of software are typically required to perform each of these tasks. We have designed a single piece of software, CATO, the Clone Alignment Tool, that allows a user to align, evaluate, edit, and select clone sequences based on comparisons to reference sequences. The input and output are designed to be compatible with standard data formats, and thus suitable for integration into a clone processing pipeline. CATO provides both sequence alignment and visualizations to facilitate the analysis of cloning experiments. The alignment algorithm matches each of the relevant candidate sequences against each reference sequence. The visualization portion displays three levels of matching: 1) a top-level summary of the top candidate sequences aligned to each reference sequence, 2) a focused alignment view with the nucleotides of matched sequences displayed against one reference sequence, and 3) a pair-wise alignment of a single reference and candidate sequence pair. Users can select the minimum matching criteria for valid clones, edit or swap reference sequences, and export the results to a summary file as part of the high-throughput cloning workflow. PMID:27459605

  14. CATO: The Clone Alignment Tool

    PubMed Central

    Henstock, Peter V.; LaPan, Peter

    2016-01-01

    High-throughput cloning efforts produce large numbers of sequences that need to be aligned, edited, compared with reference sequences, and organized as files and selected clones. Different pieces of software are typically required to perform each of these tasks. We have designed a single piece of software, CATO, the Clone Alignment Tool, that allows a user to align, evaluate, edit, and select clone sequences based on comparisons to reference sequences. The input and output are designed to be compatible with standard data formats, and thus suitable for integration into a clone processing pipeline. CATO provides both sequence alignment and visualizations to facilitate the analysis of cloning experiments. The alignment algorithm matches each of the relevant candidate sequences against each reference sequence. The visualization portion displays three levels of matching: 1) a top-level summary of the top candidate sequences aligned to each reference sequence, 2) a focused alignment view with the nucleotides of matched sequences displayed against one reference sequence, and 3) a pair-wise alignment of a single reference and candidate sequence pair. Users can select the minimum matching criteria for valid clones, edit or swap reference sequences, and export the results to a summary file as part of the high-throughput cloning workflow. PMID:27459605

  15. Synthetic approach to designing optical alignment systems.

    PubMed

    Whang, A J; Gallagher, N C

    1988-08-15

    The objective of this study is twofold: to design reticle patterns with desirable alignment properties; to build an automatic alignment system using these patterns. We design such reticle patterns via a synthetic approach; the resultant patterns, so-called pseudonoise arrays, are binary and their autocorrelation functions are bilevel. Both properties are desirable in optical alignment. Besides, these arrays have attractive signal-to-noise ratio performance when employed in alignment. We implement the pseudonoise array as a 2-D cross-grating structure of which the grating period is much less than the wavelength of impinging light used for alignment. The short grating period feature, together with the use of polarized light, enables us to perform essentially 2-D optical alignment in one dimension. This alignment separability allows us to build a system that performs alignment automatically according to a simple 1-D algorithm. PMID:20539412

  16. Face Alignment via Regressing Local Binary Features.

    PubMed

    Ren, Shaoqing; Cao, Xudong; Wei, Yichen; Sun, Jian

    2016-03-01

    This paper presents a highly efficient and accurate regression approach for face alignment. Our approach has two novel components: 1) a set of local binary features and 2) a locality principle for learning those features. The locality principle guides us to learn a set of highly discriminative local binary features for each facial landmark independently. The obtained local binary features are used to jointly learn a linear regression for the final output. This approach achieves the state-of-the-art results when tested on the most challenging benchmarks to date. Furthermore, because extracting and regressing local binary features are computationally very cheap, our system is much faster than previous methods. It achieves over 3000 frames per second (FPS) on a desktop or 300 FPS on a mobile phone for locating a few dozens of landmarks. We also study a key issue that is important but has received little attention in the previous research, which is the face detector used to initialize alignment. We investigate several face detectors and perform quantitative evaluation on how they affect alignment accuracy. We find that an alignment friendly detector can further greatly boost the accuracy of our alignment method, reducing the error up to 16% relatively. To facilitate practical usage of face detection/alignment methods, we also propose a convenient metric to measure how good a detector is for alignment initialization.

  17. Drift Chamber Alignment using Cosmic Rays

    SciTech Connect

    Kotwal, Ashutosh V.; Hays, Christopher P.

    2014-05-07

    The Collider Detector at Fermilab (CDF) is a general-purpose experimental apparatus with an inner tracking detector for measuring charged particles, surrounded by a calorimeter for measurements of electromagnetic and hadronic showers, and a muon detector system. We present a technique for, and results of, a precise relative alignment of the drift chamber wires of the CDF tracker. This alignment has been an important component of the track momentum calibration, which is the basis for the charged-lepton calibration for the measurement of the W boson mass at CDF.

  18. Blasting and Zipping: Sequence Alignment and Mutual Information

    NASA Astrophysics Data System (ADS)

    Penner, Orion; Grassberger, Peter; Paczuski, Maya

    2009-03-01

    Alignment of biological sequences such as DNA, RNA or proteins is one of the most widely used tools in computational bioscience. While the accomplishments of sequence alignment algorithms are undeniable the fact remains that these algorithms are based upon heuristic scoring schemes. Therefore, these algorithms do not provide model independent and objective measures for how similar two (or more) sequences actually are. Although information theory provides such a similarity measure - the mutual information (MI) - numerous previous attempts to connect sequence alignment and information have not produced realistic estimates for the MI from a given alignment. We report on a simple and flexible approach to get robust estimates of MI from global alignments. The presented results may help establish MI as a reliable tool for evaluating the quality of global alignments, judging the relative merits of different alignment algorithms, and estimating the significance of specific alignments.

  19. BinAligner: a heuristic method to align biological networks

    PubMed Central

    2013-01-01

    The advances in high throughput omics technologies have made it possible to characterize molecular interactions within and across various species. Alignments and comparison of molecular networks across species will help detect orthologs and conserved functional modules and provide insights on the evolutionary relationships of the compared species. However, such analyses are not trivial due to the complexity of network and high computational cost. Here we develop a mixture of global and local algorithm, BinAligner, for network alignments. Based on the hypotheses that the similarity between two vertices across networks would be context dependent and that the information from the edges and the structures of subnetworks can be more informative than vertices alone, two scoring schema, 1-neighborhood subnetwork and graphlet, were introduced to derive the scoring matrices between networks, besides the commonly used scoring scheme from vertices. Then the alignment problem is formulated as an assignment problem, which is solved by the combinatorial optimization algorithm, such as the Hungarian method. The proposed algorithm was applied and validated in aligning the protein-protein interaction network of Kaposi's sarcoma associated herpesvirus (KSHV) and that of varicella zoster virus (VZV). Interestingly, we identified several putative functional orthologous proteins with similar functions but very low sequence similarity between the two viruses. For example, KSHV open reading frame 56 (ORF56) and VZV ORF55 are helicase-primase subunits with sequence identity 14.6%, and KSHV ORF75 and VZV ORF44 are tegument proteins with sequence identity 15.3%. These functional pairs can not be identified if one restricts the alignment into orthologous protein pairs. In addition, BinAligner identified a conserved pathway between two viruses, which consists of 7 orthologous protein pairs and these proteins are connected by conserved links. This pathway might be crucial for virus packing and

  20. MUSE alignment onto VLT

    NASA Astrophysics Data System (ADS)

    Laurent, Florence; Renault, Edgard; Boudon, Didier; Caillier, Patrick; Daguisé, Eric; Dupuy, Christophe; Jarno, Aurélien; Lizon, Jean-Louis; Migniau, Jean-Emmanuel; Nicklas, Harald; Piqueras, Laure

    2014-07-01

    MUSE (Multi Unit Spectroscopic Explorer) is a second generation Very Large Telescope (VLT) integral field spectrograph developed for the European Southern Observatory (ESO). It combines a 1' x 1' field of view sampled at 0.2 arcsec for its Wide Field Mode (WFM) and a 7.5"x7.5" field of view for its Narrow Field Mode (NFM). Both modes will operate with the improved spatial resolution provided by GALACSI (Ground Atmospheric Layer Adaptive Optics for Spectroscopic Imaging), that will use the VLT deformable secondary mirror and 4 Laser Guide Stars (LGS) foreseen in 2015. MUSE operates in the visible wavelength range (0.465-0.93 μm). A consortium of seven institutes is currently commissioning MUSE in the Very Large Telescope for the Preliminary Acceptance in Chile, scheduled for September, 2014. MUSE is composed of several subsystems which are under the responsibility of each institute. The Fore Optics derotates and anamorphoses the image at the focal plane. A Splitting and Relay Optics feed the 24 identical Integral Field Units (IFU), that are mounted within a large monolithic structure. Each IFU incorporates an image slicer, a fully refractive spectrograph with VPH-grating and a detector system connected to a global vacuum and cryogenic system. During 2012 and 2013, all MUSE subsystems were integrated, aligned and tested to the P.I. institute at Lyon. After successful PAE in September 2013, MUSE instrument was shipped to the Very Large Telescope in Chile where that was aligned and tested in ESO integration hall at Paranal. After, MUSE was directly transported, fully aligned and without any optomechanical dismounting, onto VLT telescope where the first light was overcame the 7th of February, 2014. This paper describes the alignment procedure of the whole MUSE instrument with respect to the Very Large Telescope (VLT). It describes how 6 tons could be move with accuracy better than 0.025mm and less than 0.25 arcmin in order to reach alignment requirements. The success

  1. Triangular Alignment (TAME). A Tensor-based Approach for Higher-order Network Alignment

    SciTech Connect

    Mohammadi, Shahin; Gleich, David F.; Kolda, Tamara G.; Grama, Ananth

    2015-11-01

    Network alignment is an important tool with extensive applications in comparative interactomics. Traditional approaches aim to simultaneously maximize the number of conserved edges and the underlying similarity of aligned entities. We propose a novel formulation of the network alignment problem that extends topological similarity to higher-order structures and provide a new objective function that maximizes the number of aligned substructures. This objective function corresponds to an integer programming problem, which is NP-hard. Consequently, we approximate this objective function as a surrogate function whose maximization results in a tensor eigenvalue problem. Based on this formulation, we present an algorithm called Triangular AlignMEnt (TAME), which attempts to maximize the number of aligned triangles across networks. We focus on alignment of triangles because of their enrichment in complex networks; however, our formulation and resulting algorithms can be applied to general motifs. Using a case study on the NAPABench dataset, we show that TAME is capable of producing alignments with up to 99% accuracy in terms of aligned nodes. We further evaluate our method by aligning yeast and human interactomes. Our results indicate that TAME outperforms the state-of-art alignment methods both in terms of biological and topological quality of the alignments.

  2. Algorithm and implementation of muon trigger and data transmission system for barrel-endcap overlap region of the CMS detector

    NASA Astrophysics Data System (ADS)

    Zabolotny, W. M.; Byszuk, A.

    2016-03-01

    The CMS experiment Level-1 trigger system is undergoing an upgrade. In the barrel-endcap transition region, it is necessary to merge data from 3 types of muon detectors—RPC, DT and CSC. The Overlap Muon Track Finder (OMTF) uses the novel approach to concentrate and process those data in a uniform manner to identify muons and their transversal momentum. The paper presents the algorithm and FPGA firmware implementation of the OMTF and its data transmission system in CMS. It is foreseen that the OMTF will be subject to significant changes resulting from optimization which will be done with the aid of physics simulations. Therefore, a special, high-level, parameterized HDL implementation is necessary.

  3. Pin-Align: A New Dynamic Programming Approach to Align Protein-Protein Interaction Networks

    PubMed Central

    2014-01-01

    To date, few tools for aligning protein-protein interaction networks have been suggested. These tools typically find conserved interaction patterns using various local or global alignment algorithms. However, the improvement of the speed, scalability, simplification, and accuracy of network alignment tools is still the target of new researches. In this paper, we introduce Pin-Align, a new tool for local alignment of protein-protein interaction networks. Pin-Align accuracy is tested on protein interaction networks from IntAct, DIP, and the Stanford Network Database and the results are compared with other well-known algorithms. It is shown that Pin-Align has higher sensitivity and specificity in terms of KEGG Ortholog groups. PMID:25435900

  4. Antares beam-alignment-system performance

    SciTech Connect

    Appert, Q.D.; Bender, S.C.

    1983-01-01

    The beam alignment system for the 24-beam-sector Antares CO/sub 2/ fusion laser automatically aligns more than 200 optical elements. A visible-wavelength alignment technique is employed which uses a telescope/TV system to view point-light sources appropriately located down the beamline. The centroids of the light spots are determined by a video tracker, which generates error signals used by the computer control system to move appropriate mirrors in a closed-loop system. Final touch-up alignment is accomplished by projecting a CO/sub 2/ alignment laser beam through the system and sensing its position at the target location. The techniques and control algorithms employed have resulted in alignment accuracies exceeding design requirements. By employing video processing to determine the centroids of diffraction images and by averaging over multiple TV frames, we achieve alignment accuracies better than 0.1 times system diffraction limits in the presence of air turbulence.

  5. R3D Align: global pairwise alignment of RNA 3D structures using local superpositions

    PubMed Central

    Rahrig, Ryan R.; Leontis, Neocles B.; Zirbel, Craig L.

    2010-01-01

    Motivation: Comparing 3D structures of homologous RNA molecules yields information about sequence and structural variability. To compare large RNA 3D structures, accurate automatic comparison tools are needed. In this article, we introduce a new algorithm and web server to align large homologous RNA structures nucleotide by nucleotide using local superpositions that accommodate the flexibility of RNA molecules. Local alignments are merged to form a global alignment by employing a maximum clique algorithm on a specially defined graph that we call the ‘local alignment’ graph. Results: The algorithm is implemented in a program suite and web server called ‘R3D Align’. The R3D Align alignment of homologous 3D structures of 5S, 16S and 23S rRNA was compared to a high-quality hand alignment. A full comparison of the 16S alignment with the other state-of-the-art methods is also provided. The R3D Align program suite includes new diagnostic tools for the structural evaluation of RNA alignments. The R3D Align alignments were compared to those produced by other programs and were found to be the most accurate, in comparison with a high quality hand-crafted alignment and in conjunction with a series of other diagnostics presented. The number of aligned base pairs as well as measures of geometric similarity are used to evaluate the accuracy of the alignments. Availability: R3D Align is freely available through a web server http://rna.bgsu.edu/R3DAlign. The MATLAB source code of the program suite is also freely available for download at that location. Supplementary information: Supplementary data are available at Bioinformatics online. Contact: r-rahrig@onu.edu PMID:20929913

  6. DETECTORS AND EXPERIMENTAL METHODS: Study of BESIII MUC offline software with cosmic-ray data

    NASA Astrophysics Data System (ADS)

    Liang, Yu-Tie; Mao, Ya-Jun; You, Zheng-Yun; Li, Wei-Dong; Bian, Jian-Ming; Cao, Guo-Fu; Cao, Xue-Xiang; Chen, Shen-Jian; Deng, Zi-Yan; Fu, Cheng-Dong; Gao, Yuan-Ning; Han, Lei; Han, Shao-Qing; He, Kang-Lin; He, Miao; Hu, Ji-Feng; Hu, Xiao-Wei; Huang, Bin; Huang, Xing-Tao; Jia, Lu-Kui; Ji, Xiao-Bin; Li, Hai-Bo; Liu, Bei-Jiang; Liu, Chun-Xiu; Liu, Huai-Min; Liu, Ying; Liu, Yong; Luo, Tao; Lu, Qi-Wen; Ma, Qiu-Mei; Ma, Xiang; Mao, Ze-Pu; Mo, Xiao-Hu; Ning, Fei-Peng; Ping, Rong-Gang; Qiu, Jin-Fa; Song, Wen-Bo; Sun, Sheng-Sen; Sun, Xiao-Dong; Sun, Yong-Zhao; Tian, Hao-Lai; Wang, Ji-Ke; Wang, Liang-Liang; Wen, Shuo-Pin; Wu, Ling-Hui; Wu, Zhi; Xie, Yu-Guang; Xu, Min; Yan, Jie; Yan, Liang; Yao, Jian; Yuan, Chang-Zheng; Yuan, Ye; Zhang, Chang-Chun; Zhang, Jian-Yong; Zhang, Lei; Zhang, Xue-Yao; Zhang, Yao; Zheng, Yang-Heng; Zhu, Yong-Sheng; Zou, Jia-Heng

    2009-07-01

    Cosmic-ray data of 90 M events have been collected and used for calibration, alignment as well as detector tuning. A special tracking algorithm for the BESIII muon counter is developed and verified with Monte-Carlo simulation and then further confirmed with the cosmic-ray data. The obtained strip resolutions are in good agreement with the design values. A new alignment approach for the BESIII muon counter is confirmed with the cosmic-ray data and proposed to be used in future analysis of experimental data.

  7. Global alignment: Finding rearrangements during alignment

    SciTech Connect

    Brudno, Michael; Malde, Sanket; Poliakov, Alexander; Do, Chuong B.; Couronne, Olivier; Dubchak, Inna; Batzoglou, Serafim

    2003-01-06

    Motivation: To compare entire genomes from different species, biologists increasingly need alignment methods that are efficient enough to handle long sequences, and accurate enough to correctly align the conserved biological features between distant species. The two main classes of pairwise alignments are global alignment, where one string is transformed into the other, and local alignment, where all locations of similarity between the two strings are returned. Global alignments are less prone to demonstrating false homology as each letter of one sequence is constrained to being aligned to only one letter of the other. Local alignments, on the other hand, can cope with rearrangements between non-syntenic, orthologous sequences by identifying similar regions in sequences; this, however, comes at the expense of a higher false positive rate due to the inability of local aligners to take into account overall conservation maps.

  8. Dual-energy cone-beam CT with a flat-panel detector: Effect of reconstruction algorithm on material classification

    SciTech Connect

    Zbijewski, W. Gang, G. J.; Xu, J.; Wang, A. S.; Stayman, J. W.; Taguchi, K.; Carrino, J. A.; Siewerdsen, J. H.

    2014-02-15

    Purpose: Cone-beam CT (CBCT) with a flat-panel detector (FPD) is finding application in areas such as breast and musculoskeletal imaging, where dual-energy (DE) capabilities offer potential benefit. The authors investigate the accuracy of material classification in DE CBCT using filtered backprojection (FBP) and penalized likelihood (PL) reconstruction and optimize contrast-enhanced DE CBCT of the joints as a function of dose, material concentration, and detail size. Methods: Phantoms consisting of a 15 cm diameter water cylinder with solid calcium inserts (50–200 mg/ml, 3–28.4 mm diameter) and solid iodine inserts (2–10 mg/ml, 3–28.4 mm diameter), as well as a cadaveric knee with intra-articular injection of iodine were imaged on a CBCT bench with a Varian 4343 FPD. The low energy (LE) beam was 70 kVp (+0.2 mm Cu), and the high energy (HE) beam was 120 kVp (+0.2 mm Cu, +0.5 mm Ag). Total dose (LE+HE) was varied from 3.1 to 15.6 mGy with equal dose allocation. Image-based DE classification involved a nearest distance classifier in the space of LE versus HE attenuation values. Recognizing the differences in noise between LE and HE beams, the LE and HE data were differentially filtered (in FBP) or regularized (in PL). Both a quadratic (PLQ) and a total-variation penalty (PLTV) were investigated for PL. The performance of DE CBCT material discrimination was quantified in terms of voxelwise specificity, sensitivity, and accuracy. Results: Noise in the HE image was primarily responsible for classification errors within the contrast inserts, whereas noise in the LE image mainly influenced classification in the surrounding water. For inserts of diameter 28.4 mm, DE CBCT reconstructions were optimized to maximize the total combined accuracy across the range of calcium and iodine concentrations, yielding values of ∼88% for FBP and PLQ, and ∼95% for PLTV at 3.1 mGy total dose, increasing to ∼95% for FBP and PLQ, and ∼98% for PLTV at 15.6 mGy total dose. For a

  9. Dual-energy cone-beam CT with a flat-panel detector: Effect of reconstruction algorithm on material classification

    PubMed Central

    Zbijewski, W.; Gang, G. J.; Xu, J.; Wang, A. S.; Stayman, J. W.; Taguchi, K.; Carrino, J. A.; Siewerdsen, J. H.

    2014-01-01

    Purpose: Cone-beam CT (CBCT) with a flat-panel detector (FPD) is finding application in areas such as breast and musculoskeletal imaging, where dual-energy (DE) capabilities offer potential benefit. The authors investigate the accuracy of material classification in DE CBCT using filtered backprojection (FBP) and penalized likelihood (PL) reconstruction and optimize contrast-enhanced DE CBCT of the joints as a function of dose, material concentration, and detail size. Methods: Phantoms consisting of a 15 cm diameter water cylinder with solid calcium inserts (50–200 mg/ml, 3–28.4 mm diameter) and solid iodine inserts (2–10 mg/ml, 3–28.4 mm diameter), as well as a cadaveric knee with intra-articular injection of iodine were imaged on a CBCT bench with a Varian 4343 FPD. The low energy (LE) beam was 70 kVp (+0.2 mm Cu), and the high energy (HE) beam was 120 kVp (+0.2 mm Cu, +0.5 mm Ag). Total dose (LE+HE) was varied from 3.1 to 15.6 mGy with equal dose allocation. Image-based DE classification involved a nearest distance classifier in the space of LE versus HE attenuation values. Recognizing the differences in noise between LE and HE beams, the LE and HE data were differentially filtered (in FBP) or regularized (in PL). Both a quadratic (PLQ) and a total-variation penalty (PLTV) were investigated for PL. The performance of DE CBCT material discrimination was quantified in terms of voxelwise specificity, sensitivity, and accuracy. Results: Noise in the HE image was primarily responsible for classification errors within the contrast inserts, whereas noise in the LE image mainly influenced classification in the surrounding water. For inserts of diameter 28.4 mm, DE CBCT reconstructions were optimized to maximize the total combined accuracy across the range of calcium and iodine concentrations, yielding values of ∼88% for FBP and PLQ, and ∼95% for PLTV at 3.1 mGy total dose, increasing to ∼95% for FBP and PLQ, and ∼98% for PLTV at 15.6 mGy total dose. For a

  10. Investigation of the possibility of improving spatial resolution in SPECT with the combination of LaBr3:Ce-based detector and 3D-OSEM reconstruction algorithms

    NASA Astrophysics Data System (ADS)

    Alzimami, Khalid S.; Sassi, Salem A.; Alfuraih, Abdulrahman A.; Livieratos, Lefteris; Spyrou, Nicholas M.

    2011-05-01

    This study investigates the potential of improving spatial resolution in SPECT imaging using a combination of LaBr3:Ce detectors and 3D-OSEM image reconstruction algorithms. Potential spatial resolution improvement was assessed intrinsically and extrinsically using GATE Monte Carlo simulation. Significantly improved MTF of LaBr3:Ce detectors suggests better resolution performance at all spatial frequencies. In comparison to conventional NaI(Tl) scintillators, a combination of the LaBr3:Ce crystal and 3D-OSEM incorporating resolution recovery could significantly improve the extrinsic spatial resolution of SPECT images.

  11. An Accurate Timing Alignment Method with Time-to-Digital Converter Linearity Calibration for High-Resolution TOF PET

    PubMed Central

    Li, Hongdi; Wang, Chao; An, Shaohui; Lu, Xingyu; Dong, Yun; Liu, Shitao; Baghaei, Hossain; Zhang, Yuxuan; Ramirez, Rocio; Wong, Wai-Hoi

    2015-01-01

    Accurate PET system timing alignment minimizes the coincidence time window and therefore reduces random events and improves image quality. It is also critical for time-of-flight (TOF) image reconstruction. Here, we use a thin annular cylinder (shell) phantom filled with a radioactive source and located axially and centrally in a PET camera for the timing alignment of a TOF PET system. This timing alignment method involves measuring the time differences between the selected coincidence detector pairs, calibrating the differential and integral nonlinearity of the time-to-digital converter (TDC) with the same raw data and deriving the intrinsic time biases for each detector using an iterative algorithm. The raw time bias for each detector is downloaded to the front-end electronics and the residual fine time bias can be applied during the TOF list-mode reconstruction. Our results showed that a timing alignment accuracy of better than ±25 ps can be achieved, and a preliminary timing resolution of 473 ps (full width at half maximum) was measured in our prototype TOF PET/CT system. PMID:26543243

  12. The alignment-distribution graph

    NASA Technical Reports Server (NTRS)

    Chatterjee, Siddhartha; Gilbert, John R.; Schreiber, Robert

    1993-01-01

    Implementing a data-parallel language such as Fortran 90 on a distributed-memory parallel computer requires distributing aggregate data objects (such as arrays) among the memory modules attached to the processors. The mapping of objects to the machine determines the amount of residual communication needed to bring operands of parallel operations into alignment with each other. We present a program representation called the alignment-distribution graph that makes these communication requirements explicit. We describe the details of the representation, show how to model communication cost in this framework, and outline several algorithms for determining object mappings that approximately minimize residual communication.

  13. The alignment-distribution graph

    NASA Technical Reports Server (NTRS)

    Chatterjee, Siddhartha; Gilbert, John R.; Schreiber, Robert

    1993-01-01

    Implementing a data-parallel language such as Fortran 90 on a distributed-memory parallel computer requires distributing aggregate data objects (such as arrays) among the memory modules attached to the processors. The mapping of objects to the machine determines the amount of residual communication needed to bring operands of parallel operations into alignment with each other. We present a program representation called the alignment distribution graph that makes these communication requirements explicit. We describe the details of the representation, show how to model communication cost in this framework, and outline several algorithms for determining object mappings that approximately minimize residual communication.

  14. Multiple Whole Genome Alignments Without a Reference Organism

    SciTech Connect

    Dubchak, Inna; Poliakov, Alexander; Kislyuk, Andrey; Brudno, Michael

    2009-01-16

    Multiple sequence alignments have become one of the most commonly used resources in genomics research. Most algorithms for multiple alignment of whole genomes rely either on a reference genome, against which all of the other sequences are laid out, or require a one-to-one mapping between the nucleotides of the genomes, preventing the alignment of recently duplicated regions. Both approaches have drawbacks for whole-genome comparisons. In this paper we present a novel symmetric alignment algorithm. The resulting alignments not only represent all of the genomes equally well, but also include all relevant duplications that occurred since the divergence from the last common ancestor. Our algorithm, implemented as a part of the VISTA Genome Pipeline (VGP), was used to align seven vertebrate and sixDrosophila genomes. The resulting whole-genome alignments demonstrate a higher sensitivity and specificity than the pairwise alignments previously available through the VGP and have higher exon alignment accuracy than comparable public whole-genome alignments. Of the multiple alignment methods tested, ours performed the best at aligning genes from multigene families?perhaps the most challenging test for whole-genome alignments. Our whole-genome multiple alignments are available through the VISTA Browser at http://genome.lbl.gov/vista/index.shtml.

  15. Probabilistic sequence alignment of stratigraphic records

    NASA Astrophysics Data System (ADS)

    Lin, Luan; Khider, Deborah; Lisiecki, Lorraine E.; Lawrence, Charles E.

    2014-10-01

    The assessment of age uncertainty in stratigraphically aligned records is a pressing need in paleoceanographic research. The alignment of ocean sediment cores is used to develop mutually consistent age models for climate proxies and is often based on the δ18O of calcite from benthic foraminifera, which records a global ice volume and deep water temperature signal. To date, δ18O alignment has been performed by manual, qualitative comparison or by deterministic algorithms. Here we present a hidden Markov model (HMM) probabilistic algorithm to find 95% confidence bands for δ18O alignment. This model considers the probability of every possible alignment based on its fit to the δ18O data and transition probabilities for sedimentation rate changes obtained from radiocarbon-based estimates for 37 cores. Uncertainty is assessed using a stochastic back trace recursion to sample alignments in exact proportion to their probability. We applied the algorithm to align 35 late Pleistocene records to a global benthic δ18O stack and found that the mean width of 95% confidence intervals varies between 3 and 23 kyr depending on the resolution and noisiness of the record's δ18O signal. Confidence bands within individual cores also vary greatly, ranging from ~0 to >40 kyr. These alignment uncertainty estimates will allow researchers to examine the robustness of their conclusions, including the statistical evaluation of lead-lag relationships between events observed in different cores.

  16. Enhancement of initial equivalency for protein structure alignment based on encoded local structures.

    PubMed

    Hung, Kenneth; Wang, Jui-Chih; Chen, Cheng-Wei; Chuang, Cheng-Long; Tsai, Kun-Nan; Chen, Chung-Ming

    2012-11-01

    Most alignment algorithms find an initial equivalent residue pair followed by an iterative optimization process to explore better near-optimal alignments in the surrounding solution space of the initial alignment. It plays a decisive role in determining the alignment quality since a poor initial alignment may make the final alignment trapped in an undesirable local optimum even with an iterative optimization. We proposed a vector-based alignment algorithm with a new initial alignment approach accounting for local structure features called MIRAGE-align. The new idea is to enhance the quality of the initial alignment based on encoded local structural alphabets to identify the protein structure pair whose sequence identity falls in or below twilight zone. The statistical analysis of alignment quality based on Match Index (MI) and computation time demonstrated that MIRAGE-align algorithm outperformed four previously published algorithms, i.e., the residue-based algorithm (CE), the vector-based algorithm (SSM), TM-align, and Fr-TM-align. MIRAGE-align yields a better estimate of initial solution to enhance the quality of initial alignment and enable the employment of a non-iterative optimization process to achieve a better alignment. PMID:22717522

  17. Uncertainty in homology inferences: Assessing and improving genomic sequence alignment

    PubMed Central

    Lunter, Gerton; Rocco, Andrea; Mimouni, Naila; Heger, Andreas; Caldeira, Alexandre; Hein, Jotun

    2008-01-01

    Sequence alignment underpins all of comparative genomics, yet it remains an incompletely solved problem. In particular, the statistical uncertainty within inferred alignments is often disregarded, while parametric or phylogenetic inferences are considered meaningless without confidence estimates. Here, we report on a theoretical and simulation study of pairwise alignments of genomic DNA at human–mouse divergence. We find that >15% of aligned bases are incorrect in existing whole-genome alignments, and we identify three types of alignment error, each leading to systematic biases in all algorithms considered. Careful modeling of the evolutionary process improves alignment quality; however, these improvements are modest compared with the remaining alignment errors, even with exact knowledge of the evolutionary model, emphasizing the need for statistical approaches to account for uncertainty. We develop a new algorithm, Marginalized Posterior Decoding (MPD), which explicitly accounts for uncertainties, is less biased and more accurate than other algorithms we consider, and reduces the proportion of misaligned bases by a third compared with the best existing algorithm. To our knowledge, this is the first nonheuristic algorithm for DNA sequence alignment to show robust improvements over the classic Needleman–Wunsch algorithm. Despite this, considerable uncertainty remains even in the improved alignments. We conclude that a probabilistic treatment is essential, both to improve alignment quality and to quantify the remaining uncertainty. This is becoming increasingly relevant with the growing appreciation of the importance of noncoding DNA, whose study relies heavily on alignments. Alignment errors are inevitable, and should be considered when drawing conclusions from alignments. Software and alignments to assist researchers in doing this are provided at http://genserv.anat.ox.ac.uk/grape/. PMID:18073381

  18. SUMONA: A supervised method for optimizing network alignment.

    PubMed

    Tuncay, Erhun Giray; Can, Tolga

    2016-08-01

    This study focuses on improving the multi-objective memetic algorithm for protein-protein interaction (PPI) network alignment, Optimizing Network Aligner - OptNetAlign, via integration with other existing network alignment methods such as SPINAL, NETAL and HubAlign. The output of this algorithm is an elite set of aligned networks all of which are optimal with respect to multiple user-defined criteria. However, OptNetAlign is an unsupervised genetic algorithm that initiates its search with completely random solutions and it requires substantial running times to generate an elite set of solutions that have high scores with respect to the given criteria. In order to improve running time, the search space of the algorithm can be narrowed down by focusing on remarkably qualified alignments and trying to optimize the most desired criteria on a more limited set of solutions. The method presented in this study improves OptNetAlign in a supervised fashion by utilizing the alignment results of different network alignment algorithms with varying parameters that depend upon user preferences. Therefore, the user can prioritize certain objectives upon others and achieve better running time performance while optimizing the secondary objectives.

  19. GASSST: global alignment short sequence search tool

    PubMed Central

    Rizk, Guillaume; Lavenier, Dominique

    2010-01-01

    Motivation: The rapid development of next-generation sequencing technologies able to produce huge amounts of sequence data is leading to a wide range of new applications. This triggers the need for fast and accurate alignment software. Common techniques often restrict indels in the alignment to improve speed, whereas more flexible aligners are too slow for large-scale applications. Moreover, many current aligners are becoming inefficient as generated reads grow ever larger. Our goal with our new aligner GASSST (Global Alignment Short Sequence Search Tool) is thus 2-fold—achieving high performance with no restrictions on the number of indels with a design that is still effective on long reads. Results: We propose a new efficient filtering step that discards most alignments coming from the seed phase before they are checked by the costly dynamic programming algorithm. We use a carefully designed series of filters of increasing complexity and efficiency to quickly eliminate most candidate alignments in a wide range of configurations. The main filter uses a precomputed table containing the alignment score of short four base words aligned against each other. This table is reused several times by a new algorithm designed to approximate the score of the full dynamic programming algorithm. We compare the performance of GASSST against BWA, BFAST, SSAHA2 and PASS. We found that GASSST achieves high sensitivity in a wide range of configurations and faster overall execution time than other state-of-the-art aligners. Availability: GASSST is distributed under the CeCILL software license at http://www.irisa.fr/symbiose/projects/gassst/ Contact: guillaume.rizk@irisa.fr; dominique.lavenier@irisa.fr Supplementary information: Supplementary data are available at Bioinformatics online. PMID:20739310

  20. Constructing Aligned Assessments Using Automated Test Construction

    ERIC Educational Resources Information Center

    Porter, Andrew; Polikoff, Morgan S.; Barghaus, Katherine M.; Yang, Rui

    2013-01-01

    We describe an innovative automated test construction algorithm for building aligned achievement tests. By incorporating the algorithm into the test construction process, along with other test construction procedures for building reliable and unbiased assessments, the result is much more valid tests than result from current test construction…

  1. Multiple alignment using hidden Markov models

    SciTech Connect

    Eddy, S.R.

    1995-12-31

    A simulated annealing method is described for training hidden Markov models and producing multiple sequence alignments from initially unaligned protein or DNA sequences. Simulated annealing in turn uses a dynamic programming algorithm for correctly sampling suboptimal multiple alignments according to their probability and a Boltzmann temperature factor. The quality of simulated annealing alignments is evaluated on structural alignments of ten different protein families, and compared to the performance of other HMM training methods and the ClustalW program. Simulated annealing is better able to find near-global optima in the multiple alignment probability landscape than the other tested HMM training methods. Neither ClustalW nor simulated annealing produce consistently better alignments compared to each other. Examination of the specific cases in which ClustalW outperforms simulated annealing, and vice versa, provides insight into the strengths and weaknesses of current hidden Maxkov model approaches.

  2. Computing posterior probabilities for score-based alignments using ppALIGN.

    PubMed

    Wolfsheimer, Stefan; Hartmann, Alexander; Rabus, Ralf; Nuel, Gregory

    2012-01-01

    Score-based pairwise alignments are widely used in bioinformatics in particular with molecular database search tools, such as the BLAST family. Due to sophisticated heuristics, such algorithms are usually fast but the underlying scoring model unfortunately lacks a statistical description of the reliability of the reported alignments. In particular, close to gaps, in low-score or low-complexity regions, a huge number of alternative alignments arise which results in a decrease of the certainty of the alignment. ppALIGN is a software package that uses hidden Markov Model techniques to compute position-wise reliability of score-based pairwise alignments of DNA or protein sequences. The design of the model allows for a direct connection between the scoring function and the parameters of the probabilistic model. For this reason it is suitable to analyze the outcomes of popular score based aligners and search tools without having to choose a complicated set of parameters. By contrast, our program only requires the classical score parameters (the scoring function and gap costs). The package comes along with a library written in C++, a standalone program for user defined alignments (ppALIGN) and another program (ppBLAST) which can process a complete result set of BLAST. The main algorithms essentially exhibit a linear time complexity (in the alignment lengths), and they are hence suitable for on-line computations. We have also included alternative decoding algorithms to provide alternative alignments. ppALIGN is a fast program/library that helps detect and quantify questionable regions in pairwise alignments. Due to its structure, the input/output interface it can to be connected to other post-processing tools. Empirically, we illustrate its usefulness in terms of correctly predicted reliable regions for sequences generated using the ROSE model for sequence evolution, and identify sensor-specific regions in the denitrifying betaproteobacterium Aromatoleum aromaticum. PMID

  3. Investigation of an Immunoassay with Broad Specificity to Quinolone Drugs by Genetic Algorithm with Linear Assignment of Hypermolecular Alignment of Data Sets and Advanced Quantitative Structure-Activity Relationship Analysis.

    PubMed

    Chen, Jiahong; Lu, Ning; Shen, Xing; Tang, Qiushi; Zhang, Chijian; Xu, Jun; Sun, Yuanming; Huang, Xin-An; Xu, Zhenlin; Lei, Hongtao

    2016-04-01

    A polyclonal antibody against the quinolone drug pazufloxacin (PAZ) but with surprisingly broad specificity was raised to simultaneously detect 24 quinolones (QNs). The developed competitive indirect enzyme-linked immunosorbent assay (ciELISA) exhibited limits of detection (LODs) for the 24 QNs ranging from 0.45 to 15.16 ng/mL, below the maximum residue levels (MRLs). To better understand the obtained broad specificity, a genetic algorithm with linear assignment of hypermolecular alignment of data sets (GALAHAD) was used to generate the desired pharmacophore model and superimpose the QNs, and then advanced comparative molecular field analysis (CoMFA) and advanced comparative molecular similarity indices analysis (CoMSIA) models were employed to study the three-dimensional quantitative structure-activity relationship (3D QSAR) between QNs and the antibody. It was found that the QNs could interact with the antibody with different binding poses, and cross-reactivity was mainly positively correlated with the bulky substructure containing electronegative atom at the 7-position, while it was negatively associated with the large bulky substructure at the 1-position of QNs.

  4. Sparse alignment for robust tensor learning.

    PubMed

    Lai, Zhihui; Wong, Wai Keung; Xu, Yong; Zhao, Cairong; Sun, Mingming

    2014-10-01

    Multilinear/tensor extensions of manifold learning based algorithms have been widely used in computer vision and pattern recognition. This paper first provides a systematic analysis of the multilinear extensions for the most popular methods by using alignment techniques, thereby obtaining a general tensor alignment framework. From this framework, it is easy to show that the manifold learning based tensor learning methods are intrinsically different from the alignment techniques. Based on the alignment framework, a robust tensor learning method called sparse tensor alignment (STA) is then proposed for unsupervised tensor feature extraction. Different from the existing tensor learning methods, L1- and L2-norms are introduced to enhance the robustness in the alignment step of the STA. The advantage of the proposed technique is that the difficulty in selecting the size of the local neighborhood can be avoided in the manifold learning based tensor feature extraction algorithms. Although STA is an unsupervised learning method, the sparsity encodes the discriminative information in the alignment step and provides the robustness of STA. Extensive experiments on the well-known image databases as well as action and hand gesture databases by encoding object images as tensors demonstrate that the proposed STA algorithm gives the most competitive performance when compared with the tensor-based unsupervised learning methods. PMID:25291733

  5. MULTAN: a program to align multiple DNA sequences.

    PubMed Central

    Bains, W

    1986-01-01

    I describe a computer program which can align a large number of nucleic acid sequences with one another. The program uses an heuristic, iterative algorithm which has been tested extensively, and is found to produce useful alignments of a variety of sequence families. The algorithm is fast enough to be practical for the analysis of large number of sequences, and is implemented in a program which contains a variety of other functions to facilitate the analysis of the aligned result. PMID:3003672

  6. Aligning Biomolecular Networks Using Modular Graph Kernels

    NASA Astrophysics Data System (ADS)

    Towfic, Fadi; Greenlee, M. Heather West; Honavar, Vasant

    Comparative analysis of biomolecular networks constructed using measurements from different conditions, tissues, and organisms offer a powerful approach to understanding the structure, function, dynamics, and evolution of complex biological systems. We explore a class of algorithms for aligning large biomolecular networks by breaking down such networks into subgraphs and computing the alignment of the networks based on the alignment of their subgraphs. The resulting subnetworks are compared using graph kernels as scoring functions. We provide implementations of the resulting algorithms as part of BiNA, an open source biomolecular network alignment toolkit. Our experiments using Drosophila melanogaster, Saccharomyces cerevisiae, Mus musculus and Homo sapiens protein-protein interaction networks extracted from the DIP repository of protein-protein interaction data demonstrate that the performance of the proposed algorithms (as measured by % GO term enrichment of subnetworks identified by the alignment) is competitive with some of the state-of-the-art algorithms for pair-wise alignment of large protein-protein interaction networks. Our results also show that the inter-species similarity scores computed based on graph kernels can be used to cluster the species into a species tree that is consistent with the known phylogenetic relationships among the species.

  7. CARNA--alignment of RNA structure ensembles.

    PubMed

    Sorescu, Dragos Alexandru; Möhl, Mathias; Mann, Martin; Backofen, Rolf; Will, Sebastian

    2012-07-01

    Due to recent algorithmic progress, tools for the gold standard of comparative RNA analysis, namely Sankoff-style simultaneous alignment and folding, are now readily applicable. Such approaches, however, compare RNAs with respect to a simultaneously predicted, single, nested consensus structure. To make multiple alignment of RNAs available in cases, where this limitation of the standard approach is critical, we introduce a web server that provides a complete and convenient interface to the RNA structure alignment tool 'CARNA'. This tool uniquely supports RNAs with multiple conserved structures per RNA and aligns pseudoknots intrinsically; these features are highly desirable for aligning riboswitches, RNAs with conserved folding pathways, or pseudoknots. We represent structural input and output information as base pair probability dot plots; this provides large flexibility in the input, ranging from fixed structures to structure ensembles, and enables immediate visual analysis of the results. In contrast to conventional Sankoff-style approaches, 'CARNA' optimizes all structural similarities in the input simultaneously, for example across an entire RNA structure ensemble. Even compared with already costly Sankoff-style alignment, 'CARNA' solves an intrinsically much harder problem by applying advanced, constraint-based, algorithmic techniques. Although 'CARNA' is specialized to the alignment of RNAs with several conserved structures, its performance on RNAs in general is on par with state-of-the-art general-purpose RNA alignment tools, as we show in a Bralibase 2.1 benchmark. The web server is freely available at http://rna.informatik.uni-freiburg.de/CARNA. PMID:22689637

  8. On comparing two structured RNA multiple alignments.

    PubMed

    Patel, Vandanaben; Wang, Jason T L; Setia, Shefali; Verma, Anurag; Warden, Charles D; Zhang, Kaizhong

    2010-12-01

    We present a method, called BlockMatch, for aligning two blocks, where a block is an RNA multiple sequence alignment with the consensus secondary structure of the alignment in Stockholm format. The method employs a quadratic-time dynamic programming algorithm for aligning columns and column pairs of the multiple alignments in the blocks. Unlike many other tools that can perform pairwise alignment of either single sequences or structures only, BlockMatch takes into account the characteristics of all the sequences in the blocks along with their consensus structures during the alignment process, thus being able to achieve a high-quality alignment result. We apply BlockMatch to phylogeny reconstruction on a set of 5S rRNA sequences taken from fifteen bacteria species. Experimental results showed that the phylogenetic tree generated by our method is more accurate than the tree constructed based on the widely used ClustalW tool. The BlockMatch algorithm is implemented into a web server, accessible at http://bioinformatics.njit.edu/blockmatch. A jar file of the program is also available for download from the web server. PMID:21121021

  9. On comparing two structured RNA multiple alignments.

    PubMed

    Patel, Vandanaben; Wang, Jason T L; Setia, Shefali; Verma, Anurag; Warden, Charles D; Zhang, Kaizhong

    2010-12-01

    We present a method, called BlockMatch, for aligning two blocks, where a block is an RNA multiple sequence alignment with the consensus secondary structure of the alignment in Stockholm format. The method employs a quadratic-time dynamic programming algorithm for aligning columns and column pairs of the multiple alignments in the blocks. Unlike many other tools that can perform pairwise alignment of either single sequences or structures only, BlockMatch takes into account the characteristics of all the sequences in the blocks along with their consensus structures during the alignment process, thus being able to achieve a high-quality alignment result. We apply BlockMatch to phylogeny reconstruction on a set of 5S rRNA sequences taken from fifteen bacteria species. Experimental results showed that the phylogenetic tree generated by our method is more accurate than the tree constructed based on the widely used ClustalW tool. The BlockMatch algorithm is implemented into a web server, accessible at http://bioinformatics.njit.edu/blockmatch. A jar file of the program is also available for download from the web server.

  10. Global multiple protein-protein interaction network alignment by combining pairwise network alignments

    PubMed Central

    2015-01-01

    Background A wealth of protein interaction data has become available in recent years, creating an urgent need for powerful analysis techniques. In this context, the problem of finding biologically meaningful correspondences between different protein-protein interaction networks (PPIN) is of particular interest. The PPIN of a species can be compared with that of other species through the process of PPIN alignment. Such an alignment can provide insight into basic problems like species evolution and network component function determination, as well as translational problems such as target identification and elucidation of mechanisms of disease spread. Furthermore, multiple PPINs can be aligned simultaneously, expanding the analytical implications of the result. While there are several pairwise network alignment algorithms, few methods are capable of multiple network alignment. Results We propose SMAL, a MNA algorithm based on the philosophy of scaffold-based alignment. SMAL is capable of converting results from any global pairwise alignment algorithms into a MNA in linear time. Using this method, we have built multiple network alignments based on combining pairwise alignments from a number of publicly available (pairwise) network aligners. We tested SMAL using PPINs of eight species derived from the IntAct repository and employed a number of measures to evaluate performance. Additionally, as part of our experimental investigations, we compared the effectiveness of SMAL while aligning up to eight input PPINs, and examined the effect of scaffold network choice on the alignments. Conclusions A key advantage of SMAL lies in its ability to create MNAs through the use of pairwise network aligners for which native MNA implementations do not exist. Experiments indicate that the performance of SMAL was comparable to that of the native MNA implementation of established methods such as IsoRankN and SMETANA. However, in terms of computational time, SMAL was significantly faster

  11. Aligning parallel arrays to reduce communication

    NASA Technical Reports Server (NTRS)

    Sheffler, Thomas J.; Schreiber, Robert; Gilbert, John R.; Chatterjee, Siddhartha

    1994-01-01

    Axis and stride alignment is an important optimization in compiling data-parallel programs for distributed-memory machines. We previously developed an optimal algorithm for aligning array expressions. Here, we examine alignment for more general program graphs. We show that optimal alignment is NP-complete in this setting, so we study heuristic methods. This paper makes two contributions. First, we show how local graph transformations can reduce the size of the problem significantly without changing the best solution. This allows more complex and effective heuristics to be used. Second, we give a heuristic that can explore the space of possible solutions in a number of ways. We show that some of these strategies can give better solutions than a simple greedy approach proposed earlier. Our algorithms have been implemented; we present experimental results showing their effect on the performance of some example programs running on the CM-5.

  12. Optimal Network Alignment with Graphlet Degree Vectors

    PubMed Central

    Milenković, Tijana; Ng, Weng Leong; Hayes, Wayne; Pržulj, Nataša

    2010-01-01

    Important biological information is encoded in the topology of biological networks. Comparative analyses of biological networks are proving to be valuable, as they can lead to transfer of knowledge between species and give deeper insights into biological function, disease, and evolution. We introduce a new method that uses the Hungarian algorithm to produce optimal global alignment between two networks using any cost function. We design a cost function based solely on network topology and use it in our network alignment. Our method can be applied to any two networks, not just biological ones, since it is based only on network topology. We use our new method to align protein-protein interaction networks of two eukaryotic species and demonstrate that our alignment exposes large and topologically complex regions of network similarity. At the same time, our alignment is biologically valid, since many of the aligned protein pairs perform the same biological function. From the alignment, we predict function of yet unannotated proteins, many of which we validate in the literature. Also, we apply our method to find topological similarities between metabolic networks of different species and build phylogenetic trees based on our network alignment score. The phylogenetic trees obtained in this way bear a striking resemblance to the ones obtained by sequence alignments. Our method detects topologically similar regions in large networks that are statistically significant. It does this independent of protein sequence or any other information external to network topology. PMID:20628593

  13. MAVID multiple alignment server.

    PubMed

    Bray, Nicolas; Pachter, Lior

    2003-07-01

    MAVID is a multiple alignment program suitable for many large genomic regions. The MAVID web server allows biomedical researchers to quickly obtain multiple alignments for genomic sequences and to subsequently analyse the alignments for conserved regions. MAVID has been successfully used for the alignment of closely related species such as primates and also for the alignment of more distant organisms such as human and fugu. The server is fast, capable of aligning hundreds of kilobases in less than a minute. The multiple alignment is used to build a phylogenetic tree for the sequences, which is subsequently used as a basis for identifying conserved regions in the alignment. The server can be accessed at http://baboon.math.berkeley.edu/mavid/.

  14. A comparative analysis of multiple sequence alignments for biological data.

    PubMed

    Manzoor, Umar; Shahid, Sarosh; Zafar, Bassam

    2015-01-01

    Multiple sequence alignment plays a key role in the computational analysis of biological data. Different programs are developed to analyze the sequence similarity. This paper highlights the algorithmic techniques of the most popular multiple sequence alignment programs. These programs are then evaluated on the basis of execution time and scalability. The overall performance of these programs is assessed to highlight their strengths and weaknesses with reference to their algorithmic techniques. In terms of overall alignment quality, T-Coffee and Mafft attain the highest average scores, whereas K-align has the minimum computation time. PMID:26405947

  15. Construction of the CDF silicon vertex detector

    SciTech Connect

    Skarha, J.; Barnett, B.; Boswell, C.; Snider, F.; Spies, A.; Tseng, J.; Vejcik, S.; Carter, H.; Flaugher, B.; Gonzales, B.; Hrycyk, M.; Nelson, C.; Segler, S.; Shaw, T.; Tkaczyk, S.; Turner, K.; Wesson, T.; Carithers, W.; Ely, R.; Haber, C.; Holland, S.; Kleinfelder, S.; Merrick, T.; Schneider, O.; Wester, W.; Wong, M.; Amidei, D.; Derwent, P.; Gold, M.; Matthews, J.; Bacchetta, N.; Bisello, D.; Busetto, G.; Castro, A.; Loreti, M.; Pescara, L.; Bedeschi, F.; Bolognesi, V.; Dell`Agnello, S.; Galeotti, S.; Mariotti, M.; Menzione, A.; Punzi, G.; Raffaelli, F.; Risotri, L.; Tartarelli, F.; Turini, N.; Wenzel, H.; Zetti, F. |; Bailey, M.; Garfinkel, A.; Shaw, N.; Tipton, P.; Watts, G.

    1992-04-01

    Technical details and methods used in constructing the CDF silicon vertex detector are presented. This description includes a discussion of the foam-carbon fiber composite structure used to silicon microstrip detectors and the procedure for achievement of 5 {mu}m detector alignment. The construction of the beryllium barrel structure, which houses the detector assemblies, is also described. In addition, the 10 {mu}m placement accuracy of the detectors in the barrel structure is discussed and the detector cooling and mounting systems are described. 12 refs.

  16. SWAMP+: multiple subsequence alignment using associative massive parallelism

    SciTech Connect

    Steinfadt, Shannon Irene; Baker, Johnnie W

    2010-10-18

    A new parallel algorithm SWAMP+ incorporates the Smith-Waterman sequence alignment on an associative parallel model known as ASC. It is a highly sensitive parallel approach that expands traditional pairwise sequence alignment. This is the first parallel algorithm to provide multiple non-overlapping, non-intersecting subsequence alignments with the accuracy of Smith-Waterman. The efficient algorithm provides multiple alignments similar to BLAST while creating a better workflow for the end users. The parallel portions of the code run in O(m+n) time using m processors. When m = n, the algorithmic analysis becomes O(n) with a coefficient of two, yielding a linear speedup. Implementation of the algorithm on the SIMD ClearSpeed CSX620 confirms this theoretical linear speedup with real timings.

  17. Pairwise alignment of protein interaction networks.

    PubMed

    Koyutürk, Mehmet; Kim, Yohan; Topkara, Umut; Subramaniam, Shankar; Szpankowski, Wojciech; Grama, Ananth

    2006-03-01

    With an ever-increasing amount of available data on protein-protein interaction (PPI) networks and research revealing that these networks evolve at a modular level, discovery of conserved patterns in these networks becomes an important problem. Although available data on protein-protein interactions is currently limited, recently developed algorithms have been shown to convey novel biological insights through employment of elegant mathematical models. The main challenge in aligning PPI networks is to define a graph theoretical measure of similarity between graph structures that captures underlying biological phenomena accurately. In this respect, modeling of conservation and divergence of interactions, as well as the interpretation of resulting alignments, are important design parameters. In this paper, we develop a framework for comprehensive alignment of PPI networks, which is inspired by duplication/divergence models that focus on understanding the evolution of protein interactions. We propose a mathematical model that extends the concepts of match, mismatch, and gap in sequence alignment to that of match, mismatch, and duplication in network alignment and evaluates similarity between graph structures through a scoring function that accounts for evolutionary events. By relying on evolutionary models, the proposed framework facilitates interpretation of resulting alignments in terms of not only conservation but also divergence of modularity in PPI networks. Furthermore, as in the case of sequence alignment, our model allows flexibility in adjusting parameters to quantify underlying evolutionary relationships. Based on the proposed model, we formulate PPI network alignment as an optimization problem and present fast algorithms to solve this problem. Detailed experimental results from an implementation of the proposed framework show that our algorithm is able to discover conserved interaction patterns very effectively, in terms of both accuracies and computational

  18. Multiple structure alignment with msTALI

    PubMed Central

    2012-01-01

    Background Multiple structure alignments have received increasing attention in recent years as an alternative to multiple sequence alignments. Although multiple structure alignment algorithms can potentially be applied to a number of problems, they have primarily been used for protein core identification. A method that is capable of solving a variety of problems using structure comparison is still absent. Here we introduce a program msTALI for aligning multiple protein structures. Our algorithm uses several informative features to guide its alignments: torsion angles, backbone Cα atom positions, secondary structure, residue type, surface accessibility, and properties of nearby atoms. The algorithm allows the user to weight the types of information used to generate the alignment, which expands its utility to a wide variety of problems. Results msTALI exhibits competitive results on 824 families from the Homstrad and SABmark databases when compared to Matt and Mustang. We also demonstrate success at building a database of protein cores using 341 randomly selected CATH domains and highlight the contribution of msTALI compared to the CATH classifications. Finally, we present an example applying msTALI to the problem of detecting hinges in a protein undergoing rigid-body motion. Conclusions msTALI is an effective algorithm for multiple structure alignment. In addition to its performance on standard comparison databases, it utilizes clear, informative features, allowing further customization for domain-specific applications. The C++ source code for msTALI is available for Linux on the web at http://ifestos.cse.sc.edu/mstali. PMID:22607234

  19. HubAlign: an accurate and efficient method for global alignment of protein–protein interaction networks

    PubMed Central

    Hashemifar, Somaye; Xu, Jinbo

    2014-01-01

    Motivation: High-throughput experimental techniques have produced a large amount of protein–protein interaction (PPI) data. The study of PPI networks, such as comparative analysis, shall benefit the understanding of life process and diseases at the molecular level. One way of comparative analysis is to align PPI networks to identify conserved or species-specific subnetwork motifs. A few methods have been developed for global PPI network alignment, but it still remains challenging in terms of both accuracy and efficiency. Results: This paper presents a novel global network alignment algorithm, denoted as HubAlign, that makes use of both network topology and sequence homology information, based upon the observation that topologically important proteins in a PPI network usually are much more conserved and thus, more likely to be aligned. HubAlign uses a minimum-degree heuristic algorithm to estimate the topological and functional importance of a protein from the global network topology information. Then HubAlign aligns topologically important proteins first and gradually extends the alignment to the whole network. Extensive tests indicate that HubAlign greatly outperforms several popular methods in terms of both accuracy and efficiency, especially in detecting functionally similar proteins. Availability: HubAlign is available freely for non-commercial purposes at http://ttic.uchicago.edu/∼hashemifar/software/HubAlign.zip Contact: jinboxu@gmail.com Supplementary information: Supplementary data are available at Bioinformatics online. PMID:25161231

  20. Ontology Alignment Repair through Modularization and Confidence-Based Heuristics.

    PubMed

    Santos, Emanuel; Faria, Daniel; Pesquita, Catia; Couto, Francisco M

    2015-01-01

    Ontology Matching aims at identifying a set of semantic correspondences, called an alignment, between related ontologies. In recent years, there has been a growing interest in efficient and effective matching methods for large ontologies. However, alignments produced for large ontologies are often logically incoherent. It was only recently that the use of repair techniques to improve the coherence of ontology alignments began to be explored. This paper presents a novel modularization technique for ontology alignment repair which extracts fragments of the input ontologies that only contain the necessary classes and relations to resolve all detectable incoherences. The paper presents also an alignment repair algorithm that uses a global repair strategy to minimize both the degree of incoherence and the number of mappings removed from the alignment, while overcoming the scalability problem by employing the proposed modularization technique. Our evaluation shows that our modularization technique produces significantly small fragments of the ontologies and that our repair algorithm produces more complete alignments than other current alignment repair systems, while obtaining an equivalent degree of incoherence. Additionally, we also present a variant of our repair algorithm that makes use of the confidence values of the mappings to improve alignment repair. Our repair algorithm was implemented as part of AgreementMakerLight, a free and open-source ontology matching system. PMID:26710335

  1. Ontology Alignment Repair through Modularization and Confidence-Based Heuristics

    PubMed Central

    Santos, Emanuel; Faria, Daniel; Pesquita, Catia; Couto, Francisco M.

    2015-01-01

    Ontology Matching aims at identifying a set of semantic correspondences, called an alignment, between related ontologies. In recent years, there has been a growing interest in efficient and effective matching methods for large ontologies. However, alignments produced for large ontologies are often logically incoherent. It was only recently that the use of repair techniques to improve the coherence of ontology alignments began to be explored. This paper presents a novel modularization technique for ontology alignment repair which extracts fragments of the input ontologies that only contain the necessary classes and relations to resolve all detectable incoherences. The paper presents also an alignment repair algorithm that uses a global repair strategy to minimize both the degree of incoherence and the number of mappings removed from the alignment, while overcoming the scalability problem by employing the proposed modularization technique. Our evaluation shows that our modularization technique produces significantly small fragments of the ontologies and that our repair algorithm produces more complete alignments than other current alignment repair systems, while obtaining an equivalent degree of incoherence. Additionally, we also present a variant of our repair algorithm that makes use of the confidence values of the mappings to improve alignment repair. Our repair algorithm was implemented as part of AgreementMakerLight, a free and open-source ontology matching system. PMID:26710335

  2. Girder Alignment Plan

    SciTech Connect

    Wolf, Zackary; Ruland, Robert; LeCocq, Catherine; Lundahl, Eric; Levashov, Yurii; Reese, Ed; Rago, Carl; Poling, Ben; Schafer, Donald; Nuhn, Heinz-Dieter; Wienands, Uli; /SLAC

    2010-11-18

    The girders for the LCLS undulator system contain components which must be aligned with high accuracy relative to each other. The alignment is one of the last steps before the girders go into the tunnel, so the alignment must be done efficiently, on a tight schedule. This note documents the alignment plan which includes efficiency and high accuracy. The motivation for girder alignment involves the following considerations. Using beam based alignment, the girder position will be adjusted until the beam goes through the center of the quadrupole and beam finder wire. For the machine to work properly, the undulator axis must be on this line and the center of the undulator beam pipe must be on this line. The physics reasons for the undulator axis and undulator beam pipe axis to be centered on the beam are different, but the alignment tolerance for both are similar. In addition, the beam position monitor must be centered on the beam to preserve its calibration. Thus, the undulator, undulator beam pipe, quadrupole, beam finder wire, and beam position monitor axes must all be aligned to a common line. All relative alignments are equally important, not just, for example, between quadrupole and undulator. We begin by making the common axis the nominal beam axis in the girder coordinate system. All components will be initially aligned to this axis. A more accurate alignment will then position the components relative to each other, without incorporating the girder itself.

  3. Interstellar Dust Grain Alignment

    NASA Astrophysics Data System (ADS)

    Andersson, B.-G.; Lazarian, A.; Vaillancourt, John E.

    2015-08-01

    Interstellar polarization at optical-to-infrared wavelengths is known to arise from asymmetric dust grains aligned with the magnetic field. This effect provides a potentially powerful probe of magnetic field structure and strength if the details of the grain alignment can be reliably understood. Theory and observations have recently converged on a quantitative, predictive description of interstellar grain alignment based on radiative processes. The development of a general, analytical model for this radiative alignment torque (RAT) theory has allowed specific, testable predictions for realistic interstellar conditions. We outline the theoretical and observational arguments in favor of RAT alignment, as well as reasons the "classical" paramagnetic alignment mechanism is unlikely to work, except possibly for the very smallest grains. With further detailed characterization of the RAT mechanism, grain alignment and polarimetry promise to not only better constrain the interstellar magnetic field but also provide new information on the dust characteristics.

  4. FRESCO: flexible alignment with rectangle scoring schemes.

    PubMed

    Dalca, A V; Brudno, M

    2008-01-01

    While the popular DNA sequence alignment tools incorporate powerful heuristics to allow for fast and accurate alignment of DNA, most of them still optimize the classical Needleman Wunsch scoring scheme. The development of novel scoring schemes is often hampered by the difficulty of finding an optimizing algorithm for each non-trivial scheme. In this paper we define the broad class of rectangle scoring schemes, and describe an algorithm and tool that can align two sequences with an arbitrary rectangle scoring scheme in polynomial time. Rectangle scoring schemes encompass some of the popular alignment scoring metrics currently in use, as well as many other functions. We investigate a novel scoring function based on minimizing the expected number of random diagonals observed with the given scores and show that it rivals the LAGAN and Clustal-W aligners, without using any biological or evolutionary parameters. The FRESCO program, freely available at http://compbio.cs.toronto.edu/fresco, gives bioinformatics researchers the ability to quickly compare the performance of other complex scoring formulas without having to implement new algorithms to optimize them.

  5. Multiple network alignment on quantum computers

    NASA Astrophysics Data System (ADS)

    Daskin, Anmer; Grama, Ananth; Kais, Sabre

    2014-12-01

    Comparative analyses of graph-structured datasets underly diverse problems. Examples of these problems include identification of conserved functional components (biochemical interactions) across species, structural similarity of large biomolecules, and recurring patterns of interactions in social networks. A large class of such analyses methods quantify the topological similarity of nodes across networks. The resulting correspondence of nodes across networks, also called node alignment, can be used to identify invariant subgraphs across the input graphs. Given graphs as input, alignment algorithms use topological information to assign a similarity score to each -tuple of nodes, with elements (nodes) drawn from each of the input graphs. Nodes are considered similar if their neighbors are also similar. An alternate, equivalent view of these network alignment algorithms is to consider the Kronecker product of the input graphs and to identify high-ranked nodes in the Kronecker product graph. Conventional methods such as PageRank and HITS (Hypertext-Induced Topic Selection) can be used for this purpose. These methods typically require computation of the principal eigenvector of a suitably modified Kronecker product matrix of the input graphs. We adopt this alternate view of the problem to address the problem of multiple network alignment. Using the phase estimation algorithm, we show that the multiple network alignment problem can be efficiently solved on quantum computers. We characterize the accuracy and performance of our method and show that it can deliver exponential speedups over conventional (non-quantum) methods.

  6. An Efficient, FPGA-Based, Cluster Detection Algorithm Implementation for a Strip Detector Readout System in a Time Projection Chamber Polarimeter

    NASA Technical Reports Server (NTRS)

    Gregory, Kyle J.; Hill, Joanne E. (Editor); Black, J. Kevin; Baumgartner, Wayne H.; Jahoda, Keith

    2016-01-01

    A fundamental challenge in a spaceborne application of a gas-based Time Projection Chamber (TPC) for observation of X-ray polarization is handling the large amount of data collected. The TPC polarimeter described uses the APV-25 Application Specific Integrated Circuit (ASIC) to readout a strip detector. Two dimensional photoelectron track images are created with a time projection technique and used to determine the polarization of the incident X-rays. The detector produces a 128x30 pixel image per photon interaction with each pixel registering 12 bits of collected charge. This creates challenging requirements for data storage and downlink bandwidth with only a modest incidence of photons and can have a significant impact on the overall mission cost. An approach is described for locating and isolating the photoelectron track within the detector image, yielding a much smaller data product, typically between 8x8 pixels and 20x20 pixels. This approach is implemented using a Microsemi RT-ProASIC3-3000 Field-Programmable Gate Array (FPGA), clocked at 20 MHz and utilizing 10.7k logic gates (14% of FPGA), 20 Block RAMs (17% of FPGA), and no external RAM. Results will be presented, demonstrating successful photoelectron track cluster detection with minimal impact to detector dead-time.

  7. An efficient, FPGA-based, cluster detection algorithm implementation for a strip detector readout system in a Time Projection Chamber polarimeter

    NASA Astrophysics Data System (ADS)

    Gregory, Kyle J.; Hill, Joanne E.; Black, J. Kevin; Baumgartner, Wayne H.; Jahoda, Keith

    2016-05-01

    A fundamental challenge in a spaceborne application of a gas-based Time Projection Chamber (TPC) for observation of X-ray polarization is handling the large amount of data collected. The TPC polarimeter described uses the APV-25 Application Specific Integrated Circuit (ASIC) to readout a strip detector. Two dimensional photo- electron track images are created with a time projection technique and used to determine the polarization of the incident X-rays. The detector produces a 128x30 pixel image per photon interaction with each pixel registering 12 bits of collected charge. This creates challenging requirements for data storage and downlink bandwidth with only a modest incidence of photons and can have a significant impact on the overall mission cost. An approach is described for locating and isolating the photoelectron track within the detector image, yielding a much smaller data product, typically between 8x8 pixels and 20x20 pixels. This approach is implemented using a Microsemi RT-ProASIC3-3000 Field-Programmable Gate Array (FPGA), clocked at 20 MHz and utilizing 10.7k logic gates (14% of FPGA), 20 Block RAMs (17% of FPGA), and no external RAM. Results will be presented, demonstrating successful photoelectron track cluster detection with minimal impact to detector dead-time.

  8. Approximate protein structural alignment in polynomial time.

    PubMed

    Kolodny, Rachel; Linial, Nathan

    2004-08-17

    Alignment of protein structures is a fundamental task in computational molecular biology. Good structural alignments can help detect distant evolutionary relationships that are hard or impossible to discern from protein sequences alone. Here, we study the structural alignment problem as a family of optimization problems and develop an approximate polynomial-time algorithm to solve them. For a commonly used scoring function, the algorithm runs in O(n(10)/epsilon(6)) time, for globular protein of length n, and it detects alignments that score within an additive error of epsilon from all optima. Thus, we prove that this task is computationally feasible, although the method that we introduce is too slow to be a useful everyday tool. We argue that such approximate solutions are, in fact, of greater interest than exact ones because of the noisy nature of experimentally determined protein coordinates. The measurement of similarity between a pair of protein structures used by our algorithm involves the Euclidean distance between the structures (appropriately rigidly transformed). We show that an alternative approach, which relies on internal distance matrices, must incorporate sophisticated geometric ingredients if it is to guarantee optimality and run in polynomial time. We use these observations to visualize the scoring function for several real instances of the problem. Our investigations yield insights on the computational complexity of protein alignment under various scoring functions. These insights can be used in the design of scoring functions for which the optimum can be approximated efficiently and perhaps in the development of efficient algorithms for the multiple structural alignment problem. PMID:15304646

  9. CARNA—alignment of RNA structure ensembles

    PubMed Central

    Sorescu, Dragoş Alexandru; Möhl, Mathias; Mann, Martin; Backofen, Rolf; Will, Sebastian

    2012-01-01

    Due to recent algorithmic progress, tools for the gold standard of comparative RNA analysis, namely Sankoff-style simultaneous alignment and folding, are now readily applicable. Such approaches, however, compare RNAs with respect to a simultaneously predicted, single, nested consensus structure. To make multiple alignment of RNAs available in cases, where this limitation of the standard approach is critical, we introduce a web server that provides a complete and convenient interface to the RNA structure alignment tool ‘CARNA’. This tool uniquely supports RNAs with multiple conserved structures per RNA and aligns pseudoknots intrinsically; these features are highly desirable for aligning riboswitches, RNAs with conserved folding pathways, or pseudoknots. We represent structural input and output information as base pair probability dot plots; this provides large flexibility in the input, ranging from fixed structures to structure ensembles, and enables immediate visual analysis of the results. In contrast to conventional Sankoff-style approaches, ‘CARNA’ optimizes all structural similarities in the input simultaneously, for example across an entire RNA structure ensemble. Even compared with already costly Sankoff-style alignment, ‘CARNA’ solves an intrinsically much harder problem by applying advanced, constraint-based, algorithmic techniques. Although ‘CARNA’ is specialized to the alignment of RNAs with several conserved structures, its performance on RNAs in general is on par with state-of-the-art general-purpose RNA alignment tools, as we show in a Bralibase 2.1 benchmark. The web server is freely available at http://rna.informatik.uni-freiburg.de/CARNA. PMID:22689637

  10. Incorporating Linguistic Information to Statistical Word-Level Alignment

    NASA Astrophysics Data System (ADS)

    Cendejas, Eduardo; Barceló, Grettel; Gelbukh, Alexander; Sidorov, Grigori

    Parallel texts are enriched by alignment algorithms, thus establishing a relationship between the structures of the implied languages. Depending on the alignment level, the enrichment can be performed on paragraphs, sentences or words, of the expressed content in the source language and its translation. There are two main approaches to perform word-level alignment: statistical or linguistic. Due to the dissimilar grammar rules the languages have, the statistical algorithms usually give lower precision. That is why the development of this type of algorithms is generally aimed at a specific language pair using linguistic techniques. A hybrid alignment system based on the combination of the two traditional approaches is presented in this paper. It provides user-friendly configuration and is adaptable to the computational environment. The system uses linguistic resources and procedures such as identification of cognates, morphological information, syntactic trees, dictionaries, and semantic domains. We show that the system outperforms existing algorithms.

  11. Structural analysis of aligned RNAs.

    PubMed

    Voss, Björn

    2006-01-01

    The knowledge about classes of non-coding RNAs (ncRNAs) is growing very fast and it is mainly the structure which is the common characteristic property shared by members of the same class. For correct characterization of such classes it is therefore of great importance to analyse the structural features in great detail. In this manuscript I present RNAlishapes which combines various secondary structure analysis methods, such as suboptimal folding and shape abstraction, with a comparative approach known as RNA alignment folding. RNAlishapes makes use of an extended thermodynamic model and covariance scoring, which allows to reward covariation of paired bases. Applying the algorithm to a set of bacterial trp-operon leaders using shape abstraction it was able to identify the two alternating conformations of this attenuator. Besides providing in-depth analysis methods for aligned RNAs, the tool also shows a fairly well prediction accuracy. Therefore, RNAlishapes provides the community with a powerful tool for structural analysis of classes of RNAs and is also a reasonable method for consensus structure prediction based on sequence alignments. RNAlishapes is available for online use and download at http://rna.cyanolab.de. PMID:17020924

  12. Oblique electron-cyclotron-emission radial and phase detector of rotating magnetic islands applied to alignment and modulation of electron-cyclotron-current-drive for neoclassical tearing mode stabilization

    SciTech Connect

    Volpe, F.; Austin, M. E.; Campbell, G.; Deterly, T.

    2012-10-15

    A two channel oblique electron cyclotron emission (ECE) radiometer was installed on the DIII-D tokamak and interfaced to four gyrotrons. Oblique ECE was used to toroidally and radially localize rotating magnetic islands and so assist their electron cyclotron current drive (ECCD) stabilization. In particular, after manipulations operated by the interfacing analogue circuit, the oblique ECE signals directly modulated the current drive in synch with the island rotation and in phase with the island O-point, for a more efficient stabilization. Apart from the different toroidal location, the diagnostic view is identical to the ECCD launch direction, which greatly simplified the real-time use of the signals. In fact, a simple toroidal extrapolation was sufficient to lock the modulation to the O-point phase. This was accomplished by a specially designed phase shifter of nearly flat response over the 1-7 kHz range. Moreover, correlation analysis of two channels slightly above and below the ECCD frequency allowed checking the radial alignment to the island, based on the fact that for satisfactory alignment the two signals are out of phase.

  13. Oblique electron-cyclotron-emission radial and phase detector of rotating magnetic islands applied to alignment and modulation of electron-cyclotron-current-drive for neoclassical tearing mode stabilization.

    PubMed

    Volpe, F; Austin, M E; Campbell, G; Deterly, T

    2012-10-01

    A two channel oblique electron cyclotron emission (ECE) radiometer was installed on the DIII-D tokamak and interfaced to four gyrotrons. Oblique ECE was used to toroidally and radially localize rotating magnetic islands and so assist their electron cyclotron current drive (ECCD) stabilization. In particular, after manipulations operated by the interfacing analogue circuit, the oblique ECE signals directly modulated the current drive in synch with the island rotation and in phase with the island O-point, for a more efficient stabilization. Apart from the different toroidal location, the diagnostic view is identical to the ECCD launch direction, which greatly simplified the real-time use of the signals. In fact, a simple toroidal extrapolation was sufficient to lock the modulation to the O-point phase. This was accomplished by a specially designed phase shifter of nearly flat response over the 1-7 kHz range. Moreover, correlation analysis of two channels slightly above and below the ECCD frequency allowed checking the radial alignment to the island, based on the fact that for satisfactory alignment the two signals are out of phase.

  14. Chunk Alignment for Corpus-Based Machine Translation

    ERIC Educational Resources Information Center

    Kim, Jae Dong

    2011-01-01

    Since sub-sentential alignment is critically important to the translation quality of an Example-Based Machine Translation (EBMT) system, which operates by finding and combining phrase-level matches against the training examples, we developed a new alignment algorithm for the purpose of improving the EBMT system's performance. This new…

  15. Horizontal carbon nanotube alignment.

    PubMed

    Cole, Matthew T; Cientanni, Vito; Milne, William I

    2016-09-21

    The production of horizontally aligned carbon nanotubes offers a rapid means of realizing a myriad of self-assembled near-atom-scale technologies - from novel photonic crystals to nanoscale transistors. The ability to reproducibly align anisotropic nanostructures has huge technological value. Here we review the present state-of-the-art in horizontal carbon nanotube alignment. For both in and ex situ approaches, we quantitatively assess the reported linear packing densities alongside the degree of alignment possible for each of these core methodologies. PMID:27546174

  16. Horizontal carbon nanotube alignment.

    PubMed

    Cole, Matthew T; Cientanni, Vito; Milne, William I

    2016-09-21

    The production of horizontally aligned carbon nanotubes offers a rapid means of realizing a myriad of self-assembled near-atom-scale technologies - from novel photonic crystals to nanoscale transistors. The ability to reproducibly align anisotropic nanostructures has huge technological value. Here we review the present state-of-the-art in horizontal carbon nanotube alignment. For both in and ex situ approaches, we quantitatively assess the reported linear packing densities alongside the degree of alignment possible for each of these core methodologies.

  17. Orthodontics and Aligners

    MedlinePlus

    ... Repairing Chipped Teeth Teeth Whitening Tooth-Colored Fillings Orthodontics and Aligners Straighten teeth for a healthier smile. Orthodontics When consumers think about orthodontics, braces are the ...

  18. Tidal alignment of galaxies

    NASA Astrophysics Data System (ADS)

    Blazek, Jonathan; Vlah, Zvonimir; Seljak, Uroš

    2015-08-01

    We develop an analytic model for galaxy intrinsic alignments (IA) based on the theory of tidal alignment. We calculate all relevant nonlinear corrections at one-loop order, including effects from nonlinear density evolution, galaxy biasing, and source density weighting. Contributions from density weighting are found to be particularly important and lead to bias dependence of the IA amplitude, even on large scales. This effect may be responsible for much of the luminosity dependence in IA observations. The increase in IA amplitude for more highly biased galaxies reflects their locations in regions with large tidal fields. We also consider the impact of smoothing the tidal field on halo scales. We compare the performance of this consistent nonlinear model in describing the observed alignment of luminous red galaxies with the linear model as well as the frequently used "nonlinear alignment model," finding a significant improvement on small and intermediate scales. We also show that the cross-correlation between density and IA (the "GI" term) can be effectively separated into source alignment and source clustering, and we accurately model the observed alignment down to the one-halo regime using the tidal field from the fully nonlinear halo-matter cross correlation. Inside the one-halo regime, the average alignment of galaxies with density tracers no longer follows the tidal alignment prediction, likely reflecting nonlinear processes that must be considered when modeling IA on these scales. Finally, we discuss tidal alignment in the context of cosmic shear measurements.

  19. Anomalous Polarization May Improve Infrared Detectors

    NASA Technical Reports Server (NTRS)

    Yang, Chan-Lon; Pan, Dee-Son

    1990-01-01

    New configurations proposed for quantum-well devices. Simplifies alignment, increases sensitivity, and opens up more possibilities in design of quantum-well detectors of infrared radiation. In detector made according to proposed concept, light incident broadside on front surface absorbed. No special waveguide structures required.

  20. A novel randomized iterative strategy for aligning multiple protein sequences.

    PubMed

    Berger, M P; Munson, P J

    1991-10-01

    The rigorous alignment of multiple protein sequences becomes impractical even with a modest number of sequences, since computer memory and time requirements increase as the product of the lengths of the sequences. We have devised a strategy to approach such an optimal alignment, which modifies the intensive computer storage and time requirements of dynamic programming. Our algorithm randomly divides a group of unaligned sequences into two subgroups, between which an optimal alignment is then obtained by a Needleman-Wunsch style of algorithm. Our algorithm uses a matrix with dimensions corresponding to the lengths of the two aligned sequence subgroups. The pairwise alignment process is repeated using different random divisions of the whole group into two subgroups. Compared with the rigorous approach of solving the n-dimensional lattice by dynamic programming, our iterative algorithm results in alignments that match or are close to the optimal solution, on a limited set of test problems. We have implemented this algorithm in a computer program that runs on the IBM PC class of machines, together with a user-friendly environment for interactively selecting sequences or groups of sequences to be aligned either simultaneously or progressively.

  1. Detector Mount Design for IGRINS

    NASA Astrophysics Data System (ADS)

    Oh, Jae Sok; Park, Chan; Cha, Sang-Mok; Yuk, In-Soo; Park, Kwijong; Kim, Kang-Min; Chun, Moo-Young; Ko, Kyeongyeon; Oh, Heeyoung; Jeong, Ueejeong; Nah, Jakyoung; Lee, Hanshin; Jaffe, Daniel T.

    2014-06-01

    The Immersion Grating Infrared Spectrometer (IGRINS) is a near-infrared wide-band high-resolution spectrograph jointly developed by the Korea Astronomy and Space Science Institute and the University of Texas at Austin. IGRINS employs three HAWAII-2RG Focal Plane Array (H2RG FPA) detectors. We present the design and fabrication of the detector mount for the H2RG detector. The detector mount consists of a detector housing, an ASIC housing, a Field Flattener Lens (FFL) mount, and a support base frame. The detector and the ASIC housing should be kept at 65 K and the support base frame at 130 K. Therefore they are thermally isolated by the support made of GFRP material. The detector mount is designed so that it has features of fine adjusting the position of the detector surface in the optical axis and of fine adjusting yaw and pitch angles in order to utilize as an optical system alignment compensator. We optimized the structural stability and thermal characteristics of the mount design using computer-aided 3D modeling and finite element analysis. Based on the structural and thermal analysis, the designed detector mount meets an optical stability tolerance and system thermal requirements. Actual detector mount fabricated based on the design has been installed into the IGRINS cryostat and successfully passed a vacuum test and a cold test.

  2. Transmutation detectors

    NASA Astrophysics Data System (ADS)

    Viererbl, L.; Lahodová, Z.; Klupák, V.; Sus, F.; Kučera, J.; Kůs, P.; Marek, M.

    2011-03-01

    We have designed a new type of detectors, called transmutation detectors, which can be used primarily for neutron fluence measurement. The transmutation detector method differs from the commonly used activation detector method in evaluation of detector response after irradiation. Instead of radionuclide activity measurement using radiometric methods, the concentration of stable non-gaseous nuclides generated by transmutation in the detector is measured using analytical methods like mass spectrometry. Prospective elements and nuclear reactions for transmutation detectors are listed and initial experimental results are given. The transmutation detector method could be used primarily for long-term measurement of neutron fluence in fission nuclear reactors, but in principle it could be used for any type of radiation that can cause transmutation of nuclides in detectors. This method could also be used for measurement in accelerators or fusion reactors.

  3. A New Analytic Alignment Method for a SINS.

    PubMed

    Tan, Caiming; Zhu, Xinhua; Su, Yan; Wang, Yu; Wu, Zhiqiang; Gu, Dongbing

    2015-01-01

    Analytic alignment is a type of self-alignment for a Strapdown inertial navigation system (SINS) that is based solely on two non-collinear vectors, which are the gravity and rotational velocity vectors of the Earth at a stationary base on the ground. The attitude of the SINS with respect to the Earth can be obtained directly using the TRIAD algorithm given two vector measurements. For a traditional analytic coarse alignment, all six outputs from the inertial measurement unit (IMU) are used to compute the attitude. In this study, a novel analytic alignment method called selective alignment is presented. This method uses only three outputs of the IMU and a few properties from the remaining outputs such as the sign and the approximate value to calculate the attitude. Simulations and experimental results demonstrate the validity of this method, and the precision of yaw is improved using the selective alignment method compared to the traditional analytic coarse alignment method in the vehicle experiment. The selective alignment principle provides an accurate relationship between the outputs and the attitude of the SINS relative to the Earth for a stationary base, and it is an extension of the TRIAD algorithm. The selective alignment approach has potential uses in applications such as self-alignment, fault detection, and self-calibration.

  4. A New Analytic Alignment Method for a SINS.

    PubMed

    Tan, Caiming; Zhu, Xinhua; Su, Yan; Wang, Yu; Wu, Zhiqiang; Gu, Dongbing

    2015-01-01

    Analytic alignment is a type of self-alignment for a Strapdown inertial navigation system (SINS) that is based solely on two non-collinear vectors, which are the gravity and rotational velocity vectors of the Earth at a stationary base on the ground. The attitude of the SINS with respect to the Earth can be obtained directly using the TRIAD algorithm given two vector measurements. For a traditional analytic coarse alignment, all six outputs from the inertial measurement unit (IMU) are used to compute the attitude. In this study, a novel analytic alignment method called selective alignment is presented. This method uses only three outputs of the IMU and a few properties from the remaining outputs such as the sign and the approximate value to calculate the attitude. Simulations and experimental results demonstrate the validity of this method, and the precision of yaw is improved using the selective alignment method compared to the traditional analytic coarse alignment method in the vehicle experiment. The selective alignment principle provides an accurate relationship between the outputs and the attitude of the SINS relative to the Earth for a stationary base, and it is an extension of the TRIAD algorithm. The selective alignment approach has potential uses in applications such as self-alignment, fault detection, and self-calibration. PMID:26556353

  5. A New Analytic Alignment Method for a SINS

    PubMed Central

    Tan, Caiming; Zhu, Xinhua; Su, Yan; Wang, Yu; Wu, Zhiqiang; Gu, Dongbing

    2015-01-01

    Analytic alignment is a type of self-alignment for a Strapdown inertial navigation system (SINS) that is based solely on two non-collinear vectors, which are the gravity and rotational velocity vectors of the Earth at a stationary base on the ground. The attitude of the SINS with respect to the Earth can be obtained directly using the TRIAD algorithm given two vector measurements. For a traditional analytic coarse alignment, all six outputs from the inertial measurement unit (IMU) are used to compute the attitude. In this study, a novel analytic alignment method called selective alignment is presented. This method uses only three outputs of the IMU and a few properties from the remaining outputs such as the sign and the approximate value to calculate the attitude. Simulations and experimental results demonstrate the validity of this method, and the precision of yaw is improved using the selective alignment method compared to the traditional analytic coarse alignment method in the vehicle experiment. The selective alignment principle provides an accurate relationship between the outputs and the attitude of the SINS relative to the Earth for a stationary base, and it is an extension of the TRIAD algorithm. The selective alignment approach has potential uses in applications such as self-alignment, fault detection, and self-calibration. PMID:26556353

  6. Subminiature infrared detector translation stage

    NASA Astrophysics Data System (ADS)

    Bell, Alan D.

    1989-11-01

    This paper describes a precision subminiature three-axis translation stage used in the GOES Sounder to provide positional adjustment of 12 cooled infrared detectors. Four separate translation stages and detectors are packaged into a detector mechanism which has an overall size of 0.850 x 1.230 x 0.600 inches. Each translation stage is capable of + or - 0.015 inch motion in the X and Y axes and +0.050/-0.025 inch motion in the Z axis with a sensitivity of 0.0002 inches. The function of the detector translation stage allows real time detector signal peaking during Sounder alignment. The translation stage operates in a cryogenic environment under a 10 to the -6th torr vacuum.

  7. Subminiature infrared detector translation stage

    NASA Technical Reports Server (NTRS)

    Bell, Alan D.

    1989-01-01

    This paper describes a precision subminiature three-axis translation stage used in the GOES Sounder to provide positional adjustment of 12 cooled infrared detectors. Four separate translation stages and detectors are packaged into a detector mechanism which has an overall size of 0.850 x 1.230 x 0.600 inches. Each translation stage is capable of + or - 0.015 inch motion in the X and Y axes and +0.050/-0.025 inch motion in the Z axis with a sensitivity of 0.0002 inches. The function of the detector translation stage allows real time detector signal peaking during Sounder alignment. The translation stage operates in a cryogenic environment under a 10 to the -6th torr vacuum.

  8. FlexSnap: Flexible Non-sequential Protein Structure Alignment

    PubMed Central

    2010-01-01

    Background Proteins have evolved subject to energetic selection pressure for stability and flexibility. Structural similarity between proteins that have gone through conformational changes can be captured effectively if flexibility is considered. Topologically unrelated proteins that preserve secondary structure packing interactions can be detected if both flexibility and Sequential permutations are considered. We propose the FlexSnap algorithm for flexible non-topological protein structural alignment. Results The effectiveness of FlexSnap is demonstrated by measuring the agreement of its alignments with manually curated non-sequential structural alignments. FlexSnap showed competitive results against state-of-the-art algorithms, like DALI, SARF2, MultiProt, FlexProt, and FATCAT. Moreover on the DynDom dataset, FlexSnap reported longer alignments with smaller rmsd. Conclusions We have introduced FlexSnap, a greedy chaining algorithm that reports both sequential and non-sequential alignments and allows twists (hinges). We assessed the quality of the FlexSnap alignments by measuring its agreements with manually curated non-sequential alignments. On the FlexProt dataset, FlexSnap was competitive to state-of-the-art flexible alignment methods. Moreover, we demonstrated the benefits of introducing hinges by showing significant improvements in the alignments reported by FlexSnap for the structure pairs for which rigid alignment methods reported alignments with either low coverage or large rmsd. Availability An implementation of the FlexSnap algorithm will be made available online at http://www.cs.rpi.edu/~zaki/software/flexsnap. PMID:20047669

  9. Hole-Aligning Tool

    NASA Technical Reports Server (NTRS)

    Collins, Frank A.; Saude, Frank; Sep, Martin J.

    1996-01-01

    Tool designed for use in aligning holes in plates or other structural members to be joined by bolt through holes. Holes aligned without exerting forces perpendicular to planes of holes. Tool features screw-driven-wedge design similar to (but simpler than) that of some automotive exhaust-pipe-expanding tools.

  10. Effects of defect pixel correction algorithms for x-ray detectors on image quality in planar projection and volumetric CT data sets

    NASA Astrophysics Data System (ADS)

    Kuttig, Jan; Steiding, Christian; Hupfer, Martin; Karolczak, Marek; Kolditz, Daniel

    2015-09-01

    In this study we compared various defect pixel correction methods for reducing artifact appearance within projection images used for computed tomography (CT) reconstructions. Defect pixel correction algorithms were examined with respect to their artifact behaviour within planar projection images as well as in volumetric CT reconstructions. We investigated four algorithms: nearest neighbour, linear and adaptive linear interpolation, and a frequency-selective spectral-domain approach. To characterise the quality of each algorithm in planar image data, we inserted line defects of varying widths and orientations into images. The structure preservation of each algorithm was analysed by corrupting and correcting the image of a slit phantom pattern and by evaluating its line spread function (LSF). The noise preservation was assessed by interpolating corrupted flat images and estimating the noise power spectrum (NPS) of the interpolated region. For the volumetric investigations, we examined the structure and noise preservation within a structured aluminium foam, a mid-contrast cone-beam phantom and a homogeneous Polyurethane (PUR) cylinder. The frequency-selective algorithm showed the best structure and noise preservation for planar data of the correction methods tested. For volumetric data it still showed the best noise preservation, whereas the structure preservation was outperformed by the linear interpolation. The frequency-selective spectral-domain approach in the correction of line defects is recommended for planar image data, but its abilities within high-contrast volumes are restricted. In that case, the application of a simple linear interpolation might be the better choice to correct line defects within projection images used for CT.

  11. Measurement of the Inclusive Jet Cross Section using the k(T) algorithm in p anti-p collisions at s**(1/2) = 1.96-TeV with the CDF II Detector

    SciTech Connect

    Abulencia, A.; Adelman, J.; Affolder, Anthony Allen; Akimoto, T.; Albrow, Michael G.; Ambrose, D.; Amerio, S.; Amidei, Dante E.; Anastassov, A.; Anikeev, Konstantin; Annovi, A.; /Frascati /Comenius U.

    2007-01-01

    The authors report on measurements of the inclusive jet production cross section as a function of the jet transverse momentum in p{bar p} collisions at {radical}s = 1.96 TeV, using the k{sub T} algorithm and a data sample corresponding to 1.0 fb{sup -1} collected with the Collider Detector at Fermilab in Run II. The measurements are carried out in five different jet rapidity regions with |y{sup jet}| < 2.1 and transverse momentum in the range 54 < p{sub T}{sup jet} < 700 GeV/c. Next-to-leading order perturbative QCD predictions are in good agreement with the measured cross sections.

  12. Accurate multiple network alignment through context-sensitive random walk

    PubMed Central

    2015-01-01

    Background Comparative network analysis can provide an effective means of analyzing large-scale biological networks and gaining novel insights into their structure and organization. Global network alignment aims to predict the best overall mapping between a given set of biological networks, thereby identifying important similarities as well as differences among the networks. It has been shown that network alignment methods can be used to detect pathways or network modules that are conserved across different networks. Until now, a number of network alignment algorithms have been proposed based on different formulations and approaches, many of them focusing on pairwise alignment. Results In this work, we propose a novel multiple network alignment algorithm based on a context-sensitive random walk model. The random walker employed in the proposed algorithm switches between two different modes, namely, an individual walk on a single network and a simultaneous walk on two networks. The switching decision is made in a context-sensitive manner by examining the current neighborhood, which is effective for quantitatively estimating the degree of correspondence between nodes that belong to different networks, in a manner that sensibly integrates node similarity and topological similarity. The resulting node correspondence scores are then used to predict the maximum expected accuracy (MEA) alignment of the given networks. Conclusions Performance evaluation based on synthetic networks as well as real protein-protein interaction networks shows that the proposed algorithm can construct more accurate multiple network alignments compared to other leading methods. PMID:25707987

  13. AlignNemo: A Local Network Alignment Method to Integrate Homology and Topology

    PubMed Central

    Guzzi, Pietro H.; Cannataro, Mario; Guerra, Concettina

    2012-01-01

    Local network alignment is an important component of the analysis of protein-protein interaction networks that may lead to the identification of evolutionary related complexes. We present AlignNemo, a new algorithm that, given the networks of two organisms, uncovers subnetworks of proteins that relate in biological function and topology of interactions. The discovered conserved subnetworks have a general topology and need not to correspond to specific interaction patterns, so that they more closely fit the models of functional complexes proposed in the literature. The algorithm is able to handle sparse interaction data with an expansion process that at each step explores the local topology of the networks beyond the proteins directly interacting with the current solution. To assess the performance of AlignNemo, we ran a series of benchmarks using statistical measures as well as biological knowledge. Based on reference datasets of protein complexes, AlignNemo shows better performance than other methods in terms of both precision and recall. We show our solutions to be biologically sound using the concept of semantic similarity applied to Gene Ontology vocabularies. The binaries of AlignNemo and supplementary details about the algorithms and the experiments are available at: sourceforge.net/p/alignnemo. PMID:22719866

  14. Optical alignment of high resolution Fourier transform spectrometers

    NASA Technical Reports Server (NTRS)

    Breckinridge, J. B.; Ocallaghan, F. G.; Cassie, A. G.

    1980-01-01

    Remote sensing, high resolution FTS instruments often contain three primary optical subsystems: Fore-Optics, Interferometer Optics, and Post, or Detector Optics. We discuss the alignment of a double-pass FTS containing a cat's-eye retro-reflector. Also, the alignment of fore-optics containing confocal paraboloids with a reflecting field stop which relays a field image onto a camera is discussed.

  15. Galaxy Alignments: An Overview

    NASA Astrophysics Data System (ADS)

    Joachimi, Benjamin; Cacciato, Marcello; Kitching, Thomas D.; Leonard, Adrienne; Mandelbaum, Rachel; Schäfer, Björn Malte; Sifón, Cristóbal; Hoekstra, Henk; Kiessling, Alina; Kirk, Donnacha; Rassat, Anais

    2015-11-01

    The alignments between galaxies, their underlying matter structures, and the cosmic web constitute vital ingredients for a comprehensive understanding of gravity, the nature of matter, and structure formation in the Universe. We provide an overview on the state of the art in the study of these alignment processes and their observational signatures, aimed at a non-specialist audience. The development of the field over the past one hundred years is briefly reviewed. We also discuss the impact of galaxy alignments on measurements of weak gravitational lensing, and discuss avenues for making theoretical and observational progress over the coming decade.

  16. Radiative Grain Alignment

    NASA Astrophysics Data System (ADS)

    Andersson, B. G.

    2015-12-01

    Polarization due to aligned dust grains was discovered in the interstellar medium more than 60 years ago. A quantitative, observationally well tested theory of the phenomenon has finally emerged in the last decade, promising not only an improved understanding of interstellar magnetic fields, but new tools for studying the dust environments and grain characteristics. This Radiative Alignment Torque (RAT) theory also has many potential applications in solar system physics, including for comet dust characteristics. I will review the main aspects of the theory and the observational tests performed to date, as well as some of the new possibilities for using polarization as a tool to study dust and its environment, with RAT alignment.

  17. Hybrid vehicle motor alignment

    DOEpatents

    Levin, Michael Benjamin

    2001-07-03

    A rotor of an electric motor for a motor vehicle is aligned to an axis of rotation for a crankshaft of an internal combustion engine having an internal combustion engine and an electric motor. A locator is provided on the crankshaft, a piloting tool is located radially by the first locator to the crankshaft. A stator of the electric motor is aligned to a second locator provided on the piloting tool. The stator is secured to the engine block. The rotor is aligned to the crankshaft and secured thereto.

  18. Intelligent Detector Design

    SciTech Connect

    Graf, N.; Cassell, R.; Johnson, T.; McCormick, J.; Magill, S.; Kuhlmann, S.; /Argonne

    2007-02-13

    At a future e+e- linear collider, precision measurements of jets will be required in order to understand physics at and beyond the electroweak scale. Calorimetry will be used with other detectors in an optimal way to reconstruct particle 4-vectors with unprecedented precision. This Particle Flow Algorithm (PFA) approach is seen as the best way to achieve particle mass resolutions from dijet measurements in the range of {approx} 30%/{radical}E, resulting in innovative methods for choosing the calorimeter technology and optimizing the detector design.

  19. Algorithms and Algorithmic Languages.

    ERIC Educational Resources Information Center

    Veselov, V. M.; Koprov, V. M.

    This paper is intended as an introduction to a number of problems connected with the description of algorithms and algorithmic languages, particularly the syntaxes and semantics of algorithmic languages. The terms "letter, word, alphabet" are defined and described. The concept of the algorithm is defined and the relation between the algorithm and…

  20. Optimizing a global alignment of protein interaction networks

    PubMed Central

    Chindelevitch, Leonid; Ma, Cheng-Yu; Liao, Chung-Shou; Berger, Bonnie

    2013-01-01

    Motivation: The global alignment of protein interaction networks is a widely studied problem. It is an important first step in understanding the relationship between the proteins in different species and identifying functional orthologs. Furthermore, it can provide useful insights into the species’ evolution. Results: We propose a novel algorithm, PISwap, for optimizing global pairwise alignments of protein interaction networks, based on a local optimization heuristic that has previously demonstrated its effectiveness for a variety of other intractable problems. PISwap can begin with different types of network alignment approaches and then iteratively adjust the initial alignments by incorporating network topology information, trading it off for sequence information. In practice, our algorithm efficiently refines other well-studied alignment techniques with almost no additional time cost. We also show the robustness of the algorithm to noise in protein interaction data. In addition, the flexible nature of this algorithm makes it suitable for different applications of network alignment. This algorithm can yield interesting insights into the evolutionary dynamics of related species. Availability: Our software is freely available for non-commercial purposes from our Web site, http://piswap.csail.mit.edu/. Contact: bab@csail.mit.edu or csliao@ie.nthu.edu.tw Supplementary information: Supplementary data are available at Bioinformatics online. PMID:24048352

  1. Topological network alignment uncovers biological function and phylogeny

    PubMed Central

    Kuchaiev, Oleksii; Milenković, Tijana; Memišević, Vesna; Hayes, Wayne; Pržulj, Nataša

    2010-01-01

    Sequence comparison and alignment has had an enormous impact on our understanding of evolution, biology and disease. Comparison and alignment of biological networks will probably have a similar impact. Existing network alignments use information external to the networks, such as sequence, because no good algorithm for purely topological alignment has yet been devised. In this paper, we present a novel algorithm based solely on network topology, that can be used to align any two networks. We apply it to biological networks to produce by far the most complete topological alignments of biological networks to date. We demonstrate that both species phylogeny and detailed biological function of individual proteins can be extracted from our alignments. Topology-based alignments have the potential to provide a completely new, independent source of phylogenetic information. Our alignment of the protein–protein interaction networks of two very different species—yeast and human—indicate that even distant species share a surprising amount of network topology, suggesting broad similarities in internal cellular wiring across all life on Earth. PMID:20236959

  2. Response microcantilever thermal detector

    DOEpatents

    Cunningham, Joseph P.; Rajic, Slobodan; Datskos, Panagiotis G.; Evans III, Boyd M.

    2004-10-19

    A "folded leg" thermal detector microcantilever constructed of a substrate with at least one leg interposed between a fixed end and a deflective end, each leg having at least three essentially parallel leg segments interconnected on alternate opposing ends and aligned in a serpentine pattern with only the first leg segment attached to the fixed end and only the last leg segment attached to the deflective end. Alternate leg segment are coated on the pentalever with coating applied to the top of the first, third, and fifth leg segments of each leg and to the bottom of the second and fourth leg segments of each leg.

  3. Local Structural Alignment of RNA with Affine Gap Model

    NASA Astrophysics Data System (ADS)

    Wong, Thomas K. F.; Cheung, Brenda W. Y.; Lam, T. W.; Yiu, S. M.

    Predicting new non-coding RNAs (ncRNAs) of a family can be done by aligning the potential candidate with a member of the family with known sequence and secondary structure. Existing tools either only consider the sequence similarity or cannot handle local alignment with gaps. In this paper, we consider the problem of finding the optimal local structural alignment between a query RNA sequence (with known secondary structure) and a target sequence (with unknown secondary structure) with the affine gap penalty model. We provide the algorithm to solve the problem. Based on a preliminary experiment, we show that there are ncRNA families in which considering local structural alignment with gap penalty model can identify real hits more effectively than using global alignment or local alignment without gap penalty model.

  4. Alignment of the magnet and a positioning method

    NASA Astrophysics Data System (ADS)

    Kim, Dae-Il

    2015-10-01

    The 100-MeV proton linac and magnets for the KOMAC (Korea Multi-purpose Accelerator Complex) were installed in the tunnel and the beamlines. The fiducialization process was accomplished with the measurement of mechanical shape and the transfer of the coordinates to the fiducial points that are used in two laser-trackers based alignments. The reference points called the alignment network were set up on the wall inside tunnel. The linac and the beam transport magnets were aligned based on the survey results of the alignment networks. In this paper, the alignment procedure and the alignment results are presented, and an algorithm that was developed to manipulate the adjusters of the magnetsis introduced.

  5. Precision synchrotron radiation detectors

    SciTech Connect

    Levi, M.; Rouse, F.; Butler, J.; Jung, C.K.; Lateur, M.; Nash, J.; Tinsman, J.; Wormser, G.; Gomez, J.J.; Kent, J.

    1989-03-01

    Precision detectors to measure synchrotron radiation beam positions have been designed and installed as part of beam energy spectrometers at the Stanford Linear Collider (SLC). The distance between pairs of synchrotron radiation beams is measured absolutely to better than 28 /mu/m on a pulse-to-pulse basis. This contributes less than 5 MeV to the error in the measurement of SLC beam energies (approximately 50 GeV). A system of high-resolution video cameras viewing precisely-aligned fiducial wire arrays overlaying phosphorescent screens has achieved this accuracy. Also, detectors of synchrotron radiation using the charge developed by the ejection of Compton-recoil electrons from an array of fine wires are being developed. 4 refs., 5 figs., 1 tab.

  6. Stable glow discharge detector

    DOEpatents

    Koo, Jackson C.; Yu, Conrad M.

    2004-05-18

    A highly sensitive electronic ion cell for the measurement of trace elements in He carrier gas which involves glow discharge. A constant wave (CW) stable glow discharge detector which is controlled through a biased resistor, can detect the change of electron density caused by impurities in the He carrier gas by many orders of magnitude larger than that caused by direct ionization or electron capture. The stable glow discharge detector utilizes a floating pseudo-electrode to form a probe in or near the plasma and a solid rod electrode. By using this probe, the large variation of electron density due to trace amounts of impurities can be directly measured. The solid rod electrode provides greater stability and thus easier alignment.

  7. Unstable resonator alignment study using off-axis injection.

    PubMed

    Ferguson, T R; Ploor, M D

    1991-10-20

    A brief qualitative experiment and subsequent theoretical study provide new insight concerning off-axis injection of unstable resonators. Theoretical results for aligned resonators show that the regurgitated beam intensity distribution and direction of travel are sensitive to the size, tilt, and other parameters of the injected beam, to the coherence length and number of longitudinal modes of the injecting laser, to clipping and diffraction from apertures, and to resonator length tuning. It is concluded that visual observations of output asymmetries can be used to align the resonator to some degree, but precise alignment using measurement of output asymmetries by a detector array is questionable. PMID:20717200

  8. Alignment sensing and control for squeezed vacuum states of light.

    PubMed

    Schreiber, E; Dooley, K L; Vahlbruch, H; Affeldt, C; Bisht, A; Leong, J R; Lough, J; Prijatelj, M; Slutsky, J; Was, M; Wittel, H; Danzmann, K; Grote, H

    2016-01-11

    Beam alignment is an important practical aspect of the application of squeezed states of light. Misalignments in the detection of squeezed light result in a reduction of the observable squeezing level. In the case of squeezed vacuum fields that contain only very few photons, special measures must be taken in order to sense and control the alignment of the essentially dark beam. The GEO 600 gravitational wave detector employs a squeezed vacuum source to improve its detection sensitivity beyond the limits set by classical quantum shot noise. Here, we present our design and implementation of an alignment sensing and control scheme that ensures continuous optimal alignment of the squeezed vacuum field at GEO 600 on long time scales in the presence of free-swinging optics. This first demonstration of a squeezed light automatic alignment system will be of particular interest for future long-term applications of squeezed vacuum states of light. PMID:26832246

  9. Alignment sensing and control for squeezed vacuum states of light.

    PubMed

    Schreiber, E; Dooley, K L; Vahlbruch, H; Affeldt, C; Bisht, A; Leong, J R; Lough, J; Prijatelj, M; Slutsky, J; Was, M; Wittel, H; Danzmann, K; Grote, H

    2016-01-11

    Beam alignment is an important practical aspect of the application of squeezed states of light. Misalignments in the detection of squeezed light result in a reduction of the observable squeezing level. In the case of squeezed vacuum fields that contain only very few photons, special measures must be taken in order to sense and control the alignment of the essentially dark beam. The GEO 600 gravitational wave detector employs a squeezed vacuum source to improve its detection sensitivity beyond the limits set by classical quantum shot noise. Here, we present our design and implementation of an alignment sensing and control scheme that ensures continuous optimal alignment of the squeezed vacuum field at GEO 600 on long time scales in the presence of free-swinging optics. This first demonstration of a squeezed light automatic alignment system will be of particular interest for future long-term applications of squeezed vacuum states of light.

  10. Alignment of Short Reads: A Crucial Step for Application of Next-Generation Sequencing Data in Precision Medicine.

    PubMed

    Ye, Hao; Meehan, Joe; Tong, Weida; Hong, Huixiao

    2015-01-01

    Precision medicine or personalized medicine has been proposed as a modernized and promising medical strategy. Genetic variants of patients are the key information for implementation of precision medicine. Next-generation sequencing (NGS) is an emerging technology for deciphering genetic variants. Alignment of raw reads to a reference genome is one of the key steps in NGS data analysis. Many algorithms have been developed for alignment of short read sequences since 2008. Users have to make a decision on which alignment algorithm to use in their studies. Selection of the right alignment algorithm determines not only the alignment algorithm but also the set of suitable parameters to be used by the algorithm. Understanding these algorithms helps in selecting the appropriate alignment algorithm for different applications in precision medicine. Here, we review current available algorithms and their major strategies such as seed-and-extend and q-gram filter. We also discuss the challenges in current alignment algorithms, including alignment in multiple repeated regions, long reads alignment and alignment facilitated with known genetic variants.

  11. Alignment of Short Reads: A Crucial Step for Application of Next-Generation Sequencing Data in Precision Medicine

    PubMed Central

    Ye, Hao; Meehan, Joe; Tong, Weida; Hong, Huixiao

    2015-01-01

    Precision medicine or personalized medicine has been proposed as a modernized and promising medical strategy. Genetic variants of patients are the key information for implementation of precision medicine. Next-generation sequencing (NGS) is an emerging technology for deciphering genetic variants. Alignment of raw reads to a reference genome is one of the key steps in NGS data analysis. Many algorithms have been developed for alignment of short read sequences since 2008. Users have to make a decision on which alignment algorithm to use in their studies. Selection of the right alignment algorithm determines not only the alignment algorithm but also the set of suitable parameters to be used by the algorithm. Understanding these algorithms helps in selecting the appropriate alignment algorithm for different applications in precision medicine. Here, we review current available algorithms and their major strategies such as seed-and-extend and q-gram filter. We also discuss the challenges in current alignment algorithms, including alignment in multiple repeated regions, long reads alignment and alignment facilitated with known genetic variants. PMID:26610555

  12. PDV Probe Alignment Technique

    SciTech Connect

    Whitworth, T L; May, C M; Strand, O T

    2007-10-26

    This alignment technique was developed while performing heterodyne velocimetry measurements at LLNL. There are a few minor items needed, such as a white card with aperture in center, visible alignment laser, IR back reflection meter, and a microscope to view the bridge surface. The work was performed on KCP flyers that were 6 and 8 mils wide. The probes used were Oz Optics manufactured with focal distances of 42mm and 26mm. Both probes provide a spot size of approximately 80?m at 1550nm. The 42mm probes were specified to provide an internal back reflection of -35 to -40dB, and the probe back reflections were measured to be -37dB and -33dB. The 26mm probes were specified as -30dB and both measured -30.5dB. The probe is initially aligned normal to the flyer/bridge surface. This provides a very high return signal, up to -2dB, due to the bridge reflectivity. A white card with a hole in the center as an aperture can be used to check the reflected beam position relative to the probe and launch beam, and the alignment laser spot centered on the bridge, see Figure 1 and Figure 2. The IR back reflection meter is used to measure the dB return from the probe and surface, and a white card or similar object is inserted between the probe and surface to block surface reflection. It may take several iterations between the visible alignment laser and the IR back reflection meter to complete this alignment procedure. Once aligned normal to the surface, the probe should be tilted to position the visible alignment beam as shown in Figure 3, and the flyer should be translated in the X and Y axis to reposition the alignment beam onto the flyer as shown in Figure 4. This tilting of the probe minimizes the amount of light from the bridge reflection into the fiber within the probe while maintaining the alignment as near normal to the flyer surface as possible. When the back reflection is measured after the tilt adjustment, the level should be about -3dB to -6dB higher than the probes

  13. Graph-based molecular alignment (GMA).

    PubMed

    Marialke, J; Körner, R; Tietze, S; Apostolakis, Joannis

    2007-01-01

    We describe a combined 2D/3D approach for the superposition of flexible chemical structures, which is based on recent progress in the efficient identification of common subgraphs and a gradient-based torsion space optimization algorithm. The simplicity of the approach is reflected in its generality and computational efficiency: the suggested approach neither requires precalculated statistics on the conformations of the molecules nor does it make simplifying assumptions on the topology of the molecules being compared. Furthermore, graph-based molecular alignment produces alignments that are consistent with the chemistry of the molecules as well as their general structure, as it depends on both the local connectivities between atoms and the overall topology of the molecules. We validate this approach on benchmark sets taken from the literature and show that it leads to good results compared to computationally and algorithmically more involved methods. The results suggest that, for most practical purposes, graph-based molecular alignment is a viable alternative to molecular field alignment with respect to structural superposition and leads to structures of comparable quality in a fraction of the time. PMID:17381175

  14. Curriculum Alignment Research Suggests that Alignment Can Improve Student Achievement

    ERIC Educational Resources Information Center

    Squires, David

    2012-01-01

    Curriculum alignment research has developed showing the relationship among three alignment categories: the taught curriculum, the tested curriculum and the written curriculum. Each pair (for example, the taught and the written curriculum) shows a positive impact for aligning those results. Following this, alignment results from the Third…

  15. QUADRUPOLE BEAM-BASED ALIGNMENT AT RHIC.

    SciTech Connect

    NIEDZIELA, J.; MONTAG, C.; SATOGATA, T.

    2005-05-16

    Successful implementation of a beam-based alignment algorithm, tailored to different types of quadrupoles at RHIC, provides significant benefits to machine operations for heavy ions and polarized protons. This algorithm was used to calibrate beam position monitor centers relative to interaction region quadrupoles to maximize aperture. This approach was also used to determine the optimal orbit through transition jump quadrupoles to minimize orbit changes during the transition jump for heavy ion acceleration. This paper provides background discussion and results from first measurements during the RHIC 2005 run.

  16. Improved pen alignment for bidirectional printing

    NASA Astrophysics Data System (ADS)

    Bernal, Edgar; Allebach, Jan P.; Pizlo, Zygmunt

    2006-01-01

    The quality of the prints produced by an inkjet printer is highly dependent on the characteristics of the dots produced by the inkjet pens. While some literature discusses metrics for the objective evaluation of print quality, few of the efforts have combined automated quality tests with subjective assessment. We develop an algorithm for analyzing printed dots and study the effects of the dot characteristics on the perceived print alignment. We establish the perceptual preferences of human observers via a set of psychophysical experiments.

  17. Fast and sensitive protein alignment using DIAMOND.

    PubMed

    Buchfink, Benjamin; Xie, Chao; Huson, Daniel H

    2015-01-01

    The alignment of sequencing reads against a protein reference database is a major computational bottleneck in metagenomics and data-intensive evolutionary projects. Although recent tools offer improved performance over the gold standard BLASTX, they exhibit only a modest speedup or low sensitivity. We introduce DIAMOND, an open-source algorithm based on double indexing that is 20,000 times faster than BLASTX on short reads and has a similar degree of sensitivity.

  18. Smoke Detector

    NASA Technical Reports Server (NTRS)

    1979-01-01

    In the photo, Fire Chief Jay Stout of Safety Harbor, Florida, is explaining to young Richard Davis the workings of the Honeywell smoke and fire detector which probably saved Richard's life and that of his teen-age brother. Alerted by the detector's warning, the pair were able to escape their burning home. The detector in the Davis home was one of 1,500 installed in Safety Harbor residences in a cooperative program conducted by the city and Honeywell Inc.

  19. Optics Alignment Panel

    NASA Technical Reports Server (NTRS)

    Schroeder, Daniel J.

    1992-01-01

    The Optics Alignment Panel (OAP) was commissioned by the HST Science Working Group to determine the optimum alignment of the OTA optics. The goal was to find the position of the secondary mirror (SM) for which there is no coma or astigmatism in the camera images due to misaligned optics, either tilt or decenter. The despace position was reviewed of the SM and the optimum focus was sought. The results of these efforts are as follows: (1) the best estimate of the aligned position of the SM in the notation of HDOS is (DZ,DY,TZ,TY) = (+248 microns, +8 microns, +53 arcsec, -79 arcsec), and (2) the best focus, defined to be that despace which maximizes the fractional energy at 486 nm in a 0.1 arcsec radius of a stellar image, is 12.2 mm beyond paraxial focus. The data leading to these conclusions, and the estimated uncertainties in the final results, are presented.

  20. Barrel alignment fixture

    NASA Astrophysics Data System (ADS)

    Sheeley, J. D.

    1981-04-01

    Fabrication of slapper type detonator cables requires bonding of a thin barrel over a bridge. Location of the barrel hole with respect to the bridge is critical: the barrel hole must be centered over the bridge uniform spacing on each side. An alignment fixture which permits rapid adjustment of the barrel position with respect to the bridge is described. The barrel is manipulated by pincer-type fingers which are mounted on a small x-y table equipped with micrometer adjustments. Barrel positioning, performed under a binocular microscopy, is rapid and accurate. After alignment, the microscope is moved out of position and an infrared (IR) heat source is aimed at the barrel. A 5-second pulse of infrared heat flows the adhesive under the barrel and bonds it to the cable. Sapphire and Fotoform glass barrels were bonded successfully with the alignment fixture.

  1. Magnetically aligned supramolecular hydrogels.

    PubMed

    Wallace, Matthew; Cardoso, Andre Zamith; Frith, William J; Iggo, Jonathan A; Adams, Dave J

    2014-12-01

    The magnetic-field-induced alignment of the fibrillar structures present in an aqueous solution of a dipeptide gelator, and the subsequent retention of this alignment upon transformation to a hydrogel upon the addition of CaCl2 or upon a reduction in solution pH is reported. Utilising the switchable nature of the magnetic field coupled with the slow diffusion of CaCl2 , it is possible to precisely control the extent of anisotropy across a hydrogel, something that is generally very difficult to do using alternative methods. The approach is readily extended to other compounds that form viscous solutions at high pH. It is expected that this work will greatly expand the utility of such low-molecular-weight gelators (LMWG) in areas where alignment is key. PMID:25345918

  2. New Effective Multithreaded Matching Algorithms

    SciTech Connect

    Manne, Fredrik; Halappanavar, Mahantesh

    2014-05-19

    Matching is an important combinatorial problem with a number of applications in areas such as community detection, sparse linear algebra, and network alignment. Since computing optimal matchings can be very time consuming, several fast approximation algorithms, both sequential and parallel, have been suggested. Common to the algorithms giving the best solutions is that they tend to be sequential by nature, while algorithms more suitable for parallel computation give solutions of less quality. We present a new simple 1 2 -approximation algorithm for the weighted matching problem. This algorithm is both faster than any other suggested sequential 1 2 -approximation algorithm on almost all inputs and also scales better than previous multithreaded algorithms. We further extend this to a general scalable multithreaded algorithm that computes matchings of weight comparable with the best sequential algorithms. The performance of the suggested algorithms is documented through extensive experiments on different multithreaded architectures.

  3. Optical Detectors

    NASA Astrophysics Data System (ADS)

    Goushcha, Alexander; Tabbert, Bernd

    Optical detectors are applied in all fields of human activities - from basic research to commercial applications in communication, automotive, medical imaging, homeland security, and other fields. The processes of light interaction with matter described in other chapters of this handbook form the basis for understanding the optical detectors physics and device properties.

  4. Optical Detectors

    NASA Astrophysics Data System (ADS)

    Tabbert, Bernd; Goushcha, Alexander

    Optical detectors are applied in all fields of human activities from basic research to commercial applications in communication, automotive, medical imaging, homeland security, and other fields. The processes of light interaction with matter described in other chapters of this handbook form the basis for understanding the optical detectors physics and device properties.

  5. Segment alignment control system

    NASA Technical Reports Server (NTRS)

    Aubrun, JEAN-N.; Lorell, Ken R.

    1988-01-01

    The segmented primary mirror for the LDR will require a special segment alignment control system to precisely control the orientation of each of the segments so that the resulting composite reflector behaves like a monolith. The W.M. Keck Ten Meter Telescope will utilize a primary mirror made up of 36 actively controlled segments. Thus the primary mirror and its segment alignment control system are directly analogous to the LDR. The problems of controlling the segments in the face of disturbances and control/structures interaction, as analyzed for the TMT, are virtually identical to those for the LDR. The two systems are briefly compared.

  6. PILOT optical alignment

    NASA Astrophysics Data System (ADS)

    Longval, Y.; Mot, B.; Ade, P.; André, Y.; Aumont, J.; Baustista, L.; Bernard, J.-Ph.; Bray, N.; de Bernardis, P.; Boulade, O.; Bousquet, F.; Bouzit, M.; Buttice, V.; Caillat, A.; Charra, M.; Chaigneau, M.; Crane, B.; Crussaire, J.-P.; Douchin, F.; Doumayrou, E.; Dubois, J.-P.; Engel, C.; Etcheto, P.; Gélot, P.; Griffin, M.; Foenard, G.; Grabarnik, S.; Hargrave, P..; Hughes, A.; Laureijs, R.; Lepennec, Y.; Leriche, B.; Maestre, S.; Maffei, B.; Martignac, J.; Marty, C.; Marty, W.; Masi, S.; Mirc, F.; Misawa, R.; Montel, J.; Montier, L.; Narbonne, J.; Nicot, J.-M.; Pajot, F.; Parot, G.; Pérot, E.; Pimentao, J.; Pisano, G.; Ponthieu, N.; Ristorcelli, I.; Rodriguez, L.; Roudil, G.; Salatino, M.; Savini, G.; Simonella, O.; Saccoccio, M.; Tapie, P.; Tauber, J.; Torre, J.-P.; Tucker, C.

    2016-07-01

    PILOT is a balloon-borne astronomy experiment designed to study the polarization of dust emission in the diffuse interstellar medium in our Galaxy at wavelengths 240 μm with an angular resolution about two arcminutes. Pilot optics is composed an off-axis Gregorian type telescope and a refractive re-imager system. All optical elements, except the primary mirror, are in a cryostat cooled to 3K. We combined the optical, 3D dimensional measurement methods and thermo-elastic modeling to perform the optical alignment. The talk describes the system analysis, the alignment procedure, and finally the performances obtained during the first flight in September 2015.

  7. Effect of panel alignment and surface finish on bond strength

    SciTech Connect

    Wouters, J.M.; Doe, P.J.; Baker, W.E.

    1991-10-01

    The flexural strength of bonded acrylic is tested as a function of panel alignment and bond surface finish. Bond strength was shown to be highly dependent on both parameters with only a narrow range of values yielding a high strength bond. This study was performed for the heavy water-containing acrylic vessel for the Sudbury Neutrino Observatory detector.

  8. Alignment-related effects in forward proton experiments at the LHC

    NASA Astrophysics Data System (ADS)

    Staszewski, R.; Chwastowski, J.; Korcyl, K.; Trzebiński, M.

    2015-11-01

    The activity in the field of diffractive physics at the Large Hadron Collider has been constantly increasing. This includes the planning for additional dedicated apparatus - horizontal forward proton detectors. This work focuses on the problems related to the alignment of such devices. The effects of the misalignment of the detectors on their geometric acceptance and on the reconstruction of the proton kinematics are studied. The requirements for the alignment precision are inferred for different types of possible measurements.

  9. Method of "Active Correlations" for DSSSD detector application

    NASA Astrophysics Data System (ADS)

    Tsyganov, Yu. S.

    2015-01-01

    Real-time PC based algorithm is developed for DSSSD ( Double Side Silicon Strip Detector) detector. Brief description of the detection system is also presented. Complete fusion nuclear reaction nat Yt + 48 Ca → 217 Th is used to test this algorithm at 48Ca beam. Example of successful application of a former algorithm for resistive strip PIPS (resistive strip Passivated Implanted Planar Silicon) detector is presented too.

  10. Curriculum Alignment: Establishing Coherence

    ERIC Educational Resources Information Center

    Gagné, Philippe; Dumont, Laurence; Brunet, Sabine; Boucher, Geneviève

    2013-01-01

    In this paper, we present a step-by-step guide to implement a curricular alignment project, directed at professional development and student support, and developed in a higher education French as a second language department. We outline best practices and preliminary results from our experience and provide ways to adapt our experience to other…

  11. Optically Aligned Drill Press

    NASA Technical Reports Server (NTRS)

    Adderholdt, Bruce M.

    1994-01-01

    Precise drill press equipped with rotary-indexing microscope. Microscope and drill exchange places when turret rotated. Microscope axis first aligned over future hole, then rotated out of way so drill axis assumes its precise position. New procedure takes less time to locate drilling positions and produces more accurate results. Apparatus adapted to such other machine tools as milling and measuring machines.

  12. Aligning brains and minds

    PubMed Central

    Tong, Frank

    2012-01-01

    In this issue of Neuron, Haxby and colleagues describe a new method for aligning functional brain activity patterns across participants. Their study demonstrates that objects are similarly represented across different brains, allowing for reliable classification of one person’s brain activity based on another’s. PMID:22017984

  13. Aligned-or Not?

    ERIC Educational Resources Information Center

    Roseman, Jo Ellen; Koppal, Mary

    2015-01-01

    When state leaders and national partners in the development of the Next Generation Science Standards met to consider implementation strategies, states and school districts wanted to know which materials were aligned to the new standards. The answer from the developers was short but not sweet: You won't find much now, and it's going to…

  14. Gaseous Detectors

    NASA Astrophysics Data System (ADS)

    Titov, Maxim

    Since long time, the compelling scientific goals of future high-energy physics experiments were a driving factor in the development of advanced detector technologies. A true innovation in detector instrumentation concepts came in 1968, with the development of a fully parallel readout for a large array of sensing elements - the Multi-Wire Proportional Chamber (MWPC), which earned Georges Charpak a Nobel prize in physics in 1992. Since that time radiation detection and imaging with fast gaseous detectors, capable of economically covering large detection volumes with low mass budget, have been playing an important role in many fields of physics. Advances in photolithography and microprocessing techniques in the chip industry during the past decade triggered a major transition in the field of gas detectors from wire structures to Micro-Pattern Gas Detector (MPGD) concepts, revolutionizing cell-size limitations for many gas detector applications. The high radiation resistance and excellent spatial and time resolution make them an invaluable tool to confront future detector challenges at the next generation of colliders. The design of the new micro-pattern devices appears suitable for industrial production. Novel structures where MPGDs are directly coupled to the CMOS pixel readout represent an exciting field allowing timing and charge measurements as well as precise spatial information in 3D. Originally developed for the high-energy physics, MPGD applications have expanded to nuclear physics, photon detection, astroparticle and neutrino physics, neutron detection, and medical imaging.

  15. Automation of the targeting and reflective alignment concept

    NASA Technical Reports Server (NTRS)

    Redfield, Robin C.

    1992-01-01

    The automated alignment system, described herein, employs a reflective, passive (requiring no power) target and includes a PC-based imaging system and one camera mounted on a six degree of freedom robot manipulator. The system detects and corrects for manipulator misalignment in three translational and three rotational directions by employing the Targeting and Reflective Alignment Concept (TRAC), which simplifies alignment by decoupling translational and rotational alignment control. The concept uses information on the camera and the target's relative position based on video feedback from the camera. These relative positions are converted into alignment errors and minimized by motions of the robot. The system is robust to exogenous lighting by virtue of a subtraction algorithm which enables the camera to only see the target. These capabilities are realized with relatively minimal complexity and expense.

  16. Optimal molecular alignment and orientation through rotational ladder climbing

    NASA Astrophysics Data System (ADS)

    Salomon, Julien; Dion, Claude M.; Turinici, Gabriel

    2005-10-01

    We study the control by electromagnetic fields of molecular alignment and orientation in a linear, rigid-rotor model. With the help of a monotonically convergent algorithm, we find that the optimal field is in the microwave part of the spectrum and acts by resonantly exciting the rotation of the molecule progressively from the ground state, i.e., by rotational ladder climbing. This mechanism is present not only when maximizing orientation or alignment, but also when using prescribed target states that simultaneously optimize the efficiency of orientation/alignment and its duration. The extension of the optimization method to consider a finite rotational temperature is also presented.

  17. Optimal molecular alignment and orientation through rotational ladder climbing.

    PubMed

    Salomon, Julien; Dion, Claude M; Turinici, Gabriel

    2005-10-01

    We study the control by electromagnetic fields of molecular alignment and orientation in a linear, rigid-rotor model. With the help of a monotonically convergent algorithm, we find that the optimal field is in the microwave part of the spectrum and acts by resonantly exciting the rotation of the molecule progressively from the ground state, i.e., by rotational ladder climbing. This mechanism is present not only when maximizing orientation or alignment, but also when using prescribed target states that simultaneously optimize the efficiency of orientation/alignment and its duration. The extension of the optimization method to consider a finite rotational temperature is also presented. PMID:16238394

  18. Aligning transcript of historical documents using dynamic programming

    NASA Astrophysics Data System (ADS)

    Rabaev, Irina; Cohen, Rafi; El-Sana, Jihad; Kedem, Klara

    2015-01-01

    We present a simple and accurate approach for aligning historical documents with their corresponding transcription. First, a representative of each letter in the historical document is cropped. Then, the transcription is transformed to synthetic word images by representing the letters in the transcription by the cropped letters. These synthetic word images are aligned to groups of connected components in the original text, along each line, using dynamic programming. For measuring image similarities we experimented with a variety of feature extraction and matching methods. The presented alignment algorithm was tested on two historical datasets and provided excellent results.

  19. A novel approach to structural alignment using realistic structural and environmental information.

    PubMed

    Chen, Yu; Crippen, Gordon M

    2005-12-01

    In the era of structural genomics, it is necessary to generate accurate structural alignments in order to build good templates for homology modeling. Although a great number of structural alignment algorithms have been developed, most of them ignore intermolecular interactions during the alignment procedure. Therefore, structures in different oligomeric states are barely distinguishable, and it is very challenging to find correct alignment in coil regions. Here we present a novel approach to structural alignment using a clique finding algorithm and environmental information (SAUCE). In this approach, we build the alignment based on not only structural coordinate information but also realistic environmental information extracted from biological unit files provided by the Protein Data Bank (PDB). At first, we eliminate all environmentally unfavorable pairings of residues. Then we identify alignments in core regions via a maximal clique finding algorithm. Two extreme value distribution (EVD) form statistics have been developed to evaluate core region alignments. With an optional extension step, global alignment can be derived based on environment-based dynamic programming linking. We show that our method is able to differentiate three-dimensional structures in different oligomeric states, and is able to find flexible alignments between multidomain structures without predetermined hinge regions. The overall performance is also evaluated on a large scale by comparisons to current structural classification databases as well as to other alignment methods. PMID:16260755

  20. MS Detectors

    SciTech Connect

    Koppenaal, David W.; Barinaga, Charles J.; Denton, M Bonner B.; Sperline, Roger P.; Hieftje, Gary M.; Schilling, G. D.; Andrade, Francisco J.; Barnes IV., James H.

    2005-11-01

    Good eyesight is often taken for granted, a situation that everyone appreciates once vision begins to fade with age. New eyeglasses or contact lenses are traditional ways to improve vision, but recent new technology, i.e. LASIK laser eye surgery, provides a new and exciting means for marked vision restoration and improvement. In mass spectrometry, detectors are the 'eyes' of the MS instrument. These 'eyes' have also been taken for granted. New detectors and new technologies are likewise needed to correct, improve, and extend ion detection and hence, our 'chemical vision'. The purpose of this report is to review and assess current MS detector technology and to provide a glimpse towards future detector technologies. It is hoped that the report will also serve to motivate interest, prompt ideas, and inspire new visions for ion detection research.

  1. Alignement automatise de fibres optiques amorces monomodes

    NASA Astrophysics Data System (ADS)

    St-Amant, Yves

    Cette these jette les bases necessaires au developpement d'algorithmes a base de modele pour l'automatisation de l'alignement de fibres amorces monomodes. A partir de la methode de l'integrale de recouvrement et de deux solutions approximatives existantes, un modele analytique d'efficacite de couplage optique permettant d'estimer la puissance transmise entre un composant et une fibre amorce monomode est d'abord formule. Avec celui-ci, sept proprietes pouvant etre utiles au developpement d'algorithmes a base de modele sont ensuite identifiees et validees. Enfin, a l'aide de ces proprietes, une strategie d'alignement a base de modele est developpee et validee experimentalement. Les resultats obtenus demontrent clairement la repetitivite, la robustesse, la precision et la rapidite de la strategie proposee. Ils demontrent aussi qu'il est possible de realiser un alignement complet sans l'utilisation de systemes auxiliaires tels des systemes de vision, des cameras infrarouges, des capteurs de contact ou des systemes de fixation hautement precis.

  2. Aligned genomic data compression via improved modeling.

    PubMed

    Ochoa, Idoia; Hernaez, Mikel; Weissman, Tsachy

    2014-12-01

    With the release of the latest Next-Generation Sequencing (NGS) machine, the HiSeq X by Illumina, the cost of sequencing the whole genome of a human is expected to drop to a mere $1000. This milestone in sequencing history marks the era of affordable sequencing of individuals and opens the doors to personalized medicine. In accord, unprecedented volumes of genomic data will require storage for processing. There will be dire need not only of compressing aligned data, but also of generating compressed files that can be fed directly to downstream applications to facilitate the analysis of and inference on the data. Several approaches to this challenge have been proposed in the literature; however, focus thus far has been on the low coverage regime and most of the suggested compressors are not based on effective modeling of the data. We demonstrate the benefit of data modeling for compressing aligned reads. Specifically, we show that, by working with data models designed for the aligned data, we can improve considerably over the best compression ratio achieved by previously proposed algorithms. Our results indicate that the pareto-optimal barrier for compression rate and speed claimed by Bonfield and Mahoney (2013) [Bonfield JK and Mahoneys MV, Compression of FASTQ and SAM format sequencing data, PLOS ONE, 8(3):e59190, 2013.] does not apply for high coverage aligned data. Furthermore, our improved compression ratio is achieved by splitting the data in a manner conducive to operations in the compressed domain by downstream applications.

  3. Aligned genomic data compression via improved modeling.

    PubMed

    Ochoa, Idoia; Hernaez, Mikel; Weissman, Tsachy

    2014-12-01

    With the release of the latest Next-Generation Sequencing (NGS) machine, the HiSeq X by Illumina, the cost of sequencing the whole genome of a human is expected to drop to a mere $1000. This milestone in sequencing history marks the era of affordable sequencing of individuals and opens the doors to personalized medicine. In accord, unprecedented volumes of genomic data will require storage for processing. There will be dire need not only of compressing aligned data, but also of generating compressed files that can be fed directly to downstream applications to facilitate the analysis of and inference on the data. Several approaches to this challenge have been proposed in the literature; however, focus thus far has been on the low coverage regime and most of the suggested compressors are not based on effective modeling of the data. We demonstrate the benefit of data modeling for compressing aligned reads. Specifically, we show that, by working with data models designed for the aligned data, we can improve considerably over the best compression ratio achieved by previously proposed algorithms. Our results indicate that the pareto-optimal barrier for compression rate and speed claimed by Bonfield and Mahoney (2013) [Bonfield JK and Mahoneys MV, Compression of FASTQ and SAM format sequencing data, PLOS ONE, 8(3):e59190, 2013.] does not apply for high coverage aligned data. Furthermore, our improved compression ratio is achieved by splitting the data in a manner conducive to operations in the compressed domain by downstream applications. PMID:25395305

  4. Quasiparticle Level Alignment for Photocatalytic Interfaces

    SciTech Connect

    Migani, Annapaola; Mowbray, Duncan J.; Zhao, Jin; Petek, Hrvoje; Rubio, Angel

    2014-05-13

    Electronic level alignment at the interface between an adsorbed molecular layer and a semiconducting substrate determines the activity and efficiency of many photocatalytic materials. Standard density functional theory (DFT)-based methods have proven unable to provide a quantitative description of this level alignment. This requires a proper treatment of the anisotropic screening, necessitating the use of quasiparticle (QP) techniques. However, the computational complexity of QP algorithms has meant a quantitative description of interfacial levels has remained elusive. We provide a systematic study of a prototypical interface, bare and methanol-covered rutile TiO2(110) surfaces, to determine the type of many-body theory required to obtain an accurate description of the level alignment. This is accomplished via a direct comparison with metastable impact electron spectroscopy (MIES), ultraviolet photoelectron spectroscopy (UPS), and two-photon photoemission (2PP) spectroscopy. We consider GGA DFT, hybrid DFT, and G0W0, scQPGW1, scQPGW0, and scQPGW QP calculations. Our results demonstrate that G0W0, or our recently introduced scQPGW1 approach, are required to obtain the correct alignment of both the highest occupied and lowest unoccupied interfacial molecular levels (HOMO/LUMO). These calculations set a new standard in the interpretation of electronic structure probe experiments of complex organic molecule/semiconductor interfaces.

  5. Inflation by alignment

    SciTech Connect

    Burgess, C.P.; Roest, Diederik

    2015-06-08

    Pseudo-Goldstone bosons (pGBs) can provide technically natural inflatons, as has been comparatively well-explored in the simplest axion examples. Although inflationary success requires trans-Planckian decay constants, f≳M{sub p}, several mechanisms have been proposed to obtain this, relying on (mis-)alignments between potential and kinetic energies in multiple-field models. We extend these mechanisms to a broader class of inflationary models, including in particular the exponential potentials that arise for pGB potentials based on noncompact groups (and so which might apply to moduli in an extra-dimensional setting). The resulting potentials provide natural large-field inflationary models and can predict a larger primordial tensor signal than is true for simpler single-field versions of these models. In so doing we provide a unified treatment of several alignment mechanisms, showing how each emerges as a limit of the more general setup.

  6. Orbit IMU alignment: Error analysis

    NASA Technical Reports Server (NTRS)

    Corson, R. W.

    1980-01-01

    A comprehensive accuracy analysis of orbit inertial measurement unit (IMU) alignments using the shuttle star trackers was completed and the results are presented. Monte Carlo techniques were used in a computer simulation of the IMU alignment hardware and software systems to: (1) determine the expected Space Transportation System 1 Flight (STS-1) manual mode IMU alignment accuracy; (2) investigate the accuracy of alignments in later shuttle flights when the automatic mode of star acquisition may be used; and (3) verify that an analytical model previously used for estimating the alignment error is a valid model. The analysis results do not differ significantly from expectations. The standard deviation in the IMU alignment error for STS-1 alignments was determined to the 68 arc seconds per axis. This corresponds to a 99.7% probability that the magnitude of the total alignment error is less than 258 arc seconds.

  7. Nuclear reactor alignment plate configuration

    DOEpatents

    Altman, David A; Forsyth, David R; Smith, Richard E; Singleton, Norman R

    2014-01-28

    An alignment plate that is attached to a core barrel of a pressurized water reactor and fits within slots within a top plate of a lower core shroud and upper core plate to maintain lateral alignment of the reactor internals. The alignment plate is connected to the core barrel through two vertically-spaced dowel pins that extend from the outside surface of the core barrel through a reinforcement pad and into corresponding holes in the alignment plate. Additionally, threaded fasteners are inserted around the perimeter of the reinforcement pad and into the alignment plate to further secure the alignment plate to the core barrel. A fillet weld also is deposited around the perimeter of the reinforcement pad. To accomodate thermal growth between the alignment plate and the core barrel, a gap is left above, below and at both sides of one of the dowel pins in the alignment plate holes through with the dowel pins pass.

  8. Alignment reference device

    DOEpatents

    Patton, Gail Y.; Torgerson, Darrel D.

    1987-01-01

    An alignment reference device provides a collimated laser beam that minimizes angular deviations therein. A laser beam source outputs the beam into a single mode optical fiber. The output end of the optical fiber acts as a source of radiant energy and is positioned at the focal point of a lens system where the focal point is positioned within the lens. The output beam reflects off a mirror back to the lens that produces a collimated beam.

  9. Dynamic Alignment at SLS

    SciTech Connect

    Ruland, Robert E.

    2003-04-23

    The relative alignment of components in the storage ring of the Swiss Light Source (SLS) is guaranteed by mechanical means. The magnets are rigidly fixed to 48 girders by means of alignment rails with tolerances of less than {+-}15 {micro}m. The bending magnets, supported by 3 point ball bearings, overlap adjacent girders and thus establish virtual train links between the girders, located near the bending magnet centres. Keeping the distortion of the storage ring geometry within a tolerance of {+-}100 {micro}m in order to guarantee sufficient dynamic apertures, requires continuous monitoring and correction of the girder locations. Two monitoring systems for the horizontal and the vertical direction will be installed to measure displacements of the train link between girders, which are due to ground settings and temperature effects: The hydrostatic levelling system (HLS) gives an absolute vertical reference, while the horizontal positioning system (HPS), which employs low cost linear encoders with sub-micron resolution, measures relative horizontal movements. The girder mover system based on five DC motors per girder allows a dynamic realignment of the storage ring within a working window of more than {+-}1 mm for girder translations and {+-}1 mrad for rotations. We will describe both monitoring systems (HLS and HPS) as well as the applied correction scheme based on the girder movers. We also show simulations indicating that beam based girder alignment takes care of most of the static closed orbit correction.

  10. New supervised alignment method as a preprocessing tool for chromatographic data in metabolomic studies.

    PubMed

    Struck, Wiktoria; Wiczling, Paweł; Waszczuk-Jankowska, Małgorzata; Kaliszan, Roman; Markuszewski, Michał Jan

    2012-09-21

    The purpose of this work was to develop a new aligning algorithm called supervised alignment and to compare its performance with the correlation optimized warping. The supervised alignment is based on a "supervised" selection of a few common peaks presented on each chromatogram. The selected peaks are aligned based on a difference in the retention time of the selected analytes in the sample and the reference chromatogram. The retention times of the fragments between known peaks are subsequently linearly interpolated. The performance of the proposed algorithm has been tested on a series of simulated and experimental chromatograms. The simulated chromatograms comprised analytes with a systematic or random retention time shifts. The experimental chromatographic (RP-HPLC) data have been obtained during the analysis of nucleosides from 208 urine samples and consists of both the systematic and random displacements. All the data sets have been aligned using the correlation optimized warping and the supervised alignment. The time required to complete the alignment, the overall complexity of both algorithms, and its performance measured by the average correlation coefficients are compared to assess performance of tested methods. In the case of systematic shifts, both methods lead to the successful alignment. However, for random shifts, the correlation optimized warping in comparison to the supervised alignment requires more time (few hours versus few minutes) and the quality of the alignment described as correlation coefficient of the newly aligned matrix is worse 0.8593 versus 0.9629. For the experimental dataset supervised alignment successfully aligns 208 samples using 10 prior identified peaks. The knowledge about retention times of few analytes' in the data sets is necessary to perform the supervised alignment for both systematic and random shifts. The supervised alignment method is faster, more effective and simpler preprocessing method than the correlation optimized

  11. Alignment and alignment transition of bent core nematics

    NASA Astrophysics Data System (ADS)

    Elamain, Omaima; Hegde, Gurumurthy; Komitov, Lachezar

    2013-07-01

    We report on the alignment of nematics consisting of bimesogen bent core molecules of chlorine substituent of benzene derivative and their binary mixture with rod like nematics. It was found that the alignment layer made from polyimide material, which is usually used for promoting vertical (homeotropic) alignment of rod like nematics, promotes instead a planar alignment of the bent core nematic and its nematic mixtures. At higher concentration of the rod like nematic component in these mixtures, a temperature driven transition from vertical to planar alignment was found near the transition to isotropic phase.

  12. Polar cap arcs: Sun-aligned or cusp-aligned?

    NASA Astrophysics Data System (ADS)

    Zhang, Y.; Paxton, L. J.; Zhang, Qinghe; Xing, Zanyang

    2016-08-01

    Polar cap arcs are often called sun-aligned arcs. Satellite observations reveal that polar cap arcs join together at the cusp and are actually cusp aligned. Strong ionospheric plasma velocity shears, thus field aligned currents, were associated with polar arcs and they were likely caused by Kelvin-Helmholtz waves around the low-latitude magnetopause under a northward IMF Bz. The magnetic field lines around the magnetopause join together in the cusp region so are the field aligned currents and particle precipitation. This explains why polar arcs are cusp aligned.

  13. Photon detectors

    SciTech Connect

    Va`vra, J.

    1995-10-01

    J. Seguinot and T. Ypsilantis have recently described the theory and history of Ring Imaging Cherenkov (RICH) detectors. In this paper, I will expand on these excellent review papers, by covering the various photon detector designs in greater detail, and by including discussion of mistakes made, and detector problems encountered, along the way. Photon detectors are among the most difficult devices used in physics experiments, because they must achieve high efficiency for photon transport and for the detection of single photo-electrons. For gaseous devices, this requires the correct choice of gas gain in order to prevent breakdown and wire aging, together with the use of low noise electronics having the maximum possible amplification. In addition, the detector must be constructed of materials which resist corrosion due to photosensitive materials such as, the detector enclosure must be tightly sealed in order to prevent oxygen leaks, etc. The most critical step is the selection of the photocathode material. Typically, a choice must be made between a solid (CsI) or gaseous photocathode (TMAE, TEA). A conservative approach favors a gaseous photocathode, since it is continuously being replaced by flushing, and permits the photon detectors to be easily serviced (the air sensitive photocathode can be removed at any time). In addition, it can be argued that we now know how to handle TMAE, which, as is generally accepted, is the best photocathode material available as far as quantum efficiency is concerned. However, it is a very fragile molecule, and therefore its use may result in relatively fast wire aging. A possible alternative is TEA, which, in the early days, was rejected because it requires expensive CaF{sub 2} windows, which could be contaminated easily in the region of 8.3 eV and thus lose their UV transmission.

  14. Connectivity independent protein-structure alignment: a hierarchical approach

    PubMed Central

    Kolbeck, Bjoern; May, Patrick; Schmidt-Goenner, Tobias; Steinke, Thomas; Knapp, Ernst-Walter

    2006-01-01

    Background Protein-structure alignment is a fundamental tool to study protein function, evolution and model building. In the last decade several methods for structure alignment were introduced, but most of them ignore that structurally similar proteins can share the same spatial arrangement of secondary structure elements (SSE) but differ in the underlying polypeptide chain connectivity (non-sequential SSE connectivity). Results We perform protein-structure alignment using a two-level hierarchical approach implemented in the program GANGSTA. On the first level, pair contacts and relative orientations between SSEs (i.e. α-helices and β-strands) are maximized with a genetic algorithm (GA). On the second level residue pair contacts from the best SSE alignments are optimized. We have tested the method on visually optimized structure alignments of protein pairs (pairwise mode) and for database scans. For a given protein structure, our method is able to detect significant structural similarity of functionally important folds with non-sequential SSE connectivity. The performance for structure alignments with strictly sequential SSE connectivity is comparable to that of other structure alignment methods. Conclusion As demonstrated for several applications, GANGSTA finds meaningful protein-structure alignments independent of the SSE connectivity. GANGSTA is able to detect structural similarity of protein folds that are assigned to different superfamilies but nevertheless possess similar structures and perform related functions, even if these proteins differ in SSE connectivity. PMID:17118190

  15. Improving ASM stepper alignment accuracy by alignment signal intensity simulation

    NASA Astrophysics Data System (ADS)

    Li, Gerald; Pushpala, Sagar M.; Bradford, Bradley; Peng, Zezhong; Gottipati, Mohan

    1993-08-01

    As photolithography technology advances into submicron regime, the requirement for alignment accuracy also becomes much tighter. The alignment accuracy is a function of the strength of the alignment signal. Therefore, a detailed alignment signal intensity simulation for 0.8 micrometers EPROM poly-1 layer on ASM stepper was done based on the process of record in the fab to reduce misalignment and improve die yield. Oxide thickness variation did not have significant impact on the alignment signal intensity. However, poly-1 thickness was the most important parameter to affect optical alignments. The real alignment intensity data versus resist thickness on production wafers was collected and it showed good agreement with the simulated results. Similar results were obtained for ONO dielectric layer at a different fab.

  16. Pyroelectric detectors

    NASA Technical Reports Server (NTRS)

    Haller, Eugene E.; Beeman, Jeffrey; Hansen, William L.; Hubbard, G. Scott; Mcmurray, Robert E., Jr.

    1990-01-01

    The multi-agency, long-term Global Change programs, and specifically NASA's Earth Observing system, will require some new and advanced photon detector technology which must be specifically tailored for long-term stability, broad spectral range, cooling constraints, and other parameters. Whereas MCT and GaAs alloy based photovoltaic detectors and detector arrays reach most impressive results to wavelengths as long as 12 microns when cooled to below 70 K, other materials, such as ferroelectrics and pyroelectrics, appear to offer special opportunities beyond 12 microns and above 70 K. These materials have found very broad use in a wide variety of room temperature applications. Little is known about these classes of materials at sub-room temperatures and no photon detector results have been reported. From the limited information available, researchers conclude that the room temperature values of D asterisk greater than or equal to 10(exp 9) cm Hz(exp 1/2)/W may be improved by one to two orders of magnitude upon cooling to temperatures around 70 K. Improvements of up to one order of magnitude appear feasible for temperatures achievable by passive cooling. The flat detector response over a wavelength range reaching from the visible to beyond 50 microns, which is an intrinsic advantage of bolometric devices, makes for easy calibration. The fact that these materials have been developed for reduced temperature applications makes ferro- and pyroelectric materials most attractive candidates for serious exploration.

  17. Understanding Beam Alignment in a Coherent Lidar System

    NASA Technical Reports Server (NTRS)

    Prasad, Narasimha S.; Roychoudhari, Chandrasekhar

    2015-01-01

    Optical beam alignment in a coherent lidar (or ladar) receiver system plays a critical role in optimizing its performance. Optical alignment in a coherent lidar system dictates the wavefront curvature (phase front) and Poynting vector) matching of the local oscillator beam with the incoming receiver beam on a detector. However, this alignment is often not easy to achieve and is rarely perfect. Furthermore, optical fibers are being increasingly used in coherent lidar system receivers for transporting radiation to achieve architectural elegance. Single mode fibers also require stringent mode matching for efficient light coupling. The detector response characteristics vary with the misalignment of the two pointing vectors. Misalignment can lead to increase in DC current. Also, a lens in front of the detector may exasperate phase front and Poynting vector mismatch. Non-Interaction of Waves, or the NIW property indicates the light beams do not interfere by themselves in the absence of detecting dipoles. In this paper, we will analyze the extent of misalignment on the detector specifications using pointing vectors of mixing beams in light of the NIW property.

  18. Alignment of R-R interval signals using the circadian heart rate rhythm.

    PubMed

    Gayraud, Nathalie T H; Manis, George

    2015-01-01

    R-R interval signals that come from different subjects are regularly aligned and averaged according to the horological starting time of the recordings. We argue that the horological time is a faulty alignment criterion and provide evidence in the form of a new alignment method. Our main motivation is that the human heart rate (HR) rhythm follows a circadian cycle, whose pattern can vary among different classes of people. We propose two novel alignment algorithms that consider the HR circadian rhythm, the Puzzle Piece Alignment Algorithm (PPA) and the Event Based Alignment Algorithm (EBA). First, we convert the R-R interval signal into a series of time windows and compute the mean HR per window. Then our algorithms search for matching circadian patterns to align the signals. We conduct experiments using R-R interval signals extracted from two databases in the Physionet Data Bank. Both algorithms are able to align the signals with respect to the circadian rhythmicity of HR. Furthermore, our findings confirm the presence of more than one pattern in the circadian HR rhythm. We suggest an automatic classification of signals according to the three most prominent patterns. PMID:26737009

  19. Alignment of R-R interval signals using the circadian heart rate rhythm.

    PubMed

    Gayraud, Nathalie T H; Manis, George

    2015-01-01

    R-R interval signals that come from different subjects are regularly aligned and averaged according to the horological starting time of the recordings. We argue that the horological time is a faulty alignment criterion and provide evidence in the form of a new alignment method. Our main motivation is that the human heart rate (HR) rhythm follows a circadian cycle, whose pattern can vary among different classes of people. We propose two novel alignment algorithms that consider the HR circadian rhythm, the Puzzle Piece Alignment Algorithm (PPA) and the Event Based Alignment Algorithm (EBA). First, we convert the R-R interval signal into a series of time windows and compute the mean HR per window. Then our algorithms search for matching circadian patterns to align the signals. We conduct experiments using R-R interval signals extracted from two databases in the Physionet Data Bank. Both algorithms are able to align the signals with respect to the circadian rhythmicity of HR. Furthermore, our findings confirm the presence of more than one pattern in the circadian HR rhythm. We suggest an automatic classification of signals according to the three most prominent patterns.

  20. PHASE DETECTOR

    DOEpatents

    Kippenhan, D.O.

    1959-09-01

    A phase detector circuit is described for use at very high frequencies of the order of 50 megacycles. The detector circuit includes a pair of rectifiers inverted relative to each other. One voltage to be compared is applied to the two rectifiers in phase opposition and the other voltage to be compared is commonly applied to the two rectifiers. The two result:ng d-c voltages derived from the rectifiers are combined in phase opposition to produce a single d-c voltage having amplitude and polarity characteristics dependent upon the phase relation between the signals to be compared. Principal novelty resides in the employment of a half-wave transmission line to derive the phase opposing signals from the first voltage to be compared for application to the two rectifiers in place of the transformer commonly utilized for such purpose in phase detector circuits for operation at lower frequency.

  1. AVID: A global alignment program.

    PubMed

    Bray, Nick; Dubchak, Inna; Pachter, Lior

    2003-01-01

    In this paper we describe a new global alignment method called AVID. The method is designed to be fast, memory efficient, and practical for sequence alignments of large genomic regions up to megabases long. We present numerous applications of the method, ranging from the comparison of assemblies to alignment of large syntenic genomic regions and whole genome human/mouse alignments. We have also performed a quantitative comparison of AVID with other popular alignment tools. To this end, we have established a format for the representation of alignments and methods for their comparison. These formats and methods should be useful for future studies. The tools we have developed for the alignment comparisons, as well as the AVID program, are publicly available. See Web Site References section for AVID Web address and Web addresses for other programs discussed in this paper. PMID:12529311

  2. Engineering cell alignment in vitro.

    PubMed

    Li, Yuhui; Huang, Guoyou; Zhang, Xiaohui; Wang, Lin; Du, Yanan; Lu, Tian Jian; Xu, Feng

    2014-01-01

    Cell alignment plays a critical role in various cell behaviors including cytoskeleton reorganization, membrane protein relocation, nucleus gene expression, and ECM remodeling. Cell alignment is also known to exert significant effects on tissue regeneration (e.g., neuron) and modulate mechanical properties of tissues including skeleton, cardiac muscle and tendon. Therefore, it is essential to engineer cell alignment in vitro for biomechanics, cell biology, tissue engineering and regenerative medicine applications. With advances in nano- and micro-scale technologies, a variety of approaches have been developed to engineer cell alignment in vitro, including mechanical loading, topographical patterning, and surface chemical treatment. In this review, we first present alignments of various cell types and their functionality in different tissues in vivo including muscle and nerve tissues. Then, we provide an overview of recent approaches for engineering cell alignment in vitro. Finally, concluding remarks and perspectives are addressed for future improvement of engineering cell alignment.

  3. AVID: A global alignment program.

    PubMed

    Bray, Nick; Dubchak, Inna; Pachter, Lior

    2003-01-01

    In this paper we describe a new global alignment method called AVID. The method is designed to be fast, memory efficient, and practical for sequence alignments of large genomic regions up to megabases long. We present numerous applications of the method, ranging from the comparison of assemblies to alignment of large syntenic genomic regions and whole genome human/mouse alignments. We have also performed a quantitative comparison of AVID with other popular alignment tools. To this end, we have established a format for the representation of alignments and methods for their comparison. These formats and methods should be useful for future studies. The tools we have developed for the alignment comparisons, as well as the AVID program, are publicly available. See Web Site References section for AVID Web address and Web addresses for other programs discussed in this paper.

  4. Hydrogen detector

    DOEpatents

    Kanegae, Naomichi; Ikemoto, Ichiro

    1980-01-01

    A hydrogen detector of the type in which the interior of the detector is partitioned by a metal membrane into a fluid section and a vacuum section. Two units of the metal membrane are provided and vacuum pipes are provided independently in connection to the respective units of the metal membrane. One of the vacuum pipes is connected to a vacuum gauge for static equilibrium operation while the other vacuum pipe is connected to an ion pump or a set of an ion pump and a vacuum gauge both designed for dynamic equilibrium operation.

  5. Microwave detector

    DOEpatents

    Meldner, Heiner W.; Cusson, Ronald Y.; Johnson, Ray M.

    1986-01-01

    A microwave detector (10) is provided for measuring the envelope shape of a microwave pulse comprised of high-frequency oscillations. A biased ferrite (26, 28) produces a magnetization field flux that links a B-dot loop (16, 20). The magnetic field of the microwave pulse participates in the formation of the magnetization field flux. High-frequency insensitive means (18, 22) are provided for measuring electric voltage or current induced in the B-dot loop. The recorded output of the detector is proportional to the time derivative of the square of the envelope shape of the microwave pulse.

  6. Microwave detector

    DOEpatents

    Meldner, H.W.; Cusson, R.Y.; Johnson, R.M.

    1985-02-08

    A microwave detector is provided for measuring the envelope shape of a microwave pulse comprised of high-frequency oscillations. A biased ferrite produces a magnetization field flux that links a B-dot loop. The magnetic field of the microwave pulse participates in the formation of the magnetization field flux. High-frequency insensitive means are provided for measuring electric voltage or current induced in the B-dot loop. The recorded output of the detector is proportional to the time derivative of the square of the envelope shape of the microwave pulse.

  7. Silicon Detectors

    NASA Astrophysics Data System (ADS)

    Sadrozinski, Hartmut

    2014-03-01

    The use of silicon detectors has experienced an exponential growth in accelerator and space based experiments, similar to trends in the semiconductor industry as a whole, usually paraphrased as ``Moore's Law.'' Some of the essentials for this phenomenon will be presented, together with examples of the exciting science results which it enabled. With the establishment of a ``semiconductor culture'' in universities and laboratories around the world, an increased understanding of the sensors results in thinner, faster, more radiation-resistant detectors, spawning an amazing wealth of new technologies and applications, which will be the main subject of the presentation.

  8. Microwave detector

    SciTech Connect

    Meldner, H.W.; Cusson, R.Y.; Johnson, R.M.

    1986-12-02

    A detector is described for measuring the envelope shape of a microwave pulse comprised of high-frequency oscillations, the detector comprising: a B-dot loop linking the magnetic field of the microwave pulse; a biased ferrite, that produces a magnetization field flux that links the B-dot loop. The ferrite is positioned within the B-dot loop so that the magnetic field of the microwave pulse interacts with the ferrite and thereby participates in the formation of the magnetization field flux; and high-frequency insensitive means for measuring electric voltage or current induced in the B-dot loop.

  9. TSGC and JSC Alignment

    NASA Technical Reports Server (NTRS)

    Sanchez, Humberto

    2013-01-01

    NASA and the SGCs are, by design, intended to work closely together and have synergistic Vision, Mission, and Goals. The TSGC affiliates and JSC have been working together, but not always in a concise, coordinated, nor strategic manner. Today we have a couple of simple ideas to present about how TSGC and JSC have started to work together in a more concise, coordinated, and strategic manner, and how JSC and non-TSG Jurisdiction members have started to collaborate: Idea I: TSGC and JSC Technical Alignment Idea II: Concept of Clusters.

  10. CELT optics Alignment Procedure

    NASA Astrophysics Data System (ADS)

    Mast, Terry S.; Nelson, Jerry E.; Chanan, Gary A.; Noethe, Lothar

    2003-01-01

    The California Extremely Large Telescope (CELT) is a project to build a 30-meter diameter telescope for research in astronomy at visible and infrared wavelengths. The current optical design calls for a primary, secondary, and tertiary mirror with Ritchey-Chretién foci at two Nasmyth platforms. The primary mirror is a mosaic of 1080 actively-stabilized hexagonal segments. This paper summarizes a CELT report that describes a step-by-step procedure for aligning the many degrees of freedom of the CELT optics.

  11. Long Read Alignment with Parallel MapReduce Cloud Platform

    PubMed Central

    Al-Absi, Ahmed Abdulhakim; Kang, Dae-Ki

    2015-01-01

    Genomic sequence alignment is an important technique to decode genome sequences in bioinformatics. Next-Generation Sequencing technologies produce genomic data of longer reads. Cloud platforms are adopted to address the problems arising from storage and analysis of large genomic data. Existing genes sequencing tools for cloud platforms predominantly consider short read gene sequences and adopt the Hadoop MapReduce framework for computation. However, serial execution of map and reduce phases is a problem in such systems. Therefore, in this paper, we introduce Burrows-Wheeler Aligner's Smith-Waterman Alignment on Parallel MapReduce (BWASW-PMR) cloud platform for long sequence alignment. The proposed cloud platform adopts a widely accepted and accurate BWA-SW algorithm for long sequence alignment. A custom MapReduce platform is developed to overcome the drawbacks of the Hadoop framework. A parallel execution strategy of the MapReduce phases and optimization of Smith-Waterman algorithm are considered. Performance evaluation results exhibit an average speed-up of 6.7 considering BWASW-PMR compared with the state-of-the-art Bwasw-Cloud. An average reduction of 30% in the map phase makespan is reported across all experiments comparing BWASW-PMR with Bwasw-Cloud. Optimization of Smith-Waterman results in reducing the execution time by 91.8%. The experimental study proves the efficiency of BWASW-PMR for aligning long genomic sequences on cloud platforms. PMID:26839887

  12. Long Read Alignment with Parallel MapReduce Cloud Platform.

    PubMed

    Al-Absi, Ahmed Abdulhakim; Kang, Dae-Ki

    2015-01-01

    Genomic sequence alignment is an important technique to decode genome sequences in bioinformatics. Next-Generation Sequencing technologies produce genomic data of longer reads. Cloud platforms are adopted to address the problems arising from storage and analysis of large genomic data. Existing genes sequencing tools for cloud platforms predominantly consider short read gene sequences and adopt the Hadoop MapReduce framework for computation. However, serial execution of map and reduce phases is a problem in such systems. Therefore, in this paper, we introduce Burrows-Wheeler Aligner's Smith-Waterman Alignment on Parallel MapReduce (BWASW-PMR) cloud platform for long sequence alignment. The proposed cloud platform adopts a widely accepted and accurate BWA-SW algorithm for long sequence alignment. A custom MapReduce platform is developed to overcome the drawbacks of the Hadoop framework. A parallel execution strategy of the MapReduce phases and optimization of Smith-Waterman algorithm are considered. Performance evaluation results exhibit an average speed-up of 6.7 considering BWASW-PMR compared with the state-of-the-art Bwasw-Cloud. An average reduction of 30% in the map phase makespan is reported across all experiments comparing BWASW-PMR with Bwasw-Cloud. Optimization of Smith-Waterman results in reducing the execution time by 91.8%. The experimental study proves the efficiency of BWASW-PMR for aligning long genomic sequences on cloud platforms.

  13. Long Read Alignment with Parallel MapReduce Cloud Platform.

    PubMed

    Al-Absi, Ahmed Abdulhakim; Kang, Dae-Ki

    2015-01-01

    Genomic sequence alignment is an important technique to decode genome sequences in bioinformatics. Next-Generation Sequencing technologies produce genomic data of longer reads. Cloud platforms are adopted to address the problems arising from storage and analysis of large genomic data. Existing genes sequencing tools for cloud platforms predominantly consider short read gene sequences and adopt the Hadoop MapReduce framework for computation. However, serial execution of map and reduce phases is a problem in such systems. Therefore, in this paper, we introduce Burrows-Wheeler Aligner's Smith-Waterman Alignment on Parallel MapReduce (BWASW-PMR) cloud platform for long sequence alignment. The proposed cloud platform adopts a widely accepted and accurate BWA-SW algorithm for long sequence alignment. A custom MapReduce platform is developed to overcome the drawbacks of the Hadoop framework. A parallel execution strategy of the MapReduce phases and optimization of Smith-Waterman algorithm are considered. Performance evaluation results exhibit an average speed-up of 6.7 considering BWASW-PMR compared with the state-of-the-art Bwasw-Cloud. An average reduction of 30% in the map phase makespan is reported across all experiments comparing BWASW-PMR with Bwasw-Cloud. Optimization of Smith-Waterman results in reducing the execution time by 91.8%. The experimental study proves the efficiency of BWASW-PMR for aligning long genomic sequences on cloud platforms. PMID:26839887

  14. An Improved Method for Completely Uncertain Biological Network Alignment

    PubMed Central

    Shen, Bin; Zhao, Muwei; Zhong, Wei; He, Jieyue

    2015-01-01

    With the continuous development of biological experiment technology, more and more data related to uncertain biological networks needs to be analyzed. However, most of current alignment methods are designed for the deterministic biological network. Only a few can solve the probabilistic network alignment problem. However, these approaches only use the part of probabilistic data in the original networks allowing only one of the two networks to be probabilistic. To overcome the weakness of current approaches, an improved method called completely probabilistic biological network comparison alignment (C_PBNA) is proposed in this paper. This new method is designed for complete probabilistic biological network alignment based on probabilistic biological network alignment (PBNA) in order to take full advantage of the uncertain information of biological network. The degree of consistency (agreement) indicates that C_PBNA can find the results neglected by PBNA algorithm. Furthermore, the GO consistency (GOC) and global network alignment score (GNAS) have been selected as evaluation criteria, and all of them proved that C_PBNA can obtain more biologically significant results than those of PBNA algorithm. PMID:26000284

  15. Determination of calibration parameters of a VRX CT system using an "Amoeba" algorithm.

    PubMed

    Jordan, Lawrence M; Dibianca, Frank A; Melnyk, Roman; Choudhary, Apoorva; Shukla, Hemant; Laughter, Joseph; Gaber, M Waleed

    2004-01-01

    Efforts to improve the spatial resolution of CT scanners have focused mainly on reducing the source and detector element sizes, ignoring losses from the size of the secondary-ionization charge "clouds" created by the detected x-ray photons, i.e., the "physics limit." This paper focuses on implementing a technique called "projective compression." which allows further reduction in effective cell size while overcoming the physics limit as well. Projective compression signifies detector geometries in which the apparent cell size is smaller than the physical cell size, allowing large resolution boosts. A realization of this technique has been developed with a dual-arm "variable-resolution x-ray" (VRX) detector. Accurate values of the geometrical parameters are needed to convert VRX outputs to formats ready for optimal image reconstruction by standard CT techniques. The required calibrating data are obtained by scanning a rotating pin and fitting a theoretical parametric curve (using a multi-parameter minimization algorithm) to the resulting pin sinogram. Excellent fits are obtained for both detector-arm sections with an average (maximum) fit deviation of ~0.05 (0.1) detector cell width. Fit convergence and sensitivity to starting conditions are considered. Pre- and post-optimization reconstructions of the alignment pin and a biological subject reconstruction after calibration are shown.

  16. Solar sensor subsystems alignment check using solar scans for the Halogen Occultation Experiment

    NASA Technical Reports Server (NTRS)

    Jurczyk, S. G.; Moore, A. S.

    1989-01-01

    The alignment of a dual-axes sun sensor subsystem to a telescope having a multiple sensor subsystem is described. The sun sensor consists of two analog and one digital silicon detectors. The analog detectors are shadow mask type operating in the visible spectrum. The detectors are mounted for azimuth and elevation positioning of biaxial gimbals. The digital detector is a linear diode array that operates at a spectral position of 0.7 micron and is used for elevation positioning. The position signals correspond to relative angles between the sun sensor and the solar disk. These three detectors are aligned on an Invar structure which is mounted to a Cassegrain telescope. This telescope relays solar radiance to an eight channel detector subsystem operating in the infrared range from 2 to 10 microns. The test technique and results to check the boresight alignment of these two subsystems by scanning the solar disk will be reported. The boresight alignment for both the azimuth and elevation axes of the two detector subsystems is verified using this technique.

  17. Vertex detectors

    SciTech Connect

    Lueth, V.

    1992-07-01

    The purpose of a vertex detector is to measure position and angles of charged particle tracks to sufficient precision so as to be able to separate tracks originating from decay vertices from those produced at the interaction vertex. Such measurements are interesting because they permit the detection of weakly decaying particles with lifetimes down to 10{sup {minus}13} s, among them the {tau} lepton and charm and beauty hadrons. These two lectures are intended to introduce the reader to the different techniques for the detection of secondary vertices that have been developed over the past decades. The first lecture includes a brief introduction to the methods used to detect secondary vertices and to estimate particle lifetimes. It describes the traditional technologies, based on photographic recording in emulsions and on film of bubble chambers, and introduces fast electronic registration of signals derived from scintillating fibers, drift chambers and gaseous micro-strip chambers. The second lecture is devoted to solid state detectors. It begins with a brief introduction into semiconductor devices, and then describes the application of large arrays of strip and pixel diodes for charged particle tracking. These lectures can only serve as an introduction the topic of vertex detectors. Time and space do not allow for an in-depth coverage of many of the interesting aspects of vertex detector design and operation.

  18. Overcoming low-alignment signal contrast induced alignment failure by alignment signal enhancement

    NASA Astrophysics Data System (ADS)

    Lee, Byeong Soo; Kim, Young Ha; Hwang, Hyunwoo; Lee, Jeongjin; Kong, Jeong Heung; Kang, Young Seog; Paarhuis, Bart; Kok, Haico; de Graaf, Roelof; Weichselbaum, Stefan; Droste, Richard; Mason, Christopher; Aarts, Igor; de Boeij, Wim P.

    2016-03-01

    Overlay is one of the key factors which enables optical lithography extension to 1X node DRAM manufacturing. It is natural that accurate wafer alignment is a prerequisite for good device overlay. However, alignment failures or misalignments are commonly observed in a fab. There are many factors which could induce alignment problems. Low alignment signal contrast is one of the main issues. Alignment signal contrast can be degraded by opaque stack materials or by alignment mark degradation due to processes like CMP. This issue can be compounded by mark sub-segmentation from design rules in combination with double or quadruple spacer process. Alignment signal contrast can be improved by applying new material or process optimization, which sometimes lead to the addition of another process-step with higher costs. If we can amplify the signal components containing the position information and reduce other unwanted signal and background contributions then we can improve alignment performance without process change. In this paper we use ASML's new alignment sensor (as was introduced and released on the NXT:1980Di) and sample wafers with special stacks which can induce poor alignment signal to demonstrate alignment and overlay improvement.

  19. Simulator for beam-based LHC collimator alignment

    NASA Astrophysics Data System (ADS)

    Valentino, Gianluca; Aßmann, Ralph; Redaelli, Stefano; Sammut, Nicholas

    2014-02-01

    In the CERN Large Hadron Collider, collimators need to be set up to form a multistage hierarchy to ensure efficient multiturn cleaning of halo particles. Automatic algorithms were introduced during the first run to reduce the beam time required for beam-based setup, improve the alignment accuracy, and reduce the risk of human errors. Simulating the alignment procedure would allow for off-line tests of alignment policies and algorithms. A simulator was developed based on a diffusion beam model to generate the characteristic beam loss signal spike and decay produced when a collimator jaw touches the beam, which is observed in a beam loss monitor (BLM). Empirical models derived from the available measurement data are used to simulate the steady-state beam loss and crosstalk between multiple BLMs. The simulator design is presented, together with simulation results and comparison to measurement data.

  20. Alignment of cryo-EM movies of individual particles by optimization of image translations.

    PubMed

    Rubinstein, John L; Brubaker, Marcus A

    2015-11-01

    Direct detector device (DDD) cameras have revolutionized single particle electron cryomicroscopy (cryo-EM). In addition to an improved camera detective quantum efficiency, acquisition of DDD movies allows for correction of movement of the specimen, due to both instabilities in the microscope specimen stage and electron beam-induced movement. Unlike specimen stage drift, beam-induced movement is not always homogeneous within an image. Local correlation in the trajectories of nearby particles suggests that beam-induced motion is due to deformation of the ice layer. Algorithms have already been described that can correct movement for large regions of frames and for >1 MDa protein particles. Another algorithm allows individual <1 MDa protein particle trajectories to be estimated, but requires rolling averages to be calculated from frames and fits linear trajectories for particles. Here we describe an algorithm that allows for individual <1 MDa particle images to be aligned without frame averaging or linear trajectories. The algorithm maximizes the overall correlation of the shifted frames with the sum of the shifted frames. The optimum in this single objective function is found efficiently by making use of analytically calculated derivatives of the function. To smooth estimates of particle trajectories, rapid changes in particle positions between frames are penalized in the objective function and weighted averaging of nearby trajectories ensures local correlation in trajectories. This individual particle motion correction, in combination with weighting of Fourier components to account for increasing radiation damage in later frames, can be used to improve 3-D maps from single particle cryo-EM. PMID:26296328

  1. Plastic neutron detectors.

    SciTech Connect

    Wilson, Tiffany M.S; King, Michael J.; Doty, F. Patrick

    2008-12-01

    This work demonstrated the feasibility and limitations of semiconducting {pi}-conjugated organic polymers for fast neutron detection via n-p elastic scattering. Charge collection in conjugated polymers in the family of substituted poly(p-phenylene vinylene)s (PPV) was evaluated using band-edge laser and proton beam ionization. These semiconducting materials can have high H/C ratio, wide bandgap, high resistivity and high dielectric strength, allowing high field operation with low leakage current and capacitance noise. The materials can also be solution cast, allowing possible low-cost radiation detector fabrication and scale-up. However, improvements in charge collection efficiency are necessary in order to achieve single particle detection with a reasonable sensitivity. The work examined processing variables, additives and environmental effects. Proton beam exposure was used to verify particle sensitivity and radiation hardness to a total exposure of approximately 1 MRAD. Conductivity exhibited sensitivity to temperature and humidity. The effects of molecular ordering were investigated in stretched films, and FTIR was used to quantify the order in films using the Hermans orientation function. The photoconductive response approximately doubled for stretch-aligned films with the stretch direction parallel to the electric field direction, when compared to as-cast films. The response was decreased when the stretch direction was orthogonal to the electric field. Stretch-aligned films also exhibited a significant sensitivity to the polarization of the laser excitation, whereas drop-cast films showed none, indicating improved mobility along the backbone, but poor {pi}-overlap in the orthogonal direction. Drop-cast composites of PPV with substituted fullerenes showed approximately a two order of magnitude increase in photoresponse, nearly independent of nanoparticle concentration. Interestingly, stretch-aligned composite films showed a substantial decrease in

  2. Alignment test results of the JWST Pathfinder Telescope mirrors in the cryogenic environment

    NASA Astrophysics Data System (ADS)

    Whitman, Tony L.; Wells, Conrad; Hadaway, James B.; Knight, J. Scott; Lunt, Sharon

    2016-07-01

    After integration of the Optical Telescope Element (OTE) to the Integrated Science Instrument Module (ISIM) to become the OTIS, the James Webb Space Telescope OTIS is tested at NASA's Johnson Space Center (JSC) in the cryogenic vacuum Chamber A for alignment and optical performance. The alignment of the mirrors comprises a sequence of steps as follows: The mirrors are coarsely aligned using photogrammetry cameras with reflective targets attached to the sides of the mirrors. Then a multi-wavelength interferometer is aligned to the 18-segment primary mirror using cameras at the center of curvature to align reflected light from the segments and using fiducials at the edge of the primary mirror. Once the interferometer is aligned, the 18 primary mirror segments are then adjusted to optimize wavefront error of the aggregate mirror. This process phases the piston and tilt positions of all the mirror segments. An optical fiber placed at the Cassegrain focus of the telescope then emits light towards the secondary mirror to create a collimated beam emitting from the primary mirror. Portions of the collimated beam are retro-reflected from flat mirrors at the top of the chamber to pass through the telescope to the Science Instrument (SI) detector. The image on the detector is used for fine alignment of the secondary mirror and a check of the primary mirror alignment using many of the same analysis techniques used in the on-orbit alignment. The entire process was practiced and evaluated in 2015 at cryogenic temperature with the Pathfinder telescope.

  3. Alignment Test Results of the JWST Pathfinder Telescope Mirrors in the Cryogenic Environment

    NASA Technical Reports Server (NTRS)

    Whitman, Tony L.; Wells, Conrad; Hadaway, James; Knight, J. Scott; Lunt, Sharon

    2016-01-01

    After integration of the Optical Telescope Element (OTE) to the Integrated Science Instrument Module (ISIM) to become the OTIS, the James Webb Space Telescope OTIS is tested at NASAs Johnson Space Center (JSC) in the cryogenic vacuum Chamber A for alignment and optical performance. The alignment of the mirrors comprises a sequence of steps as follows: The mirrors are coarsely aligned using photogrammetry cameras with reflective targets attached to the sides of the mirrors. Then a multi-wavelength interferometer is aligned to the 18-segment primary mirror using cameras at the center of curvature to align reflected light from the segments and using fiducials at the edge of the primary mirror. Once the interferometer is aligned, the 18 primary mirror segments are then adjusted to optimize wavefront error of the aggregate mirror. This process phases the piston and tilt positions of all the mirror segments. An optical fiber placed at the Cassegrain focus of the telescope then emits light towards the secondary mirror to create a collimated beam emitting from the primary mirror. Portions of the collimated beam are retro-reflected from flat mirrors at the top of the chamber to pass through the telescope to the SI detector. The image on the detector is used for fine alignment of the secondary mirror and a check of the primary mirror alignment using many of the same analysis techniques used in the on-orbit alignment. The entire process was practiced and evaluated in 2015 at cryogenic temperature with the Pathfinder telescope.

  4. Detection of Extensive Cosmic Air Showers by Small Scintillation Detectors with Wavelength-Shifting Fibres

    ERIC Educational Resources Information Center

    Aiola, Salvatore; La Rocca, Paola; Riggi, Francesco; Riggi, Simone

    2012-01-01

    A set of three small scintillation detectors was employed to measure correlated events due to the passage of cosmic muons originating from extensive air showers. The coincidence rate between (any) two detectors was extracted as a function of their relative distance. The difference between the arrival times in three non-aligned detectors was used…

  5. Local alignment of two-base encoded DNA sequence

    PubMed Central

    Homer, Nils; Merriman, Barry; Nelson, Stanley F

    2009-01-01

    Background DNA sequence comparison is based on optimal local alignment of two sequences using a similarity score. However, some new DNA sequencing technologies do not directly measure the base sequence, but rather an encoded form, such as the two-base encoding considered here. In order to compare such data to a reference sequence, the data must be decoded into sequence. The decoding is deterministic, but the possibility of measurement errors requires searching among all possible error modes and resulting alignments to achieve an optimal balance of fewer errors versus greater sequence similarity. Results We present an extension of the standard dynamic programming method for local alignment, which simultaneously decodes the data and performs the alignment, maximizing a similarity score based on a weighted combination of errors and edits, and allowing an affine gap penalty. We also present simulations that demonstrate the performance characteristics of our two base encoded alignment method and contrast those with standard DNA sequence alignment under the same conditions. Conclusion The new local alignment algorithm for two-base encoded data has substantial power to properly detect and correct measurement errors while identifying underlying sequence variants, and facilitating genome re-sequencing efforts based on this form of sequence data. PMID:19508732

  6. Nova laser alignment control system

    SciTech Connect

    Van Arsdall, P.J.; Holloway, F.W.; McGuigan, D.L.; Shelton, R.T.

    1984-03-29

    Alignment of the Nova laser requires control of hundreds of optical components in the ten beam paths. Extensive application of computer technology makes daily alignment practical. The control system is designed in a manner which provides both centralized and local manual operator controls integrated with automatic closed loop alignment. Menudriven operator consoles using high resolution color graphics displays overlaid with transport touch panels allow laser personnel to interact efficiently with the computer system. Automatic alignment is accomplished by using image analysis techniques to determine beam references points from video images acquired along the laser chain. A major goal of the design is to contribute substantially to rapid experimental turnaround and consistent alignment results. This paper describes the computer-based control structure and the software methods developed for aligning this large laser system.

  7. Dust alignment in astrophysical environments

    NASA Astrophysics Data System (ADS)

    Lazarian, Alex; Thiem Hoang, Chi

    Dust is known to be aligned in interstellar medium and the arising polarization is extensively used to trace magnetic fields. What process aligns dust grains was one of the most long-standing problems of astrophysics in spite of the persistent efforts to solve it. For years the Davis-Greenstein paramagnetic alignment was the primary candidate for explaining grain alignment. However, the situation is different now and the most promising mechanism is associated with radiative torques (RATs) acting on irregular grains. I shall present the analytical theory of RAT alignment, discuss the observational tests that support this theory. I shall also discuss in what situations we expect to see the dominance of paramagnetic alignment.

  8. Nuclear reactor internals alignment configuration

    DOEpatents

    Gilmore, Charles B.; Singleton, Norman R.

    2009-11-10

    An alignment system that employs jacking block assemblies and alignment posts around the periphery of the top plate of a nuclear reactor lower internals core shroud to align an upper core plate with the lower internals and the core shroud with the core barrel. The distal ends of the alignment posts are chamfered and are closely received within notches machined in the upper core plate at spaced locations around the outer circumference of the upper core plate. The jacking block assemblies are used to center the core shroud in the core barrel and the alignment posts assure the proper orientation of the upper core plate. The alignment posts may alternately be formed in the upper core plate and the notches may be formed in top plate.

  9. Onorbit IMU alignment error budget

    NASA Technical Reports Server (NTRS)

    Corson, R. W.

    1980-01-01

    The Star Tracker, Crew Optical Alignment Sight (COAS), and Inertial Measurement Unit (IMU) from a complex navigation system with a multitude of error sources were combined. A complete list of the system errors is presented. The errors were combined in a rational way to yield an estimate of the IMU alignment accuracy for STS-1. The expected standard deviation in the IMU alignment error for STS-1 type alignments was determined to be 72 arc seconds per axis for star tracker alignments and 188 arc seconds per axis for COAS alignments. These estimates are based on current knowledge of the star tracker, COAS, IMU, and navigation base error specifications, and were partially verified by preliminary Monte Carlo analysis.

  10. Partial face recognition: alignment-free approach.

    PubMed

    Liao, Shengcai; Jain, Anil K; Li, Stan Z

    2013-05-01

    Numerous methods have been developed for holistic face recognition with impressive performance. However, few studies have tackled how to recognize an arbitrary patch of a face image. Partial faces frequently appear in unconstrained scenarios, with images captured by surveillance cameras or handheld devices (e.g., mobile phones) in particular. In this paper, we propose a general partial face recognition approach that does not require face alignment by eye coordinates or any other fiducial points. We develop an alignment-free face representation method based on Multi-Keypoint Descriptors (MKD), where the descriptor size of a face is determined by the actual content of the image. In this way, any probe face image, holistic or partial, can be sparsely represented by a large dictionary of gallery descriptors. A new keypoint descriptor called Gabor Ternary Pattern (GTP) is also developed for robust and discriminative face recognition. Experimental results are reported on four public domain face databases (FRGCv2.0, AR, LFW, and PubFig) under both the open-set identification and verification scenarios. Comparisons with two leading commercial face recognition SDKs (PittPatt and FaceVACS) and two baseline algorithms (PCA+LDA and LBP) show that the proposed method, overall, is superior in recognizing both holistic and partial faces without requiring alignment.

  11. Short read alignment with populations of genomes

    PubMed Central

    Huang, Lin; Popic, Victoria; Batzoglou, Serafim

    2013-01-01

    Summary: The increasing availability of high-throughput sequencing technologies has led to thousands of human genomes having been sequenced in the past years. Efforts such as the 1000 Genomes Project further add to the availability of human genome variation data. However, to date, there is no method that can map reads of a newly sequenced human genome to a large collection of genomes. Instead, methods rely on aligning reads to a single reference genome. This leads to inherent biases and lower accuracy. To tackle this problem, a new alignment tool BWBBLE is introduced in this article. We (i) introduce a new compressed representation of a collection of genomes, which explicitly tackles the genomic variation observed at every position, and (ii) design a new alignment algorithm based on the Burrows–Wheeler transform that maps short reads from a newly sequenced genome to an arbitrary collection of two or more (up to millions of) genomes with high accuracy and no inherent bias to one specific genome. Availability: http://viq854.github.com/bwbble. Contact: serafim@cs.stanford.edu PMID:23813006

  12. Partial face recognition: alignment-free approach.

    PubMed

    Liao, Shengcai; Jain, Anil K; Li, Stan Z

    2013-05-01

    Numerous methods have been developed for holistic face recognition with impressive performance. However, few studies have tackled how to recognize an arbitrary patch of a face image. Partial faces frequently appear in unconstrained scenarios, with images captured by surveillance cameras or handheld devices (e.g., mobile phones) in particular. In this paper, we propose a general partial face recognition approach that does not require face alignment by eye coordinates or any other fiducial points. We develop an alignment-free face representation method based on Multi-Keypoint Descriptors (MKD), where the descriptor size of a face is determined by the actual content of the image. In this way, any probe face image, holistic or partial, can be sparsely represented by a large dictionary of gallery descriptors. A new keypoint descriptor called Gabor Ternary Pattern (GTP) is also developed for robust and discriminative face recognition. Experimental results are reported on four public domain face databases (FRGCv2.0, AR, LFW, and PubFig) under both the open-set identification and verification scenarios. Comparisons with two leading commercial face recognition SDKs (PittPatt and FaceVACS) and two baseline algorithms (PCA+LDA and LBP) show that the proposed method, overall, is superior in recognizing both holistic and partial faces without requiring alignment. PMID:23520259

  13. [Alignment of malpositioned canines].

    PubMed

    Wagner, L

    1991-03-01

    This article presents a system for aligning impacted canines. The base of this system is the lingual arch, a rigid reaction unit of four teeth, molars and premolars. From this base unit an impacted canine can be extruded, moved distally, jumped over the occlusion and derotated by segment arches, coil springs and elastic ligatures. The efficiency of this appliance is due to the elimination of undesired reactive forces, the safe moving of teeth, the possibility of an exact force application and the simple manipulation; also the esthetic inconvenience is minimal. All this results in a better prognosis and an essentially shorter treatment time. This appliance can be used in the upper and the lower jaw. Schematic drawings and clinical examples demonstrate this method.

  14. Lunar Alignments - Identification and Analysis

    NASA Astrophysics Data System (ADS)

    González-García, A. César

    Lunar alignments are difficult to establish given the apparent lack of written accounts clearly pointing toward lunar alignments for individual temples. While some individual cases are reviewed and highlighted, the weight of the proof must fall on statistical sampling. Some definitions for the lunar alignments are provided in order to clarify the targets, and thus, some new tools are provided to try to test the lunar hypothesis in several cases, especially in megalithic astronomy.

  15. Analysis of metal/film and novel metal/amorphous selenium portal detectors

    NASA Astrophysics Data System (ADS)

    Falco, Tony

    Measurements of modulation transfer function (MTF), noise power spectrum (NPS), and detective quantum efficiency (DQE) for metal/film portal detectors are reported for the Cobalt-60 and 10 MV spectra. The detectors consist of a double-emulsion portal film secured between plates of aluminum, copper, brass or lead with thicknesses from 0 to 4.81 mm. The study of MTF, NPS, and DQE shows that both photons and secondary electrons produced within the front-plate and backscattered electrons from the back- plate affect metal/film portal imaging. Study of DQE indicates that the best portal detectors are those without back-plates, and with high density front-plates with thicknesses less than the maximum electron range. This MTF data was modeled with the logit analysis. It is shown that the parameters resulting from the logit analysis depend on the mass thickness and the atomic number of the metal plates. Metal/amorphous selenium (a-Se) electrostatic-based detectors have been developed for portal imaging. The detectors consist of a-Se photoconductive layers of varied thicknesses deposited on plates of varying thicknesses of aluminum, copper, and stainless steel. The metal-plates of the detectors face the incident 6 MV and Co-60 photon spectra during imaging. The sensitivity of the a-Se detectors to dose, electric field across the a- Se layer, plate type, and a-Se thickness is studied. A model showing a cubic relationship between the a-Se latent surface voltage and dose is derived and experimentally verified. A contrast-detail phantom is used to study the image quality and contrast-resolution characteristics of the metal/a-Se detectors. The metal/a- Se detectors produce better quality contrast-detailed images at a considerably lower dose than that offered by the other commercial available portal systems, mainly due to the low inherent noise of the novel detectors. A semi-automatic technique for the direct set-up alignment of radiosurgical circular fields from an isocentric

  16. Expected Performance of the ATLAS Experiment - Detector, Trigger and Physics

    SciTech Connect

    Aad, G.; Abat, E.; Abbott, B.; Abdallah, J.; Abdelalim, A.A.; Abdesselam, A.; Abdinov, O.; Abi, B.; Abolins, M.; Abramowicz, H.; Acharya, Bobby Samir; Adams, D.L.; Addy, T.N.; Adorisio, C.; Adragna, P.; Adye, T.; Aguilar-Saavedra, J.A.; Aharrouche, M.; Ahlen, S.P.; Ahles, F.; Ahmad, A.; /SUNY, Albany /Alberta U. /Ankara U. /Annecy, LAPP /Argonne /Arizona U. /Texas U., Arlington /Athens U. /Natl. Tech. U., Athens /Baku, Inst. Phys. /Barcelona, IFAE /Belgrade U. /VINCA Inst. Nucl. Sci., Belgrade /Bergen U. /LBL, Berkeley /Humboldt U., Berlin /Bern U., LHEP /Birmingham U. /Bogazici U. /INFN, Bologna /Bologna U.

    2011-11-28

    The Large Hadron Collider (LHC) at CERN promises a major step forward in the understanding of the fundamental nature of matter. The ATLAS experiment is a general-purpose detector for the LHC, whose design was guided by the need to accommodate the wide spectrum of possible physics signatures. The major remit of the ATLAS experiment is the exploration of the TeV mass scale where groundbreaking discoveries are expected. In the focus are the investigation of the electroweak symmetry breaking and linked to this the search for the Higgs boson as well as the search for Physics beyond the Standard Model. In this report a detailed examination of the expected performance of the ATLAS detector is provided, with a major aim being to investigate the experimental sensitivity to a wide range of measurements and potential observations of new physical processes. An earlier summary of the expected capabilities of ATLAS was compiled in 1999 [1]. A survey of physics capabilities of the CMS detector was published in [2]. The design of the ATLAS detector has now been finalised, and its construction and installation have been completed [3]. An extensive test-beam programme was undertaken. Furthermore, the simulation and reconstruction software code and frameworks have been completely rewritten. Revisions incorporated reflect improved detector modelling as well as major technical changes to the software technology. Greatly improved understanding of calibration and alignment techniques, and their practical impact on performance, is now in place. The studies reported here are based on full simulations of the ATLAS detector response. A variety of event generators were employed. The simulation and reconstruction of these large event samples thus provided an important operational test of the new ATLAS software system. In addition, the processing was distributed world-wide over the ATLAS Grid facilities and hence provided an important test of the ATLAS computing system - this is the origin of

  17. Neutron detector

    DOEpatents

    Stephan, Andrew C.; Jardret; Vincent D.

    2011-04-05

    A neutron detector has a volume of neutron moderating material and a plurality of individual neutron sensing elements dispersed at selected locations throughout the moderator, and particularly arranged so that some of the detecting elements are closer to the surface of the moderator assembly and others are more deeply embedded. The arrangement captures some thermalized neutrons that might otherwise be scattered away from a single, centrally located detector element. Different geometrical arrangements may be used while preserving its fundamental characteristics. Different types of neutron sensing elements may be used, which may operate on any of a number of physical principles to perform the function of sensing a neutron, either by a capture or a scattering reaction, and converting that reaction to a detectable signal. High detection efficiency, an ability to acquire spectral information, and directional sensitivity may be obtained.

  18. Neutron detector

    SciTech Connect

    Stephan, Andrew C; Jardret, Vincent D

    2009-04-07

    A neutron detector has a volume of neutron moderating material and a plurality of individual neutron sensing elements dispersed at selected locations throughout the moderator, and particularly arranged so that some of the detecting elements are closer to the surface of the moderator assembly and others are more deeply embedded. The arrangement captures some thermalized neutrons that might otherwise be scattered away from a single, centrally located detector element. Different geometrical arrangements may be used while preserving its fundamental characteristics. Different types of neutron sensing elements may be used, which may operate on any of a number of physical principles to perform the function of sensing a neutron, either by a capture or a scattering reaction, and converting that reaction to a detectable signal. High detection efficiency, an ability to acquire spectral information, and directional sensitivity may be obtained.

  19. Angle detector

    NASA Technical Reports Server (NTRS)

    Parra, G. T. (Inventor)

    1978-01-01

    An angle detector for determining a transducer's angular disposition to a capacitive pickup element is described. The transducer comprises a pendulum mounted inductive element moving past the capacitive pickup element. The capacitive pickup element divides the inductive element into two parts L sub 1 and L sub 2 which form the arms of one side of an a-c bridge. Two networks R sub 1 and R sub 2 having a plurality of binary weighted resistors and an equal number of digitally controlled switches for removing resistors from the networks form the arms of the other side of the a-c bridge. A binary counter, controlled by a phase detector, balances the bridge by adjusting the resistance of R sub 1 and R sub 2. The binary output of the counter is representative of the angle.

  20. Flame Detector

    NASA Technical Reports Server (NTRS)

    1990-01-01

    Scientific Instruments, Inc. has now developed a second generation, commercially available instrument to detect flames in hazardous environments, typically refineries, chemical plants and offshore drilling platforms. The Model 74000 detector incorporates a sensing circuit that detects UV radiation in a 100 degree conical field of view extending as far as 250 feet from the instrument. It operates in a bandwidth that makes it virtually 'blind' to solar radiation while affording extremely high sensitivity to ultraviolet flame detection. A 'windowing' technique accurately discriminates between background UV radiation and ultraviolet emitted from an actual flame, hence the user is assured of no false alarms. Model 7410CP is a combination controller and annunciator panel designed to monitor and control as many as 24 flame detectors. *Model 74000 is no longer being manufactured.

  1. Silicon Detector Letter of Intent

    SciTech Connect

    Aihara, H.; Burrows, P.; Oreglia, M.

    2010-05-26

    This document presents the current status of SiD's effort to develop an optimized design for an experiment at the International Linear Collider. It presents detailed discussions of each of SiD's various subsystems, an overview of the full GEANT4 description of SiD, the status of newly developed tracking and calorimeter reconstruction algorithms, studies of subsystem performance based on these tools, results of physics benchmarking analyses, an estimate of the cost of the detector, and an assessment of the detector R&D needed to provide the technical basis for an optimised SiD.

  2. Product Grammars for Alignment and Folding.

    PubMed

    Höner Zu Siederdissen, Christian; Hofacker, Ivo L; Stadler, Peter F

    2015-01-01

    We develop a theory of algebraic operations over linear and context-free grammars that makes it possible to combine simple "atomic" grammars operating on single sequences into complex, multi-dimensional grammars. We demonstrate the utility of this framework by constructing the search spaces of complex alignment problems on multiple input sequences explicitly as algebraic expressions of very simple one-dimensional grammars. In particular, we provide a fully worked frameshift-aware, semiglobal DNA-protein alignment algorithm whose grammar is composed of products of small, atomic grammars. The compiler accompanying our theory makes it easy to experiment with the combination of multiple grammars and different operations. Composite grammars can be written out in L(A)T(E)X for documentation and as a guide to implementation of dynamic programming algorithms. An embedding in Haskell as a domain-specific language makes the theory directly accessible to writing and using grammar products without the detour of an external compiler. Software and supplemental files available here: http://www.bioinf. uni-leipzig.de/Software/gramprod/.

  3. Neutrino Detectors

    NASA Astrophysics Data System (ADS)

    von Feilitzsch, Franz; Lanfranchi, Jean-Côme; Wurm, Michael

    The neutrino was postulated by Wolfgang Pauli in the early 1930s, but could only be detected for the first time in the 1950s. Ever since scientists all around the world have worked on the detection and understanding of this particle which so scarcely interacts with matter. Depending on the origin and nature of the neutrino, various types of experiments have been developed and operated. In this entry, we will review neutrino detectors in terms of neutrino energy and associated detection technique as well as the scientific outcome of some selected examples. After a brief historical introduction, the detection of low-energy neutrinos originating from nuclear reactors or from the Earth is used to illustrate the principles and difficulties which are encountered in detecting neutrinos. In the context of solar neutrino spectroscopy, where the neutrino is used as a probe for astrophysics, three different types of neutrino detectors are presented - water Čerenkov, radiochemical, and liquid-scintillator detectors. Moving to higher neutrino energies, we discuss neutrinos produced by astrophysical sources and from accelerators. The entry concludes with an overview of a selection of future neutrino experiments and their scientific goals.

  4. Self-Aligned Guard Rings For Schottky-Barrier Diodes

    NASA Technical Reports Server (NTRS)

    Lin, True-Lon

    1990-01-01

    Proposed self-aligned guard ring increases active area of Schottky-barrier infrared detector. Concept developed for silicide Schottky-barrier diodes in which platinum silicide or iridium silicide Schottky-contacts provide cutoff wavelengths of about 6 or 10 micrometers. Grid of silicon dioxide doped with phosphorus etched on silicon wafer, and phosphorus from grid diffused into substrate, creating n-type guard rings. Silicide layers formed in open areas of grid. Overlap of guard rings and silicide layers small.

  5. SAS-Pro: simultaneous residue assignment and structure superposition for protein structure alignment.

    PubMed

    Shah, Shweta B; Sahinidis, Nikolaos V

    2012-01-01

    Protein structure alignment is the problem of determining an assignment between the amino-acid residues of two given proteins in a way that maximizes a measure of similarity between the two superimposed protein structures. By identifying geometric similarities, structure alignment algorithms provide critical insights into protein functional similarities. Existing structure alignment tools adopt a two-stage approach to structure alignment by decoupling and iterating between the assignment evaluation and structure superposition problems. We introduce a novel approach, SAS-Pro, which addresses the assignment evaluation and structure superposition simultaneously by formulating the alignment problem as a single bilevel optimization problem. The new formulation does not require the sequentiality constraints, thus generalizing the scope of the alignment methodology to include non-sequential protein alignments. We employ derivative-free optimization methodologies for searching for the global optimum of the highly nonlinear and non-differentiable RMSD function encountered in the proposed model. Alignments obtained with SAS-Pro have better RMSD values and larger lengths than those obtained from other alignment tools. For non-sequential alignment problems, SAS-Pro leads to alignments with high degree of similarity with known reference alignments. The source code of SAS-Pro is available for download at http://eudoxus.cheme.cmu.edu/saspro/SAS-Pro.html.

  6. SAS-Pro: Simultaneous Residue Assignment and Structure Superposition for Protein Structure Alignment

    PubMed Central

    Shah, Shweta B.; Sahinidis, Nikolaos V.

    2012-01-01

    Protein structure alignment is the problem of determining an assignment between the amino-acid residues of two given proteins in a way that maximizes a measure of similarity between the two superimposed protein structures. By identifying geometric similarities, structure alignment algorithms provide critical insights into protein functional similarities. Existing structure alignment tools adopt a two-stage approach to structure alignment by decoupling and iterating between the assignment evaluation and structure superposition problems. We introduce a novel approach, SAS-Pro, which addresses the assignment evaluation and structure superposition simultaneously by formulating the alignment problem as a single bilevel optimization problem. The new formulation does not require the sequentiality constraints, thus generalizing the scope of the alignment methodology to include non-sequential protein alignments. We employ derivative-free optimization methodologies for searching for the global optimum of the highly nonlinear and non-differentiable RMSD function encountered in the proposed model. Alignments obtained with SAS-Pro have better RMSD values and larger lengths than those obtained from other alignment tools. For non-sequential alignment problems, SAS-Pro leads to alignments with high degree of similarity with known reference alignments. The source code of SAS-Pro is available for download at http://eudoxus.cheme.cmu.edu/saspro/SAS-Pro.html. PMID:22662161

  7. Superposition and alignment of labeled point clouds.

    PubMed

    Fober, Thomas; Glinca, Serghei; Klebe, Gerhard; Hüllermeier, Eyke

    2011-01-01

    Geometric objects are often represented approximately in terms of a finite set of points in three-dimensional euclidean space. In this paper, we extend this representation to what we call labeled point clouds. A labeled point cloud is a finite set of points, where each point is not only associated with a position in three-dimensional space, but also with a discrete class label that represents a specific property. This type of model is especially suitable for modeling biomolecules such as proteins and protein binding sites, where a label may represent an atom type or a physico-chemical property. Proceeding from this representation, we address the question of how to compare two labeled points clouds in terms of their similarity. Using fuzzy modeling techniques, we develop a suitable similarity measure as well as an efficient evolutionary algorithm to compute it. Moreover, we consider the problem of establishing an alignment of the structures in the sense of a one-to-one correspondence between their basic constituents. From a biological point of view, alignments of this kind are of great interest, since mutually corresponding molecular constituents offer important information about evolution and heredity, and can also serve as a means to explain a degree of similarity. In this paper, we therefore develop a method for computing pairwise or multiple alignments of labeled point clouds. To this end, we proceed from an optimal superposition of the corresponding point clouds and construct an alignment which is as much as possible in agreement with the neighborhood structure established by this superposition. We apply our methods to the structural analysis of protein binding sites.

  8. Mobile and replicated alignment of arrays in data-parallel programs

    NASA Technical Reports Server (NTRS)

    Chatterjee, Siddhartha; Gilbert, John R.; Schreiber, Robert

    1993-01-01

    When a data-parallel language like FORTRAN 90 is compiled for a distributed-memory machine, aggregate data objects (such as arrays) are distributed across the processor memories. The mapping determines the amount of residual communication needed to bring operands of parallel operations into alignment with each other. A common approach is to break the mapping into two stages: first, an alignment that maps all the objects to an abstract template, and then a distribution that maps the template to the processors. We solve two facets of the problem of finding alignments that reduce residual communication: we determine alignments that vary in loops, and objects that should have replicated alignments. We show that loop-dependent mobile alignment is sometimes necessary for optimum performance, and we provide algorithms with which a compiler can determine good mobile alignments for objects within do loops. We also identify situations in which replicated alignment is either required by the program itself (via spread operations) or can be used to improve performance. We propose an algorithm based on network flow that determines which objects to replicate so as to minimize the total amount of broadcast communication in replication. This work on mobile and replicated alignment extends our earlier work on determining static alignment.

  9. A near-Infrared SETI Experiment: Alignment and Astrometric precision

    NASA Astrophysics Data System (ADS)

    Duenas, Andres; Maire, Jerome; Wright, Shelley; Drake, Frank D.; Marcy, Geoffrey W.; Siemion, Andrew; Stone, Remington P. S.; Tallis, Melisa; Treffers, Richard R.; Werthimer, Dan

    2016-06-01

    Beginning in March 2015, a Near-InfraRed Optical SETI (NIROSETI) instrument aiming to search for fast nanosecond laser pulses, has been commissioned on the Nickel 1m-telescope at Lick Observatory. The NIROSETI instrument makes use of an optical guide camera, SONY ICX694 CCD from PointGrey, to align our selected sources into two 200µm near-infrared Avalanche Photo Diodes (APD) with a field-of-view of 2.5"x2.5" each. These APD detectors operate at very fast bandwidths and are able to detect pulse widths extending down into the nanosecond range. Aligning sources onto these relatively small detectors requires characterizing the guide camera plate scale, static optical distortion solution, and relative orientation with respect to the APD detectors. We determined the guide camera plate scale as 55.9+- 2.7 milli-arcseconds/pixel and magnitude limit of 18.15mag (+1.07/-0.58) in V-band. We will present the full distortion solution of the guide camera, orientation, and our alignment method between the camera and the two APDs, and will discuss target selection within the NIROSETI observational campaign, including coordination with Breakthrough Listen.

  10. Subspace Detectors: Efficient Implementation

    SciTech Connect

    Harris, D B; Paik, T

    2006-07-26

    computed efficiently for continuous multichannel seismic data. The speed of the calculation is significant as it may become desirable to deploy subspace detectors numbering in the thousands. One application contemplated for these detectors is as screens against signals from repeating sources such as mines or aftershocks of large earthquakes. With many tens of stations and potentially hundreds of sources to screen, efficient implementations are desirable. Speed, of course, can be achieved by procuring faster computers or special-purpose hardware. The approach we examine here is the development of two efficient algorithms that can make the calculations run faster on any machine. In the first section, we describe the subspace detector as we use it for the detection of repeating seismic events, defining terms and the parameterization used in succeeding sections. This section also reviews how the correlation computations central to the matched filter and subspace detectors can be implemented as a collection of convolution operations. Convolution algorithms using fast Fourier transforms, such as the overlap-add and overlap-save methods, have long been known as efficient implementations of discrete-time finite-impulse-response filters [e.g. Oppenheim and Schafer, 1975]. These may be extended in a straightforward manner to implement multichannel correlation detectors. In the second section, we describe how multichannel data can be multiplexed to compute the required convolutions with a single pair of FFT operations instead of a pair for each channel. This approach increases speed approximately twofold. Seismic data, almost invariably, are oversampled. This characteristic provides an opportunity for increased efficiency by decimating the data prior to performing the correlation calculations. In the third section, we describe a bandpass transformation of the data that allows a more aggressive decimation of the data without significant loss of fidelity in the correlation calculation

  11. Electro-optic lightning detector.

    PubMed

    Koshak, W J; Solakiewicz, R J

    1999-07-20

    The design, alignment, calibration, and field deployment of a solid-state lightning detector is described. The primary sensing component of the detector is a potassium dihydrogen phosphate electro-optic crystal that is attached in series to a flat-plate aluminum antenna; the antenna is exposed to the ambient thundercloud electric field. A semiconductor laser diode (lambda = 685 nm), polarizing optics, and the crystal are arranged in a Pockels cell configuration. Lightning-caused electric field changes are related to small changes in the transmission of laser light through the optical cell. Several hundred lightning electric field change excursions were recorded during five thunderstorms that occurred in the summer of 1998 at the NASA Marshall Space Flight Center in northern Alabama. PMID:18323949

  12. Electro-optic Lightning Detector

    NASA Technical Reports Server (NTRS)

    Koshak, William J.; Solakiewicz, Richard J.

    1996-01-01

    The design, alignment, calibration, and field deployment of a solid-state lightning detector is described. The primary sensing component of the detector is a potassium dihydrogen phosphate (KDP) electro-optic crystal that is attached in series to a flat plate aluminum antenna; the antenna is exposed to the ambient thundercloud electric field. A semiconductor laser diode (lambda = 685 nm), polarizing optics, and the crystal are arranged in a Pockels cell configuration. Lightning-caused electric field changes are related to small changes in the transmission of laser light through the optical cell. Several hundred lightning electric field change excursions were recorded during five thunderstorms that occurred in the summer of 1998 at the NASA Marshall Space Flight Center (MSFC) in northern Alabama.

  13. Electro-Optic Lighting Detector

    NASA Technical Reports Server (NTRS)

    Koshak, William J.; Solakiewicz, Richard J.

    1999-01-01

    The design, alignment, calibration, and field deployment of a solid-state lightning detector is described. The primary sensing component of the detector is a potassium dihydrogen phosphate electro-optic crystal that is attached in series to a flat-plate aluminum antenna; the antenna is exposed to the ambient thundercloud electric field. A semiconductor laser diode (lambda = 685 nm), polarizing optics, and the crystal are arranged in a Pockels cell configuration. Lightning-caused electric field changes are related to small changes in the transmission of laser light through the optical cell. Several hundred lightning electric field change excursions were recorded during five thunderstorms that occurred in the summer of 1998 at the NASA Marshall Space Flight Center in northern Alabama.

  14. Lexical alignment in triadic communication.

    PubMed

    Foltz, Anouschka; Gaspers, Judith; Thiele, Kristina; Stenneken, Prisca; Cimiano, Philipp

    2015-01-01

    Lexical alignment refers to the adoption of one's interlocutor's lexical items. Accounts of the mechanisms underlying such lexical alignment differ (among other aspects) in the role assigned to addressee-centered behavior. In this study, we used a triadic communicative situation to test which factors may modulate the extent to which participants' lexical alignment reflects addressee-centered behavior. Pairs of naïve participants played a picture matching game and received information about the order in which pictures were to be matched from a voice over headphones. On critical trials, participants did or did not hear a name for the picture to be matched next over headphones. Importantly, when the voice over headphones provided a name, it did not match the name that the interlocutor had previously used to describe the object. Participants overwhelmingly used the word that the voice over headphones provided. This result points to non-addressee-centered behavior and is discussed in terms of disrupting alignment with the interlocutor as well as in terms of establishing alignment with the voice over headphones. In addition, the type of picture (line drawing vs. tangram shape) independently modulated lexical alignment, such that participants showed more lexical alignment to their interlocutor for (more ambiguous) tangram shapes compared to line drawings. Overall, the results point to a rather large role for non-addressee-centered behavior during lexical alignment.

  15. Drive alignment pays maintenance dividends

    SciTech Connect

    Fedder, R.

    2008-12-15

    Proper alignment of the motor and gear drive on conveying and processing equipment will result in longer bearing and coupling life, along with lower maintenance costs. Selecting an alignment free drive package instead of a traditional foot mounted drive and motor is a major advancement toward these goals. 4 photos.

  16. Transformation and Alignment in Similarity

    ERIC Educational Resources Information Center

    Hodgetts, Carl J.; Hahn, Ulrike; Chater, Nick

    2009-01-01

    This paper contrasts two structural accounts of psychological similarity: structural alignment (SA) and Representational Distortion (RD). SA proposes that similarity is determined by how readily the structures of two objects can be brought into alignment; RD measures similarity by the complexity of the transformation that "distorts" one…

  17. Lexical alignment in triadic communication

    PubMed Central

    Foltz, Anouschka; Gaspers, Judith; Thiele, Kristina; Stenneken, Prisca; Cimiano, Philipp

    2015-01-01

    Lexical alignment refers to the adoption of one’s interlocutor’s lexical items. Accounts of the mechanisms underlying such lexical alignment differ (among other aspects) in the role assigned to addressee-centered behavior. In this study, we used a triadic communicative situation to test which factors may modulate the extent to which participants’ lexical alignment reflects addressee-centered behavior. Pairs of naïve participants played a picture matching game and received information about the order in which pictures were to be matched from a voice over headphones. On critical trials, participants did or did not hear a name for the picture to be matched next over headphones. Importantly, when the voice over headphones provided a name, it did not match the name that the interlocutor had previously used to describe the object. Participants overwhelmingly used the word that the voice over headphones provided. This result points to non-addressee-centered behavior and is discussed in terms of disrupting alignment with the interlocutor as well as in terms of establishing alignment with the voice over headphones. In addition, the type of picture (line drawing vs. tangram shape) independently modulated lexical alignment, such that participants showed more lexical alignment to their interlocutor for (more ambiguous) tangram shapes compared to line drawings. Overall, the results point to a rather large role for non-addressee-centered behavior during lexical alignment. PMID:25762955

  18. Curriculum Alignment: Theory to Practice.

    ERIC Educational Resources Information Center

    Leitzel, Thomas C.; Vogler, Daniel E.

    Curriculum alignment is the conscious congruence of three educational elements: curriculum, instruction, and assessment. Alignment is rooted in the belief that instructional plans are established through outcomes-based content goals and the goal of assuring that delivery and assessment are congruent. Platform unity, based on the Principles of…

  19. Well-pump alignment system

    DOEpatents

    Drumheller, Douglas S.

    1998-01-01

    An improved well-pump for geothermal wells, an alignment system for a well-pump, and to a method for aligning a rotor and stator within a well-pump, wherein the well-pump has a whistle assembly formed at a bottom portion thereof, such that variations in the frequency of the whistle, indicating misalignment, may be monitored during pumping.

  20. Alignment of continuous video onto 3D point clouds.

    PubMed

    Zhao, Wenyi; Nister, David; Hsu, Steve

    2005-08-01

    We propose a general framework for aligning continuous (oblique) video onto 3D sensor data. We align a point cloud computed from the video onto the point cloud directly obtained from a 3D sensor. This is in contrast to existing techniques where the 2D images are aligned to a 3D model derived from the 3D sensor data. Using point clouds enables the alignment for scenes full of objects that are difficult to model; for example, trees. To compute 3D point clouds from video, motion stereo is used along with a state-of-the-art algorithm for camera pose estimation. Our experiments with real data demonstrate the advantages of the proposed registration algorithm for texturing models in large-scale semiurban environments. The capability to align video before a 3D model is built from the 3D sensor data offers new practical opportunities for 3D modeling. We introduce a novel modeling-through-registration approach that fuses 3D information from both the 3D sensor and the video. Initial experiments with real data illustrate the potential of the proposed approach.

  1. Botulinum alignment for congenital esotropia.

    PubMed Central

    Ing, M R

    1992-01-01

    This is the first report of a group of patients with congenital esotropia examined for motor and sensory evidence of binocularity a minimum of 3 years after alignment by botulinum. Evidence for binocularity was clearly present in approximately one half of the patients. Lag time to satisfactory alignment was at least 1 month (average, 5 months) following the initial botulinum injection. The results must be considered preliminary. However, when these results are compared with those of patients with congenital esotropia aligned by incisional surgery by age 2 years and examined with the same testing devices by this same investigator, botulinum alignment appears to be less effective than surgical alignment in establishing evidence for binocularity (P < 0.005). PMID:1494828

  2. Space Mirror Alignment System

    NASA Technical Reports Server (NTRS)

    Jau, Bruno M.; McKinney, Colin; Smythe, Robert F.; Palmer, Dean L.

    2011-01-01

    An optical alignment mirror mechanism (AMM) has been developed with angular positioning accuracy of +/-0.2 arcsec. This requires the mirror s linear positioning actuators to have positioning resolutions of +/-112 nm to enable the mirror to meet the angular tip/tilt accuracy requirement. Demonstrated capabilities are 0.1 arc-sec angular mirror positioning accuracy, which translates into linear positioning resolutions at the actuator of 50 nm. The mechanism consists of a structure with sets of cross-directional flexures that enable the mirror s tip and tilt motion, a mirror with its kinematic mount, and two linear actuators. An actuator comprises a brushless DC motor, a linear ball screw, and a piezoelectric brake that holds the mirror s position while the unit is unpowered. An interferometric linear position sensor senses the actuator s position. The AMMs were developed for an Astrometric Beam Combiner (ABC) optical bench, which is part of an interferometer development. Custom electronics were also developed to accommodate the presence of multiple AMMs within the ABC and provide a compact, all-in-one solution to power and control the AMMs.

  3. High precision beam alignment of electromagnetic wigglers

    SciTech Connect

    Ben-Zvi, I.; Qiu, X.Z.

    1993-01-01

    The performance of Free-Electron Lasers depends critically on the quality of the alignment of the electron beam to the wiggler's magnetic axis and the deviation of this axis from a straight fine. The measurement of the electron beam position requires numerous beam position monitors in the wiggler, where space is at premium. The beam position measurement is used to set beam steerers for an orbit correction in the wiggler. The authors propose an alternative high precision alignment method in which one or two external Beam Position Monitors (BPM) are used. In this technique, the field in the electro-wiggler is modulated section by section and the beam position movement at the external BPM is detected in synchronism with the modulation. A beam offset at the modulated beam section will produce a modulation of the beam position at the detector that is a function of the of the beam offset and the absolute value of the modulation current. The wiggler errors produce a modulation that is a function of the modulation current. It will be shown that this method allows the detection and correction of the beam position at each section in the presence of wiggler errors with a good resolution. Furthermore, it allows one to measure the first and second integrals of the wiggler error over each wiggler section. Lastly, provided that wiggler sections can be degaussed effectively, one can test the deviation of the wiggler's magnetic axis from a straight line.

  4. Magnetic alignment and the Poisson alignment reference system

    NASA Astrophysics Data System (ADS)

    Griffith, L. V.; Schenz, R. F.; Sommargren, G. E.

    1990-08-01

    Three distinct metrological operations are necessary to align a free-electron laser (FEL): the magnetic axis must be located, a straight line reference (SLR) must be generated, and the magnetic axis must be related to the SLR. This article begins with a review of the motivation for developing an alignment system that will assure better than 100-μm accuracy in the alignment of the magnetic axis throughout an FEL. The 100-μm accuracy is an error circle about an ideal axis for 300 m or more. The article describes techniques for identifying the magnetic axes of solenoids, quadrupoles, and wiggler poles. Propagation of a laser beam is described to the extent of revealing sources of nonlinearity in the beam. Development of a straight-line reference based on the Poisson line, a diffraction effect, is described in detail. Spheres in a large-diameter laser beam create Poisson lines and thus provide a necessary mechanism for gauging between the magnetic axis and the SLR. Procedures for installing FEL components and calibrating alignment fiducials to the magnetic axes of the components are also described. The Poisson alignment reference system should be accurate to 25 μm over 300 m, which is believed to be a factor-of-4 improvement over earlier techniques. An error budget shows that only 25% of the total budgeted tolerance is used for the alignment reference system, so the remaining tolerances should fall within the allowable range for FEL alignment.

  5. Advanced Dispersed Fringe Sensing Algorithm for Coarse Phasing Segmented Mirror Telescopes

    NASA Technical Reports Server (NTRS)

    Spechler, Joshua A.; Hoppe, Daniel J.; Sigrist, Norbert; Shi, Fang; Seo, Byoung-Joon; Bikkannavar, Siddarayappa A.

    2013-01-01

    Segment mirror phasing, a critical step of segment mirror alignment, requires the ability to sense and correct the relative pistons between segments from up to a few hundred microns to a fraction of wavelength in order to bring the mirror system to its full diffraction capability. When sampling the aperture of a telescope, using auto-collimating flats (ACFs) is more economical. The performance of a telescope with a segmented primary mirror strongly depends on how well those primary mirror segments can be phased. One such process to phase primary mirror segments in the axial piston direction is dispersed fringe sensing (DFS). DFS technology can be used to co-phase the ACFs. DFS is essentially a signal fitting and processing operation. It is an elegant method of coarse phasing segmented mirrors. DFS performance accuracy is dependent upon careful calibration of the system as well as other factors such as internal optical alignment, system wavefront errors, and detector quality. Novel improvements to the algorithm have led to substantial enhancements in DFS performance. The Advanced Dispersed Fringe Sensing (ADFS) Algorithm is designed to reduce the sensitivity to calibration errors by determining the optimal fringe extraction line. Applying an angular extraction line dithering procedure and combining this dithering process with an error function while minimizing the phase term of the fitted signal, defines in essence the ADFS algorithm.

  6. Alignment technology for backside integration

    NASA Astrophysics Data System (ADS)

    Bauer, J.; Kulse, P.; Haak, U.; Old, G.; Scheuring, G.; Döbereiner, St.; Hillmann, F.; Brück, H.-J.; Kaynak, M.; Ehwald, K.-E.; Marschmeyer, St.; Birkholz, M.; Schulz, K.

    2011-03-01

    This paper presents a backside-to-frontside alignment technique for the backside processing of Si wafers. Integrated MEMS components like BiCMOS-embedded RF-MEMS switches require accurate (1-2μm) alignment. We demonstrate an alignment technique providing overlay values of less than 500 nm by using a backside alignment layer. The approach is enabled by a new non-contact wafer pre-alignment system of the Nikon Scanner S207D allowing precise loading (<5μm) of the wafer onto the exposure stage. Before starting the back-side MEMS process, the misalignment between frontside devices and backside alignment layer has to be measured. The alignment errors are applied as lithography overlay corrections to the backside MEMS process. For the specific application of deep Si etching (Bosch process), moreover, one has to consider the etch profile angle deviation across the wafer (tilting), which turned out in our experiments to amount up to 8 μm. During initial experiments with a Nikon i-line stepper NSR-2205 i- 11D the overlay has been corrected by the stepper offset parameters. These parameters have been obtained by summing up both the wafer and intra-field scaling errors caused by deep Si etching and backside-to-frontside alignment errors. Misalignments and tilting errors were all measured with a MueTec MT 3000 IR optical metrology system using overlay marks. The developed alignment technique is applied to BiCMOS-embedded MEMS devices, i.e. mm-wave RF switches and a viscosity sensor chip based on the IHP's high-speed SiGe technology. It turned out to be very promising for backside processed MEMS components with critical alignment requirements.

  7. Dust Detector

    NASA Technical Reports Server (NTRS)

    Kelley, M. C.

    2001-01-01

    We discuss a recent sounding rocket experiment which found charged dust in the Earth's tropical mesosphere. The dust detector was designed to measure small (5000 - 10000 amu.) charged dust particles, most likely of meteoric origin. A 5 km thick layer of positively charged dust was found at an altitude of 90 km, in the vicinity of an observed sporadic sodium layer and sporadic E layer. The observed dust was positively charged in the bulk of the dust layer, but was negatively charged near the bottom.

  8. Ion detector

    DOEpatents

    Tullis, Andrew M.

    1987-01-01

    An improved ion detector device of the ionization detection device chamber ype comprises an ionization chamber having a central electrode therein surrounded by a cylindrical electrode member within the chamber with a collar frictionally fitted around at least one of the electrodes. The collar has electrical contact means carried in an annular groove in an inner bore of the collar to contact the outer surface of the electrode to provide electrical contact between an external terminal and the electrode without the need to solder leads to the electrode.

  9. Testing the tidal alignment model of galaxy intrinsic alignment

    SciTech Connect

    Blazek, Jonathan; Seljak, Uroš; McQuinn, Matthew E-mail: mmcquinn@berkeley.edu

    2011-05-01

    Weak gravitational lensing has become a powerful probe of large-scale structure and cosmological parameters. Precision weak lensing measurements require an understanding of the intrinsic alignment of galaxy ellipticities, which can in turn inform models of galaxy formation. It is hypothesized that elliptical galaxies align with the background tidal field and that this alignment mechanism dominates the correlation between ellipticities on cosmological scales (in the absence of lensing). We use recent large-scale structure measurements from the Sloan Digital Sky Survey to test this picture with several statistics: (1) the correlation between ellipticity and galaxy overdensity, w{sub g+}; (2) the intrinsic alignment auto-correlation functions; (3) the correlation functions of curl-free, E, and divergence-free, B, modes, the latter of which is zero in the linear tidal alignment theory; (4) the alignment correlation function, w{sub g}(r{sub p},θ), a recently developed statistic that generalizes the galaxy correlation function to account for the angle between the galaxy separation vector and the principle axis of ellipticity. We show that recent measurements are largely consistent with the tidal alignment model and discuss dependence on galaxy luminosity. In addition, we show that at linear order the tidal alignment model predicts that the angular dependence of w{sub g}(r{sub p},θ) is simply w{sub g+}(r{sub p})cos (2θ) and that this dependence is consistent with recent measurements. We also study how stochastic nonlinear contributions to galaxy ellipticity impact these statistics. We find that a significant fraction of the observed LRG ellipticity can be explained by alignment with the tidal field on scales ∼> 10 \\hMpc. These considerations are relevant to galaxy formation and evolution.

  10. Non-rigid alignment in electron tomography in materials science.

    PubMed

    Printemps, Tony; Bernier, Nicolas; Bleuet, Pierre; Mula, Guido; Hervé, Lionel

    2016-09-01

    Electron tomography is a key technique that enables the visualization of an object in three dimensions with a resolution of about a nanometre. High-quality 3D reconstruction is possible thanks to the latest compressed sensing algorithms and/or better alignment and preprocessing of the 2D projections. Rigid alignment of 2D projections is routine in electron tomography. However, it cannot correct misalignments induced by (i) deformations of the sample due to radiation damage or (ii) drifting of the sample during the acquisition of an image in scanning transmission electron microscope mode. In both cases, those misalignments can give rise to artefacts in the reconstruction. We propose a simple-to-implement non-rigid alignment technique to correct those artefacts. This technique is particularly suited for needle-shaped samples in materials science. It is initiated by a rigid alignment of the projections and it is then followed by several rigid alignments of different parts of the projections. Piecewise linear deformations are applied to each projection to force them to simultaneously satisfy the rigid alignments of the different parts. The efficiency of this technique is demonstrated on three samples, an intermetallic sample with deformation misalignments due to a high electron dose typical to spectroscopic electron tomography, a porous silicon sample with an extremely thin end particularly sensitive to electron beam and another porous silicon sample that was drifting during image acquisitions.

  11. Non-rigid alignment in electron tomography in materials science.

    PubMed

    Printemps, Tony; Bernier, Nicolas; Bleuet, Pierre; Mula, Guido; Hervé, Lionel

    2016-09-01

    Electron tomography is a key technique that enables the visualization of an object in three dimensions with a resolution of about a nanometre. High-quality 3D reconstruction is possible thanks to the latest compressed sensing algorithms and/or better alignment and preprocessing of the 2D projections. Rigid alignment of 2D projections is routine in electron tomography. However, it cannot correct misalignments induced by (i) deformations of the sample due to radiation damage or (ii) drifting of the sample during the acquisition of an image in scanning transmission electron microscope mode. In both cases, those misalignments can give rise to artefacts in the reconstruction. We propose a simple-to-implement non-rigid alignment technique to correct those artefacts. This technique is particularly suited for needle-shaped samples in materials science. It is initiated by a rigid alignment of the projections and it is then followed by several rigid alignments of different parts of the projections. Piecewise linear deformations are applied to each projection to force them to simultaneously satisfy the rigid alignments of the different parts. The efficiency of this technique is demonstrated on three samples, an intermetallic sample with deformation misalignments due to a high electron dose typical to spectroscopic electron tomography, a porous silicon sample with an extremely thin end particularly sensitive to electron beam and another porous silicon sample that was drifting during image acquisitions. PMID:27018779

  12. Unrooted unordered homeomorphic subtree alignment of RNA trees.

    PubMed

    Milo, Nimrod; Zakov, Shay; Katzenelson, Erez; Bachmat, Eitan; Dinitz, Yefim; Ziv-Ukelson, Michal

    2013-01-01

    : We generalize some current approaches for RNA tree alignment, which are traditionally confined to ordered rooted mappings, to also consider unordered unrooted mappings. We define the Homeomorphic Subtree Alignment problem (HSA), and present a new algorithm which applies to several modes, combining global or local, ordered or unordered, and rooted or unrooted tree alignments. Our algorithm generalizes previous algorithms that either solved the problem in an asymmetric manner, or were restricted to the rooted and/or ordered cases. Focusing here on the most general unrooted unordered case, we show that for input trees T and S, our algorithm has an O(nTnS + min(dT,dS)LTLS) time complexity, where nT,LT and dT are the number of nodes, the number of leaves, and the maximum node degree in T, respectively (satisfying dT ≤ LT ≤ nT), and similarly for nS,LS and dS with respect to the tree S. This improves the time complexity of previous algorithms for less general variants of the problem.In order to obtain this time bound for HSA, we developed new algorithms for a generalized variant of the Min-Cost Bipartite Matching problem (MCM), as well as to two derivatives of this problem, entitled All-Cavity-MCM and All-Pairs-Cavity-MCM. For two input sets of size n and m, where n ≤ m, MCM and both its cavity derivatives are solved in O(n3 + nm) time, without the usage of priority queues (e.g. Fibonacci heaps) or other complex data structures. This gives the first cubic time algorithm for All-Pairs-Cavity-MCM, and improves the running times of MCM and All-Cavity-MCM problems in the unbalanced case where n ≪ m.We implemented the algorithm (in all modes mentioned above) as a graphical software tool which computes and displays similarities between secondary structures of RNA given as input, and employed it to a preliminary experiment in which we ran all-against-all inter-family pairwise alignments of RNAse P and Hammerhead RNA

  13. MACSE: Multiple Alignment of Coding SEquences Accounting for Frameshifts and Stop Codons

    PubMed Central

    Ranwez, Vincent; Harispe, Sébastien; Delsuc, Frédéric; Douzery, Emmanuel J. P.

    2011-01-01

    Until now the most efficient solution to align nucleotide sequences containing open reading frames was to use indirect procedures that align amino acid translation before reporting the inferred gap positions at the codon level. There are two important pitfalls with this approach. Firstly, any premature stop codon impedes using such a strategy. Secondly, each sequence is translated with the same reading frame from beginning to end, so that the presence of a single additional nucleotide leads to both aberrant translation and alignment. We present an algorithm that has the same space and time complexity as the classical Needleman-Wunsch algorithm while accommodating sequencing errors and other biological deviations from the coding frame. The resulting pairwise coding sequence alignment method was extended to a multiple sequence alignment (MSA) algorithm implemented in a program called MACSE (Multiple Alignment of Coding SEquences accounting for frameshifts and stop codons). MACSE is the first automatic solution to align protein-coding gene datasets containing non-functional sequences (pseudogenes) without disrupting the underlying codon structure. It has also proved useful in detecting undocumented frameshifts in public database sequences and in aligning next-generation sequencing reads/contigs against a reference coding sequence. MACSE is distributed as an open-source java file executable with freely available source code and can be used via a web interface at: http://mbb.univ-montp2.fr/macse. PMID:21949676

  14. Multibeam field emission x-ray system with half-scan reconstruction algorithm

    SciTech Connect

    Lu Yang; Yu Hengyong; Cao Guohua; Zhao Jun; Wang Ge; Zhou, Otto

    2010-07-15

    Purpose: In this article, the authors propose a multibeam field emission x-ray (MBFEX) system along with a half-scan fan-beam reconstruction algorithm. Methods: The proposed system consists of a linear CNT-based MBFEX source array, a single large area detector that is divided into same number of segments as the number of x-ray beams, a multihole collimator that aligns each beam with a corresponding detector segment, and a sample rotation stage. The collimator is placed between the source and the object to restrict the x-ray radiations through the target object only. In this design, all the x-ray beams are activated simultaneously to provide multiple projection views of the object. The detector is virtually segmented and synchronized with the x-ray exposure and the physiological signals when gating is involved. The transmitted x-ray intensity from each beam is collected by the corresponding segment on the detector. After each exposure, the object is rotated by a step angle until sufficient data set is collected. The half-scan reconstruction formula for MBFEX system is derived from the conventional filtered backprojection algorithm. To demonstrate the advantages of the system and method in reducing motion artifacts, the authors performed simulations with both standard and dynamic Shepp-Logan phantoms. Results: The numerical results indicate that the proposed multibeam system and the associated half-scan algorithm can effectively reduce the scanning time and improve the image quality for a time-varying object. Conclusions: The MBFEX technique offers an opportunity for the innovation of multisource imaging system.

  15. CMP-compatible alignment strategy

    NASA Astrophysics Data System (ADS)

    Rouchouze, Eric; Darracq, Jean-Michel; Gemen, Jack

    1997-07-01

    As semiconductor technology continues its way towards smaller geometries, CMP has gained acceptance as the planarization technique for interconnect layers. Its benefits are well known, especially in terms of imaging. However, one of its major drawbacks is to make difficult the alignment of interconnect layers, since a planarized alignment mark is less visible for the stepper's alignment system. Usual workarounds include the clearing of process layers from the alignment mark before exposing the product layer. Although these workarounds provide a temporary solution, they are too costly to be viable in a mass production environment. In this experiment, a non-zero alignment strategy using new mark designs has been tested on the backend layers of a 0.35 micrometers CMOS process. New mark designs have been evaluated, where the space part of the gratings has been filled with 'segments' of various width, the purpose being to minimize the planarization effect of the metallization process. For the selection of the best mark design, several criteria have been taken into account: the stepper's built-in alignment diagnostic software provides information on the quality of the alignment signal. The most important criterion is the product overlay measurement and its repeatability. Marks cross sections using a FIB/SEM tool give indications on the mark profile after metal deposition.

  16. Galaxy Alignments: Theory, Modelling & Simulations

    NASA Astrophysics Data System (ADS)

    Kiessling, Alina; Cacciato, Marcello; Joachimi, Benjamin; Kirk, Donnacha; Kitching, Thomas D.; Leonard, Adrienne; Mandelbaum, Rachel; Schäfer, Björn Malte; Sifón, Cristóbal; Brown, Michael L.; Rassat, Anais

    2015-11-01

    The shapes of galaxies are not randomly oriented on the sky. During the galaxy formation and evolution process, environment has a strong influence, as tidal gravitational fields in the large-scale structure tend to align nearby galaxies. Additionally, events such as galaxy mergers affect the relative alignments of both the shapes and angular momenta of galaxies throughout their history. These "intrinsic galaxy alignments" are known to exist, but are still poorly understood. This review will offer a pedagogical introduction to the current theories that describe intrinsic galaxy alignments, including the apparent difference in intrinsic alignment between early- and late-type galaxies and the latest efforts to model them analytically. It will then describe the ongoing efforts to simulate intrinsic alignments using both N-body and hydrodynamic simulations. Due to the relative youth of this field, there is still much to be done to understand intrinsic galaxy alignments and this review summarises the current state of the field, providing a solid basis for future work.

  17. Advanced Mask Aligner Lithography (AMALITH)

    NASA Astrophysics Data System (ADS)

    Voelkel, Reinhard; Vogler, Uwe; Bramati, Arianna

    2015-03-01

    Mask aligner lithography is very attractive for less-critical lithography layers and is widely used for LED, display, CMOS image sensor, micro-fluidics and MEMS manufacturing. Mask aligner lithography is also a preferred choice the semiconductor back-end for 3D-IC, TSV interconnects, advanced packaging (AdP) and wafer-level-packaging (WLP). Mask aligner lithography is a mature technique based on shadow printing and has not much changed since the 1980s. In shadow printing lithography a geometric pattern is transferred by free-space propagation from a photomask to a photosensitive layer on a wafer. The inherent simplicity of the pattern transfer offers ease of operation, low maintenance, moderate capital expenditure, high wafers-per-hour (WPH) throughput, and attractive cost-of-ownership (COO). Advanced mask aligner lithography (AMALITH) comprises different measures to improve shadow printing lithography beyond current limits. The key enabling technology for AMALITH is a novel light integrator systems, referred to as MO Exposure Optics® (MOEO). MOEO allows to fully control and shape the properties of the illumination light in a mask aligner. Full control is the base for accurate simulation and optimization of the shadow printing process (computational lithography). Now photolithography enhancement techniques like customized illumination, optical proximity correction (OPC), phase masks (AAPSM), half-tone lithography and Talbot lithography could be used in mask aligner lithography. We summarize the recent progress in advanced mask aligner lithography (AMALITH) and discuss possible measures to further improve shadow printing lithography.

  18. Score distributions of gapped multiple sequence alignments down to the low-probability tail

    NASA Astrophysics Data System (ADS)

    Fieth, Pascal; Hartmann, Alexander K.

    2016-08-01

    Assessing the significance of alignment scores of optimally aligned DNA or amino acid sequences can be achieved via the knowledge of the score distribution of random sequences. But this requires obtaining the distribution in the biologically relevant high-scoring region, where the probabilities are exponentially small. For gapless local alignments of infinitely long sequences this distribution is known analytically to follow a Gumbel distribution. Distributions for gapped local alignments and global alignments of finite lengths can only be obtained numerically. To obtain result for the small-probability region, specific statistical mechanics-based rare-event algorithms can be applied. In previous studies, this was achieved for pairwise alignments. They showed that, contrary to results from previous simple sampling studies, strong deviations from the Gumbel distribution occur in case of finite sequence lengths. Here we extend the studies to multiple sequence alignments with gaps, which are much more relevant for practical applications in molecular biology. We study the distributions of scores over a large range of the support, reaching probabilities as small as 10-160, for global and local (sum-of-pair scores) multiple alignments. We find that even after suitable rescaling, eliminating the sequence-length dependence, the distributions for multiple alignment differ from the pairwise alignment case. Furthermore, we also show that the previously discussed Gaussian correction to the Gumbel distribution needs to be refined, also for the case of pairwise alignments.

  19. Score distributions of gapped multiple sequence alignments down to the low-probability tail.

    PubMed

    Fieth, Pascal; Hartmann, Alexander K

    2016-08-01

    Assessing the significance of alignment scores of optimally aligned DNA or amino acid sequences can be achieved via the knowledge of the score distribution of random sequences. But this requires obtaining the distribution in the biologically relevant high-scoring region, where the probabilities are exponentially small. For gapless local alignments of infinitely long sequences this distribution is known analytically to follow a Gumbel distribution. Distributions for gapped local alignments and global alignments of finite lengths can only be obtained numerically. To obtain result for the small-probability region, specific statistical mechanics-based rare-event algorithms can be applied. In previous studies, this was achieved for pairwise alignments. They showed that, contrary to results from previous simple sampling studies, strong deviations from the Gumbel distribution occur in case of finite sequence lengths. Here we extend the studies to multiple sequence alignments with gaps, which are much more relevant for practical applications in molecular biology. We study the distributions of scores over a large range of the support, reaching probabilities as small as 10^{-160}, for global and local (sum-of-pair scores) multiple alignments. We find that even after suitable rescaling, eliminating the sequence-length dependence, the distributions for multiple alignment differ from the pairwise alignment case. Furthermore, we also show that the previously discussed Gaussian correction to the Gumbel distribution needs to be refined, also for the case of pairwise alignments. PMID:27627266

  20. Aligning for Innovation - Alignment Strategy to Drive Innovation

    NASA Technical Reports Server (NTRS)

    Johnson, Hurel; Teltschik, David; Bussey, Horace, Jr.; Moy, James

    2010-01-01

    With the sudden need for innovation that will help the country achieve its long-term space exploration objectives, the question of whether NASA is aligned effectively to drive the innovation that it so desperately needs to take space exploration to the next level should be entertained. Authors such as Robert Kaplan and David North have noted that companies that use a formal system for implementing strategy consistently outperform their peers. They have outlined a six-stage management systems model for implementing strategy, which includes the aligning of the organization towards its objectives. This involves the alignment of the organization from the top down. This presentation will explore the impacts of existing U.S. industrial policy on technological innovation; assess the current NASA organizational alignment and its impacts on driving technological innovation; and finally suggest an alternative approach that may drive the innovation needed to take the world to the next level of space exploration, with NASA truly leading the way.

  1. Fusion bonding and alignment fixture

    DOEpatents

    Ackler, Harold D.; Swierkowski, Stefan P.; Tarte, Lisa A.; Hicks, Randall K.

    2000-01-01

    An improved vacuum fusion bonding structure and process for aligned bonding of large area glass plates, patterned with microchannels and access holes and slots, for elevated glass fusion temperatures. Vacuum pumpout of all the components is through the bottom platform which yields an untouched, defect free top surface which greatly improves optical access through this smooth surface. Also, a completely non-adherent interlayer, such as graphite, with alignment and location features is located between the main steel platform and the glass plate pair, which makes large improvements in quality, yield, and ease of use, and enables aligned bonding of very large glass structures.

  2. Multiple sequence alignment with DIALIGN.

    PubMed

    Morgenstern, Burkhard

    2014-01-01

    DIALIGN is a software tool for multiple sequence alignment by combining global and local alignment features. It composes multiple alignments from local pairwise sequence similarities. This approach is particularly useful to discover conserved functional regions in sequences that share only local homologies but are otherwise unrelated. An anchoring option allows to use external information and expert knowledge in addition to primary-sequence similarity alone. The latest version of DIALIGN optionally uses matches to the PFAM database to detect weak homologies. Various versions of the program are available through Göttingen Bioinformatics Compute Server (GOBICS) at http://www.gobics.de/department/software.

  3. Robust alignment of prostate histology slices with quantified accuracy

    NASA Astrophysics Data System (ADS)

    Hughes, Cecilia; Rouviere, Olivier; Mege Lechevallier, Florence; Souchon, Rémi; Prost, Rémy

    2012-02-01

    Prostate cancer is the most common malignancy among men yet no current imaging technique is capable of detecting the tumours with precision. To evaluate each technique, the histology data must be precisely mapped to the imaged data. As it cannot be assumed that the histology slices are cut along the same plane as the imaged data is acquired, the registration is a 3D problem. This requires the prior accurate alignment of the histology slices. We propose a protocol to create in a rapid and standardised manner internal fiducial markers in fresh prostate specimens and an algorithm by which these markers can then be automatically detected and classified enabling the automatic rigid alignment of each slice. The protocol and algorithm were tested on 10 prostate specimens, with 19.2 histology slices on average per specimen. On average 90.9% of the fiducial markers created were visible in the slices, of which 96.1% were automatically correctly detected and classified. The average accuracy of the alignment was 0.19 +/- 0.15 mm at the fiducial markers. The algorithm took 5.46 min on average per specimen. The proposed protocol and algorithm were also tested using simulated images and a beef liver sample. The simulated images showed that the algorithm has no associated residual error and justified the choice of a rigid registration. In the beef liver images, the average accuracy of the alignment was 0.11 +/- 0.09 mm at the fiducial markers and 0.63 +/- 0.47 mm at a validation marker approximately 20 mm from the fiducial markers.

  4. Magnetic axis alignment and the Poisson alignment reference system

    NASA Astrophysics Data System (ADS)

    Griffith, Lee V.; Schenz, Richard F.; Sommargren, Gary E.

    1989-01-01

    Three distinct metrological operations are necessary to align a free-electron laser (FEL): the magnetic axis must be located, a straight line reference (SLR) must be generated, and the magnetic axis must be related to the SLR. This paper begins with a review of the motivation for developing an alignment system that will assure better than 100 micrometer accuracy in the alignment of the magnetic axis throughout an FEL. The paper describes techniques for identifying the magnetic axis of solenoids, quadrupoles, and wiggler poles. Propagation of a laser beam is described to the extent of revealing sources of nonlinearity in the beam. Development and use of the Poisson line, a diffraction effect, is described in detail. Spheres in a large-diameter laser beam create Poisson lines and thus provide a necessary mechanism for gauging between the magnetic axis and the SLR. Procedures for installing FEL components and calibrating alignment fiducials to the magnetic axes of the components are also described. An error budget shows that the Poisson alignment reference system will make it possible to meet the alignment tolerances for an FEL.

  5. A line-source method for aligning on-board and other pinhole SPECT systems

    PubMed Central

    Yan, Susu; Bowsher, James; Yin, Fang-Fang

    2013-01-01

    Purpose: In order to achieve functional and molecular imaging as patients are in position for radiation therapy, a robotic multipinhole SPECT system is being developed. Alignment of the SPECT system—to the linear accelerator (LINAC) coordinate frame and to the coordinate frames of other on-board imaging systems such as cone-beam CT (CBCT)—is essential for target localization and image reconstruction. An alignment method that utilizes line sources and one pinhole projection is proposed and investigated to achieve this goal. Potentially, this method could also be applied to the calibration of the other pinhole SPECT systems. Methods: An alignment model consisting of multiple alignment parameters was developed which maps line sources in three-dimensional (3D) space to their two-dimensional (2D) projections on the SPECT detector. In a computer-simulation study, 3D coordinates of line-sources were defined in a reference room coordinate frame, such as the LINAC coordinate frame. Corresponding 2D line-source projections were generated by computer simulation that included SPECT blurring and noise effects. The Radon transform was utilized to detect angles (α) and offsets (ρ) of the line-source projections. Alignment parameters were then estimated by a nonlinear least squares method, based on the α and ρ values and the alignment model. Alignment performance was evaluated as a function of number of line sources, Radon transform accuracy, finite line-source width, intrinsic camera resolution, Poisson noise, and acquisition geometry. Experimental evaluations were performed using a physical line-source phantom and a pinhole-collimated gamma camera attached to a robot. Results: In computer-simulation studies, when there was no error in determining angles (α) and offsets (ρ) of the measured projections, six alignment parameters (three translational and three rotational) were estimated perfectly using three line sources. When angles (α) and offsets (ρ) were provided by

  6. A line-source method for aligning on-board and other pinhole SPECT systems

    SciTech Connect

    Yan, Susu; Bowsher, James; Yin, Fang-Fang

    2013-12-15

    Purpose: In order to achieve functional and molecular imaging as patients are in position for radiation therapy, a robotic multipinhole SPECT system is being developed. Alignment of the SPECT system—to the linear accelerator (LINAC) coordinate frame and to the coordinate frames of other on-board imaging systems such as cone-beam CT (CBCT)—is essential for target localization and image reconstruction. An alignment method that utilizes line sources and one pinhole projection is proposed and investigated to achieve this goal. Potentially, this method could also be applied to the calibration of the other pinhole SPECT systems.Methods: An alignment model consisting of multiple alignment parameters was developed which maps line sources in three-dimensional (3D) space to their two-dimensional (2D) projections on the SPECT detector. In a computer-simulation study, 3D coordinates of line-sources were defined in a reference room coordinate frame, such as the LINAC coordinate frame. Corresponding 2D line-source projections were generated by computer simulation that included SPECT blurring and noise effects. The Radon transform was utilized to detect angles (α) and offsets (ρ) of the line-source projections. Alignment parameters were then estimated by a nonlinear least squares method, based on the α and ρ values and the alignment model. Alignment performance was evaluated as a function of number of line sources, Radon transform accuracy, finite line-source width, intrinsic camera resolution, Poisson noise, and acquisition geometry. Experimental evaluations were performed using a physical line-source phantom and a pinhole-collimated gamma camera attached to a robot.Results: In computer-simulation studies, when there was no error in determining angles (α) and offsets (ρ) of the measured projections, six alignment parameters (three translational and three rotational) were estimated perfectly using three line sources. When angles (α) and offsets (ρ) were provided by

  7. Optimization of segmented alignment marks for advanced semiconductor fabrication processes

    NASA Astrophysics Data System (ADS)

    Wu, Qiang; Lu, Zhijian G.; Williams, Gary; Zach, Franz X.; Liegl, Bernhard

    2001-08-01

    The continued downscaling of semiconductor fabrication ground rule has imposed increasingly tighter overlay tolerances, which becomes very challenging at the 100 nm lithographic node. Such tight tolerances will require very high performance in alignment. Past experiences indicate that good alignment depends largely on alignment signal quality, which, however, can be strongly affected by chip design and various fabrication processes. Under some extreme circumstances, they can even be reduced to the non- usable limit. Therefore, a systematic understanding of alignment marks and a method to predict alignment performance based on mark design are necessary. Motivated by this, we have performed a detailed study of bright field segmented alignment marks that are used in current state-of- the-art fabrication processes. We find that alignment marks at different lithographic levels can be organized into four basic categories: trench mark, metal mark, damascene mark, and combo mark. The basic principles of these four types of marks turn out to be so similar that they can be characterized within the theoretical framework of a simple model based on optical gratings. An analytic expression has been developed for such model and it has been tested using computer simulation with the rigorous time-domain finite- difference (TD-FD) algorithm TEMPEST. Consistent results have been obtained; indicating that mark signal can be significantly improved through the optimization of mark lateral dimensions, such as segment pitch and segment width. We have also compared simulation studies against experimental data for alignment marks at one typical lithographic level and a good agreement is found.

  8. Reinforced adaboost face detector using support vector machine

    NASA Astrophysics Data System (ADS)

    Jang, Jaeyoon; Yunkoo, C.; Jaehong, K.; Yoon, Hosub

    2014-08-01

    We propose a novel face detection algorithm in order to improve higher detection rate of face-detector than conventional haar - adaboost face detector. Our purposed method not only improves detection rate of a face but decreases the number of false-positive component. In order to get improved detection ability, we merged two classifiers: adaboost and support vector machine. Because SVM and Adaboost use different feature, they are complementary each other. We can get 2~4% improved performance using proposed method than previous our detector that is not applied proposed method. This method makes improved detector that shows better performance without algorithm replacement.

  9. Visual attitude orientation and alignment system

    NASA Technical Reports Server (NTRS)

    Beam, R. A.; Morris, D. B.

    1967-01-01

    Active vehicle optical alignment aid and a passive vehicle three-dimensional alignment target ensure proper orientation and alignment plus control of the closure range and rate between two bodies, one in controlled motion and one at rest.

  10. Laser beam alignment apparatus and method

    DOEpatents

    Gruhn, Charles R.; Hammond, Robert B.

    1981-01-01

    The disclosure relates to an apparatus and method for laser beam alignment. Thermoelectric properties of a disc in a laser beam path are used to provide an indication of beam alignment and/or automatic laser alignment.

  11. Theory of grain alignment in molecular clouds

    NASA Technical Reports Server (NTRS)

    Roberge, Wayne G.

    1993-01-01

    Research accomplishments are presented and include the following: (1) mathematical theory of grain alignment; (2) super-paramagnetic alignment of molecular cloud grains; and (3) theory of grain alignment by ambipolar diffusion.

  12. Laser beam alignment apparatus and method

    DOEpatents

    Gruhn, C.R.; Hammond, R.B.

    The disclosure related to an apparatus and method for laser beam alignment. Thermoelectric properties of a disc in a laser beam path are used to provide an indication of beam alignment and/or automatic laser alignment.

  13. Protein structure alignment beyond spatial proximity.

    PubMed

    Wang, Sheng; Ma, Jianzhu; Peng, Jian; Xu, Jinbo

    2013-01-01

    Protein structure alignment is a fundamental problem in computational structure biology. Many programs have been developed for automatic protein structure alignment, but most of them align two protein structures purely based upon geometric similarity without considering evolutionary and functional relationship. As such, these programs may generate structure alignments which are not very biologically meaningful from the evolutionary perspective. This paper presents a novel method DeepAlign for automatic pairwise protein structure alignment. DeepAlign aligns two protein structures using not only spatial proximity of equivalent residues (after rigid-body superposition), but also evolutionary relationship and hydrogen-bonding similarity. Experimental results show that DeepAlign can generate structure alignments much more consistent with manually-curated alignments than other automatic tools especially when proteins under consideration are remote homologs. These results imply that in addition to geometric similarity, evolutionary information and hydrogen-bonding similarity are essential to aligning two protein structures.

  14. Oscillator detector

    SciTech Connect

    Potter, B.M.

    1980-05-13

    An alien liquid detector employs a monitoring element and an oscillatory electronic circuit for maintaining the temperature of the monitoring element substantially above ambient temperature. The output wave form, eg., frequency of oscillation or wave shape, of the oscillatory circuit depends upon the temperaturedependent electrical characteristic of the monitoring element. A predetermined change in the output waveform allows water to be discriminated from another liquid, eg., oil. Features of the invention employing two thermistors in two oscillatory circuits include positioning one thermistor for contact with water and the other thermistor above the oil-water interface to detect a layer of oil if present. Unique oscillatory circuit arrangements are shown that achieve effective thermistor action with an economy of parts and energizing power. These include an operational amplifier employed in an astable multivibrator circuit, a discrete transistor-powered tank circuit, and use of an integrated circuit chip.

  15. Fixture for aligning motor assembly

    DOEpatents

    Shervington, Roger M.; Vaghani, Vallabh V.; Vanek, Laurence D.; Christensen, Scott A.

    2009-12-08

    An alignment fixture includes a rotor fixture, a stator fixture and a sensor system which measures a rotational displacement therebetween. The fixture precisely measures rotation of a generator stator assembly away from a NULL position referenced by a unique reference spline on the rotor shaft. By providing an adjustable location of the stator assembly within the housing, the magnetic axes within each generator shall be aligned to a predetermined and controlled tolerance between the generator interface mounting pin and the reference spline on the rotor shaft. Once magnetically aligned, each generator is essentially a line replaceable unit which may be readily mounted to any input of a multi-generator gearbox assembly with the assurance that the magnetic alignment will be within a predetermined tolerance.

  16. Well-pump alignment system

    DOEpatents

    Drumheller, D.S.

    1998-10-20

    An improved well-pump for geothermal wells, an alignment system for a well-pump, and to a method for aligning a rotor and stator within a well-pump are disclosed, wherein the well-pump has a whistle assembly formed at a bottom portion thereof, such that variations in the frequency of the whistle, indicating misalignment, may be monitored during pumping. 6 figs.

  17. In-Flight Alignment Using H∞ Filter for Strapdown INS on Aircraft

    PubMed Central

    Pei, Fu-Jun; Liu, Xuan; Zhu, Li

    2014-01-01

    In-flight alignment is an effective way to improve the accuracy and speed of initial alignment for strapdown inertial navigation system (INS). During the aircraft flight, strapdown INS alignment was disturbed by lineal and angular movements of the aircraft. To deal with the disturbances in dynamic initial alignment, a novel alignment method for SINS is investigated in this paper. In this method, an initial alignment error model of SINS in the inertial frame is established. The observability of the system is discussed by piece-wise constant system (PWCS) theory and observable degree is computed by the singular value decomposition (SVD) theory. It is demonstrated that the system is completely observable, and all the system state parameters can be estimated by optimal filter. Then a H∞ filter was designed to resolve the uncertainty of measurement noise. The simulation results demonstrate that the proposed algorithm can reach a better accuracy under the dynamic disturbance condition. PMID:24511300

  18. In-flight alignment using H ∞ filter for strapdown INS on aircraft.

    PubMed

    Pei, Fu-Jun; Liu, Xuan; Zhu, Li

    2014-01-01

    In-flight alignment is an effective way to improve the accuracy and speed of initial alignment for strapdown inertial navigation system (INS). During the aircraft flight, strapdown INS alignment was disturbed by lineal and angular movements of the aircraft. To deal with the disturbances in dynamic initial alignment, a novel alignment method for SINS is investigated in this paper. In this method, an initial alignment error model of SINS in the inertial frame is established. The observability of the system is discussed by piece-wise constant system (PWCS) theory and observable degree is computed by the singular value decomposition (SVD) theory. It is demonstrated that the system is completely observable, and all the system state parameters can be estimated by optimal filter. Then a H ∞ filter was designed to resolve the uncertainty of measurement noise. The simulation results demonstrate that the proposed algorithm can reach a better accuracy under the dynamic disturbance condition.

  19. GATA: A graphic alignment tool for comparative sequenceanalysis

    SciTech Connect

    Nix, David A.; Eisen, Michael B.

    2005-01-01

    Several problems exist with current methods used to align DNA sequences for comparative sequence analysis. Most dynamic programming algorithms assume that conserved sequence elements are collinear. This assumption appears valid when comparing orthologous protein coding sequences. Functional constraints on proteins provide strong selective pressure against sequence inversions, and minimize sequence duplications and feature shuffling. For non-coding sequences this collinearity assumption is often invalid. For example, enhancers contain clusters of transcription factor binding sites that change in number, orientation, and spacing during evolution yet the enhancer retains its activity. Dotplot analysis is often used to estimate non-coding sequence relatedness. Yet dot plots do not actually align sequences and thus cannot account well for base insertions or deletions. Moreover, they lack an adequate statistical framework for comparing sequence relatedness and are limited to pairwise comparisons. Lastly, dot plots and dynamic programming text outputs fail to provide an intuitive means for visualizing DNA alignments.

  20. Genetic algorithms

    NASA Technical Reports Server (NTRS)

    Wang, Lui; Bayer, Steven E.

    1991-01-01

    Genetic algorithms are mathematical, highly parallel, adaptive search procedures (i.e., problem solving methods) based loosely on the processes of natural genetics and Darwinian survival of the fittest. Basic genetic algorithms concepts are introduced, genetic algorithm applications are introduced, and results are presented from a project to develop a software tool that will enable the widespread use of genetic algorithm technology.

  1. Multianode Photomultiplier Tube Alignment for the MINERvA Experiment at Fermilab

    NASA Astrophysics Data System (ADS)

    Bruno, Jorge

    2006-10-01

    The MINERvA experiment (Main INjector ExpeRiment vA) at FNAL will study the neutrino-nucleon and neutrino-nucleus interaction. The light collection from the detector will be done via optic fibers using Hamamatsu H8804 64-channel photomultiplier tubes (PMT). Each PMT channel needs to be precisely aligned with the corresponding optic fiber. The MINERvA PMT optical boxes contain precision machined optic ``cookies'' which capture the 8x8 array of optic fibers. Each PMT-cookie pair needs to be aligned as precisely as possible. This contribution will describe the alignment setup and procedure implemented at James Madison University.

  2. DAPS: Database of Aligned Protein Structures

    DOE Data Explorer

    Mallick, Parag; Rice, Danny; Eisenberg, David

    DAPS is based on the FSSP, DSSP, PDB and CATH databases. There also exists a subset of DAPS known as DDAPS (also pronounced DAPS) - Database of Distant Aligned Protein Structures. It is a database of structures that have low sequence similarity but share a similar fold. There are a number of filters used to make the DDAPS list more useful. The algorithm requires that an FSSP file exists for one of the members of a pair and that the other member is listed in that FSSP file. It requires that each member of the pair be within the CATH database and share a common CAT classification. It also requires that the secondary structure can be determined by DSSP. How is DAPS constructed? We begin with the set of all chains from the current release of the PDB. An all on all search is done on the list to find pairs that have the same fold acoording to both the FSSP and CATH databases and clustered into groups by a representative structure (representative structures have less than 25% sequence identity to each other). For each protein pair, regions aligned by the DALI program are extracted from the corresponding FSSP file, or recomputed using DALI-lite. In domain DAPS, only regions that are called "domains" by CATH are included in the alignment. The amino acid type, secondary structure type, and solvent accessibility are extracted from the DSSP file and written pairwise into the database. DAPS is updated with updates of CATH.[Taken from http://nihserver.mbi.ucla.edu/DAPS/daps_help.html

  3. Optimizing the beam-beam alignment in an electron lens using bremsstrahlung

    SciTech Connect

    Montag, C.; Fischer, W.; Gassner, D.; Thieberger, P.; Haug, E.

    2010-05-23

    Installation of electron lenses for the purpose of head-on beam-beam compensation is foreseen at RHIC. To optimize the relative alignment of the electron lens beam with the circulating proton (or ion) beam, photon detectors will be installed to measure the bremsstrahlung generated by momentum transfer from protons to electrons. We present the detector layout and simulations of the bremsstrahlung signal as function of beam offset and crossing angle.

  4. Local graph alignment and motif search in biological networks

    NASA Astrophysics Data System (ADS)

    Berg, Johannes; Lässig, Michael

    2004-10-01

    Interaction networks are of central importance in postgenomic molecular biology, with increasing amounts of data becoming available by high-throughput methods. Examples are gene regulatory networks or protein interaction maps. The main challenge in the analysis of these data is to read off biological functions from the topology of the network. Topological motifs, i.e., patterns occurring repeatedly at different positions in the network, have recently been identified as basic modules of molecular information processing. In this article, we discuss motifs derived from families of mutually similar but not necessarily identical patterns. We establish a statistical model for the occurrence of such motifs, from which we derive a scoring function for their statistical significance. Based on this scoring function, we develop a search algorithm for topological motifs called graph alignment, a procedure with some analogies to sequence alignment. The algorithm is applied to the gene regulation network of Escherichia coli.

  5. Current Methods for Automated Filtering of Multiple Sequence Alignments Frequently Worsen Single-Gene Phylogenetic Inference

    PubMed Central

    Tan, Ge; Muffato, Matthieu; Ledergerber, Christian; Herrero, Javier; Goldman, Nick; Gil, Manuel; Dessimoz, Christophe

    2015-01-01

    Phylogenetic inference is generally performed on the basis of multiple sequence alignments (MSA). Because errors in an alignment can lead to errors in tree estimation, there is a strong interest in identifying and removing unreliable parts of the alignment. In recent years several automated filtering approaches have been proposed, but despite their popularity, a systematic and comprehensive comparison of different alignment filtering methods on real data has been lacking. Here, we extend and apply recently introduced phylogenetic tests of alignment accuracy on a large number of gene families and contrast the performance of unfiltered versus filtered alignments in the context of single-gene phylogeny reconstruction. Based on multiple genome-wide empirical and simulated data sets, we show that the trees obtained from filtered MSAs are on average worse than those obtained from unfiltered MSAs. Furthermore, alignment filtering often leads to an increase in the proportion of well-supported branches that are actually wrong. We confirm that our findings hold for a wide range of parameters and methods. Although our results suggest that light filtering (up to 20% of alignment positions) has little impact on tree accuracy and may save some computation time, contrary to widespread practice, we do not generally recommend the use of current alignment filtering methods for phylogenetic inference. By providing a way to rigorously and systematically measure the impact of filtering on alignments, the methodology set forth here will guide the development of better filtering algorithms. PMID:26031838

  6. C-GRAAL: common-neighbors-based global GRAph ALignment of biological networks.

    PubMed

    Memišević, Vesna; Pržulj, Nataša

    2012-07-01

    Networks are an invaluable framework for modeling biological systems. Analyzing protein-protein interaction (PPI) networks can provide insight into underlying cellular processes. It is expected that comparison and alignment of biological networks will have a similar impact on our understanding of evolution, biological function, and disease as did sequence comparison and alignment. Here, we introduce a novel pairwise global alignment algorithm called Common-neighbors based GRAph ALigner (C-GRAAL) that uses heuristics for maximizing the number of aligned edges between two networks and is based solely on network topology. As such, it can be applied to any type of network, such as social, transportation, or electrical networks. We apply C-GRAAL to align PPI networks of eukaryotic and prokaryotic species, as well as inter-species PPI networks, and we demonstrate that the resulting alignments expose large connected and functionally topologically aligned regions. We use the resulting alignments to transfer biological knowledge across species, successfully validating many of the predictions. Moreover, we show that C-GRAAL can be used to align human-pathogen inter-species PPI networks and that it can identify patterns of pathogen interactions with host proteins solely from network topology.

  7. Current Methods for Automated Filtering of Multiple Sequence Alignments Frequently Worsen Single-Gene Phylogenetic Inference.

    PubMed

    Tan, Ge; Muffato, Matthieu; Ledergerber, Christian; Herrero, Javier; Goldman, Nick; Gil, Manuel; Dessimoz, Christophe

    2015-09-01

    Phylogenetic inference is generally performed on the basis of multiple sequence alignments (MSA). Because errors in an alignment can lead to errors in tree estimation, there is a strong interest in identifying and removing unreliable parts of the alignment. In recent years several automated filtering approaches have been proposed, but despite their popularity, a systematic and comprehensive comparison of different alignment filtering methods on real data has been lacking. Here, we extend and apply recently introduced phylogenetic tests of alignment accuracy on a large number of gene families and contrast the performance of unfiltered versus filtered alignments in the context of single-gene phylogeny reconstruction. Based on multiple genome-wide empirical and simulated data sets, we show that the trees obtained from filtered MSAs are on average worse than those obtained from unfiltered MSAs. Furthermore, alignment filtering often leads to an increase in the proportion of well-supported branches that are actually wrong. We confirm that our findings hold for a wide range of parameters and methods. Although our results suggest that light filtering (up to 20% of alignment positions) has little impact on tree accuracy and may save some computation time, contrary to widespread practice, we do not generally recommend the use of current alignment filtering methods for phylogenetic inference. By providing a way to rigorously and systematically measure the impact of filtering on alignments, the methodology set forth here will guide the development of better filtering algorithms. PMID:26031838

  8. Quadrupole Beam-Based Alignment in the RHIC Interaction Regions

    SciTech Connect

    T. Satogata, J. Ziegler

    2011-03-01

    Continued beam-based alignment (BBA) efforts have provided significant benefit to both heavy ion and polarized proton operations at RHIC. Recent studies demonstrated previously unknown systematic beam position monitor (BPM) offset errors and produced accurate measurements of individual BPM offsets in the experiment interaction regions. Here we describe the algorithm used to collect and analyze data during the 2010 and early 2011 RHIC runs and the results of these measurements.

  9. Shape-based discriminative analysis of combined bilateral hippocampi using multiple object alignment

    NASA Astrophysics Data System (ADS)

    Shen, Li; Makedon, Fillia; Saykin, Andrew

    2004-05-01

    Shape analysis of hippocampi in schizophrenia has been preformed previously using the spherical harmonic SPHARM description. In these studies, the left and right hippocampi are aligned independently and the spatial relation between them is not explored. This paper presents a new SPHARM-based technique which examines not only the individual shape information of the two hippocampi but also the spatial relation between them. The left and right hippocampi are treated as a single shape configuration. A ploy-shape alignment algorithm is developed for aligning configurations of multiple SPHARM surfaces as follows: (1) the total volume is normalized; (2) the parameter space is aligned for creating the surface correspondence; (3) landmarks are created by a uniform sampling of multiple surfaces for each configuration; (4) a quaternion-based algorithm is employed to align each landmark representation to the mean configuration through the least square rotation and translation iteratively until the mean converges. After applying the poly-shape alignment algorithm, a point distribution model is applied to aligned landmarks for feature extraction. Classification is performed using Fisher's linear discriminant with an effective feature selection scheme. Applying the above procedure to our hippocampal data (14 controls versus 25 schizophrenics, all right-handed males), we achieve the best cross-validation accuracy of 92%, supporting the idea that the whole shape configuration of the two hippocampi provides valuable information in detecting schizophrenia. The results of an ROC analysis and a visualization of discriminative patterns are also included.

  10. Optical Device for Converting a Laser Beam into Two Co-aligned but Oppositely Directed Beams

    NASA Technical Reports Server (NTRS)

    Jennings, Donald

    2013-01-01

    Optical systems consisting of a series of optical elements require alignment from the input end to the output end. The optical elements can be mirrors, lenses, sources, detectors, or other devices. Complex optical systems are often difficult to align from end-to-end because the alignment beam must be inserted at one end in order for the beam to traverse the entire optical path to the other end. The ends of the optical train may not be easily accessible to the alignment beam. Typically, when a series of optical elements is to be aligned, an alignment laser beam is inserted into the optical path with a pick-off mirror at one end of the series of elements. But it may be impossible to insert the beam at an end-point. It can be difficult to locate the pick-off mirror at the desired position because there is not enough space, there is no mounting surface, or the location is occupied by a source, detector, or other component. Alternatively, the laser beam might be inserted at an intermediate location (not at an end-point) and sent, first in one direction and then the other, to the opposite ends of the optical system for alignment. However, in this case, alignment must be performed in two directions and extra effort is required to co-align the two beams to make them parallel and coincident, i.e., to follow the same path as an end-to-end beam. An optical device has been developed that accepts a laser beam as input and produces two co-aligned, but counter-propagating beams. In contrast to a conventional alignment laser placed at one end of the optical path, this invention can be placed at a convenient position within the optical train and aligned to send its two beams simultaneously along precisely opposite paths that, taken together, trace out exactly the same path as the conventional alignment laser. This invention allows the user the freedom to choose locations within the optical train for placement of the alignment beam. It is also self-aligned by design and requires

  11. Interactive display system having a matrix optical detector

    DOEpatents

    Veligdan, James T.; DeSanto, Leonard

    2007-01-23

    A display system includes a waveguide optical panel having an inlet face and an opposite outlet face. An image beam is projected across the inlet face laterally and transversely for display on the outlet face. An optical detector including a matrix of detector elements is optically aligned with the inlet face for detecting a corresponding lateral and transverse position of an inbound light spot on the outlet face.

  12. Evaluating the Accuracy and Efficiency of Multiple Sequence Alignment Methods

    PubMed Central

    Pervez, Muhammad Tariq; Babar, Masroor Ellahi; Nadeem, Asif; Aslam, Muhammad; Awan, Ali Raza; Aslam, Naeem; Hussain, Tanveer; Naveed, Nasir; Qadri, Salman; Waheed, Usman; Shoaib, Muhammad

    2014-01-01

    A comparison of 10 most popular Multiple Sequence Alignment (MSA) tools, namely, MUSCLE, MAFFT(L-INS-i), MAFFT (FFT-NS-2), T-Coffee, ProbCons, SATe, Clustal Omega, Kalign, Multalin, and Dialign-TX is presented. We also focused on the significance of some implementations embedded in algorithm of each tool. Based on 10 simulated trees of different number of taxa generated by R, 400 known alignments and sequence files were constructed using indel-Seq-Gen. A total of 4000 test alignments were generated to study the effect of sequence length, indel size, deletion rate, and insertion rate. Results showed that alignment quality was highly dependent on the number of deletions and insertions in the sequences and that the sequence length and indel size had a weaker effect. Overall, ProbCons was consistently on the top of list of the evaluated MSA tools. SATe, being little less accurate, was 529.10% faster than ProbCons and 236.72% faster than MAFFT(L-INS-i). Among other tools, Kalign and MUSCLE achieved the highest sum of pairs. We also considered BALiBASE benchmark datasets and the results relative to BAliBASE- and indel-Seq-Gen-generated alignments were consistent in the most cases. PMID:25574120

  13. Evaluating the accuracy and efficiency of multiple sequence alignment methods.

    PubMed

    Pervez, Muhammad Tariq; Babar, Masroor Ellahi; Nadeem, Asif; Aslam, Muhammad; Awan, Ali Raza; Aslam, Naeem; Hussain, Tanveer; Naveed, Nasir; Qadri, Salman; Waheed, Usman; Shoaib, Muhammad

    2014-01-01

    A comparison of 10 most popular Multiple Sequence Alignment (MSA) tools, namely, MUSCLE, MAFFT(L-INS-i), MAFFT (FFT-NS-2), T-Coffee, ProbCons, SATe, Clustal Omega, Kalign, Multalin, and Dialign-TX is presented. We also focused on the significance of some implementations embedded in algorithm of each tool. Based on 10 simulated trees of different number of taxa generated by R, 400 known alignments and sequence files were constructed using indel-Seq-Gen. A total of 4000 test alignments were generated to study the effect of sequence length, indel size, deletion rate, and insertion rate. Results showed that alignment quality was highly dependent on the number of deletions and insertions in the sequences and that the sequence length and indel size had a weaker effect. Overall, ProbCons was consistently on the top of list of the evaluated MSA tools. SATe, being little less accurate, was 529.10% faster than ProbCons and 236.72% faster than MAFFT(L-INS-i). Among other tools, Kalign and MUSCLE achieved the highest sum of pairs. We also considered BALiBASE benchmark datasets and the results relative to BAliBASE- and indel-Seq-Gen-generated alignments were consistent in the most cases.

  14. CLEMAPS: multiple alignment of protein structures based on conformational letters.

    PubMed

    Liu, Xin; Zhao, Ya-Pu; Zheng, Wei-Mou

    2008-05-01

    CLEMAPS is a tool for multiple alignment of protein structures. It distinguishes itself from other existing algorithms for multiple structure alignment by the use of conformational letters, which are discretized states of 3D segmental structural states. A letter corresponds to a cluster of combinations of three angles formed by C(alpha) pseudobonds of four contiguous residues. A substitution matrix called CLESUM is available to measure the similarity between any two such letters. The input 3D structures are first converted to sequences of conformational letters. Each string of a fixed length is then taken as the center seed to search other sequences for neighbors of the seed, which are strings similar to the seed. A seed and its neighbors form a center-star, which corresponds to a fragment set of local structural similarity shared by many proteins. The detection of center-stars using CLESUM is extremely efficient. Local similarity is a necessary, but insufficient, condition for structural alignment. Once center-stars are found, the spatial consistency between any two stars are examined to find consistent star duads using atomic coordinates. Consistent duads are later joined to create a core for multiple alignment, which is further polished to produce the final alignment. The utility of CLEMAPS is tested on various protein structure ensembles.

  15. On the alignment of shapes represented by Fourier descriptors

    NASA Astrophysics Data System (ADS)

    Sjöstrand, Karl; Ericsson, Anders; Larsen, Rasmus

    2006-03-01

    The representation of shapes by Fourier descriptors is a time-honored technique that has received relatively little attention lately. Nevertheless, it has its benefits and is suitable for describing a range of medical structures in two dimensions. Delineations in medical applications often consist of continuous outlines of structures, where no information of correspondence between samples exist. In this article, we discuss a Euclidean alignment method that works directly with the functional representation of Fourier descriptors, and that is optimal in a least-squares sense. With corresponding starting points, the alignment of one shape onto another consists of a single expression. If the starting points are arbitrary, we present a simple algorithm to bring a set of shapes into correspondence. Results are given for three different data sets; 62 outlines of the corpus callosum brain structure, 61 outlines of the brain ventricles, and 50 outlines of the right lung. The results show that even though starting points, translations, rotations and scales have been randomized, the alignment succeeds in all cases. As an application of the proposed method, we show how high-quality shape models represented by common landmarks can be constructed in an automatic fashion. If the aligned Fourier descriptors are inverse transformed from the frequency domain to the spatial domain, a set of roughly aligned landmarks are obtained. The positions of these are then adjusted along the contour of the objects using the minimum description length criterion, producing ample correspondences. Results on this are also presented for all three data sets.

  16. Local coordinates alignment with global preservation for dimensionality reduction.

    PubMed

    Chen, Jing; Ma, Zhengming; Liu, Yang

    2013-01-01

    Dimensionality reduction is vital in many fields, and alignment-based methods for nonlinear dimensionality reduction have become popular recently because they can map the high-dimensional data into a low-dimensional subspace with the property of local isometry. However, the relationships between patches in original high-dimensional space cannot be ensured to be fully preserved during the alignment process. In this paper, we propose a novel method for nonlinear dimensionality reduction called local coordinates alignment with global preservation. We first introduce a reasonable definition of topology-preserving landmarks (TPLs), which not only contribute to preserving the global structure of datasets and constructing a collection of overlapping linear patches, but they also ensure that the right landmark is allocated to the new test point. Then, an existing method for dimensionality reduction that has good performance in preserving the global structure is used to derive the low-dimensional coordinates of TPLs. Local coordinates of each patch are derived using tangent space of the manifold at the corresponding landmark, and then these local coordinates are aligned into a global coordinate space with the set of landmarks in low-dimensional space as reference points. The proposed alignment method, called landmarks-based alignment, can produce a closed-form solution without any constraints, while most previous alignment-based methods impose the unit covariance constraint, which will result in the deficiency of global metrics and undesired rescaling of the manifold. Experiments on both synthetic and real-world datasets demonstrate the effectiveness of the proposed algorithm.

  17. DIDA: Distributed Indexing Dispatched Alignment

    PubMed Central

    Mohamadi, Hamid; Vandervalk, Benjamin P; Raymond, Anthony; Jackman, Shaun D; Chu, Justin; Breshears, Clay P; Birol, Inanc

    2015-01-01

    One essential application in bioinformatics that is affected by the high-throughput sequencing data deluge is the sequence alignment problem, where nucleotide or amino acid sequences are queried against targets to find regions of close similarity. When queries are too many and/or targets are too large, the alignment process becomes computationally challenging. This is usually addressed by preprocessing techniques, where the queries and/or targets are indexed for easy access while searching for matches. When the target is static, such as in an established reference genome, the cost of indexing is amortized by reusing the generated index. However, when the targets are non-static, such as contigs in the intermediate steps of a de novo assembly process, a new index must be computed for each run. To address such scalability problems, we present DIDA, a novel framework that distributes the indexing and alignment tasks into smaller subtasks over a cluster of compute nodes. It provides a workflow beyond the common practice of embarrassingly parallel implementations. DIDA is a cost-effective, scalable and modular framework for the sequence alignment problem in terms of memory usage and runtime. It can be employed in large-scale alignments to draft genomes and intermediate stages of de novo assembly runs. The DIDA source code, sample files and user manual are available through http://www.bcgsc.ca/platform/bioinfo/software/dida. The software is released under the British Columbia Cancer Agency License (BCCA), and is free for academic use. PMID:25923767

  18. Alignment of a three-mirror anastigmatic telescope using nodal aberration theory.

    PubMed

    Gu, Zhiyuan; Yan, Changxiang; Wang, Yang

    2015-09-21

    Most computer-aided alignment methods for optical systems are based on numerical algorithms at present, which omit aberration theory. This paper presents a novel alignment algorithm for three-mirror anastigmatic (TMA) telescopes using Nodal Aberration Theory (NAT). The aberration field decenter vectors and boresight error of misaligned TMA telescopes are derived. Two alignment models based on 3rd and 5th order NAT are established successively and compared in the same alignment example. It is found that the average and the maximum RMS wavefront errors in the whole field of view of 0.3° × 0.15° are 0.063 λ (λ = 1 μm) and 0.068 λ respectively after the 4th alignment action with the 3rd order model, and 0.011 λ and 0.025 λ (nominal values) respectively after the 3rd alignment action with the 5th order model. Monte-Carlo alignment simulations are carried out with the 5th order model. It shows that the 5th order model still has good performance even when the misalignment variables are large (-1 mm≤linear misalignment≤1 mm, -0.1°≤angular misalignment≤0.1°), and multiple iterative alignments are needed when the misalignment variables increase. PMID:26406716

  19. A Vondrak Low Pass Filter for IMU Sensor Initial Alignment on a Disturbed Base

    PubMed Central

    Li, Zengke; Wang, Jian; Gao, Jingxiang; Li, Binghao; Zhou, Feng

    2014-01-01

    The initial alignment of the Inertial Measurement Unit (IMU) is an important process of INS to determine the coordinate transformation matrix which is used in the integration of Global Positioning Systems (GPS) with Inertial Navigation Systems (INS). In this paper a novel alignment method for a disturbed base, such as a vehicle disturbed by wind outdoors, implemented with the aid of a Vondrak low pass filter, is proposed. The basic principle of initial alignment including coarse alignment and fine alignment is introduced first. The spectral analysis is processed to compare the differences between the characteristic error of INS force observation on a stationary base and on disturbed bases. In order to reduce the high frequency noise in the force observation more accurately and more easily, a Vondrak low pass filter is constructed based on the spectral analysis result. The genetic algorithms method is introduced to choose the smoothing factor in the Vondrak filter and the corresponding objective condition is built. The architecture of the proposed alignment method with the Vondrak low pass filter is shown. Furthermore, simulated experiments and actual experiments were performed to validate the new algorithm. The results indicate that, compared with the conventional alignment method, the Vondrak filter could eliminate the high frequency noise in the force observation and the proposed alignment method could improve the attitude accuracy. At the same time, only one parameter needs to be set, which makes the proposed method easier to implement than other low-pass filter methods. PMID:25513826

  20. Alignment of a three-mirror anastigmatic telescope using nodal aberration theory.

    PubMed

    Gu, Zhiyuan; Yan, Changxiang; Wang, Yang

    2015-09-21

    Most computer-aided alignment methods for optical systems are based on numerical algorithms at present, which omit aberration theory. This paper presents a novel alignment algorithm for three-mirror anastigmatic (TMA) telescopes using Nodal Aberration Theory (NAT). The aberration field decenter vectors and boresight error of misaligned TMA telescopes are derived. Two alignment models based on 3rd and 5th order NAT are established successively and compared in the same alignment example. It is found that the average and the maximum RMS wavefront errors in the whole field of view of 0.3° × 0.15° are 0.063 λ (λ = 1 μm) and 0.068 λ respectively after the 4th alignment action with the 3rd order model, and 0.011 λ and 0.025 λ (nominal values) respectively after the 3rd alignment action with the 5th order model. Monte-Carlo alignment simulations are carried out with the 5th order model. It shows that the 5th order model still has good performance even when the misalignment variables are large (-1 mm≤linear misalignment≤1 mm, -0.1°≤angular misalignment≤0.1°), and multiple iterative alignments are needed when the misalignment variables increase.

  1. Detector simulation needs for detector designers

    SciTech Connect

    Hanson, G.G.

    1987-11-01

    Computer simulation of the components of SSC detectors and of the complete detectors will be very important for the designs of the detectors. The ratio of events from interesting physics to events from background processes is very low, so detailed understanding of detector response to the backgrounds is needed. Any large detector for the SSC will be very complex and expensive and every effort must be made to design detectors which will have excellent performance and will not have to undergo major rebuilding. Some areas in which computer simulation is particularly needed are pattern recognition in tracking detectors and development of shower simulation code which can be trusted as an aid in the design and optimization of calorimeters, including their electron identification performance. Existing codes require too much computer time to be practical and need to be compared with test beam data at energies of several hundred GeV. Computer simulation of the processing of the data, including electronics response to the signals from the detector components, processing of the data by microprocessors on the detector, the trigger, and data acquisition will be required. In this report we discuss the detector simulation needs for detector designers.

  2. Global Alignment System for Large Genomic Sequencing

    2002-03-01

    AVID is a global alignment system tailored for the alignment of large genomic sequences up to megabases in length. Features include the possibility of one sequence being in draft form, fast alignment, robustness and accuracy. The method is an anchor based alignment using maximal matches derived from suffix trees.

  3. Photosensitive Polymers for Liquid Crystal Alignment

    NASA Astrophysics Data System (ADS)

    Mahilny, U. V.; Stankevich, A. I.; Trofimova, A. V.; Muravsky, A. A.; Murauski, A. A.

    The peculiarities of alignment of liquid crystal (LC) materials by the layers of photocrosslinkable polymers with side benzaldehyde groups are considered. The investigation of mechanism of photostimulated alignment by rubbed benzaldehyde layer is performed. The methods of creation of multidomain aligning layers on the basis of photostimulated rubbing alignment are described.

  4. Alignment method for parabolic trough solar concentrators

    DOEpatents

    Diver, Richard B.

    2010-02-23

    A Theoretical Overlay Photographic (TOP) alignment method uses the overlay of a theoretical projected image of a perfectly aligned concentrator on a photographic image of the concentrator to align the mirror facets of a parabolic trough solar concentrator. The alignment method is practical and straightforward, and inherently aligns the mirror facets to the receiver. When integrated with clinometer measurements for which gravity and mechanical drag effects have been accounted for and which are made in a manner and location consistent with the alignment method, all of the mirrors on a common drive can be aligned and optimized for any concentrator orientation.

  5. Combining Multiple Pairwise Structure-based Alignments

    SciTech Connect

    2014-11-12

    CombAlign is a new Python code that generates a gapped, one-to-many, multiple structure-based sequence alignment(MSSA) given a set of pairwise structure-based alignments. In order to better define regions of similarity among related protein structures, it is useful to detect the residue-residue correspondences among a set of pairwise structure alignments. Few codes exist for constructing a one-to-many, multiple sequence alignment derived from a set of structure alignments, and we perceived a need for creating a new tool for combing pairwise structure alignments that would allow for insertion of gaps in the reference structure.

  6. Grain Alignment in Starless Cores

    NASA Astrophysics Data System (ADS)

    Jones, T. J.; Bagley, M.; Krejny, M.; Andersson, B.-G.; Bastien, P.

    2015-01-01

    We present near-IR polarimetry data of background stars shining through a selection of starless cores taken in the K band, probing visual extinctions up to {{A}V}˜ 48. We find that {{P}K}/{{τ }K} continues to decline with increasing AV with a power law slope of roughly -0.5. Examination of published submillimeter (submm) polarimetry of starless cores suggests that by {{A}V}≳ 20 the slope for P versus τ becomes ˜-1, indicating no grain alignment at greater optical depths. Combining these two data sets, we find good evidence that, in the absence of a central illuminating source, the dust grains in dense molecular cloud cores with no internal radiation source cease to become aligned with the local magnetic field at optical depths greater than {{A}V}˜ 20. A simple model relating the alignment efficiency to the optical depth into the cloud reproduces the observations well.

  7. Transformation and alignment in similarity.

    PubMed

    Hodgetts, Carl J; Hahn, Ulrike; Chater, Nick

    2009-10-01

    This paper contrasts two structural accounts of psychological similarity: structural alignment (SA) and Representational Distortion (RD). SA proposes that similarity is determined by how readily the structures of two objects can be brought into alignment; RD measures similarity by the complexity of the transformation that "distorts" one representation into the other. We assess RD by defining a simple coding scheme of psychological transformations for the experimental materials. In two experiments, this "concrete" version of RD provides compelling fits of the data and compares favourably with SA. Finally, stepping back from particular models, we argue that perceptual theory suggests that transformations and alignment processes should generally be viewed as complementary, in contrast to the current distinction in the literature. PMID:19720370

  8. Spiral silicon drift detectors

    SciTech Connect

    Rehak, P.; Gatti, E.; Longoni, A.; Sampietro, M.; Holl, P.; Lutz, G.; Kemmer, J.; Prechtel, U.; Ziemann, T.

    1988-01-01

    An advanced large area silicon photodiode (and x-ray detector), called Spiral Drift Detector, was designed, produced and tested. The Spiral Detector belongs to the family of silicon drift detectors and is an improvement of the well known Cylindrical Drift Detector. In both detectors, signal electrons created in silicon by fast charged particles or photons are drifting toward a practically point-like collection anode. The capacitance of the anode is therefore kept at the minimum (0.1pF). The concentric rings of the cylindrical detector are replaced by a continuous spiral in the new detector. The spiral geometry detector design leads to a decrease of the detector leakage current. In the spiral detector all electrons generated at the silicon-silicon oxide interface are collected on a guard sink rather than contributing to the detector leakage current. The decrease of the leakage current reduces the parallel noise of the detector. This decrease of the leakage current and the very small capacities of the detector anode with a capacitively matched preamplifier may improve the energy resolution of Spiral Drift Detectors operating at room temperature down to about 50 electrons rms. This resolution is in the range attainable at present only by cooled semiconductor detectors. 5 refs., 10 figs.

  9. Sun sensor boresight alignment testing for the Halogen Occultation Experiment

    NASA Technical Reports Server (NTRS)

    Moore, A. S.; Laney, V. S.; Mauldin, L. E., III

    1987-01-01

    The boresight alignment testing for the sun sensor assembly on the Halogen Occultation Experiment (HALOE) is described. The sun sensor assembly consists of three sensors that provide feedback signals for controlling dual axes gimbals. Two energy balancing silicon detectors are operated as wideband sensors in the azimuth and elevation axes. The third sensor is a silicon photodiode array operated as a narrow-band sensor in the elevation axis. These sensors are mounted on a common Invar structure which is mounted to the HALOE telescope. A blackbody was used as the stimulating source to perform the initial boresight alignment and this was checked with a heliostat solar look and a direct solar look. These tests are explained with a comparison between each source used.

  10. Aligning a Receiving Antenna Array to Reduce Interference

    NASA Technical Reports Server (NTRS)

    Jongeling, Andre P.; Rogstad, David H.

    2009-01-01

    A digital signal-processing algorithm has been devised as a means of aligning (as defined below) the outputs of multiple receiving radio antennas in a large array for the purpose of receiving a desired weak signal transmitted by a single distant source in the presence of an interfering signal that (1) originates at another source lying within the antenna beam and (2) occupies a frequency band significantly wider than that of the desired signal. In the original intended application of the algorithm, the desired weak signal is a spacecraft telemetry signal, the antennas are spacecraft-tracking antennas in NASA s Deep Space Network, and the source of the wide-band interfering signal is typically a radio galaxy or a planet that lies along or near the line of sight to the spacecraft. The algorithm could also afford the ability to discriminate between desired narrow-band and nearby undesired wide-band sources in related applications that include satellite and terrestrial radio communications and radio astronomy. The development of the present algorithm involved modification of a prior algorithm called SUMPLE and a predecessor called SIMPLE. SUMPLE was described in Algorithm for Aligning an Array of Receiving Radio Antennas (NPO-40574), NASA Tech Briefs Vol. 30, No. 4 (April 2006), page 54. To recapitulate: As used here, aligning signifies adjusting the delays and phases of the outputs from the various antennas so that their relatively weak replicas of the desired signal can be added coherently to increase the signal-to-noise ratio (SNR) for improved reception, as though one had a single larger antenna. Prior to the development of SUMPLE, it was common practice to effect alignment by means of a process that involves correlation of signals in pairs. SIMPLE is an example of an algorithm that effects such a process. SUMPLE also involves correlations, but the correlations are not performed in pairs. Instead, in a partly iterative process, each signal is appropriately weighted

  11. Measurements of magnetic field alignment

    SciTech Connect

    Kuchnir, M.; Schmidt, E.E.

    1987-11-06

    The procedure for installing Superconducting Super Collider (SSC) dipoles in their respective cryostats involves aligning the average direction of their field with the vertical to an accuracy of 0.5 mrad. The equipment developed for carrying on these measurements is described and the measurements performed on the first few prototypes SSC magnets are presented. The field angle as a function of position in these 16.6 m long magnets is a characteristic of the individual magnet with possible feedback information to its manufacturing procedure. A comparison of this vertical alignment characteristic with a magnetic field intensity (by NMR) characteristic for one of the prototypes is also presented. 5 refs., 7 figs.

  12. Alignment Tool For Inertia Welding

    NASA Technical Reports Server (NTRS)

    Snyder, Gary L.

    1991-01-01

    Compact, easy-to-use tool aligns drive bar of inertia welder over hole in stub. Ensures drive bar concentric to hole within 0.002 in. (0.051 mm.). Holds two batteries and light bulb. Electrical circuit completed, providing current to bulb when pin in contact with post. When pin centered in post hole, it does not touch post, and lamp turns off. Built for use in making repair welds on liquid-oxygen-injector posts in Space Shuttle main engine. Version having suitably modified dimensions used to facilitate alignment in other forests of post.

  13. XUV ionization of aligned molecules

    NASA Astrophysics Data System (ADS)

    Kelkensberg, F.; Rouzée, A.; Siu, W.; Gademann, G.; Johnsson, P.; Lucchini, M.; Lucchese, R. R.; Vrakking, M. J. J.

    2011-11-01

    New extreme-ultraviolet (XUV) light sources such as high-order-harmonic generation (HHG) and free-electron lasers (FELs), combined with laser-induced alignment techniques, enable novel methods for making molecular movies based on measuring molecular frame photoelectron angular distributions. Experiments are presented where CO2 molecules were impulsively aligned using a near-infrared laser and ionized using femtosecond XUV pulses obtained by HHG. Measured electron angular distributions reveal contributions from four orbitals and the onset of the influence of the molecular structure.

  14. XUV ionization of aligned molecules

    SciTech Connect

    Kelkensberg, F.; Siu, W.; Gademann, G.; Rouzee, A.; Vrakking, M. J. J.; Johnsson, P.; Lucchini, M.; Lucchese, R. R.

    2011-11-15

    New extreme-ultraviolet (XUV) light sources such as high-order-harmonic generation (HHG) and free-electron lasers (FELs), combined with laser-induced alignment techniques, enable novel methods for making molecular movies based on measuring molecular frame photoelectron angular distributions. Experiments are presented where CO{sub 2} molecules were impulsively aligned using a near-infrared laser and ionized using femtosecond XUV pulses obtained by HHG. Measured electron angular distributions reveal contributions from four orbitals and the onset of the influence of the molecular structure.

  15. Comparative evaluation of eight software programs for alignment of gas chromatography-mass spectrometry chromatograms in metabolomics experiments.

    PubMed

    Niu, Weihuan; Knight, Elisa; Xia, Qingyou; McGarvey, Brian D

    2014-12-29

    Since retention times of compounds in GC-MS chromatograms always vary slightly from chromatogram to chromatogram, it is necessary to align chromatograms before comparing them in metabolomics experiments. Several software programs have been developed to automate this process. Here we report a comparative evaluation of the performance of eight programs using prepared samples of mixtures of chemicals, and an extract of tomato vines spiked with three concentrations of a mixture of alkanes. The programs included in the comparison were SpectConnect, MetaboliteDetector 2.01a, MetAlign 041012, MZmine 2.0, TagFinder 04, XCMS Online 1.21.01, MeltDB and GAVIN. Samples were analyzed by GC-MS, chromatograms were aligned using the selected programs, and the resulting data matrices were preprocessed and submitted to principal components analysis. In the first trial, SpectConnect, MetAlign and MetaboliteDetector correctly identified ≥90% of the true positives. In the second trial, MetAlign and MetaboliteDetector correctly identified 87% and 81% of the true positives, respectively. In addition, in both trials >90% of the peaks identified by MetAlign and MetaboliteDetector were true positives. PMID:25435458

  16. Optimization and improvement of FOA corner cube algorithm

    NASA Astrophysics Data System (ADS)

    McClay, Wilbert A., III; Awwal, Abdul A. S.; Burkhart, Scott C.; Candy, James V.

    2004-11-01

    Alignment of laser beams based on video images is a crucial task necessary to automate operation of the 192 beams at the National Ignition Facility (NIF). The final optics assembly (FOA) is the optical element that aligns the beam into the target chamber. This work presents an algorithm for determining the position of a corner cube alignment image in the final optics assembly. The improved algorithm was compared to the existing FOA algorithm on 900 noise-simulated images. While the existing FOA algorithm based on correlation with a synthetic template has a radial standard deviation of 1 pixel, the new algorithm based on classical matched filtering (CMF) and polynomial fit to the correlation peak improves the radial standard deviation performance to less than 0.3 pixels. In the new algorithm the templates are designed from real data stored during a year of actual operation.

  17. Optimization and Improvement of FOA Corner Cube Algorithm

    SciTech Connect

    McClay, W A; Awwal, A S; Burkhart, S C; Candy, J V

    2004-10-01

    Alignment of laser beams based on video images is a crucial task necessary to automate operation of the 192 beams at the National Ignition Facility (NIF). The final optics assembly (FOA) is the optical element that aligns the beam into the target chamber. This work presents an algorithm for determining the position of a corner cube alignment image in the final optics assembly. The improved algorithm was compared to the existing FOA algorithm on 900 noise-simulated images. While the existing FOA algorithm based on correlation with a synthetic template has a radial standard deviation of 1 pixel, the new algorithm based on classical matched filtering (CMF) and polynomial fit to the correlation peak improves the radial standard deviation performance to less than 0.3 pixels. In the new algorithm the templates are designed from real data stored during a year of actual operation.

  18. Aligned selenium microtubes array: Synthesis, growth mechanism and photoelectrical properties

    NASA Astrophysics Data System (ADS)

    Filippo, Emanuela; Manno, Daniela; Serra, Antonio

    2011-06-01

    Aligned selenium microtubes array vertically grown on a silicon substrate was synthesized in a tubular furnace under argon flow at an evaporation temperature of 300 °C. The microtubes were characterized by Raman spectroscopy, X-ray diffraction, UV-vis spectroscopy, scanning and transmission electron microscopy. The photoelectrical properties of the microtube array with light were investigated. It was found a stable relative increase of the conductivity by 180% when the sample was taken from the dark and exposed with tungsten light and a sharp on/off switching behavior. These results hold promise for the fabrication of microtubes-detector arrays.

  19. Seed selection strategy in global network alignment without destroying the entire structures of functional modules

    PubMed Central

    2012-01-01

    Background Network alignment is one of the most common biological network comparison methods. Aligning protein-protein interaction (PPI) networks of different species is of great important to detect evolutionary conserved pathways or protein complexes across species through the identification of conserved interactions, and to improve our insight into biological systems. Global network alignment (GNA) problem is NP-complete, for which only heuristic methods have been proposed so far. Generally, the current GNA methods fall into global heuristic seed-and-extend approaches. These methods can not get the best overall consistent alignment between networks for the opinionated local seed. Furthermore These methods are lost in maximizing the number of aligned edges between two networks without considering the original structures of functional modules. Methods We present a novel seed selection strategy for global network alignment by constructing the pairs of hub nodes of networks to be aligned into multiple seeds. Beginning from every hub seed and using the membership similarity of nodes to quantify to what extent the nodes can participate in functional modules associated with current seed topologically we align the networks by modules. By this way we can maintain the functional modules are not damaged during the heuristic alignment process. And our method is efficient in resolving the fatal problem of most conventional algorithms that the initialization selected seeds have a direct influence on the alignment result. The similarity measures between network nodes (e.g., proteins) include sequence similarity, centrality similarity, and dynamic membership similarity and our algorithm can be called Multiple Hubs-based Alignment (MHA). Results When applying our seed selection strategy to several pairs of real PPI networks, it is observed that our method is working to strike a balance, extending the conserved interactions while maintaining the functional modules unchanged. In

  20. Incorporating peak grouping information for alignment of multiple liquid chromatography-mass spectrometry datasets

    PubMed Central

    Wandy, Joe; Daly, Rónán; Breitling, Rainer; Rogers, Simon

    2015-01-01

    Motivation: The combination of liquid chromatography and mass spectrometry (LC/MS) has been widely used for large-scale comparative studies in systems biology, including proteomics, glycomics and metabolomics. In almost all experimental design, it is necessary to compare chromatograms across biological or technical replicates and across sample groups. Central to this is the peak alignment step, which is one of the most important but challenging preprocessing steps. Existing alignment tools do not take into account the structural dependencies between related peaks that coelute and are derived from the same metabolite or peptide. We propose a direct matching peak alignment method for LC/MS data that incorporates related peaks information (within each LC/MS run) and investigate its effect on alignment performance (across runs). The groupings of related peaks necessary for our method can be obtained from any peak clustering method and are built into a pair-wise peak similarity score function. The similarity score matrix produced is used by an approximation algorithm for the weighted matching problem to produce the actual alignment result. Results: We demonstrate that related peak information can improve alignment performance. The performance is evaluated on a set of benchmark datasets, where our method performs competitively compared to other popular alignment tools. Availability: The proposed alignment method has been implemented as a stand-alone application in Python, available for download at http://github.com/joewandy/peak-grouping-alignment. Contact: Simon.Rogers@glasgow.ac.uk Supplementary information: Supplementary data are available at Bioinformatics online. PMID:25649621

  1. Aligning Assessments for COSMA Accreditation

    ERIC Educational Resources Information Center

    Laird, Curt; Johnson, Dennis A.; Alderman, Heather

    2015-01-01

    Many higher education sport management programs are currently in the process of seeking accreditation from the Commission on Sport Management Accreditation (COSMA). This article provides a best-practice method for aligning student learning outcomes with a sport management program's mission and goals. Formative and summative assessment procedures…

  2. Aligned natural inflation with modulations

    NASA Astrophysics Data System (ADS)

    Choi, Kiwoon; Kim, Hyungjin

    2016-08-01

    The weak gravity conjecture applied for the aligned natural inflation indicates that generically there can be a modulation of the inflaton potential, with a period determined by sub-Planckian axion scale. We study the oscillations in the primordial power spectrum induced by such modulation, and discuss the resulting observational constraints on the model.

  3. Laser-Beam-Alignment Controller

    NASA Technical Reports Server (NTRS)

    Krasowski, M. J.; Dickens, D. E.

    1995-01-01

    In laser-beam-alignment controller, images from video camera compared to reference patterns by fuzzy-logic pattern comparator. Results processed by fuzzy-logic microcontroller, which sends control signals to motor driver adjusting lens and pinhole in spatial filter.

  4. Tonal Alignment in Irish Dialects

    ERIC Educational Resources Information Center

    Dalton, Martha; Ni Chasaide, Ailbhe

    2005-01-01

    A comparison of the contour alignment of nuclear and initial prenuclear accents was carried out for the Irish dialects of Gaoth Dobhair in Ulster (GD-U) and Cois Fharraige in Connaught (CF-C). This was done across conditions where the number of unstressed syllables following the nuclear and preceding the initial prenuclear accents was varied from…

  5. Alignment of the measurement scale mark during immersion hydrometer calibration using an image processing system.

    PubMed

    Peña-Perez, Luis Manuel; Pedraza-Ortega, Jesus Carlos; Ramos-Arreguin, Juan Manuel; Arriaga, Saul Tovar; Fernandez, Marco Antonio Aceves; Becerra, Luis Omar; Hurtado, Efren Gorrostieta; Vargas-Soto, Jose Emilio

    2013-10-24

    The present work presents an improved method to align the measurement scale mark in an immersion hydrometer calibration system of CENAM, the National Metrology Institute (NMI) of Mexico, The proposed method uses a vision system to align the scale mark of the hydrometer to the surface of the liquid where it is immersed by implementing image processing algorithms. This approach reduces the variability in the apparent mass determination during the hydrostatic weighing in the calibration process, therefore decreasing the relative uncertainty of calibration.

  6. Methods to temporally align gait cycle data.

    PubMed

    Helwig, Nathaniel E; Hong, Sungjin; Hsiao-Wecksler, Elizabeth T; Polk, John D

    2011-02-01

    The need for the temporal alignment of gait cycle data is well known; however, there is little consensus concerning which alignment method to use. In this paper, we discuss the pros and cons of some methods commonly applied to temporally align gait cycle data (normalization to percent gait cycle, dynamic time warping, derivative dynamic time warping, and piecewise alignment methods). In addition, we empirically evaluate these different methods' abilities to produce successful temporal alignment when mapping a test gait cycle trajectory to a target trajectory. We demonstrate that piecewise temporal alignment techniques outperform other commonly used alignment methods (normalization to percent gait cycle, dynamic time warping, and derivative dynamic time warping) in typical biomechanical and clinical alignment tasks. Lastly, we present an example of how these piecewise alignment techniques make it possible to separately examine intensity and temporal differences between gait cycle data throughout the entire gait cycle, which can provide greater insight into the complexities of movement patterns.

  7. Accurate determination of segmented X-ray detector geometry

    PubMed Central

    Yefanov, Oleksandr; Mariani, Valerio; Gati, Cornelius; White, Thomas A.; Chapman, Henry N.; Barty, Anton

    2015-01-01

    Recent advances in X-ray detector technology have resulted in the introduction of segmented detectors composed of many small detector modules tiled together to cover a large detection area. Due to mechanical tolerances and the desire to be able to change the module layout to suit the needs of different experiments, the pixels on each module might not align perfectly on a regular grid. Several detectors are designed to permit detector sub-regions (or modules) to be moved relative to each other for different experiments. Accurate determination of the location of detector elements relative to the beam-sample interaction point is critical for many types of experiment, including X-ray crystallography, coherent diffractive imaging (CDI), small angle X-ray scattering (SAXS) and spectroscopy. For detectors with moveable modules, the relative positions of pixels are no longer fixed, necessitating the development of a simple procedure to calibrate detector geometry after reconfiguration. We describe a simple and robust method for determining the geometry of segmented X-ray detectors using measurements obtained by serial crystallography. By comparing the location of observed Bragg peaks to the spot locations predicted from the crystal indexing procedure, the position, rotation and distance of each module relative to the interaction region can be refined. We show that the refined detector geometry greatly improves the results of experiments. PMID:26561117

  8. Accurate determination of segmented X-ray detector geometry.

    PubMed

    Yefanov, Oleksandr; Mariani, Valerio; Gati, Cornelius; White, Thomas A; Chapman, Henry N; Barty, Anton

    2015-11-01

    Recent advances in X-ray detector technology have resulted in the introduction of segmented detectors composed of many small detector modules tiled together to cover a large detection area. Due to mechanical tolerances and the desire to be able to change the module layout to suit the needs of different experiments, the pixels on each module might not align perfectly on a regular grid. Several detectors are designed to permit detector sub-regions (or modules) to be moved relative to each other for different experiments. Accurate determination of the location of detector elements relative to the beam-sample interaction point is critical for many types of experiment, including X-ray crystallography, coherent diffractive imaging (CDI), small angle X-ray scattering (SAXS) and spectroscopy. For detectors with moveable modules, the relative positions of pixels are no longer fixed, necessitating the development of a simple procedure to calibrate detector geometry after reconfiguration. We describe a simple and robust method for determining the geometry of segmented X-ray detectors using measurements obtained by serial crystallography. By comparing the location of observed Bragg peaks to the spot locations predicted from the crystal indexing procedure, the position, rotation and distance of each module relative to the interaction region can be refined. We show that the refined detector geometry greatly improves the results of experiments.

  9. Accurate determination of segmented X-ray detector geometry.

    PubMed

    Yefanov, Oleksandr; Mariani, Valerio; Gati, Cornelius; White, Thomas A; Chapman, Henry N; Barty, Anton

    2015-11-01

    Recent advances in X-ray detector technology have resulted in the introduction of segmented detectors composed of many small detector modules tiled together to cover a large detection area. Due to mechanical tolerances and the desire to be able to change the module layout to suit the needs of different experiments, the pixels on each module might not align perfectly on a regular grid. Several detectors are designed to permit detector sub-regions (or modules) to be moved relative to each other for different experiments. Accurate determination of the location of detector elements relative to the beam-sample interaction point is critical for many types of experiment, including X-ray crystallography, coherent diffractive imaging (CDI), small angle X-ray scattering (SAXS) and spectroscopy. For detectors with moveable modules, the relative positions of pixels are no longer fixed, necessitating the development of a simple procedure to calibrate detector geometry after reconfiguration. We describe a simple and robust method for determining the geometry of segmented X-ray detectors using measurements obtained by serial crystallography. By comparing the location of observed Bragg peaks to the spot locations predicted from the crystal indexing procedure, the position, rotation and distance of each module relative to the interaction region can be refined. We show that the refined detector geometry greatly improves the results of experiments. PMID:26561117

  10. CYLINDER LENS ALIGNMENT IN THE LTP

    SciTech Connect

    TAKACS, P.Z.

    2005-07-26

    The Long Trace Profiler (LTP), is well-suited for the measurement of the axial figure of cylindrical mirrors that usually have a long radius of curvature in the axial direction but have a short radius of curvature in the sagittal direction. The sagittal curvature causes the probe beam to diverge in the transverse direction without coming to a focus on the detector, resulting in a very weak signal. It is useful to place a cylinder lens into the optical system above the mirror under test to refocus the sagittal divergence and increase the signal level. A positive cylinder lens can be placed at two positions above the surface: the Cat's Eye reflection position and the Wavefront-Matching position. The Cat's Eye position, is very tolerant to mirror misalignment, which is not good if absolute axial radius of curvature is to be measured. Lateral positioning and rotational misalignments of lens and the mirror combine to produce unusual profile results. This paper looks at various alignment issues with measurements and by raytrace simulations to determine the best strategy to minimize radius of curvature errors in the measurement of cylindrical aspheres.

  11. Advanced UV Detectors and Detector Arrays

    NASA Technical Reports Server (NTRS)

    Pankove, Jacques I.; Torvik, John

    1998-01-01

    Gallium Nitride (GaN) with its wide energy bandgap of 3.4 eV holds excellent promise for solar blind UV detectors. We have successfully designed, fabricated and tested GaN p-i-n detectors and detector arrays. The detectors have a peak responsivity of 0.14A/W at 363 nm (3.42 eV) at room temperature. This corresponds to an internal quantum efficiency of 56%. The responsivity decreases by several orders of magnitude to 0.008 A/W at 400 nm (3.10 eV) giving the excellent visible rejection ratio needed for solar-blind applications.

  12. A statistical physics perspective on alignment-independent protein sequence comparison

    PubMed Central

    Chattopadhyay, Amit K.; Nasiev, Diar; Flower, Darren R.

    2015-01-01

    Motivation: Within bioinformatics, the textual alignment of amino acid sequences has long dominated the determination of similarity between proteins, with all that implies for shared structure, function and evolutionary descent. Despite the relative success of modern-day sequence alignment algorithms, so-called alignment-free approaches offer a complementary means of determining and expressing similarity, with potential benefits in certain key applications, such as regression analysis of protein structure-function studies, where alignment-base similarity has performed poorly. Results: Here, we offer a fresh, statistical physics-based perspective focusing on the question of alignment-free comparison, in the process adapting results from ‘first passage probability distribution’ to summarize statistics of ensemble averaged amino acid propensity values. In this article, we introduce and elaborate this approach. Contact: d.r.flower@aston.ac.uk PMID:25810434

  13. Automatic Alignment for the first science run of the Virgo interferometer

    NASA Astrophysics Data System (ADS)

    Acernese, F.; Alshourbagy, M.; Antonucci, F.; Aoudia, S.; Arun, K. G.; Astone, P.; Ballardin, G.; Barone, F.; Barsuglia, M.; Bauer, Th. S.; Bigotta, S.; Birindelli, S.; Bizouard, M. A.; Boccara, C.; Bondu, F.; Bonelli, L.; Bosi, L.; Braccini, S.; Bradaschia, C.; Brillet, A.; Brisson, V.; Bulten, H. J.; Buskulic, D.; Cagnoli, G.; Calloni, E.; Campagna, E.; Canuel, B.; Carbognani, F.; Carbone, L.; Cavalier, F.; Cavalieri, R.; Cella, G.; Cesarini, E.; Chassande-Mottin, E.; Chatterji, S.; Cleva, F.; Coccia, E.; Colas, J.; Colombini, M.; Corda, C.; Corsi, A.; Coulon, J.-P.; Cuoco, E.; D'Antonio, S.; Dari, A.; Dattilo, V.; Davier, M.; De Rosa, R.; Del Prete, M.; Di Fiore, L.; Di Lieto, A.; Di Paolo Emilio, M.; Di Virgilio, A.; Fafone, V.; Ferrante, I.; Fidecaro, F.; Fiori, I.; Flaminio, R.; Fournier, J.-D.; Frasca, S.; Frasconi, F.; Gammaitoni, L.; Garufi, F.; Genin, E.; Gennai, A.; Giazotto, A.; Granata, M.; Granata, V.; Greverie, C.; Guidi, G.; Heitmann, H.; Hello, P.; Hild, S.; Huet, D.; La Penna, P.; Laval, M.; Leroy, N.; Letendre, N.; Lorenzini, M.; Loriette, V.; Losurdo, G.; Mackowski, J.-M.; Majorana, E.; Man, C. N.; Mantovani, M.; Marchesoni, F.; Marion, F.; Marque, J.; Martelli, F.; Masserot, A.; Menzinger, F.; Michel, C.; Milano, L.; Minenkov, Y.; Mohan, M.; Moreau, J.; Morgado, N.; Mosca, S.; Mours, B.; Neri, I.; Nocera, F.; Pagliaroli, G.; Palomba, C.; Paoletti, F.; Pardi, S.; Pasqualetti, A.; Passaquieti, R.; Passuello, D.; Persichetti, G.; Piergiovanni, F.; Pinard, L.; Poggiani, R.; Punturo, M.; Puppo, P.; Rabaste, O.; Rapagnani, P.; Regimbau, T.; Ricci, F.; Rocchi, A.; Rolland, L.; Romano, R.; Ruggi, P.; Sassolas, B.; Sentenac, D.; Swinkels, B. L.; Terenzi, R.; Toncelli, A.; Tonelli, M.; Tournefier, E.; Travasso, F.; Trummer, J.; Vajente, G.; van den Brand, J. F. J.; van der Putten, S.; Verkindt, D.; Vetrano, F.; Viceré, A.; Vinet, J.-Y.; Vocca, H.; Was, M.; Yvert, M.

    2010-04-01

    During the past few years a network of large-scale laser interferometers, including the Virgo detector, has been developed with the aim of detecting gravitational waves. To properly operate the detectors, the longitudinal and angular positions of the suspended detector test masses, the interferometer mirrors, must be kept within a small range from the operating point. The design of the Virgo angular control system, called Automatic Alignment is based on a modified version of the Anderson-Giordano technique, a wave-front sensing scheme which uses the modulation-demodulation technique. This paper will present the theoretical background of the Virgo Automatic Alignment system, the implementation issues and the performances observed during the first Virgo science run (VSR1). A total RMS of 4 × 10 -2 to 3 × 10 -3 μrad for all angular degrees of freedom has been achieved.

  14. Single shot x-ray phase contrast imaging using a direct conversion microstrip detector with single photon sensitivity

    NASA Astrophysics Data System (ADS)

    Kagias, M.; Cartier, S.; Wang, Z.; Bergamaschi, A.; Dinapoli, R.; Mozzanica, A.; Schmitt, B.; Stampanoni, M.

    2016-06-01

    X-ray phase contrast imaging enables the measurement of the electron density of a sample with high sensitivity compared to the conventional absorption contrast. This is advantageous for the study of dose-sensitive samples, in particular, for biological and medical investigations. Recent developments relaxed the requirement for the beam coherence, such that conventional X-ray sources can be used for phase contrast imaging and thus clinical applications become possible. One of the prominent phase contrast imaging methods, Talbot-Lau grating interferometry, is limited by the manufacturing, alignment, and photon absorption of the analyzer grating, which is placed in the beam path in front of the detector. We propose an alternative improved method based on direct conversion charge integrating detectors, which enables a grating interferometer to be operated without an analyzer grating. Algorithms are introduced, which resolve interference fringes with a periodicity of 4.7 μm recorded with a 25 μm pitch Si microstrip detector (GOTTHARD). The feasibility of the proposed approach is demonstrated by an experiment at the TOMCAT beamline of the Swiss Light Source on a polyethylene sample.

  15. Optimization of field-free molecular alignment by phase-shaped laser pulses

    SciTech Connect

    Hertz, E.; Rouzee, A.; Guerin, S.; Lavorel, B.; Faucher, O.

    2007-03-15

    We theoretically demonstrate the optimization of field-free molecular alignment by phase-shaped femtosecond laser pulses. The effect is assessed in O{sub 2} at T=60 K under realistic conditions of intensity and pulse shaping. The spectral laser phase is sampled through 128 control parameters and a self-learning evolutionary algorithm combined with a nonperturbative regime calculation is used in order to design the specific phase that maximizes the degree of alignment. The postpulse molecular alignment appears significantly enhanced compared to a Fourier-transform-limited pulse of same energy. The analysis of the target state reveals that the solution is close to the optimal one.

  16. Rapid code acquisition algorithms employing PN matched filters

    NASA Technical Reports Server (NTRS)

    Su, Yu T.

    1988-01-01

    The performance of four algorithms using pseudonoise matched filters (PNMFs), for direct-sequence spread-spectrum systems, is analyzed. They are: parallel search with fix dwell detector (PL-FDD), parallel search with sequential detector (PL-SD), parallel-serial search with fix dwell detector (PS-FDD), and parallel-serial search with sequential detector (PS-SD). The operation characteristic for each detector and the mean acquisition time for each algorithm are derived. All the algorithms are studied in conjunction with the noncoherent integration technique, which enables the system to operate in the presence of data modulation. Several previous proposals using PNMF are seen as special cases of the present algorithms.

  17. The TALE Tower Detector

    NASA Astrophysics Data System (ADS)

    Bergman, D. R.

    The TA Low Energy Extension will include a Tower FluorescenceDetector. Extensive air showers at the lowest usful energies for fluorescence detectors will in general be close to the detector. This requires viewing all elevation angles to be able to reconstruct showers. The TALE Tower Detector, operating in conjunction with other TALE detectors will view elevation angles up to above 70 degrees, with an azimuthal coverage of about 90 degrees. Results from a prototype mirror operated in conjunction with the HiRes detector will also be presented.

  18. GADRAS Detector Response Function.

    SciTech Connect

    Mitchell, Dean J.; Harding, Lee; Thoreson, Gregory G; Horne, Steven M.

    2014-11-01

    The Gamma Detector Response and Analysis Software (GADRAS) applies a Detector Response Function (DRF) to compute the output of gamma-ray and neutron detectors when they are exposed to radiation sources. The DRF is fundamental to the ability to perform forward calculations (i.e., computation of the response of a detector to a known source), as well as the ability to analyze spectra to deduce the types and quantities of radioactive material to which the detectors are exposed. This document describes how gamma-ray spectra are computed and the significance of response function parameters that define characteristics of particular detectors.

  19. The upgraded DØ detector

    NASA Astrophysics Data System (ADS)

    Abazov, V. M.; Abbott, B.; Abolins, M.; Acharya, B. S.; Adams, D. L.; Adams, M.; Adams, T.; Agelou, M.; Agram, J.-L.; Ahmed, S. N.; Ahn, S. H.; Ahsan, M.; Alexeev, G. D.; Alkhazov, G.; Alton, A.; Alverson, G.; Alves, G. A.; Anastasoaie, M.; Andeen, T.; Anderson, J. T.; Anderson, S.; Andrieu, B.; Angstadt, R.; Anosov, V.; Arnoud, Y.; Arov, M.; Askew, A.; Åsman, B.; Assis Jesus, A. C. S.; Atramentov, O.; Autermann, C.; Avila, C.; Babukhadia, L.; Bacon, T. C.; Badaud, F.; Baden, A.; Baffioni, S.; Bagby, L.; Baldin, B.; Balm, P. W.; Banerjee, P.; Banerjee, S.; Barberis, E.; Bardon, O.; Barg, W.; Bargassa, P.; Baringer, P.; Barnes, C.; Barreto, J.; Bartlett, J. F.; Bassler, U.; Bhattacharjee, M.; Baturitsky, M. A.; Bauer, D.; Bean, A.; Baumbaugh, B.; Beauceron, S.; Begalli, M.; Beaudette, F.; Begel, M.; Bellavance, A.; Beri, S. B.; Bernardi, G.; Bernhard, R.; Bertram, I.; Besançon, M.; Besson, A.; Beuselinck, R.; Beutel, D.; Bezzubov, V. A.; Bhat, P. C.; Bhatnagar, V.; Binder, M.; Biscarat, C.; Bishoff, A.; Black, K. M.; Blackler, I.; Blazey, G.; Blekman, F.; Blessing, S.; Bloch, D.; Blumenschein, U.; Bockenthien, E.; Bodyagin, V.; Boehnlein, A.; Boeriu, O.; Bolton, T. A.; Bonamy, P.; Bonifas, D.; Borcherding, F.; Borissov, G.; Bos, K.; Bose, T.; Boswell, C.; Bowden, M.; Brandt, A.; Briskin, G.; Brock, R.; Brooijmans, G.; Bross, A.; Buchanan, N. J.; Buchholz, D.; Buehler, M.; Buescher, V.; Burdin, S.; Burke, S.; Burnett, T. H.; Busato, E.; Buszello, C. P.; Butler, D.; Butler, J. M.; Cammin, J.; Caron, S.; Bystricky, J.; Canal, L.; Canelli, F.; Carvalho, W.; Casey, B. C. K.; Casey, D.; Cason, N. M.; Castilla-Valdez, H.; Chakrabarti, S.; Chakraborty, D.; Chan, K. M.; Chandra, A.; Chapin, D.; Charles, F.; Cheu, E.; Chevalier, L.; Chi, E.; Chiche, R.; Cho, D. K.; Choate, R.; Choi, S.; Choudhary, B.; Chopra, S.; Christenson, J. H.; Christiansen, T.; Christofek, L.; Churin, I.; Cisko, G.; Claes, D.; Clark, A. R.; Clément, B.; Clément, C.; Coadou, Y.; Colling, D. J.; Coney, L.; Connolly, B.; Cooke, M.; Cooper, W. E.; Coppage, D.; Corcoran, M.; Coss, J.; Cothenet, A.; Cousinou, M.-C.; Cox, B.; Crépé-Renaudin, S.; Cristetiu, M.; Cummings, M. A. C.; Cutts, D.; da Motta, H.; Das, M.; Davies, B.; Davies, G.; Davis, G. A.; Davis, W.; De, K.; de Jong, P.; de Jong, S. J.; De La Cruz-Burelo, E.; De La Taille, C.; De Oliveira Martins, C.; Dean, S.; Degenhardt, J. D.; Déliot, F.; Delsart, P. A.; Del Signore, K.; DeMaat, R.; Demarteau, M.; Demina, R.; Demine, P.; Denisov, D.; Denisov, S. P.; Desai, S.; Diehl, H. T.; Diesburg, M.; Doets, M.; Doidge, M.; Dong, H.; Doulas, S.; Dudko, L. V.; Duflot, L.; Dugad, S. R.; Duperrin, A.; Dvornikov, O.; Dyer, J.; Dyshkant, A.; Eads, M.; Edmunds, D.; Edwards, T.; Ellison, J.; Elmsheuser, J.; Eltzroth, J. T.; Elvira, V. D.; Eno, S.; Ermolov, P.; Eroshin, O. V.; Estrada, J.; Evans, D.; Evans, H.; Evdokimov, A.; Evdokimov, V. N.; Fagan, J.; Fast, J.; Fatakia, S. N.; Fein, D.; Feligioni, L.; Ferapontov, A. V.; Ferbel, T.; Ferreira, M. J.; Fiedler, F.; Filthaut, F.; Fisher, W.; Fisk, H. E.; Fleck, I.; Fitzpatrick, T.; Flattum, E.; Fleuret, F.; Flores, R.; Foglesong, J.; Fortner, M.; Fox, H.; Franklin, C.; Freeman, W.; Fu, S.; Fuess, S.; Gadfort, T.; Galea, C. F.; Gallas, E.; Galyaev, E.; Gao, M.; Garcia, C.; Garcia-Bellido, A.; Gardner, J.; Gavrilov, V.; Gay, A.; Gay, P.; Gelé, D.; Gelhaus, R.; Genser, K.; Gerber, C. E.; Gershtein, Y.; Gillberg, D.; Geurkov, G.; Ginther, G.; Gobbi, B.; Goldmann, K.; Golling, T.; Gollub, N.; Golovtsov, V.; Gómez, B.; Gomez, G.; Gomez, R.; Goodwin, R.; Gornushkin, Y.; Gounder, K.; Goussiou, A.; Graham, D.; Graham, G.; Grannis, P. D.; Gray, K.; Greder, S.; Green, D. R.; Green, J.; Green, J. A.; Greenlee, H.; Greenwood, Z. D.; Gregores, E. M.; Grinstein, S.; Gris, Ph.; Grivaz, J.-F.; Groer, L.; Grünendahl, S.; Grünewald, M. W.; Gu, W.; Guglielmo, J.; Gupta, A.; Gurzhiev, S. N.; Gutierrez, G.; Gutierrez, P.; Haas, A.; Hadley, N. J.; Haggard, E.; Haggerty, H.; Hagopian, S.; Hall, I.; Hall, R. E.; Han, C.; Han, L.; Hance, R.; Hanagaki, K.; Hanlet, P.; Hansen, S.; Harder, K.; Harel, A.; Harrington, R.; Hauptman, J. M.; Hauser, R.; Hays, C.; Hays, J.; Hazen, E.; Hebbeker, T.; Hebert, C.; Hedin, D.; Heinmiller, J. M.; Heinson, A. P.; Heintz, U.; Hensel, C.; Hesketh, G.; Hildreth, M. D.; Hirosky, R.; Hobbs, J. D.; Hoeneisen, B.; Hohlfeld, M.; Hong, S. J.; Hooper, R.; Hou, S.; Houben, P.; Hu, Y.; Huang, J.; Huang, Y.; Hynek, V.; Huffman, D.; Iashvili, I.; Illingworth, R.; Ito, A. S.; Jabeen, S.; Jacquier, Y.; Jaffré, M.; Jain, S.; Jain, V.; Jakobs, K.; Jayanti, R.; Jenkins, A.; Jesik, R.; Jiang, Y.; Johns, K.; Johnson, M.; Johnson, P.; Jonckheere, A.; Jonsson, P.; Jöstlein, H.; Jouravlev, N.; Juarez, M.; Juste, A.; Kaan, A. P.; Kado, M. M.; Käfer, D.; Kahl, W.; Kahn, S.; Kajfasz, E.; Kalinin, A. M.; Kalk, J.; Kalmani, S. D.; Karmanov, D.; Kasper, J.; Katsanos, I.; Kau, D.; Kaur, R.; Ke, Z.; Kehoe, R.; Kermiche, S.; Kesisoglou, S.; Khanov, A.; Kharchilava, A.; Kharzheev, Y. M.; Kim, H.; Kim, K. H.; Kim, T. J.; Kirsch, N.; Klima, B.; Klute, M.; Kohli, J. M.; Konrath, J.-P.; Komissarov, E. V.; Kopal, M.; Korablev, V. M.; Kostritski, A.; Kotcher, J.; Kothari, B.; Kotwal, A. V.; Koubarovsky, A.; Kozelov, A. V.; Kozminski, J.; Kryemadhi, A.; Kouznetsov, O.; Krane, J.; Kravchuk, N.; Krempetz, K.; Krider, J.; Krishnaswamy, M. R.; Krzywdzinski, S.; Kubantsev, M.; Kubinski, R.; Kuchinsky, N.; Kuleshov, S.; Kulik, Y.; Kumar, A.; Kunori, S.; Kupco, A.; Kurča, T.; Kvita, J.; Kuznetsov, V. E.; Kwarciany, R.; Lager, S.; Lahrichi, N.; Landsberg, G.; Larwill, M.; Laurens, P.; Lavigne, B.; Lazoflores, J.; Le Bihan, A.-C.; Le Meur, G.; Lebrun, P.; Lee, S. W.; Lee, W. M.; Leflat, A.; Leggett, C.; Lehner, F.; Leitner, R.; Leonidopoulos, C.; Leveque, J.; Lewis, P.; Li, J.; Li, Q. Z.; Li, X.; Lima, J. G. R.; Lincoln, D.; Lindenmeyer, C.; Linn, S. L.; Linnemann, J.; Lipaev, V. V.; Lipton, R.; Litmaath, M.; Lizarazo, J.; Lobo, L.; Lobodenko, A.; Lokajicek, M.; Lounis, A.; Love, P.; Lu, J.; Lubatti, H. J.; Lucotte, A.; Lueking, L.; Luo, C.; Lynker, M.; Lyon, A. L.; Machado, E.; Maciel, A. K. A.; Madaras, R. J.; Mättig, P.; Magass, C.; Magerkurth, A.; Magnan, A.-M.; Maity, M.; Makovec, N.; Mal, P. K.; Malbouisson, H. B.; Malik, S.; Malyshev, V. L.; Manakov, V.; Mao, H. S.; Maravin, Y.; Markley, D.; Markus, M.; Marshall, T.; Martens, M.; Martin, M.; Martin-Chassard, G.; Mattingly, S. E. K.; Matulik, M.; Mayorov, A. A.; McCarthy, R.; McCroskey, R.; McKenna, M.; McMahon, T.; Meder, D.; Melanson, H. L.; Melnitchouk, A.; Mendes, A.; Mendoza, D.; Mendoza, L.; Meng, X.; Merekov, Y. P.; Merkin, M.; Merritt, K. W.; Meyer, A.; Meyer, J.; Michaut, M.; Miao, C.; Miettinen, H.; Mihalcea, D.; Mikhailov, V.; Miller, D.; Mitrevski, J.; Mokhov, N.; Molina, J.; Mondal, N. K.; Montgomery, H. E.; Moore, R. W.; Moulik, T.; Muanza, G. S.; Mostafa, M.; Moua, S.; Mulders, M.; Mundim, L.; Mutaf, Y. D.; Nagaraj, P.; Nagy, E.; Naimuddin, M.; Nang, F.; Narain, M.; Narasimhan, V. S.; Narayanan, A.; Naumann, N. A.; Neal, H. A.; Negret, J. P.; Nelson, S.; Neuenschwander, R. T.; Neustroev, P.; Noeding, C.; Nomerotski, A.; Novaes, S. F.; Nozdrin, A.; Nunnemann, T.; Nurczyk, A.; Nurse, E.; O'Dell, V.; O'Neil, D. C.; Oguri, V.; Olis, D.; Oliveira, N.; Olivier, B.; Olsen, J.; Oshima, N.; Oshinowo, B. O.; Otero y Garzón, G. J.; Padley, P.; Papageorgiou, K.; Parashar, N.; Park, J.; Park, S. K.; Parsons, J.; Partridge, R.; Parua, N.; Patwa, A.; Pawloski, G.; Perea, P. M.; Perez, E.; Peters, O.; Pétroff, P.; Petteni, M.; Phaf, L.; Piegaia, R.; Pleier, M.-A.; Podesta-Lerma, P. L. M.; Podstavkov, V. M.; Pogorelov, Y.; Pol, M.-E.; Pompoš, A.; Polosov, P.; Pope, B. G.; Popkov, E.; Porokhovoy, S.; Prado da Silva, W. L.; Pritchard, W.; Prokhorov, I.; Prosper, H. B.; Protopopescu, S.; Przybycien, M. B.; Qian, J.; Quadt, A.; Quinn, B.; Ramberg, E.; Ramirez-Gomez, R.; Rani, K. J.; Ranjan, K.; Rao, M. V. S.; Rapidis, P. A.; Rapisarda, S.; Raskowski, J.; Ratoff, P. N.; Ray, R. E.; Reay, N. W.; Rechenmacher, R.; Reddy, L. V.; Regan, T.; Renardy, J.-F.; Reucroft, S.; Rha, J.; Ridel, M.; Rijssenbeek, M.; Ripp-Baudot, I.; Rizatdinova, F.; Robinson, S.; Rodrigues, R. F.; Roco, M.; Rotolo, C.; Royon, C.; Rubinov, P.; Ruchti, R.; Rucinski, R.; Rud, V. I.; Russakovich, N.; Russo, P.; Sabirov, B.; Sajot, G.; Sánchez-Hernández, A.; Sanders, M. P.; Santoro, A.; Satyanarayana, B.; Savage, G.; Sawyer, L.; Scanlon, T.; Schaile, D.; Schamberger, R. D.; Scheglov, Y.; Schellman, H.; Schieferdecker, P.; Schmitt, C.; Schwanenberger, C.; Schukin, A. A.; Schwartzman, A.; Schwienhorst, R.; Sengupta, S.; Severini, H.; Shabalina, E.; Shamim, M.; Shankar, H. C.; Shary, V.; Shchukin, A. A.; Sheahan, P.; Shephard, W. D.; Shivpuri, R. K.; Shishkin, A. A.; Shpakov, D.; Shupe, M.; Sidwell, R. A.; Simak, V.; Sirotenko, V.; Skow, D.; Skubic, P.; Slattery, P.; Smith, D. E.; Smith, R. P.; Smolek, K.; Snow, G. R.; Snow, J.; Snyder, S.; Söldner-Rembold, S.; Song, X.; Song, Y.; Sonnenschein, L.; Sopczak, A.; Sorín, V.; Sosebee, M.; Soustruznik, K.; Souza, M.; Spartana, N.; Spurlock, B.; Stanton, N. R.; Stark, J.; Steele, J.; Stefanik, A.; Steinberg, J.; Steinbrück, G.; Stevenson, K.; Stolin, V.; Stone, A.; Stoyanova, D. A.; Strandberg, J.; Strang, M. A.; Strauss, M.; Ströhmer, R.; Strom, D.; Strovink, M.; Stutte, L.; Sumowidagdo, S.; Sznajder, A.; Talby, M.; Tentindo-Repond, S.; Tamburello, P.; Taylor, W.; Telford, P.; Temple, J.; Terentyev, N.; Teterin, V.; Thomas, E.; Thompson, J.; Thooris, B.; Titov, M.; Toback, D.; Tokmenin, V. V.; Tolian, C.; Tomoto, M.; Tompkins, D.; Toole, T.; Torborg, J.; Touze, F.; Towers, S.; Trefzger, T.; Trincaz-Duvoid, S.; Trippe, T. G.; Tsybychev, D.; Tuchming, B.; Tully, C.; Turcot, A. S.; Tuts, P. M.; Utes, M.; Uvarov, L.; Uvarov, S.; Uzunyan, S.; Vachon, B.; van den Berg, P. J.; van Gemmeren, P.; Van Kooten, R.; van Leeuwen, W. M.; Varelas, N.; Varnes, E. W.; Vartapetian, A.; Vasilyev, I. A.; Vaupel, M.; Vaz, M.; Verdier, P.; Vertogradov, L. S.; Verzocchi, M.; Vigneault, M.; Villeneuve-Seguier, F.; Vishwanath, P. R.; Vlimant, J.-R.; Von Toerne, E.; Vorobyov, A.; Vreeswijk, M.; Vu Anh, T.; Vysotsky, V.; Wahl, H. D.; Walker, R.; Wallace, N.; Wang, L.; Wang, Z.-M.; Warchol, J.; Warsinsky, M.; Watts, G.; Wayne, M.; Weber, M.; Weerts, H.; Wegner, M.; Wermes, N.; Wetstein, M.; White, A.; White, V.; Whiteson, D.; Wicke, D.; Wijnen, T.; Wijngaarden, D. A.; Wilcer, N.; Willutzki, H.; Wilson, G. W.; Wimpenny, S. J.; Wittlin, J.; Wlodek, T.; Wobisch, M.; Womersley, J.; Wood, D. R.; Wyatt, T. R.; Wu, Z.; Xie, Y.; Xu, Q.; Xuan, N.; Yacoob, S.; Yamada, R.; Yan, M.; Yarema, R.; Yasuda, T.; Yatsunenko, Y. A.; Yen, Y.; Yip, K.; Yoo, H. D.; Yoffe, F.; Youn, S. W.; Yu, J.; Yurkewicz, A.; Zabi, A.; Zanabria, M.; Zatserklyaniy, A.; Zdrazil, M.; Zeitnitz, C.; Zhang, B.; Zhang, D.; Zhang, X.; Zhao, T.; Zhao, Z.; Zheng, H.; Zhou, B.; Zhou, B.; Zhu, J.; Zielinski, M.; Zieminska, D.; Zieminski, A.; Zitoun, R.; Zmuda, T.; Zutshi, V.; Zviagintsev, S.; Zverev, E. G.; Zylberstejn, A.

    2006-09-01

    The DØ experiment enjoyed a very successful data-collection run at the Fermilab Tevatron collider between 1992 and 1996. Since then, the detector has been upgraded to take advantage of improvements to the Tevatron and to enhance its physics capabilities. We describe the new elements of the detector, including the silicon microstrip tracker, central fiber tracker, solenoidal magnet, preshower detectors, forward muon detector, and forward proton detector. The uranium/liquid-argon calorimeters and central muon detector, remaining from Run I, are discussed briefly. We also present the associated electronics, triggering, and data acquisition systems, along with the design and implementation of software specific to DØ.

  20. The MINOS detectors

    SciTech Connect

    Habig, A.; Grashorn, E.W.; /Minnesota U., Duluth

    2005-07-01

    The Main Injector Neutrino Oscillation Search (MINOS) experiment's primary goal is the precision measurement of the neutrino oscillation parameters in the atmospheric neutrino sector. This long-baseline experiment uses Fermilab's NuMI beam, measured with a Near Detector at Fermilab, and again 735 km later using a Far Detector in the Soudan Mine Underground Lab in northern Minnesota. The detectors are magnetized iron/scintillator calorimeters. The Far Detector has been operational for cosmic ray and atmospheric neutrino data from July of 2003, the Near Detector from September 2004, and the NuMI beam started in early 2005. This poster presents details of the two detectors.

  1. Shape-dependent canny edge detector

    NASA Astrophysics Data System (ADS)

    Panetta, Karen A.; Agaian, Sos S.; Nercessian, Shahan C.; Almunstashri, Ali A.

    2011-08-01

    Edges characterize the boundaries of objects in images and are informative structural cues for computer vision and target/object detection and recognition systems. The Canny edge detector is widely regarded as the edge detection standard. It is fairly adaptable to different environments, as its parametric nature attempts to tailor the detection of edges based on image-dependent characteristics or the particular requirements of a given implementation. Though it has been used in a myriad of image processing tasks, the Canny edge detector is still vulnerable to edge losses, localization errors, and noise sensitivity. These issues are largely due to the key tradeoff made in the scale and size of the edge detection filters used by the algorithm. Small-scaled filters are sensitive to edges but also to noise, whereas large-scaled filters are robust to noise but could filter out fine details. In this paper, novel edge detection kernel generalizations and a shape-dependent edge detector are introduced to alleviate these shortcomings. While most standard edge detection algorithms are based on convolving the input image with fixed size square kernels, this paper will illustrate the benefits of different filter sizes, and more importantly, different kernel shapes for edge detection. Moreover, new edge fusion methods are introduced to more effectively combine the individual edge responses. Existing edge detectors, including the Canny edge detector, can be obtained from the generalized edge detector by specifying corresponding parameters and kernel shapes. The proposed representations and edge detector have been qualitatively and quantitatively evaluated on several different types of image data. Computer simulations demonstrate that nonsquare kernel approaches can outperform square kernel approaches such as Canny, Sobel, Prewitt, Roberts, and others, providing better tradeoffs between noise rejection, accurate edge localization, and resolution. Where possible, Pratt's figure of

  2. Design and prototype studies of the TOTEM Roman pot detectors

    NASA Astrophysics Data System (ADS)

    Oriunno, Marco; Battistin, Michele; David, Eric; Guglielmini, Paolo; Joram, Christian; Radermacher, Ernst; Ruggiero, Gennaro; Wu, Jihao; Vacek, Vaclav; Vins, Vaclav

    2007-10-01

    The Roman pots of the TOTEM experiment at LHC will be equipped with edgeless silicon micro-strip detectors. A detector package consists of 10 detector planes cooled at -15C in vacuum. The detector resolution is 20 μm, the overall alignment precision has to be better than 30 μm. The detector planes are composed of a kapton hybrid glued on a substrate made of low expansion alloy, CE07 with 70% Si and 30% Al. An evaporative cooling system based on the fluorocarbon C3F8 with oil-free compressors has been adopted. The throttling of the fluid is done locally through capillaries. A thermo-mechanical prototype has been assembled. The results fully match the requirements and the expectations of calculations. They show a low thermal gradient on the cards and a uniform temperature distribution over the 10 planes.

  3. The calibration unit and detector system tests for MUSE

    NASA Astrophysics Data System (ADS)

    Kelz, A.; Bauer, S. M.; Biswas, I.; Fechner, T.; Hahn, T.; Olaya, J.-C.; Popow, E.; Roth, M. M.; Streicher, O.; Weilbacher, P.; Bacon, R.; Laurent, F.; Laux, U.; Lizon, J. L.; Loupias, M.; Reiss, R.; Rupprecht, G.

    2010-07-01

    The Multi-Unit Spectroscopic Explorer (MUSE) is an integral-field spectrograph for the ESO Very Large Telescope. After completion of the Final Design Review in 2009, MUSE is now in its manufacture and assembly phase. To achieve a relative large field-of-view with fine spatial sampling, MUSE features 24 identical spectrograph-detector units. The acceptance tests of the detector sub-systems, the design and manufacture of the calibration unit and the development of the Data Reduction Software for MUSE are under the responsibility of the AIP. The optical design of the spectrograph implies strict tolerances on the alignment of the detector systems to minimize aberrations. As part of the acceptance testing, all 24 detector systems, developed by ESO, are mounted to a MUSE reference spectrograph, which is illuminated by a set of precision pinholes. Thus the best focus is determined and the image quality of the spectrograph-detector subsystem across wavelength and field angle is measured.

  4. Gamma Detector Response and Analysis Software - Light

    2004-06-14

    GADRAS is used to analyze gamma-ray spectra, which may be augmented by neutron count rate information. The fundamental capabilities of GADRAS are imparted by physics-based detector response functions for a variety of gamma ray and neufron detectors. The software has provisions for characterizing detector response parameters so that specta can be computed accurately over the range 30keV key to II MeV. Associated neutron detector count rates can also be computed for characterized detectors. GADRAS incorporatesmore » a variety of analysis algorithms that utilize the computed spectra. The full version of GADRAS incorporates support for computation of radiation leakages from complex source models, but this capability is not supported by GADRAS-LT. GADRAS has been and will continue to be disseminated free of charge to government agencies and National Laboratories as OUO software. GADRAS-LT is a limited software version that was prepared for exclusive use of our Technology Transfer parnter Thermo Electron (TE). TE will use the software to characterize and test radiation detectors that are fabricated under the terms of our partnership. The development of these sensors has been defined as a National Security priority by our sponsor, NNSA/NA-20, by DHS/S&T, and by SNL president Paul Robinson. Although GADRAS-LT is OUO, features that are not essential to the detector development have been removed. TE will not be licensed to commercialize GADRAS-LT or to distribute it to third parties.« less

  5. Estimation Filter for Alignment of the Spitzer Space Telescope

    NASA Technical Reports Server (NTRS)

    Bayard, David

    2007-01-01

    A document presents a summary of an onboard estimation algorithm now being used to calibrate the alignment of the Spitzer Space Telescope (formerly known as the Space Infrared Telescope Facility). The algorithm, denoted the S2P calibration filter, recursively generates estimates of the alignment angles between a telescope reference frame and a star-tracker reference frame. At several discrete times during the day, the filter accepts, as input, attitude estimates from the star tracker and observations taken by the Pointing Control Reference Sensor (a sensor in the field of view of the telescope). The output of the filter is a calibrated quaternion that represents the best current mean-square estimate of the alignment angles between the telescope and the star tracker. The S2P calibration filter incorporates a Kalman filter that tracks six states - two for each of three orthogonal coordinate axes. Although, in principle, one state per axis is sufficient, the use of two states per axis makes it possible to model both short- and long-term behaviors. Specifically, the filter properly models transient learning, characteristic times and bounds of thermomechanical drift, and long-term steady-state statistics, whether calibration measurements are taken frequently or infrequently. These properties ensure that the S2P filter performance is optimal over a broad range of flight conditions, and can be confidently run autonomously over several years of in-flight operation without human intervention.

  6. Orbital Verification of the CXO High-Resolution Mirror Assembly Alignment and Vignetting

    NASA Technical Reports Server (NTRS)

    Gaetz, T. J.; Jerius, D.; Edgar, R. J.; VanSpeybroeck, L. P.; Schwartz, D. A.; Markevitch, M.; Schulz, N. S.

    2000-01-01

    Prior to launch, the High Resolution Mirror Assembly (HRMA) of the Chandra X-ray Observatory underwent extensive ground testing at the X-ray Calibration Facility (XRCF) at the Marshall Space Flight Center in Huntsville. Observations made during the post-launch Orbital Activation and Calibration period, allow the on-orbit condition of the X-ray optics to be assessed. Based on these ground-based and on-orbit data, we examine the alignment of the x-ray optics based on the PSF, and the boresight and alignment of the optical axis alignment relative to the detectors. We examine the vignetting and the single reflection ghost suppression properties of the telescope. Slight imperfections in alignment lead to a small azimuthal dependence of the off-axis area; the morphology of off-axis images also shows an additional small azimuthal dependence varying as 1/2 the off-axis azimuth angle.

  7. A divide and conquer approach to multiple alignment.

    PubMed

    Dress, A; Füllen, G; Perrey, S

    1995-01-01

    We present a report on work in progress on a divide and conquer approach to multiple alignment. The algorithm makes use of the costs calculated from applying the standard dynamic programming scheme to all pairs of sequences. The resulting cost matrices for pairwise alignment give rise to secondary matrices containing the additional costs imposed by fixing the path through the dynamic programming graph at a particular vertex. Such a constraint corresponds to a division of the problem obtained by slicing both sequences between two particular positions, and aligning the two sequences on the left and the two sequences on the right, charging for gaps introduced at the slicing point. To obtain an estimate for the additional cost imposed by forcing the multiple alignment through a particular vertex in the whole hypercube, we will take a (weighted) sum of secondary costs over all pairwise projections of the division of the problem, as defined by this vertex, that is, by slicing all sequences at the points suggested by the vertex. We then use that partition of every single sequence under consideration into two 'halfs' which imposes a minimal (weighted) sum of pairwise additional costs, making sure that one of the sequences is divided somewhere close to its midpoint. Hence, each iteration can cut the problem size in half. As the enumeration of all possible partitions may restrict this approach to small-size problems, we eliminate futile partitions, and organize their enumeration in a way that starts with the most promising ones.(ABSTRACT TRUNCATED AT 250 WORDS)

  8. Phylo-VISTA: Interactive visualization of multiple DNA sequence alignments

    SciTech Connect

    Shah, Nameeta; Couronne, Olivier; Pennacchio, Len A.; Brudno, Michael; Batzoglou, Serafim; Bethel, E. Wes; Rubin, Edward M.; Hamann, Bernd; Dubchak, Inna

    2004-01-15

    The power of multi-sequence comparison for biological discovery is well established. The need for new capabilities to visualize and compare cross-species alignment data is intensified by the growing number of genomic sequence datasets being generated for an ever-increasing number of organisms. To be efficient these visualization algorithms must support the ability to accommodate consistently a wide range of evolutionary distances in a comparison framework based upon phylogenetic relationships. Results: We have developed Phylo-VISTA, an interactive tool for analyzing multiple alignments by visualizing a similarity measure for multiple DNA sequences. The complexity of visual presentation is effectively organized using a framework based upon interspecies phylogenetic relationships. The phylogenetic organization supports rapid, user-guided interspecies comparison. To aid in navigation through large sequence datasets, Phylo-VISTA leverages concepts from VISTA that provide a user with the ability to select and view data at varying resolutions. The combination of multiresolution data visualization and analysis, combined with the phylogenetic framework for interspecies comparison, produces a highly flexible and powerful tool for visual data analysis of multiple sequence alignments. Availability: Phylo-VISTA is available at http://www-gsd.lbl. gov/phylovista. It requires an Internet browser with Java Plugin 1.4.2 and it is integrated into the global alignment program LAGAN at http://lagan.stanford.edu

  9. Automated alignment method for coherence-controlled holographic microscope

    NASA Astrophysics Data System (ADS)

    Dostal, Zbynek; Slaby, Tomas; Kvasnica, Lukas; Lostak, Martin; Krizova, Aneta; Chmelik, Radim

    2015-11-01

    A coherence-controlled holographic microscope (CCHM) was developed particularly for quantitative phase imaging and measurement of live cell dynamics, which is the proper subject of digital holographic microscopy (DHM). CCHM in low-coherence mode extends DHM in the study of living cells. However, this advantage is compensated by sensitivity of the system to easily become misaligned, which is a serious hindrance to wanted performance. Therefore, it became clear that introduction of a self-correcting system is inevitable. Accordingly, we had to devise a theory of a suitable control and design an automated alignment system for CCHM. The modulus of the reconstructed holographic signal was identified as a significant variable for guiding the alignment procedures. From this, we derived the original basic realignment three-dimensional algorithm, which encompasses a unique set of procedures for automated alignment that contains processes for initial and advanced alignment as well as long-term maintenance of microscope tuning. All of these procedures were applied to a functioning microscope and the tested processes were successfully validated. Finally, in such a way, CCHM is enabled to substantially contribute to study of biology, particularly of cancer cells in vitro.

  10. Automatic laser beam alignment using blob detection for an environment monitoring spectroscopy

    NASA Astrophysics Data System (ADS)

    Khidir, Jarjees; Chen, Youhua; Anderson, Gary

    2013-05-01

    This paper describes a fully automated system to align an infra-red laser beam with a small retro-reflector over a wide range of distances. The component development and test were especially used for an open-path spectrometer gas detection system. Using blob detection under OpenCV library, an automatic alignment algorithm was designed to achieve fast and accurate target detection in a complex background environment. Test results are presented to show that the proposed algorithm has been successfully applied to various target distances and environment conditions.

  11. Prism Window for Optical Alignment

    NASA Technical Reports Server (NTRS)

    Tang, Hong

    2008-01-01

    A prism window has been devised for use, with an autocollimator, in aligning optical components that are (1) required to be oriented parallel to each other and/or at a specified angle of incidence with respect to a common optical path and (2) mounted at different positions along the common optical path. The prism window can also be used to align a single optical component at a specified angle of incidence. Prism windows could be generally useful for orienting optical components in manufacture of optical instruments. "Prism window" denotes an application-specific unit comprising two beam-splitter windows that are bonded together at an angle chosen to obtain the specified angle of incidence.

  12. Aligned mesoporous architectures and devices.

    SciTech Connect

    Brinker, C. Jeffrey; Lu, Yunfeng

    2011-03-01

    This is the final report for the Presidential Early Career Award for Science and Engineering - PECASE (LDRD projects 93369 and 118841) awarded to Professor Yunfeng Lu (Tulane University and University of California-Los Angeles). During the last decade, mesoporous materials with tunable periodic pores have been synthesized using surfactant liquid crystalline as templates, opening a new avenue for a wide spectrum of applications. However, the applications are somewhat limited by the unfavorabe pore orientation of these materials. Although substantial effort has been devoted to align the pore channels, fabrication of mesoporous materials with perpendicular pore channels remains challenging. This project focused on fabrication of mesoporous materials with perpendicularly aligned pore channels. We demonstrated structures for use in water purification, separation, sensors, templated synthesis, microelectronics, optics, controlled release, and highly selective catalysts.

  13. Shuttle onboard IMU alignment methods

    NASA Technical Reports Server (NTRS)

    Henderson, D. M.

    1976-01-01

    The current approach to the shuttle IMU alignment is based solely on the Apollo Deterministic Method. This method is simple, fast, reliable and provides an accurate estimate for the present cluster to mean of 1,950 transformation matrix. If four or more star sightings are available, the application of least squares analysis can be utilized. The least squares method offers the next level of sophistication to the IMU alignment solution. The least squares method studied shows that a more accurate estimate for the misalignment angles is computed, and the IMU drift rates are a free by-product of the analysis. Core storage requirements are considerably more; estimated 20 to 30 times the core required for the Apollo Deterministic Method. The least squares method offers an intermediate solution utilizing as much data that is available without a complete statistical analysis as in Kalman filtering.

  14. Microwave hematoma detector

    DOEpatents

    Haddad, Waleed S.; Trebes, James E.; Matthews, Dennis L.

    2001-01-01

    The Microwave Hematoma Detector is a non-invasive device designed to detect and localize blood pooling and clots near the outer surface of the body. While being geared towards finding sub-dural and epi-dural hematomas, the device can be used to detect blood pooling anywhere near the surface of the body. Modified versions of the device can also detect pneumothorax, organ hemorrhage, atherosclerotic plaque in the carotid arteries, evaluate perfusion (blood flow) at or near the body surface, body tissue damage at or near the surface (especially for burn assessment) and be used in a number of NDE applications. The device is based on low power pulsed microwave technology combined with a specialized antenna, signal processing/recognition algorithms and a disposable cap worn by the patient which will facilitate accurate mapping of the brain and proper function of the instrument. The invention may be used for rapid, non-invasive detection of sub-dural or epi-dural hematoma in human or animal patients, detection of hemorrhage within approximately 5 cm of the outer surface anywhere on a patient's body.

  15. SIM Lite: Ground Alignment of the Instrument

    NASA Technical Reports Server (NTRS)

    Dekens, Frank G.; Goullioud, Renaud; Nicaise, Fabien; Kuan, Gary; Morales, Mauricio

    2010-01-01

    We present the start of the ground alignment plan for the SIM Lite Instrument. We outline the integration and alignment of the individual benches on which all the optics are mounted, and then the alignment of the benches to form the Science and Guide interferometers. The Instrument has a guide interferometer with only a 40 arc-seconds field of regard, and 200 arc-seconds of alignment adjustability. This requires each sides of the interferometer to be aligned to a fraction of that, while at the same time be orthogonal to the baseline defined by the External Metrology Truss. The baselines of the Science and Guide interferometers must also be aligned to be parallel. The start of these alignment plans is captured in a SysML Instrument System model, in the form of activity diagrams. These activity diagrams are then related to the hardware design and requirements. We finish with future plans for the alignment and integration activities and requirements.

  16. Threaded pilot insures cutting tool alignment

    NASA Technical Reports Server (NTRS)

    Goldman, R.; Schneider, W. E.

    1966-01-01

    Threaded pilot allows machining of a port component, or boss, after the reciprocating hole has been threaded. It is used to align cutting surfaces with the boss threads, thus insuring precision alignment.

  17. Fiber alignment apparatus and method

    DOEpatents

    Kravitz, S.H.; Warren, M.E.; Snipes, M.B. Jr.; Armendariz, M.G.; Word, J.C. V

    1997-08-19

    A fiber alignment apparatus includes a micro-machined nickel spring that captures and locks arrays of single mode fibers into position. The design consists of a movable nickel leaf shaped spring and a fixed pocket where fibers are held. The fiber is slid between the spring and a fixed block, which tensions the spring. When the fiber reaches the pocket, it automatically falls into the pocket and is held by the pressure of the leaf spring. 8 figs.

  18. Fiber alignment apparatus and method

    DOEpatents

    Kravitz, Stanley H.; Warren, Mial Evans; Snipes, Jr., Morris Burton; Armendariz, Marcelino Guadalupe; Word, V., James Cole

    1997-01-01

    A fiber alignment apparatus includes a micro-machined nickel spring that captures and locks arrays of single mode fibers into position. The design consists of a movable nickel leaf shaped spring and a fixed pocket where fibers are held. The fiber is slid between the spring and a fixed block, which tensions the spring. When the fiber reaches the pocket, it automatically falls into the pocket and is held by the pressure of the leaf spring.

  19. Alignment Tool For Welding Sensor

    NASA Technical Reports Server (NTRS)

    Gilbert, Jeffrey L.; Steffins, Alfred P.

    1992-01-01

    Alignment tool enables accurate positioning of optoelectronic sensor measuring weld penetration. Designed for use on tungsten/inert-gas welding apparatus, used to adjust position of sensor so photodiode puts out maximum signal. Tangs of slotted cap bent slightly inward to provide spring force holding cap snugly on sensor mount. Tool installed and removed without aid of other tools. Length of pointer adjusted with set-screws. Used with variety of gas cup and electrode lengths.

  20. Experience in Aligning Anatomical Ontologies.

    PubMed

    Zhang, Songmao; Bodenreider, Olivier

    2007-01-01

    An ontology is a formal representation of a domain modeling the entities in the domain and their relations. When a domain is represented by multiple ontologies, there is need for creating mappings among these ontologies in order to facilitate the integration of data annotated with these ontologies and reasoning across ontologies. The objective of this paper is to recapitulate our experience in aligning large anatomical ontologies and to reflect on some of the issues and challenges encountered along the way. The four anatomical ontologies under investigation are the Foundational Model of Anatomy, GALEN, the Adult Mouse Anatomical Dictionary and the NCI Thesaurus. Their underlying representation formalisms are all different. Our approach to aligning concepts (directly) is automatic, rule-based, and operates at the schema level, generating mostly point-to-point mappings. It uses a combination of domain-specific lexical techniques and structural and semantic techniques (to validate the mappings suggested lexically). It also takes advantage of domain-specific knowledge (lexical knowledge from external resources such as the Unified Medical Language System, as well as knowledge augmentation and inference techniques). In addition to point-to-point mapping of concepts, we present the alignment of relationships and the mapping of concepts group-to-group. We have also successfully tested an indirect alignment through a domain-specific reference ontology. We present an evaluation of our techniques, both against a gold standard established manually and against a generic schema matching system. The advantages and limitations of our approach are analyzed and discussed throughout the paper.