Science.gov

Sample records for detector alignment algorithm

  1. The GEM Detector projective alignment simulation system

    SciTech Connect

    Wuest, C.R.; Belser, F.C.; Holdener, F.R.; Roeben, M.D.; Paradiso, J.A.; Mitselmakher, G.; Ostapchuk, A.; Pier-Amory, J.

    1993-07-09

    Precision position knowledge (< 25 microns RMS) of the GEM Detector muon system at the Superconducting Super Collider Laboratory (SSCL) is an important physics requirement necessary to minimize sagitta error in detecting and tracking high energy muons that are deflected by the magnetic field within the GEM Detector. To validate the concept of the sagitta correction function determined by projective alignment of the muon detectors (Cathode Strip Chambers or CSCs), the basis of the proposed GEM alignment scheme, a facility, called the ``Alignment Test Stand`` (ATS), is being constructed. This system simulates the environment that the CSCs and chamber alignment systems are expected to experience in the GEM Detector, albeit without the 0.8 T magnetic field and radiation environment. The ATS experimental program will allow systematic study and characterization of the projective alignment approach, as well as general mechanical engineering of muon chamber mounting concepts, positioning systems and study of the mechanical behavior of the proposed 6 layer CSCs. The ATS will consist of a stable local coordinate system in which mock-ups of muon chambers (i.e., non-working mechanical analogs, representing the three superlayers of a selected barrel and endcap alignment tower) are implemented, together with a sufficient number of alignment monitors to overdetermine the sagitta correction function, providing a self-consistency check. This paper describes the approach to be used for the alignment of the GEM muon system, the design of the ATS, and the experiments to be conducted using the ATS.

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

  3. FOGSAA: Fast Optimal Global Sequence Alignment Algorithm

    NASA Astrophysics Data System (ADS)

    Chakraborty, Angana; Bandyopadhyay, Sanghamitra

    2013-04-01

    In this article we propose a Fast Optimal Global Sequence Alignment Algorithm, FOGSAA, which aligns a pair of nucleotide/protein sequences faster than any optimal global alignment method including the widely used Needleman-Wunsch (NW) algorithm. FOGSAA is applicable for all types of sequences, with any scoring scheme, and with or without affine gap penalty. Compared to NW, FOGSAA achieves a time gain of (70-90)% for highly similar nucleotide sequences (> 80% similarity), and (54-70)% for sequences having (30-80)% similarity. For other sequences, it terminates with an approximate score. For protein sequences, the average time gain is between (25-40)%. Compared to three heuristic global alignment methods, the quality of alignment is improved by about 23%-53%. FOGSAA is, in general, suitable for aligning any two sequences defined over a finite alphabet set, where the quality of the global alignment is of supreme importance.

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

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

  6. Metal detector depth estimation algorithms

    NASA Astrophysics Data System (ADS)

    Marble, Jay; McMichael, Ian

    2009-05-01

    This paper looks at depth estimation techniques using electromagnetic induction (EMI) metal detectors. Four algorithms are considered. The first utilizes a vertical gradient sensor configuration. The second is a dual frequency approach. The third makes use of dipole and quadrapole receiver configurations. The fourth looks at coils of different sizes. Each algorithm is described along with its associated sensor. Two figures of merit ultimately define algorithm/sensor performance. The first is the depth of penetration obtainable. (That is, the maximum detection depth obtainable.) This describes the performance of the method to achieve detection of deep targets. The second is the achievable statistical depth resolution. This resolution describes the precision with which depth can be estimated. In this paper depth of penetration and statistical depth resolution are qualitatively determined for each sensor/algorithm. A scientific method is used to make these assessments. A field test was conducted using 2 lanes with emplaced UXO. The first lane contains 155 shells at increasing depths from 0" to 48". The second is more realistic containing objects of varying size. The first lane is used for algorithm training purposes, while the second is used for testing. The metal detectors used in this study are the: Geonics EM61, Geophex GEM5, Minelab STMR II, and the Vallon VMV16.

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

  8. Alignment of the NOvA Detectors

    NASA Astrophysics Data System (ADS)

    Bending, Sebastian; NOvA Collaboration

    2017-01-01

    NOvA is a long-baseline neutrino oscillation experiment intended to probe the neutrino mass hierarchy and provide constraints on CP violation in the neutrino sector. The experiment consists of a Near Detector at Fermilab and a Far Detector 810 km away at Ash River, Minnesota, both of which receive neutrinos from the NuMI beamline. The misalignment of elements within the detectors contributes to systematic uncertainties in NOvA measurements. A procedure to determine and correct for detector misalignments through the use of cosmic ray muon tracks will be presented.

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

    PubMed

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

    2015-10-05

    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.

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

  11. Novel hybrid genetic algorithm for progressive multiple sequence alignment.

    PubMed

    Afridi, Muhammad Ishaq

    2013-01-01

    The family of evolutionary or genetic algorithms is used in various fields of bioinformatics. Genetic algorithms (GAs) can be used for simultaneous comparison of a large pool of DNA or protein sequences. This article explains how the GA is used in combination with other methods like the progressive multiple sequence alignment strategy to get an optimal multiple sequence alignment (MSA). Optimal MSA get much importance in the field of bioinformatics and some other related disciplines. Evolutionary algorithms evolve and improve their performance. In this optimisation, the initial pair-wise alignment is achieved through a progressive method and then a good objective function is used to select and align more alignments and profiles. Child and subpopulation initialisation is based upon changes in the probability of similarity or the distance matrix of the alignment population. In this genetic algorithm, optimisation of mutation, crossover and migration in the population of candidate solution reflect events of natural organic evolution.

  12. Protein multiple sequence alignment by hybrid bio-inspired algorithms.

    PubMed

    Cutello, Vincenzo; Nicosia, Giuseppe; Pavone, Mario; Prizzi, Igor

    2011-03-01

    This article presents an immune inspired algorithm to tackle the Multiple Sequence Alignment (MSA) problem. MSA is one of the most important tasks in biological sequence analysis. Although this paper focuses on protein alignments, most of the discussion and methodology may also be applied to DNA alignments. The problem of finding the multiple alignment was investigated in the study by Bonizzoni and Vedova and Wang and Jiang, and proved to be a NP-hard (non-deterministic polynomial-time hard) problem. The presented algorithm, called Immunological Multiple Sequence Alignment Algorithm (IMSA), incorporates two new strategies to create the initial population and specific ad hoc mutation operators. It is based on the 'weighted sum of pairs' as objective function, to evaluate a given candidate alignment. IMSA was tested using both classical benchmarks of BAliBASE (versions 1.0, 2.0 and 3.0), and experimental results indicate that it is comparable with state-of-the-art multiple alignment algorithms, in terms of quality of alignments, weighted Sums-of-Pairs (SP) and Column Score (CS) values. The main novelty of IMSA is its ability to generate more than a single suboptimal alignment, for every MSA instance; this behaviour is due to the stochastic nature of the algorithm and of the populations evolved during the convergence process. This feature will help the decision maker to assess and select a biologically relevant multiple sequence alignment. Finally, the designed algorithm can be used as a local search procedure to properly explore promising alignments of the search space.

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

  14. Splign: algorithms for computing spliced alignments with identification of paralogs

    PubMed Central

    Kapustin, Yuri; Souvorov, Alexander; Tatusova, Tatiana; Lipman, David

    2008-01-01

    Background The computation of accurate alignments of cDNA sequences against a genome is at the foundation of modern genome annotation pipelines. Several factors such as presence of paralogs, small exons, non-consensus splice signals, sequencing errors and polymorphic sites pose recognized difficulties to existing spliced alignment algorithms. Results We describe a set of algorithms behind a tool called Splign for computing cDNA-to-Genome alignments. The algorithms include a high-performance preliminary alignment, a compartment identification based on a formally defined model of adjacent duplicated regions, and a refined sequence alignment. In a series of tests, Splign has produced more accurate results than other tools commonly used to compute spliced alignments, in a reasonable amount of time. Conclusion Splign's ability to deal with various issues complicating the spliced alignment problem makes it a helpful tool in eukaryotic genome annotation processes and alternative splicing studies. Its performance is enough to align the largest currently available pools of cDNA data such as the human EST set on a moderate-sized computing cluster in a matter of hours. The duplications identification (compartmentization) algorithm can be used independently in other areas such as the study of pseudogenes. Reviewers This article was reviewed by: Steven Salzberg, Arcady Mushegian and Andrey Mironov (nominated by Mikhail Gelfand). PMID:18495041

  15. TM-align: a protein structure alignment algorithm based on the TM-score

    PubMed Central

    Zhang, Yang; Skolnick, Jeffrey

    2005-01-01

    We have developed TM-align, a new algorithm to identify the best structural alignment between protein pairs that combines the TM-score rotation matrix and Dynamic Programming (DP). The algorithm is ∼4 times faster than CE and 20 times faster than DALI and SAL. On average, the resulting structure alignments have higher accuracy and coverage than those provided by these most often-used methods. TM-align is applied to an all-against-all structure comparison of 10 515 representative protein chains from the Protein Data Bank (PDB) with a sequence identity cutoff <95%: 1996 distinct folds are found when a TM-score threshold of 0.5 is used. We also use TM-align to match the models predicted by TASSER for solved non-homologous proteins in PDB. For both folded and misfolded models, TM-align can almost always find close structural analogs, with an average root mean square deviation, RMSD, of 3 Å and 87% alignment coverage. Nevertheless, there exists a significant correlation between the correctness of the predicted structure and the structural similarity of the model to the other proteins in the PDB. This correlation could be used to assist in model selection in blind protein structure predictions. The TM-align program is freely downloadable at . PMID:15849316

  16. Learning Deep Sharable and Structural Detectors for Face Alignment.

    PubMed

    Liu, Hao; Lu, Jiwen; Feng, Jianjiang; Zhou, Jie

    2017-04-01

    Face alignment aims at localizing multiple facial landmarks for a given facial image, which usually suffers from large variances of diverse facial expressions, aspect ratios and partial occlusions, especially when face images were captured in wild conditions. Conventional face alignment methods extract local features and then directly concatenate these features for global shape regression. Unlike these methods which cannot explicitly model the correlation of neighbouring landmarks and motivated by the fact that individual landmarks are usually correlated, we propose a deep sharable and structural detectors (DSSD) method for face alignment. To achieve this, we firstly develop a structural feature learning method to explicitly exploit the correlation of neighbouring landmarks, which learns to cover semantic information to disambiguate the neighbouring landmarks. Moreover, our model selectively learns a subset of sharable latent tasks across neighbouring landmarks under the paradigm of the multi-task learning framework, so that the redundancy information of the overlapped patches can be efficiently removed. To better improve the performance, we extend our DSSD to a recurrent DSSD (R-DSSD) architecture by integrating with the complementary information from multi-scale perspectives. Experimental results on the widely used benchmark datasets show that our methods achieve very competitive performance compared to the state-of-the-arts.

  17. Genetic algorithms with permutation coding for multiple sequence alignment.

    PubMed

    Ben Othman, Mohamed Tahar; Abdel-Azim, Gamil

    2013-08-01

    Multiple sequence alignment (MSA) is one of the topics of bio informatics that has seriously been researched. It is known as NP-complete problem. It is also considered as one of the most important and daunting tasks in computational biology. Concerning this a wide number of heuristic algorithms have been proposed to find optimal alignment. Among these heuristic algorithms are genetic algorithms (GA). The GA has mainly two major weaknesses: it is time consuming and can cause local minima. One of the significant aspects in the GA process in MSA is to maximize the similarities between sequences by adding and shuffling the gaps of Solution Coding (SC). Several ways for SC have been introduced. One of them is the Permutation Coding (PC). We propose a hybrid algorithm based on genetic algorithms (GAs) with a PC and 2-opt algorithm. The PC helps to code the MSA solution which maximizes the gain of resources, reliability and diversity of GA. The use of the PC opens the area by applying all functions over permutations for MSA. Thus, we suggest an algorithm to calculate the scoring function for multiple alignments based on PC, which is used as fitness function. The time complexity of the GA is reduced by using this algorithm. Our GA is implemented with different selections strategies and different crossovers. The probability of crossover and mutation is set as one strategy. Relevant patents have been probed in the topic.

  18. ParAlign: a parallel sequence alignment algorithm for rapid and sensitive database searches.

    PubMed

    Rognes, T

    2001-04-01

    There is a need for faster and more sensitive algorithms for sequence similarity searching in view of the rapidly increasing amounts of genomic sequence data available. Parallel processing capabilities in the form of the single instruction, multiple data (SIMD) technology are now available in common microprocessors and enable a single microprocessor to perform many operations in parallel. The ParAlign algorithm has been specifically designed to take advantage of this technology. The new algorithm initially exploits parallelism to perform a very rapid computation of the exact optimal ungapped alignment score for all diagonals in the alignment matrix. Then, a novel heuristic is employed to compute an approximate score of a gapped alignment by combining the scores of several diagonals. This approximate score is used to select the most interesting database sequences for a subsequent Smith-Waterman alignment, which is also parallelised. The resulting method represents a substantial improvement compared to existing heuristics. The sensitivity and specificity of ParAlign was found to be as good as Smith-Waterman implementations when the same method for computing the statistical significance of the matches was used. In terms of speed, only the significantly less sensitive NCBI BLAST 2 program was found to outperform the new approach. Online searches are available at http://dna.uio.no/search/

  19. Net2Align: An Algorithm For Pairwise Global Alignment of Biological Networks

    PubMed Central

    Wadhwab, Gulshan; Upadhyayaa, K. C.

    2016-01-01

    The amount of data on molecular interactions is growing at an enormous pace, whereas the progress of methods for analysing this data is still lacking behind. Particularly, in the area of comparative analysis of biological networks, where one wishes to explore the similarity between two biological networks, this holds a potential problem. In consideration that the functionality primarily runs at the network level, it advocates the need for robust comparison methods. In this paper, we describe Net2Align, an algorithm for pairwise global alignment that can perform node-to-node correspondences as well as edge-to-edge correspondences into consideration. The uniqueness of our algorithm is in the fact that it is also able to detect the type of interaction, which is essential in case of directed graphs. The existing algorithm is only able to identify the common nodes but not the common edges. Another striking feature of the algorithm is that it is able to remove duplicate entries in case of variable datasets being aligned. This is achieved through creation of a local database which helps exclude duplicate links. In a pervasive computational study on gene regulatory network, we establish that our algorithm surpasses its counterparts in its results. Net2Align has been implemented in Java 7 and the source code is available as supplementary files. PMID:28356678

  20. A pairwise alignment algorithm which favors clusters of blocks.

    PubMed

    Nédélec, Elodie; Moncion, Thomas; Gassiat, Elisabeth; Bossard, Bruno; Duchateau-Nguyen, Guillemette; Denise, Alain; Termier, Michel

    2005-01-01

    Pairwise sequence alignments aim to decide whether two sequences are related and, if so, to exhibit their related domains. Recent works have pointed out that a significant number of true homologous sequences are missed when using classical comparison algorithms. This is the case when two homologous sequences share several little blocks of homology, too small to lead to a significant score. On the other hand, classical alignment algorithms, when detecting homologies, may fail to recognize all the significant biological signals. The aim of the paper is to give a solution to these two problems. We propose a new scoring method which tends to increase the score of an alignment when "blocks" are detected. This so-called Block-Scoring algorithm, which makes use of dynamic programming, is worth being used as a complementary tool to classical exact alignments methods. We validate our approach by applying it on a large set of biological data. Finally, we give a limit theorem for the score statistics of the algorithm.

  1. Incremental Window-based Protein Sequence Alignment Algorithms

    DTIC Science & Technology

    2006-03-23

    Huzefa Rangwala and George Karypis March 23, 2006 Report Documentation Page Form ApprovedOMB No. 0704-0188 Public reporting burden for the collection of... Form 298 (Rev. 8-98) Prescribed by ANSI Std Z39-18 Incremental Window-based Protein Sequence Alignment Algorithms Huzefa Rangwala and George Karypis...Then it per- forms a series of iterations in which it performs the following three steps: First, it extracts from ’ the residue-pair with the highest

  2. Terahertz detectors arrays based on orderly aligned InN nanowires

    NASA Astrophysics Data System (ADS)

    Chen, Xuechen; Liu, Huiqiang; Li, Qiuguo; Chen, Hao; Peng, Rufang; Chu, Sheng; Cheng, Binbin

    2015-08-01

    Nanostructured terahertz detectors employing a single semiconducting nanowire or graphene sheet have recently generated considerable interest as an alternative to existing THz technologies, for their merit on the ease of fabrication and above-room-temperature operation. However, the lack of alignment in nanostructure device hindered their potential toward practical applications. The present work reports ordered terahertz detectors arrays based on neatly aligned InN nanowires. The InN nanostructures (nanowires and nano-necklaces) were achieved by chemical vapor deposition growth, and then InN nanowires were successfully transferred and aligned into micrometer-sized groups by a “transfer-printing” method. Field effect transistors on aligned nanowires were fabricated and tested for terahertz detection purpose. The detector showed good photoresponse as well as low noise level. Besides, dense arrays of such detectors were also fabricated, which rendered a peak responsivity of 1.1 V/W from 7 detectors connected in series.

  3. Terahertz detectors arrays based on orderly aligned InN nanowires

    PubMed Central

    Chen, Xuechen; Liu, Huiqiang; Li, Qiuguo; Chen, Hao; Peng, Rufang; Chu, Sheng; Cheng, Binbin

    2015-01-01

    Nanostructured terahertz detectors employing a single semiconducting nanowire or graphene sheet have recently generated considerable interest as an alternative to existing THz technologies, for their merit on the ease of fabrication and above-room-temperature operation. However, the lack of alignment in nanostructure device hindered their potential toward practical applications. The present work reports ordered terahertz detectors arrays based on neatly aligned InN nanowires. The InN nanostructures (nanowires and nano-necklaces) were achieved by chemical vapor deposition growth, and then InN nanowires were successfully transferred and aligned into micrometer-sized groups by a “transfer-printing” method. Field effect transistors on aligned nanowires were fabricated and tested for terahertz detection purpose. The detector showed good photoresponse as well as low noise level. Besides, dense arrays of such detectors were also fabricated, which rendered a peak responsivity of 1.1 V/W from 7 detectors connected in series. PMID:26289498

  4. Median filtering algorithms for multichannel detectors

    NASA Astrophysics Data System (ADS)

    Hovhannisyan, A.; Chilingarian, A.

    2011-05-01

    Particle detectors of worldwide networks are continuously measuring various secondary particle fluxes incident on Earth surface. At the Aragats Space Environmental Center (ASEC), the data of 12 cosmic ray particle detectors with a total of ˜280 measuring channels (count rates of electrons, muons and neutrons channels) are sent each minute via wireless bridges to a MySQL database. These time series are used for the different tasks of off-line physical analysis and for online forewarning services. Usually long time series contain several types of errors (gaps due to failures of high or low voltage power supply, spurious spikes due to radio interferences, abrupt changes of mean values of several channels or/and slowly trends in mean values due to aging of electronics components, etc.). To avoid erroneous physical inference and false alarms of alerting systems we introduce offline and online filters to "purify" multiple time-series. In the presented paper we classify possible mistakes in time series and introduce median filtering algorithms for online and off-line "purification" of multiple time-series.

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

  6. Real-time alignment and cali bration of the LHCb Detector in Run II

    NASA Astrophysics Data System (ADS)

    Dujany, Giulio; Storaci, Barbara

    2015-12-01

    Stable, precise spatial alignment and PID calibration are necessary to achieve optimal detector performance. During Run2, LHCb will have a new real-time detector alignment and calibration to allow equivalent performance in the online and offline reconstruction to be reached. This offers the opportunity to optimise the event selection by applying stronger constraints, and to use hadronic particle identification at the trigger level. The computing time constraints are met through the use of a new dedicated framework using the multi-core farm infrastructure for the trigger. The motivation for a real-time alignment and calibration of the LHCb detector is discussed from the operative and physics performance point of view. Specific challenges of this configuration are discussed, as well as the designed framework and its performance.

  7. Novel time-dependent alignment of the ATLAS Inner Detector in the LHC Run 2

    NASA Astrophysics Data System (ADS)

    Jiménez Peña, J.

    2016-11-01

    ATLAS is a multipurpose experiment at the LHC proton-proton collider. Its physics goals require an unbiased and high resolution measurement of the charged particle kinematic parameters. These critically depend on the layout and performance of the tracking system and the quality of the alignment of its components. For the LHC Run 2, the system has been upgraded with the installation of a new pixel layer, the Insertable B-layer (IBL) . ATLAS Inner Detector alignment framework has been adapted and upgraded to correct very short time scale movements of the sub-detectors. In particular, a mechanical distortion of the IBL staves up to 20 μm and a vertical displacement of the Pixel detector of ~ 6 μm have been observed during data-taking. The techniques used to correct for these effects and to match the required Inner Detector performance will be presented.

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

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

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

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

  13. Novel real-time alignment and calibration of the LHCb detector and its performance

    NASA Astrophysics Data System (ADS)

    Borghi, S.

    2017-02-01

    The LHCb detector is a forward spectrometer at the LHC, designed to perform high precision studies of B and D hadrons. In Run II of the LHC, a new scheme for the software trigger at LHCb allows splitting the triggering of events in two stages, giving room to perform the detector alignment and calibration in real time. In the novel detector alignment and calibration strategy for Run II, data collected at the start of the fill are processed in a few minutes and used to update the alignment constants, while the calibration constants are evaluated for each run. This allows identical constants to be used in the online and offline reconstruction, thus improving the correlation between triggered and offline selected events. The required computing time constraints are met thanks to a new dedicated framework using the multi-core farm infrastructure for the trigger. The larger timing budget, available in the trigger, allows us to perform the same track reconstruction online and offline. This enables LHCb to achieve the best reconstruction performance already in the trigger, and allows physics analyses to be performed directly on the data produced by the trigger reconstruction. The novel real-time processing strategy at LHCb is discussed from both the technical and operational point of view. The overall performance of the LHCb detector on the data of Run II is presented as well.

  14. Chimeric alignment by dynamic programming: Algorithm and biological uses

    SciTech Connect

    Komatsoulis, G.A.; Waterman, M.S.

    1997-12-01

    A new nearest-neighbor method for detecting chimeric 16S rRNA artifacts generated during PCR amplification from mixed populations has been developed. The method uses dynamic programming to generate an optimal chimeric alignment, defined as the highest scoring alignment between a query and a concatenation of a 5{prime} and a 3{prime} segment from two separate entries from a database of related sequences. Chimeras are detected by studying the scores and form of the chimeric and global sequence alignments. The chimeric alignment method was found to be marginally more effective than k-tuple based nearest-neighbor methods in simulation studies, but its most effective use is in concert with k-tuple methods. 15 refs., 3 figs., 1 tab.

  15. Multiple sequence alignment using multi-objective based bacterial foraging optimization algorithm.

    PubMed

    Rani, R Ranjani; Ramyachitra, D

    2016-12-01

    Multiple sequence alignment (MSA) is a widespread approach in computational biology and bioinformatics. MSA deals with how the sequences of nucleotides and amino acids are sequenced with possible alignment and minimum number of gaps between them, which directs to the functional, evolutionary and structural relationships among the sequences. Still the computation of MSA is a challenging task to provide an efficient accuracy and statistically significant results of alignments. In this work, the Bacterial Foraging Optimization Algorithm was employed to align the biological sequences which resulted in a non-dominated optimal solution. It employs Multi-objective, such as: Maximization of Similarity, Non-gap percentage, Conserved blocks and Minimization of gap penalty. BAliBASE 3.0 benchmark database was utilized to examine the proposed algorithm against other methods In this paper, two algorithms have been proposed: Hybrid Genetic Algorithm with Artificial Bee Colony (GA-ABC) and Bacterial Foraging Optimization Algorithm. It was found that Hybrid Genetic Algorithm with Artificial Bee Colony performed better than the existing optimization algorithms. But still the conserved blocks were not obtained using GA-ABC. Then BFO was used for the alignment and the conserved blocks were obtained. The proposed Multi-Objective Bacterial Foraging Optimization Algorithm (MO-BFO) was compared with widely used MSA methods Clustal Omega, Kalign, MUSCLE, MAFFT, Genetic Algorithm (GA), Ant Colony Optimization (ACO), Artificial Bee Colony (ABC), Particle Swarm Optimization (PSO) and Hybrid Genetic Algorithm with Artificial Bee Colony (GA-ABC). The final results show that the proposed MO-BFO algorithm yields better alignment than most widely used methods.

  16. Algorithms to identify detector Compton scatter in PET modules

    SciTech Connect

    Comanor, K.A.; Virador, P.R.G.; Moses, W.W.

    1996-08-01

    Using Monte Carlo simulation, the authors investigate algorithms to identify and correct for detector Compton scatter in hypothetical PET modules with 3 x 3 x 30 mm BGO crystals coupled to individual photosensors. Rather than assume a particular design, they study three classes of detectors: (1) with energy resolution limited by counting statistics, (2) with energy resolution limited by electronic noise, and (3) with depth of interaction (DOI) measurement capability. For the first two classes, selecting the channel with the highest signal as the crystal of interaction yields a 22--25% misidentification fraction (MIF) for all reasonable noise fwhm to signal (N/S) ratios (i.e. < 0.5 at 511 keV). Algorithms that attempt to correctly position events that undergo forward Compton scatter using only energy information can reduce the MIF to 12%, and can be easily realized with counting statistics limited detectors but can only be achieved with very low noise values for noise limited detectors. When using position of interaction to identify forward scatter, a MIF of 12% can be obtained if the detector has good energy and position resolution.

  17. Online processing in the ALICE DAQ The detector algorithms

    NASA Astrophysics Data System (ADS)

    Chapeland, S.; Altini, V.; Carena, F.; Carena, W.; Chibante Barroso, V.; Costa, F.; Divià, R.; Fuchs, U.; Makhlyueva, I.; Roukoutakis, F.; Schossmaier, K.; Soós, C.; Vande Vyvre, P.; von Haller, B.; ALICE Collaboration

    2010-04-01

    ALICE (A Large Ion Collider Experiment) is the heavy-ion detector designed to study the physics of strongly interacting matter and the quark-gluon plasma at the CERN Large Hadron Collider (LHC). Some specific calibration tasks are performed regularly for each of the 18 ALICE sub-detectors in order to achieve most accurate physics measurements. These procedures involve events analysis in a wide range of experimental conditions, implicating various trigger types, data throughputs, electronics settings, and algorithms, both during short sub-detector standalone runs and long global physics runs. A framework was designed to collect statistics and compute some of the calibration parameters directly online, using resources of the Data Acquisition System (DAQ), and benefiting from its inherent parallel architecture to process events. This system has been used at the experimental area for one year, and includes more than 30 calibration routines in production. This paper describes the framework architecture and the synchronization mechanisms involved at the level of the Experiment Control System (ECS) of ALICE. The software libraries interfacing detector algorithms (DA) to the online data flow, configuration database, experiment logbook, and offline system are reviewed. The test protocols followed to integrate and validate each sub-detector component are also discussed, including the automatic build system and validation procedures used to ensure a smooth deployment. The offline post-processing and archiving of the DA results is covered in a separate paper.

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

  19. Reconstruction algorithms for optoacoustic imaging based on fiber optic detectors

    NASA Astrophysics Data System (ADS)

    Lamela, Horacio; Díaz-Tendero, Gonzalo; Gutiérrez, Rebeca; Gallego, Daniel

    2011-06-01

    Optoacoustic Imaging (OAI), a novel hybrid imaging technology, offers high contrast, molecular specificity and excellent resolution to overcome limitations of the current clinical modalities for detection of solid tumors. The exact time-domain reconstruction formula produces images with excellent resolution but poor contrast. Some approximate time-domain filtered back-projection reconstruction algorithms have also been reported to solve this problem. A wavelet transform implementation filtering can be used to sharpen object boundaries while simultaneously preserving high contrast of the reconstructed objects. In this paper, several algorithms, based on Back Projection (BP) techniques, have been suggested to process OA images in conjunction with signal filtering for ultrasonic point detectors and integral detectors. We apply these techniques first directly to a numerical generated sample image and then to the laserdigitalized image of a tissue phantom, obtaining in both cases the best results in resolution and contrast for a waveletbased filter.

  20. How to align a new detector and micro shutter inside JWST's Near Infrared Spectrograph (NIRSpec)

    NASA Astrophysics Data System (ADS)

    te Plate, Maurice; Rumler, Peter; Jensen, Peter; Eder, Robert; Ehrenwinkler, Ralf; Merkle, Frank; Roedel, Andreas; Speckmaier, Max; Johnson, Thomas E.; Mott, Brent; Snodgrass, Stephen; Gunn, Chris; Ward, Justin

    2016-09-01

    JWST will be the biggest space telescope ever built and it will lead to astounding scientific breakthroughs. The mission will be launched in October 2018 from Kourou, French Guyana by an ESA provided Ariane 5 rocket. NIRSpec, one of the four instruments on board of the mission, recently underwent a major upgrade. New infrared detectors were installed and the Micro Shutter Assembly (MSA) was replaced as well. The rework was necessary because both systems were found to be degrading beyond a level that could be accepted. The installation and "in situ" alignment of these new systems required special techniques and alignment jigs that will be described in this paper. Some first results will be presented as well.

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

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

    PubMed

    Law, Brian; Bader, Gary D

    2015-07-13

    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.

  3. Efficient dynamic programming algorithm with prior knowledge for protein β-strand alignment.

    PubMed

    Sabzekar, Mostafa; Naghibzadeh, Mahmoud; Sadri, Javad

    2017-03-21

    One of the main tasks towards the prediction of protein β-sheet structure is to predict the native alignment of β-strands. The alignment of two β-strands defines similar regions that may reflect functional, structural, or evolutionary relationships between them. Therefore, any improvement in β-strands alignment not only reduces the computational search space but also improves β-sheet structure prediction accuracy. To define the alignment scores, previous studies utilized predicted residue-residue contacts (contact maps). However, there are two serious problems using them. First, the precision of contact map prediction techniques, especially for long-range contacts (i.e., β-residues), is still not satisfactory. Second, the residue-residue contact predictors usually utilize general properties of amino acids and disregard the structural features of β-residues. In this paper, we consider β-structure information, which is estimated from protein β-sheet data sets, as alignment scores. However, the predicted contact maps are used as a prior knowledge about residues. They are used for strengthening or weakening the alignment scores in our algorithm. Thus, we can utilize both β-residues and β-structure information in alignment of β-strands. The structure of dynamic programming of the alignment algorithm is changed in order to work with our prior knowledge. Moreover, the Four Russians method is applied to the proposed alignment algorithm in order to reduce the time complexity of the problem. For evaluating the proposed method, we applied it to the state-of-the-art β-sheet structure prediction methods. The experimental results on the BetaSheet916 data set showed significant improvements in the execution time, the accuracy of β-strands' alignment and consequently β-sheet structure prediction accuracy. The results are available at http://conceptsgate.com/BetaSheet.

  4. GLOBAL PEAK ALIGNMENT FOR COMPREHENSIVE TWO-DIMENSIONAL GAS CHROMATOGRAPHY MASS SPECTROMETRY USING POINT MATCHING ALGORITHMS

    PubMed Central

    Deng, Beichuan; Kim, Seongho; Li, Hengguang; Heath, Elisabeth; Zhang, Xiang

    2016-01-01

    Comprehensive two-dimensional gas chromatography coupled with mass spectrometry (GC×GC-MS) has been used to analyze multiple samples in a metabolomics study. However, due to some uncontrollable experimental conditions, such as the differences in temperature or pressure, matrix effects on samples, and stationary phase degradation, there is always a shift of retention times in the two GC columns between samples. In order to correct the retention time shifts in GC×GC-MS, the peak alignment is a crucial data analysis step to recognize the peaks generated by the same metabolite in different samples. Two approaches have been developed for GC×GC-MS data alignment: profile alignment and peak matching alignment. However, these existing alignment methods are all based on a local alignment, resulting that a peak may not be correctly aligned in a dense chromatographic region where many peaks are present in a small region. False alignment will result in false discovery in the downstream statistical analysis. We, therefore, develop a global comparison based peak alignment method using point matching algorithm (PMA-PA) for both homogeneous and heterogeneous data. The developed algorithm PMA-PA first extracts feature points (peaks) in the chromatography and then searches globally the matching peaks in the consecutive chromatography by adopting the projection of rigid and non-rigid transformation. PMA-PA is further applied to two real experimental data sets, showing that PMA-PA is a promising peak alignment algorithm for both homogenous and heterogeneous data in terms of F1 score, although it uses only peak location information. PMID:27650662

  5. A Multithreaded Algorithm for Network Alignment Via Approximate Matching

    SciTech Connect

    Khan, Arif; Gleich, David F.; Pothen, Alex; Halappanavar, Mahantesh

    2012-11-16

    Network alignment is an optimization problem to find the best one-to-one map between the vertices of a pair of graphs that overlaps in as many edges as possible. It is a relaxation of the graph isomorphism problem and is closely related to the subgraph isomorphism problem. The best current approaches are entirely heuristic, and are iterative in nature. They generate real-valued heuristic approximations that must be rounded to find integer solutions. This rounding requires solving a bipartite maximum weight matching problem at each step in order to avoid missing high quality solutions. We investigate substituting a parallel, half-approximation for maximum weight matching instead of an exact computation. Our experiments show that the resulting difference in solution quality is negligible. We demonstrate almost a 20-fold speedup using 40 threads on an 8 processor Intel Xeon E7-8870 system (from 10 minutes to 36 seconds).

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

  7. Compact cryogenic self-aligning fiber-to-detector coupling with losses below one percent.

    PubMed

    Miller, Aaron J; Lita, Adriana E; Calkins, Brice; Vayshenker, Igor; Gruber, Steven M; Nam, Sae Woo

    2011-05-09

    We present a compact packaging technique for coupling light from a single-mode telecommunication fiber to cryogenic single-photon sensitive devices. Our single-photon detectors are superconducting transition-edge sensors (TESs) with a collection area only a factor of a few larger than the area of the fiber core which presents significant challenges to low-loss fiber-to-detector coupling. The coupling method presented here has low loss, cryogenic compatibility, easy and reproducible assembly and low component cost. The system efficiency of the packaged single-photon counting detectors is verified by the "triplet method" of power-source calibration along with the "multiple attenuator" method that produces a calibrated single-photon flux. These calibration techniques, when used in combination with through-wafer imaging and fiber back-reflection measurements, give us confidence that we have achieved coupling losses below 1% for all devices packaged according to the self-alignment method presented in this paper.

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

    DTIC Science & Technology

    2007-09-01

    correlation coefficient , or some comparable detection statistic, exceeds a given threshold. Since these methods exploit characteristic details of the full waveform, they provide exquisitely sensitive detectors with far lower detection thresholds than typical short-term average/long-term average (STA/LTA) algorithms. The drawback is that the form of the sought-after signal needs to be known quite accurately a priori, which limits such methods to instances of seismicity whereby a very similar signal has already been observed by every station used. Such instances include

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

  10. Focal plane alignment and detector characterization for the Subaru prime focus spectrograph

    NASA Astrophysics Data System (ADS)

    Hart, Murdock; Barkhouser, Robert H.; Carr, Michael; Golebiowski, Mirek; Gunn, James E.; Hope, Stephen C.; Smee, Stephen A.

    2014-07-01

    We describe the infrastructure being developed to align and characterize the detectors for the Subaru Measure- ment of Images and Redshifts (SuMIRe) Prime Focus Spectrograph (PFS). PFS will employ four three-channel spectrographs with an operating wavelength range of 3800 °A to 12600 °A. Each spectrograph will be comprised of two visible channels and one near infrared (NIR) channel, where each channel will use a separate Schmidt camera to image the captured spectra onto their respective detectors. In the visible channels, Hamamatsu 2k × 4k CCDs will be mounted in pairs to create a single 4k × 4k detector, while the NIR channel will use a single Teledyne 4k × 4k H4RG HgCdTe device. The fast f/1.1 optics of the Schmidt cameras will give a shallow depth of focus necessitating an optimization of the focal plane array flatness. The minimum departure from flatness of the focal plane array for the visible channels is set the by the CCD flatness, typically 10 μm peak-to-valley. We will adjust the coplanarity for a pair of CCDs such that the flatness of the array is consistent with the flatness of the detectors themselves. To achieve this we will use an optical non-contact measurement system to measure surface flatness and coplanarity at both ambient and operating temperatures, and use shims to adjust the coplanarity of the CCDs. We will characterize the performance of the detectors for PFS consistent with the scientific goals for the project. To this end we will measure the gain, linearity, full well, quantum efficiency (QE), charge diffusion, charge transfer inefficiency (CTI), and noise properties of these devices. We also desire to better understand the non-linearity of the photon transfer curve for the CCDs, and the charge persistence/reciprocity problems of the HgCdTe devices. To enable the metrology and characterization of these detectors we are building two test cryostats nearly identical in design. The first test cryostat will primarily be used for the

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

  12. An efficient algorithm for pairwise local alignment of protein interaction networks

    DOE PAGES

    Chen, Wenbin; Schmidt, Matthew; Tian, Wenhong; ...

    2015-04-01

    Recently, researchers seeking to understand, modify, and create beneficial traits in organisms have looked for evolutionarily conserved patterns of protein interactions. Their conservation likely means that the proteins of these conserved functional modules are important to the trait's expression. In this paper, we formulate the problem of identifying these conserved patterns as a graph optimization problem, and develop a fast heuristic algorithm for this problem. We compare the performance of our network alignment algorithm to that of the MaWISh algorithm [Koyuturk M, Kim Y, Topkara U, Subramaniam S, Szpankowski W, Grama A, Pairwise alignment of protein interaction networks, J Computmore » Biol 13(2): 182-199, 2006.], which bases its search algorithm on a related decision problem formulation. We find that our algorithm discovers conserved modules with a larger number of proteins in an order of magnitude less time. In conclusion, the protein sets found by our algorithm correspond to known conserved functional modules at comparable precision and recall rates as those produced by the MaWISh algorithm.« less

  13. An efficient algorithm for pairwise local alignment of protein interaction networks

    SciTech Connect

    Chen, Wenbin; Schmidt, Matthew; Tian, Wenhong; Samatova, Nagiza F.; Zhang, Shaohong

    2015-04-01

    Recently, researchers seeking to understand, modify, and create beneficial traits in organisms have looked for evolutionarily conserved patterns of protein interactions. Their conservation likely means that the proteins of these conserved functional modules are important to the trait's expression. In this paper, we formulate the problem of identifying these conserved patterns as a graph optimization problem, and develop a fast heuristic algorithm for this problem. We compare the performance of our network alignment algorithm to that of the MaWISh algorithm [Koyuturk M, Kim Y, Topkara U, Subramaniam S, Szpankowski W, Grama A, Pairwise alignment of protein interaction networks, J Comput Biol 13(2): 182-199, 2006.], which bases its search algorithm on a related decision problem formulation. We find that our algorithm discovers conserved modules with a larger number of proteins in an order of magnitude less time. In conclusion, the protein sets found by our algorithm correspond to known conserved functional modules at comparable precision and recall rates as those produced by the MaWISh algorithm.

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

  15. A Rapid Convergent Low Complexity Interference Alignment Algorithm for Wireless Sensor Networks

    PubMed Central

    Jiang, Lihui; Wu, Zhilu; Ren, Guanghui; Wang, Gangyi; Zhao, Nan

    2015-01-01

    Interference alignment (IA) is a novel technique that can effectively eliminate the interference and approach the sum capacity of wireless sensor networks (WSNs) when the signal-to-noise ratio (SNR) is high, by casting the desired signal and interference into different signal subspaces. The traditional alternating minimization interference leakage (AMIL) algorithm for IA shows good performance in high SNR regimes, however, the complexity of the AMIL algorithm increases dramatically as the number of users and antennas increases, posing limits to its applications in the practical systems. In this paper, a novel IA algorithm, called directional quartic optimal (DQO) algorithm, is proposed to minimize the interference leakage with rapid convergence and low complexity. The properties of the AMIL algorithm are investigated, and it is discovered that the difference between the two consecutive iteration results of the AMIL algorithm will approximately point to the convergence solution when the precoding and decoding matrices obtained from the intermediate iterations are sufficiently close to their convergence values. Based on this important property, the proposed DQO algorithm employs the line search procedure so that it can converge to the destination directly. In addition, the optimal step size can be determined analytically by optimizing a quartic function. Numerical results show that the proposed DQO algorithm can suppress the interference leakage more rapidly than the traditional AMIL algorithm, and can achieve the same level of sum rate as that of AMIL algorithm with far less iterations and execution time. PMID:26230697

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

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

  18. A quantum-inspired genetic algorithm based on probabilistic coding for multiple sequence alignment.

    PubMed

    Huo, Hong-Wei; Stojkovic, Vojislav; Xie, Qiao-Luan

    2010-02-01

    Quantum parallelism arises from the ability of a quantum memory register to exist in a superposition of base states. Since the number of possible base states is 2(n), where n is the number of qubits in the quantum memory register, one operation on a quantum computer performs what an exponential number of operations on a classical computer performs. The power of quantum algorithms comes from taking advantages of quantum parallelism. Quantum algorithms are exponentially faster than classical algorithms. Genetic optimization algorithms are stochastic search algorithms which are used to search large, nonlinear spaces where expert knowledge is lacking or difficult to encode. QGMALIGN--a probabilistic coding based quantum-inspired genetic algorithm for multiple sequence alignment is presented. 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 experimental results show that QGMALIGN can compete with the popular methods, such as CLUSTALX and SAGA, and performs well on the presenting biological data. Moreover, the addition of genetic operators to the quantum-inspired algorithm lowers the cost of overall running time.

  19. Las Vegas algorithms for gene recognition: Suboptimal and error-tolerant spliced alignment

    SciTech Connect

    Sze, Sing-Hoi; Pevzner, P.A.

    1997-12-01

    Recently, Gelfand, Mironov and Pevzner proposed a spliced alignment approach to gene recognition that provides 99% accurate recognition of human gene if a related mammalian protein is available. However, even 99% accurate gene predictions are insufficient for automated sequence annotation in large-scale sequencing projects and therefore have to be complemented by experimental gene verification. 100% accurate gene predictions would lead to a substantial reduction of experimental work on gene identification. Our goal is to develop an algorithm that either predicts an exon assembly with accuracy sufficient for sequence annotation or warns a biologist that the accuracy of a prediction is insufficient and further experimental work is required. We study suboptimal and error-tolerant spliced alignment problems as the first steps towards such an algorithm, and report an algorithm which provides 100% accurate recognition of human genes in 37% of cases (if a related mammalian protein is available). For 52% of genes, the algorithm predicts at least one exon with 100% accuracy. 30 refs., 1 fig., 3 tabs.

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

  1. A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure

    PubMed Central

    2002-01-01

    Background Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algorithm for aligning a CM to an RNA sequence of length N is O(N3) in memory. This is only practical for small RNAs. Results I describe a divide and conquer variant of the alignment algorithm that is analogous to memory-efficient Myers/Miller dynamic programming algorithms for linear sequence alignment. The new algorithm has an O(N2 log N) memory complexity, at the expense of a small constant factor in time. Conclusions Optimal ribosomal RNA structural alignments that previously required up to 150 GB of memory now require less than 270 MB. PMID:12095421

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

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

    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

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

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

  7. QuickProbs--a fast multiple sequence alignment algorithm designed for graphics processors.

    PubMed

    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.

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

  9. A New Continuous Rotation IMU Alignment Algorithm Based on Stochastic Modeling for Cost Effective North-Finding Applications.

    PubMed

    Li, Yun; Wu, Wenqi; Jiang, Qingan; Wang, Jinling

    2016-12-13

    Based on stochastic modeling of Coriolis vibration gyros by the Allan variance technique, this paper discusses Angle Random Walk (ARW), Rate Random Walk (RRW) and Markov process gyroscope noises which have significant impacts on the North-finding accuracy. A new continuous rotation alignment algorithm for a Coriolis vibration gyroscope Inertial Measurement Unit (IMU) is proposed in this paper, in which the extended observation equations are used for the Kalman filter to enhance the estimation of gyro drift errors, thus improving the north-finding accuracy. Theoretical and numerical comparisons between the proposed algorithm and the traditional ones are presented. The experimental results show that the new continuous rotation alignment algorithm using the extended observation equations in the Kalman filter is more efficient than the traditional two-position alignment method. Using Coriolis vibration gyros with bias instability of 0.1°/h, a north-finding accuracy of 0.1° (1σ) is achieved by the new continuous rotation alignment algorithm, compared with 0.6° (1σ) north-finding accuracy for the two-position alignment and 1° (1σ) for the fixed-position alignment.

  10. A New Continuous Rotation IMU Alignment Algorithm Based on Stochastic Modeling for Cost Effective North-Finding Applications

    PubMed Central

    Li, Yun; Wu, Wenqi; Jiang, Qingan; Wang, Jinling

    2016-01-01

    Based on stochastic modeling of Coriolis vibration gyros by the Allan variance technique, this paper discusses Angle Random Walk (ARW), Rate Random Walk (RRW) and Markov process gyroscope noises which have significant impacts on the North-finding accuracy. A new continuous rotation alignment algorithm for a Coriolis vibration gyroscope Inertial Measurement Unit (IMU) is proposed in this paper, in which the extended observation equations are used for the Kalman filter to enhance the estimation of gyro drift errors, thus improving the north-finding accuracy. Theoretical and numerical comparisons between the proposed algorithm and the traditional ones are presented. The experimental results show that the new continuous rotation alignment algorithm using the extended observation equations in the Kalman filter is more efficient than the traditional two-position alignment method. Using Coriolis vibration gyros with bias instability of 0.1°/h, a north-finding accuracy of 0.1° (1σ) is achieved by the new continuous rotation alignment algorithm, compared with 0.6° (1σ) north-finding accuracy for the two-position alignment and 1° (1σ) for the fixed-position alignment. PMID:27983585

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

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

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

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

    NASA Astrophysics Data System (ADS)

    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.

  15. Prediction of protein function improving sequence remote alignment search by a fuzzy logic algorithm.

    PubMed

    Gómez, Antonio; Cedano, Juan; Espadaler, Jordi; Hermoso, Antonio; Piñol, Jaume; Querol, Enrique

    2008-02-01

    The functional annotation of the new protein sequences represents a major drawback for genomic science. The best way to suggest the function of a protein from its sequence is by finding a related one for which biological information is available. Current alignment algorithms display a list of protein sequence stretches presenting significant similarity to different protein targets, ordered by their respective mathematical scores. However, statistical and biological significance do not always coincide, therefore, the rearrangement of the program output according to more biological characteristics than the mathematical scoring would help functional annotation. A new method that predicts the putative function for the protein integrating the results from the PSI-BLAST program and a fuzzy logic algorithm is described. Several protein sequence characteristics have been checked in their ability to rearrange a PSI-BLAST profile according more to their biological functions. Four of them: amino acid content, matched segment length and hydropathic and flexibility profiles positively contributed, upon being integrated by a fuzzy logic algorithm into a program, BYPASS, to the accurate prediction of the function of a protein from its sequence.

  16. An adaptive alignment algorithm for quality-controlled label-free LC-MS.

    PubMed

    Sandin, Marianne; Ali, Ashfaq; Hansson, Karin; Månsson, Olle; Andreasson, Erik; Resjö, Svante; Levander, Fredrik

    2013-05-01

    Label-free quantification using precursor-based intensities is a versatile workflow for large-scale proteomics studies. The method however requires extensive computational analysis and is therefore in need of robust quality control during the data mining stage. We present a new label-free data analysis workflow integrated into a multiuser software platform. A novel adaptive alignment algorithm has been developed to minimize the possible systematic bias introduced into the analysis. Parameters are estimated on the fly from the data at hand, producing a user-friendly analysis suite. Quality metrics are output in every step of the analysis as well as actively incorporated into the parameter estimation. We furthermore show the improvement of this system by comprehensive comparison to classical label-free analysis methodology as well as current state-of-the-art software.

  17. A Fast and Scalable Kymograph Alignment Algorithm for Nanochannel-Based Optical DNA Mappings

    PubMed Central

    Noble, Charleston; Nilsson, Adam N.; Freitag, Camilla; Beech, Jason P.; Tegenfeldt, Jonas O.; Ambjörnsson, Tobias

    2015-01-01

    Optical mapping by direct visualization of individual DNA molecules, stretched in nanochannels with sequence-specific fluorescent labeling, represents a promising tool for disease diagnostics and genomics. An important challenge for this technique is thermal motion of the DNA as it undergoes imaging; this blurs fluorescent patterns along the DNA and results in information loss. Correcting for this effect (a process referred to as kymograph alignment) is a common preprocessing step in nanochannel-based optical mapping workflows, and we present here a highly efficient algorithm to accomplish this via pattern recognition. We compare our method with the one previous approach, and we find that our method is orders of magnitude faster while producing data of similar quality. We demonstrate proof of principle of our approach on experimental data consisting of melt mapped bacteriophage DNA. PMID:25875920

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

  19. Algorithms for calculating detector efficiency normalization coefficients for true coincidences in 3D PET

    NASA Astrophysics Data System (ADS)

    Badawi, R. D.; Lodge, M. A.; Marsden, P. K.

    1998-01-01

    Accurate normalization of lines of response in 3D PET is a prerequisite for quantitative reconstruction. Most current methods are component based, calculating a series of geometric and intrinsic detector efficiency factors. We have reviewed the theory behind several existing algorithms for calculating detector efficiency factors in 2D and 3D PET, and have extended them to create a range of new algorithms. Three of the algorithms described are `fully 3D' in that they make use of data from all detector rings for the calculation of the efficiencies of any one line of response. We have assessed the performance of the new and existing methods using simulated and real data, and have demonstrated that the fully 3D algorithms allow the rapid acquisition of crystal efficiency normalization data using low-activity sources. Such methods enable the use of scatter-free scanning line sources or the use of very short acquisitions of cylindrical sources for routine normalization.

  20. Deconvolution algorithms for photoacoustic tomography to reduce blurring caused by finite sized detectors

    NASA Astrophysics Data System (ADS)

    Burgholzer, Peter; Roitner, Heinz; Berer, Thomas; Grün, Hubert; O'Leary, D. P.; Nuster, R.; Paltauf, G.; Haltmeier, M.

    2013-03-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, it was shown that images reconstructed by back-projection or time-reversal 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 use deconvolution algorithms to reduce this type of blurring on simulated and on experimental data. Experimental data were obtained on a plastisol cylinder with 6 thin holes filled with an absorbing liquid (OrangeG). The holes were located on a spiral emanating from the center of the cylinder. Data acquisition was done by utilization of a piezoelectric detector which was rotated around the plastisol cylinder.

  1. Novel real-time alignment and calibration of LHCb detector for Run II and tracking for the upgrade.

    NASA Astrophysics Data System (ADS)

    Quagliani, Renato; LHCb Collaboration

    2016-10-01

    LHCb has introduced a novel real-time detector alignment and calibration strategy for LHC Run II. Data collected at the start of the fill is processed in a few minutes and used to update the alignment, while the calibration constants are evaluated for each run. The procedure aims to improve the quality of the online selection and performance stability. The required computing time constraints are met thanks to a new dedicated framework using the multi-core farm infrastructure for the trigger. A similar scheme is planned to be used for Run III foreseen to start in 2020. At that time LHCb will run at an instantaneous luminosity of 2 x 1033 cm-2 s-1 and a fully software based trigger strategy will be used. The new running conditions and the tighter timing constraints in the software trigger (only 13 ms per event are available) represent a big challenge for track reconstruction. The new software based trigger strategy implies a full detector read-out at the collision rate of 40 MHz. High performance and timing constraints are ensured by a new tracking system and a fast and efficient track reconstruction strategy.

  2. Performance evaluation of Warshall algorithm and dynamic programming for Markov chain in local sequence alignment.

    PubMed

    Khan, Mohammad Ibrahim; Kamal, Md Sarwar

    2015-03-01

    Markov Chain is very effective in prediction basically in long data set. In DNA sequencing it is always very important to find the existence of certain nucleotides based on the previous history of the data set. We imposed the Chapman Kolmogorov equation to accomplish the task of Markov Chain. Chapman Kolmogorov equation is the key to help the address the proper places of the DNA chain and this is very powerful tools in mathematics as well as in any other prediction based research. It incorporates the score of DNA sequences calculated by various techniques. Our research utilize the fundamentals of Warshall Algorithm (WA) and Dynamic Programming (DP) to measures the score of DNA segments. The outcomes of the experiment are that Warshall Algorithm is good for small DNA sequences on the other hand Dynamic Programming are good for long DNA sequences. On the top of above findings, it is very important to measure the risk factors of local sequencing during the matching of local sequence alignments whatever the length.

  3. An Evolutionary Algorithm to Generate Ellipsoid Detectors for Negative Selection

    DTIC Science & Technology

    2005-03-21

    Von Zuben [21] have both implemented an AIS using the network immune model. Timmis and Neal [91] applied the model to unsupervised machine learning...and de Castro and Von Zuben [21] applied the model to the problem of clustering and filtering unlabelled numerical data sets. Danger theory is young in...algorithm, clonal selection, is described in the next section. 2.6.1 Clonal Selection. De Castro and Von Zuben produced a clonal selection algorithm

  4. Beam-Based Alignment of the NLC Main Linac, Part One: Single-Bunch Comparative Study of Three Algorithms(LCC-0013)

    SciTech Connect

    Tenenbaum, P

    2004-04-20

    We describe the results of a series of simulation studies of beam-based alignment of the NLC main linacs using the program LIAR. Three algorithms for alignment of quadrupoles and girders are considered: the algorithm used in the ZDR, the ZDR algorithm combined with a post-alignment MICADO operation, and an algorithm which requires no steering dipoles but requires twice as many alignment segments per linac as the ZDR algorithm. The third algorithm appears to be the most robust, based on convergence time, required quad mover step sizes, and variation in extracted beam emittance as a function of BNS profile. We also study the effect of structure BPM resolution and ATL misalignments during the alignment process.

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

    SciTech Connect

    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 methods were 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, these characters will facilitate broader applications of WLSF detectors at time-of-flight neutron powder diffraction beamlines, including single-crystal diffraction and texture analysis.

  6. 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 methods were 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.more » Moreover, 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

  7. Evaluation Of Algorithms For A Squid Detector Neuromagnetic Imaging System

    NASA Astrophysics Data System (ADS)

    Leahy, Richard; Jeffe, Brian; Singh, Manbir; Brechner, Ricardo

    1987-01-01

    The SQUID based biomagnetometer has been widely used to measure the external magnetic field produced by neural activity. In this paper we consider the viability of using this data to reconstruct three dimensional neuromagnetic images (NMI) of an equivalent electrical current distribution within the brain which would produce the measured magnetic field. The fundamental limitations on this mode of imaging are evaluated and possible physical models and mathematical formulations of the problem are proposed. Several algorithms often used in medical image reconstruction are applied to the problem and their performance evaluated. We conclude that the reconstruction problem is highly ill-posed, and that conventional image reconstruction algorithms are inadequate for 3-D NMI. A class of solutions we call 'minimum dipole' is shown to provide more accurate reconstructions of simple current distributions.

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

  9. A method to align the coordinate system of accelerometers to the axes of a human body: The depitch algorithm.

    PubMed

    Gietzelt, Matthias; Schnabel, Stephan; Wolf, Klaus-Hendrik; Büsching, Felix; Song, Bianying; Rust, Stefan; Marschollek, Michael

    2012-05-01

    One of the key problems in accelerometry based gait analyses is that it may not be possible to attach an accelerometer to the lower trunk so that its axes are perfectly aligned to the axes of the subject. In this paper we will present an algorithm that was designed to virtually align the axes of the accelerometer to the axes of the subject during walking sections. This algorithm is based on a physically reasonable approach and built for measurements in unsupervised settings, where the test persons are applying the sensors by themselves. For evaluation purposes we conducted a study with 6 healthy subjects and measured their gait with a manually aligned and a skewed accelerometer attached to the subject's lower trunk. After applying the algorithm the intra-axis correlation of both sensors was on average 0.89±0.1 with a mean absolute error of 0.05g. We concluded that the algorithm was able to adjust the skewed sensor node virtually to the coordinate system of the subject.

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

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

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

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

    PubMed Central

    Lee, Chae Young; Song, Hankyeol; Park, Chan Woo; Chung, Yong Hyun; 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

  14. ALGORITHMS FOR OPTIMIZATION OF SYSYTEM PERFORMANCE IN LAYERED DETECTION SYSTEMS UNDER DETECTOR COORELATION

    SciTech Connect

    Wood, Thomas W.; Heasler, Patrick G.; Daly, Don S.

    2010-07-15

    Almost all of the "architectures" for radiation detection systems in Department of Energy (DOE) and other USG programs rely on some version of layered detector deployment. Efficacy analyses of layered (or more generally extended) detection systems in many contexts often assume statistical independence among detection events and thus predict monotonically increasing system performance with the addition of detection layers. We show this to be a false conclusion for the ROC curves typical of most current technology gamma detectors, and more generally show that statistical independence is often an unwarranted assumption for systems in which there is ambiguity about the objects to be detected. In such systems, a model of correlation among detection events allows optimization of system algorithms for interpretation of detector signals. These algorithms are framed as optimal discriminant functions in joint signal space, and may be applied to gross counting or spectroscopic detector systems. We have shown how system algorithms derived from this model dramatically improve detection probabilities compared to the standard serial detection operating paradigm for these systems. These results would not surprise anyone who has confronted the problem of correlated errors (or failure rates) in the analogous contexts, but is seems to be largely underappreciated among those analyzing the radiation detection problem – independence is widely assumed and experimental studies typical fail to measure correlation. This situation, if not rectified, will lead to several unfortunate results. Including [1] overconfidence in system efficacy, [2] overinvestment in layers of similar technology, and [3] underinvestment in diversity among detection assets.

  15. Research on infrared-image denoising algorithm based on the noise analysis of the detector

    NASA Astrophysics Data System (ADS)

    Liu, Songtao; Zhou, Xiaodong; Shen, Tongsheng; Han, Yanli

    2005-01-01

    Since the conventional denoising algorithms have not considered the influence of certain concrete detector, they are not very effective to remove various noises contained in the low signal-to-noise ration infrared image. In this paper, a new thinking for infrared image denoising is proposed, which is based on the noise analyses of detector with an example of L model infrared multi-element detector. According to the noise analyses of this detector, the emphasis is placed on how to filter white noise and fractal noise in the preprocessing phase. Wavelet analysis is a good tool for analyzing 1/f process. 1/f process can be viewed as white noise approximately since its wavelet coefficients are stationary and uncorrelated. So if wavelet transform is adopted, the problem of removing white noise and fraction noise is simplified as the only one problem, i.e., removing white noise. To address this problem, a new wavelet domain adaptive wiener filtering algorithm is presented. From the viewpoint of quantitative and qualitative analyses, the filtering effect of our method is compared with those of traditional median filter, mean filter and wavelet thresholding algorithm in detail. The results show that our method can reduce various noises effectively and raise the ratio of signal-to-noise evidently.

  16. Digital algorithms for parallel pipelined single-detector homodyne fringe counting in laser interferometry

    NASA Astrophysics Data System (ADS)

    Rerucha, Simon; Sarbort, Martin; Hola, Miroslava; Cizek, Martin; Hucl, Vaclav; Cip, Ondrej; Lazar, Josef

    2016-12-01

    The homodyne detection with only a single detector represents a promising approach in the interferometric application which enables a significant reduction of the optical system complexity while preserving the fundamental resolution and dynamic range of the single frequency laser interferometers. We present the design, implementation and analysis of algorithmic methods for computational processing of the single-detector interference signal based on parallel pipelined processing suitable for real time implementation on a programmable hardware platform (e.g. the FPGA - Field Programmable Gate Arrays or the SoC - System on Chip). The algorithmic methods incorporate (a) the single detector signal (sine) scaling, filtering, demodulations and mixing necessary for the second (cosine) quadrature signal reconstruction followed by a conic section projection in Cartesian plane as well as (a) the phase unwrapping together with the goniometric and linear transformations needed for the scale linearization and periodic error correction. The digital computing scheme was designed for bandwidths up to tens of megahertz which would allow to measure the displacements at the velocities around half metre per second. The algorithmic methods were tested in real-time operation with a PC-based reference implementation that employed the advantage pipelined processing by balancing the computational load among multiple processor cores. The results indicate that the algorithmic methods are suitable for a wide range of applications [3] and that they are bringing the fringe counting interferometry closer to the industrial applications due to their optical setup simplicity and robustness, computational stability, scalability and also a cost-effectiveness.

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

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

  19. Algorithms for the determination of the time delays of the signal when using unequal detectors

    NASA Technical Reports Server (NTRS)

    Novak, B. L.

    1979-01-01

    In treating the recorded results from detectors at different locations in space, the analysis of the time delays of signals is crucial to locating the sources of detected radiation. Because the correlation method requires the manipulation of awkward matrices to evaluate its accuracy, a solution is outlined based on minimizing the sum of the squares of signal deviations, and the algorithms for evaluating the resulting error are presented.

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

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

  2. Library Event Matching event classification algorithm for electron neutrino interactions in the NOνA detectors

    NASA Astrophysics Data System (ADS)

    Backhouse, C.; Patterson, R. B.

    2015-04-01

    We describe the Library Event Matching classification algorithm implemented for use in the NOνA νμ →νe oscillation measurement. Library Event Matching, developed in a different form by the earlier MINOS experiment, is a powerful approach in which input trial events are compared to a large library of simulated events to find those that best match the input event. A key feature of the algorithm is that the comparisons are based on all the information available in the event, as opposed to higher-level derived quantities. The final event classifier is formed by examining the details of the best-matched library events. We discuss the concept, definition, optimization, and broader applications of the algorithm as implemented here. Library Event Matching is well-suited to the monolithic, segmented detectors of NOνA and thus provides a powerful technique for event discrimination.

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

  4. Collaborative Research Developing, Testing and Validating Brain Alignment Algorithm using Geometric Analysis

    DTIC Science & Technology

    2013-11-13

    This is the final report by the University of Southern California on a AFSOR grant, part of a joint program with Harvard University (PI, Shing-Tung...the algorithm was the task assigned to Harvard University ). Finally, we were to test and validate the algorithm once it had been developed.

  5. Recent progress on single photon and positron emission tomography - From detectors to algorithms

    SciTech Connect

    Tanaka, E.

    1987-02-01

    In the last few years, great efforts have been made to achieve higher sensitivity, higher spatial resolution, better image quality and quantification. In the SPECT, collimators and scanning methods have been improved. 180/sup 0/ sagittal scan is proposed for brain imaging. Practical correction methods for uniform attenuation are compared from a view point of noise propagation. In the PET system, current status of TOF-PET, high resolution PET are reviewed. CsI(Br) scintillator is a candidate of a new PET detector. For stationary PET using discrete detectors, an iterative method is preferable for the image reconstruction, because it does not need to satisfy the conventional sampling requirement for projections. Recent ECT technology tends to be sophisticated both in data acquisition and processing. It needs more powerful and versatile algorithms. Iterative reconstruction methods should be reconsidered as a tool of routine use. The EM algorithm is attractive, but it seems to need a trick to accelerate the convergence. A fast maximum likelihood algorithm is proposed, which can provide satisfactory images by a few iterations.

  6. Improved algorithm for automated alignment of wafers via optimized features location

    NASA Astrophysics Data System (ADS)

    Parshin, Michael; Zalevsky, Zeev

    2009-10-01

    We present a new fuzzy logic-based approach for automatic optimized features location. The technique is used for improved automatic alignment and classification of silicon wafers and chips that are used in the electronics industry. The proposed automatic image processing approach was realized and experimentally demonstrated in real industrial application with typical wafers. The automatic features location and grading supported the industrial requirements and could replace human expert-based inspection that currently is performed manually.

  7. Dynamic programming algorithms for comparing multineuronal spike trains via cost-based metrics and alignments.

    PubMed

    Victor, Jonathan D; Goldberg, David H; Gardner, Daniel

    2007-04-15

    Cost-based metrics formalize notions of distance, or dissimilarity, between two spike trains, and are applicable to single- and multineuronal responses. As such, these metrics have been used to characterize neural variability and neural coding. By examining the structure of an efficient algorithm [Aronov D, 2003. Fast algorithm for the metric-space analysis of simultaneous responses of multiple single neurons. J Neurosci Methods 124(2), 175-79] implementing a metric for multineuronal responses, we determine criteria for its generalization, and identify additional efficiencies that are applicable when related dissimilarity measures are computed in parallel. The generalized algorithm provides the means to test a wide range of coding hypotheses.

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

  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. Searching protein 3-D structures for optimal structure alignment using intelligent algorithms and data structures.

    PubMed

    Novosád, Tomáš; Snášel, Václav; Abraham, Ajith; Yang, Jack Y

    2010-11-01

    In this paper, we present a novel algorithm for measuring protein similarity based on their 3-D structure (protein tertiary structure). The algorithm used a suffix tree for discovering common parts of main chains of all proteins appearing in the current research collaboratory for structural bioinformatics protein data bank (PDB). By identifying these common parts, we build a vector model and use some classical information retrieval (IR) algorithms based on the vector model to measure the similarity between proteins--all to all protein similarity. For the calculation of protein similarity, we use term frequency × inverse document frequency ( tf × idf ) term weighing schema and cosine similarity measure. The goal of this paper is to introduce new protein similarity metric based on suffix trees and IR methods. Whole current PDB database was used to demonstrate very good time complexity of the algorithm as well as high precision. We have chosen the structural classification of proteins (SCOP) database for verification of the precision of our algorithm because it is maintained primarily by humans. The next success of this paper would be the ability to determine SCOP categories of proteins not included in the latest version of the SCOP database (v. 1.75) with nearly 100% precision.

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

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

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

  14. New Advanced Source Identification Algorithm (ASIA-NEW) for radiation monitors with plastic detectors

    SciTech Connect

    Stavrov, Andrei; Yamamoto, Eugene

    2015-07-01

    Radiation Portal Monitors (RPM) with plastic detectors represent the main instruments used for primary border (customs) radiation control. RPM are widely used because they are simple, reliable, relatively inexpensive and have a high sensitivity. However, experience using the RPM in various countries has revealed the systems have some grave shortcomings. There is a dramatic decrease of the probability of detection of radioactive sources under high suppression of the natural gamma background (radiation control of heavy cargoes, containers and, especially, trains). NORM (Naturally Occurring Radioactive Material) existing in objects under control trigger the so-called 'nuisance alarms', requiring a secondary inspection for source verification. At a number of sites, the rate of such alarms is so high it significantly complicates the work of customs and border officers. This paper presents a brief description of new variant of algorithm ASIA-New (New Advanced Source Identification Algorithm), which was developed by the authors and based on some experimental test results. It also demonstrates results of different tests and the capability of a new system to overcome the shortcomings stated above. New electronics and ASIA-New enables RPM to detect radioactive sources under a high background suppression (tested at 15-30%) and to verify the detected NORM (KCl) and the artificial isotopes (Co-57, Ba-133 and other). New variant of ASIA is based on physical principles and does not require a lot of special tests to attain statistical data for its parameters. That is why this system can be easily installed into any RPM with plastic detectors. This algorithm was tested for 1,395 passages of different transports (cars, trucks and trailers) without radioactive sources. It also was tested for 4,015 passages of these transports with radioactive sources of different activity (Co-57, Ba-133, Cs-137, Co-60, Ra-226, Th-232) and these sources masked by NORM (K-40) as well. (authors)

  15. A novel alignment repulsion algorithm for flocking of multi-agent systems based on the number of neighbours per agent

    NASA Astrophysics Data System (ADS)

    Kahani, R.; Sedigh, A. K.; Mahjani, M. Gh.

    2015-12-01

    In this paper, an energy-based control methodology is proposed to satisfy the Reynolds three rules in a flock of multiple agents. First, a control law is provided that is directly derived from the passivity theorem. In the next step, the Number of Neighbours Alignment/Repulsion algorithm is introduced for a flock of agents which loses the cohesion ability and uniformly joint connectivity condition. With this method, each agent tries to follow the agents which escape its neighbourhood by considering the velocity of escape time and number of neighbours. It is mathematically proved that the motion of multiple agents converges to a rigid and uncrowded flock if the group is jointly connected just for an instant. Moreover, the conditions for collision avoidance are guaranteed during the entire process. Finally, simulation results are presented to show the effectiveness of the proposed methodology.

  16. Robust Algorithm for Alignment of Liquid Chromatography-Mass Spectrometry Analyses in an Accurate Mass and Time Tag Data Analysis Pipeline

    SciTech Connect

    Jaitly, Navdeep; Monroe, Matthew E.; Petyuk, Vladislav A.; Clauss, Therese RW; Adkins, Joshua N.; Smith, Richard D.

    2006-11-01

    Liquid chromatography coupled to mass spectrometry (LC-MS) and tandem mass spectrometry (LC-MS/MS) has become a standard technique for analyzing complex peptide mixtures to determine composition and relative quantity. Several high-throughput proteomics techniques attempt to combine complementary results from multiple LC-MS and LC-MS/MS analyses to provide more comprehensive and accurate results. To effectively collate results from these techniques, variations in mass and elution time measurements between related analyses are corrected by using algorithms designed to align the various types of results: LC-MS/MS vs. LC-MS/MS, LC-MS vs. LC-MS/MS, and LC-MS vs. LC-MS. Described herein are new algorithms referred to collectively as Liquid Chromatography based Mass Spectrometric Warping and Alignment of Retention times of Peptides (LCMSWARP) which use a dynamic elution time warping approach similar to traditional algorithms that correct variation in elution time using piecewise linear functions. LCMSWARP is compared to a linear alignment algorithm that assumes a linear transformation of elution time between analyses. LCMSWARP also corrects for drift in mass measurement accuracies that are often seen in an LC-MS analysis due to factors such as analyzer drift. We also describe the alignment of LC-MS results and provide examples of alignment of analyses from different chromatographic systems to demonstrate more complex transformation functions.

  17. Effect of Advanced Synthetically Enhanced Detector Resolution Algorithm on Specificity and Sensitivity of Portable High Purity Germanium Gamma Detector Spectra

    DTIC Science & Technology

    2009-06-01

    with a 50 mm diameter and 30 mm deep Ge crystal and low power Stirling Cooler . The detector is shown in Figure 9. 28 Figure 9. Ortec...recording some characteristics of their average behavior. The common behavior of particles in the physical system is then concluded from the 14...modeling. With increased computational power, Monte Carlo simulations of detector systems have become a complement to experimental detector work

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

  19. Unfolding neutron energy spectra from foil activation detector measurements with the Gold algorithm

    NASA Astrophysics Data System (ADS)

    Seghour, A.; Seghour, F. Z.

    2001-01-01

    In this work, the Gold algorithm is applied to the unfolding of neutron reactor energy spectra from reaction rates data of multiple foil activation detectors. Such a method, which forms the basis of a developed unfolding computer program called SAYD, has the advantage of not requiring a priori knowledge on the spectrum in the unfolding process. The program SAYD is first illustrated by synthesized reaction rates data calculated using a semi-empirical formulation of a typical intermediate and fast neutron reactor spectrum. The demonstration of the unfolding program SAYD is next achieved using measured reaction rates of the Arkansas Nuclear One power plant (ANO) benchmark spectrum by comparing results of SAYD program with those obtained by STAYNL and MSANDB unfolding codes.

  20. Adaboost face detector based on Joint Integral Histogram and Genetic Algorithms for feature extraction process.

    PubMed

    Jammoussi, Ameni Yangui; Ghribi, Sameh Fakhfakh; Masmoudi, Dorra Sellami

    2014-01-01

    Recently, many classes of objects can be efficiently detected by the way of machine learning techniques. In practice, boosting techniques are among the most widely used machine learning for various reasons. This is mainly due to low false positive rate of the cascade structure offering the possibility to be trained by different classes of object. However, it is especially used for face detection since it is the most popular sub-problem within object detection. The challenges of Adaboost based face detector include the selection of the most relevant features from a large feature set which are considered as weak classifiers. In many scenarios, however, selection of features based on lowering classification errors leads to computation complexity and excess of memory use. In this work, we propose a new method to train an effective detector by discarding redundant weak classifiers while achieving the pre-determined learning objective. To achieve this, on the one hand, we modify AdaBoost training so that the feature selection process is not based any more on the weak learner's training error. This is by incorporating the Genetic Algorithm (GA) on the training process. On the other hand, we make use of the Joint Integral Histogram in order to extract more powerful features. Experimental performance on human faces show that our proposed method requires smaller number of weak classifiers than the conventional learning algorithm, resulting in higher learning and faster classification rates. So, our method outperforms significantly state-of-the-art cascade methods in terms of detection rate and false positive rate and especially in reducing the number of weak classifiers per stage.

  1. 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/

  2. Vectorcardiographic loop alignment for fetal movement detection using the expectation-maximization algorithm and support vector machines.

    PubMed

    Vullings, R; Mischi, M

    2013-01-01

    Reduced fetal movement is an important parameter to assess fetal distress. Currently, no suitable methods are available that can objectively assess fetal movement during pregnancy. Fetal vectorcardiographic (VCG) loop alignment could be such a method. In general, the goal of VCG loop alignment is to correct for motion-induced changes in the VCGs of (multiple) consecutive heartbeats. However, the parameters used for loop alignment also provide information to assess fetal movement. Unfortunately, current methods for VCG loop alignment are not robust against low-quality VCG signals. In this paper, a more robust method for VCG loop alignment is developed that includes a priori information on the loop alignment, yielding a maximum a posteriori loop alignment. Classification, based on movement parameters extracted from the alignment, is subsequently performed using support vector machines, resulting in correct classification of (absence of) fetal movement in about 75% of cases. After additional validation and optimization, this method can possibly be employed for continuous fetal movement monitoring.

  3. Recent Improvements to the Finite-Fault Rupture Detector Algorithm: FinDer II

    NASA Astrophysics Data System (ADS)

    Smith, D.; Boese, M.; Heaton, T. H.

    2015-12-01

    Constraining the finite-fault rupture extent and azimuth is crucial for accurately estimating ground-motion in large earthquakes. Detecting and modeling finite-fault ruptures in real-time is thus essential to both earthquake early warning (EEW) and rapid emergency response. Following extensive real-time and offline testing, the finite-fault rupture detector algorithm, FinDer (Böse et al., 2012 & 2015), was successfully integrated into the California-wide ShakeAlert EEW demonstration system. Since April 2015, FinDer has been scanning real-time waveform data from approximately 420 strong-motion stations in California for peak ground acceleration (PGA) patterns indicative of earthquakes. FinDer analyzes strong-motion data by comparing spatial images of observed PGA with theoretical templates modeled from empirical ground-motion prediction equations (GMPEs). If the correlation between the observed and theoretical PGA is sufficiently high, a report is sent to ShakeAlert including the estimated centroid position, length, and strike, and their uncertainties, of an ongoing fault rupture. Rupture estimates are continuously updated as new data arrives. As part of a joint effort between USGS Menlo Park, ETH Zurich, and Caltech, we have rewritten FinDer in C++ to obtain a faster and more flexible implementation. One new feature of FinDer II is that multiple contour lines of high-frequency PGA are computed and correlated with templates, allowing the detection of both large earthquakes and much smaller (~ M3.5) events shortly after their nucleation. Unlike previous EEW algorithms, FinDer II thus provides a modeling approach for both small-magnitude point-source and larger-magnitude finite-fault ruptures with consistent error estimates for the entire event magnitude range.

  4. SHARAKU: an algorithm for aligning and clustering read mapping profiles of deep sequencing in non-coding RNA processing

    PubMed Central

    Tsuchiya, Mariko; Amano, Kojiro; Abe, Masaya; Seki, Misato; Hase, Sumitaka; Sato, Kengo; Sakakibara, Yasubumi

    2016-01-01

    Motivation: Deep sequencing of the transcripts of regulatory non-coding RNA generates footprints of post-transcriptional processes. After obtaining sequence reads, the short reads are mapped to a reference genome, and specific mapping patterns can be detected called read mapping profiles, which are distinct from random non-functional degradation patterns. These patterns reflect the maturation processes that lead to the production of shorter RNA sequences. Recent next-generation sequencing studies have revealed not only the typical maturation process of miRNAs but also the various processing mechanisms of small RNAs derived from tRNAs and snoRNAs. Results: We developed an algorithm termed SHARAKU to align two read mapping profiles of next-generation sequencing outputs for non-coding RNAs. In contrast with previous work, SHARAKU incorporates the primary and secondary sequence structures into an alignment of read mapping profiles to allow for the detection of common processing patterns. Using a benchmark simulated dataset, SHARAKU exhibited superior performance to previous methods for correctly clustering the read mapping profiles with respect to 5′-end processing and 3′-end processing from degradation patterns and in detecting similar processing patterns in deriving the shorter RNAs. Further, using experimental data of small RNA sequencing for the common marmoset brain, SHARAKU succeeded in identifying the significant clusters of read mapping profiles for similar processing patterns of small derived RNA families expressed in the brain. Availability and Implementation: The source code of our program SHARAKU is available at http://www.dna.bio.keio.ac.jp/sharaku/, and the simulated dataset used in this work is available at the same link. Accession code: The sequence data from the whole RNA transcripts in the hippocampus of the left brain used in this work is available from the DNA DataBank of Japan (DDBJ) Sequence Read Archive (DRA) under the accession number DRA

  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. Alignment of the Muon System at the CMS Experiment

    NASA Astrophysics Data System (ADS)

    Mueller, Ryan; Perniè, Luca; Pakhotin, Yuriy; Kamon, Teruki; Safonov, Alexei; Brown, Malachi

    2017-01-01

    The muon detectors of the CMS experiment provide fast trigger decisions, muon identifications and muon track measurements. Alignment of the muon detectors is crucial for accurate reconstruction of events with high pT muons that are present in signatures for many new physics scenarios. The muon detector's relative positions and orientations with respect to the inner silicon tracker may be precisely measured using reconstructed tracks propagating from the interaction point. This track-based alignment procedure is capable of aligning individual muon detectors to within 100 microns along sensitive modes. However, weak (insensitive) modes may not be well measured due to the system's design and cause systematic miss-measurements. In this report, we present a new track-based procedure which enables all 6 alignment parameters - 3 positions and 3 rotations for each individual muon detector. The improved algorithm allows for measurement of weak modes and considerably reduced related systematic uncertainties. We describe results of the alignment procedure obtained with 2016 data.

  9. Comparison of allocation algorithms for unambiguous registration of hits in presence of charge sharing in pixel detectors

    NASA Astrophysics Data System (ADS)

    Otfinowski, P.; Maj, P.; Deptuch, G.; Fahim, F.; Hoff, J.

    2017-01-01

    Charge sharing is the fractional collection of the charge cloud generated in a detector by two or more adjacent pixels. It may lead to excessive or inefficient registration of hits comparing to the number of impinging photons depending on how discrimination thresholds are set in typical photon counting pixel detector. The problems are particularly exposed for fine pixel sizes and/or for thick planar detectors. Presence of charge sharing is one of the limiting factors that discourages decreasing sizes of pixels in photon counting mode X-ray radiation imaging systems. Currently, a few different approaches tackling with the charge sharing problem exist (e.g. Medipix3RX, PIXIE, miniVIPIC or PIX45). The general idea is, first, to reconstruct the entire signal from adjacent pixels and, secondly, to allocate the hit to a single pixel. This paper focuses on the latter part of the process, i.e. on a comparison of how different hit allocation algorithms affect the spatial accuracy and false registration vs. missed hit probability. Different hit allocation algorithms were simulated, including standard photon counting (no full signal reconstruction) and the C8P1 algorithm. Also, a novel approach, based on a detection of patterns, with significantly limited analog signal processing, was proposed and characterized.

  10. 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%.

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

  12. Crater Detection Algorithms Based on Pixel-Difference, Separated-Pixel-Difference, Roberts, Prewitt, Sobel and Frei-Chen Gradient Edge Detectors

    NASA Astrophysics Data System (ADS)

    Novosel, H.; Salamuniccar, G.; Loncaric, S.

    2007-03-01

    Implementations of six different crater detection algorithms based on six different well-known gradient edge detectors are presented. They are analyzed and compared using free-response receiver operating characteristics.

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

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

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

  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.

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

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

    PubMed Central

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

    2013-01-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. PMID:23814604

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

    PubMed

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

    2013-04-29

    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 10(6)). 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. Pulse shape analysis of a two fold clover detector with an EMD based new algorithm: A comparison

    NASA Astrophysics Data System (ADS)

    Siwal, Davinder; Mandal, S.; Palit, R.; Sethi, J.; Garg, R.; Saha, S.; Prasad, Awadhesh; Chavan, P. B.; Naidu, B. S.; Jadhav, S.; Donthi, R.; Schaffner, H.; Adamczewski-Musch, J.; Kurz, N.; Wollersheim, H. J.; Singh, R.

    2014-03-01

    An investigation of Empirical Mode Decomposition (EMD) based noise filtering algorithm has been carried out on a mirror signal from a two fold germanium clover detector. EMD technique can decompose linear as well as nonlinear and chaotic signals with a precise frequency resolution. It allows to decompose the preamplifier signal (charge pulse) on an event-by-event basis. The filtering algorithm provides the information about the Intrinsic Mode Functions (IMFs) mainly dominated by the noise. It preserves the signal information and separates the overriding noise oscillations from the signals. The identification of noise structure is based on the frequency distributions of different IMFs. The preamplifier noise components which distort the azimuthal co-ordinates information have been extracted on the basis of the correlation between the different IMFs and the mirror signal. The correlation studies have been carried out both in frequency and time domain. The extracted correlation coefficient provides an important information regarding the pulse shape of the γ-ray interaction in the detector. A comparison between the EMD based and state-of-the-art wavelet based denoising techniques has also been made and discussed. It has been observed that the fractional noise strength distribution varies with the position of the collimated gamma-ray source. Above trend has been reproduced by both the denoising techniques.

  1. 'Fixed-axis' magnetic orientation by an amphibian: non-shoreward-directed compass orientation, misdirected homing or positioning a magnetite-based map detector in a consistent alignment relative to the magnetic field?

    PubMed

    Phillips, John B; Borland, S Chris; Freake, Michael J; Brassart, Jacques; Kirschvink, Joseph L

    2002-12-01

    suggestion that homing newts use the light-dependent magnetic compass to align a magnetite-based 'map detector' when obtaining the precise measurements necessary to derive map information from the magnetic field. However, aligning the putative map detector does not explain the fixed-axis response of newts tested under long-wavelength light. Preliminary evidence suggests that, in the absence of reliable directional information from the magnetic compass (caused by the 90 degrees rotation of the response of the magnetic compass under long-wavelength light), newts may resort to a systematic sampling strategy to identify alignment(s) of the map detector that yields reliable magnetic field measurements.

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

  3. MP-Align: alignment of metabolic pathways

    PubMed Central

    2014-01-01

    Background Comparing the metabolic pathways of different species is useful for understanding metabolic functions and can help in studying diseases and engineering drugs. Several comparison techniques for metabolic pathways have been introduced in the literature as a first attempt in this direction. The approaches are based on some simplified representation of metabolic pathways and on a related definition of a similarity score (or distance measure) between two pathways. More recent comparative research focuses on alignment techniques that can identify similar parts between pathways. Results We propose a methodology for the pairwise comparison and alignment of metabolic pathways that aims at providing the largest conserved substructure of the pathways under consideration. The proposed methodology has been implemented in a tool called MP-Align, which has been used to perform several validation tests. The results showed that our similarity score makes it possible to discriminate between different domains and to reconstruct a meaningful phylogeny from metabolic data. The results further demonstrate that our alignment algorithm correctly identifies subpathways sharing a common biological function. Conclusion The results of the validation tests performed with MP-Align are encouraging. A comparison with another proposal in the literature showed that our alignment algorithm is particularly well-suited to finding the largest conserved subpathway of the pathways under examination. PMID:24886436

  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. A robust TEC depletion detector algorithm for satellite based navigation in Indian zone and depletion analysis for GAGAN

    NASA Astrophysics Data System (ADS)

    Dashora, Nirvikar

    2012-07-01

    require an immediate solution to attack this problem. Hence, an alternative approach is chosen in which TEC-depletions are ignored for GIVE estimation. This approach requires further attention to accommodate it in the processing software for a near real time solution for the concerned user in Indian zone. But, nonetheless, as a prime concern, to precluding a particular satellite-link affected by TEC depletion, a reference receiver or user requires an algorithm that can compute the TEC and detect the depletion in TEC in near real time. To answer it, a novel TEC depletion detector algorithm and software has been developed which can be used for any SBAS in India. The algorithm is initially tested for recorded data from ground based dual frequency GPS receivers of GAGAN project. Data from 18-20 stations with 30 second sampling interval was obtained for year 2004 and 2005. The algorithm has been tuned to Indian ionosphere and show a great success in detecting TEC depletions with minimum false alarm. This is because of a specific property of this algorithm that it rejects the smooth fall in TEC in post sunset ionosphere. The depletions in TEC are characterized by a sudden fall and immediate recovery in level of TEC for a given line of sight. Since our algorithm extracts only such signatures and hence minimize the false alarms it may reduce burden on operational systems. We present this algorithm in detail. Another important facet of this algorithm is about its scientific use in automatic analysis of large amount of continuous GPS data. We have analyzed the aforementioned data by a MATLAB based script and obtained significant statistical results. The temporal duration and depth of TEC depletions is obtained for all over Indian region which provide a new insight over the phenomenon called EPBs and TEC depletions.

  6. Statistical behavior analysis and precision optimization for the laser stripe center detector based on Steger's algorithm.

    PubMed

    Qi, Li; Zhang, Yixin; Zhang, Xuping; Wang, Shun; Xie, Fei

    2013-06-03

    Triangulation laser range scanning, which has been wildly used in various applications, can reconstruct the 3D geometric of the object with high precision by processing the image of laser stripe. The unbiased line extractor proposed by Steger is one of the most commonly used algorithms in laser stripe center extraction for its precision and robustness. Therefore, it is of great significance to assess the statistical performance of the Steger method when it is applied on laser stripe with Gaussian intensity profile. In this paper, a statistical behavior analysis for the laser stripe center extractor based on Steger method has been carried out. Relationships between center extraction precision, image quality and stripe characteristics have been examined analytically. Optimal scale of Gaussian smoothing kernel can be determined for each laser stripe image to achieve the highest precision according to the derived formula. Flexible three-step noise estimation procedure has been proposed to evaluate the center extraction precision of a typical triangulation laser scanning system by simply referring to the acquired images. The validity of our analysis has been verified by experiments on both artificial and natural images.

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

  8. Alignment of the MINOS FD

    SciTech Connect

    Becker, B.; Boehnlein, D.; /Fermilab

    2004-11-01

    The results and procedure of the alignment of the MINOS Far Detector are presented. The far detector has independent alignments of SM1 and SM2. The misalignments have an estimated uncertainty of {approx}850 {micro}m for SM1 and {approx}750 {micro}m for SM2. The alignment has as inputs the average rotations of U and V as determined by optical survey and strip positions within modules measured from the module mapper. The output of this is a module-module correction for transverse mis-alignments. These results were verified by examining an independent set of data. These alignment constants on average contribute much less then 1% to the total uncertainty in the transverse strip position.

  9. Improving pairwise sequence alignment accuracy using near-optimal protein sequence alignments

    PubMed Central

    2010-01-01

    Background While the pairwise alignments produced by sequence similarity searches are a powerful tool for identifying homologous proteins - proteins that share a common ancestor and a similar structure; pairwise sequence alignments often fail to represent accurately the structural alignments inferred from three-dimensional coordinates. Since sequence alignment algorithms produce optimal alignments, the best structural alignments must reflect suboptimal sequence alignment scores. Thus, we have examined a range of suboptimal sequence alignments and a range of scoring parameters to understand better which sequence alignments are likely to be more structurally accurate. Results We compared near-optimal protein sequence alignments produced by the Zuker algorithm and a set of probabilistic alignments produced by the probA program with structural alignments produced by four different structure alignment algorithms. There is significant overlap between the solution spaces of structural alignments and both the near-optimal sequence alignments produced by commonly used scoring parameters for sequences that share significant sequence similarity (E-values < 10-5) and the ensemble of probA alignments. We constructed a logistic regression model incorporating three input variables derived from sets of near-optimal alignments: robustness, edge frequency, and maximum bits-per-position. A ROC analysis shows that this model more accurately classifies amino acid pairs (edges in the alignment path graph) according to the likelihood of appearance in structural alignments than the robustness score alone. We investigated various trimming protocols for removing incorrect edges from the optimal sequence alignment; the most effective protocol is to remove matches from the semi-global optimal alignment that are outside the boundaries of the local alignment, although trimming according to the model-generated probabilities achieves a similar level of improvement. The model can also be used to

  10. An introduction to the Lagan alignment toolkit.

    PubMed

    Brudno, Michael

    2007-01-01

    The Lagan Toolkit is a software package for comparison of genomic sequences. It includes the CHAOS local alignment program, LAGAN global alignment program for two, or more sequences and Shuffle-LAGAN, a "glocal" alignment method that handles genomic rearrangements in a global alignment framework. The alignment programs included in the Lagan Toolkit have been widely used to compare genomes of many organisms, from bacteria to large mammalian genomes. This chapter provides an overview of the algorithms used by the LAGAN programs to construct genomic alignments, explains how to build alignments using either the standalone program or the web server, and discusses some of the common pitfalls users encounter when using the toolkit.

  11. Multiple sequence alignment with hierarchical clustering.

    PubMed Central

    Corpet, F

    1988-01-01

    An algorithm is presented for the multiple alignment of sequences, either proteins or nucleic acids, that is both accurate and easy to use on microcomputers. The approach is based on the conventional dynamic-programming method of pairwise alignment. Initially, a hierarchical clustering of the sequences is performed using the matrix of the pairwise alignment scores. The closest sequences are aligned creating groups of aligned sequences. Then close groups are aligned until all sequences are aligned in one group. The pairwise alignments included in the multiple alignment form a new matrix that is used to produce a hierarchical clustering. If it is different from the first one, iteration of the process can be performed. The method is illustrated by an example: a global alignment of 39 sequences of cytochrome c. PMID:2849754

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

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

  14. Demonstration of Bias-Controlled Algorithmic Tuning of Quantum Dots in a Well (DWELL) MidIR Detectors

    DTIC Science & Technology

    2009-06-01

    DWELL) MidIR Detectors Woo-Yong Jang, Majeed M. Hayat, Senior Member, IEEE, J . Scott Tyo, Senior Member, IEEE, Ram S. Attaluri, Thomas E. Vandervelde...a member of the International Society for Optical Engineers (SPIE) and the Optical Society of America (OSA). J . Scott Tyo (S’96–M’97–SM’06) received

  15. 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…

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

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

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

  19. Image alignment

    DOEpatents

    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.

  20. Alignment of Helical Membrane Protein Sequences Using AlignMe

    PubMed Central

    Khafizov, Kamil; Forrest, Lucy R.

    2013-01-01

    Few sequence alignment methods have been designed specifically for integral membrane proteins, even though these important proteins have distinct evolutionary and structural properties that might affect their alignments. Existing approaches typically consider membrane-related information either by using membrane-specific substitution matrices or by assigning distinct penalties for gap creation in transmembrane and non-transmembrane regions. Here, we ask whether favoring matching of predicted transmembrane segments within a standard dynamic programming algorithm can improve the accuracy of pairwise membrane protein sequence alignments. We tested various strategies using a specifically designed program called AlignMe. An updated set of homologous membrane protein structures, called HOMEP2, was used as a reference for optimizing the gap penalties. The best of the membrane-protein optimized approaches were then tested on an independent reference set of membrane protein sequence alignments from the BAliBASE collection. When secondary structure (S) matching was combined with evolutionary information (using a position-specific substitution matrix (P)), in an approach we called AlignMePS, the resultant pairwise alignments were typically among the most accurate over a broad range of sequence similarities when compared to available methods. Matching transmembrane predictions (T), in addition to evolutionary information, and secondary-structure predictions, in an approach called AlignMePST, generally reduces the accuracy of the alignments of closely-related proteins in the BAliBASE set relative to AlignMePS, but may be useful in cases of extremely distantly related proteins for which sequence information is less informative. The open source AlignMe code is available at https://sourceforge.net/projects/alignme/, and at http://www.forrestlab.org, along with an online server and the HOMEP2 data set. PMID:23469223

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

  2. An Alignment-Free Algorithm in Comparing the Similarity of Protein Sequences Based on Pseudo-Markov Transition Probabilities among Amino Acids.

    PubMed

    Li, Yushuang; Song, Tian; Yang, Jiasheng; Zhang, Yi; Yang, Jialiang

    2016-01-01

    In this paper, we have proposed a novel alignment-free method for comparing the similarity of protein sequences. We first encode a protein sequence into a 440 dimensional feature vector consisting of a 400 dimensional Pseudo-Markov transition probability vector among the 20 amino acids, a 20 dimensional content ratio vector, and a 20 dimensional position ratio vector of the amino acids in the sequence. By evaluating the Euclidean distances among the representing vectors, we compare the similarity of protein sequences. We then apply this method into the ND5 dataset consisting of the ND5 protein sequences of 9 species, and the F10 and G11 datasets representing two of the xylanases containing glycoside hydrolase families, i.e., families 10 and 11. As a result, our method achieves a correlation coefficient of 0.962 with the canonical protein sequence aligner ClustalW in the ND5 dataset, much higher than those of other 5 popular alignment-free methods. In addition, we successfully separate the xylanases sequences in the F10 family and the G11 family and illustrate that the F10 family is more heat stable than the G11 family, consistent with a few previous studies. Moreover, we prove mathematically an identity equation involving the Pseudo-Markov transition probability vector and the amino acids content ratio vector.

  3. An Alignment-Free Algorithm in Comparing the Similarity of Protein Sequences Based on Pseudo-Markov Transition Probabilities among Amino Acids

    PubMed Central

    Li, Yushuang; Yang, Jiasheng; Zhang, Yi

    2016-01-01

    In this paper, we have proposed a novel alignment-free method for comparing the similarity of protein sequences. We first encode a protein sequence into a 440 dimensional feature vector consisting of a 400 dimensional Pseudo-Markov transition probability vector among the 20 amino acids, a 20 dimensional content ratio vector, and a 20 dimensional position ratio vector of the amino acids in the sequence. By evaluating the Euclidean distances among the representing vectors, we compare the similarity of protein sequences. We then apply this method into the ND5 dataset consisting of the ND5 protein sequences of 9 species, and the F10 and G11 datasets representing two of the xylanases containing glycoside hydrolase families, i.e., families 10 and 11. As a result, our method achieves a correlation coefficient of 0.962 with the canonical protein sequence aligner ClustalW in the ND5 dataset, much higher than those of other 5 popular alignment-free methods. In addition, we successfully separate the xylanases sequences in the F10 family and the G11 family and illustrate that the F10 family is more heat stable than the G11 family, consistent with a few previous studies. Moreover, we prove mathematically an identity equation involving the Pseudo-Markov transition probability vector and the amino acids content ratio vector. PMID:27918587

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

  5. Progressive multiple sequence alignments from triplets

    PubMed Central

    Kruspe, Matthias; Stadler, Peter F

    2007-01-01

    Background The quality of progressive sequence alignments strongly depends on the accuracy of the individual pairwise alignment steps since gaps that are introduced at one step cannot be removed at later aggregation steps. Adjacent insertions and deletions necessarily appear in arbitrary order in pairwise alignments and hence form an unavoidable source of errors. Research Here we present a modified variant of progressive sequence alignments that addresses both issues. Instead of pairwise alignments we use exact dynamic programming to align sequence or profile triples. This avoids a large fractions of the ambiguities arising in pairwise alignments. In the subsequent aggregation steps we follow the logic of the Neighbor-Net algorithm, which constructs a phylogenetic network by step-wisely replacing triples by pairs instead of combining pairs to singletons. To this end the three-way alignments are subdivided into two partial alignments, at which stage all-gap columns are naturally removed. This alleviates the "once a gap, always a gap" problem of progressive alignment procedures. Conclusion The three-way Neighbor-Net based alignment program aln3nn is shown to compare favorably on both protein sequences and nucleic acids sequences to other progressive alignment tools. In the latter case one easily can include scoring terms that consider secondary structure features. Overall, the quality of resulting alignments in general exceeds that of clustalw or other multiple alignments tools even though our software does not included heuristics for context dependent (mis)match scores. PMID:17631683

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

  7. Using second-order calibration method based on trilinear decomposition algorithms coupled with high performance liquid chromatography with diode array detector for determination of quinolones in honey samples.

    PubMed

    Yu, Yong-Jie; Wu, Hai-Long; Shao, Sheng-Zhi; Kang, Chao; Zhao, Juan; Wang, Yu; Zhu, Shao-Hua; Yu, Ru-Qin

    2011-09-15

    A novel strategy that combines the second-order calibration method based on the trilinear decomposition algorithms with high performance liquid chromatography with diode array detector (HPLC-DAD) was developed to mathematically separate the overlapped peaks and to quantify quinolones in honey samples. The HPLC-DAD data were obtained within a short time in isocratic mode. The developed method could be applied to determine 12 quinolones at the same time even in the presence of uncalibrated interfering components in complex background. To access the performance of the proposed strategy for the determination of quinolones in honey samples, the figures of merit were employed. The limits of quantitation for all analytes were within the range 1.2-56.7 μg kg(-1). The work presented in this paper illustrated the suitability and interesting potential of combining second-order calibration method with second-order analytical instrument for multi-residue analysis in honey samples.

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

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

  10. Projection-Based Volume Alignment

    PubMed Central

    Yu, Lingbo; Snapp, Robert R.; Ruiz, Teresa; Radermacher, Michael

    2013-01-01

    When heterogeneous samples of macromolecular assemblies are being examined by 3D electron microscopy (3DEM), often multiple reconstructions are obtained. For example, subtomograms of individual particles can be acquired from tomography, or volumes of multiple 2D classes can be obtained by random conical tilt reconstruction. Of these, similar volumes can be averaged to achieve higher resolution. Volume alignment is an essential step before 3D classification and averaging. Here we present a projection-based volume alignment (PBVA) algorithm. We select a set of projections to represent the reference volume and align them to a second volume. Projection alignment is achieved by maximizing the cross-correlation function with respect to rotation and translation parameters. If data are missing, the cross-correlation functions are normalized accordingly. Accurate alignments are obtained by averaging and quadratic interpolation of the cross-correlation maximum. Comparisons of the computation time between PBVA and traditional 3D cross-correlation methods demonstrate that PBVA outperforms the traditional methods. Performance tests were carried out with different signal-to-noise ratios using modeled noise and with different percentages of missing data using a cryo-EM dataset. All tests show that the algorithm is robust and highly accurate. PBVA was applied to align the reconstructions of a subcomplex of the NADH: ubiquinone oxidoreductase (Complex I) from the yeast Yarrowia lipolytica, followed by classification and averaging. PMID:23410725

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

  12. Real breakthrough in detection of radioactive sources by portal monitors with plastic detectors and New Advanced Source Identification Algorithm (ASIA-New)

    SciTech Connect

    Stavrov, Andrei; Yamamoto, Eugene

    2015-07-01

    Radiation Portal Monitors (RPM) with plastic detectors represent the main instruments used for primary border (customs) radiation control. RPM are widely used because they are simple, reliable, relatively inexpensive and have a high sensitivity. However, experience using the RPM in various countries has revealed the systems have some grave shortcomings. There is a dramatic decrease of the probability of detection of radioactive sources under high suppression of the natural gamma background (radiation control of heavy cargoes, containers and, especially, trains). NORM (Naturally Occurring Radioactive Material) existing in objects under control trigger the so-called 'nuisance alarms', requiring a secondary inspection for source verification. At a number of sites, the rate of such alarms is so high it significantly complicates the work of customs and border officers. This paper presents a brief description of new variant of algorithm ASIA-New (New Advanced Source Identification Algorithm), which was developed by the Rapiscan company. It also demonstrates results of different tests and the capability of a new system to overcome the shortcomings stated above. New electronics and ASIA-New enables RPM to detect radioactive sources under a high background suppression (tested at 15-30%) and to verify the detected NORM (KCl) and the artificial isotopes (Co- 57, Ba-133 and other). New variant of ASIA is based on physical principles, a phenomenological approach and analysis of some important parameter changes during the vehicle passage through the monitor control area. Thanks to this capability main advantage of new system is that this system can be easily installed into any RPM with plastic detectors. Taking into account that more than 4000 RPM has been installed worldwide their upgrading by ASIA-New may significantly increase probability of detection and verification of radioactive sources even masked by NORM. This algorithm was tested for 1,395 passages of different

  13. FPGA-based algorithms for the new trigger system for the phase 2 upgrade of the CMS drift tubes detector

    NASA Astrophysics Data System (ADS)

    Cela-Ruiz, J.-M.

    2017-01-01

    The new luminosity conditions imposed after the LHC upgrade will require a dedicated upgrade of several subdetectors. To cope with the new requirements, CMS drift tubes subdetector electronics will be redesigned in order to achieve the new foreseen response speed. In particular, it is necessary to enhance the first stage of the trigger system (L1A). In this document we present the development of a software algorithm, based on the mean timer paradigm, capable of reconstructing muon trajectories and rejecting spurious signals. It has been initially written in C++ programming language, but designed with its portability to a FPGA VHDL code in mind.

  14. BAYESIAN PROTEIN STRUCTURE ALIGNMENT1

    PubMed Central

    RODRIGUEZ, ABEL; SCHMIDLER, SCOTT C.

    2015-01-01

    The analysis of the three-dimensional structure of proteins is an important topic in molecular biochemistry. Structure plays a critical role in defining the function of proteins and is more strongly conserved than amino acid sequence over evolutionary timescales. A key challenge is the identification and evaluation of structural similarity between proteins; such analysis can aid in understanding the role of newly discovered proteins and help elucidate evolutionary relationships between organisms. Computational biologists have developed many clever algorithmic techniques for comparing protein structures, however, all are based on heuristic optimization criteria, making statistical interpretation somewhat difficult. Here we present a fully probabilistic framework for pairwise structural alignment of proteins. Our approach has several advantages, including the ability to capture alignment uncertainty and to estimate key “gap” parameters which critically affect the quality of the alignment. We show that several existing alignment methods arise as maximum a posteriori estimates under specific choices of prior distributions and error models. Our probabilistic framework is also easily extended to incorporate additional information, which we demonstrate by including primary sequence information to generate simultaneous sequence–structure alignments that can resolve ambiguities obtained using structure alone. This combined model also provides a natural approach for the difficult task of estimating evolutionary distance based on structural alignments. The model is illustrated by comparison with well-established methods on several challenging protein alignment examples. PMID:26925188

  15. Free-space optical communication alignment system

    NASA Astrophysics Data System (ADS)

    Mariola, M.; Petruccione, F.

    2016-10-01

    Optical communication systems in free space require a coarse and fine alignment system to align the receiver and transmitter. In general a coarse alignment is not entirely accurate to transmit the laser beacon in the exact direction of the visible field of the camera. During this process, some algorithms such as the raster, spiral and raster spiral scan algorithm can be used to find the spot of the laser beacon. Applications that require to transmit data in form of polarization signals, such as quantum cryptography, requires a polarisation bases alignment system to transmit and receive the photons. In this paper we present a fine alignment system using a polarised laser beacon. The system proposed was subdivided into a coarse and fine alignment system. The coarse alignment was implemented by using the GPS to acquire the geographical position of the transmitter, receiver and a reference point. The fine alignment was achieved by using a polarised laser beacon from the receiver to the transmitter and a camera located on the transmitter side. The algorithm presented was capable of excluding the background noise. Furthermore the polarisation of the laser beacon was used to align the polarisation bases of the transmitter and the receiver.

  16. Efficient pairwise RNA structure prediction and alignment using sequence alignment constraints

    PubMed Central

    Dowell, Robin D; Eddy, Sean R

    2006-01-01

    Background We are interested in the problem of predicting secondary structure for small sets of homologous RNAs, by incorporating limited comparative sequence information into an RNA folding model. The Sankoff algorithm for simultaneous RNA folding and alignment is a basis for approaches to this problem. There are two open problems in applying a Sankoff algorithm: development of a good unified scoring system for alignment and folding and development of practical heuristics for dealing with the computational complexity of the algorithm. Results We use probabilistic models (pair stochastic context-free grammars, pairSCFGs) as a unifying framework for scoring pairwise alignment and folding. A constrained version of the pairSCFG structural alignment algorithm was developed which assumes knowledge of a few confidently aligned positions (pins). These pins are selected based on the posterior probabilities of a probabilistic pairwise sequence alignment. Conclusion Pairwise RNA structural alignment improves on structure prediction accuracy relative to single sequence folding. Constraining on alignment is a straightforward method of reducing the runtime and memory requirements of the algorithm. Five practical implementations of the pairwise Sankoff algorithm – this work (Consan), David Mathews' Dynalign, Ian Holmes' Stemloc, Ivo Hofacker's PMcomp, and Jan Gorodkin's FOLDALIGN – have comparable overall performance with different strengths and weaknesses. PMID:16952317

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

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

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

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

    PubMed

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

    2015-06-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.

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

  2. Inexact Local Alignment Search over Suffix Arrays.

    PubMed

    Ghodsi, Mohammadreza; Pop, Mihai

    2009-11-01

    We describe an algorithm for finding approximate seeds for DNA homology searches. In contrast to previous algorithms that use exact or spaced seeds, our approximate seeds may contain insertions and deletions. We present a generalized heuristic for finding such seeds efficiently and prove that the heuristic does not affect sensitivity. We show how to adapt this algorithm to work over the memory efficient suffix array with provably minimal overhead in running time.We demonstrate the effectiveness of our algorithm on two tasks: whole genome alignment of bacteria and alignment of the DNA sequences of 177 genes that are orthologous in human and mouse. We show our algorithm achieves better sensitivity and uses less memory than other commonly used local alignment tools.

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

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

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

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

  7. Multiple whole-genome alignments without a reference organism.

    PubMed

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

    2009-04-01

    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 six Drosophila 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.

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

  9. Some aspects of SR beamline alignment

    NASA Astrophysics Data System (ADS)

    Gaponov, Yu. A.; Cerenius, Y.; Nygaard, J.; Ursby, T.; Larsson, K.

    2011-09-01

    Based on the Synchrotron Radiation (SR) beamline optical element-by-element alignment with analysis of the alignment results an optimized beamline alignment algorithm has been designed and developed. The alignment procedures have been designed and developed for the MAX-lab I911-4 fixed energy beamline. It has been shown that the intermediate information received during the monochromator alignment stage can be used for the correction of both monochromator and mirror without the next stages of alignment of mirror, slits, sample holder, etc. Such an optimization of the beamline alignment procedures decreases the time necessary for the alignment and becomes useful and helpful in the case of any instability of the beamline optical elements, storage ring electron orbit or the wiggler insertion device, which could result in the instability of angular and positional parameters of the SR beam. A general purpose software package for manual, semi-automatic and automatic SR beamline alignment has been designed and developed using the developed algorithm. The TANGO control system is used as the middle-ware between the stand-alone beamline control applications BLTools, BPMonitor and the beamline equipment.

  10. 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…

  11. A novel approach to multiple sequence alignment using hadoop data grids.

    PubMed

    Sudha Sadasivam, G; Baktavatchalam, G

    2010-01-01

    Multiple alignment of protein sequences helps to determine evolutionary linkage and to predict molecular structures. The factors to be considered while aligning multiple sequences are speed and accuracy of alignment. Although dynamic programming algorithms produce accurate alignments, they are computation intensive. In this paper we propose a time efficient approach to sequence alignment that also produces quality alignment. The dynamic nature of the algorithm coupled with data and computational parallelism of hadoop data grids improves the accuracy and speed of sequence alignment. The principle of block splitting in hadoop coupled with its scalability facilitates alignment of very large sequences.

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

    PubMed

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

    2012-05-16

    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.

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

  14. Cavity alignment using fringe scanning

    NASA Astrophysics Data System (ADS)

    Sinkunaite, Laura Paulina; Kawabe, Keita; Landry, Michael

    2017-01-01

    LIGO employs two 4-km long Fabry-Pérot arm cavities, which need to be aligned in order for an interferometer to be locked on a TEM00 mode. Once the cavity is locked, alignment signals can be derived from wave-front sensors which measure the TEM01 mode content. However, the alignment state is not always good enough for locking on TEM00. Even when this is the case, the alignment can be evaluated using a free swinging cavity, that shows flashes when higher-order modes become resonant. By moving test masses, small changes are made to the mirror orientation, and hence the TEM00 mode can be optimized iteratively. Currently, this is a manual procedure, and thus it is very time-consuming. Therefore, this project is aimed to study another possible way to lock the cavity on the TEM00 mode. Misalignment information can also be extracted from the power of the higher-order modes transmitted through the cavity. This talk will present an algorithm for this alternative and faster way to derive the alignment state of the arm cavities. Supported by APS FIP, NSF, and Caltech SFP.

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

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

  17. Energy calibration and gain correction of pixelated spectroscopic x-ray detectors using correlation optimised warping

    NASA Astrophysics Data System (ADS)

    Egan, C. K.; Scuffham, J. W.; Veale, M. C.; Wilson, M. D.; Seller, P.; Cernik, R. J.

    2017-01-01

    We describe the implementation of a reliable, robust and flexible gain correction and energy calibration algorithm for pixelated spectroscopic x-ray detectors. This algorithm uses a data processing method known as correlation optimised warping which aligns shifted datasets by means of a segmental linear stretching and compression of the spectral data in order to best correlate with a reference spectrum. We found the algorithm to be very robust against low-count spectroscopy, and was reliable in a range of different spectroscopic applications. Analysis of the integrated spectrum over all pixels for a Cerium K-alpha x-ray emission (at 34.72 keV) yielded a peak width of 2.45 keV before alignment and 1.11 keV after alignment. This compares favourably with the best in class pixel peak width of 0.76 keV and the mean peak width for all pixels of 1.00 keV. We also found the algorithm to be more user friendly than other peak-search algorithms because there is less external input. A key advantage of this algorithm is that it requires no prior knowledge of the input spectral characteristics, shape or quality of the data. This therefore lends itself to being useful for in-line processing and potentially removes the need for a separate calibration standard (e.g. a radioactive source). This algorithm can be used for any system that simultaneously collects large numbers of spectral data—including multi-element detectors.

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

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

    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.

  20. Alignment method for spectrograms of DNA sequences.

    PubMed

    Bucur, Anca; van Leeuwen, Jasper; Dimitrova, Nevenka; Mittal, Chetan

    2010-01-01

    DNA spectrograms express the periodicities of each of the four nucleotides A, T, C, and G in one or several genomic sequences to be analyzed. DNA spectral analysis can be applied to systematically investigate DNA patterns, which may correspond to relevant biological features. As opposed to looking at nucleotide sequences, spectrogram analysis may detect structural characteristics in very long sequences that are not identifiable by sequence alignment. Alignment of DNA spectrograms can be used to facilitate analysis of very long sequences or entire genomes at different resolutions. Standard clustering algorithms have been used in spectral analysis to find strong patterns in spectra. However, as they use a global distance metric, these algorithms can only detect strong patterns coexisting in several frequencies. In this paper, we propose a new method and several algorithms for aligning spectra suitable for efficient spectral analysis and allowing for the easy detection of strong patterns in both single frequencies and multiple frequencies.

  1. DALIX: optimal DALI protein structure alignment.

    PubMed

    Wohlers, Inken; Andonov, Rumen; Klau, Gunnar W

    2013-01-01

    We present a mathematical model and exact algorithm for optimally aligning protein structures using the DALI scoring model. This scoring model is based on comparing the interresidue distance matrices of proteins and is used in the popular DALI software tool, a heuristic method for protein structure alignment. Our model and algorithm extend an integer linear programming approach that has been previously applied for the related, but simpler, contact map overlap problem. To this end, we introduce a novel type of constraint that handles negative score values and relax it in a Lagrangian fashion. The new algorithm, which we call DALIX, is applicable to any distance matrix-based scoring scheme. We also review options that allow to consider fewer pairs of interresidue distances explicitly because their large number hinders the optimization process. Using four known data sets of varying structural similarity, we compute many provably score-optimal DALI alignments. This allowed, for the first time, to evaluate the DALI heuristic in sound mathematical terms. The results indicate that DALI usually computes optimal or close to optimal alignments. However, we detect a subset of small proteins for which DALI fails to generate any significant alignment, although such alignments do exist.

  2. A novel partial sequence alignment tool for finding large deletions.

    PubMed

    Aruk, Taner; Ustek, Duran; Kursun, Olcay

    2012-01-01

    Finding large deletions in genome sequences has become increasingly more useful in bioinformatics, such as in clinical research and diagnosis. Although there are a number of publically available next generation sequencing mapping and sequence alignment programs, these software packages do not correctly align fragments containing deletions larger than one kb. We present a fast alignment software package, BinaryPartialAlign, that can be used by wet lab scientists to find long structural variations in their experiments. For BinaryPartialAlign, we make use of the Smith-Waterman (SW) algorithm with a binary-search-based approach for alignment with large gaps that we called partial alignment. BinaryPartialAlign implementation is compared with other straight-forward applications of SW. Simulation results on mtDNA fragments demonstrate the effectiveness (runtime and accuracy) of the proposed method.

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

  4. Clustering algorithm studies

    NASA Astrophysics Data System (ADS)

    Graf, Norman A.

    2001-07-01

    An object-oriented framework for undertaking clustering algorithm studies has been developed. We present here the definitions for the abstract Cells and Clusters as well as the interface for the algorithm. We intend to use this framework to investigate the interplay between various clustering algorithms and the resulting jet reconstruction efficiency and energy resolutions to assist in the design of the calorimeter detector.

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

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

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

  8. Aligning graphs and finding substructures by a cavity approach

    NASA Astrophysics Data System (ADS)

    Bradde, S.; Braunstein, A.; Mahmoudi, H.; Tria, F.; Weigt, M.; Zecchina, R.

    2010-02-01

    We introduce a new distributed algorithm for aligning graphs or finding substructures within a given graph. It is based on the cavity method and is used to study the maximum-clique and the graph-alignment problems in random graphs. The algorithm allows to analyze large graphs and may find applications in fields such as computational biology. As a proof of concept we use our algorithm to align the similarity graphs of two interacting protein families involved in bacterial signal transduction, and to predict actually interacting protein partners between these families.

  9. Aligning the CMS muon chambers with the muon alignment system during an extended cosmic ray run

    NASA Astrophysics Data System (ADS)

    CMS Collaboration

    2010-03-01

    The alignment system for the muon spectrometer of the CMS detector comprises three independent subsystems of optical and analog position sensors. It aligns muon chambers with respect to each other and to the central silicon tracker. System commissioning at full magnetic field began in 2008 during an extended cosmic ray run. The system succeeded in tracking muon detector movements of up to 18 mm and rotations of several milliradians under magnetic forces. Depending on coordinate and subsystem, the system achieved chamber alignment precisions of 140-350 μm and 30-200 μrad, close to the precision requirements of the experiment. Systematic errors on absolute positions are estimated to be 340-590 μm based on comparisons with independent photogrammetry measurements.

  10. Characterization of trabecular bone plate-rod microarchitecture using multirow detector CT and the tensor scale: Algorithms, validation, and applications to pilot human studies

    PubMed Central

    Saha, Punam K.; Liu, Yinxiao; Chen, Cheng; Jin, Dakai; Letuchy, Elena M.; Xu, Ziyue; Amelon, Ryan E.; Burns, Trudy L.; Torner, James C.; Levy, Steven M.; Calarge, Chadi A.

    2015-01-01

    Purpose: Osteoporosis is a common bone disease associated with increased risk of low-trauma fractures leading to substantial morbidity, mortality, and financial costs. Clinically, osteoporosis is defined by low bone mineral density (BMD); however, increasing evidence suggests that trabecular bone (TB) microarchitectural quality is an important determinant of bone strength and fracture risk. A tensor scale based algorithm for in vivo characterization of TB plate-rod microarchitecture at the distal tibia using multirow detector CT (MD-CT) imaging is presented and its performance and applications are examined. Methods: The tensor scale characterizes individual TB on the continuum between a perfect plate and a perfect rod and computes their orientation using optimal ellipsoidal representation of local structures. The accuracy of the method was evaluated using computer-generated phantom images at a resolution and signal-to-noise ratio achievable in vivo. The robustness of the method was examined in terms of stability across a wide range of voxel sizes, repeat scan reproducibility, and correlation between TB measures derived by imaging human ankle specimens under ex vivo and in vivo conditions. Finally, the application of the method was evaluated in pilot human studies involving healthy young-adult volunteers (age: 19 to 21 yr; 51 females and 46 males) and patients treated with selective serotonin reuptake inhibitors (SSRIs) (age: 19 to 21 yr; six males and six females). Results: An error of (3.2% ± 2.0%) (mean ± SD), computed as deviation from known measures of TB plate-width, was observed for computer-generated phantoms. An intraclass correlation coefficient of 0.95 was observed for tensor scale TB measures in repeat MD-CT scans where the measures were averaged over a small volume of interest of 1.05 mm diameter with limited smoothing effects. The method was found to be highly stable at different voxel sizes with an error of (2.29% ± 1.56%) at an in vivo voxel size

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

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

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

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

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

  16. Metabolic network alignment in large scale by network compression.

    PubMed

    Ay, Ferhat; Dang, Michael; Kahveci, Tamer

    2012-03-21

    Metabolic network alignment is a system scale comparative analysis that discovers important similarities and differences across different metabolisms and organisms. Although the problem of aligning metabolic networks has been considered in the past, the computational complexity of the existing solutions has so far limited their use to moderately sized networks. In this paper, we address the problem of aligning two metabolic networks, particularly when both of them are too large to be dealt with using existing methods. We develop a generic framework that can significantly improve the scale of the networks that can be aligned in practical time. Our framework has three major phases, namely the compression phase, the alignment phase and the refinement phase. For the first phase, we develop an algorithm which transforms the given networks to a compressed domain where they are summarized using fewer nodes, termed supernodes, and interactions. In the second phase, we carry out the alignment in the compressed domain using an existing network alignment method as our base algorithm. This alignment results in supernode mappings in the compressed domain, each of which are smaller instances of network alignment problem. In the third phase, we solve each of the instances using the base alignment algorithm to refine the alignment results. We provide a user defined parameter to control the number of compression levels which generally determines the tradeoff between the quality of the alignment versus how fast the algorithm runs. Our experiments on the networks from KEGG pathway database demonstrate that the compression method we propose reduces the sizes of metabolic networks by almost half at each compression level which provides an expected speedup of more than an order of magnitude. We also observe that the alignments obtained by only one level of compression capture the original alignment results with high accuracy. Together, these suggest that our framework results in

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

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

  19. Tidal alignment of galaxies

    SciTech Connect

    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.

  20. Tidal alignment of galaxies

    SciTech Connect

    Blazek, Jonathan; Vlah, Zvonimir; Seljak, Uroš E-mail: zvlah@stanford.edu

    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.

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

  2. RADIATION DETECTOR

    DOEpatents

    Wilson, H.N.; Glass, F.M.

    1960-05-10

    A radiation detector of the type is described wherein a condenser is directly connected to the electrodes for the purpose of performing the dual function of a guard ring and to provide capacitance coupling for resetting the detector system.

  3. 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…

  4. Compton imaging with a highly-segmented, position-sensitive HPGe detector

    NASA Astrophysics Data System (ADS)

    Steinbach, T.; Hirsch, R.; Reiter, P.; Birkenbach, B.; Bruyneel, B.; Eberth, J.; Gernhäuser, R.; Hess, H.; Lewandowski, L.; Maier, L.; Schlarb, M.; Weiler, B.; Winkel, M.

    2017-02-01

    A Compton camera based on a highly-segmented high-purity germanium (HPGe) detector and a double-sided silicon-strip detector (DSSD) was developed, tested, and put into operation; the origin of γ radiation was determined successfully. The Compton camera is operated in two different modes. Coincidences from Compton-scattered γ-ray events between DSSD and HPGe detector allow for best angular resolution; while the high-efficiency mode takes advantage of the position sensitivity of the highly-segmented HPGe detector. In this mode the setup is sensitive to the whole 4π solid angle. The interaction-point positions in the 36-fold segmented large-volume HPGe detector are determined by pulse-shape analysis (PSA) of all HPGe detector signals. Imaging algorithms were developed for each mode and successfully implemented. The angular resolution sensitively depends on parameters such as geometry, selected multiplicity and interaction-point distances. Best results were obtained taking into account the crosstalk properties, the time alignment of the signals and the distance metric for the PSA for both operation modes. An angular resolution between 13.8° and 19.1°, depending on the minimal interaction-point distance for the high-efficiency mode at an energy of 1275 keV, was achieved. In the coincidence mode, an increased angular resolution of 4.6° was determined for the same γ-ray energy.

  5. A New Analytic Alignment Method for a SINS.

    PubMed

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

    2015-11-04

    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.

  6. Mango: multiple alignment with N gapped oligos.

    PubMed

    Zhang, Zefeng; Lin, Hao; Li, Ming

    2008-06-01

    Multiple sequence alignment is a classical and challenging task. The problem is NP-hard. The full dynamic programming takes too much time. The progressive alignment heuristics adopted by most state-of-the-art works suffer from the "once a gap, always a gap" phenomenon. Is there a radically new way to do multiple sequence alignment? In this paper, we introduce a novel and orthogonal multiple sequence alignment method, using both multiple optimized spaced seeds and new algorithms to handle these seeds efficiently. Our new algorithm processes information of all sequences as a whole and tries to build the alignment vertically, avoiding problems caused by the popular progressive approaches. Because the optimized spaced seeds have proved significantly more sensitive than the consecutive k-mers, the new approach promises to be more accurate and reliable. To validate our new approach, we have implemented MANGO: Multiple Alignment with N Gapped Oligos. Experiments were carried out on large 16S RNA benchmarks, showing that MANGO compares favorably, in both accuracy and speed, against state-of-the-art multiple sequence alignment methods, including ClustalW 1.83, MUSCLE 3.6, MAFFT 5.861, ProbConsRNA 1.11, Dialign 2.2.1, DIALIGN-T 0.2.1, T-Coffee 4.85, POA 2.0, and Kalign 2.0. We have further demonstrated the scalability of MANGO on very large datasets of repeat elements. MANGO can be downloaded at http://www.bioinfo.org.cn/mango/ and is free for academic usage.

  7. FlexSnap: Flexible Non-sequential Protein Structure Alignment

    NASA Astrophysics Data System (ADS)

    Salem, Saeed; Zaki, Mohammed J.; Bystroff, Chris

    Proteins have evolved subject to energetic selection pressure for stability and flexibility. Structural similarity between proteins which 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 sequence permutations are considered. We propose the FlexSnap algorithm for flexible non-topological protein structural alignment. 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.

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

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

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

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

  12. Improving the Arabidopsis genome annotation using maximal transcript alignment assemblies.

    PubMed

    Haas, Brian J; Delcher, Arthur L; Mount, Stephen M; Wortman, Jennifer R; Smith, Roger K; Hannick, Linda I; Maiti, Rama; Ronning, Catherine M; Rusch, Douglas B; Town, Christopher D; Salzberg, Steven L; White, Owen

    2003-10-01

    The spliced alignment of expressed sequence data to genomic sequence has proven a key tool in the comprehensive annotation of genes in eukaryotic genomes. A novel algorithm was developed to assemble clusters of overlapping transcript alignments (ESTs and full-length cDNAs) into maximal alignment assemblies, thereby comprehensively incorporating all available transcript data and capturing subtle splicing variations. Complete and partial gene structures identified by this method were used to improve The Institute for Genomic Research Arabidopsis genome annotation (TIGR release v.4.0). The alignment assemblies permitted the automated modeling of several novel genes and >1000 alternative splicing variations as well as updates (including UTR annotations) to nearly half of the approximately 27 000 annotated protein coding genes. The algorithm of the Program to Assemble Spliced Alignments (PASA) tool is described, as well as the results of automated updates to Arabidopsis gene annotations.

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

  14. Regular Language Constrained Sequence Alignment Revisited

    NASA Astrophysics Data System (ADS)

    Kucherov, Gregory; Pinhas, Tamar; Ziv-Ukelson, Michal

    Imposing constraints in the form of a finite automaton or a regular expression is an effective way to incorporate additional a priori knowledge into sequence alignment procedures. With this motivation, Arslan [1] introduced the Regular Language Constrained Sequence Alignment Problem and proposed an O(n 2 t 4) time and O(n 2 t 2) space algorithm for solving it, where n is the length of the input strings and t is the number of states in the non-deterministic automaton, which is given as input. Chung et al. [2] proposed a faster O(n 2 t 3) time algorithm for the same problem. In this paper, we further speed up the algorithms for Regular Language Constrained Sequence Alignment by reducing their worst case time complexity bound to O(n 2 t 3/logt). This is done by establishing an optimal bound on the size of Straight-Line Programs solving the maxima computation subproblem of the basic dynamic programming algorithm. We also study another solution based on a Steiner Tree computation. While it does not improve the run time complexity in the worst case, our simulations show that both approaches are efficient in practice, especially when the input automata are dense.

  15. Recursions for statistical multiple alignment

    PubMed Central

    Hein, Jotun; Jensen, Jens Ledet; Pedersen, Christian N. S.

    2003-01-01

    Algorithms are presented that allow the calculation of the probability of a set of sequences related by a binary tree that have evolved according to the Thorne–Kishino–Felsenstein model for a fixed set of parameters. The algorithms are based on a Markov chain generating sequences and their alignment at nodes in a tree. Depending on whether the complete realization of this Markov chain is decomposed into the first transition and the rest of the realization or the last transition and the first part of the realization, two kinds of recursions are obtained that are computationally similar but probabilistically different. The running time of the algorithms is \\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\setlength{\\oddsidemargin}{-69pt} \\begin{document} \\begin{equation*}O({\\Pi}_{i}^{d}=1~L_{i})\\end{equation*}\\end{document}, where Li is the length of the ith observed sequences and d is the number of sequences. An alternative recursion is also formulated that uses only a Markov chain involving the inner nodes of a tree. PMID:14657378

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

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

  18. Alignment of CEBAF cryomodules

    SciTech Connect

    Schneider, W.J.; Bisognano, J.J.; Fischer, J.

    1993-06-01

    CEBAF, the Continuous Electron Beam Accelerator Facility, when completed, will house a 4 GeV recirculating accelerator. Each of the accelerator`s two linacs contains 160 superconducting radio frequency (SRF) 1497 MHz niobium cavities in 20 cryomodules. Alignments of the cavities within the cryomodule with respect to beam axis is critical to achieving the optimum accelerator performance. This paper discusses the rationale for the current specification on cavity mechanical alignment: 2 mrad (rms) applied to the 0.5 m active length cavities. We describe the tooling that was developed to achieve the tolerance at the time of cavity pair assembly, to preserve and integrate alignment during cryomodule assembly, and to translate alignment to appropriate installation in the beam line.

  19. Identifying subset errors in multiple sequence alignments.

    PubMed

    Roy, Aparna; Taddese, Bruck; Vohra, Shabana; Thimmaraju, Phani K; Illingworth, Christopher J R; Simpson, Lisa M; Mukherjee, Keya; Reynolds, Christopher A; Chintapalli, Sree V

    2014-01-01

    Multiple sequence alignment (MSA) accuracy is important, but there is no widely accepted method of judging the accuracy that different alignment algorithms give. We present a simple approach to detecting two types of error, namely block shifts and the misplacement of residues within a gap. Given a MSA, subsets of very similar sequences are generated through the use of a redundancy filter, typically using a 70-90% sequence identity cut-off. Subsets thus produced are typically small and degenerate, and errors can be easily detected even by manual examination. The errors, albeit minor, are inevitably associated with gaps in the alignment, and so the procedure is particularly relevant to homology modelling of protein loop regions. The usefulness of the approach is illustrated in the context of the universal but little known [K/R]KLH motif that occurs in intracellular loop 1 of G protein coupled receptors (GPCR); other issues relevant to GPCR modelling are also discussed.

  20. 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…

  1. Metal Detectors.

    ERIC Educational Resources Information Center

    Harrington-Lueker, Donna

    1992-01-01

    Schools that count on metal detectors to stem the flow of weapons into the schools create a false sense of security. Recommendations include investing in personnel rather than hardware, cultivating the confidence of law-abiding students, and enforcing discipline. Metal detectors can be quite effective at afterschool events. (MLF)

  2. Reconstruction of three-dimensional molecular structure from diffraction of laser-aligned molecules

    PubMed Central

    Yang, Jie; Makhija, Varun; Kumarappan, Vinod; Centurion, Martin

    2014-01-01

    Diffraction from laser-aligned molecules has been proposed as a method for determining 3-D molecular structures in the gas phase. However, existing structural retrieval algorithms are limited by the imperfect alignment in experiments and the rotational averaging in 1-D alignment. Here, we demonstrate a two-step reconstruction comprising a genetic algorithm that corrects for the imperfect alignment followed by an iterative phase retrieval method in cylindrical coordinates. The algorithm was tested with simulated diffraction patterns. We show that the full 3-D structure of trifluorotoluene, an asymmetric-top molecule, can be reconstructed with atomic resolution. PMID:26798781

  3. Multiple sequence alignment with user-defined anchor points

    PubMed Central

    Morgenstern, Burkhard; Prohaska, Sonja J; Pöhler, Dirk; Stadler, Peter F

    2006-01-01

    Background Automated software tools for multiple alignment often fail to produce biologically meaningful results. In such situations, expert knowledge can help to improve the quality of alignments. Results Herein, we describe a semi-automatic version of the alignment program DIALIGN that can take pre-defined constraints into account. It is possible for the user to specify parts of the sequences that are assumed to be homologous and should therefore be aligned to each other. Our software program can use these sites as anchor points by creating a multiple alignment respecting these constraints. This way, our alignment method can produce alignments that are biologically more meaningful than alignments produced by fully automated procedures. As a demonstration of how our method works, we apply our approach to genomic sequences around the Hox gene cluster and to a set of DNA-binding proteins. As a by-product, we obtain insights about the performance of the greedy algorithm that our program uses for multiple alignment and about the underlying objective function. This information will be useful for the further development of DIALIGN. The described alignment approach has been integrated into the TRACKER software system. PMID:16722533

  4. BigFoot: Bayesian alignment and phylogenetic footprinting with MCMC

    PubMed Central

    Satija, Rahul; Novák, Ádám; Miklós, István; Lyngsø, Rune; Hein, Jotun

    2009-01-01

    Background We have previously combined statistical alignment and phylogenetic footprinting to detect conserved functional elements without assuming a fixed alignment. Considering a probability-weighted distribution of alignments removes sensitivity to alignment errors, properly accommodates regions of alignment uncertainty, and increases the accuracy of functional element prediction. Our method utilized standard dynamic programming hidden markov model algorithms to analyze up to four sequences. Results We present a novel approach, implemented in the software package BigFoot, for performing phylogenetic footprinting on greater numbers of sequences. We have developed a Markov chain Monte Carlo (MCMC) approach which samples both sequence alignments and locations of slowly evolving regions. We implement our method as an extension of the existing StatAlign software package and test it on well-annotated regions controlling the expression of the even-skipped gene in Drosophila and the α-globin gene in vertebrates. The results exhibit how adding additional sequences to the analysis has the potential to improve the accuracy of functional predictions, and demonstrate how BigFoot outperforms existing alignment-based phylogenetic footprinting techniques. Conclusion BigFoot extends a combined alignment and phylogenetic footprinting approach to analyze larger amounts of sequence data using MCMC. Our approach is robust to alignment error and uncertainty and can be applied to a variety of biological datasets. The source code and documentation are publicly available for download from PMID:19715598

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

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

  7. The effectiveness of detector combinations.

    PubMed

    Li, Zhenghao; Gong, Weiguo; Nee, A Y C; Ong, S K

    2009-04-27

    In this paper, the performance improvement benefiting from the combination of local feature detectors for image matching and registration is evaluated. Possible combinations of five types of representative interest point detectors and region detectors are integrated into the testing framework. The performance is compared using the number of correspondences and the repeatability rate, as well as an original evaluation criterion named the Reconstruction Similarity (RS), which reflects not only the number of matches, but also the degree of matching error. It is observed that the combination of DoG extremum and MSCR outperforms any single detectors and other detector combinations in most cases. Furthermore, MDSS, a hybrid algorithm for accurate image matching, is proposed. Compared with standard SIFT and GLOH, its average RS rate exceeds more than 3.56%, and takes up even less computational time.

  8. Proposed technique for vertical alignment of a crane's cable

    NASA Technical Reports Server (NTRS)

    Gera, J., Jr.

    1969-01-01

    Proposed vertical alignment technique senses the attitude of a cranes cable and displays any deviation from the vertical. The system consists of a detector assembly fixed to the boom and a display scope located in the cabin. It has potential application with either fixed-boom cranes or gantries.

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

  10. Magnetically Aligned Supramolecular Hydrogels

    PubMed Central

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

    2014-01-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

  11. Improved docking alignment system

    NASA Technical Reports Server (NTRS)

    Monford, Leo G. (Inventor)

    1988-01-01

    Improved techniques are provided for the alignment of two objects. The present invention is particularly suited for 3-D translation and 3-D rotational alignment of objects in outer space. A camera is affixed to one object, such as a remote manipulator arm of the spacecraft, while the planar reflective surface is affixed to the other object, such as a grapple fixture. A monitor displays in real-time images from the camera such that the monitor displays both the reflected image of the camera and visible marking on the planar reflective surface when the objects are in proper alignment. The monitor may thus be viewed by the operator and the arm manipulated so that the reflective surface is perpendicular to the optical axis of the camera, the roll of the reflective surface is at a selected angle with respect to the camera, and the camera is spaced a pre-selected distance from the reflective surface.

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

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

  14. 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…

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

  16. Alignment of trans-tibial prostheses based on roll-over shape principles.

    PubMed

    Hansen, A H; Meier, M R; Sam, M; Childress, D S; Edwards, M L

    2003-08-01

    The authors examined the roll-over shape alignment hypothesis, which states that prosthetic feet are aligned by matching their roll-over shapes with an "ideal" shape. The "ideal" shape was considered to be the roll-over shape of the able-bodied foot-ankle system. An alignment algorithm and computational alignment system were developed to set trans-tibial alignments based on this hypothesis. Three prosthetic feet with considerably different roll-over shapes were either aligned using the alignment system or not aligned (i.e. used previous foot's alignment), and then were aligned by a team of prosthetists. No significant differences were found between roll-over shapes aligned by the computational alignment system and those based on standard clinical techniques (p = 0.944). Significant differences were found between the "no alignment" shapes and the prosthetist alignment shapes (p = 0.006), and between the "no alignment" shapes and the computational alignment system shapes (p = 0.024). The results of the experiment support the hypothesis that the goal of alignment is to match the prosthetic foot's roll-over shape, as closely as possible, with an "ideal" shape. The hypothesis is also supported by its ability to explain the results of previous studies. Using an "ideal" roll-over shape or surface as a goal for prosthetic alignment could lead to a priori alignment, eliminating the need for alignment hardware in some cases. Being able to build the alignment into a prosthesis without special hardware could be beneficial in low-income countries and in the fabrication of lightweight prostheses for the elderly.

  17. 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…

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

  19. 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…

  20. Reflection Spectromicroscopy for the Design of Nanopillar Optical Antenna Detectors

    DTIC Science & Technology

    2014-08-29

    aligned nanohole array (Fig. 1(b)). The photodetector active area is comprised of a 40 μm 40 μm nanopillar array. Reflection spectrometry is a simple...600 nm. (b) Fabricated detector with self-aligned nanohole array fabricated through tilted metal deposition. Scale bar, 200 nm. Fig. 2 (a

  1. Parallel sequence alignment in limited space.

    PubMed

    Grice, J A; Hughey, R; Speck, D

    1995-01-01

    Sequence comparison with affine gap costs is a problem that is readily parallelizable on simple single-instruction, multiple-data stream (SIMD) parallel processors using only constant space per processing element. Unfortunately, the twin problem of sequence alignment, finding the optimal character-by-character correspondence between two sequences, is more complicated. While the innovative O(n2)-time and O(n)-space serial algorithm has been parallelized for multiple-instruction, multiple-data stream (MIMD) computers with only a communication-time slowdown, typically O(log n), it is not suitable for hardware-efficient SIMD parallel processors with only local communication. This paper proposes several methods of computing sequence alignments with limited memory per processing element. The algorithms are also well-suited to serial implementation. The simpler algorithms feature, for an arbitrary integer L, a factor of L slowdown in exchange for reducing space requirements from O(n) to O(L square root of n) per processing element. Using this result, we describe an O(n log n) parallel time algorithm that requires O(log n) space per processing element on O(n) SIMD processing elements with only a mesh or linear interconnection network.

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

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

  4. Speeding up Batch Alignment of Large Ontologies Using MapReduce.

    PubMed

    Thayasivam, Uthayasanker; Doshi, Prashant

    2013-09-01

    Real-world ontologies tend to be very large with several containing thousands of entities. Increasingly, ontologies are hosted in repositories, which often compute the alignment between the ontologies. As new ontologies are submitted or ontologies are updated, their alignment with others must be quickly computed. Therefore, aligning several pairs of ontologies quickly becomes a challenge for these repositories. We project this problem as one of batch alignment and show how it may be approached using the distributed computing paradigm of MapReduce. Our approach allows any alignment algorithm to be utilized on a MapReduce architecture. Experiments using four representative alignment algorithms demonstrate flexible and significant speedup of batch alignment of large ontology pairs using MapReduce.

  5. MANGO: a new approach to multiple sequence alignment.

    PubMed

    Zhang, Zefeng; Lin, Hao; Li, Ming

    2007-01-01

    Multiple sequence alignment is a classical and challenging task for biological sequence analysis. The problem is NP-hard. The full dynamic programming takes too much time. The progressive alignment heuristics adopted by most state of the art multiple sequence alignment programs suffer from the 'once a gap, always a gap' phenomenon. Is there a radically new way to do multiple sequence alignment? This paper introduces a novel and orthogonal multiple sequence alignment method, using multiple optimized spaced seeds and new algorithms to handle these seeds efficiently. Our new algorithm processes information of all sequences as a whole, avoiding problems caused by the popular progressive approaches. Because the optimized spaced seeds are provably significantly more sensitive than the consecutive k-mers, the new approach promises to be more accurate and reliable. To validate our new approach, we have implemented MANGO: Multiple Alignment with N Gapped Oligos. Experiments were carried out on large 16S RNA benchmarks showing that MANGO compares favorably, in both accuracy and speed, against state-of-art multiple sequence alignment methods, including ClustalW 1.83, MUSCLE 3.6, MAFFT 5.861, Prob-ConsRNA 1.11, Dialign 2.2.1, DIALIGN-T 0.2.1, T-Coffee 4.85, POA 2.0 and Kalign 2.0.

  6. Intruder Detector

    NASA Technical Reports Server (NTRS)

    1978-01-01

    The shadowy prowler is attempting a break-in, unaware that his presence has already been detected and reported by the device in the lower left corner of the photo. It is part of a three-element ntruder Detecti on System developed by NASA's Ames Research Center from technology acquired in the Apollo lunar exploration program. Apollo astronauts left behind on the moon small portable seismic (shock) detectors to record subsurface vibrations and transmit to Earth data on the moon's density and thickness. A similar seismic detector is the key component of the lntruder Detection System. Encased in a stainless steel tube, the detector is implanted in the ground outside the facility being protected-home, bank, industrial or other facilities. The vibration-sensing detector picks up the footstep of anyone within a preset range. The detector is connected by cable to the transmitter, which relays the warning to a portable radio receiver. The radio alerts plant guards or home occupants by emitting an audible tone burst for each footstep.

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

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

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

  10. Automatic Word Alignment

    DTIC Science & Technology

    2014-02-18

    strategy was evalu­ ated in the context of English -to-Pashto (E2P) and Pashto-to- English (P2E), a low-resource language pair. For E2P, the training and...improves the quality of automatic word alignment, for example for resource poor language pairs, thus improving Statistical Machine Translation (SMT...example for resource poor language pairs, thus improving Statistical Machine Translation (SMT) performance. 15. SUBJECT TERMS 16. SECURITY

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

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

  13. Nuclear reactor alignment plate configuration

    SciTech Connect

    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.

  14. MAMA Detector

    NASA Technical Reports Server (NTRS)

    Bowyer, Stuart

    1998-01-01

    Work carried out under this grant led to fundamental discoveries and over one hundred publications in the scientific literature. Fundamental developments in instrumentation were made including all the instrumentation on the EUVE satellite, the invention of a whole new type of grazing instrument spectrometer and the development of fundamentally new photon counting detectors including the Wedge and Strip used on EUVE and many other missions and the Time Delay detector used on OREFUS and FUSE. The Wedge and Strip and Time Delay detectors were developed under this grant for less than two million dollars and have been used in numerous missions most recently for the FUSE mission. In addition, a fundamentally new type of diffuse spectrometer has been developed under this grant which has been used in instrumentation on the MMSAT spacecraft and the Lewis spacecraft. Plans are underway to use this instrumentation on several other missions as well.

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

  16. Multiple protein structure alignment.

    PubMed Central

    Taylor, W. R.; Flores, T. P.; Orengo, C. A.

    1994-01-01

    A method was developed to compare protein structures and to combine them into a multiple structure consensus. Previous methods of multiple structure comparison have only concatenated pairwise alignments or produced a consensus structure by averaging coordinate sets. The current method is a fusion of the fast structure comparison program SSAP and the multiple sequence alignment program MULTAL. As in MULTAL, structures are progressively combined, producing intermediate consensus structures that are compared directly to each other and all remaining single structures. This leads to a hierarchic "condensation," continually evaluated in the light of the emerging conserved core regions. Following the SSAP approach, all interatomic vectors were retained with well-conserved regions distinguished by coherent vector bundles (the structural equivalent of a conserved sequence position). Each bundle of vectors is summarized by a resultant, whereas vector coherence is captured in an error term, which is the only distinction between conserved and variable positions. Resultant vectors are used directly in the comparison, which is weighted by their error values, giving greater importance to the matching of conserved positions. The resultant vectors and their errors can also be used directly in molecular modeling. Applications of the method were assessed by the quality of the resulting sequence alignments, phylogenetic tree construction, and databank scanning with the consensus. Visual assessment of the structural superpositions and consensus structure for various well-characterized families confirmed that the consensus had identified a reasonable core. PMID:7849601

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

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

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

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

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

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

  3. Method for alignment of microwires

    DOEpatents

    Beardslee, Joseph A.; Lewis, Nathan S.; Sadtler, Bryce

    2017-01-24

    A method of aligning microwires includes modifying the microwires so they are more responsive to a magnetic field. The method also includes using a magnetic field so as to magnetically align the microwires. The method can further include capturing the microwires in a solid support structure that retains the longitudinal alignment of the microwires when the magnetic field is not applied to the microwires.

  4. Alignment as a Teacher Variable

    ERIC Educational Resources Information Center

    Porter, Andrew C.; Smithson, John; Blank, Rolf; Zeidner, Timothy

    2007-01-01

    With the exception of the procedures developed by Porter and colleagues (Porter, 2002), other methods of defining and measuring alignment are essentially limited to alignment between tests and standards. Porter's procedures have been generalized to investigating the alignment between content standards, tests, textbooks, and even classroom…

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

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

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

  8. Precision alignment and mounting apparatus

    NASA Technical Reports Server (NTRS)

    Preston, Dennis R. (Inventor)

    1993-01-01

    An alignment and mounting apparatus for mounting two modules (10,12) includes a first portion having a cylindrical alignment pin (16) projecting normal to a module surface, a second portion having a three-stage alignment guide (18) including a shoehorn flange (34), a Y-slot (42) and a V-block (22) which sequentially guide the alignment pin (16) with successively finer precision and a third portion in the form of a spring-loaded captive fastener (20) for connecting the two modules after alignment is achieved.

  9. PASTA: Ultra-Large Multiple Sequence Alignment for Nucleotide and Amino-Acid Sequences.

    PubMed

    Mirarab, Siavash; Nguyen, Nam; Guo, Sheng; Wang, Li-San; Kim, Junhyong; Warnow, Tandy

    2015-05-01

    We introduce PASTA, a new multiple sequence alignment algorithm. PASTA uses a new technique to produce an alignment given a guide tree that enables it to be both highly scalable and very accurate. We present a study on biological and simulated data with up to 200,000 sequences, showing that PASTA produces highly accurate alignments, improving on the accuracy and scalability of the leading alignment methods (including SATé). We also show that trees estimated on PASTA alignments are highly accurate--slightly better than SATé trees, but with substantial improvements relative to other methods. Finally, PASTA is faster than SATé, highly parallelizable, and requires relatively little memory.

  10. FASMA: a service to format and analyze sequences in multiple alignments.

    PubMed

    Costantini, Susan; Colonna, Giovanni; Facchiano, Angelo M

    2007-12-01

    Multiple sequence alignments are successfully applied in many studies for under- standing the structural and functional relations among single nucleic acids and protein sequences as well as whole families. Because of the rapid growth of sequence databases, multiple sequence alignments can often be very large and difficult to visualize and analyze. We offer a new service aimed to visualize and analyze the multiple alignments obtained with different external algorithms, with new features useful for the comparison of the aligned sequences as well as for the creation of a final image of the alignment. The service is named FASMA and is available at http://bioinformatica.isa.cnr.it/FASMA/.

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

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

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

  14. Image Correlation Method for DNA Sequence Alignment

    PubMed Central

    Curilem Saldías, Millaray; Villarroel Sassarini, Felipe; Muñoz Poblete, Carlos; Vargas Vásquez, Asticio; Maureira Butler, Iván

    2012-01-01

    The complexity of searches and the volume of genomic data make sequence alignment one of bioinformatics most active research areas. New alignment approaches have incorporated digital signal processing techniques. Among these, correlation methods are highly sensitive. This paper proposes a novel sequence alignment method based on 2-dimensional images, where each nucleic acid base is represented as a fixed gray intensity pixel. Query and known database sequences are coded to their pixel representation and sequence alignment is handled as object recognition in a scene problem. Query and database become object and scene, respectively. An image correlation process is carried out in order to search for the best match between them. Given that this procedure can be implemented in an optical correlator, the correlation could eventually be accomplished at light speed. This paper shows an initial research stage where results were “digitally” obtained by simulating an optical correlation of DNA sequences represented as images. A total of 303 queries (variable lengths from 50 to 4500 base pairs) and 100 scenes represented by 100 x 100 images each (in total, one million base pair database) were considered for the image correlation analysis. The results showed that correlations reached very high sensitivity (99.01%), specificity (98.99%) and outperformed BLAST when mutation numbers increased. However, digital correlation processes were hundred times slower than BLAST. We are currently starting an initiative to evaluate the correlation speed process of a real experimental optical correlator. By doing this, we expect to fully exploit optical correlation light properties. As the optical correlator works jointly with the computer, digital algorithms should also be optimized. The results presented in this paper are encouraging and support the study of image correlation methods on sequence alignment. PMID:22761742

  15. Image correlation method for DNA sequence alignment.

    PubMed

    Curilem Saldías, Millaray; Villarroel Sassarini, Felipe; Muñoz Poblete, Carlos; Vargas Vásquez, Asticio; Maureira Butler, Iván

    2012-01-01

    The complexity of searches and the volume of genomic data make sequence alignment one of bioinformatics most active research areas. New alignment approaches have incorporated digital signal processing techniques. Among these, correlation methods are highly sensitive. This paper proposes a novel sequence alignment method based on 2-dimensional images, where each nucleic acid base is represented as a fixed gray intensity pixel. Query and known database sequences are coded to their pixel representation and sequence alignment is handled as object recognition in a scene problem. Query and database become object and scene, respectively. An image correlation process is carried out in order to search for the best match between them. Given that this procedure can be implemented in an optical correlator, the correlation could eventually be accomplished at light speed. This paper shows an initial research stage where results were "digitally" obtained by simulating an optical correlation of DNA sequences represented as images. A total of 303 queries (variable lengths from 50 to 4500 base pairs) and 100 scenes represented by 100 x 100 images each (in total, one million base pair database) were considered for the image correlation analysis. The results showed that correlations reached very high sensitivity (99.01%), specificity (98.99%) and outperformed BLAST when mutation numbers increased. However, digital correlation processes were hundred times slower than BLAST. We are currently starting an initiative to evaluate the correlation speed process of a real experimental optical correlator. By doing this, we expect to fully exploit optical correlation light properties. As the optical correlator works jointly with the computer, digital algorithms should also be optimized. The results presented in this paper are encouraging and support the study of image correlation methods on sequence alignment.

  16. Computer-assisted area detector masking.

    PubMed

    Wright, Christopher J; Zhou, Xiao Dong

    2017-03-01

    Area detectors have become the predominant type of detector for the rapid acquisition of X-ray diffraction, small-angle scattering and total scattering. These detectors record the scattering for a large area, giving each shot good statistical significance to the resulting scattered intensity I(Q) pattern. However, many of these detectors have pixel level defects, which cause error in the resulting one-dimensional patterns. In this work, new software to automatically find and mask these dead pixels and other defects is presented. This algorithm is benchmarked with both ideal simulated and experimental datasets.

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

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

  19. 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…

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

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

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

  3. Automatic Parameter Learning for Multiple Local Network Alignment

    PubMed Central

    Novak, Antal; Do, Chuong B.; Srinivasan, Balaji S.; Batzoglou, Serafim

    2009-01-01

    Abstract We developed Græmlin 2.0, a new multiple network aligner with (1) a new multi-stage approach to local network alignment; (2) a novel scoring function that can use arbitrary features of a multiple network alignment, such as protein deletions, protein duplications, protein mutations, and interaction losses; (3) a parameter learning algorithm that uses a training set of known network alignments to learn parameters for our scoring function and thereby adapt it to any set of networks; and (4) an algorithm that uses our scoring function to find approximate multiple network alignments in linear time. We tested Græmlin 2.0's accuracy on protein interaction networks from IntAct, DIP, and the Stanford Network Database. We show that, on each of these datasets, Græmlin 2.0 has higher sensitivity and specificity than existing network aligners. Græmlin 2.0 is available under the GNU public license at http://graemlin.stanford.edu. PMID:19645599

  4. Haplotype assembly from aligned weighted SNP fragments.

    PubMed

    Zhao, Yu-Ying; Wu, Ling-Yun; Zhang, Ji-Hong; Wang, Rui-Sheng; Zhang, Xiang-Sun

    2005-08-01

    Given an assembled genome of a diploid organism the haplotype assembly problem can be formulated as retrieval of a pair of haplotypes from a set of aligned weighted SNP fragments. Known computational formulations (models) of this problem are minimum letter flips (MLF) and the weighted minimum letter flips (WMLF; Greenberg et al. (INFORMS J. Comput. 2004, 14, 211-213)). In this paper we show that the general WMLF model is NP-hard even for the gapless case. However the algorithmic solutions for selected variants of WMFL can exist and we propose a heuristic algorithm based on a dynamic clustering technique. We also introduce a new formulation of the haplotype assembly problem that we call COMPLETE WMLF (CWMLF). This model and algorithms for its implementation take into account a simultaneous presence of multiple kinds of data errors. Extensive computational experiments indicate that the algorithmic implementations of the CWMLF model achieve higher accuracy of haplotype reconstruction than the WMLF-based algorithms, which in turn appear to be more accurate than those based on MLF.

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

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

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

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

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

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

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

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

  13. Structural alignment of RNA with triple helix structure.

    PubMed

    Wong, Thomas K F; Yiu, S M

    2012-04-01

    Structural alignment is useful in identifying members of ncRNAs. Existing tools are all based on the secondary structures of the molecules. There is evidence showing that tertiary interactions (the interaction between a single-stranded nucleotide and a base-pair) in triple helix structures are critical in some functions of ncRNAs. In this article, we address the problem of structural alignment of RNAs with the triple helix. We provide a formal definition to capture a simplified model of a triple helix structure, then develop an algorithm of O(mn(3)) time to align a query sequence (of length m) with known triple helix structure with a target sequence (of length n) with an unknown structure. The resulting algorithm is shown to be useful in identifying ncRNA members in a simulated genome.

  14. A two-stage approach to automatic face alignment

    NASA Astrophysics Data System (ADS)

    Wang, Tong; Ai, Haizhou; Huang, Gaofeng

    2003-09-01

    Face alignment is very important in face recognition, modeling and synthesis. Many approaches have been developed for this purpose, such as ASM, AAM, DAM and TC-ASM. After a brief review of all those methods, it is pointed out that these approaches all require a manual initialization to the positions of the landmarks and are very sensitive to it, and despite of all those devoted works the outline of a human face remains a difficult task to be localized precisely. In this paper, a two-stage method to achieve frontal face alignment fully automatically is introduced. The first stage is landmarks' initialization called coarse face alignment. In this stage, after a face is detected by an Adaboost cascade face detector, we use Simple Direct Appearance Model (SDAM) to locate a few key points of human face from the texture according which all the initial landmarks are setup as the coarse alignment. The second stage is fine face alignment that uses a variant of AAM method in which shape variation is predicted from texture reconstruction error together with an embedded ASM refinement for the outline landmarks of the face to achieve the fine alignment. Experiments on a face database of 500 people show that this method is very effective for practical applications.

  15. Attitude sensor alignment calibration for the solar maximum mission

    NASA Technical Reports Server (NTRS)

    Pitone, Daniel S.; Shuster, Malcolm D.

    1990-01-01

    An earlier heuristic study of the fine attitude sensors for the Solar Maximum Mission (SMM) revealed a temperature dependence of the alignment about the yaw axis of the pair of fixed-head star trackers relative to the fine pointing Sun sensor. Here, new sensor alignment algorithms which better quantify the dependence of the alignments on the temperature are developed and applied to the SMM data. Comparison with the results from the previous study reveals the limitations of the heuristic approach. In addition, some of the basic assumptions made in the prelaunch analysis of the alignments of the SMM are examined. The results of this work have important consequences for future missions with stringent attitude requirements and where misalignment variations due to variations in the temperature will be significant.

  16. Attitude sensor alignment calibration for the solar maximum mission

    NASA Astrophysics Data System (ADS)

    Pitone, Daniel S.; Shuster, Malcolm D.

    1990-12-01

    An earlier heuristic study of the fine attitude sensors for the Solar Maximum Mission (SMM) revealed a temperature dependence of the alignment about the yaw axis of the pair of fixed-head star trackers relative to the fine pointing Sun sensor. Here, new sensor alignment algorithms which better quantify the dependence of the alignments on the temperature are developed and applied to the SMM data. Comparison with the results from the previous study reveals the limitations of the heuristic approach. In addition, some of the basic assumptions made in the prelaunch analysis of the alignments of the SMM are examined. The results of this work have important consequences for future missions with stringent attitude requirements and where misalignment variations due to variations in the temperature will be significant.

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

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

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

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

  1. Aligned Defrosting Dunes

    NASA Technical Reports Server (NTRS)

    2004-01-01

    17 August 2004 This July 2004 Mars Global Surveyor (MGS) Mars Orbiter Camera (MOC) image shows a group of aligned barchan sand dunes in the martian north polar region. At the time, the dunes were covered with seasonal frost, but the frost had begun to sublime away, leaving dark spots and dark outlines around the dunes. The surrounding plains exhibit small, diffuse spots that are also the result of subliming seasonal frost. This northern spring image, acquired on a descending ground track (as MGS was moving north to south on the 'night' side of Mars) is located near 78.8oN, 34.8oW. The image covers an area about 3 km (1.9 mi) across and sunlight illuminates the scene from the upper left.

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

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

  4. The alignment strategy of HADES

    NASA Astrophysics Data System (ADS)

    Pechenova, O.; Pechenov, V.; Galatyuk, T.; Hennino, T.; Holzmann, R.; Kornakov, G.; Markert, J.; Müntz, C.; Salabura, P.; Schmah, A.; Schwab, E.; Stroth, J.

    2015-06-01

    The global as well as intrinsic alignment of any spectrometer impacts directly on its performance and the quality of the achievable physics results. An overview of the current alignment procedure of the DiElectron Spectrometer HADES is presented with an emphasis on its main features and its accuracy. The sequence of all steps and procedures is given, including details on photogrammetric and track-based alignment.

  5. Positioning, alignment and absolute pointing of the ANTARES neutrino telescope

    NASA Astrophysics Data System (ADS)

    Fehr, F.; Distefano, C.; Antares Collaboration

    2010-01-01

    A precise detector alignment and absolute pointing is crucial for point-source searches. The ANTARES neutrino telescope utilises an array of hydrophones, tiltmeters and compasses for the relative positioning of the optical sensors. The absolute calibration is accomplished by long-baseline low-frequency triangulation of the acoustic reference devices in the deep-sea with a differential GPS system at the sea surface. The absolute pointing can be independently verified by detecting the shadow of the Moon in cosmic rays.

  6. BARCHAN: Blob Alignment for Robust CHromatographic ANalysis.

    PubMed

    Couprie, Camille; Duval, Laurent; Moreaud, Maxime; Hénon, Sophie; Tebib, Mélinda; Souchon, Vincent

    2017-02-10

    Two-dimensional gas chromatography (GC×GC) plays a central role into the elucidation of complex samples. The automation of the identification of peak areas is of prime interest to obtain a fast and repeatable analysis of chromatograms. To determine the concentration of compounds or pseudo-compounds, templates of blobs are defined and superimposed on a reference chromatogram. The templates then need to be modified when different chromatograms are recorded. In this study, we present a chromatogram and template alignment method based on peak registration called BARCHAN. Peaks are identified using a robust mathematical morphology tool. The alignment is performed by a probabilistic estimation of a rigid transformation along the first dimension, and a non-rigid transformation in the second dimension, taking into account noise, outliers and missing peaks in a fully automated way. Resulting aligned chromatograms and masks are presented on two datasets. The proposed algorithm proves to be fast and reliable. It significantly reduces the time to results for GC×GC analysis.

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

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

  9. GS-align for glycan structure alignment and similarity measurement

    PubMed Central

    Lee, Hui Sun; Jo, Sunhwan; Mukherjee, Srayanta; Park, Sang-Jun; Skolnick, Jeffrey; Lee, Jooyoung; Im, Wonpil

    2015-01-01

    Motivation: Glycans play critical roles in many biological processes, and their structural diversity is key for specific protein-glycan recognition. Comparative structural studies of biological molecules provide useful insight into their biological relationships. However, most computational tools are designed for protein structure, and despite their importance, there is no currently available tool for comparing glycan structures in a sequence order- and size-independent manner. Results: A novel method, GS-align, is developed for glycan structure alignment and similarity measurement. GS-align generates possible alignments between two glycan structures through iterative maximum clique search and fragment superposition. The optimal alignment is then determined by the maximum structural similarity score, GS-score, which is size-independent. Benchmark tests against the Protein Data Bank (PDB) N-linked glycan library and PDB homologous/non-homologous N-glycoprotein sets indicate that GS-align is a robust computational tool to align glycan structures and quantify their structural similarity. GS-align is also applied to template-based glycan structure prediction and monosaccharide substitution matrix generation to illustrate its utility. Availability and implementation: http://www.glycanstructure.org/gsalign. Contact: wonpil@ku.edu Supplementary information: Supplementary data are available at Bioinformatics online. PMID:25857669

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

  11. 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/.

  12. Improving the Robustness of Local Network Alignment: Design and Extensive Assessment of a Markov Clustering-Based Approach.

    PubMed

    Mina, Marco; Guzzi, Pietro Hiram

    2014-01-01

    The analysis of protein behavior at the network level had been applied to elucidate the mechanisms of protein interaction that are similar in different species. Published network alignment algorithms proved to be able to recapitulate known conserved modules and protein complexes, and infer new conserved interactions confirmed by wet lab experiments. In the meantime, however, a plethora of continuously evolving protein-protein interaction (PPI) data sets have been developed, each featuring different levels of completeness and reliability. For instance, algorithms performance may vary significantly when changing the data set used in their assessment. Moreover, existing papers did not deeply investigate the robustness of alignment algorithms. For instance, some algorithms performances vary significantly when changing the data set used in their assessment. In this work, we design an extensive assessment of current algorithms discussing the robustness of the results on the basis of input networks. We also present AlignMCL, a local network alignment algorithm based on an improved model of alignment graph and Markov Clustering. AlignMCL performs better than other state-of-the-art local alignment algorithms over different updated data sets. In addition, AlignMCL features high levels of robustness, producing similar results regardless the selected data set.

  13. Constructing sequence alignments from a Markov decision model with estimated parameter values.

    PubMed

    Hunt, Fern Y; Kearsley, Anthony J; O'Gallagher, Agnes

    2004-01-01

    Current methods for aligning biological sequences are based on dynamic programming algorithms. If large numbers of sequences or a number of long sequences are to be aligned, the required computations are expensive in memory and central processing unit (CPU) time. In an attempt to bring the tools of large-scale linear programming (LP) methods to bear on this problem, we formulate the alignment process as a controlled Markov chain and construct a suggested alignment based on policies that minimise the expected total cost of the alignment. We discuss the LP associated with the total expected discounted cost and show the results of a solution of the problem based on a primal-dual interior point method. Model parameters, estimated from aligned sequences, along with cost function parameters are used to construct the objective and constraint conditions of the LP problem. This article concludes with a discussion of some alignments obtained from the LP solutions of problems with various cost function parameter values.

  14. Characteristics of stereo images from detectors in focal plane array.

    PubMed

    Son, Jung-Young; Yeom, Seokwon; Chun, Joo-Hwan; Guschin, Vladmir P; Lee, Dong-Su

    2011-07-01

    The equivalent ray geometry of two horizontally aligned detectors at the focal plane of the main antenna in a millimeter wave imaging system is analyzed to reveal the reason why the images from the detectors are fused as an image with a depth sense. Scanning the main antenna in both horizontal and vertical directions makes each detector perform as a camera, and the two detectors can work like a stereo camera in the millimeter wave range. However, the stereo camera geometry is different from that of the stereo camera used in the visual spectral range because the detectors' viewing directions are diverging to each other and they are a certain distance apart. The depth sense is mainly induced by the distance between detectors. The images obtained from the detectors in the millimeter imaging system are perceived with a good depth sense. The disparities responsible for the depth sense are identified in the images.

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

  16. Mask alignment system for semiconductor processing

    DOEpatents

    Webb, Aaron P.; Carlson, Charles T.; Weaver, William T.; Grant, Christopher N.

    2017-02-14

    A mask alignment system for providing precise and repeatable alignment between ion implantation masks and workpieces. The system includes a mask frame having a plurality of ion implantation masks loosely connected thereto. The mask frame is provided with a plurality of frame alignment cavities, and each mask is provided with a plurality of mask alignment cavities. The system further includes a platen for holding workpieces. The platen may be provided with a plurality of mask alignment pins and frame alignment pins configured to engage the mask alignment cavities and frame alignment cavities, respectively. The mask frame can be lowered onto the platen, with the frame alignment cavities moving into registration with the frame alignment pins to provide rough alignment between the masks and workpieces. The mask alignment cavities are then moved into registration with the mask alignment pins, thereby shifting each individual mask into precise alignment with a respective workpiece.

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

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

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

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

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

  2. Pairagon: a highly accurate, HMM-based cDNA-to-genome aligner

    PubMed Central

    Lu, David V.; Brown, Randall H.; Arumugam, Manimozhiyan; Brent, Michael R.

    2009-01-01

    Motivation: The most accurate way to determine the intron–exon structures in a genome is to align spliced cDNA sequences to the genome. Thus, cDNA-to-genome alignment programs are a key component of most annotation pipelines. The scoring system used to choose the best alignment is a primary determinant of alignment accuracy, while heuristics that prevent consideration of certain alignments are a primary determinant of runtime and memory usage. Both accuracy and speed are important considerations in choosing an alignment algorithm, but scoring systems have received much less attention than heuristics. Results: We present Pairagon, a pair hidden Markov model based cDNA-to-genome alignment program, as the most accurate aligner for sequences with high- and low-identity levels. We conducted a series of experiments testing alignment accuracy with varying sequence identity. We first created ‘perfect’ simulated cDNA sequences by splicing the sequences of exons in the reference genome sequences of fly and human. The complete reference genome sequences were then mutated to various degrees using a realistic mutation simulator and the perfect cDNAs were aligned to them using Pairagon and 12 other aligners. To validate these results with natural sequences, we performed cross-species alignment using orthologous transcripts from human, mouse and rat. We found that aligner accuracy is heavily dependent on sequence identity. For sequences with 100% identity, Pairagon achieved accuracy levels of >99.6%, with one quarter of the errors of any other aligner. Furthermore, for human/mouse alignments, which are only 85% identical, Pairagon achieved 87% accuracy, higher than any other aligner. Availability: Pairagon source and executables are freely available at http://mblab.wustl.edu/software/pairagon/ Contact: davidlu@wustl.edu; brent@cse.wustl.edu Supplementary information: Supplementary data are available at Bioinformatics online. PMID:19414532

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

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

  6. The Cartan algorithm in five dimensions

    NASA Astrophysics Data System (ADS)

    McNutt, D. D.; Coley, A. A.; Forget, A.

    2017-03-01

    In this paper, we introduce an algorithm to determine the equivalence of five dimensional spacetimes, which generalizes the Karlhede algorithm for four dimensional general relativity. As an alternative to the Petrov type classification, we employ the alignment classification to algebraically classify the Weyl tensor. To illustrate the algorithm, we discuss three examples: the singly rotating Myers-Perry solution, the Kerr (Anti-) de Sitter solution, and the rotating black ring solution. We briefly discuss some applications of the Cartan algorithm in five dimensions.

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

  8. Chemical aerosol Raman detector

    NASA Astrophysics Data System (ADS)

    Aggarwal, R. L.; Farrar, L. W.; Di Cecca, S.; Amin, M.; Perkins, B. G.; Clark, M. L.; Jeys, T. H.; Sickenberger, D. W.; D'Amico, F. M.; Emmons, E. D.; Christesen, S. D.; Kreis, R. J.; Kilper, G. K.

    2017-03-01

    A sensitive chemical aerosol Raman detector (CARD) has been developed for the trace detection and identification of chemical particles in the ambient atmosphere. CARD includes an improved aerosol concentrator with a concentration factor of about 40 and a CCD camera for improved detection sensitivity. Aerosolized isovanillin, which is relatively safe, has been used to characterize the performance of the CARD. The limit of detection (SNR = 10) for isovanillin in 15 s has been determined to be 1.6 pg/cm3, which corresponds to 6.3 × 109 molecules/cm3 or 0.26 ppb. While less sensitive, CARD can also detect gases. This paper provides a more detailed description of the CARD hardware and detection algorithm than has previously been published.

  9. Open3DALIGN: an open-source software aimed at unsupervised ligand alignment.

    PubMed

    Tosco, Paolo; Balle, Thomas; Shiri, Fereshteh

    2011-08-01

    An open-source, cross-platform software aimed at conformer generation and unsupervised rigid-body molecular alignment is presented. Different algorithms have been implemented to perform single and multi-conformation superimpositions on one or more templates. Alignments can be accomplished by matching pharmacophores, heavy atoms or a combination of the two. All methods have been successfully validated on eight comprehensive datasets previously gathered by Sutherland and co-workers. High computational performance has been attained through efficient parallelization of the code. The unsupervised nature of the alignment algorithms, together with its scriptable interface, make Open3DALIGN an ideal component of high-throughput, automated cheminformatics workflows.

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

  12. First experience and results from the HERA-/B vertex detector system

    NASA Astrophysics Data System (ADS)

    Bauer, C.; Baumann, I.; Bräuer, M.; Eberle, M.; Fallot-Burghardt, W.; Grigoriev, E.; Hofmann, W.; Hüpper, A.; Klefenz, F.; Knöpfle, K. T.; Leffers, G.; Perschke, T.; Rieling, J.; Schmelling, M.; Schwingenheuer, B.; Sexauer, E.; Seybold, L.; Spengler, J.; StDenis, R.; Trunk, U.; Wanke, R.; Abt, I.; Fox, H.; Moshous, B.; Riechmann, K.; Rietz, M.; Ruebsam, R.; Wagner, W.

    1998-11-01

    The HERA- B collaboration is building a detector to realize the ambitious goal of observing CP violation in decays of neutral B-mesons. A central element of the apparatus is the silicon vertex detector used to selectively trigger on these decays in a high charged particle multiplicity background environment and to reconstruct secondary vertices from such decays with high precision. The vertex detector, the supporting infrastructure and first results using prototype detectors are described. Results include imaging of the proton interaction region on the HERA- B target, hit distributions in the detector planes, and alignment of the detectors with each other and the target.

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

  14. Unrooted unordered homeomorphic subtree alignment of RNA trees

    PubMed Central

    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

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

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

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

  18. On the Impact of Widening Vector Registers on Sequence Alignment

    SciTech Connect

    Daily, Jeffrey A.; Kalyanaraman, Anantharaman; Krishnamoorthy, Sriram; Ren, Bin

    2016-09-22

    Vector extensions, such as SSE, have been part of the x86 since the 1990s, with applications in graphics, signal processing, and scientific applications. Although many algorithms and applications can naturally benefit from automatic vectorization techniques, there are still many that are difficult to vectorize due to their dependence on irregular data structures, dense branch operations, or data dependencies. Sequence alignment, one of the most widely used operations in bioinformatics workflows, has a computational footprint that features complex data dependencies. In this paper, we demonstrate that the trend of widening vector registers adversely affects the state-of-the-art sequence alignment algorithm based on striped data layouts. We present a practically efficient SIMD implementation of a parallel scan based sequence alignment algorithm that can better exploit wider SIMD units. We conduct comprehensive workload and use case analyses to characterize the relative behavior of the striped and scan approaches and identify the best choice of algorithm based on input length and SIMD width.

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

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

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

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

  3. Finding Optimal Alignment and Consensus of Circular Strings

    NASA Astrophysics Data System (ADS)

    Lee, Taehyung; Na, Joong Chae; Park, Heejin; Park, Kunsoo; Sim, Jeong Seop

    We consider the problem of finding the optimal alignment and consensus (string) of circular strings. Circular strings are different from linear strings in that the first (leftmost) symbol of a circular string is wrapped around next to the last (rightmost) symbol. In nature, for example, bacterial and mitochondrial DNAs typically form circular strings. The consensus string problem is finding a representative string (consensus) of a given set of strings, and it has been studied on linear strings extensively. However, only a few efforts have been made for the consensus problem for circular strings, even though circular strings are biologically important. In this paper, we introduce the consensus problem for circular strings and present novel algorithms to find the optimal alignment and consensus of circular strings under the Hamming distance metric. They are O(n 2logn)-time algorithms for three circular strings and an O(n 3logn)-time algorithm for four circular strings. Our algorithms are O(n/ logn) times faster than the naïve algorithm directly using the solutions for the linear consensus problems, which takes O(n 3) time for three circular strings and O(n 4) time for four circular strings. We achieved this speedup by adopting a convolution and a system of linear equations into our algorithms to reflect the characteristics of circular strings that we found.

  4. Fixture for aligning motor assembly

    SciTech Connect

    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.

  5. Stellar Alignments - Identification and Analysis

    NASA Astrophysics Data System (ADS)

    Ruggles, Clive L. N.

    Fortuitous stellar alignments can be fitted to structural orientations with relative ease by the unwary. Nonetheless, cautious approaches taking into account a broader range of cultural evidence, as well as paying due attention to potential methodological pitfalls, have been successful in identifying credible stellar alignments—and constructing plausible assessments of their cultural significance—in a variety of circumstances. These range from single instances of alignments upon particular asterisms where the corroborating historical or ethnographic evidence is strong to repeated instances of oriented structures with only limited independent cultural information but where systematic, data-driven approaches can be productive. In the majority of cases, the identification and interpretation of putative stellar alignments relates to groups of similar monuments or complex single sites and involves a balance between systematic studies of the alignments themselves, backed up by statistical analysis where appropriate, and the consideration of a range of contextual evidence, either derived from the archaeological record alone or from other relevant sources.

  6. RF Jitter Modulation Alignment Sensing

    NASA Astrophysics Data System (ADS)

    Ortega, L. F.; Fulda, P.; Diaz-Ortiz, M.; Perez Sanchez, G.; Ciani, G.; Voss, D.; Mueller, G.; Tanner, D. B.

    2017-01-01

    We will present the numerical and experimental results of a new alignment sensing scheme which can reduce the complexity of alignment sensing systems currently used, while maintaining the same shot noise limited sensitivity. This scheme relies on the ability of electro-optic beam deflectors to create angular modulation sidebands in radio frequency, and needs only a single-element photodiode and IQ demodulation to generate error signals for tilt and translation degrees of freedom in one dimension. It distances itself from current techniques by eliminating the need for beam centering servo systems, quadrant photodetectors and Gouy phase telescopes. RF Jitter alignment sensing can be used to reduce the complexity in the alignment systems of many laser optical experiments, including LIGO and the ALPS experiment.

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

  8. The Rigors of Aligning Performance

    DTIC Science & Technology

    2015-06-01

    bearing in mind customer perceptions. Recommendations include employee training centered on goal alignment, which is vital to highlight the...appeared to be lacking in some areas when bearing in mind customer perceptions. Recommendations include employee training centered on goal alignment...through the strategic plan and CONOPS. However, the extent of goal accomplishment appears to be lacking in some areas when bearing in mind the

  9. National Ignition Facility system alignment.

    PubMed

    Burkhart, S C; Bliss, E; Di Nicola, P; Kalantar, D; Lowe-Webb, R; McCarville, T; Nelson, D; Salmon, T; Schindler, T; Villanueva, J; Wilhelmsen, K

    2011-03-10

    The National Ignition Facility (NIF) is the world's largest optical instrument, comprising 192 37 cm square beams, each generating up to 9.6 kJ of 351 nm laser light in a 20 ns beam precisely tailored in time and spectrum. The Facility houses a massive (10 m diameter) target chamber within which the beams converge onto an ∼1 cm size target for the purpose of creating the conditions needed for deuterium/tritium nuclear fusion in a laboratory setting. A formidable challenge was building NIF to the precise requirements for beam propagation, commissioning the beam lines, and engineering systems to reliably and safely align 192 beams within the confines of a multihour shot cycle. Designing the facility to minimize drift and vibration, placing the optical components in their design locations, commissioning beam alignment, and performing precise system alignment are the key alignment accomplishments over the decade of work described herein. The design and positioning phases placed more than 3000 large (2.5 m×2 m×1 m) line-replaceable optics assemblies to within ±1 mm of design requirement. The commissioning and alignment phases validated clear apertures (no clipping) for all beam lines, and demonstrated automated laser alignment within 10 min and alignment to target chamber center within 44 min. Pointing validation system shots to flat gold-plated x-ray emitting targets showed NIF met its design requirement of ±50 μm rms beam pointing to target chamber. Finally, this paper describes the major alignment challenges faced by the NIF Project from inception to present, and how these challenges were met and solved by the NIF design and commissioning teams.

  10. Binocular collimation vs conditional alignment

    NASA Astrophysics Data System (ADS)

    Cook, William J.

    2012-10-01

    As binocular enthusiasts share their passion, topics related to collimation abound. Typically, we find how observers, armed only with a jeweler's screwdriver, can "perfectly collimate" his or her binocular, make it "spot on," or other verbiage of similar connotation. Unfortunately, what most are addressing is a form of pseudo-collimation I have referred to since the mid-1970s as "Conditional Alignment." Ignoring the importance of the mechanical axis (hinge) in the alignment process, this "condition," while having the potential to make alignment serviceable, or even outstanding—within a small range of IPD (Interpupillary Distance) settings relative to the user's spatial accommodation (the ability to accept small errors in parallelism of the optical axes)—may take the instrument farther from the 3-axis collimation conscientious manufacturers seek to implement. Becoming more optically savvy—and especially with so many mechanically inferior binoculars entering the marketplace— the consumer contemplating self-repair and alignment has a need to understand the difference between clinical, 3-axis "collimation" (meaning both optical axes are parallel with the axis of the hinge) and "conditional alignment," as differentiated in this paper. Furthermore, I believe there has been a long-standing need for the term "Conditional Alignment," or some equivalent, to be accepted as part of the vernacular of those who use binoculars extensively, whether for professional or recreational activities. Achieving that acceptance is the aim of this paper.

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

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

  14. Getting Your Peaks in Line: A Review of Alignment Methods for NMR Spectral Data

    PubMed Central

    Vu, Trung Nghia; Laukens, Kris

    2013-01-01

    One of the most significant challenges in the comparative analysis of Nuclear Magnetic Resonance (NMR) metabolome profiles is the occurrence of shifts between peaks across different spectra, for example caused by fluctuations in pH, temperature, instrument factors and ion content. Proper alignment of spectral peaks is therefore often a crucial preprocessing step prior to downstream quantitative analysis. Various alignment methods have been developed specifically for this purpose. Other methods were originally developed to align other data types (GC, LC, SELDI-MS, etc.), but can also be applied to NMR data. This review discusses the available methods, as well as related problems such as reference determination or the evaluation of alignment quality. We present a generic alignment framework that allows for comparison and classification of different alignment approaches according to their algorithmic principles, and we discuss their performance. PMID:24957991

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

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

  17. Robustly Aligning a Shape Model and Its Application to Car Alignment of Unknown Pose.

    PubMed

    Li, Yan; Gu, Leon; Kanade, Takeo

    2011-09-01

    Precisely localizing in an image a set of feature points that form a shape of an object, such as car or face, is called alignment. Previous shape alignment methods attempted to fit a whole shape model to the observed data, based on the assumption of Gaussian observation noise and the associated regularization process. However, such an approach, though able to deal with Gaussian noise in feature detection, turns out not to be robust or precise because it is vulnerable to gross feature detection errors or outliers resulting from partial occlusions or spurious features from the background or neighboring objects. We address this problem by adopting a randomized hypothesis-and-test approach. First, a Bayesian inference algorithm is developed to generate a shape-and-pose hypothesis of the object from a partial shape or a subset of feature points. For alignment, a large number of hypotheses are generated by randomly sampling subsets of feature points, and then evaluated to find the one that minimizes the shape prediction error. This method of randomized subset-based matching can effectively handle outliers and recover the correct object shape. We apply this approach on a challenging data set of over 5,000 different-posed car images, spanning a wide variety of car types, lighting, background scenes, and partial occlusions. Experimental results demonstrate favorable improvements over previous methods on both accuracy and robustness.

  18. Alignment of Tractograms As Graph Matching.

    PubMed

    Olivetti, Emanuele; Sharmin, Nusrat; Avesani, Paolo

    2016-01-01

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

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

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

  1. Fitting alignment tensor components to experimental RDCs, CSAs and RQCs.

    PubMed

    Wirz, Lukas N; Allison, Jane R

    2015-05-01

    Residual dipolar couplings, chemical shift anisotropies and quadrupolar couplings provide information about the orientation of inter-spin vectors and the anisotropic contribution of the local environment to the chemical shifts of nuclei, respectively. Structural interpretation of these observables requires parameterization of their angular dependence in terms of an alignment tensor. We compare and evaluate two algorithms for generating the optimal alignment tensor for a given molecular structure and set of experimental data, namely SVD (Losonczi et al. in J Magn Reson 138(2):334-342, 1999), which scales as [Formula: see text], and the linear least squares algorithm (Press et al. in Numerical recipes in C. The art of scientific computing, 2nd edn. Cambridge University Press, Cambridge, 1997), which scales as [Formula: see text].

  2. Rapid Transfer Alignment of MEMS SINS Based on Adaptive Incremental Kalman Filter

    PubMed Central

    Chu, Hairong; Sun, Tingting; Zhang, Baiqiang; Zhang, Hongwei; Chen, Yang

    2017-01-01

    In airborne MEMS SINS transfer alignment, the error of MEMS IMU is highly environment-dependent and the parameters of the system model are also uncertain, which may lead to large error and bad convergence of the Kalman filter. In order to solve this problem, an improved adaptive incremental Kalman filter (AIKF) algorithm is proposed. First, the model of SINS transfer alignment is defined based on the “Velocity and Attitude” matching method. Then the detailed algorithm progress of AIKF and its recurrence formulas are presented. The performance and calculation amount of AKF and AIKF are also compared. Finally, a simulation test is designed to verify the accuracy and the rapidity of the AIKF algorithm by comparing it with KF and AKF. The results show that the AIKF algorithm has better estimation accuracy and shorter convergence time, especially for the bias of the gyroscope and the accelerometer, which can meet the accuracy and rapidity requirement of transfer alignment. PMID:28098829

  3. Rapid Transfer Alignment of MEMS SINS Based on Adaptive Incremental Kalman Filter.

    PubMed

    Chu, Hairong; Sun, Tingting; Zhang, Baiqiang; Zhang, Hongwei; Chen, Yang

    2017-01-14

    In airborne MEMS SINS transfer alignment, the error of MEMS IMU is highly environment-dependent and the parameters of the system model are also uncertain, which may lead to large error and bad convergence of the Kalman filter. In order to solve this problem, an improved adaptive incremental Kalman filter (AIKF) algorithm is proposed. First, the model of SINS transfer alignment is defined based on the "Velocity and Attitude" matching method. Then the detailed algorithm progress of AIKF and its recurrence formulas are presented. The performance and calculation amount of AKF and AIKF are also compared. Finally, a simulation test is designed to verify the accuracy and the rapidity of the AIKF algorithm by comparing it with KF and AKF. The results show that the AIKF algorithm has better estimation accuracy and shorter convergence time, especially for the bias of the gyroscope and the accelerometer, which can meet the accuracy and rapidity requirement of transfer alignment.

  4. AlexSys: a knowledge-based expert system for multiple sequence alignment construction and analysis.

    PubMed

    Aniba, Mohamed Radhouene; Poch, Olivier; Marchler-Bauer, Aron; Thompson, Julie Dawn

    2010-10-01

    Multiple sequence alignment (MSA) is a cornerstone of modern molecular biology and represents a unique means of investigating the patterns of conservation and diversity in complex biological systems. Many different algorithms have been developed to construct MSAs, but previous studies have shown that no single aligner consistently outperforms the rest. This has led to the development of a number of 'meta-methods' that systematically run several aligners and merge the output into one single solution. Although these methods generally produce more accurate alignments, they are inefficient because all the aligners need to be run first and the choice of the best solution is made a posteriori. Here, we describe the development of a new expert system, AlexSys, for the multiple alignment of protein sequences. AlexSys incorporates an intelligent inference engine to automatically select an appropriate aligner a priori, depending only on the nature of the input sequences. The inference engine was trained on a large set of reference multiple alignments, using a novel machine learning approach. Applying AlexSys to a test set of 178 alignments, we show that the expert system represents a good compromise between alignment quality and running time, making it suitable for high throughput projects. AlexSys is freely available from http://alnitak.u-strasbg.fr/∼aniba/alexsys.

  5. Aligning Arrays of Lenses and Single-Mode Optical Fibers

    NASA Technical Reports Server (NTRS)

    Liu, Duncan

    2004-01-01

    through the relay lenses and the beam compressor/expander, then split so that half goes to a detector and half to the interferometer. The output of the detector is used as a feedback control signal for the six-axis stage to effect alignment.

  6. Two-dimensional semi-parametric alignment of chromatograms.

    PubMed

    de Boer, Wim P H; Lankelma, Jan

    2014-06-06

    We present a comprehensive alignment algorithm that extends the semi-parametric approach to two dimensions. The algorithm is based on modeling shifts with a two-dimensional "warp function" such that the sample chromatogram - its shifts corrected with the warp function - is adjusted to the reference chromatogram by minimizing the squared intensity difference. A warp function approach has the advantage that overlapping peaks are easily dealt with compared to other proposed two-dimensional algorithms. Another advantage is that missing peaks are allowed if the absence of these peaks has little numerical effect on the warp function computation and if these peaks occur between existing peaks. Performance of the algorithm is demonstrated using GC×GC data from three batches of three diesel oil samples and LC-MS data from a mouse breast cancer data set.

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

  8. nDSE-based overlay alignment: enabling technology for nano metrology and fabrication

    NASA Astrophysics Data System (ADS)

    Gao, Jun; Picciotto, Carl; Wu, Wei; Park, Inkyu; Tong, William M.

    2006-03-01

    Displacement sensing and estimation (DSE) is important preprocessing task for many image-based processing systems that extract information from multiple images. In last two years, we gained significant insight of the nature of DSE and developed theory and algorithm framework named nanoscale displacement sensing and estimation (nDSE). We also build procedures to apply nDSE to overlay alignment down to the nanoscale. We will introduce two basic theories: Phase Delay Detection (PDD) and Derivatives-based Maximum Likelihood Estimation (DML) and associated DSE algorithms, noticeably Near-Neighbor-Navigation (N-Cubed) algorithm. We presented our best nDSE experimental result of 1 nm (1σ) while tracking 5 nm stepping. To develop nDSE-based nanoscale alignment, we introduced our definition of displacement, alignment and pseudo-displacement. We presented both theoretical and practical procedures to use nDSE to achieve nano-alignment down to the 10s of nano-meters and beyond. Then we compared nDSE-based nano-alignment to other industry standard alignment method and attempt to show the substantial advantages of nDSE based alignment in terms of cost and simplicity of the system design.

  9. Graphics processing unit-based alignment of protein interaction networks.

    PubMed

    Xie, Jiang; Zhou, Zhonghua; Ma, Jin; Xiang, Chaojuan; Nie, Qing; Zhang, Wu

    2015-08-01

    Network alignment is an important bridge to understanding human protein-protein interactions (PPIs) and functions through model organisms. However, the underlying subgraph isomorphism problem complicates and increases the time required to align protein interaction networks (PINs). Parallel computing technology is an effective solution to the challenge of aligning large-scale networks via sequential computing. In this study, the typical Hungarian-Greedy Algorithm (HGA) is used as an example for PIN alignment. The authors propose a HGA with 2-nearest neighbours (HGA-2N) and implement its graphics processing unit (GPU) acceleration. Numerical experiments demonstrate that HGA-2N can find alignments that are close to those found by HGA while dramatically reducing computing time. The GPU implementation of HGA-2N optimises the parallel pattern, computing mode and storage mode and it improves the computing time ratio between the CPU and GPU compared with HGA when large-scale networks are considered. By using HGA-2N in GPUs, conserved PPIs can be observed, and potential PPIs can be predicted. Among the predictions based on 25 common Gene Ontology terms, 42.8% can be found in the Human Protein Reference Database. Furthermore, a new method of reconstructing phylogenetic trees is introduced, which shows the same relationships among five herpes viruses that are obtained using other methods.

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

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

  12. A Nonlinear Observer for Gyro Alignment Estimation

    NASA Technical Reports Server (NTRS)

    Thienel, J.; Sanner, R. M.

    2003-01-01

    A nonlinear observer for gyro alignment estimation is presented. The observer is composed of two error terms, an attitude error and an alignment error. The observer is globally stable with exponential convergence of the attitude errors. The gyro alignment estimate converges to the true alignment when the system is completely observable.

  13. Mu2e Transport Solenoid Cold-Mass Alignment Issues

    DOE PAGES

    Lopes, M.; Ambrosio, G.; Badgley, K.; ...

    2017-01-05

    The Muon-to-electron conversion experiment (Mu2e) at Fermilab is designed to explore charged lepton flavor violation. It is composed of three large superconducting solenoids: the Production Solenoid (PS), the Transport Solenoid (TS) and the Detector Solenoid (DS). The TS is formed by two magnets: TS upstream (TSu) and downstream (TSd). Each has its own cryostat and power supply. Tolerance sensitivity studies of the position and angular alignment of each coil in this magnet system were performed in the past with the objective to demonstrate that the magnet design meets all the field requirements. Furthermore, the alignment of the cold-masses is criticalmore » to maximize the transmission of muons and to avoid possible backgrounds that would reduce the sensitivity of the experiment. Each TS magnet cold-mass can be individually aligned. Here, we discuss implications of the alignment of the TS cold-masses in terms of the displacement of the magnetic center. Consideration of the practical mechanical limits are also presented.« less

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

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

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

  17. A Vondrak low pass filter for IMU sensor initial alignment on a disturbed base.

    PubMed

    Li, Zengke; Wang, Jian; Gao, Jingxiang; Li, Binghao; Zhou, Feng

    2014-12-10

    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.

  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.

  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. The orbital TUS detector simulation

    NASA Astrophysics Data System (ADS)

    Grinyuk, A.; Grebenyuk, V.; Khrenov, B.; Klimov, P.; Lavrova, M.; Panasyuk, M.; Sharakin, S.; Shirokov, A.; Tkachenko, A.; Tkachev, L.; Yashin, I.

    2017-04-01

    The TUS space experiment is aimed at studying energy and arrival distribution of UHECR at E > 7 × 1019 eV by using the data of EAS fluorescent radiation in atmosphere. The TUS mission was launched at the end of April 2016 on board the dedicated ;Lomonosov; satellite. The TUSSIM software package has been developed to simulate performance of the TUS detector for the Fresnel mirror optical parameters, the light concentrator of the photo detector, the front end and trigger electronics. Trigger efficiency crucially depends on the background level which varies in a wide range: from 0.2 × 106 to 15 × 106 ph/(m2 μ s sr) at moonless and full moon nights respectively. The TUSSIM algorithms are described and the expected TUS statistics is presented for 5 years of data collection from the 500 km solar-synchronized orbit with allowance for the variability of the background light intensity during the space flight.

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

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

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

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

  5. STRUCTFAST: protein sequence remote homology detection and alignment using novel dynamic programming and profile-profile scoring.

    PubMed

    Debe, Derek A; Danzer, Joseph F; Goddard, William A; Poleksic, Aleksandar

    2006-09-01

    STRUCTFAST is a novel profile-profile alignment algorithm capable of detecting weak similarities between protein sequences. The increased sensitivity and accuracy of the STRUCTFAST method are achieved through several unique features. First, the algorithm utilizes a novel dynamic programming engine capable of incorporating important information from a structural family directly into the alignment process. Second, the algorithm employs a rigorous analytical formula for profile-profile scoring to overcome the limitations of ad hoc scoring functions that require adjustable parameter training. Third, the algorithm employs Convergent Island Statistics (CIS) to compute the statistical significance of alignment scores independently for each pair of sequences. STRUCTFAST routinely produces alignments that meet or exceed the quality obtained by an expert human homology modeler, as evidenced by its performance in the latest CAFASP4 and CASP6 blind prediction benchmark experiments.

  6. ALIGN_MTX--an optimal pairwise textual sequence alignment program, adapted for using in sequence-structure alignment.

    PubMed

    Vishnepolsky, Boris; Pirtskhalava, Malak

    2009-06-01

    The presented program ALIGN_MTX makes alignment of two textual sequences with an opportunity to use any several characters for the designation of sequence elements and arbitrary user substitution matrices. It can be used not only for the alignment of amino acid and nucleotide sequences but also for sequence-structure alignment used in threading, amino acid sequence alignment, using preliminary known PSSM matrix, and in other cases when alignment of biological or non-biological textual sequences is required. This distinguishes it from the majority of similar alignment programs that make, as a rule, alignment only of amino acid or nucleotide sequences represented as a sequence of single alphabetic characters. ALIGN_MTX is presented as downloadable zip archive at http://www.imbbp.org/software/ALIGN_MTX/ and available for free use. As application of using the program, the results of comparison of different types of substitution matrix for alignment quality in distantly related protein pair sets were presented. Threading matrix SORDIS, based on side-chain orientation in relation to hydrophobic core centers with evolutionary change-based substitution matrix BLOSUM and using multiple sequence alignment information position-specific score matrices (PSSM) were taken for test alignment accuracy. The best performance shows PSSM matrix, but in the reduced set with lower sequence similarity threading matrix SORDIS shows the same performance and it was shown that combined potential with SORDIS and PSSM can improve alignment quality in evolutionary distantly related protein pairs.

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

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

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

  10. 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…

  11. Alignment in Second Language Dialogue

    ERIC Educational Resources Information Center

    Costa, Albert; Pickering, Martin; Sorace, Antonella

    2008-01-01

    This paper considers the nature of second language dialogues, involving at least one non-native (L2) speaker. We assume that dialogue is characterised by a process in which interlocutors develop similar mental states to each other (Pickering & Garrod, 2004). We first consider various means in which interlocutors align their mental states, and…

  12. 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…

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

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

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

  16. Heuristic reusable dynamic programming: efficient updates of local sequence alignment.

    PubMed

    Hong, Changjin; Tewfik, Ahmed H

    2009-01-01

    Recomputation of the previously evaluated similarity results between biological sequences becomes inevitable when researchers realize errors in their sequenced data or when the researchers have to compare nearly similar sequences, e.g., in a family of proteins. We present an efficient scheme for updating local sequence alignments with an affine gap model. In principle, using the previous matching result between two amino acid sequences, we perform a forward-backward alignment to generate heuristic searching bands which are bounded by a set of suboptimal paths. Given a correctly updated sequence, we initially predict a new score of the alignment path for each contour to select the best candidates among them. Then, we run the Smith-Waterman algorithm in this confined space. Furthermore, our heuristic alignment for an updated sequence shows that it can be further accelerated by using reusable dynamic programming (rDP), our prior work. In this study, we successfully validate "relative node tolerance bound" (RNTB) in the pruned searching space. Furthermore, we improve the computational performance by quantifying the successful RNTB tolerance probability and switch to rDP on perturbation-resilient columns only. In our searching space derived by a threshold value of 90 percent of the optimal alignment score, we find that 98.3 percent of contours contain correctly updated paths. We also find that our method consumes only 25.36 percent of the runtime cost of sparse dynamic programming (sDP) method, and to only 2.55 percent of that of a normal dynamic programming with the Smith-Waterman algorithm.

  17. Gamma Detector Response and Analysis Software - Light

    SciTech Connect

    Mitchell, Dean J.

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

  18. Laser-optic instruments improve machinery alignment

    SciTech Connect

    Bloch, H.P.

    1987-10-12

    Laser-optic alignment systems are fast becoming cost-effective devices that improve the accuracy and speed of machinery shaft alignment. Because of the difficulty, if not impossibility, of aligning operating machinery, cold alignment specifications must be determined to compensate for thermal growth so that the shaft alignment remains within tolerances when the machine reaches normal operating temperature. Some methods for accomplishing this are reviewed here. Three years' field experience with laser-optic alignment systems shows that many of these limitations can be eliminated, resulting in a more accurate alignment in less time. Some actual field alignments are given as examples of the improvement achieved by the use of laser equipment, and a procedure is given that shows how the laser-optic system may be used to determine running alignment changes caused by thermal growth.

  19. Tin Can Radiation Detector.

    ERIC Educational Resources Information Center

    Crull, John L.

    1986-01-01

    Provides instructions for making tin can radiation detectors from empty aluminum cans, aluminum foil, clear plastic, copper wire, silica gel, and fine, unwaxed dental floss put together with tape or glue. Also provides suggestions for activities using the detectors. (JN)

  20. Thermal kinetic inductance detector

    DOEpatents

    Cecil, Thomas; Gades, Lisa; Miceli, Antonio; Quaranta, Orlando

    2016-12-20

    A microcalorimeter for radiation detection that uses superconducting kinetic inductance resonators as the thermometers. The detector is frequency-multiplexed which enables detector systems with a large number of pixels.

  1. Learning object detectors from online image search

    NASA Astrophysics Data System (ADS)

    Tang, Feng; Tretter, Daniel R.

    2011-03-01

    Being able to detect distinguishable objects is a key component in many high level computer vision applications. Traditional methods for building such detectors require a large amount of carefully collected and cleaned data. For example to build a face detector, a large number of face images need to be collected and faces in each image need to be cropped and aligned as the data for training. This process is tedious and error-pruning. Recently more and more people are sharing their photos on the internet, if we could leverage these data for building a detector, it will save tremendous amount of effort in collecting training data. Popular internet search engines and community photo websites like Google image search, Picassa, Flickr make it possible to harvesting online images for image understanding tasks. In this paper, we develop a method leveraging images obtained from online image search to build an object detector. The proposed method can automatically identify the most distinguishable features across the downloaded images. Using these learned features, a detector can be built to detect the object in a new image. Experiments show promising results of our approach.

  2. Novel gaseous detectors for medical imaging

    NASA Astrophysics Data System (ADS)

    Danielsson, M.; Fonte, P.; Francke, T.; Iacobaeus, C.; Ostling, J.; Peskov, V.

    2004-02-01

    We have developed and successfully tested prototypes of two new types of gaseous detectors for medical imaging purposes. The first one is called the Electronic Portal Imaging Device (EPID). It is oriented on monitoring and the precise alignment of the therapeutic cancer treatment beam (pulsed gamma radiation) with respect to the patient's tumor position. The latest will be determined from an X-ray image of the patient obtained in the time intervals between the gamma pulses. The detector is based on a "sandwich" of hole-type gaseous detectors (GEM and glass microcapillary plates) with metallic gamma and X-ray converters coated with CsI layers. The second detector is an X-ray image scanner oriented on mammography and other radiographic applications. It is based on specially developed by us high rate RPCs that are able to operate at rates of 10 5 Hz/mm 2 with a position resolution better than 50 μm at 1 atm. The quality of the images obtained with the latest version of this device were in most cases more superior than those obtained from commercially available detectors.

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

  4. Integrated web service for improving alignment quality based on segments comparison

    PubMed Central

    Plewczynski, Dariusz; Rychlewski, Leszek; Ye, Yuzhen; Jaroszewski, Lukasz; Godzik, Adam

    2004-01-01

    Background Defining blocks forming the global protein structure on the basis of local structural regularity is a very fruitful idea, extensively used in description, and prediction of structure from only sequence information. Over many years the secondary structure elements were used as available building blocks with great success. Specially prepared sets of possible structural motifs can be used to describe similarity between very distant, non-homologous proteins. The reason for utilizing the structural information in the description of proteins is straightforward. Structural comparison is able to detect approximately twice as many distant relationships as sequence comparison at the same error rate. Results Here we provide a new fragment library for Local Structure Segment (LSS) prediction called FRAGlib which is integrated with a previously described segment alignment algorithm SEA. A joined FRAGlib/SEA server provides easy access to both algorithms, allowing a one stop alignment service using a novel approach to protein sequence alignment based on a network matching approach. The FRAGlib used as secondary structure prediction achieves only 73% accuracy in Q3 measure, but when combined with the SEA alignment, it achieves a significant improvement in pairwise sequence alignment quality, as compared to previous SEA implementation and other public alignment algorithms. The FRAGlib algorithm takes ~2 min. to search over FRAGlib database for a typical query protein with 500 residues. The SEA service align two typical proteins within circa ~5 min. All supplementary materials (detailed results of all the benchmarks, the list of test proteins and the whole fragments library) are available for download on-line at . Conclusions The joined FRAGlib/SEA server will be a valuable tool both for molecular biologists working on protein sequence analysis and for bioinformaticians developing computational methods of structure prediction and alignment of proteins. PMID:15271224

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

  6. An efficient method for multiple sequence alignment

    SciTech Connect

    Kim, J.; Pramanik, S.

    1994-12-31

    Multiple sequence alignment has been a useful method in the study of molecular evolution and sequence-structure relationships. This paper presents a new method for multiple sequence alignment based on simulated annealing technique. Dynamic programming has been widely used to find an optimal alignment. However, dynamic programming has several limitations to obtain optimal alignment. It requires long computation time and cannot apply certain types of cost functions. We describe detail mechanisms of simulated annealing for multiple sequence alignment problem. It is shown that simulated annealing can be an effective approach to overcome the limitations of dynamic programming in multiple sequence alignment problem.

  7. Bokeh mirror alignment for Cherenkov telescopes

    NASA Astrophysics Data System (ADS)

    Mueller, S. A.; Adam, J.; Ahnen, M. L.; Baack, D.; Balbo, M.; Bergmann, M.; Biland, A.; Blank, M.; Bretz, T.; Bruegge, K. A.; Buss, J.; Dmytriiev, A.; Dorner, D.; Einecke, S.; Hempfling, C.; Hildebrand, D.; Hughes, G.; Linhoff, L.; Mannheim, K.; Neise, D.; Neronov, A.; Noethe, M.; Paravac, A.; Pauss, F.; Rhode, W.; Shukla, A.; Temme, F.; Thaele, J.; Walter, R.

    2016-08-01

    Segmented imaging reflectors are a great choice for Imaging Atmospheric Cherenkov Telescopes (IACTs). However, the alignment of the individual mirror facets is challenging. We align a segmented reflector by observing and optimizing its Bokeh function. Bokeh alignment can already be done with very little resources and little preparation time. Further, Bokeh alignment can be done anytime, even during the day. We present a first usage of Bokeh alignment on FACT, a 4m IACT on Canary Island La Palma, Spain and further a first Bokeh alignment test on the CTA MST IACT prototype in Brelin Adlershof.

  8. Fabrication of Pop-up Detector Arrays on Si Wafers

    NASA Technical Reports Server (NTRS)

    Li, Mary J.; Allen, Christine A.; Gordon, Scott A.; Kuhn, Jonathan L.; Mott, David B.; Stahle, Caroline K.; Wang, Liqin L.

    1999-01-01

    High sensitivity is a basic requirement for a new generation of thermal detectors. To meet the requirement, close-packed, two-dimensional silicon detector arrays have been developed in NASA Goddard Space Flight Center. The goal of the task is to fabricate detector arrays configured with thermal detectors such as infrared bolometers and x-ray calorimeters to use in space fliGht missions. This paper focuses on the fabrication and the mechanical testing of detector arrays in a 0.2 mm pixel size, the smallest pop-up detectors being developed so far. These array structures, nicknamed "PUDS" for "Pop-Up Detectors", are fabricated on I pm thick, single-crystal, silicon membranes. Their designs have been refined so we can utilize the flexibility of thin silicon films by actually folding the silicon membranes to 90 degrees in order to obtain close-packed two-dimensional arrays. The PUD elements consist of a detector platform and two legs for mechanical support while also serving as electrical and thermal paths. Torsion bars and cantilevers connecting the detector platform to the legs provide additional flexures for strain relief. Using micro-electromechanical structure (MEMS) fabrication techniques, including photolithography, anisotropic chemical etching, reactive-ion etching, and laser dicing, we have fabricated PLTD detector arrays of fourteen designs with a variation of four parameters including cantilever length, torsion bar length and width, and leg length. Folding tests were conducted to test mechanical stress distribution for the array structures. We obtained folding yields and selected optimum design parameters to reach minimal stress levels. Computer simulation was also employed to verify mechanical behaviors of PUDs in the folding process. In addition, scanning electron microscopy was utilized to examine the flatness of detectors and the alignment of detector pixels in arrays. The fabrication of thermistors and heaters on the pop-up detectors is under way

  9. Alignment of Tractograms As Graph Matching

    PubMed Central

    Olivetti, Emanuele; Sharmin, Nusrat; Avesani, Paolo

    2016-01-01

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

  10. LGB neutron detector

    NASA Astrophysics Data System (ADS)

    Quist, Nicole

    2012-10-01

    The double pulse signature of the Gadolinium Lithium Borate Cerium doped plastic detector suggests its effectiveness for analyzing neutrons while providing gamma ray insensitivity. To better understand this detector, a californium gamma/neutron time of flight facility was constructed in our lab. Reported here are efforts to understand the properties and applications of the LGB detector with regards to neutron spectroscopy.

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

  12. AlignMiner: a Web-based tool for detection of divergent regions in multiple sequence alignments of conserved sequences

    PubMed Central

    2010-01-01

    Background Multiple sequence alignments are used to study gene or protein function, phylogenetic relations, genome evolution hypotheses and even gene polymorphisms. Virtually without exception, all available tools focus on conserved segments or residues. Small divergent regions, however, are biologically important for specific quantitative polymerase chain reaction, genotyping, molecular markers and preparation of specific antibodies, and yet have received little attention. As a consequence, they must be selected empirically by the researcher. AlignMiner has been developed to fill this gap in bioinformatic analyses. Results AlignMiner is a Web-based application for detection of conserved and divergent regions in alignments of conserved sequences, focusing particularly on divergence. It accepts alignments (protein or nucleic acid) obtained using any of a variety of algorithms, which does not appear to have a significant impact on the final results. AlignMiner uses different scoring methods for assessing conserved/divergent regions, Entropy being the method that provides the highest number of regions with the greatest length, and Weighted being the most restrictive. Conserved/divergent regions can be generated either with respect to the consensus sequence or to one master sequence. The resulting data are presented in a graphical interface developed in AJAX, which provides remarkable user interaction capabilities. Users do not need to wait until execution is complete and can.even inspect their results on a different computer. Data can be downloaded onto a user disk, in standard formats. In silico and experimental proof-of-concept cases have shown that AlignMiner can be successfully used to designing specific polymerase chain reaction primers as well as potential epitopes for antibodies. Primer design is assisted by a module that deploys several oligonucleotide parameters for designing primers "on the fly". Conclusions AlignMiner can be used to reliably detect

  13. Alignment of a 3-D Sensor and a 2-D Sensor Measuring Azimuth and Elevation

    DTIC Science & Technology

    1992-04-01

    alignment algorithm discussed in this report were developed by the Combat System Technologies Branch (N35) of the Engineering and Technology Division ( N30 ...removal of alignment errors in dissimilar sensors (e.g., active and passive sensors, 2-D and 3-D sensors, etc.). However, the alignment of dissimilar...G21 (CARSOLA) 1 G70 1 G71 1 G71 (BLAIR) 1 G71 (PALEN) 1 G71 (RICE) 10 G73 (FONTANA) 1 N 1 N05 (GASTON) 1 N24 (HENDERSON) 1 N30 1 N33 (ERVIN) 1 N33

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

  15. Structural alignment of RNA with complex pseudoknot structure.

    PubMed

    Wong, Thomas K F; Lam, T W; Sung, Wing-Kin; Cheung, Brenda W Y; Yiu, S M

    2011-01-01

    The secondary structure of an ncRNA molecule is known to play an important role in its biological functions. Aligning a known ncRNA to a target candidate to determine the sequence and structural similarity helps in identifying de novo ncRNA molecules that are in the same family of the known ncRNA. However, existing algorithms cannot handle complex pseudoknot structures which are found in nature. In this article, we propose algorithms to handle two types of complex pseudoknots: simple non-standard pseudoknots and recursive pseudoknots. Although our methods are not designed for general pseudoknots, it already covers all known ncRNAs in both Rfam and PseudoBase databases. An evaluation of our algorithms shows that it is useful to identify ncRNA molecules in other species which are in the same family of a known ncRNA.

  16. Alignment for imprint lithography using nDSE and shallow molds

    NASA Astrophysics Data System (ADS)

    Picciotto, Carl; Gao, Jun; Yu, Zhaoning; Wu, Wei

    2009-06-01

    We present a low-cost overlay alignment metrology solution for nanoimprint lithography that uses optical microscopy, displacement-sensing algorithms, and specially-designed imprint molds that include shallow alignment marks that are visible to the optical system but do not pattern the wafer. This innovation reduces measurement distances to near zero, the optimal distance for displacement-sensing algorithms, and allows for alignment marks to occupy the same piece of wafer real estate without interfering in any way, thus saving silicon area. Additionally, the method we present does not require the comparison of alignment marks between the wafer and the mold, thus removing process variations as a variable. We fabricate the shallow-mark molds, show that the shallow alignment marks indeed do not leave a mark on the wafer, and, implementing our nDSE (nanoscale displacement sensing and estimation) techniques, we demonstrate nanoscale alignment to a precision of 35 nm, 1-σ. Given sufficient engineering refinement, we would fully anticipate achieving alignment errors down to the 1 nm range using these methods.

  17. Angles-centroids fitting calibration and the centroid algorithm applied to reverse Hartmann test

    NASA Astrophysics Data System (ADS)

    Zhao, Zhu; Hui, Mei; Xia, Zhengzheng; Dong, Liquan; Liu, Ming; Liu, Xiaohua; Kong, Lingqin; Zhao, Yuejin

    2017-02-01

    In this paper, we develop an angles-centroids fitting (ACF) system and the centroid algorithm to calibrate the reverse Hartmann test (RHT) with sufficient precision. The essence of ACF calibration is to establish the relationship between ray angles and detector coordinates. Centroids computation is used to find correspondences between the rays of datum marks and detector pixels. Here, the point spread function of RHT is classified as circle of confusion (CoC), and the fitting of a CoC spot with 2D Gaussian profile to identify the centroid forms the basis of the centroid algorithm. Theoretical and experimental results of centroids computation demonstrate that the Gaussian fitting method has a less centroid shift or the shift grows at a slower pace when the quality of the image is reduced. In ACF tests, the optical instrumental alignments reach an overall accuracy of 0.1 pixel with the application of laser spot centroids tracking program. Locating the crystal at different positions, the feasibility and accuracy of ACF calibration are further validated to 10-6-10-4 rad root-mean-square error of the calibrations differences.

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

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

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

  1. Randomized SUSAN edge detector

    NASA Astrophysics Data System (ADS)

    Qu, Zhi-Guo; Wang, Ping; Gao, Ying-Hui; Wang, Peng

    2011-11-01

    A speed up technique for the SUSAN edge detector based on random sampling is proposed. Instead of sliding the mask pixel by pixel on an image as the SUSAN edge detector does, the proposed scheme places the mask randomly on pixels to find edges in the image; we hereby name it randomized SUSAN edge detector (R-SUSAN). Specifically, the R-SUSAN edge detector adopts three approaches in the framework of random sampling to accelerate a SUSAN edge detector: procedure integration of response computation and nonmaxima suppression, reduction of unnecessary processing for obvious nonedge pixels, and early termination. Experimental results demonstrate the effectiveness of the proposed method.

  2. Aligning incentives in supply chains.

    PubMed

    Narayanan, V G; Raman, Ananth

    2004-11-01

    Most companies don't worry about the behavior of their supply chain partners. Instead, they expect the supply chain to work efficiently without interference, as if guided by Adam Smith's famed invisible hand. In their study of more than 50 supply networks, V.G. Narayanan and Ananth Raman found that companies often looked out for their own interests and ignored those of their network partners. Consequently, supply chains performed poorly. Those results aren't shocking when you consider that supply chains extend across several functions and many companies, each with its own priorities and goals. Yet all those functions and firms must pull in the same direction for a chain to deliver goods and services to consumers quickly and cost-effectively. According to the authors, a supply chain works well only if the risks, costs, and rewards of doing business are distributed fairly across the network. In fact, misaligned incentives are often the cause of excess inventory, stock-outs, incorrect forecasts, inadequate sales efforts, and even poor customer service. The fates of all supply chain partners are interlinked: If the firms work together to serve consumers, they will all win. However, they can do that only if incentives are aligned. Companies must acknowledge that the problem of incentive misalignment exists and then determine its root cause and align or redesign incentives. They can improve alignment by, for instance, adopting revenue-sharing contracts, using technology to track previously hidden information, or working with intermediaries to build trust among network partners. It's also important to periodically reassess incentives, because even top-performing networks find that changes in technology or business conditions alter the alignment of incentives.

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

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

  5. Automatic bone segmentation and alignment from MR knee images

    NASA Astrophysics Data System (ADS)

    Shan, Liang; Zach, Christopher; Styner, Martin; Charles, Cecil; Niethammer, Marc

    2010-03-01

    Automatic image analysis of magnetic resonance (MR) images of the knee is simplified by bringing the knee into a reference position. While the knee is typically put into a reference position during image acquisition, this alignment will generally not be perfect. To correct for imperfections, we propose a two-step process of bone segmentation followed by elastic tissue deformation. The approach makes use of a fully-automatic segmentation of femur and tibia from T1 and T2* images. The segmentation algorithm is based on a continuous convex optimization problem, incorporating regional, and shape information. The regional terms are included from a probabilistic viewpoint, which readily allows the inclusion of shape information. Segmentation of the outer boundary of the cortical bone is encouraged by adding simple appearance-based information to the optimization problem. The resulting segmentation without the shape alignment step is globally optimal. Standard registration is problematic for knee alignment due to the distinct physical properties of the tissues constituting the knee (bone, muscle, etc.). We therefore develop an alternative alignment approach based on a simple elastic deformation model combined with strict enforcement of similarity transforms for femur and tibia based on the obtained segmentations.

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

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

  8. The Rotated Speeded-Up Robust Features Algorithm (R-SURF) (CD-ROM)

    DTIC Science & Technology

    Weaknesses in the Fast Hessian detector utilized by the speeded-up robust features ( SURF ) algorithm are examined in this research. We evaluate the SURF ...algorithm to identify possible areas for improvement in the performance. A proposed alternative to the SURF detector is proposed called rotated SURF (R- SURF ...against the regular SURF detector. Performance testing shows that the R- SURF outperforms the regular SURF detector when subject to image blurring

  9. High-energy detector

    DOEpatents

    Bolotnikov, Aleksey E [South Setauket, NY; Camarda, Giuseppe [Farmingville, NY; Cui, Yonggang [Upton, NY; James, Ralph B [Ridge, NY

    2011-11-22

    The preferred embodiments are directed to a high-energy detector that is electrically shielded using an anode, a cathode, and a conducting shield to substantially reduce or eliminate electrically unshielded area. The anode and the cathode are disposed at opposite ends of the detector and the conducting shield substantially surrounds at least a portion of the longitudinal surface of the detector. The conducting shield extends longitudinally to the anode end of the detector and substantially surrounds at least a portion of the detector. Signals read from one or more of the anode, cathode, and conducting shield can be used to determine the number of electrons that are liberated as a result of high-energy particles impinge on the detector. A correction technique can be implemented to correct for liberated electron that become trapped to improve the energy resolution of the high-energy detectors disclosed herein.

  10. Aligning Plasma-Arc Welding Oscillations

    NASA Technical Reports Server (NTRS)

    Norris, Jeff; Fairley, Mike

    1989-01-01

    Tool aids in alignment of oscillator probe on variable-polarity plasma-arc welding torch. Probe magnetically pulls arc from side to side as it moves along joint. Tensile strength of joint depends on alignment of weld bead and on alignment of probe. Operator installs new tool on front of torch body, levels it with built-in bubble glass, inserts probe in slot on tool, and locks probe in place. Procedure faster and easier and resulting alignment more accurate and repeatable.

  11. Use laser-optics for machinery alignment

    SciTech Connect

    Bloch, H.P.

    1987-10-01

    Many sources attribute most bearing overload and destructive vibration in industrial machinery to shaft misalignment. There is considerable disagreement as to the alignment quality required. There is also little agreement on suitable calculation methods and achievable accuracy for anticipated thermal growth of machinery (necessary if running alignment is to remain acceptable). This article examines existing alignment quality guidelines for relevance and consistency, and reviews the application of laser-optic alignment systems based on three years of field experience.

  12. A New Event Detector Designed for the Seismic Research Observatories

    USGS Publications Warehouse

    Murdock, James N.; Hutt, Charles R.

    1983-01-01

    A new short-period event detector has been implemented on the Seismic Research Observatories. For each signal detected, a printed output gives estimates of the time of onset of the signal, direction of the first break, quality of onset, period and maximum amplitude of the signal, and an estimate of the variability of the background noise. On the SRO system, the new algorithm runs ~2.5x faster than the former (power level) detector. This increase in speed is due to the design of the algorithm: all operations can be performed by simple shifts, additions, and comparisons (floating point operations are not required). Even though a narrow-band recursive filter is not used, the algorithm appears to detect events competitively with those algorithms that employ such filters. Tests at Albuquerque Seismological Laboratory on data supplied by Blandford suggest performance commensurate with the on-line detector of the Seismic Data Analysis Center, Alexandria, Virginia.

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

  14. Active angular alignment of gauge block in system for contactless gauge block calibration

    NASA Astrophysics Data System (ADS)

    Buchta, Zdeněk.; Šarbort, Martin; Řeřucha, Šimon; Hucl, Václav; Čížek, Martin; Lazar, Josef; Číp, Ondřej

    2014-05-01

    This paper presents a method for active angular alignment of gauge block implemented in a system for automatic contactless calibration of gauge blocks designed at ISI ASCR. The system combines low-coherence interferometry and laser interferometry, where the first identifies the gauge block sides position and the second one measures the gauge block length itself. A crucial part of the system is the algorithm for gauge block alignment to the measuring beam which is able to compensate the gauge block lateral and longitudinal tilt up to 0.141 mrad. The algorithm is also important for the gauge block position monitoring during its length measurement.

  15. Active angular alignment of gauge block in double-ended interferometer for its calibration

    NASA Astrophysics Data System (ADS)

    Buchta, Zdeněk; Šarbort, Martin; Řeřucha, Šimon; Hucl, Václav; Čížek, Martin; Lazar, Josef; Číp, Ondřej

    2015-01-01

    This paper presents a method for active angular alignment of gauge block implemented in a system for automatic contactless calibration of gauge blocks designed at ISI ASCR. The system combines low-coherence interferometry and laser interferometry, where the first identifies the gauge block sides position and the second one measures the gauge block length itself. A crucial part of the system is the algorithm for gauge block alignment to the measuring beam which is able to compensate the gauge block lateral and longitudinal tilt up to 0.141 mrad. The algorithm is also important for the gauge block position monitoring during its length measurement.

  16. Alignments of DNA and protein sequences containing frameshift errors.

    PubMed

    Guan, X; Uberbacher, E C

    1996-02-01

    Molecular sequences, like all experimental data, are subject to error. Many current DNA sequencing protocols have very significant error rates and often generate artefactual insertions and deletions of bases (indels) which corrupt the translation of sequences and compromise the detection of protein homologies. The impact of these errors on the utility of molecular sequence data is dependent on the analytic technique used to interpret the data. In the presence of frameshift errors, standard algorithms using six-frame translation can miss important homologies because only subfragments of the correct translation are available in any given frame. We present a new algorithm which can detect and correct frameshift errors in DNA sequences during comparison of translated sequences with protein sequences in the databases. This algorithm can recognize homologous proteins sharing 30% identity even in the presence of a 7% frameshift error rate. Our algorithm uses dynamic programming, producing a guaranteed optimal alignment in the presence of frameshifts, and has a sensitivity equivalent to Smith-Waterman. The computational efficiency of the algorithm is O(nm) where n and m are the sizes of two sequences being compared. The algorithm does not rely on prior knowledge or heuristic rules and performs significantly better than any previously reported method.

  17. Vertically aligned nanostructure scanning probe microscope tips

    DOEpatents

    Guillorn, Michael A.; Ilic, Bojan; Melechko, Anatoli V.; Merkulov, Vladimir I.; Lowndes, Douglas H.; Simpson, Michael L.

    2006-12-19

    Methods and apparatus are described for cantilever structures that include a vertically aligned nanostructure, especially vertically aligned carbon nanofiber scanning probe microscope tips. An apparatus includes a cantilever structure including a substrate including a cantilever body, that optionally includes a doped layer, and a vertically aligned nanostructure coupled to the cantilever body.

  18. Ultrafast electron diffraction from aligned molecules

    SciTech Connect

    Centurion, Martin

    2015-08-17

    The aim of this project was to record time-resolved electron diffraction patterns of aligned molecules and to reconstruct the 3D molecular structure. The molecules are aligned non-adiabatically using a femtosecond laser pulse. A femtosecond electron pulse then records a diffraction pattern while the molecules are aligned. The diffraction patterns are then be processed to obtain the molecular structure.

  19. Quantum Algorithms

    NASA Technical Reports Server (NTRS)

    Abrams, D.; Williams, C.

    1999-01-01

    This thesis describes several new quantum algorithms. These include a polynomial time algorithm that uses a quantum fast Fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, and that can be applied in cases for which all know classical algorithms require exponential time.

  20. Alignment and Performance of the Infrared Multi-Object Spectrometer

    NASA Technical Reports Server (NTRS)

    Connelly, Joseph A.; Ohl, Raymond G.; Mentzell, J. Eric; Madison, Timothy J.; Hylan, Jason E.; Mink, Ronald G.; Saha, Timo T.; Tveekrem, June L.; Sparr, Leroy M.; Chambers, V. John; Fitzgerald, Danetter; Greenhouse, Matthew A.; MacKenty, John W.

    2004-01-01

    The Infrared Multi-Object Spectrometer (IRMOS) is a principle investigator class instrument for the Kitt Peak National Observatory 4 and 2.1 meter telescopes. IRMOS is a near-IR (0.8 - 2.5 micron) spectrometer with low-to mid-resolving power (R = 300 - 3000). IRMOS produces simultaneous spectra of approximately 100 objects in its 2.8 x 2.0 arc-min field of view (4 m telescope) using a commercial Micro Electro-Mechanical Systems (MEMS) micro-mirror array (MMA) from Texas Instruments. The IRMOS optical design consists of two imaging subsystems. The focal reducer images the focal plane of the telescope onto the MMA field stop, and the spectrograph images the MMA onto the detector. We describe ambient breadboard subsystem alignment and imaging performance of each stage independently, and ambient imaging performance of the fully assembled instrument. Interferometric measurements of subsystem wavefront error serve as a qualitative alignment guide, and are accomplished using a commercial, modified Twyman-Green laser unequal path interferometer. Image testing provides verification of the optomechanical alignment method and a measurement of near-angle scattered light due to mirror small-scale surface error. Image testing is performed at multiple field points. A mercury-argon pencil lamp provides a spectral line at 546.1 nanometers, a blackbody source provides a line at 1550 nanometers, and a CCD camera and IR camera are used as detectors. We use commercial optical modeling software to predict the point-spread function and its effect on instrument slit transmission and resolution. Our breadboard and instrument level test results validate this prediction. We conclude with an instrument performance prediction for cryogenic operation and first light in late 2003.

  1. High-Resolution PET Detector. Final report

    SciTech Connect

    Karp, Joel

    2014-03-26

    The objective of this project was to develop an understanding of the limits of performance for a high resolution PET detector using an approach based on continuous scintillation crystals rather than pixelated crystals. The overall goal was to design a high-resolution detector, which requires both high spatial resolution and high sensitivity for 511 keV gammas. Continuous scintillation detectors (Anger cameras) have been used extensively for both single-photon and PET scanners, however, these instruments were based on NaI(Tl) scintillators using relatively large, individual photo-multipliers. In this project we investigated the potential of this type of detector technology to achieve higher spatial resolution through the use of improved scintillator materials and photo-sensors, and modification of the detector surface to optimize the light response function.We achieved an average spatial resolution of 3-mm for a 25-mm thick, LYSO continuous detector using a maximum likelihood position algorithm and shallow slots cut into the entrance surface.

  2. Reconfigurable systems for sequence alignment and for general dynamic programming.

    PubMed

    Jacobi, Ricardo P; Ayala-Rincón, Mauricio; Carvalho, Luis G A; Llanos, Carlos H; Hartenstein, Reiner W

    2005-09-30

    Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and reconfigurability allows for redefinition of the interconnections and operations even during run time (dynamically). We present a reconfigurable systolic architecture that can be applied for the efficient treatment of several dynamic programming methods for resolving well-known problems, such as global and local sequence alignment, approximate string matching and longest common subsequence. The dynamicity of the reconfigurability was found to be useful for practical applications in the construction of sequence alignments. A VHDL (VHSIC hardware description language) version of this new architecture was implemented on an APEX FPGA (Field programmable gate array). It would be several magnitudes faster than the software algorithm alternatives.

  3. Fast Implementation of Matched Filter Based Automatic Alignment Image Processing

    SciTech Connect

    Awwal, A S; Rice, K; Taha, T

    2008-04-02

    Video images of laser beams imprinted with distinguishable features are used for alignment of 192 laser beams at the National Ignition Facility (NIF). Algorithms designed to determine the position of these beams enable the control system to perform the task of alignment. Centroiding is a common approach used for determining the position of beams. However, real world beam images suffer from intensity fluctuation or other distortions which make such an approach susceptible to higher position measurement variability. Matched filtering used for identifying the beam position results in greater stability of position measurement compared to that obtained using the centroiding technique. However, this gain is achieved at the expense of extra processing time required for each beam image. In this work we explore the possibility of using a field programmable logic array (FPGA) to speed up these computations. The results indicate a performance improvement of 20 using the FPGA relative to a 3 GHz Pentium 4 processor.

  4. Optimal Parameter Design of Coarse Alignment for Fiber Optic Gyro Inertial Navigation System.

    PubMed

    Lu, Baofeng; Wang, Qiuying; Yu, Chunmei; Gao, Wei

    2015-06-25

    Two different coarse alignment algorithms for Fiber Optic Gyro (FOG) Inertial Navigation System (INS) based on inertial reference frame are discussed in this paper. Both of them are based on gravity vector integration, therefore, the performance of these algorithms is determined by integration time. In previous works, integration time is selected by experience. In order to give a criterion for the selection process, and make the selection of the integration time more accurate, optimal parameter design of these algorithms for FOG INS is performed in this paper. The design process is accomplished based on the analysis of the error characteristics of these two coarse alignment algorithms. Moreover, this analysis and optimal parameter design allow us to make an adequate selection of the most accurate algorithm for FOG INS according to the actual operational conditions. The analysis and simulation results show that the parameter provided by this work is the optimal value, and indicate that in different operational conditions, the coarse alignment algorithms adopted for FOG INS are different in order to achieve better performance. Lastly, the experiment results validate the effectiveness of the proposed algorithm.

  5. Structure-based evaluation of sequence comparison and fold recognition alignment accuracy.

    PubMed

    Domingues, F S; Lackner, P; Andreeva, A; Sippl, M J

    2000-04-07

    The biological role, biochemical function, and structure of uncharacterized protein sequences is often inferred from their similarity to known proteins. A constant goal is to increase the reliability, sensitivity, and accuracy of alignment techniques to enable the detection of increasingly distant relationships. Development, tuning, and testing of these methods benefit from appropriate benchmarks for the assessment of alignment accuracy.Here, we describe a benchmark protocol to estimate sequence-to-sequence and sequence-to-structure alignment accuracy. The protocol consists of structurally related pairs of proteins and procedures to evaluate alignment accuracy over the whole set. The set of protein pairs covers all the currently known fold types. The benchmark is challenging in the sense that it consists of proteins lacking clear sequence similarity. Correct target alignments are derived from the three-dimensional structures of these pairs by rigid body superposition. An evaluation engine computes the accuracy of alignments obtained from a particular algorithm in terms of alignment shifts with respect to the structure derived alignments. Using this benchmark we estimate that the best results can be obtained from a combination of amino acid residue substitution matrices and knowledge-based potentials.

  6. Large format focal plane array integration with precision alignment, metrology and accuracy capabilities

    NASA Astrophysics Data System (ADS)

    Neumann, Jay; Parlato, Russell; Tracy, Gregory; Randolph, Max

    2015-09-01

    Focal plane alignment for large format arrays and faster optical systems require enhanced precision methodology and stability over temperature. The increase in focal plane array size continues to drive the alignment capability. Depending on the optical system, the focal plane flatness of less than 25μm (.001") is required over transition temperatures from ambient to cooled operating temperatures. The focal plane flatness requirement must also be maintained in airborne or launch vibration environments. This paper addresses the challenge of the detector integration into the focal plane module and housing assemblies, the methodology to reduce error terms during integration and the evaluation of thermal effects. The driving factors influencing the alignment accuracy include: datum transfers, material effects over temperature, alignment stability over test, adjustment precision and traceability to NIST standard. The FPA module design and alignment methodology reduces the error terms by minimizing the measurement transfers to the housing. In the design, the proper material selection requires matched coefficient of expansion materials minimizes both the physical shift over temperature as well as lowering the stress induced into the detector. When required, the co-registration of focal planes and filters can achieve submicron relative positioning by applying precision equipment, interferometry and piezoelectric positioning stages. All measurements and characterizations maintain traceability to NIST standards. The metrology characterizes the equipment's accuracy, repeatability and precision of the measurements.

  7. Sub-micron alignment for nuclear emulsion plates using low energy electrons caused by radioactive isotopes

    NASA Astrophysics Data System (ADS)

    Miyamoto, S.; Ariga, A.; Fukuda, T.; Kazuyama, M.; Komatsu, M.; Nakano, T.; Niwa, K.; Sato, O.; Takahashi, S.

    2007-06-01

    Nuclear emulsion plates are employed in three-dimensional charged particle detectors that have sub-micron position resolution over 1 m2 with no dead space and no dead time. These detectors are suitable for the study of short-lived particle decays, and direct detection of neutrino interactions of all flavors. Typically emulsion plates are used in a stacked structure. Precise alignment between plates is required for physics analysis. The most accurate alignment method is to use tracks passing through the emulsion plates. The accuracy is about 0.2 μm. However, in an experiment with low track density alignment accuracy decreases to 20 μm because of plate distortion and it becomes more difficult to perform the analysis. This paper describes a new alignment method between emulsion plates by using trajectories of low energy electrons originating from environmental radioactive isotopes. As a trial emulsion plates were exposed to β-rays and γ-rays from K40. The trajectories which passed through emulsion layers were detected by a fully automated emulsion readout system. Using this method, the alignment between emulsion plates is demonstrated to be sub-micron. This method can be applied to many nuclear emulsion experiments. For example, the location of neutrino interaction vertices in the OPERA experiment can benefit from this new technique.

  8. PARTS: probabilistic alignment for RNA joinT secondary structure prediction.

    PubMed

    Harmanci, Arif Ozgun; Sharma, Gaurav; Mathews, David H

    2008-04-01

    A novel method is presented for joint prediction of alignment and common secondary structures of two RNA sequences. The joint consideration of common secondary structures and alignment is accomplished by structural alignment over a search space defined by the newly introduced motif called matched helical regions. The matched helical region formulation generalizes previously employed constraints for structural alignment and thereby better accommodates the structural variability within RNA families. A probabilistic model based on pseudo free energies obtained from precomputed base pairing and alignment probabilities is utilized for scoring structural alignments. Maximum a posteriori (MAP) common secondary structures, sequence alignment and joint posterior probabilities of base pairing are obtained from the model via a dynamic programming algorithm called PARTS. The advantage of the more general structural alignment of PARTS is seen in secondary structure predictions for the RNase P family. For this family, the PARTS MAP predictions of secondary structures and alignment perform significantly better than prior methods that utilize a more restrictive structural alignment model. For the tRNA and 5S rRNA families, the richer structural alignment model of PARTS does not offer a benefit and the method therefore performs comparably with existing alternatives. For all RNA families studied, the posterior probability estimates obtained from PARTS offer an improvement over posterior probability estimates from a single sequence prediction. When considering the base pairings predicted over a threshold value of confidence, the combination of sensitivity and positive predictive value is superior for PARTS than for the single sequence prediction. PARTS source code is available for download under the GNU public license at http://rna.urmc.rochester.edu.

  9. Fourier Lucas-Kanade algorithm.

    PubMed

    Lucey, Simon; Navarathna, Rajitha; Ashraf, Ahmed Bilal; Sridharan, Sridha

    2013-06-01

    In this paper, we propose a framework for both gradient descent image and object alignment in the Fourier domain. Our method centers upon the classical Lucas & Kanade (LK) algorithm where we represent the source and template/model in the complex 2D Fourier domain rather than in the spatial 2D domain. We refer to our approach as the Fourier LK (FLK) algorithm. The FLK formulation is advantageous when one preprocesses the source image and template/model with a bank of filters (e.g., oriented edges, Gabor, etc.) as 1) it can handle substantial illumination variations, 2) the inefficient preprocessing filter bank step can be subsumed within the FLK algorithm as a sparse diagonal weighting matrix, 3) unlike traditional LK, the computational cost is invariant to the number of filters and as a result is far more efficient, and 4) this approach can be extended to the Inverse Compositional (IC) form of the LK algorithm where nearly all steps (including Fourier transform and filter bank preprocessing) can be precomputed, leading to an extremely efficient and robust approach to gradient descent image matching. Further, these computational savings translate to nonrigid object alignment tasks that are considered extensions of the LK algorithm, such as those found in Active Appearance Models (AAMs).

  10. Neutrino Detectors: Challenges and Opportunities

    SciTech Connect

    Soler, F. J. P.

    2011-10-06

    This paper covers possible detector options suitable at future neutrino facilities, such as Neutrino Factories, Super Beams and Beta Beams. The Magnetised Iron Neutrino Detector (MIND), which is the baseline detector at a Neutrino Factory, will be described and a new analysis which improves the efficiency of this detector at low energies will be shown. Other detectors covered include the Totally Active Scintillating Detectors (TASD), particularly relevant for a low energy Neutrino Factory, emulsion detectors for tau detection, liquid argon detectors and megaton scale water Cherenkov detectors. Finally the requirements of near detectors for long-baseline neutrino experiments will be demonstrated.

  11. Phase Sensor for Aligning a Segmented Telescope Mirror

    NASA Technical Reports Server (NTRS)

    Stahl, Philip; Walker, Chanda Barlett

    2006-01-01

    A phase sensor has been developed for use in aligning a segmented telescope mirror to within a fraction of a wavelength in piston. (As used here, piston signifies displacement of a mirror segment along the optical axis of the telescope.) Such precise alignment is necessary in order to realize the full benefit of the large aperture achievable through segmentation. This phase sensor is achromatic. It is based on two-wavelength shearing interferometry, and can be modified to utilize an extended or broad-band (e.g., white) light source. The sensor optics include a ruled diffraction grating and an imaging lens. The sensor can measure the piston shift between segments as well as aberrations of the segments. It can measure the surface error of an individual segment, making it possible to compensate for the error with optimal amount(s) of piston and/or tilt. The precise capture range of the sensor depends partly on the telescope design; the largest relative piston shifts measurable by use of this sensor are of the order of 100 m. The accuracy of the sensor also depends partly on the telescope design; in general, the accuracy is sufficient to enable alignment to within approximately half a wavelength. The interferometric image is digitized and processed by a simple algorithm in real time, and the output of the algorithm can be used to maintain alignment in real time, even in the presence of atmospheric turbulence. The sensor is robust. Through calibration, it can be made insensitive to (and, hence, tolerant of) misalignments and aberrations of its own optics, most aberrations of the telescope as a whole (in contradistinction to aberrations of individual segments), and most aberrations introduced by atmospheric turbulence

  12. Aligning Two Genomic Sequences That Contain Duplications

    NASA Astrophysics Data System (ADS)

    Hou, Minmei; Riemer, Cathy; Berman, Piotr; Hardison, Ross C.; Miller, Webb

    It is difficult to properly align genomic sequences that contain intra-species duplications. With this goal in mind, we have developed a tool, called TOAST (two-way orthologous alignment selection tool), for predicting whether two aligned regions from different species are orthologous, i.e., separated by a speciation event, as opposed to a duplication event. The advantage of restricting alignment to orthologous pairs is that they constitute the aligning regions that are most likely to share the same biological function, and most easily analyzed for evidence of selection. We evaluate TOAST on 12 human/mouse gene clusters.

  13. Accelerator and transport line survey and alignment

    SciTech Connect

    Ruland, R.E.

    1991-10-01

    This paper summarizes the survey and alignment processes of accelerators and transport lines and discusses the propagation of errors associated with these processes. The major geodetic principles governing the survey and alignment measurement space are introduced and their relationship to a lattice coordinate system shown. The paper continues with a broad overview about the activities involved in the step sequence from initial absolute alignment to final smoothing. Emphasis is given to the relative alignment of components, in particular to the importance of incorporating methods to remove residual systematic effects in surveying and alignment operations. Various approaches to smoothing used at major laboratories are discussed. 47 refs., 19 figs., 1 tab.

  14. Initial Navigation Alignment of Optical Instruments on GOES-R

    NASA Technical Reports Server (NTRS)

    Isaacson, Peter J.; DeLuccia, Frank J.; Reth, Alan D.; Igli, David A.; Carter, Delano R.

    2016-01-01

    Post-launch alignment errors for the Advanced Baseline Imager (ABI) and Geospatial Lightning Mapper (GLM) on GOES-R may be too large for the image navigation and registration (INR) processing algorithms to function without an initial adjustment to calibration parameters. We present an approach that leverages a combination of user-selected image-to-image tie points and image correlation algorithms to estimate this initial launch-induced offset and calculate adjustments to the Line of Sight Motion Compensation (LMC) parameters. We also present an approach to generate synthetic test images, to which shifts and rotations of known magnitude are applied. Results of applying the initial alignment tools to a subset of these synthetic test images are presented. The results for both ABI and GLM are within the specifications established for these tools, and indicate that application of these tools during the post-launch test (PLT) phase of GOES-R operations will enable the automated INR algorithms for both instruments to function as intended.

  15. Dynamic Alignment Models for Neural Coding

    PubMed Central

    Kollmorgen, Sepp; Hahnloser, Richard H. R.

    2014-01-01

    Recently, there have been remarkable advances in modeling the relationships between the sensory environment, neuronal responses, and behavior. However, most models cannot encompass variable stimulus-response relationships such as varying response latencies and state or context dependence of the neural code. Here, we consider response modeling as a dynamic alignment problem and model stimulus and response jointly by a mixed pair hidden Markov model (MPH). In MPHs, multiple stimulus-response relationships (e.g., receptive fields) are represented by different states or groups of states in a Markov chain. Each stimulus-response relationship features temporal flexibility, allowing modeling of variable response latencies, including noisy ones. We derive algorithms for learning of MPH parameters and for inference of spike response probabilities. We show that some linear-nonlinear Poisson cascade (LNP) models are a special case of MPHs. We demonstrate the efficiency and usefulness of MPHs in simulations of both jittered and switching spike responses to white noise and natural stimuli. Furthermore, we apply MPHs to extracellular single and multi-unit data recorded in cortical brain areas of singing birds to showcase a novel method for estimating response lag distributions. MPHs allow simultaneous estimation of receptive fields, latency statistics, and hidden state dynamics and so can help to uncover complex stimulus response relationships that are subject to variable timing and involve diverse neural codes. PMID:24625448

  16. Centroid stabilization for laser alignment to corner cubes: designing a matched filter

    SciTech Connect

    Awwal, Abdul A. S.; Bliss, Erlan; Brunton, Gordon; Kamm, Victoria Miller; Leach, Richard R.; Lowe-Webb, Roger; Roberts, Randy; Wilhelmsen, Karl

    2016-11-08

    Automation of image-based alignment of NIF high energy laser beams is providing the capability of executing multiple target shots per day. One important alignment is beam centration through the second and third harmonic generating crystals in the final optics assembly (FOA), which employs two retro-reflecting corner cubes as centering references for each beam. Beam-to-beam variations and systematic beam changes over time in the FOA corner cube images can lead to a reduction in accuracy as well as increased convergence durations for the template-based position detector. A systematic approach is described that maintains FOA corner cube templates and guarantees stable position estimation.

  17. Pupil Alignment Measuring Technique and Alignment Reference for Instruments or Optical Systems

    NASA Technical Reports Server (NTRS)

    Hagopian, John G.

    2010-01-01

    A technique was created to measure the pupil alignment of instruments in situ by measuring calibrated pupil alignment references (PARs) in instruments. The PAR can also be measured using an alignment telescope or an imaging system. PAR allows the verification of the science instrument (SI) pupil alignment at the integrated science instrument module (ISIM) level of assembly at ambient and cryogenic operating temperature. This will allow verification of the ISIM+SI alignment, and provide feedback to realign the SI if necessary.

  18. Precise 3D image alignment in micro-axial tomography.

    PubMed

    Matula, P; Kozubek, M; Staier, F; Hausmann, M

    2003-02-01

    Micro (micro-) axial tomography is a challenging technique in microscopy which improves quantitative imaging especially in cytogenetic applications by means of defined sample rotation under the microscope objective. The advantage of micro-axial tomography is an effective improvement of the precision of distance measurements between point-like objects. Under certain circumstances, the effective (3D) resolution can be improved by optimized acquisition depending on subsequent, multi-perspective image recording of the same objects followed by reconstruction methods. This requires, however, a very precise alignment of the tilted views. We present a novel feature-based image alignment method with a precision better than the full width at half maximum of the point spread function. The features are the positions (centres of gravity) of all fluorescent objects observed in the images (e.g. cell nuclei, fluorescent signals inside cell nuclei, fluorescent beads, etc.). Thus, real alignment precision depends on the localization precision of these objects. The method automatically determines the corresponding objects in subsequently tilted perspectives using a weighted bipartite graph. The optimum transformation function is computed in a least squares manner based on the coordinates of the centres of gravity of the matched objects. The theoretically feasible precision of the method was calculated using computer-generated data and confirmed by tests on real image series obtained from data sets of 200 nm fluorescent nano-particles. The advantages of the proposed algorithm are its speed and accuracy, which means that if enough objects are included, the real alignment precision is better than the axial localization precision of a single object. The alignment precision can be assessed directly from the algorithm's output. Thus, the method can be applied not only for image alignment and object matching in tilted view series in order to reconstruct (3D) images, but also to validate the

  19. Aligned interactions in cosmic rays

    NASA Astrophysics Data System (ADS)

    Kempa, J.

    2015-12-01

    The first clean Centauro was found in cosmic rays years many ago at Mt Chacaltaya experiment. Since that time, many people have tried to find this type of interaction, both in cosmic rays and at accelerators. But no one has found a clean cases of this type of interaction.It happened finally in the last exposure of emulsion at Mt Chacaltaya where the second clean Centauro has been found. The experimental data for both the Centauros and STRANA will be presented and discussed in this paper. We also present our comments to the intriguing question of the existence of a type of nuclear interactions at high energy with alignment.

  20. MEANS FOR DETERMINING CENTRIFUGE ALIGNMENT

    DOEpatents

    Smith, W.Q.

    1958-08-26

    An apparatus is presented for remotely determining the alignment of a centrifuge. The centrifage shaft is provided with a shoulder, upon which two followers ride, one for detecting radial movements, and one upon the shoulder face for determining the axial motion. The followers are attached to separate liquid filled bellows, and a tube connects each bellows to its respective indicating gage at a remote location. Vibrations produced by misalignment of the centrifuge shaft are transmitted to the bellows, and tbence through the tubing to the indicator gage. This apparatus is particularly useful for operation in a hot cell where the materials handled are dangerous to the operating personnel.

  1. Aligned interactions in cosmic rays

    SciTech Connect

    Kempa, J.

    2015-12-15

    The first clean Centauro was found in cosmic rays years many ago at Mt Chacaltaya experiment. Since that time, many people have tried to find this type of interaction, both in cosmic rays and at accelerators. But no one has found a clean cases of this type of interaction.It happened finally in the last exposure of emulsion at Mt Chacaltaya where the second clean Centauro has been found. The experimental data for both the Centauros and STRANA will be presented and discussed in this paper. We also present our comments to the intriguing question of the existence of a type of nuclear interactions at high energy with alignment.

  2. Method for protein structure alignment

    DOEpatents

    Blankenbecler, Richard; Ohlsson, Mattias; Peterson, Carsten; Ringner, Markus

    2005-02-22

    This invention provides a method for protein structure alignment. More particularly, the present invention provides a method for identification, classification and prediction of protein structures. The present invention involves two key ingredients. First, an energy or cost function formulation of the problem simultaneously in terms of binary (Potts) assignment variables and real-valued atomic coordinates. Second, a minimization of the energy or cost function by an iterative method, where in each iteration (1) a mean field method is employed for the assignment variables and (2) exact rotation and/or translation of atomic coordinates is performed, weighted with the corresponding assignment variables.

  3. BATSE spectroscopy detector calibration

    NASA Technical Reports Server (NTRS)

    Band, D.; Ford, L.; Matteson, J.; Lestrade, J. P.; Teegarden, B.; Schaefer, B.; Cline, T.; Briggs, M.; Paciesas, W.; Pendleton, G.

    1992-01-01

    We describe the channel-to-energy calibration of the Spectroscopy Detectors of the Burst and Transient Source Experiment (BATSE) on the Compton Gamma Ray Observatory (GRO). These detectors consist of NaI(TI) crystals viewed by photomultiplier tubes whose output in turn is measured by a pulse height analyzer. The calibration of these detectors has been complicated by frequent gain changes and by nonlinearities specific to the BATSE detectors. Nonlinearities in the light output from the NaI crystal and in the pulse height analyzer are shifted relative to each other by changes in the gain of the photomultiplier tube. We present the analytical model which is the basis of our calibration methodology, and outline how the empirical coefficients in this approach were determined. We also describe the complications peculiar to the Spectroscopy Detectors, and how our understanding of the detectors' operation led us to a solution to these problems.

  4. Intelligent Detector Design

    SciTech Connect

    Graf, N.A.; /SLAC

    2012-06-11

    As the complexity and resolution of imaging detectors increases, the need for detailed simulation of the experimental setup also becomes more important. Designing the detectors requires efficient tools to simulate the detector response and reconstruct the events. We have developed efficient and flexible tools for detailed physics and detector response simulation as well as event reconstruction and analysis. The primary goal has been to develop a software toolkit and computing infrastructure to allow physicists from universities and labs to quickly and easily conduct physics analyses and contribute to detector research and development. The application harnesses the full power of the Geant4 toolkit without requiring the end user to have any experience with either Geant4 or C++, thereby allowing the user to concentrate on the physics of the detector system.

  5. Strategies for active alignment of lenses

    NASA Astrophysics Data System (ADS)

    Langehanenberg, Patrik; Heinisch, Josef; Wilde, Chrisitan; Hahne, Felix; Lüerß, Bernd

    2015-10-01

    Today's optical systems require up-to-date assembly and joining technology. The trend of keeping dimensions as small as possible while maintaining or increasing optical imaging performance leaves little to no room for mechanical lens adjustment equipment that may remain in the final product. In this context active alignment of optical elements opens up possibilities for the fast and cost-economic manufacturing of lenses and lens assemblies with highest optical performance. Active alignment for lens manufacturing is the precise alignment of the optical axis of a lens with respect to an optical or mechanical reference axis (e.g. housing) including subsequent fixation by glue. In this contribution we will describe different approaches for active alignment and outline strengths and limitations of the different methods. Using the SmartAlign principle, highest quality cemented lenses can be manufactured without the need for high precision prealignment, while the reduction to a single alignment step greatly reduces the cycle time. The same strategies can also be applied to bonding processes. Lenses and lens groups can be aligned to both mechanical and optical axes to maximize the optical performance of a given assembly. In hybrid assemblies using both mechanical tolerances and active alignment, SmartAlign can be used to align critical lens elements anywhere inside the system for optimized total performance. Since all geometrical parameters are re-measured before each alignment, this process is especially suited for complex and time-consuming production processes where the stability of the reference axis would otherwise be critical. For highest performance, lenses can be actively aligned using up to five degrees of freedom. In this way, SmartAlign enables the production of ultra-precise mounted lenses with an alignment precision below 1 μm.

  6. Germanium detector vacuum encapsulation

    NASA Technical Reports Server (NTRS)

    Madden, N. W.; Malone, D. F.; Pehl, R. H.; Cork, C. P.; Luke, P. N.; Landis, D. A.; Pollard, M. J.

    1991-01-01

    This paper describes an encapsulation technology that should significantly improve the viability of germanium gamma-ray detectors for a number of important applications. A specialized vacuum chamber has been constructed in which the detector and the encapsulating module are processed in high vacuum. Very high vacuum conductance is achieved within the valveless encapsulating module. The detector module is then sealed without breaking the chamber vacuum. The details of the vacuum chamber, valveless module, processing, and sealing method are presented.

  7. Detectors (5/5)

    ScienceCinema

    None

    2016-07-12

    This lecture will serve as an introduction to particle detectors and detection techniques. In the first lecture, a historic overview of particle detector development will be given. In the second lecture, some basic techniques and concepts for particle detection will be discussed. In the third lecture, the interaction of particles with matter, the basis of particle detection, will be presented. The fourth and fifth lectures will discuss different detector types used for particle tracking, energy measurement and particle identification.

  8. Detectors (4/5)

    ScienceCinema

    None

    2016-07-12

    This lecture will serve as an introduction to particle detectors and detection techniques. In the first lecture, a historic overview of particle detector development will be given. In the second lecture, some basic techniques and concepts for particle detection will be discussed. In the third lecture, the interaction of particles with matter, the basis of particle detection, will be presented. The fourth and fifth lectures will discuss different detector types used for particle tracking, energy measurement and particle identification.

  9. Interferometric direction finding with a metamaterial detector

    SciTech Connect

    Venkatesh, Suresh; Schurig, David; Shrekenhamer, David; Padilla, Willie; Xu, Wangren; Sonkusale, Sameer

    2013-12-16

    We present measurements and analysis demonstrating useful direction finding of sources in the S band (2–4 GHz) using a metamaterial detector. An augmented metamaterial absorber that supports magnitude and phase measurement of the incident electric field, within each unit cell, is described. The metamaterial is implemented in a commercial printed circuit board process with off-board back-end electronics. We also discuss on-board back-end implementation strategies. Direction finding performance is analyzed for the fabricated metamaterial detector using simulated data and the standard algorithm, MUtiple SIgnal Classification. The performance of this complete system is characterized by its angular resolution as a function of radiation density at the detector. Sources with power outputs typical of mobile communication devices can be resolved at kilometer distances with sub-degree resolution and high frame rates.

  10. The Poisson alignment reference system implementation at the Advanced Photon Source.

    SciTech Connect

    Feier, I.

    1998-09-21

    The Poisson spot was established using a collimated laser beam from a 3-mW diode laser. It was monitored on a quadrant detector and found to be very sensitive to vibration and air disturbances. Therefore, for future work we strongly recommend a sealed vacuum tube in which the Poisson line may be propagated. A digital single-axis feedback system was employed to generate an straight line reference (SLR) on the X axis. Pointing accuracy was better than 8 {+-} 2 microns at a distance of 5 m. The digital system was found to be quite slow with a maximum bandwidth of 47 {+-} 9 Hz. Slow drifts were easily corrected but any vibration over 5 Hz was not. We recommend an analog proportional-integral-derivative (PID) controller for high bandwidth and smooth operation of the kinematic mirror. Although the Poisson alignment system (PAS) at the Advanced Photon Source is still in its infancy, it already shows great promise as a possible alignment system for the low-energy undulator test line (LEUTL). Since components such as wigglers and quadruples will initially be aligned with respect to each other using conventional means and mounted on some kind of rigid rail, the goal would be to align six to ten such rails over a distance of about 30 m. The PAS could be used to align these rails by mounting a sphere at the joint between two rails. These spheres would need to be in a vacuum pipe to eliminate the refractive effects of air. Each sphere would not be attached to either rail but instead to a flange connecting the vacuum pipes of each rail. Thus the whole line would be made up of straight, rigid segments that could be aligned by moving the joints. Each sphere would have its own detector, allowing the operators to actively monitor the position of each joint and therefore the overall alignment of the system.

  11. Parametric and non-parametric masking of randomness in sequence alignments can be improved and leads to better resolved trees

    PubMed Central

    2010-01-01

    Background Methods of alignment masking, which refers to the technique of excluding alignment blocks prior to tree reconstructions, have been successful in improving the signal-to-noise ratio in sequence alignments. However, the lack of formally well defined methods to identify randomness in sequence alignments has prevented a routine application of alignment masking. In this study, we compared the effects on tree reconstructions of the most commonly used profiling method (GBLOCKS) which uses a predefined set of rules in combination with alignment masking, with a new profiling approach (ALISCORE) based on Monte Carlo resampling within a sliding window, using different data sets and alignment methods. While the GBLOCKS approach excludes variable sections above a certain threshold which choice is left arbitrary, the ALISCORE algorithm is free of a priori rating of parameter space and therefore more objective. Results ALISCORE was successfully extended to amino acids using a proportional model and empirical substitution matrices to score randomness in multiple sequence alignments. A complex bootstrap resampling leads to an even distribution of scores of randomly similar sequences to assess randomness of the observed sequence similarity. Testing performance on real data, both masking methods, GBLOCKS and ALISCORE, helped to improve tree resolution. The sliding window approach was less sensitive to different alignments of identical data sets and performed equally well on all data sets. Concurrently, ALISCORE is capable of dealing with different substitution patterns and heterogeneous base composition. ALISCORE and the most relaxed GBLOCKS gap parameter setting performed best on all data sets. Correspondingly, Neighbor-Net analyses showed the most decrease in conflict. Conclusions Alignment masking improves signal-to-noise ratio in multiple sequence alignments prior to phylogenetic reconstruction. Given the robust performance of alignment profiling, alignment masking

  12. Photocapacitive MIS infrared detectors

    NASA Technical Reports Server (NTRS)

    Sher, A.; Lu, S. S.-M.; Moriarty, J. A.; Crouch, R. K.; Miller, W. E.

    1978-01-01

    A new class of room-temperature infrared detectors has been developed through use of metal-insulator-semiconductor (MIS) or metal-insulator-semiconductor-insulator-metal (MISIM) slabs. The detectors, which have been fabricated from Si, Ge and GaAs, rely for operation on the electrical capacitance variations induced by modulated incident radiation. The peak detectivity for a 1000-A Si MISIM detector is comparable to that of a conventional Si detector functioning in the photovoltaic mode. Optimization of the photocapacitive-mode detection sensitivity is discussed.

  13. The CDFII Silicon Detector

    SciTech Connect

    Julia Thom

    2004-07-23

    The CDFII silicon detector consists of 8 layers of double-sided silicon micro-strip sensors totaling 722,432 readout channels, making it one of the largest silicon detectors in present use by an HEP experiment. After two years of data taking, we report on our experience operating the complex device. The performance of the CDFII silicon detector is presented and its impact on physics analyses is discussed. We have already observed measurable effects from radiation damage. These results and their impact on the expected lifetime of the detector are briefly reviewed.

  14. Adaptors for radiation detectors

    DOEpatents

    Livesay, Ronald Jason

    2015-07-28

    Described herein are adaptors and other devices for radiation detectors that can be used to make accurate spectral measurements of both small and large bulk sources of radioactivity, such as building structures, soils, vessels, large equipment, and liquid bodies. Some exemplary devices comprise an adaptor for a radiation detector, wherein the adaptor can be configured to collimate radiation passing through the adapter from an external radiation source to the radiation detector and the adaptor can be configured to enclose a radiation source within the adapter to allow the radiation detector to measure radiation emitted from the enclosed radiation source.

  15. Adaptors for radiation detectors

    DOEpatents

    Livesay, Ronald Jason

    2014-04-22

    Described herein are adaptors and other devices for radiation detectors that can be used to make accurate spectral measurements of both small and large bulk sources of radioactivity, such as building structures, soils, vessels, large equipment, and liquid bodies. Some exemplary devices comprise an adaptor for a radiation detector, wherein the adaptor can be configured to collimate radiation passing through the adapter from an external radiation source to the radiation detector and the adaptor can be configured to enclose a radiation source within the adapter to allow the radiation detector to measure radiation emitted from the enclosed radiation source.

  16. Ion Feedback Suppression Using Inclined MCP Holes in a _Single-MCP+Micromegas+Pads_ Detector

    SciTech Connect

    Va'vra, J.; Sumiyoshi, T.; /Tokyo Metropolitan U.

    2005-09-30

    We show that the ion backflow to photocathode can be completely suppressed if one uses inclined MCP holes in a presence of magnetic field. The inclined hole angles are chosen to be aligned with the Lorentz electron angle allowing the electron transmission and amplification, while positive ions, traveling along a different angle, are caught on the MCP hole walls. The detector under investigation is a new gaseous detector structure based on a tandem of two parts, a single MCP (Microchannel) plate, a Micromegas with pad readout. We are aiming to develop a gaseous photon detector with the Bialkali photocathode, however, one could use some ideas in the paper for other types of detectors.

  17. Combination of current-integrating/photon-counting detector modules for spectral CT.

    PubMed

    Chu, Jiyang; Cong, Wenxiang; Li, Liang; Wang, Ge

    2013-10-07

    Inspired by compressive sensing theory and spectral detection technology, here we propose a novel design of a CT detector array that uses current-integrating/photon-counting modules in an interlacing fashion so that strengths of each detector type can be synergistically combined. For geometrical symmetry, an evenly alternating pattern is initially assumed for these detector modules to form a hybrid detector array. While grayscale detector modules acquire regular raw data in a large dynamic range cost-effectively, spectral detector modules simultaneously sense energy-discriminative data in multiple energy bins. A split Bregman iterative algorithm is developed for spectral CT reconstruction from projection data of an object collected with the hybrid detector array. With mathematical phantoms, an optimal ratio of the number of the spectral elements over the number of grayscale elements is determined based on classic image quality evaluation. This hybrid detector array is capable of delivering a performance comparable with that of a full spectral detector array.

  18. Vision-guided self-alignment and manipulation in a walking robot

    NASA Technical Reports Server (NTRS)

    Nickels, Kevin M.; Kennedy, Brett; Aghazarian, Hrand; Collins, Curtis; Garrett(dagger), Mike; Magnone, Lee; Okon, Avi; Townsend, Julie

    2006-01-01

    This paper describes the vision algorithms used in several tasks, as well as the vision-guided manipulation algorithms developed to mitigate mismatches between the vision system and the limbs used for manipulation. Two system-level tasks will be described, one involving a two meter walk culminating in a bolt-fastening task and one involving a vision-guided alignment ending with the robot mating with a docking station.

  19. A guide to parallel execution of sequence alignment

    NASA Astrophysics Data System (ADS)

    Lauredo, Alexandre M.; Sena, Alexandre C.; de Castro, Maria Clicia S.; Leandro, Marzulo, A. J.

    2016-12-01

    Finding the longest common subsequence (LCS) is an important part of DNA sequence alignment. Through dynamic programming it is possible to find the exact solution to the LCS, with space and time complexity of O(m × n), being m e n the sequence sizes. Parallel algorithms are essential, since large sequences require too much time and memory to be processed sequentially. Thus, the aim of this work is to implement and evaluate different parallel solutions for distributed memory machines, so that the amount of memory is equally divided among the various processing nodes.

  20. Measuring alignment of loading fixture

    DOEpatents

    Scavone, Donald W.

    1989-01-01

    An apparatus and method for measuring the alignment of a clevis and pin type loading fixture for compact tension specimens include a pair of substantially identical flat loading ligaments. Each loading ligament has two apertures for the reception of a respective pin of the loading fixture and a thickness less than one-half of a width of the clevis opening. The pair of loading ligaments are mounted in the clevis openings at respective sides thereof. The loading ligaments are then loaded by the pins of the loading fixture and the strain in each loading ligament is measured. By comparing the relative strain of each loading ligament, the alignment of the loading fixture is determined. Preferably, a suitable strain gage device is located at each longitudinal edge of a respective loading ligament equidistant from the two apertures in order to determine the strain thereat and hence the strain of each ligament. The loading ligaments are made substantially identical by jig grinding the loading ligaments as a matched set. Each loading ligament can also be individually calibrated prior to the measurement.