Application of fast orthogonal search to linear and nonlinear stochastic systems
DEFF Research Database (Denmark)
Chon, K H; Korenberg, M J; Holstein-Rathlou, N H
1997-01-01
Standard deterministic autoregressive moving average (ARMA) models consider prediction errors to be unexplainable noise sources. The accuracy of the estimated ARMA model parameters depends on producing minimum prediction errors. In this study, an accurate algorithm is developed for estimating...... linear and nonlinear stochastic ARMA model parameters by using a method known as fast orthogonal search, with an extended model containing prediction errors as part of the model estimation process. The extended algorithm uses fast orthogonal search in a two-step procedure in which deterministic terms...
Directory of Open Access Journals (Sweden)
H. Rezghian Moghadam
2018-06-01
Full Text Available The tremor injury is one of the common symptoms of Parkinson's disease. The patients suffering from Parkinson's disease have difficulty in controlling their movements owing to tremor. The intensity of the disease can be determined through specifying the range of intensity values of involuntary tremor in Parkinson patients. The level of disease in patients is determined through an empirical range of 0-5. In the early stages of Parkinson, resting tremor can be very mild and intermittent. So, diagnosing the levels of disease is difficult but important since it has only medication therapy. The aim of this study is to quantify the intensity of tremor by the analysis of electromyogram signal. The solution proposed in this paper is to employ a polynomial function model to estimate the Unified Parkinson's Disease Rating Scale (UPDRS value. The algorithm of Fast Orthogonal Search (FOS, which is based on identification of orthogonal basic functions, was utilized for model identification. In fact, some linear and nonlinear features extracted from wrist surface electromyogram signal were considered as the input of the model identified by FOS, and the model output was the UPDRS value. In this research, the proposed model was designed based on two different structures which have been called the single structure and parallel structure. The efficiency of designed models with different structures was evaluated. The evaluation results using K-fold cross validation approach showed that the proposed model with a parallel structure could determine the tremor severity of the Parkinson's disease with accuracy of 99.25% ±0.41, sensitivity of 97.17% ±1.9 and specificity of 99.72% ±0.18.
International Nuclear Information System (INIS)
Osman, Abdalla; El-Sheimy, Naser; Nourledin, Aboelamgd; Theriault, Jim; Campbell, Scott
2009-01-01
The problem of target detection and tracking in the ocean environment has attracted considerable attention due to its importance in military and civilian applications. Sonobuoys are one of the capable passive sonar systems used in underwater target detection. Target detection and bearing estimation are mainly obtained through spectral analysis of received signals. The frequency resolution introduced by current techniques is limited which affects the accuracy of target detection and bearing estimation at a relatively low signal-to-noise ratio (SNR). This research investigates the development of a bearing estimation method using fast orthogonal search (FOS) for enhanced spectral estimation. FOS is employed in this research in order to improve both target detection and bearing estimation in the case of low SNR inputs. The proposed methods were tested using simulated data developed for two different scenarios under different underwater environmental conditions. The results show that the proposed method is capable of enhancing the accuracy for target detection as well as bearing estimation especially in cases of a very low SNR
El-Jaat, Majda; Hulley, Michael; Tétreault, Michel
2018-02-01
Despite the broad impact and importance of saltwater intrusion in coastal aquifers, little research has been directed towards forecasting saltwater intrusion in areas where the source of saltwater is uncertain. Saline contamination in inland groundwater supplies is a concern for numerous communities in the southern US including the city of Deltona, Florida. Furthermore, conventional numerical tools for forecasting saltwater contamination are heavily dependent on reliable characterization of the physical characteristics of underlying aquifers, information that is often absent or challenging to obtain. To overcome these limitations, a reliable alternative data-driven model for forecasting salinity in a groundwater supply was developed for Deltona using the fast orthogonal search (FOS) method. FOS was applied on monthly water-demand data and corresponding chloride concentrations at water supply wells. Groundwater salinity measurements from Deltona water supply wells were applied to evaluate the forecasting capability and accuracy of the FOS model. Accurate and reliable groundwater salinity forecasting is necessary to support effective and sustainable coastal-water resource planning and management. The available (27) water supply wells for Deltona were randomly split into three test groups for the purposes of FOS model development and performance assessment. Based on four performance indices (RMSE, RSR, NSEC, and R), the FOS model proved to be a reliable and robust forecaster of groundwater salinity. FOS is relatively inexpensive to apply, is not based on rigorous physical characterization of the water supply aquifer, and yields reliable estimates of groundwater salinity in active water supply wells.
Cache-Oblivious Planar Orthogonal Range Searching and Counting
DEFF Research Database (Denmark)
Arge, Lars; Brodal, Gerth Stølting; Fagerberg, Rolf
2005-01-01
present the first cache-oblivious data structure for planar orthogonal range counting, and improve on previous results for cache-oblivious planar orthogonal range searching. Our range counting structure uses O(Nlog2 N) space and answers queries using O(logB N) memory transfers, where B is the block...... size of any memory level in a multilevel memory hierarchy. Using bit manipulation techniques, the space can be further reduced to O(N). The structure can also be modified to support more general semigroup range sum queries in O(logB N) memory transfers, using O(Nlog2 N) space for three-sided queries...... and O(Nlog22 N/log2log2 N) space for four-sided queries. Based on the O(Nlog N) space range counting structure, we develop a data structure that uses O(Nlog2 N) space and answers three-sided range queries in O(logB N+T/B) memory transfers, where T is the number of reported points. Based...
Fast orthogonal transforms and generation of Brownian paths.
Leobacher, Gunther
2012-04-01
We present a number of fast constructions of discrete Brownian paths that can be used as alternatives to principal component analysis and Brownian bridge for stratified Monte Carlo and quasi-Monte Carlo. By fast we mean that a path of length [Formula: see text] can be generated in [Formula: see text] floating point operations. We highlight some of the connections between the different constructions and we provide some numerical examples.
Fast Maximum-Likelihood Decoder for Quasi-Orthogonal Space-Time Block Code
Directory of Open Access Journals (Sweden)
Adel Ahmadi
2015-01-01
Full Text Available Motivated by the decompositions of sphere and QR-based methods, in this paper we present an extremely fast maximum-likelihood (ML detection approach for quasi-orthogonal space-time block code (QOSTBC. The proposed algorithm with a relatively simple design exploits structure of quadrature amplitude modulation (QAM constellations to achieve its goal and can be extended to any arbitrary constellation. Our decoder utilizes a new decomposition technique for ML metric which divides the metric into independent positive parts and a positive interference part. Search spaces of symbols are substantially reduced by employing the independent parts and statistics of noise. Symbols within the search spaces are successively evaluated until the metric is minimized. Simulation results confirm that the proposed decoder’s performance is superior to many of the recently published state-of-the-art solutions in terms of complexity level. More specifically, it was possible to verify that application of the new algorithms with 1024-QAM would decrease the computational complexity compared to state-of-the-art solution with 16-QAM.
Fast business process similarity search
Yan, Z.; Dijkman, R.M.; Grefen, P.W.P.J.
2012-01-01
Nowadays, it is common for organizations to maintain collections of hundreds or even thousands of business processes. Techniques exist to search through such a collection, for business process models that are similar to a given query model. However, those techniques compare the query model to each
Orthogonal search-based rule extraction for modelling the decision to transfuse.
Etchells, T A; Harrison, M J
2006-04-01
Data from an audit relating to transfusion decisions during intermediate or major surgery were analysed to determine the strengths of certain factors in the decision making process. The analysis, using orthogonal search-based rule extraction (OSRE) from a trained neural network, demonstrated that the risk of tissue hypoxia (ROTH) assessed using a 100-mm visual analogue scale, the haemoglobin value (Hb) and the presence or absence of on-going haemorrhage (OGH) were able to reproduce the transfusion decisions with a joint specificity of 0.96 and sensitivity of 0.93 and a positive predictive value of 0.9. The rules indicating transfusion were: 1. ROTH > 32 mm and Hb 13 mm and Hb 38 mm, Hb < 102 g x l(-1) and OGH; 4. Hb < 78 g x l(-1).
Directory of Open Access Journals (Sweden)
Bo Wang
2015-01-01
Full Text Available Nonnegative orthogonal matching pursuit (NOMP has been proven to be a more stable encoder for unsupervised sparse representation learning. However, previous research has shown that NOMP is suboptimal in terms of computational cost, as the coefficients selection and refinement using nonnegative least squares (NNLS have been divided into two separate steps. It is found that this problem severely reduces the efficiency of encoding for large-scale image patches. In this work, we study fast nonnegative OMP (FNOMP as an efficient encoder which can be accelerated by the implementation of QR factorization and iterations of coefficients in deep networks for full-size image categorization task. It is analyzed and demonstrated that using relatively simple gain-shape vector quantization for training dictionary, FNOMP not only performs more efficiently than NOMP for encoding but also significantly improves the classification accuracy compared to OMP based algorithm. In addition, FNOMP based algorithm is superior to other state-of-the-art methods on several publicly available benchmarks, that is, Oxford Flowers, UIUC-Sports, and Caltech101.
FastBit: Interactively Searching Massive Data
Energy Technology Data Exchange (ETDEWEB)
Wu, Kesheng; Ahern, Sean; Bethel, E. Wes; Chen, Jacqueline; Childs, Hank; Cormier-Michel, Estelle; Geddes, Cameron; Gu, Junmin; Hagen, Hans; Hamann, Bernd; Koegler, Wendy; Lauret, Jerome; Meredith, Jeremy; Messmer, Peter; Otoo, Ekow; Perevoztchikov, Victor; Poskanzer, Arthur; Prabhat,; Rubel, Oliver; Shoshani, Arie; Sim, Alexander; Stockinger, Kurt; Weber, Gunther; Zhang, Wei-Ming
2009-06-23
As scientific instruments and computer simulations produce more and more data, the task of locating the essential information to gain insight becomes increasingly difficult. FastBit is an efficient software tool to address this challenge. In this article, we present a summary of the key underlying technologies, namely bitmap compression, encoding, and binning. Together these techniques enable FastBit to answer structured (SQL) queries orders of magnitude faster than popular database systems. To illustrate how FastBit is used in applications, we present three examples involving a high-energy physics experiment, a combustion simulation, and an accelerator simulation. In each case, FastBit significantly reduces the response time and enables interactive exploration on terabytes of data.
Fast Structural Search in Phylogenetic Databases
Directory of Open Access Journals (Sweden)
William H. Piel
2005-01-01
Full Text Available As the size of phylogenetic databases grows, the need for efficiently searching these databases arises. Thanks to previous and ongoing research, searching by attribute value and by text has become commonplace in these databases. However, searching by topological or physical structure, especially for large databases and especially for approximate matches, is still an art. We propose structural search techniques that, given a query or pattern tree P and a database of phylogenies D, find trees in D that are sufficiently close to P . The “closeness” is a measure of the topological relationships in P that are found to be the same or similar in a tree D in D. We develop a filtering technique that accelerates searches and present algorithms for rooted and unrooted trees where the trees can be weighted or unweighted. Experimental results on comparing the similarity measure with existing tree metrics and on evaluating the efficiency of the search techniques demonstrate that the proposed approach is promising
Fast exhaustive search for polynomial systems in F2
Bouillaguet, C.; Chen, H.-C.; Cheng, C.M.; Chou, T.; Niederhagen, R.F.; Shamir, A.; Yang, B.Y.
2010-01-01
Abstract. We analyze how fast we can solve general systems of multivariate equations of various low degrees over F2; this is a well known hard problem which is important both in itself and as part of many types of algebraic cryptanalysis. Compared to the standard exhaustive-search technique, our
Fast exhaustive search for polynomial systems in F2
Bouillaguet, C.; Chen, H.-C.; Cheng, C.M.; Chou, T.; Niederhagen, R.F.; Shamir, A.; Yang, B.Y.; Mangard, S.; Standaert, F.X.
2010-01-01
Abstract: We analyze how fast we can solve general systems of multivariate equations of various low degrees over $F_2$; this is a well known hard problem which is important both in itself and as part of many types of algebraic cryptanalysis. Compared to the standard exhaustive search technique, our
Fast radio burst search: cross spectrum vs. auto spectrum method
Liu, Lei; Zheng, Weimin; Yan, Zhen; Zhang, Juan
2018-06-01
The search for fast radio bursts (FRBs) is a hot topic in current radio astronomy studies. In this work, we carry out a single pulse search with a very long baseline interferometry (VLBI) pulsar observation data set using both auto spectrum and cross spectrum search methods. The cross spectrum method, first proposed in Liu et al., maximizes the signal power by fully utilizing the fringe phase information of the baseline cross spectrum. The auto spectrum search method is based on the popular pulsar software package PRESTO, which extracts single pulses from the auto spectrum of each station. According to our comparison, the cross spectrum method is able to enhance the signal power and therefore extract single pulses from data contaminated by high levels of radio frequency interference (RFI), which makes it possible to carry out a search for FRBs in regular VLBI observations when RFI is present.
Fast, Inclusive Searches for Geographic Names Using Digraphs
Donato, David I.
2008-01-01
An algorithm specifies how to quickly identify names that approximately match any specified name when searching a list or database of geographic names. Based on comparisons of the digraphs (ordered letter pairs) contained in geographic names, this algorithmic technique identifies approximately matching names by applying an artificial but useful measure of name similarity. A digraph index enables computer name searches that are carried out using this technique to be fast enough for deployment in a Web application. This technique, which is a member of the class of n-gram algorithms, is related to, but distinct from, the soundex, PHONIX, and metaphone phonetic algorithms. Despite this technique's tendency to return some counterintuitive approximate matches, it is an effective aid for fast, inclusive searches for geographic names when the exact name sought, or its correct spelling, is unknown.
Fast Multi-blind Modification Search through Tandem Mass Spectrometry*
Na, Seungjin; Bandeira, Nuno; Paek, Eunok
2012-01-01
With great biological interest in post-translational modifications (PTMs), various approaches have been introduced to identify PTMs using MS/MS. Recent developments for PTM identification have focused on an unrestrictive approach that searches MS/MS spectra for all known and possibly even unknown types of PTMs at once. However, the resulting expanded search space requires much longer search time and also increases the number of false positives (incorrect identifications) and false negatives (missed true identifications), thus creating a bottleneck in high throughput analysis. Here we introduce MODa, a novel “multi-blind” spectral alignment algorithm that allows for fast unrestrictive PTM searches with no limitation on the number of modifications per peptide while featuring over an order of magnitude speedup in relation to existing approaches. We demonstrate the sensitivity of MODa on human shotgun proteomics data where it reveals multiple mutations, a wide range of modifications (including glycosylation), and evidence for several putative novel modifications. Based on the reported findings, we argue that the efficiency and sensitivity of MODa make it the first unrestrictive search tool with the potential to fully replace conventional restrictive identification of proteomics mass spectrometry data. PMID:22186716
FAST MUSIC SPECTRUM PEAK SEARCH VIA METROPOLIS-HASTINGS SAMPLER
Institute of Scientific and Technical Information of China (English)
Guo Qinghua; Liao Guisheng
2005-01-01
A fast MUltiple SIgnal Classification (MUSIC) spectrum peak search algorithm is devised, which regards the power of the MUSIC spectrum function as target distribution up to a constant of proportionality, and uses Metropolis-Hastings (MH) sampler, one of the most popular Markov Chain Monte Carlo (MCMC) techniques, to sample from it. The proposed method reduces greatly the tremendous computation and storage costs in conventional MUSIC techniques i.e., about two and four orders of magnitude in computation and storage costs under the conditions of the experiment in the paper respectively.
Freud, Géza
1971-01-01
Orthogonal Polynomials contains an up-to-date survey of the general theory of orthogonal polynomials. It deals with the problem of polynomials and reveals that the sequence of these polynomials forms an orthogonal system with respect to a non-negative m-distribution defined on the real numerical axis. Comprised of five chapters, the book begins with the fundamental properties of orthogonal polynomials. After discussing the momentum problem, it then explains the quadrature procedure, the convergence theory, and G. Szegő's theory. This book is useful for those who intend to use it as referenc
Proposed University of California Berkeley fast pulsar search machine
International Nuclear Information System (INIS)
Kulkarni, S.R.; Backer, D.C.; Werthimer, D.; Heiles, C.
1984-01-01
With the discovery of 1937+21 by Backer et al. (1982) there is much renewed interest in an all sky survey for fast pulsars. University of California Berkeley has designed and is in the process of building an innovative and powerful, stand-alone, real-time, digital signal-processor to conduct an all sky survey for pulsars with rotation rates as high as 2000 Hz and dispersion measures less than 120 cm -3 pc at 800 MHz. The machine is anticipated to be completed in the Fall of 1985. The search technique consists of obtaining a 2-dimensional Fourier transform of the microwave signal. The transform is effected in two stages: a 64-channel, 3-level digital autocorrelator provides the radio frequency to delay transform and a fast 128K-point array processor effects the time to intensity fluctuation frequency transform. The use of a digital correlator allows flexibility in the choice of the observing radio frequency. Besides, the bandwidth is not fixed as in a multi-channel filter bank. In the machine, bandwidths can range from less than a MHz to 40 MHz. In the transform plane, the signature of a pulsar consists of harmonically related peaks which lie on a straight line which passes through the origin. The increased computational demand of a fast pulsar survey will be met by a combination of multi-CPU processing and pipeline design which involves a fast array processor and five commercial 68,000-based micro-processors. 6 references, 3 figures
Fast dictionary generation and searching for magnetic resonance fingerprinting.
Jun Xie; Mengye Lyu; Jian Zhang; Hui, Edward S; Wu, Ed X; Ze Wang
2017-07-01
A super-fast dictionary generation and searching (DGS) algorithm was developed for MR parameter quantification using magnetic resonance fingerprinting (MRF). MRF is a new technique for simultaneously quantifying multiple MR parameters using one temporally resolved MR scan. But it has a multiplicative computation complexity, resulting in a big burden of dictionary generating, saving, and retrieving, which can easily be intractable for any state-of-art computers. Based on retrospective analysis of the dictionary matching object function, a multi-scale ZOOM like DGS algorithm, dubbed as MRF-ZOOM, was proposed. MRF ZOOM is quasi-parameter-separable so the multiplicative computation complexity is broken into additive one. Evaluations showed that MRF ZOOM was hundreds or thousands of times faster than the original MRF parameter quantification method even without counting the dictionary generation time in. Using real data, it yielded nearly the same results as produced by the original method. MRF ZOOM provides a super-fast solution for MR parameter quantification.
ALFABURST: a commensal search for fast radio bursts with Arecibo
Foster, Griffin; Karastergiou, Aris; Golpayegani, Golnoosh; Surnis, Mayuresh; Lorimer, Duncan R.; Chennamangalam, Jayanth; McLaughlin, Maura; Armour, Wes; Cobb, Jeff; MacMahon, David H. E.; Pei, Xin; Rajwade, Kaustubh; Siemion, Andrew P. V.; Werthimer, Dan; Williams, Chris J.
2018-03-01
ALFABURST has been searching for fast radio bursts (FRBs) commensally with other projects using the Arecibo L-band Feed Array receiver at the Arecibo Observatory since 2015 July. We describe the observing system and report on the non-detection of any FRBs from that time until 2017 August for a total observing time of 518 h. With current FRB rate models, along with measurements of telescope sensitivity and beam size, we estimate that this survey probed redshifts out to about 3.4 with an effective survey volume of around 600 000 Mpc3. Based on this, we would expect, at the 99 per cent confidence level, to see at most two FRBs. We discuss the implications of this non-detection in the context of results from other telescopes and the limitation of our search pipeline. During the survey, single pulses from 17 known pulsars were detected. We also report the discovery of a Galactic radio transient with a pulse width of 3 ms and dispersion measure of 281 pc cm-3, which was detected while the telescope was slewing between fields.
A Fast Radio Burst Search Method for VLBI Observation
Liu, Lei; Tong, Fengxian; Zheng, Weimin; Zhang, Juan; Tong, Li
2018-02-01
We introduce the cross-spectrum-based fast radio burst (FRB) search method for Very Long Baseline Interferometer (VLBI) observation. This method optimizes the fringe fitting scheme in geodetic VLBI data post-processing, which fully utilizes the cross-spectrum fringe phase information and therefore maximizes the power of single-pulse signals. Working with cross-spectrum greatly reduces the effect of radio frequency interference compared with using auto-power spectrum. Single-pulse detection confidence increases by cross-identifying detections from multiple baselines. By combining the power of multiple baselines, we may improve the detection sensitivity. Our method is similar to that of coherent beam forming, but without the computational expense to form a great number of beams to cover the whole field of view of our telescopes. The data processing pipeline designed for this method is easy to implement and parallelize, which can be deployed in various kinds of VLBI observations. In particular, we point out that VGOS observations are very suitable for FRB search.
The search for advanced remote technology in fast reactor reprocessing
International Nuclear Information System (INIS)
Burch, W.D.; Herndon, J.N.; Stradley, J.G.
1990-01-01
Research and development in fast reactor reprocessing has been under way about 20 years in several countries throughout the world. During the past decade in France and the United Kingdom, active development programs have been carried out in breeder reprocessing. Actual fuels from their demonstration reactors have been reprocessed in small-scale facilities. Early US work in breeder reprocessing was carried out at the EBR-II facilities with the early metal fuels, and interest has renewed recently in metal fuels. A major, comprehensive program, focused on oxide fuels, has been carried out in the Consolidated Fuel Reprocessing Program (CFRP) at the Oak Ridge National Laboratory (ORNL) since 1974. Germany and Japan have also carried out development programs in breeder reprocessing, and Japan appears committed to major demonstration of breeder reactors and their fuel cycles. While much of the effort in all of these programs addressed process chemistry and process hardware, a significant element of many of these programs, particularly the CFRP, has been on advancements in facility concepts and remote maintenance features. This paper will focus principally on the search for improved facility concepts and better maintenance systems in the CFRP and, in turn, on how developments at ORNL have influenced the technology elsewhere
Combined multi-spectrum and orthogonal Laplacianfaces for fast CB-XLCT imaging with single-view data
Zhang, Haibo; Geng, Guohua; Chen, Yanrong; Qu, Xuan; Zhao, Fengjun; Hou, Yuqing; Yi, Huangjian; He, Xiaowei
2017-12-01
Cone-beam X-ray luminescence computed tomography (CB-XLCT) is an attractive hybrid imaging modality, which has the potential of monitoring the metabolic processes of nanophosphors-based drugs in vivo. Single-view data reconstruction as a key issue of CB-XLCT imaging promotes the effective study of dynamic XLCT imaging. However, it suffers from serious ill-posedness in the inverse problem. In this paper, a multi-spectrum strategy is adopted to relieve the ill-posedness of reconstruction. The strategy is based on the third-order simplified spherical harmonic approximation model. Then, an orthogonal Laplacianfaces-based method is proposed to reduce the large computational burden without degrading the imaging quality. Both simulated data and in vivo experimental data were used to evaluate the efficiency and robustness of the proposed method. The results are satisfactory in terms of both location and quantitative recovering with computational efficiency, indicating that the proposed method is practical and promising for single-view CB-XLCT imaging.
A novel directional asymmetric sampling search algorithm for fast block-matching motion estimation
Li, Yue-e.; Wang, Qiang
2011-11-01
This paper proposes a novel directional asymmetric sampling search (DASS) algorithm for video compression. Making full use of the error information (block distortions) of the search patterns, eight different direction search patterns are designed for various situations. The strategy of local sampling search is employed for the search of big-motion vector. In order to further speed up the search, early termination strategy is adopted in procedure of DASS. Compared to conventional fast algorithms, the proposed method has the most satisfactory PSNR values for all test sequences.
Extracting Structure from Optical Flow Using the Fast Error Search Technique
National Research Council Canada - National Science Library
Srinivasan, Sridar
1998-01-01
...) of an optical flow field, using fast partial search. For each candidate location on a discrete sampling of the image area, we generate a linear system of equations for determining the remaining unknowns, viz...
Fast Search and Adaptive Resolution for Complex Particle Kinetics
Larson, David J.
2005-10-01
A new plasma simulation algorithm, intended to bridge the gap between Eulerian fluid and kinetic regimes, is now being used for a variety of applications in ICF and weapon effects. The CPK method (Complex Particle Kinetic) concept [1] uses an ensemble of macro-particles with a Gaussian spatial profile and a Mawellian velocity distribution to represent particle distributions in phase space. Time evolution is modeled by a combination of Lagrangian motion and internal evolution within each individual macro-particle. Collisional particle-particle interactions [2] are facilitated by sorting particles into bins depending of the particle size. Different bin levels are connected by a linked list. Searching for neighboring particles is highly efficient because the search is limited to particles in neighboring bins with the possibility of interaction. The bin structure also allows the computation of various spatial moments at different resolutions. Combining the results of the moment calculations yields information on where and when increased resolution is necessary. We will present details of the particle binning process along with progress towards our goal of simulating the transition from continuum to fully kinetic physics. [1] D. W. Hewett, J. Comp. Phys. 189 (2003). [2] D. J. Larson, J. Comp. Phys. 188 (2003).
Fast and accurate protein substructure searching with simulated annealing and GPUs
Directory of Open Access Journals (Sweden)
Stivala Alex D
2010-09-01
Full Text Available Abstract Background Searching a database of protein structures for matches to a query structure, or occurrences of a structural motif, is an important task in structural biology and bioinformatics. While there are many existing methods for structural similarity searching, faster and more accurate approaches are still required, and few current methods are capable of substructure (motif searching. Results We developed an improved heuristic for tableau-based protein structure and substructure searching using simulated annealing, that is as fast or faster and comparable in accuracy, with some widely used existing methods. Furthermore, we created a parallel implementation on a modern graphics processing unit (GPU. Conclusions The GPU implementation achieves up to 34 times speedup over the CPU implementation of tableau-based structure search with simulated annealing, making it one of the fastest available methods. To the best of our knowledge, this is the first application of a GPU to the protein structural search problem.
Lee, Feifei; Kotani, Koji; Chen, Qiu; Ohmi, Tadahiro
2010-02-01
In this paper, a fast search algorithm for MPEG-4 video clips from video database is proposed. An adjacent pixel intensity difference quantization (APIDQ) histogram is utilized as the feature vector of VOP (video object plane), which had been reliably applied to human face recognition previously. Instead of fully decompressed video sequence, partially decoded data, namely DC sequence of the video object are extracted from the video sequence. Combined with active search, a temporal pruning algorithm, fast and robust video search can be realized. The proposed search algorithm has been evaluated by total 15 hours of video contained of TV programs such as drama, talk, news, etc. to search for given 200 MPEG-4 video clips which each length is 15 seconds. Experimental results show the proposed algorithm can detect the similar video clip in merely 80ms, and Equal Error Rate (ERR) of 2 % in drama and news categories are achieved, which are more accurately and robust than conventional fast video search algorithm.
Fisher, Ryan Patrick; Hughey, Brennan; Howell, Eric; LIGO Collaboration
2018-01-01
Although Fast Radio Bursts (FRB) are being detected with increasing frequency, their progenitor systems are still mostly a mystery. We present the plan to conduct targeted searches for gravitational-wave counterparts to these FRB events in the data from the first and second observing runs of the Advanced Laser Interferometer Gravitational-wave Observatory (LIGO).
Clustering Mixed Data by Fast Search and Find of Density Peaks
Directory of Open Access Journals (Sweden)
Shihua Liu
2017-01-01
Full Text Available Aiming at the mixed data composed of numerical and categorical attributes, a new unified dissimilarity metric is proposed, and based on that a new clustering algorithm is also proposed. The experiment result shows that this new method of clustering mixed data by fast search and find of density peaks is feasible and effective on the UCI datasets.
Improving GPU-accelerated adaptive IDW interpolation algorithm using fast kNN search.
Mei, Gang; Xu, Nengxiong; Xu, Liangliang
2016-01-01
This paper presents an efficient parallel Adaptive Inverse Distance Weighting (AIDW) interpolation algorithm on modern Graphics Processing Unit (GPU). The presented algorithm is an improvement of our previous GPU-accelerated AIDW algorithm by adopting fast k-nearest neighbors (kNN) search. In AIDW, it needs to find several nearest neighboring data points for each interpolated point to adaptively determine the power parameter; and then the desired prediction value of the interpolated point is obtained by weighted interpolating using the power parameter. In this work, we develop a fast kNN search approach based on the space-partitioning data structure, even grid, to improve the previous GPU-accelerated AIDW algorithm. The improved algorithm is composed of the stages of kNN search and weighted interpolating. To evaluate the performance of the improved algorithm, we perform five groups of experimental tests. The experimental results indicate: (1) the improved algorithm can achieve a speedup of up to 1017 over the corresponding serial algorithm; (2) the improved algorithm is at least two times faster than our previous GPU-accelerated AIDW algorithm; and (3) the utilization of fast kNN search can significantly improve the computational efficiency of the entire GPU-accelerated AIDW algorithm.
Generalizations of orthogonal polynomials
Bultheel, A.; Cuyt, A.; van Assche, W.; van Barel, M.; Verdonk, B.
2005-07-01
We give a survey of recent generalizations of orthogonal polynomials. That includes multidimensional (matrix and vector orthogonal polynomials) and multivariate versions, multipole (orthogonal rational functions) variants, and extensions of the orthogonality conditions (multiple orthogonality). Most of these generalizations are inspired by the applications in which they are applied. We also give a glimpse of these applications, which are usually generalizations of applications where classical orthogonal polynomials also play a fundamental role: moment problems, numerical quadrature, rational approximation, linear algebra, recurrence relations, and random matrices.
A theoty of fast search for feul loading pattern in lWRs
International Nuclear Information System (INIS)
Suo Changan
1990-01-01
In order to fast search for fuel loading pattern without trial and error, a theory for predicting in-core reactivity distribution, according to power necessity and available assemblies, has been developed on basis of the fast computing nodal method and two group diffusion theory. In that, the fast group flux distribution can be predicted from power necessity and the approximation of fast group constants to be independent of nodes. Then, the thermal group fluxes are expressed by both known powers and predicted fast fluxes. After replacing thermal flux, the thermal diffusion equations turn into some equations that have only unknown group constants. The unknown constants are expressed approximately by making use of some expansions of infinite multiplication factors of available assemblies. In such a way, the non-linear reactivity equations are developed and then solved, where node reactivities are the only unknown physical quantities, Finally, the loading pattern is obtained by setting some of available assemblies at each node location where corresponds to a closest reactivity of between laid assembly and node. A computer code LOADMP based on the theory has been made. The theory has been tested numerically on IAEA benchmark problem, and gives an accurate prediction of reactivity distribution and loading pattern. The CPU-time for making a loading pattern search is saved very much, about one second on the CYPER-825/170 machine
Fast parallel tandem mass spectral library searching using GPU hardware acceleration.
Baumgardner, Lydia Ashleigh; Shanmugam, Avinash Kumar; Lam, Henry; Eng, Jimmy K; Martin, Daniel B
2011-06-03
Mass spectrometry-based proteomics is a maturing discipline of biologic research that is experiencing substantial growth. Instrumentation has steadily improved over time with the advent of faster and more sensitive instruments collecting ever larger data files. Consequently, the computational process of matching a peptide fragmentation pattern to its sequence, traditionally accomplished by sequence database searching and more recently also by spectral library searching, has become a bottleneck in many mass spectrometry experiments. In both of these methods, the main rate-limiting step is the comparison of an acquired spectrum with all potential matches from a spectral library or sequence database. This is a highly parallelizable process because the core computational element can be represented as a simple but arithmetically intense multiplication of two vectors. In this paper, we present a proof of concept project taking advantage of the massively parallel computing available on graphics processing units (GPUs) to distribute and accelerate the process of spectral assignment using spectral library searching. This program, which we have named FastPaSS (for Fast Parallelized Spectral Searching), is implemented in CUDA (Compute Unified Device Architecture) from NVIDIA, which allows direct access to the processors in an NVIDIA GPU. Our efforts demonstrate the feasibility of GPU computing for spectral assignment, through implementation of the validated spectral searching algorithm SpectraST in the CUDA environment.
FPS-RAM: Fast Prefix Search RAM-Based Hardware for Forwarding Engine
Zaitsu, Kazuya; Yamamoto, Koji; Kuroda, Yasuto; Inoue, Kazunari; Ata, Shingo; Oka, Ikuo
Ternary content addressable memory (TCAM) is becoming very popular for designing high-throughput forwarding engines on routers. However, TCAM has potential problems in terms of hardware and power costs, which limits its ability to deploy large amounts of capacity in IP routers. In this paper, we propose new hardware architecture for fast forwarding engines, called fast prefix search RAM-based hardware (FPS-RAM). We designed FPS-RAM hardware with the intent of maintaining the same search performance and physical user interface as TCAM because our objective is to replace the TCAM in the market. Our RAM-based hardware architecture is completely different from that of TCAM and has dramatically reduced the costs and power consumption to 62% and 52%, respectively. We implemented FPS-RAM on an FPGA to examine its lookup operation.
A Search for Fast Moving Magnetic Monopoles with the MACRO Detector
Liu, Rongzhi
1995-01-01
From Dirac monopole theory to modern GUT's (Grand Unified Theories), magnetic monopoles have attracted much attention from physicists. While Dirac had demonstrated the consistency of magnetic monopoles with quantum eletrodynamics, 't Hooft and Polyakov demonstrated the necessity of monopoles in GUT's. Furthermore, the GUT's supply more clues about magnetic monopoles, including their exceptionally heavy masses ~ 10^{16 } GeV. Both current theories and previous monopole experiments have suggested that the flux of magnetic monopoles is likely to be very small, so it is necessary to have a large area detector to search for them. This thesis presents a search for fast moving magnetic monopoles with the MACRO detector. The MACRO detector is a large underground detector located at Gran Sasso, Italy. Its primary goal is to search for magnetic monopoles at a flux level beyond the Parker bound. It is underground at 3,000 meters water equivalent depth, with a nominal acceptance of 10,000 m^2 sr. It employs liquid scintillator counters, streamer tubes and track-etch detectors which can supply both independent and cross checks for fast monopole candidate events. This search is mainly based on the liquid scintillator counters with primary event selection and energy reconstruction from the ERP system. The 6.2 mus trigger time is based on the time of flight of a fast moving monopole diagonally through one supermodule with a velocity ~ 10^{-2}c. The search uses the "six-month-run" data which were taken from December of 1992 to July of 1993 with the operation of the lower part of the detector. With energy reconstruction ability up to 8 GeV with 22% error, we apply a double-face high energy requirement to reject most muon events from the data sample. We then apply the WFD, streamer tube and strip information to reject non-monopole events. The live time for this analysis is 5,300 hours, with acceptance of 4050 m^2 sr. With no fast monopole candidate event found, we establish an upper
A fast search strategy for gravitational waves from low-mass x-ray binaries
International Nuclear Information System (INIS)
Messenger, C; Woan, G
2007-01-01
We present a new type of search strategy designed specifically to find continuously emitting gravitational wave sources in known binary systems. A component of this strategy is based on the incoherent summation of frequency-modulated binary signal sidebands, a method previously employed in the detection of electromagnetic pulsar signals from radio observations. The search pipeline can be divided into three stages: the first is a wide bandwidth, F-statistic search demodulated for sky position. This is followed by a fast second stage in which areas in frequency space are identified as signal candidates through the frequency domain convolution of the F-statistic with an approximate signal template. For this second stage only precise information on the orbit period and approximate information on the orbital semi-major axis are required a priori. For the final stage we propose a fully coherent Markov chain Monte Carlo based follow-up search on the frequency subspace defined by the candidates identified by the second stage. This search is particularly suited to the low-mass x-ray binaries, for which orbital period and sky position are typically well known and additional orbital parameters and neutron star spin frequency are not. We note that for the accreting x-ray millisecond pulsars, for which spin frequency and orbital parameters are well known, the second stage can be omitted and the fully coherent search stage can be performed. We describe the search pipeline with respect to its application to a simplified phase model and derive the corresponding sensitivity of the search
A Fast Framework for Abrupt Change Detection Based on Binary Search Trees and Kolmogorov Statistic
Qi, Jin-Peng; Qi, Jie; Zhang, Qing
2016-01-01
Change-Point (CP) detection has attracted considerable attention in the fields of data mining and statistics; it is very meaningful to discuss how to quickly and efficiently detect abrupt change from large-scale bioelectric signals. Currently, most of the existing methods, like Kolmogorov-Smirnov (KS) statistic and so forth, are time-consuming, especially for large-scale datasets. In this paper, we propose a fast framework for abrupt change detection based on binary search trees (BSTs) and a modified KS statistic, named BSTKS (binary search trees and Kolmogorov statistic). In this method, first, two binary search trees, termed as BSTcA and BSTcD, are constructed by multilevel Haar Wavelet Transform (HWT); second, three search criteria are introduced in terms of the statistic and variance fluctuations in the diagnosed time series; last, an optimal search path is detected from the root to leaf nodes of two BSTs. The studies on both the synthetic time series samples and the real electroencephalograph (EEG) recordings indicate that the proposed BSTKS can detect abrupt change more quickly and efficiently than KS, t-statistic (t), and Singular-Spectrum Analyses (SSA) methods, with the shortest computation time, the highest hit rate, the smallest error, and the highest accuracy out of four methods. This study suggests that the proposed BSTKS is very helpful for useful information inspection on all kinds of bioelectric time series signals. PMID:27413364
A Fast Framework for Abrupt Change Detection Based on Binary Search Trees and Kolmogorov Statistic.
Qi, Jin-Peng; Qi, Jie; Zhang, Qing
2016-01-01
Change-Point (CP) detection has attracted considerable attention in the fields of data mining and statistics; it is very meaningful to discuss how to quickly and efficiently detect abrupt change from large-scale bioelectric signals. Currently, most of the existing methods, like Kolmogorov-Smirnov (KS) statistic and so forth, are time-consuming, especially for large-scale datasets. In this paper, we propose a fast framework for abrupt change detection based on binary search trees (BSTs) and a modified KS statistic, named BSTKS (binary search trees and Kolmogorov statistic). In this method, first, two binary search trees, termed as BSTcA and BSTcD, are constructed by multilevel Haar Wavelet Transform (HWT); second, three search criteria are introduced in terms of the statistic and variance fluctuations in the diagnosed time series; last, an optimal search path is detected from the root to leaf nodes of two BSTs. The studies on both the synthetic time series samples and the real electroencephalograph (EEG) recordings indicate that the proposed BSTKS can detect abrupt change more quickly and efficiently than KS, t-statistic (t), and Singular-Spectrum Analyses (SSA) methods, with the shortest computation time, the highest hit rate, the smallest error, and the highest accuracy out of four methods. This study suggests that the proposed BSTKS is very helpful for useful information inspection on all kinds of bioelectric time series signals.
SAD PROCESSOR FOR MULTIPLE MACROBLOCK MATCHING IN FAST SEARCH VIDEO MOTION ESTIMATION
Directory of Open Access Journals (Sweden)
Nehal N. Shah
2015-02-01
Full Text Available Motion estimation is a very important but computationally complex task in video coding. Process of determining motion vectors based on the temporal correlation of consecutive frame is used for video compression. In order to reduce the computational complexity of motion estimation and maintain the quality of encoding during motion compensation, different fast search techniques are available. These block based motion estimation algorithms use the sum of absolute difference (SAD between corresponding macroblock in current frame and all the candidate macroblocks in the reference frame to identify best match. Existing implementations can perform SAD between two blocks using sequential or pipeline approach but performing multi operand SAD in single clock cycle with optimized recourses is state of art. In this paper various parallel architectures for computation of the fixed block size SAD is evaluated and fast parallel SAD architecture is proposed with optimized resources. Further SAD processor is described with 9 processing elements which can be configured for any existing fast search block matching algorithm. Proposed SAD processor consumes 7% fewer adders compared to existing implementation for one processing elements. Using nine PE it can process 84 HD frames per second in worse case which is good outcome for real time implementation. In average case architecture process 325 HD frames per second.
Algorithms for searching Fast radio bursts and pulsars in tight binary systems.
Zackay, Barak
2017-01-01
Fast radio bursts (FRB's) are an exciting, recently discovered, astrophysical transients which their origins are unknown.Currently, these bursts are believed to be coming from cosmological distances, allowing us to probe the electron content on cosmological length scales. Even though their precise localization is crucial for the determination of their origin, radio interferometers were not extensively employed in searching for them due to computational limitations.I will briefly present the Fast Dispersion Measure Transform (FDMT) algorithm,that allows to reduce the operation count in blind incoherent dedispersion by 2-3 orders of magnitude.In addition, FDMT enables to probe the unexplored domain of sub-microsecond astrophysical pulses.Pulsars in tight binary systems are among the most important astrophysical objects as they provide us our best tests of general relativity in the strong field regime.I will provide a preview to a novel algorithm that enables the detection of pulsars in short binary systems using observation times longer than an orbital period.Current pulsar search programs limit their searches for integration times shorter than a few percents of the orbital period.Until now, searching for pulsars in binary systems using observation times longer than an orbital period was considered impossible as one has to blindly enumerate all options for the Keplerian parameters, the pulsar rotation period, and the unknown DM.Using the current state of the art pulsar search techniques and all computers on the earth, such an enumeration would take longer than a Hubble time. I will demonstrate that using the new algorithm, it is possible to conduct such an enumeration on a laptop using real data of the double pulsar PSR J0737-3039.Among the other applications of this algorithm are:1) Searching for all pulsars on all sky positions in gamma ray observations of the Fermi LAT satellite.2) Blind searching for continuous gravitational wave sources emitted by pulsars with
International Nuclear Information System (INIS)
Trott, Cathryn M.; Tingay, Steven J.; Wayth, Randall B.; Macquart, Jean-Pierre R.; Palaniswamy, Divya; Thompson, David R.; Wagstaff, Kiri L.; Majid, Walid A.; Burke-Spolaor, Sarah; Deller, Adam T.; Brisken, Walter F.
2013-01-01
We define a framework for determining constraints on the detection rate of fast transient events from a population of underlying sources, with a view to incorporate beam shape, frequency effects, scattering effects, and detection efficiency into the metric. We then demonstrate a method for combining independent data sets into a single event rate constraint diagram, using a probabilistic approach to the limits on parameter space. We apply this new framework to present the latest results from the V-FASTR experiment, a commensal fast transients search using the Very Long Baseline Array (VLBA). In the 20 cm band, V-FASTR now has the ability to probe the regions of parameter space of importance for the observed Lorimer and Keane fast radio transient candidates by combining the information from observations with differing bandwidths, and properly accounting for the source dispersion measure, VLBA antenna beam shape, experiment time sampling, and stochastic nature of events. We then apply the framework to combine the results of the V-FASTR and Allen Telescope Array Fly's Eye experiments, demonstrating their complementarity. Expectations for fast transients experiments for the SKA Phase I dish array are then computed, and the impact of large differential bandwidths is discussed.
A fast tomographic method for searching the minimum free energy path
International Nuclear Information System (INIS)
Chen, Changjun; Huang, Yanzhao; Xiao, Yi; Jiang, Xuewei
2014-01-01
Minimum Free Energy Path (MFEP) provides a lot of important information about the chemical reactions, like the free energy barrier, the location of the transition state, and the relative stability between reactant and product. With MFEP, one can study the mechanisms of the reaction in an efficient way. Due to a large number of degrees of freedom, searching the MFEP is a very time-consuming process. Here, we present a fast tomographic method to perform the search. Our approach first calculates the free energy surfaces in a sequence of hyperplanes perpendicular to a transition path. Based on an objective function and the free energy gradient, the transition path is optimized in the collective variable space iteratively. Applications of the present method to model systems show that our method is practical. It can be an alternative approach for finding the state-to-state MFEP
In Silico PCR Tools for a Fast Primer, Probe, and Advanced Searching.
Kalendar, Ruslan; Muterko, Alexandr; Shamekova, Malika; Zhambakin, Kabyl
2017-01-01
The polymerase chain reaction (PCR) is fundamental to molecular biology and is the most important practical molecular technique for the research laboratory. The principle of this technique has been further used and applied in plenty of other simple or complex nucleic acid amplification technologies (NAAT). In parallel to laboratory "wet bench" experiments for nucleic acid amplification technologies, in silico or virtual (bioinformatics) approaches have been developed, among which in silico PCR analysis. In silico NAAT analysis is a useful and efficient complementary method to ensure the specificity of primers or probes for an extensive range of PCR applications from homology gene discovery, molecular diagnosis, DNA fingerprinting, and repeat searching. Predicting sensitivity and specificity of primers and probes requires a search to determine whether they match a database with an optimal number of mismatches, similarity, and stability. In the development of in silico bioinformatics tools for nucleic acid amplification technologies, the prospects for the development of new NAAT or similar approaches should be taken into account, including forward-looking and comprehensive analysis that is not limited to only one PCR technique variant. The software FastPCR and the online Java web tool are integrated tools for in silico PCR of linear and circular DNA, multiple primer or probe searches in large or small databases and for advanced search. These tools are suitable for processing of batch files that are essential for automation when working with large amounts of data. The FastPCR software is available for download at http://primerdigital.com/fastpcr.html and the online Java version at http://primerdigital.com/tools/pcr.html .
Tree decomposition based fast search of RNA structures including pseudoknots in genomes.
Song, Yinglei; Liu, Chunmei; Malmberg, Russell; Pan, Fangfang; Cai, Liming
2005-01-01
Searching genomes for RNA secondary structure with computational methods has become an important approach to the annotation of non-coding RNAs. However, due to the lack of efficient algorithms for accurate RNA structure-sequence alignment, computer programs capable of fast and effectively searching genomes for RNA secondary structures have not been available. In this paper, a novel RNA structure profiling model is introduced based on the notion of a conformational graph to specify the consensus structure of an RNA family. Tree decomposition yields a small tree width t for such conformation graphs (e.g., t = 2 for stem loops and only a slight increase for pseudo-knots). Within this modelling framework, the optimal alignment of a sequence to the structure model corresponds to finding a maximum valued isomorphic subgraph and consequently can be accomplished through dynamic programming on the tree decomposition of the conformational graph in time O(k(t)N(2)), where k is a small parameter; and N is the size of the projiled RNA structure. Experiments show that the application of the alignment algorithm to search in genomes yields the same search accuracy as methods based on a Covariance model with a significant reduction in computation time. In particular; very accurate searches of tmRNAs in bacteria genomes and of telomerase RNAs in yeast genomes can be accomplished in days, as opposed to months required by other methods. The tree decomposition based searching tool is free upon request and can be downloaded at our site h t t p ://w.uga.edu/RNA-informatics/software/index.php.
Fast Optimal Replica Placement with Exhaustive Search Using Dynamically Reconfigurable Processor
Directory of Open Access Journals (Sweden)
Hidetoshi Takeshita
2011-01-01
Full Text Available This paper proposes a new replica placement algorithm that expands the exhaustive search limit with reasonable calculation time. It combines a new type of parallel data-flow processor with an architecture tuned for fast calculation. The replica placement problem is to find a replica-server set satisfying service constraints in a content delivery network (CDN. It is derived from the set cover problem which is known to be NP-hard. It is impractical to use exhaustive search to obtain optimal replica placement in large-scale networks, because calculation time increases with the number of combinations. To reduce calculation time, heuristic algorithms have been proposed, but it is known that no heuristic algorithm is assured of finding the optimal solution. The proposed algorithm suits parallel processing and pipeline execution and is implemented on DAPDNA-2, a dynamically reconfigurable processor. Experiments show that the proposed algorithm expands the exhaustive search limit by the factor of 18.8 compared to the conventional algorithm search limit running on a Neumann-type processor.
Exploiting Semantic Search Methodologies to Analyse Fast Nuclear Reactor Nuclear Related Information
International Nuclear Information System (INIS)
Costantini, L.
2016-01-01
Full text: This paper describes an experiment to evaluate the outcomes of using the semantic search engine together with the entity extraction approach and the visualisation tools in large set of nuclear data related to fast nuclear reactors (FNR) documents originated from INIS database and the IAEA web publication. The INIS database has been used because is the larger collection of nuclear related data and a sub-set of it can be utilised to verify the efficiency and the effectiveness of this approach. In a nutshell, the goal of the study was to: 1) find and monitor documents dealing with FNR; 2) building knowledge base (KB) according to the FNR nuclear components and populate the KB with relevant documents; 3) communicate the conclusion of the analysis by utilising visualisation tools. The semantic search engine used in the case study has the capability to perform what is called evidential reasoning: accruing, weighing and evaluating the evidence to determinate a mathematical score for each article that measures its relevance to the subject of interest. This approach provides a means to differentiate between articles that closely meet the search criteria versus those less relevant articles. Tovek software platform was chosen for this case study. (author
A combined analysis technique for the search for fast magnetic monopoles with the MACRO detector
Ambrosio, M; Auriemma, G; Bakari, D; Baldini, A; Barbarino, G C; Barish, B C; Battistoni, G; Becherini, Y; Bellotti, R; Bemporad, C; Bernardini, P; Bilokon, H; Bloise, C; Bower, C; Brigida, M; Bussino, S; Cafagna, F; Calicchio, M; Campana, D; Carboni, M; Caruso, R; Cecchini, S; Cei, F; Chiarella, V; Choudhary, B C; Coutu, S; De Cataldo, G; Dekhissi, H; De Marzo, C; De Mitri, I; Derkaoui, J E; De Vincenzi, M; Di Credico, A; Erriquez, O; Favuzzi, C; Forti, C; Fusco, P; Giacomelli, G; Giannini, G; Giglietto, N; Giorgini, M; Grassi, M; Grillo, A; Guarino, F; Gustavino, C; Habig, A; Heinz, R; Iarocci, E; Katsavounidis, E; Katsavounidis, I; Kearns, E; Kim, H; Kyriazopoulou, S; Lamanna, E; Lane, C; Levin, D S; Lipari, P; Longley, N P; Longo, M J; Loparco, F; Maaroufi, F; Mancarella, G; Mandrioli, G; Manzoor, S; Margiotta, A; Marini, A; Martello, D; Marzari-Chiesa, A; Mazziotta, M N; Michael, D G; Monacelli, P; Montaruli, T; Monteno, M; Mufson, S L; Musser, J; Nicolò, D; Nolty, R; Orth, C; Osteria, G; Palamara, O; Patera, V; Patrizii, L; Pazzi, R; Peck, C W; Perrone, L; Petrera, S; Popa, V; Reynoldson, J; Ronga, F; Rrhioua, A; Satriano, C; Scapparone, E; Scholberg, K; Sciubba, A; Serra, P; Sioli, M; Sirri, G; Sitta, M; Spinelli, P; Spinetti, M; Spurio, M; Steinberg, R; Stone, J L; Sulak, L R; Surdo, A; Tarle, G; Togo, V; Vakili, M; Walter, C W; Webb, R
2002-01-01
We describe a search method for fast moving ( beta = v/c > 5 * 10/sup -3/) magnetic monopoles using simultaneously the scintillator, streamer tube and track-etch subdetectors of the MACRO apparatus. The first two subdetectors are used primarily for the identification of candidates while the track-etch one is used as the final tool for their rejection or confirmation. Using this technique, a first sample of more than two years of data has been analyzed without any evidence of a magnetic monopole. We set a 90% CL upper limit to the local monopole flux of 1.5 * 10/sup -15/ cm/sup -2/s/sup -1/sr/sup -1/ in the velocity range 5 * 10/sup -3/
A Search for Neutrinos from Fast Radio Bursts with IceCube
International Nuclear Information System (INIS)
Fahey, Samuel; Kheirandish, Ali; Vandenbroucke, Justin; Xu, Donglian
2017-01-01
We present a search for neutrinos in coincidence in time and direction with four fast radio bursts (FRBs) detected by the Parkes and Green Bank radio telescopes during the first year of operation of the complete IceCube Neutrino Observatory (2011 May through 2012 May). The neutrino sample consists of 138,322 muon neutrino candidate events, which are dominated by atmospheric neutrinos and atmospheric muons but also contain an astrophysical neutrino component. Considering only neutrinos detected on the same day as each FRB, zero IceCube events were found to be compatible with the FRB directions within the estimated 99% error radius of the neutrino directions. Based on the non-detection, we present the first upper limits on the neutrino fluence from FRBs.
A Search for Neutrinos from Fast Radio Bursts with IceCube
Energy Technology Data Exchange (ETDEWEB)
Fahey, Samuel; Kheirandish, Ali; Vandenbroucke, Justin; Xu, Donglian, E-mail: justin.vandenbroucke@wisc.edu [Wisconsin IceCube Particle Astrophysics Center and Department of Physics, University of Wisconsin, Madison, WI 53706 (United States)
2017-08-10
We present a search for neutrinos in coincidence in time and direction with four fast radio bursts (FRBs) detected by the Parkes and Green Bank radio telescopes during the first year of operation of the complete IceCube Neutrino Observatory (2011 May through 2012 May). The neutrino sample consists of 138,322 muon neutrino candidate events, which are dominated by atmospheric neutrinos and atmospheric muons but also contain an astrophysical neutrino component. Considering only neutrinos detected on the same day as each FRB, zero IceCube events were found to be compatible with the FRB directions within the estimated 99% error radius of the neutrino directions. Based on the non-detection, we present the first upper limits on the neutrino fluence from FRBs.
Simultaneous orthogonal plane imaging.
Mickevicius, Nikolai J; Paulson, Eric S
2017-11-01
Intrafraction motion can result in a smearing of planned external beam radiation therapy dose distributions, resulting in an uncertainty in dose actually deposited in tissue. The purpose of this paper is to present a pulse sequence that is capable of imaging a moving target at a high frame rate in two orthogonal planes simultaneously for MR-guided radiotherapy. By balancing the zero gradient moment on all axes, slices in two orthogonal planes may be spatially encoded simultaneously. The orthogonal slice groups may be acquired with equal or nonequal echo times. A Cartesian spoiled gradient echo simultaneous orthogonal plane imaging (SOPI) sequence was tested in phantom and in vivo. Multiplexed SOPI acquisitions were performed in which two parallel slices were imaged along two orthogonal axes simultaneously. An autocalibrating phase-constrained 2D-SENSE-GRAPPA (generalized autocalibrating partially parallel acquisition) algorithm was implemented to reconstruct the multiplexed data. SOPI images without intraslice motion artifacts were reconstructed at a maximum frame rate of 8.16 Hz. The 2D-SENSE-GRAPPA reconstruction separated the parallel slices aliased along each orthogonal axis. The high spatiotemporal resolution provided by SOPI has the potential to be beneficial for intrafraction motion management during MR-guided radiation therapy or other MRI-guided interventions. Magn Reson Med 78:1700-1710, 2017. © 2016 International Society for Magnetic Resonance in Medicine. © 2016 International Society for Magnetic Resonance in Medicine.
Orthogonality and Dimensionality
Directory of Open Access Journals (Sweden)
Olivier Brunet
2013-12-01
Full Text Available In this article, we present what we believe to be a simple way to motivate the use of Hilbert spaces in quantum mechanics. To achieve this, we study the way the notion of dimension can, at a very primitive level, be defined as the cardinality of a maximal collection of mutually orthogonal elements (which, for instance, can be seen as spatial directions. Following this idea, we develop a formalism based on two basic ingredients, namely an orthogonality relation and matroids which are a very generic algebraic structure permitting to define a notion of dimension. Having obtained what we call orthomatroids, we then show that, in high enough dimension, the basic constituants of orthomatroids (more precisely the simple and irreducible ones are isomorphic to generalized Hilbert lattices, so that their presence is a direct consequence of an orthogonality-based characterization of dimension.
A search for fast radio bursts associated with gamma-ray bursts
International Nuclear Information System (INIS)
Palaniswamy, Divya; Wayth, Randall B.; Trott, Cathryn M.; Tingay, Steven J.; Reynolds, Cormac; McCallum, Jamie N.
2014-01-01
The detection of seven fast radio bursts (FRBs) has recently been reported. FRBs are short duration (∼1 ms), highly dispersed radio pulses from astronomical sources. The physical interpretation for the FRBs remains unclear but is thought to involve highly compact objects at cosmological distance. It has been suggested that a fraction of FRBs could be physically associated with gamma-ray bursts (GRBs). Recent radio observations of GRBs have reported the detection of two highly dispersed short duration radio pulses using a 12 m radio telescope at 1.4 GHz. Motivated by this result, we have performed a systematic and sensitive search for FRBs associated with GRBs. We have observed five GRBs at 2.3 GHz using a 26 m radio telescope located at the Mount Pleasant Radio Observatory, Hobart. The radio telescope was automated to rapidly respond to Gamma-ray Coordination Network notifications from the Swift satellite and slew to the GRB position within ∼140 s. The data were searched for pulses up to 5000 pc cm –3 in dispersion measure and pulse widths ranging from 640 μs to 25.60 ms. We did not detect any events ≥6σ. An in depth statistical analysis of our data shows that events detected above 5σ are consistent with thermal noise fluctuations only. A joint analysis of our data with previous experiments shows that previously claimed detections of FRBs from GRBs are unlikely to be astrophysical. Our results are in line with the lack of consistency noted between the recently presented FRB event rates and GRB event rates.
A Search for High-Energy Counterparts to Fast Radio Bursts
Cunningham, Virginia A.; Cenko, Bradley
2018-01-01
We report on a search for high-energy counterparts to Fast Radio Bursts (FRBs) with the Fermi Gamma-ray Burst Monitor (GBM), Fermi Large Area Telescope (LAT), and the Swift Burst Alert Telescope (BAT). We find no significant associations for any of the 14 FRBs in our sample, but report upper limits to the high-energy fluence for each on timescales of ∼0.1, 1, 10, and 100 s. We report lower limits on the radio to high-energy fluence, fr / fγ, for timescales of ∼0.1 and 100 s. The non-detection of high-energy emission is expected if FRBs are analogous to the giant pulses seen from the Crab pulsar, but the observed radio fluences of FRBs are orders of magnitude larger than even the most extreme giant pulses would be at the implied cosmological distances. It has also been proposed that events similar to magnetar hyperflares produce FRBs; this might be a viable model, but our fr / fγ lower limits are in tension with the fr / fγ upper limit for the 2004 superburst of SGR 1806‑20, for 6 out of the 12 FRBs that we study. This demonstrates the utility of analyses of high-energy data for FRBs in tracking down the nature of these elusive sources.
A search for optical bursts from the repeating fast radio burst FRB 121102
Hardy, L. K.; Dhillon, V. S.; Spitler, L. G.; Littlefair, S. P.; Ashley, R. P.; De Cia, A.; Green, M. J.; Jaroenjittichai, P.; Keane, E. F.; Kerry, P.; Kramer, M.; Malesani, D.; Marsh, T. R.; Parsons, S. G.; Possenti, A.; Rattanasoon, S.; Sahman, D. I.
2017-12-01
We present a search for optical bursts from the repeating fast radio burst FRB 121102 using simultaneous observations with the high-speed optical camera ULTRASPEC on the 2.4-m Thai National Telescope and radio observations with the 100-m Effelsberg Radio Telescope. A total of 13 radio bursts were detected, but we found no evidence for corresponding optical bursts in our 70.7-ms frames. The 5σ upper limit to the optical flux density during our observations is 0.33 mJy at 767 nm. This gives an upper limit for the optical burst fluence of 0.046 Jy ms, which constrains the broad-band spectral index of the burst emission to α ≤ -0.2. Two of the radio pulses are separated by just 34 ms, which may represent an upper limit on a possible underlying periodicity (a rotation period typical of pulsars), or these pulses may have come from a single emission window that is a small fraction of a possible period.
Orthogonalization of correlated states
International Nuclear Information System (INIS)
Fantoni, S.; Pandharipande, V.R.
1988-01-01
A scheme for orthogonalizing correlated states while preserving the diagonal matrix elements of the Hamiltonian is developed. Conventional perturbation theory can be used with the orthonormal correlated basis obtained from this scheme. Advantages of using orthonormal correlated states in calculations of the response function and correlation energy are discussed
Orthogonal serialisation for Haskell
DEFF Research Database (Denmark)
Berthold, Jost
2010-01-01
support for parallel Haskell on distributed memory platforms. This serialisation has highly desirable and so-far unrivalled properties: it is truly orthogonal to evaluation and also does not require any type class mechanisms. Especially, (almost) any kind of value can be serialised, including functions...
A Search for Neutrino Emission from Fast Radio Bursts with Six Years of IceCube Data
Aartsen, M. G.; Ackermann, M.; Adams, J.; Aguilar, J. A.; Ahlers, M.; Ahrens, M.; Samarai, I. Al; Altmann, D.; Andeen, K.; Anderson, T.; Ansseau, I.; Anton, G.; Argüelles, C.; Auffenberg, J.; Axani, S.; Bagherpour, H.; Bai, X.; Barron, J. P.; Barwick, S. W.; Baum, V.; Bay, R.; Beatty, J. J.; Becker Tjus, J.; Becker, K.-H.; BenZvi, S.; Berley, D.; Bernardini, E.; Besson, D. Z.; Binder, G.; Bindig, D.; Blaufuss, E.; Blot, S.; Bohm, C.; Börner, M.; Bos, F.; Böser, S.; Botner, O.; Bourbeau, E.; Bourbeau, J.; Bradascio, F.; Braun, J.; Brenzke, M.; Bretz, H.-P.; Bron, S.; Brostean-Kaiser, J.; Burgman, A.; Busse, R. S.; Carver, T.; Cheung, E.; Chirkin, D.; Christov, A.; Clark, K.; Classen, L.; Collin, G. H.; Conrad, J. M.; Coppin, P.; Correa, P.; Cowen, D. F.; Cross, R.; Dave, P.; Day, M.; de André, J. P. A. M.; De Clercq, C.; DeLaunay, J. J.; Dembinski, H.; De Ridder, S.; Desiati, P.; de Vries, K. D.; de Wasseige, G.; de With, M.; DeYoung, T.; Díaz-Vélez, J. C.; di Lorenzo, V.; Dujmovic, H.; Dumm, J. P.; Dunkman, M.; Dvorak, E.; Eberhardt, B.; Ehrhardt, T.; Eichmann, B.; Eller, P.; Evenson, P. A.; Fahey, S.; Fazely, A. R.; Felde, J.; Filimonov, K.; Finley, C.; Flis, S.; Franckowiak, A.; Friedman, E.; Fritz, A.; Gaisser, T. K.; Gallagher, J.; Gerhardt, L.; Ghorbani, K.; Giang, W.; Glauch, T.; Glüsenkamp, T.; Goldschmidt, A.; Gonzalez, J. G.; Grant, D.; Griffith, Z.; Haack, C.; Hallgren, A.; Halzen, F.; Hanson, K.; Hebecker, D.; Heereman, D.; Helbing, K.; Hellauer, R.; Hickford, S.; Hignight, J.; Hill, G. C.; Hoffman, K. D.; Hoffmann, R.; Hoinka, T.; Hokanson-Fasig, B.; Hoshina, K.; Huang, F.; Huber, M.; Hultqvist, K.; Hünnefeld, M.; Hussain, R.; In, S.; Iovine, N.; Ishihara, A.; Jacobi, E.; Japaridze, G. S.; Jeong, M.; Jero, K.; Jones, B. J. P.; Kalaczynski, P.; Kang, W.; Kappes, A.; Kappesser, D.; Karg, T.; Karle, A.; Katz, U.; Kauer, M.; Keivani, A.; Kelley, J. L.; Kheirandish, A.; Kim, J.; Kim, M.; Kintscher, T.; Kiryluk, J.; Kittler, T.; Klein, S. R.; Koirala, R.; Kolanoski, H.; Köpke, L.; Kopper, C.; Kopper, S.; Koschinsky, J. P.; Koskinen, D. J.; Kowalski, M.; Krings, K.; Kroll, M.; Krückl, G.; Kunwar, S.; Kurahashi, N.; Kuwabara, T.; Kyriacou, A.; Labare, M.; Lanfranchi, J. L.; Larson, M. J.; Lauber, F.; Leonard, K.; Lesiak-Bzdak, M.; Leuermann, M.; Liu, Q. R.; Lozano Mariscal, C. J.; Lu, L.; Lünemann, J.; Luszczak, W.; Madsen, J.; Maggi, G.; Mahn, K. B. M.; Mancina, S.; Maruyama, R.; Mase, K.; Maunu, R.; Meagher, K.; Medici, M.; Meier, M.; Menne, T.; Merino, G.; Meures, T.; Miarecki, S.; Micallef, J.; Momenté, G.; Montaruli, T.; Moore, R. W.; Moulai, M.; Nahnhauer, R.; Nakarmi, P.; Naumann, U.; Neer, G.; Niederhausen, H.; Nowicki, S. C.; Nygren, D. R.; Obertacke Pollmann, A.; Olivas, A.; O’Murchadha, A.; O’Sullivan, E.; Palczewski, T.; Pandya, H.; Pankova, D. V.; Peiffer, P.; Pepper, J. A.; Pérez de los Heros, C.; Pieloth, D.; Pinat, E.; Plum, M.; Price, P. B.; Przybylski, G. T.; Raab, C.; Rädel, L.; Rameez, M.; Rauch, L.; Rawlins, K.; Rea, I. C.; Reimann, R.; Relethford, B.; Relich, M.; Resconi, E.; Rhode, W.; Richman, M.; Robertson, S.; Rongen, M.; Rott, C.; Ruhe, T.; Ryckbosch, D.; Rysewyk, D.; Safa, I.; Sälzer, T.; Sanchez Herrera, S. E.; Sandrock, A.; Sandroos, J.; Santander, M.; Sarkar, S.; Sarkar, S.; Satalecka, K.; Schlunder, P.; Schmidt, T.; Schneider, A.; Schoenen, S.; Schöneberg, S.; Schumacher, L.; Sclafani, S.; Seckel, D.; Seunarine, S.; Soedingrekso, J.; Soldin, D.; Song, M.; Spiczak, G. M.; Spiering, C.; Stachurska, J.; Stamatikos, M.; Stanev, T.; Stasik, A.; Stein, R.; Stettner, J.; Steuer, A.; Stezelberger, T.; Stokstad, R. G.; Stößl, A.; Strotjohann, N. L.; Stuttard, T.; Sullivan, G. W.; Sutherland, M.; Taboada, I.; Tatar, J.; Tenholt, F.; Ter-Antonyan, S.; Terliuk, A.; Tilav, S.; Toale, P. A.; Tobin, M. N.; Tönnis, C.; Toscano, S.; Tosi, D.; Tselengidou, M.; Tung, C. F.; Turcati, A.; Turley, C. F.; Ty, B.; Unger, E.; Usner, M.; Vandenbroucke, J.; Van Driessche, W.; van Eijk, D.; van Eijndhoven, N.; Vanheule, S.; van Santen, J.; Vogel, E.; Vraeghe, M.; Walck, C.; Wallace, A.; Wallraff, M.; Wandler, F. D.; Wandkowsky, N.; Waza, A.; Weaver, C.; Weiss, M. J.; Wendt, C.; Werthebach, J.; Westerhoff, S.; Whelan, B. J.; Wiebe, K.; Wiebusch, C. H.; Wille, L.; Williams, D. R.; Wills, L.; Wolf, M.; Wood, J.; Wood, T. R.; Woolsey, E.; Woschnagg, K.; Xu, D. L.; Xu, X. W.; Xu, Y.; Yanez, J. P.; Yodh, G.; Yoshida, S.; Yuan, T.; IceCube Collaboration
2018-04-01
We present a search for coincidence between IceCube TeV neutrinos and fast radio bursts (FRBs). During the search period from 2010 May 31 to 2016 May 12, a total of 29 FRBs with 13 unique locations have been detected in the whole sky. An unbinned maximum likelihood method was used to search for spatial and temporal coincidence between neutrinos and FRBs in expanding time windows, in both the northern and southern hemispheres. No significant correlation was found in six years of IceCube data. Therefore, we set upper limits on neutrino fluence emitted by FRBs as a function of time window duration. We set the most stringent limit obtained to date on neutrino fluence from FRBs with an E ‑2 energy spectrum assumed, which is 0.0021 GeV cm‑2 per burst for emission timescales up to ∼102 s from the northern hemisphere stacking search.
Mason, A M
2018-01-01
In this paper the authors apply to the zeros of families of L-functions with orthogonal or symplectic symmetry the method that Conrey and Snaith (Correlations of eigenvalues and Riemann zeros, 2008) used to calculate the n-correlation of the zeros of the Riemann zeta function. This method uses the Ratios Conjectures (Conrey, Farmer, and Zimbauer, 2008) for averages of ratios of zeta or L-functions. Katz and Sarnak (Zeroes of zeta functions and symmetry, 1999) conjecture that the zero statistics of families of L-functions have an underlying symmetry relating to one of the classical compact groups U(N), O(N) and USp(2N). Here the authors complete the work already done with U(N) (Conrey and Snaith, Correlations of eigenvalues and Riemann zeros, 2008) to show how new methods for calculating the n-level densities of eigenangles of random orthogonal or symplectic matrices can be used to create explicit conjectures for the n-level densities of zeros of L-functions with orthogonal or symplectic symmetry, including al...
DEFF Research Database (Denmark)
Zuidmeer-Jongejan, Laurian; Fernandez-Rivas, Montserrat; Poulsen, Lars K.
2012-01-01
ABSTRACT: The FAST project (Food Allergy Specific Immunotherapy) aims at the development of safe and effective treatment of food allergies, targeting prevalent, persistent and severe allergy to fish and peach. Classical allergen-specific immunotherapy (SIT), using subcutaneous injections with aqu...
Directory of Open Access Journals (Sweden)
Reneker Jeff
2005-05-01
Full Text Available Abstract Background Searching for small tandem/disperse repetitive DNA sequences streamlines many biomedical research processes. For instance, whole genomic array analysis in yeast has revealed 22 PHO-regulated genes. The promoter regions of all but one of them contain at least one of the two core Pho4p binding sites, CACGTG and CACGTT. In humans, microsatellites play a role in a number of rare neurodegenerative diseases such as spinocerebellar ataxia type 1 (SCA1. SCA1 is a hereditary neurodegenerative disease caused by an expanded CAG repeat in the coding sequence of the gene. In bacterial pathogens, microsatellites are proposed to regulate expression of some virulence factors. For example, bacteria commonly generate intra-strain diversity through phase variation which is strongly associated with virulence determinants. A recent analysis of the complete sequences of the Helicobacter pylori strains 26695 and J99 has identified 46 putative phase-variable genes among the two genomes through their association with homopolymeric tracts and dinucleotide repeats. Life scientists are increasingly interested in studying the function of small sequences of DNA. However, current search algorithms often generate thousands of matches – most of which are irrelevant to the researcher. Results We present our hash function as well as our search algorithm to locate small sequences of DNA within multiple genomes. Our system applies information retrieval algorithms to discover knowledge of cross-species conservation of repeat sequences. We discuss our incorporation of the Gene Ontology (GO database into these algorithms. We conduct an exhaustive time analysis of our system for various repetitive sequence lengths. For instance, a search for eight bases of sequence within 3.224 GBases on 49 different chromosomes takes 1.147 seconds on average. To illustrate the relevance of the search results, we conduct a search with and without added annotation terms for the
HOLA: Human-like Orthogonal Network Layout.
Kieffer, Steve; Dwyer, Tim; Marriott, Kim; Wybrow, Michael
2016-01-01
Over the last 50 years a wide variety of automatic network layout algorithms have been developed. Some are fast heuristic techniques suitable for networks with hundreds of thousands of nodes while others are multi-stage frameworks for higher-quality layout of smaller networks. However, despite decades of research currently no algorithm produces layout of comparable quality to that of a human. We give a new "human-centred" methodology for automatic network layout algorithm design that is intended to overcome this deficiency. User studies are first used to identify the aesthetic criteria algorithms should encode, then an algorithm is developed that is informed by these criteria and finally, a follow-up study evaluates the algorithm output. We have used this new methodology to develop an automatic orthogonal network layout method, HOLA, that achieves measurably better (by user study) layout than the best available orthogonal layout algorithm and which produces layouts of comparable quality to those produced by hand.
Energy Technology Data Exchange (ETDEWEB)
Seong, I.S., E-mail: issung83@gmail.com; Beamer, K.; Hedges, M.T.; Jaegle, I.; Rosen, M.D.; Ross, S.J.; Thorpe, T.N.; Vahsen, S.E.; Yamaoka, J.
2013-12-21
We present our most recent work on the use of integrated silicon pixel electronics to read out gas-filled Time Projection Chambers (TPCs). Such detectors have great promise to measure the direction and energy of neutral particles via nuclear recoils that ionize the gas. We report on ongoing studies and refinement of the first prototype constructed at the University of Hawaii. We present data on the detection of alpha particles and fast neutrons using Ar:CO{sub 2} (70:30) and He:CO{sub 2} (70:30) gas, respectively. We also present plans and sensitivity estimates for a future Dark Matter search based on the technology under study.
Experimental search for compression phenomena in fast nucleus--nucleus collisions
International Nuclear Information System (INIS)
Schopper, E.; Baumgardt, H.G.; Obst, E.
1977-01-01
The occurrence of compression phenomena and shock waves, connected with the increase of the density of the nuclear matter during the interpenetration of two fast nuclei, are discussed. Current experiments dealing with this problem are reviewed. Before considering the mechanism of the interpenetration of two fast nuclei it may be useful to look at more simple situations, i.e., proton-proton interactions, then to envelop them with nuclear matter, considering proton-nucleus interactions. Only very general features are described, which may give suggestions for the understanding of the nucleus-nucleus impact
Theoretical Models for Orthogonal Cutting
DEFF Research Database (Denmark)
De Chiffre, Leonardo
This review of simple models for orthogonal cutting was extracted from: “L. De Chiffre: Metal Cutting Mechanics and Applications, D.Sc. Thesis, Technical University of Denmark, 1990.”......This review of simple models for orthogonal cutting was extracted from: “L. De Chiffre: Metal Cutting Mechanics and Applications, D.Sc. Thesis, Technical University of Denmark, 1990.”...
IN SEARCH OF A FAST SCREENING METHOD FOR DETECTING THE MALINGERING OF COGNITIVE IMPAIRMENT
Directory of Open Access Journals (Sweden)
Amada Ampudia
2012-07-01
Full Text Available Forensic settings demand expedient and conclusive forensic psychological assessment. The aim of this study was to design a simple and fast, but reliable psychometric instrument for detecting the malingering of cognitive impairment. In a quasi-experimental design, 156 individuals were divided into three groups: a normal group with no cognitive impairment; a Mild Cognitive Impairment (MCI group; and a group of informed malingerers with no MCI who feigned cognitive impairment. Receiver Operating Curve (ROC analysis of the Test of Memory Malingering (TOMM, and of several subtests of the Wechsler Memory Scale (WMS-III revealed that the WMS-III was as reliable and accurate as the TOMM in discriminating malingerers from the honest. The results revealed that the diagnostic accuracy, sensitivity and specificity of the WMS-III Auditory Recognition Delayed of Verbal Paired Associates subtest was similar to the TOMM in discriminating malingering from genuine memory impairment. In conclusion, the WMS-III Recognition of Verbal Paired Associates subtest and the TOMM provide a fast, valid and reliable screening method for detecting the malingering of cognitive impairment.
Energy Technology Data Exchange (ETDEWEB)
Schmidt, Deborah; Crawford, Fronefield; Gilpin, Claire [Department of Physics and Astronomy, Franklin and Marshall College, P.O. Box 3003, Lancaster, PA 17604 (United States); Langston, Glen [National Radio Astronomy Observatory, P.O. Box 2, Green Bank, WV 24944 (United States)
2013-04-15
We have searched 75 unidentified radio sources selected from the NRAO VLA Sky Survey catalog for the presence of rapidly spinning pulsars and short, dispersed radio bursts. The sources are radio bright, have no identifications or optical source coincidences, are more than 5% linearly polarized, and are spatially unresolved in the catalog. If these sources are fast-spinning pulsars (e.g., sub-millisecond pulsars), previous large-scale pulsar surveys may have missed detection due to instrumental and computational limitations, eclipsing effects, or diffractive scintillation. The discovery of a sub-millisecond pulsar would significantly constrain the neutron star equation of state and would have implications for models predicting a rapid slowdown of highly recycled X-ray pulsars to millisecond periods from, e.g., accretion disk decoupling. These same sources were previously searched unsuccessfully for pulsations at 610 MHz with the Lovell Telescope at Jodrell Bank. This new search was conducted at a different epoch with a new 800 MHz backend on the NRAO 43 m Telescope at a center frequency of 1200 MHz. Our search was sensitive to sub-millisecond pulsars in highly accelerated binary systems and to short transient pulses. No periodic or transient signals were detected from any of the target sources. We conclude that diffractive scintillation, dispersive smearing, and binary acceleration are unlikely to have prevented detection of the large majority of the sources if they are pulsars, though we cannot rule out eclipsing, nulling or intermittent emission, or radio interference as possible factors for some non-detections. Other (speculative) possibilities for what these sources might include radio-emitting magnetic cataclysmic variables or older pulsars with aligned magnetic and spin axes.
Fast optimization of binary clusters using a novel dynamic lattice searching method
International Nuclear Information System (INIS)
Wu, Xia; Cheng, Wen
2014-01-01
Global optimization of binary clusters has been a difficult task despite of much effort and many efficient methods. Directing toward two types of elements (i.e., homotop problem) in binary clusters, two classes of virtual dynamic lattices are constructed and a modified dynamic lattice searching (DLS) method, i.e., binary DLS (BDLS) method, is developed. However, it was found that the BDLS can only be utilized for the optimization of binary clusters with small sizes because homotop problem is hard to be solved without atomic exchange operation. Therefore, the iterated local search (ILS) method is adopted to solve homotop problem and an efficient method based on the BDLS method and ILS, named as BDLS-ILS, is presented for global optimization of binary clusters. In order to assess the efficiency of the proposed method, binary Lennard-Jones clusters with up to 100 atoms are investigated. Results show that the method is proved to be efficient. Furthermore, the BDLS-ILS method is also adopted to study the geometrical structures of (AuPd) 79 clusters with DFT-fit parameters of Gupta potential
International Nuclear Information System (INIS)
Wu, Xia; Wu, Genhua
2014-01-01
Highlights: • A high efficient method for optimization of atomic clusters is developed. • Its performance is studied by optimizing Lennard-Jones clusters and Ag clusters. • The method is proved to be quite efficient. • A new Ag 61 cluster with stacking-fault face-centered cubic motif is found. - Abstract: Geometrical optimization of atomic clusters is performed by a development of adaptive immune optimization algorithm (AIOA) with dynamic lattice searching (DLS) operation (AIOA-DLS method). By a cycle of construction and searching of the dynamic lattice (DL), DLS algorithm rapidly makes the clusters more regular and greatly reduces the potential energy. DLS can thus be used as an operation acting on the new individuals after mutation operation in AIOA to improve the performance of the AIOA. The AIOA-DLS method combines the merit of evolutionary algorithm and idea of dynamic lattice. The performance of the proposed method is investigated in the optimization of Lennard-Jones clusters within 250 atoms and silver clusters described by many-body Gupta potential within 150 atoms. Results reported in the literature are reproduced, and the motif of Ag 61 cluster is found to be stacking-fault face-centered cubic, whose energy is lower than that of previously obtained icosahedron
Core design optimization by integration of a fast 3-D nodal code in a heuristic search procedure
Energy Technology Data Exchange (ETDEWEB)
Geemert, R. van; Leege, P.F.A. de; Hoogenboom, J.E.; Quist, A.J. [Delft University of Technology, NL-2629 JB Delft (Netherlands)
1998-07-01
An automated design tool is being developed for the Hoger Onderwijs Reactor (HOR) in Delft, the Netherlands, which is a 2 MWth swimming-pool type research reactor. As a black box evaluator, the 3-D nodal code SILWER, which up to now has been used only for evaluation of predetermined core designs, is integrated in the core optimization procedure. SILWER is a part of PSl's ELCOS package and features optional additional thermal-hydraulic, control rods and xenon poisoning calculations. This allows for fast and accurate evaluation of different core designs during the optimization search. Special attention is paid to handling the in- and output files for SILWER such that no adjustment of the code itself is required for its integration in the optimization programme. The optimization objective, the safety and operation constraints, as well as the optimization procedure, are discussed. (author)
Core design optimization by integration of a fast 3-D nodal code in a heuristic search procedure
International Nuclear Information System (INIS)
Geemert, R. van; Leege, P.F.A. de; Hoogenboom, J.E.; Quist, A.J.
1998-01-01
An automated design tool is being developed for the Hoger Onderwijs Reactor (HOR) in Delft, the Netherlands, which is a 2 MWth swimming-pool type research reactor. As a black box evaluator, the 3-D nodal code SILWER, which up to now has been used only for evaluation of predetermined core designs, is integrated in the core optimization procedure. SILWER is a part of PSl's ELCOS package and features optional additional thermal-hydraulic, control rods and xenon poisoning calculations. This allows for fast and accurate evaluation of different core designs during the optimization search. Special attention is paid to handling the in- and output files for SILWER such that no adjustment of the code itself is required for its integration in the optimization programme. The optimization objective, the safety and operation constraints, as well as the optimization procedure, are discussed. (author)
Method of orthogonally splitting imaging pose measurement
Zhao, Na; Sun, Changku; Wang, Peng; Yang, Qian; Liu, Xintong
2018-01-01
In order to meet the aviation's and machinery manufacturing's pose measurement need of high precision, fast speed and wide measurement range, and to resolve the contradiction between measurement range and resolution of vision sensor, this paper proposes an orthogonally splitting imaging pose measurement method. This paper designs and realizes an orthogonally splitting imaging vision sensor and establishes a pose measurement system. The vision sensor consists of one imaging lens, a beam splitter prism, cylindrical lenses and dual linear CCD. Dual linear CCD respectively acquire one dimensional image coordinate data of the target point, and two data can restore the two dimensional image coordinates of the target point. According to the characteristics of imaging system, this paper establishes the nonlinear distortion model to correct distortion. Based on cross ratio invariability, polynomial equation is established and solved by the least square fitting method. After completing distortion correction, this paper establishes the measurement mathematical model of vision sensor, and determines intrinsic parameters to calibrate. An array of feature points for calibration is built by placing a planar target in any different positions for a few times. An terative optimization method is presented to solve the parameters of model. The experimental results show that the field angle is 52 °, the focus distance is 27.40 mm, image resolution is 5185×5117 pixels, displacement measurement error is less than 0.1mm, and rotation angle measurement error is less than 0.15°. The method of orthogonally splitting imaging pose measurement can satisfy the pose measurement requirement of high precision, fast speed and wide measurement range.
Non-orthogonally transitive G2 spike solution
International Nuclear Information System (INIS)
Lim, Woei Chet
2015-01-01
We generalize the orthogonally transitive (OT) G 2 spike solution to the non-OT G 2 case. This is achieved by applying Geroch’s transformation on a Kasner seed. The new solution contains two more parameters than the OT G 2 spike solution. Unlike the OT G 2 spike solution, the new solution always resolves its spike. (fast track communication)
Chiu, Yi-Yuan; Lin, Chun-Yu; Lin, Chih-Ta; Hsu, Kai-Cheng; Chang, Li-Zen; Yang, Jinn-Moon
2012-01-01
To discover a compound inhibiting multiple proteins (i.e. polypharmacological targets) is a new paradigm for the complex diseases (e.g. cancers and diabetes). In general, the polypharmacological proteins often share similar local binding environments and motifs. As the exponential growth of the number of protein structures, to find the similar structural binding motifs (pharma-motifs) is an emergency task for drug discovery (e.g. side effects and new uses for old drugs) and protein functions. We have developed a Space-Related Pharmamotifs (called SRPmotif) method to recognize the binding motifs by searching against protein structure database. SRPmotif is able to recognize conserved binding environments containing spatially discontinuous pharma-motifs which are often short conserved peptides with specific physico-chemical properties for protein functions. Among 356 pharma-motifs, 56.5% interacting residues are highly conserved. Experimental results indicate that 81.1% and 92.7% polypharmacological targets of each protein-ligand complex are annotated with same biological process (BP) and molecular function (MF) terms, respectively, based on Gene Ontology (GO). Our experimental results show that the identified pharma-motifs often consist of key residues in functional (active) sites and play the key roles for protein functions. The SRPmotif is available at http://gemdock.life.nctu.edu.tw/SRP/. SRPmotif is able to identify similar pharma-interfaces and pharma-motifs sharing similar binding environments for polypharmacological targets by rapidly searching against the protein structure database. Pharma-motifs describe the conservations of binding environments for drug discovery and protein functions. Additionally, these pharma-motifs provide the clues for discovering new sequence-based motifs to predict protein functions from protein sequence databases. We believe that SRPmotif is useful for elucidating protein functions and drug discovery.
An introduction to orthogonal polynomials
Chihara, Theodore S
1978-01-01
Assuming no further prerequisites than a first undergraduate course in real analysis, this concise introduction covers general elementary theory related to orthogonal polynomials. It includes necessary background material of the type not usually found in the standard mathematics curriculum. Suitable for advanced undergraduate and graduate courses, it is also appropriate for independent study. Topics include the representation theorem and distribution functions, continued fractions and chain sequences, the recurrence formula and properties of orthogonal polynomials, special functions, and some
Scattering theory and orthogonal polynomials
International Nuclear Information System (INIS)
Geronimo, J.S.
1977-01-01
The application of the techniques of scattering theory to the study of polynomials orthogonal on the unit circle and a finite segment of the real line is considered. The starting point is the recurrence relations satisfied by the polynomials instead of the orthogonality condition. A set of two two terms recurrence relations for polynomials orthogonal on the real line is presented and used. These recurrence relations play roles analogous to those satisfied by polynomials orthogonal on unit circle. With these recurrence formulas a Wronskian theorem is proved and the Christoffel-Darboux formula is derived. In scattering theory a fundamental role is played by the Jost function. An analogy is deferred of this function and its analytic properties and the locations of its zeros investigated. The role of the analog Jost function in various properties of these orthogonal polynomials is investigated. The techniques of inverse scattering theory are also used. The discrete analogues of the Gelfand-Levitan and Marchenko equations are derived and solved. These techniques are used to calculate asymptotic formulas for the orthogonal polynomials. Finally Szego's theorem on toeplitz and Hankel determinants is proved using the recurrence formulas and some properties of the Jost function. The techniques of inverse scattering theory are used to calculate the correction terms
Application of a fast skyline computation algorithm for serendipitous searching problems
Koizumi, Kenichi; Hiraki, Kei; Inaba, Mary
2018-02-01
Skyline computation is a method of extracting interesting entries from a large population with multiple attributes. These entries, called skyline or Pareto optimal entries, are known to have extreme characteristics that cannot be found by outlier detection methods. Skyline computation is an important task for characterizing large amounts of data and selecting interesting entries with extreme features. When the population changes dynamically, the task of calculating a sequence of skyline sets is called continuous skyline computation. This task is known to be difficult to perform for the following reasons: (1) information of non-skyline entries must be stored since they may join the skyline in the future; (2) the appearance or disappearance of even a single entry can change the skyline drastically; (3) it is difficult to adopt a geometric acceleration algorithm for skyline computation tasks with high-dimensional datasets. Our new algorithm called jointed rooted-tree (JR-tree) manages entries using a rooted tree structure. JR-tree delays extend the tree to deep levels to accelerate tree construction and traversal. In this study, we presented the difficulties in extracting entries tagged with a rare label in high-dimensional space and the potential of fast skyline computation in low-latency cell identification technology.
Sawada, Reiko; Sato, Wataru; Toichi, Motomi; Fushiki, Tohru
2017-01-01
Rapid detection of food is crucial for the survival of organisms. However, previous visual search studies have reported discrepant results regarding the detection speeds for food vs. non-food items; some experiments showed faster detection of food than non-food, whereas others reported null findings concerning any speed advantage for the detection of food vs. non-food. Moreover, although some previous studies showed that fat content can affect visual attention for food, the effect of fat content on the detection of food remains unclear. To investigate these issues, we measured reaction times (RTs) during a visual search task in which participants with normal weight detected high-fat food (i.e., fast food), low-fat food (i.e., Japanese diet), and non-food (i.e., kitchen utensils) targets within crowds of non-food distractors (i.e., cars). Results showed that RTs for food targets were shorter than those for non-food targets. Moreover, the RTs for high-fat food were shorter than those for low-fat food. These results suggest that food is more rapidly detected than non-food within the environment and that a higher fat content in food facilitates rapid detection.
2-DB, 2-D Multigroup Diffusion, X-Y, R-Theta, Hexagonal Geometry Fast Reactor, Criticality Search
International Nuclear Information System (INIS)
Little, W.W. Jr.; Hardie, R.W.; Hirons, T.J.; O'Dell, R.D.
1969-01-01
1 - Description of problem or function: 2DB is a flexible, two- dimensional (x-y, r-z, r-theta, hex geometry) diffusion code for use in fast reactor analyses. The code can be used to: (a) Compute fuel burnup using a flexible material shuffling scheme. (b) Perform criticality searches on time absorption (alpha), material concentrations, and region dimensions using a regular or adjoint model. Criticality searches can be performed during burnup to compensate for fuel depletion. (c) Compute flux distributions for an arbitrary extraneous source. 2 - Method of solution: Standard source-iteration techniques are used. Group re-balancing and successive over-relaxation with line inversion are used to accelerate convergence. Material burnup is by reactor zone. The burnup rate is determined by the zone and energy (group) averaged cross sections which are recomputed after each time-step. The isotopic chains, which can contain any number of isotopes, are formed by the user. The code does not contain built-in or internal chains. 3 - Restrictions on the complexity of the problem: Since variable dimensioning is employed, no simple bounds can be stated. The current 1108 version, however, is nominally restricted to 50 energy groups in a 65 K memory. In the 6600 version the power fraction, average burnup rate, and breeding ratio calculations are limited to reactors with a maximum of 50 zones
Directory of Open Access Journals (Sweden)
Reiko Sawada
2017-06-01
Full Text Available Rapid detection of food is crucial for the survival of organisms. However, previous visual search studies have reported discrepant results regarding the detection speeds for food vs. non-food items; some experiments showed faster detection of food than non-food, whereas others reported null findings concerning any speed advantage for the detection of food vs. non-food. Moreover, although some previous studies showed that fat content can affect visual attention for food, the effect of fat content on the detection of food remains unclear. To investigate these issues, we measured reaction times (RTs during a visual search task in which participants with normal weight detected high-fat food (i.e., fast food, low-fat food (i.e., Japanese diet, and non-food (i.e., kitchen utensils targets within crowds of non-food distractors (i.e., cars. Results showed that RTs for food targets were shorter than those for non-food targets. Moreover, the RTs for high-fat food were shorter than those for low-fat food. These results suggest that food is more rapidly detected than non-food within the environment and that a higher fat content in food facilitates rapid detection.
Sawada, Reiko; Sato, Wataru; Toichi, Motomi; Fushiki, Tohru
2017-01-01
Rapid detection of food is crucial for the survival of organisms. However, previous visual search studies have reported discrepant results regarding the detection speeds for food vs. non-food items; some experiments showed faster detection of food than non-food, whereas others reported null findings concerning any speed advantage for the detection of food vs. non-food. Moreover, although some previous studies showed that fat content can affect visual attention for food, the effect of fat content on the detection of food remains unclear. To investigate these issues, we measured reaction times (RTs) during a visual search task in which participants with normal weight detected high-fat food (i.e., fast food), low-fat food (i.e., Japanese diet), and non-food (i.e., kitchen utensils) targets within crowds of non-food distractors (i.e., cars). Results showed that RTs for food targets were shorter than those for non-food targets. Moreover, the RTs for high-fat food were shorter than those for low-fat food. These results suggest that food is more rapidly detected than non-food within the environment and that a higher fat content in food facilitates rapid detection. PMID:28690568
Methods for a systematic, comprehensive search for fast, heavy scintillator materials
International Nuclear Information System (INIS)
Derenzo, S.E.; Moses, W.W.; Weber, M.J.; West, A.C.
1994-01-01
Over the years a number of scintillator materials have been developed for a wide variety of nuclear detection applications in industry, high energy physics, and medical instrumentation. To expand the list of useful scintillators, the authors are pursuing the following systematic, comprehensive search: (1) select materials with good gamma-ray interaction properties from the 200,000 data set NIST crystal diffraction file, (2) synthesize samples (doped and undoped) in powdered or single crystal form, (3) test the samples using sub-nanosecond pulsed x-rays to measure important scintillation properties such as rise times, decay times, emission wavelengths, and light output, (4) prepare large, high quality crystals of the most promising candidates, and (5) test the crystals as gamma-ray detectors in representative configurations. An important parallel effort is the computation of electronic energy levels of activators and the band structure of intrinsic and host crystals to aid in the materials selection process. In this paper the authors interested mainly in scintillator materials for detecting 511 keV gamma rays in positron emission tomography
Recycling option search for a 600 MWE sodium-cooled transmutation fast reactor
Energy Technology Data Exchange (ETDEWEB)
Lee, Yong Kyo; Kim, Myung Hyun [Dept. of Nuclear Engineering, Kyung Hee University, Yongin (Korea, Republic of)
2015-02-15
Four recycling scenarios involving pyroprocessing of spent fuel (SF) have been investigated for a 600-MWe transmutation sodium-cooled fast reactor (SFR), KALIMER. Performance evaluation was done with code system REBUS connected with TRANSX and TWODANT. Scenario Number 1 is the pyroprocessing of Canada deuterium uranium (CANDU) SF. Because the recycling of CANDU SF does not have any safety problems, the CANDU-Pyro- SFR system will be possible if the pyroprocessing capacity is large enough. Scenario Number 2 is a feasibility test of feed SF from a pressurized water reactor PWR. The sensitivity of cooling time before prior to pyro-processing was studied. As the cooling time increases, excess reactivity at the beginning of the equilibrium cycle (BOEC) decreases, thereby creating advantageous reactivity control and improving the transmutation performance of minor actinides. Scenario Number 3 is a case study for various levels of recovery factors of transuranic isotopes (TRUs). If long-lived fission products can be separated during pyroprocessing, the waste that is not recovered is classified as low- and intermediate-level waste, and it is sufficient to be disposed of in an underground site due to very low-heat-generation rate when the waste cooling time becomes >300 years at a TRU recovery factor of 99.9%. Scenario Number 4 is a case study for the recovery factor of rare earth (RE) isotopes. The RE isotope recovery factor should be lowered to 20% in order to make sodium void reactivity less than <7$, which is the design limit of a metal fuel.
Recycling option search for a 600-MWe sodium-cooled transmutation fast reactor
Directory of Open Access Journals (Sweden)
Yong Kyo Lee
2015-02-01
Full Text Available Four recycling scenarios involving pyroprocessing of spent fuel (SF have been investigated for a 600-MWe transmutation sodium-cooled fast reactor (SFR, KALIMER. Performance evaluation was done with code system REBUS connected with TRANSX and TWODANT. Scenario Number 1 is the pyroprocessing of Canada deuterium uranium (CANDU SF. Because the recycling of CANDU SF does not have any safety problems, the CANDU-Pyro-SFR system will be possible if the pyroprocessing capacity is large enough. Scenario Number 2 is a feasibility test of feed SF from a pressurized water reactor PWR. The sensitivity of cooling time before prior to pyro-processing was studied. As the cooling time increases, excess reactivity at the beginning of the equilibrium cycle (BOEC decreases, thereby creating advantageous reactivity control and improving the transmutation performance of minor actinides. Scenario Number 3 is a case study for various levels of recovery factors of transuranic isotopes (TRUs. If long-lived fission products can be separated during pyroprocessing, the waste that is not recovered is classified as low- and intermediate-level waste, and it is sufficient to be disposed of in an underground site due to very low-heat-generation rate when the waste cooling time becomes >300 years at a TRU recovery factor of 99.9%. Scenario Number 4 is a case study for the recovery factor of rare earth (RE isotopes. The RE isotope recovery factor should be lowered to ≤20% in order to make sodium void reactivity less than <7$, which is the design limit of a metal fuel.
Orthogonal Polynomials and Special Functions
Assche, Walter
2003-01-01
The set of lectures from the Summer School held in Leuven in 2002 provide an up-to-date account of recent developments in orthogonal polynomials and special functions, in particular for algorithms for computer algebra packages, 3nj-symbols in representation theory of Lie groups, enumeration, multivariable special functions and Dunkl operators, asymptotics via the Riemann-Hilbert method, exponential asymptotics and the Stokes phenomenon. The volume aims at graduate students and post-docs working in the field of orthogonal polynomials and special functions, and in related fields interacting with orthogonal polynomials, such as combinatorics, computer algebra, asymptotics, representation theory, harmonic analysis, differential equations, physics. The lectures are self-contained requiring only a basic knowledge of analysis and algebra, and each includes many exercises.
Symmetric functions and orthogonal polynomials
Macdonald, I G
1997-01-01
One of the most classical areas of algebra, the theory of symmetric functions and orthogonal polynomials has long been known to be connected to combinatorics, representation theory, and other branches of mathematics. Written by perhaps the most famous author on the topic, this volume explains some of the current developments regarding these connections. It is based on lectures presented by the author at Rutgers University. Specifically, he gives recent results on orthogonal polynomials associated with affine Hecke algebras, surveying the proofs of certain famous combinatorial conjectures.
Julia Sets of Orthogonal Polynomials
DEFF Research Database (Denmark)
Christiansen, Jacob Stordal; Henriksen, Christian; Petersen, Henrik Laurberg
2018-01-01
For a probability measure with compact and non-polar support in the complex plane we relate dynamical properties of the associated sequence of orthogonal polynomials fPng to properties of the support. More precisely we relate the Julia set of Pn to the outer boundary of the support, the lled Julia...... set to the polynomial convex hull K of the support, and the Green's function associated with Pn to the Green's function for the complement of K....
Orthogonality preserving infinite dimensional quadratic stochastic operators
International Nuclear Information System (INIS)
Akın, Hasan; Mukhamedov, Farrukh
2015-01-01
In the present paper, we consider a notion of orthogonal preserving nonlinear operators. We introduce π-Volterra quadratic operators finite and infinite dimensional settings. It is proved that any orthogonal preserving quadratic operator on finite dimensional simplex is π-Volterra quadratic operator. In infinite dimensional setting, we describe all π-Volterra operators in terms orthogonal preserving operators
Jos, Sujit; Kumar, Preetam; Chakrabarti, Saswat
Orthogonal and quasi-orthogonal codes are integral part of any DS-CDMA based cellular systems. Orthogonal codes are ideal for use in perfectly synchronous scenario like downlink cellular communication. Quasi-orthogonal codes are preferred over orthogonal codes in the uplink communication where perfect synchronization cannot be achieved. In this paper, we attempt to compare orthogonal and quasi-orthogonal codes in presence of timing synchronization error. This will give insight into the synchronization demands in DS-CDMA systems employing the two classes of sequences. The synchronization error considered is smaller than chip duration. Monte-Carlo simulations have been carried out to verify the analytical and numerical results.
Orthogonal Multiwavelet Frames in L2Rd
Directory of Open Access Journals (Sweden)
Liu Zhanwei
2012-01-01
Full Text Available We characterize the orthogonal frames and orthogonal multiwavelet frames in L2Rd with matrix dilations of the form (Df(x=detAf(Ax, where A is an arbitrary expanding d×d matrix with integer coefficients. Firstly, through two arbitrarily multiwavelet frames, we give a simple construction of a pair of orthogonal multiwavelet frames. Then, by using the unitary extension principle, we present an algorithm for the construction of arbitrarily many orthogonal multiwavelet tight frames. Finally, we give a general construction algorithm for orthogonal multiwavelet tight frames from a scaling function.
Directory of Open Access Journals (Sweden)
Mohammed Al-Ansi
2017-01-01
Full Text Available This paper considers codebook-based precoding for Space Shift Keying (SSK modulation MIMO system. Codebook-based precoding avoids the necessity for full knowledge of Channel State Information (CSI at the transmitter and alleviates the complexity of generating a CSI-optimized precoder. The receiver selects the codeword that maximizes the Minimum Euclidean Distance (MED of the received constellation and feeds back its index to the transmitter. In this paper, we first develop a new accurate closed-form Bit Error Rate (BER for SSK without precoding. Then, we investigate several phase-rotation codebooks with quantized set of phases and systematic structure. Namely, we investigate the Full-Combination, Walsh-Hadamard, Quasi-Orthogonal Sequences, and Orthogonal Array Testing codebooks. In addition, since the size of the Full-Combination codebook may be large, we develop an iterative search method for fast selection of its best codeword. The proposed codebooks significantly improve the BER performance in Rayleigh and Nakagami fading channels, even at high spatial correlation among transmit antennas and CSI estimation error. Moreover, we show that only four phases {+1,+j,-1,-j} are sufficient and further phase granularity does yield significant gain. This avoids hardware multiplication during searching the codebook and applying the codeword.
Fourier series and orthogonal polynomials
Jackson, Dunham
2004-01-01
This text for undergraduate and graduate students illustrates the fundamental simplicity of the properties of orthogonal functions and their developments in related series. Starting with a definition and explanation of the elements of Fourier series, the text follows with examinations of Legendre polynomials and Bessel functions. Boundary value problems consider Fourier series in conjunction with Laplace's equation in an infinite strip and in a rectangle, with a vibrating string, in three dimensions, in a sphere, and in other circumstances. An overview of Pearson frequency functions is followe
Orthogonal polynomials and random matrices
Deift, Percy
2000-01-01
This volume expands on a set of lectures held at the Courant Institute on Riemann-Hilbert problems, orthogonal polynomials, and random matrix theory. The goal of the course was to prove universality for a variety of statistical quantities arising in the theory of random matrix models. The central question was the following: Why do very general ensembles of random n {\\times} n matrices exhibit universal behavior as n {\\rightarrow} {\\infty}? The main ingredient in the proof is the steepest descent method for oscillatory Riemann-Hilbert problems.
Towards orthogonal Haskell data serialisation
DEFF Research Database (Denmark)
Berthold, Jost
2010-01-01
This paper investigates a novel approach to serialisation of Haskell data structures with a high degree of flexibility, based on runtime support for parallel Haskell on distributed memory platforms. This serialisation has highly desirable and so-far unrivalled properties: it is truly orthogonal...... to evaluation and does not require any type class mechanisms. Especially, (almost) any kind of value can be serialised, including functions and IO actions. We outline the runtime support on which our serialisation is based, and present different versions of the wrapper code in Haskell which can ensure type...
Introduction to Real Orthogonal Polynomials
1992-06-01
uses Green’s functions. As motivation , consider the Dirichlet problem for the unit circle in the plane, which involves finding a harmonic function u(r...xv ; a, b ; q) - TO [q-N ab+’q ; q, xq b. Orthogoy RMotion O0 (bq :q)x p.(q* ; a, b ; q) pg(q’ ; a, b ; q) (q "q), (aq)x (q ; q), (I -abq) (bq ; q... motivation and justi- fication for continued study of the intrinsic structure of orthogonal polynomials. 99 LIST OF REFERENCES 1. Deyer, W. M., ed., CRC
Braithwaite, Jason J.; Humphreys, Glyn W.; Hulleman, Johan; Watson, Derrick G.
2007-01-01
The authors report 4 experiments that examined color grouping and negative carryover effects in preview search via a probe detection task (J. J. Braithwaite, G. W. Humphreys, & J. Hodsoll, 2003). In Experiment 1, there was evidence of a negative color carryover from the preview to new items, using both search and probe detection measures. There…
The Research and Test of Fast Radio Burst Real-time Search Algorithm Based on GPU Acceleration
Wang, J.; Chen, M. Z.; Pei, X.; Wang, Z. Q.
2017-03-01
In order to satisfy the research needs of Nanshan 25 m radio telescope of Xinjiang Astronomical Observatory (XAO) and study the key technology of the planned QiTai radio Telescope (QTT), the receiver group of XAO studied the GPU (Graphics Processing Unit) based real-time FRB searching algorithm which developed from the original FRB searching algorithm based on CPU (Central Processing Unit), and built the FRB real-time searching system. The comparison of the GPU system and the CPU system shows that: on the basis of ensuring the accuracy of the search, the speed of the GPU accelerated algorithm is improved by 35-45 times compared with the CPU algorithm.
Ćwiok, M.; Dominik, W.; Małek, K.; Mankiewicz, L.; Mrowca-Ciułacz, J.; Nawrocki, K.; Piotrowski, L. W.; Sitek, P.; Sokołowski, M.; Wrochna, G.; Żarnecki, A. F.
2007-06-01
Experiment “Pi of the Sky” is designed to search for prompt optical emission from GRB sources. 32 CCD cameras covering 2 steradians will monitor the sky continuously. The data will be analysed on-line in search for optical flashes. The prototype with 2 cameras operated at Las Campanas (Chile) since 2004 has recognised several outbursts of flaring stars and has given limits for a few GRB.
A search for radio pulsars and fast transients in M31 using the Westerbork Synthesis Radio Telescope
Rubio-Herrera, E.; Stappers, B.W.; Hessels, J.W.T.; Braun, R.
2013-01-01
We present the results of the most sensitive and comprehensive survey yet undertaken for radio pulsars and fast transients in the Andromeda galaxy (M31) and its satellites, using the Westerbork Synthesis Radio Telescope (WSRT) at a central frequency of 328 MHz. We used the WSRT in a special
On Orthogonal Decomposition of a Sobolev Space
Lakew, Dejenie A.
2016-01-01
The theme of this short article is to investigate an orthogonal decomposition of a Sobolev space and look at some properties of the inner product therein and the distance defined from the inner product. We also determine the dimension of the orthogonal difference space and show the expansion of spaces as their regularity increases.
International Nuclear Information System (INIS)
Li, H.Y.; Wu, C.W.; Liu, W.T.; Chen, P.X.; Li, C.Z.
2011-01-01
We propose a method for implementing the Grover search algorithm directly in a database containing any number of items based on multi-level systems. Compared with the searching procedure in the database with qubits encoding, our modified algorithm needs fewer iteration steps to find the marked item and uses the carriers of the information more economically. Furthermore, we illustrate how to realize our idea in cavity QED using Zeeman's level structure of atoms. And the numerical simulation under the influence of the cavity and atom decays shows that the scheme could be achieved efficiently within current state-of-the-art technology. -- Highlights: ► A modified Grover algorithm is proposed for searching in an arbitrary dimensional Hilbert space. ► Our modified algorithm requires fewer iteration steps to find the marked item. ► The proposed method uses the carriers of the information more economically. ► A scheme for a six-item Grover search in cavity QED is proposed. ► Numerical simulation under decays shows that the scheme can be achieved with enough fidelity.
Orthogonal sparse linear discriminant analysis
Liu, Zhonghua; Liu, Gang; Pu, Jiexin; Wang, Xiaohong; Wang, Haijun
2018-03-01
Linear discriminant analysis (LDA) is a linear feature extraction approach, and it has received much attention. On the basis of LDA, researchers have done a lot of research work on it, and many variant versions of LDA were proposed. However, the inherent problem of LDA cannot be solved very well by the variant methods. The major disadvantages of the classical LDA are as follows. First, it is sensitive to outliers and noises. Second, only the global discriminant structure is preserved, while the local discriminant information is ignored. In this paper, we present a new orthogonal sparse linear discriminant analysis (OSLDA) algorithm. The k nearest neighbour graph is first constructed to preserve the locality discriminant information of sample points. Then, L2,1-norm constraint on the projection matrix is used to act as loss function, which can make the proposed method robust to outliers in data points. Extensive experiments have been performed on several standard public image databases, and the experiment results demonstrate the performance of the proposed OSLDA algorithm.
Sawada, Reiko; Sato, Wataru; Toichi, Motomi; Fushiki, Tohru
2017-01-01
Rapid detection of food is crucial for the survival of organisms. However, previous visual search studies have reported discrepant results regarding the detection speeds for food vs. non-food items; some experiments showed faster detection of food than non-food, whereas others reported null findings concerning any speed advantage for the detection of food vs. non-food. Moreover, although some previous studies showed that fat content can affect visual attention for food, the effect of fat cont...
[Orthogonal Vector Projection Algorithm for Spectral Unmixing].
Song, Mei-ping; Xu, Xing-wei; Chang, Chein-I; An, Ju-bai; Yao, Li
2015-12-01
Spectrum unmixing is an important part of hyperspectral technologies, which is essential for material quantity analysis in hyperspectral imagery. Most linear unmixing algorithms require computations of matrix multiplication and matrix inversion or matrix determination. These are difficult for programming, especially hard for realization on hardware. At the same time, the computation costs of the algorithms increase significantly as the number of endmembers grows. Here, based on the traditional algorithm Orthogonal Subspace Projection, a new method called. Orthogonal Vector Projection is prompted using orthogonal principle. It simplifies this process by avoiding matrix multiplication and inversion. It firstly computes the final orthogonal vector via Gram-Schmidt process for each endmember spectrum. And then, these orthogonal vectors are used as projection vector for the pixel signature. The unconstrained abundance can be obtained directly by projecting the signature to the projection vectors, and computing the ratio of projected vector length and orthogonal vector length. Compared to the Orthogonal Subspace Projection and Least Squares Error algorithms, this method does not need matrix inversion, which is much computation costing and hard to implement on hardware. It just completes the orthogonalization process by repeated vector operations, easy for application on both parallel computation and hardware. The reasonability of the algorithm is proved by its relationship with Orthogonal Sub-space Projection and Least Squares Error algorithms. And its computational complexity is also compared with the other two algorithms', which is the lowest one. At last, the experimental results on synthetic image and real image are also provided, giving another evidence for effectiveness of the method.
Efficiency Improvements of Antenna Optimization Using Orthogonal Fractional Experiments
Directory of Open Access Journals (Sweden)
Yen-Sheng Chen
2015-01-01
Full Text Available This paper presents an extremely efficient method for antenna design and optimization. Traditionally, antenna optimization relies on nature-inspired heuristic algorithms, which are time-consuming due to their blind-search nature. In contrast, design of experiments (DOE uses a completely different framework from heuristic algorithms, reducing the design cycle by formulating the surrogates of a design problem. However, the number of required simulations grows exponentially if a full factorial design is used. In this paper, a much more efficient technique is presented to achieve substantial time savings. By using orthogonal fractional experiments, only a small subset of the full factorial design is required, yet the resultant response surface models are still effective. The capability of orthogonal fractional experiments is demonstrated through three examples, including two tag antennas for radio-frequency identification (RFID applications and one internal antenna for long-term-evolution (LTE handheld devices. In these examples, orthogonal fractional experiments greatly improve the efficiency of DOE, thereby facilitating the antenna design with less simulation runs.
On orthogonality preserving quadratic stochastic operators
Energy Technology Data Exchange (ETDEWEB)
Mukhamedov, Farrukh; Taha, Muhammad Hafizuddin Mohd [Department of Computational and Theoretical Sciences, Faculty of Science International Islamic University Malaysia, P.O. Box 141, 25710 Kuantan, Pahang Malaysia (Malaysia)
2015-05-15
A quadratic stochastic operator (in short QSO) is usually used to present the time evolution of differing species in biology. Some quadratic stochastic operators have been studied by Lotka and Volterra. In the present paper, we first give a simple characterization of Volterra QSO in terms of absolutely continuity of discrete measures. Further, we introduce a notion of orthogonal preserving QSO, and describe such kind of operators defined on two dimensional simplex. It turns out that orthogonal preserving QSOs are permutations of Volterra QSO. The associativity of genetic algebras generated by orthogonal preserving QSO is studied too.
On orthogonality preserving quadratic stochastic operators
International Nuclear Information System (INIS)
Mukhamedov, Farrukh; Taha, Muhammad Hafizuddin Mohd
2015-01-01
A quadratic stochastic operator (in short QSO) is usually used to present the time evolution of differing species in biology. Some quadratic stochastic operators have been studied by Lotka and Volterra. In the present paper, we first give a simple characterization of Volterra QSO in terms of absolutely continuity of discrete measures. Further, we introduce a notion of orthogonal preserving QSO, and describe such kind of operators defined on two dimensional simplex. It turns out that orthogonal preserving QSOs are permutations of Volterra QSO. The associativity of genetic algebras generated by orthogonal preserving QSO is studied too
Wang, Xueyi
2012-02-08
The k-nearest neighbors (k-NN) algorithm is a widely used machine learning method that finds nearest neighbors of a test object in a feature space. We present a new exact k-NN algorithm called kMkNN (k-Means for k-Nearest Neighbors) that uses the k-means clustering and the triangle inequality to accelerate the searching for nearest neighbors in a high dimensional space. The kMkNN algorithm has two stages. In the buildup stage, instead of using complex tree structures such as metric trees, kd-trees, or ball-tree, kMkNN uses a simple k-means clustering method to preprocess the training dataset. In the searching stage, given a query object, kMkNN finds nearest training objects starting from the nearest cluster to the query object and uses the triangle inequality to reduce the distance calculations. Experiments show that the performance of kMkNN is surprisingly good compared to the traditional k-NN algorithm and tree-based k-NN algorithms such as kd-trees and ball-trees. On a collection of 20 datasets with up to 10(6) records and 10(4) dimensions, kMkNN shows a 2-to 80-fold reduction of distance calculations and a 2- to 60-fold speedup over the traditional k-NN algorithm for 16 datasets. Furthermore, kMkNN performs significant better than a kd-tree based k-NN algorithm for all datasets and performs better than a ball-tree based k-NN algorithm for most datasets. The results show that kMkNN is effective for searching nearest neighbors in high dimensional spaces.
PAPR Reduction of OFDM Signals by Novel Global Harmony Search in PTS Scheme
Directory of Open Access Journals (Sweden)
Hojjat Salehinejad
2012-01-01
Full Text Available The orthogonal frequency division multiplexing (OFDM modulation technique is one of the key strategies for multiuser signal transmission especially in smart grids and wind farms. This paper introduces an approach for peak-to-average power ratio (PAPR reduction of such signals based on novel global harmony search (NGHS and partial transmit sequence (PTS schemes. In PTS technique, the data block to be transmitted is partitioned into disjoint subblocks, which are combined using phase factors to minimize PAPR. The PTS requires an exhaustive search over all combinations of allowed phase factors. Therefore, with respect to the fast implementation and simplicity of NGHS technique, we could achieve significant reduction of PAPR.
Definite Integrals using Orthogonality and Integral Transforms
Directory of Open Access Journals (Sweden)
Howard S. Cohl
2012-10-01
Full Text Available We obtain definite integrals for products of associated Legendre functions with Bessel functions, associated Legendre functions, and Chebyshev polynomials of the first kind using orthogonality and integral transforms.
Sign patterns of J-orthogonal matrices
Czech Academy of Sciences Publication Activity Database
Hall, F.J.; Li, Z.; Parnass, C.; Rozložník, Miroslav
2017-01-01
Roč. 5, č. 1 (2017), s. 225-241 ISSN 2300-7451 Institutional support: RVO:67985840 Keywords : G-matrix * J-orthogonal matrix * sign pattern matrix * sign patterns that allow J-orthogonality Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics https://www.degruyter.com/view/j/spma.2017.5.issue-1/spma-2017-0016/spma-2017-0016.xml?format=INT
Sign patterns of J-orthogonal matrices
Czech Academy of Sciences Publication Activity Database
Hall, F.J.; Li, Z.; Parnass, C.; Rozložník, Miroslav
2017-01-01
Roč. 5, č. 1 (2017), s. 225-241 ISSN 2300-7451 Institutional support: RVO:67985840 Keywords : G-matrix * J-orthogonal matrix * sign pattern matrix * sign patterns that allow J-orthogonality Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics https://www.degruyter.com/view/j/spma.2017.5.issue-1/spma-2017-0016/spma-2017-0016. xml ?format=INT
Maoz, Dan; Loeb, Abraham
2017-06-01
If fast radio bursts (FRBs) originate from galaxies at cosmological distances, then their all-sky rate implies that the Milky Way may host an FRB every 30-1500 yr, on average. If many FRBs persistently repeat for decades or more, a local giant FRB could be active now, with 1 GHz radio pulses of flux ˜3 × 1010 Jy, comparable with the fluxes and frequencies detectable by cellular communication devices (cell phones, Wi-Fi and GPS). We propose searching for Galactic FRBs using a global array of low-cost radio receivers. One possibility is the ˜1 GHz communication channel in cellular phones, through a Citizens-Science downloadable application. Participating phones would continuously listen for and record candidate FRBs and would periodically upload information to a central data-processing website which will identify the signature of a real, globe-encompassing, FRB from an astronomical distance. Triangulation of the GPS-based pulse arrival times reported from different Earth locations will provide the FRB sky position, potentially to arcsecond accuracy. Pulse arrival times versus frequency, from reports from phones operating at diverse frequencies, or from fast signal de-dispersion by the application, will yield the dispersion measure (DM). Compared to a Galactic DM model, it will indicate the source distance within the Galaxy. A variant approach uses the built-in ˜100 MHz FM-radio receivers present in cell phones for an FRB search at lower frequencies. Alternatively, numerous 'software-defined radio' devices, costing ˜$10 US each, could be deployed and plugged into USB ports of personal computers (particularly in radio-quiet locations) to establish the global network of receivers.
International Nuclear Information System (INIS)
Meadows, J.W.; Smith, D.L.; Ikeda, Y.; Konno, C.
1990-01-01
Identical sample packets, each containing samples of elemental copper, silver, europium, terbium, and hafnium, as well as titanium, iron and nickel as dosimeters, have been irradiated in three distinct accelerator neutron fields (at Argonne National Laboratory and Los Alamos National Laboratory in the U.S.A., and Japan Atomic Energy Research Institute, Tokai, Japan) as part of an interlaboratory research collaboration to search for the production of long-lived radionuclides for fusion waste disposal applications. This paper is a progress report on this project. To date, we have detected the following activities, and have obtained preliminary experimental cross section values for several of these: Ag-106m,108m,110m; Eu-150m,152g,154; Tb-158,160; and Hf-175,178m2,179m2,181. (author). 11 refs, 1 fig., 4 tabs
Eftekhari, T.; Berger, E.; Williams, P. K. G.; Blanchard, P. K.
2018-06-01
The discovery of a repeating fast radio burst (FRB) has led to the first precise localization, an association with a dwarf galaxy, and the identification of a coincident persistent radio source. However, further localizations are required to determine the nature of FRBs, the sources powering them, and the possibility of multiple populations. Here we investigate the use of associated persistent radio sources to establish FRB counterparts, taking into account the localization area and the source flux density. Due to the lower areal number density of radio sources compared to faint optical sources, robust associations can be achieved for less precise localizations as compared to direct optical host galaxy associations. For generally larger localizations that preclude robust associations, the number of candidate hosts can be reduced based on the ratio of radio-to-optical brightness. We find that confident associations with sources having a flux density of ∼0.01–1 mJy, comparable to the luminosity of the persistent source associated with FRB 121102 over the redshift range z ≈ 0.1–1, require FRB localizations of ≲20″. We demonstrate that even in the absence of a robust association, constraints can be placed on the luminosity of an associated radio source as a function of localization and dispersion measure (DM). For DM ≈1000 pc cm‑3, an upper limit comparable to the luminosity of the FRB 121102 persistent source can be placed if the localization is ≲10″. We apply our analysis to the case of the ASKAP FRB 170107, using optical and radio observations of the localization region. We identify two candidate hosts based on a radio-to-optical brightness ratio of ≳100. We find that if one of these is indeed associated with FRB 170107, the resulting radio luminosity (1029‑ 4 × 1030 erg s‑1 Hz‑1, as constrained from the DM value) is comparable to the luminosity of the FRB 121102 persistent source.
Interlacing of zeros of quasi-orthogonal meixner polynomials | Driver ...
African Journals Online (AJOL)
... interlacing of zeros of quasi-orthogonal Meixner polynomials Mn(x;β; c) with the zeros of their nearest orthogonal counterparts Mt(x;β + k; c), l; n ∈ ℕ, k ∈ {1; 2}; is also discussed. Mathematics Subject Classication (2010): 33C45, 42C05. Key words: Discrete orthogonal polynomials, quasi-orthogonal polynomials, Meixner
Orthogonality catastrophe and fractional exclusion statistics
Ares, Filiberto; Gupta, Kumar S.; de Queiroz, Amilcar R.
2018-02-01
We show that the N -particle Sutherland model with inverse-square and harmonic interactions exhibits orthogonality catastrophe. For a fixed value of the harmonic coupling, the overlap of the N -body ground state wave functions with two different values of the inverse-square interaction term goes to zero in the thermodynamic limit. When the two values of the inverse-square coupling differ by an infinitesimal amount, the wave function overlap shows an exponential suppression. This is qualitatively different from the usual power law suppression observed in the Anderson's orthogonality catastrophe. We also obtain an analytic expression for the wave function overlaps for an arbitrary set of couplings, whose properties are analyzed numerically. The quasiparticles constituting the ground state wave functions of the Sutherland model are known to obey fractional exclusion statistics. Our analysis indicates that the orthogonality catastrophe may be valid in systems with more general kinds of statistics than just the fermionic type.
Orthogonal Coupling in Cavity BPM with Slots
Lipka, D; Siemens, M; Vilcins, S; Caspers, Friedhelm; Stadler, M; Treyer, DM; Maesaka, H; Shintake, T
2009-01-01
XFELs require high precision orbit control in their long undulator sections. Due to the pulsed operation of drive linacs the high precision has to be reached by single bunch measurements. So far only cavity BPMs achieve the required performance and will be used at the European XFEL, one between each of the up to 116 undulators. Coupling between the orthogonal planes limits the performance of beam position measurements. A first prototype build at DESY shows a coupling between orthogonal planes of about -20 dB, but the requirement is lower than -40 dB (1%). The next generation cavity BPM was build with tighter tolerances and mechanical changes, the orthogonal coupling is measured to be lower than -43 dB. This report discusses the various observations, measurements and improvements which were done.
Riemannian geometry in an orthogonal frame
Cartan, Elie Joseph
2001-01-01
Foreword by S S Chern. In 1926-27, Cartan gave a series of lectures in which he introduced exterior forms at the very beginning and used extensively orthogonal frames throughout to investigate the geometry of Riemannian manifolds. In this course he solved a series of problems in Euclidean and non-Euclidean spaces, as well as a series of variational problems on geodesics. In 1960, Sergei P Finikov translated from French into Russian his notes of these Cartan's lectures and published them as a book entitled Riemannian Geometry in an Orthogonal Frame. This book has many innovations, such as the n
Differential recurrence formulae for orthogonal polynomials
Directory of Open Access Journals (Sweden)
Anton L. W. von Bachhaus
1995-11-01
Full Text Available Part I - By combining a general 2nd-order linear homogeneous ordinary differential equation with the three-term recurrence relation possessed by all orthogonal polynomials, it is shown that sequences of orthogonal polynomials which satisfy a differential equation of the above mentioned type necessarily have a differentiation formula of the type: gn(xY'n(x=fn(xYn(x+Yn-1(x. Part II - A recurrence formula of the form: rn(xY'n(x+sn(xY'n+1(x+tn(xY'n-1(x=0, is derived using the result of Part I.
Kozma, Eszter; Demeter, Orsolya; Kele, Péter
2017-03-16
Bio-orthogonal labelling schemes based on inverse-electron-demand Diels-Alder (IEDDA) cycloaddition have attracted much attention in chemical biology recently. The appealing features of this reaction, such as the fast reaction kinetics, fully bio-orthogonal nature and high selectivity, have helped chemical biologists gain deeper understanding of biochemical processes at the molecular level. Listing the components and discussing the possibilities and limitations of these reagents, we provide a recent snapshot of the field of IEDDA-based biomolecular manipulation with special focus on fluorescent modulation approaches through the use of bio-orthogonalized building blocks. At the end, we discuss challenges that need to be addressed for further developments in order to overcome recent limitations and to enable researchers to answer biomolecular questions in more detail. © 2017 The Authors. Published by Wiley-VCH Verlag GmbH & Co. KGaA.
Nonclassical Orthogonal Polynomials and Corresponding Quadratures
Fukuda, H; Alt, E O; Matveenko, A V
2004-01-01
We construct nonclassical orthogonal polynomials and calculate abscissas and weights of Gaussian quadrature for arbitrary weight and interval. The program is written by Mathematica and it works if moment integrals are given analytically. The result is a FORTRAN subroutine ready to utilize the quadrature.
A new description of orthogonal bases
Coecke, Bob; Pavlovic, Dusko; Vicary, Jamie
2012-01-01
We show that an orthogonal basis for a finite-dimensional Hilbert space can be equivalently characterised as a commutative †-Frobenius monoid in the category FdHilb, which has finite-dimensional Hilbert spaces as objects and continuous linear maps as morphisms, and tensor product for the monoidal
A class of orthogonal nonrecursive binomial filters.
Haddad, R. A.
1971-01-01
The time- and frequency-domain properties of the orthogonal binomial sequences are presented. It is shown that these sequences, or digital filters based on them, can be generated using adders and delay elements only. The frequency-domain behavior of these nonrecursive binomial filters suggests a number of applications as low-pass Gaussian filters or as inexpensive bandpass filters.
Local copying of orthogonal entangled quantum states
International Nuclear Information System (INIS)
Anselmi, Fabio; Chefles, Anthony; Plenio, Martin B
2004-01-01
In classical information theory one can, in principle, produce a perfect copy of any input state. In quantum information theory, the no cloning theorem prohibits exact copying of non-orthogonal states. Moreover, if we wish to copy multiparticle entangled states and can perform only local operations and classical communication (LOCC), then further restrictions apply. We investigate the problem of copying orthogonal, entangled quantum states with an entangled blank state under the restriction to LOCC. Throughout, the subsystems have finite dimension D. We show that if all of the states to be copied are non-maximally entangled, then novel LOCC copying procedures based on entanglement catalysis are possible. We then study in detail the LOCC copying problem where both the blank state and at least one of the states to be copied are maximally entangled. For this to be possible, we find that all the states to be copied must be maximally entangled. We obtain a necessary and sufficient condition for LOCC copying under these conditions. For two orthogonal, maximally entangled states, we provide the general solution to this condition. We use it to show that for D = 2, 3, any pair of orthogonal, maximally entangled states can be locally copied using a maximally entangled blank state. However, we also show that for any D which is not prime, one can construct pairs of such states for which this is impossible
Many-body orthogonal polynomial systems
International Nuclear Information System (INIS)
Witte, N.S.
1997-03-01
The fundamental methods employed in the moment problem, involving orthogonal polynomial systems, the Lanczos algorithm, continued fraction analysis and Pade approximants has been combined with a cumulant approach and applied to the extensive many-body problem in physics. This has yielded many new exact results for many-body systems in the thermodynamic limit - for the ground state energy, for excited state gaps, for arbitrary ground state avenges - and are of a nonperturbative nature. These results flow from a confluence property of the three-term recurrence coefficients arising and define a general class of many-body orthogonal polynomials. These theorems constitute an analytical solution to the Lanczos algorithm in that they are expressed in terms of the three-term recurrence coefficients α and β. These results can also be applied approximately for non-solvable models in the form of an expansion, in a descending series of the system size. The zeroth order order this expansion is just the manifestation of the central limit theorem in which a Gaussian measure and hermite polynomials arise. The first order represents the first non-trivial order, in which classical distribution functions like the binomial distributions arise and the associated class of orthogonal polynomials are Meixner polynomials. Amongst examples of systems which have infinite order in the expansion are q-orthogonal polynomials where q depends on the system size in a particular way. (author)
Properties of the Magnitude Terms of Orthogonal Scaling Functions.
Tay, Peter C; Havlicek, Joseph P; Acton, Scott T; Hossack, John A
2010-09-01
The spectrum of the convolution of two continuous functions can be determined as the continuous Fourier transform of the cross-correlation function. The same can be said about the spectrum of the convolution of two infinite discrete sequences, which can be determined as the discrete time Fourier transform of the cross-correlation function of the two sequences. In current digital signal processing, the spectrum of the contiuous Fourier transform and the discrete time Fourier transform are approximately determined by numerical integration or by densely taking the discrete Fourier transform. It has been shown that all three transforms share many analogous properties. In this paper we will show another useful property of determining the spectrum terms of the convolution of two finite length sequences by determining the discrete Fourier transform of the modified cross-correlation function. In addition, two properties of the magnitude terms of orthogonal wavelet scaling functions are developed. These properties are used as constraints for an exhaustive search to determine an robust lower bound on conjoint localization of orthogonal scaling functions.
Fast searching in packed strings
DEFF Research Database (Denmark)
Bille, Philip
2011-01-01
Given strings P and Q the (exact) string matching problem is to find all positions of substrings in Q matching P. The classical Knuth–Morris–Pratt algorithm [SIAM J. Comput. 6 (2) (1977) 323–350] solves the string matching problem in linear time which is optimal if we can only read one character...... at the time. However, most strings are stored in a computer in a packed representation with several characters in a single word, giving us the opportunity to read multiple characters simultaneously. In this paper we study the worst-case complexity of string matching on strings given in packed representation....... Let m⩽n be the lengths P and Q, respectively, and let σ denote the size of the alphabet. On a standard unit-cost word-RAM with logarithmic word size we present an algorithm using timeO(nlogσn+m+occ). Here occ is the number of occurrences of P in Q. For m=o(n) this improves the O(n) bound of the Knuth...
Fast Searching in Packed Strings
DEFF Research Database (Denmark)
Bille, Philip
2009-01-01
Given strings P and Q the (exact) string matching problem is to find all positions of substrings in Q matching P. The classical Knuth-Morris-Pratt algorithm [SIAM J. Comput., 1977] solves the string matching problem in linear time which is optimal if we can only read one character at the time....... However, most strings are stored in a computer in a packed representation with several characters in a single word, giving us the opportunity to read multiple characters simultaneously. In this paper we study the worst-case complexity of string matching on strings given in packed representation. Let m...... word-RAM with logarithmic word size we present an algorithm using time O(n/log(sigma) n + m + occ) Here occ is the number of occurrences of P in Q. For m = o(n) this improves the O(n) bound...
Directory of Open Access Journals (Sweden)
RUDIANTO AMIRTA
2016-05-01
Full Text Available Abstract. Amirta R, Yuliansyah, Angi EM, Ananto BR, Setiyono B, Haqiqi MT, Septiana HA, Lodong M, Oktavianto RN. 2016. Plant diversity and energy potency of community forest in East Kalimantan, Indonesia: Searching for fast growing wood species for energy production. Nusantara Bioscience 8: 22-30. Nowadays, there is an increasing interest in intensifying the production and use of biomass to replace fossil fuels for the production of heat and electricity, especially for a remote area that generally abundance with the wood biomass resources including in East Kalimantan, Indonesia. In this work, diversity of plant species that commonly growth in community forest area of East Kutai District, East Kalimantan, Indonesia had been studied to point out their energy potency to be used as biomass feedstock for the electricity generated. Diversity of plant species in the community forest was evaluated by making 13 sampling plots with 20mx20m size approximately. Concurently, the energy properties of plant biomass such as proximate and ultimate compositions were also analyzed using ASTM methods. Results showed that more than 30 species of tropical trees and wood shrubs were grown in the community forest. The presence of them was classified into two different growth of origins: natural and artificial plantation, and also three different categories of plant resources: tree species from logged over forest, commercial fast growing plant tree species for the fiber production and woody shrubs. The highest dominancy and productivity was found in Paraserianthes falcataria (L. Nielsen since the wood biomass was artificially planted for the commercial purposes. Among the 31 plant species analyzed we found the highest energy potency was obtained from Cratoxylum cochinchinense (Lour. Blume that produced 3.17 MWh/ton, and the lowest was from Trema orientalis (L. Blume 0.97 MWh/ton. The woody shrubs species such as Vernonia amigdalina Delile., Piper aduncum L., Gliricidia
The Fractional Orthogonal Difference with Applications
Directory of Open Access Journals (Sweden)
Enno Diekema
2015-06-01
Full Text Available This paper is a follow-up of a previous paper of the author published in Mathematics journal in 2015, which treats the so-called continuous fractional orthogonal derivative. In this paper, we treat the discrete case using the fractional orthogonal difference. The theory is illustrated with an application of a fractional differentiating filter. In particular, graphs are presented of the absolutel value of the modulus of the frequency response. These make clear that for a good insight into the behavior of a fractional differentiating filter, one has to look for the modulus of its frequency response in a log-log plot, rather than for plots in the time domain.
Effective Results Analysis for the Similar Software Products’ Orthogonality
Directory of Open Access Journals (Sweden)
Ion Ivan
2009-10-01
Full Text Available It is defined the concept of similar software. There are established conditions of archiving the software components. It is carried out the orthogonality evaluation and the correlation between the orthogonality and the complexity of the homogenous software components is analyzed. Shall proceed to build groups of similar software products, belonging to the orthogonality intervals. There are presented in graphical form the results of the analysis. There are detailed aspects of the functioning of the software product allocated for the orthogonality.
Characterizing locally distinguishable orthogonal product states
Feng, Yuan; Shi, Yaoyun
2007-01-01
Bennett et al. \\cite{BDF+99} identified a set of orthogonal {\\em product} states in the $3\\otimes 3$ Hilbert space such that reliably distinguishing those states requires non-local quantum operations. While more examples have been found for this counter-intuitive ``nonlocality without entanglement'' phenomenon, a complete and computationally verifiable characterization for all such sets of states remains unknown. In this Letter, we give such a characterization for the $3\\otimes 3$ space.
Rotation of 2D orthogonal polynomials
Czech Academy of Sciences Publication Activity Database
Yang, B.; Flusser, Jan; Kautský, J.
2018-01-01
Roč. 102, č. 1 (2018), s. 44-49 ISSN 0167-8655 R&D Projects: GA ČR GA15-16928S Institutional support: RVO:67985556 Keywords : Rotation invariants * Orthogonal polynomials * Recurrent relation * Hermite-like polynomials * Hermite moments Subject RIV: JD - Computer Applications, Robotics Impact factor: 1.995, year: 2016 http://library.utia.cas.cz/separaty/2017/ZOI/flusser-0483250.pdf
Biogeography-Based Optimization with Orthogonal Crossover
Directory of Open Access Journals (Sweden)
Quanxi Feng
2013-01-01
Full Text Available Biogeography-based optimization (BBO is a new biogeography inspired, population-based algorithm, which mainly uses migration operator to share information among solutions. Similar to crossover operator in genetic algorithm, migration operator is a probabilistic operator and only generates the vertex of a hyperrectangle defined by the emigration and immigration vectors. Therefore, the exploration ability of BBO may be limited. Orthogonal crossover operator with quantization technique (QOX is based on orthogonal design and can generate representative solution in solution space. In this paper, a BBO variant is presented through embedding the QOX operator in BBO algorithm. Additionally, a modified migration equation is used to improve the population diversity. Several experiments are conducted on 23 benchmark functions. Experimental results show that the proposed algorithm is capable of locating the optimal or closed-to-optimal solution. Comparisons with other variants of BBO algorithms and state-of-the-art orthogonal-based evolutionary algorithms demonstrate that our proposed algorithm possesses faster global convergence rate, high-precision solution, and stronger robustness. Finally, the analysis result of the performance of QOX indicates that QOX plays a key role in the proposed algorithm.
Non-Orthogonal Opportunistic Beamforming: Performance Analysis and Implementation
Xia, Minghua; Wu, Yik-Chung; Aissa, Sonia
2012-01-01
be successfully served within a single transmission, non-orthogonal OBF can be applied to obtain lower worst-case delay among the users. On the other hand, if user traffic is heavy, non-orthogonal OBF is inferior to orthogonal OBF in terms of sum-rate and packet
Hypergeometric series recurrence relations and some new orthogonal functions
International Nuclear Information System (INIS)
Wilson, J.A.
1978-01-01
A set of hypergeometric orthogonal polynomials, a set of biorthogonal rational functions generalizing them, and some new three-term relations for hypergeometric series containing properties of these functions are exhibited. The orthogonal polynomials depend on four free parameters, and their orthogonality relations include as special or limiting cases the orthogonalities for the classical polynomials, the Hahn and dual Hahn polynomials, Pollaczek's polynomials orthogonal on an infinite interval, and the 6-j symbols of angular momentum in quantum mechanics. Their properties include a second-order difference equation and a Rodrigues-type formula involving a divided difference operator
DEFF Research Database (Denmark)
Dmitrova, Evgenia; Jóhannsson, Hjörtur; Nielsen, Arne Hejde
2013-01-01
This paper presents a method for a fast determination of the grid nodes where countermeasures, in the form of changes in nodal admittance, would provide greatest impact on the stability margin for a specific generator that is facing the risk of instability. The sensitivity of the stability criter...... of the developed approach for the fast identification of the optimal nodes for countermeasure application....
Polar plate theory for orthogonal anisotropy
Bailey, Michelle D.
1998-11-01
The following paper discusses the derivation and evaluation of the plate equations for a circular composite disk with orthogonal anisotropy. The work will be on a macromechanical level and include buckling, static and dynamic load applications. Necessary to a complete examination of the circular disk is the conversion of the stiffness matrix to cylindrical coordinates. In the transformed state, these coefficients are no longer constant, adding to the complexity of the proposed differential equations. Laminated fiber-reinforced (or filamentary) composites are used today for their high strength-to weight and stiffness-to-weight ratios. However, because of the typical anisotropic behavior of composites, determining the material properties on a microscopic level and the mechanics on a macroscopic level is much more difficult. This difficulty manifests itself particularly well in the evaluation of material properties and governing differential equations of a circular disk with the fibers of the lamina oriented orthogonally. One could encounter such a situation in space structures that require a circular geometry. For example, determining fastener pull through in a circular composite plate would best be performed in a polar coordinate system. In order to calculate the strain (which is a function of the angle, θ) from the displacements, the stiffness matrix and boundary conditions would need to be expressed in cylindrical coordinates. Naturally the composite would be constructed with fibers in orthogonal directions, then the necessary geometry would be cut out, thus the required lengthy transformation of coordinate systems. To bypass this derivation, numerical methods have been used and finite element models have been attempted. FEM over predicts plate stiffness by 20% and underpredicts failure by 70%. Obviously there is a need to transform classical plate theory to a cylindrical coordinate system.
New discrete orthogonal moments for signal analysis
Czech Academy of Sciences Publication Activity Database
Honarvar Shakibaei Asli, Barmak; Flusser, Jan
2017-01-01
Roč. 141, č. 1 (2017), s. 57-73 ISSN 0165-1684 R&D Projects: GA ČR GA15-16928S Institutional support: RVO:67985556 Keywords : Orthogonal polynomials * Moment functions * Z-transform * Rodrigues formula * Hypergeometric form Subject RIV: JD - Computer Applications, Robotics OBOR OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8) Impact factor: 3.110, year: 2016 http://library.utia.cas.cz/separaty/2017/ZOI/flusser-0475248.pdf
Ortega-Quijano, Noé; Fade, Julien; Roche, Muriel; Parnet, François; Alouini, Mehdi
2016-04-01
Polarimetric sensing by orthogonality breaking has been recently proposed as an alternative technique for performing direct and fast polarimetric measurements using a specific dual-frequency dual-polarization (DFDP) source. Based on the instantaneous Stokes-Mueller formalism to describe the high-frequency evolution of the DFDP beam intensity, we thoroughly analyze the interaction of such a beam with birefringent, dichroic and depolarizing samples. This allows us to confirm that orthogonality breaking is produced by the sample diattenuation, whereas this technique is immune to both birefringence and diagonal depolarization. We further analyze the robustness of this technique when polarimetric sensing is performed through a birefringent waveguide, and the optimal DFDP source configuration for fiber-based endoscopic measurements is subsequently identified. Finally, we consider a stochastic depolarization model based on an ensemble of random linear diattenuators, which makes it possible to understand the progressive vanishing of the detected orthogonality breaking signal as the spatial heterogeneity of the sample increases, thus confirming the insensitivity of this method to diagonal depolarization. The fact that the orthogonality breaking signal is exclusively due to the sample dichroism is an advantageous feature for the precise decoupled characterization of such an anisotropic parameter in samples showing several simultaneous effects.
An Orthogonal Learning Differential Evolution Algorithm for Remote Sensing Image Registration
Directory of Open Access Journals (Sweden)
Wenping Ma
2014-01-01
Full Text Available We introduce an area-based method for remote sensing image registration. We use orthogonal learning differential evolution algorithm to optimize the similarity metric between the reference image and the target image. Many local and global methods have been used to achieve the optimal similarity metric in the last few years. Because remote sensing images are usually influenced by large distortions and high noise, local methods will fail in some cases. For this reason, global methods are often required. The orthogonal learning (OL strategy is efficient when searching in complex problem spaces. In addition, it can discover more useful information via orthogonal experimental design (OED. Differential evolution (DE is a heuristic algorithm. It has shown to be efficient in solving the remote sensing image registration problem. So orthogonal learning differential evolution algorithm (OLDE is efficient for many optimization problems. The OLDE method uses the OL strategy to guide the DE algorithm to discover more useful information. Experiments show that the OLDE method is more robust and efficient for registering remote sensing images.
A novel orthogonally linearly polarized Nd:YVO4 laser
International Nuclear Information System (INIS)
Xing-Peng, Yan; Qiang, Liu; Hai-Long, Chen; Xing, Fu; Ma-Li, Gong; Dong-Sheng, Wang
2010-01-01
We presented a novel orthogonally linearly polarized Nd:YVO 4 laser. Two pieces of α-cut grown-together composite YVO 4 /Nd:YVO 4 crystals were placed in the resonant cavity with the c-axis of the two crystals orthogonally. The polarization and power performance of the orthogonally polarized laser were investigated. A 26.2-W orthogonally linearly polarized laser was obtained. The power ratio between the two orthogonally polarized lasers was varied with the pump power caused by the polarized mode coupling. The longitudinal modes competition and the corresponding variable optical beats were also observed from the orthogonally polarized laser. We also adjusted the crystals with their c-axis parallele to each other, and a 40.7-W linearly polarized TEM 00 laser was obtained, and the beam quality factors were M x 2 = 1.37 and M y 2 = 1.25. (classical areas of phenomenology)
Effective Results Analysis for the Similar Software Products’ Orthogonality
Ion Ivan; Daniel Milodin
2009-01-01
It is defined the concept of similar software. There are established conditions of archiving the software components. It is carried out the orthogonality evaluation and the correlation between the orthogonality and the complexity of the homogenous software components is analyzed. Shall proceed to build groups of similar software products, belonging to the orthogonality intervals. There are presented in graphical form the results of the analysis. There are detailed aspects of the functioning o...
International Nuclear Information System (INIS)
Hall, R.S.; Vignon, D.
1985-01-01
The paper concerns the evolution of fast reactors over the past 30 years, and their present status. Fast reactor development in different countries is described, and the present position, with emphasis on cost reduction and collaboration, is examined. The French development of the fast breeder type reactor is reviewed, and includes: the acquisition of technical skills, the search for competitive costs and the spx2 project, and more advanced designs. Future prospects are also discussed. (U.K.)
Fast Link Adaptation for MIMO-OFDM
DEFF Research Database (Denmark)
Jensen, Tobias Lindstrøm; Kant, Shashi; Wehinger, Joachim
2010-01-01
We investigate link-quality metrics (LQMs) based on raw bit-error-rate, effective signal-to-interference-plus-noise ratio, and mutual information (MI) for the purpose of fast link adaptation (LA) in communication systems employing orthogonal frequency-division multiplexing and multiple-input–mult......We investigate link-quality metrics (LQMs) based on raw bit-error-rate, effective signal-to-interference-plus-noise ratio, and mutual information (MI) for the purpose of fast link adaptation (LA) in communication systems employing orthogonal frequency-division multiplexing and multiple...
Higher spin currents in orthogonal Wolf space
International Nuclear Information System (INIS)
Ahn, Changhyun; Paeng, Jinsub
2015-01-01
For the N=4 superconformal coset theory by ((SO(N+4))/(SO(N)×SU(2)))×U(1) (that contains an orthogonal Wolf space) with N = 4, the N=2 WZW affine current algebra is obtained. The 16 generators (or 11 generators) of the large N=4 linear (or nonlinear) superconformal algebra are described by these WZW affine currents explicitly. Along the line of large N=4 holography, the extra 16 currents with spins (2,(5/2),(5/2),3), ((5/2),3,3,(7/2)), ((5/2),3,3,(7/2)), and (3,(7/2),(7/2),4) are obtained in terms of the WZW affine currents. The lowest spin of this N=4 multiplet is two rather than one, which is for a unitary Wolf space. The operator product expansions between the above 11 currents and these extra 16 higher spin currents are found explicitly. (paper)
Kernel versions of some orthogonal transformations
DEFF Research Database (Denmark)
Nielsen, Allan Aasbjerg
Kernel versions of orthogonal transformations such as principal components are based on a dual formulation also termed Q-mode analysis in which the data enter into the analysis via inner products in the Gram matrix only. In the kernel version the inner products of the original data are replaced...... by inner products between nonlinear mappings into higher dimensional feature space. Via kernel substitution also known as the kernel trick these inner products between the mappings are in turn replaced by a kernel function and all quantities needed in the analysis are expressed in terms of this kernel...... function. This means that we need not know the nonlinear mappings explicitly. Kernel principal component analysis (PCA) and kernel minimum noise fraction (MNF) analyses handle nonlinearities by implicitly transforming data into high (even infinite) dimensional feature space via the kernel function...
Large Covariance Estimation by Thresholding Principal Orthogonal Complements
Fan, Jianqing; Liao, Yuan; Mincheva, Martina
2012-01-01
This paper deals with the estimation of a high-dimensional covariance with a conditional sparsity structure and fast-diverging eigenvalues. By assuming sparse error covariance matrix in an approximate factor model, we allow for the presence of some cross-sectional correlation even after taking out common but unobservable factors. We introduce the Principal Orthogonal complEment Thresholding (POET) method to explore such an approximate factor structure with sparsity. The POET estimator includes the sample covariance matrix, the factor-based covariance matrix (Fan, Fan, and Lv, 2008), the thresholding estimator (Bickel and Levina, 2008) and the adaptive thresholding estimator (Cai and Liu, 2011) as specific examples. We provide mathematical insights when the factor analysis is approximately the same as the principal component analysis for high-dimensional data. The rates of convergence of the sparse residual covariance matrix and the conditional sparse covariance matrix are studied under various norms. It is shown that the impact of estimating the unknown factors vanishes as the dimensionality increases. The uniform rates of convergence for the unobserved factors and their factor loadings are derived. The asymptotic results are also verified by extensive simulation studies. Finally, a real data application on portfolio allocation is presented. PMID:24348088
Large Covariance Estimation by Thresholding Principal Orthogonal Complements.
Fan, Jianqing; Liao, Yuan; Mincheva, Martina
2013-09-01
This paper deals with the estimation of a high-dimensional covariance with a conditional sparsity structure and fast-diverging eigenvalues. By assuming sparse error covariance matrix in an approximate factor model, we allow for the presence of some cross-sectional correlation even after taking out common but unobservable factors. We introduce the Principal Orthogonal complEment Thresholding (POET) method to explore such an approximate factor structure with sparsity. The POET estimator includes the sample covariance matrix, the factor-based covariance matrix (Fan, Fan, and Lv, 2008), the thresholding estimator (Bickel and Levina, 2008) and the adaptive thresholding estimator (Cai and Liu, 2011) as specific examples. We provide mathematical insights when the factor analysis is approximately the same as the principal component analysis for high-dimensional data. The rates of convergence of the sparse residual covariance matrix and the conditional sparse covariance matrix are studied under various norms. It is shown that the impact of estimating the unknown factors vanishes as the dimensionality increases. The uniform rates of convergence for the unobserved factors and their factor loadings are derived. The asymptotic results are also verified by extensive simulation studies. Finally, a real data application on portfolio allocation is presented.
Orthogonal cutting of laser beam melted parts
Götze, Elisa; Zanger, Frederik; Schulze, Volker
2018-05-01
The finishing process of parts manufactured by laser beam melting is of high concern due to the lack of surface accuracy. Therefore, the focus of this work lies on the influence of the build-up direction of the parts and their effect on the finishing process. The orthogonal cutting reveals findings in the fields of chip formation, involved forces and temperatures appearing during machining. In the investigations, the cutting depth was varied between 0.05 and 0.15 mm representing a finishing process and the cutting velocity ranges from 30 to 200 m/min depending on the material. The experiments contain the materials stainless steel (AISI 316L), titanium (Ti6Al4V) and nickel-base alloy (IN718). The two materials named latter are of high interest in the aerospace sector and at the same time titanium is used in the medical field due to its biocompatibility. For the materials IN718 and Ti6Al4V a negative rake angle of -7.5° and for stainless steel a rake angle of 12.5° are chosen for the cutting experiments. The results provide the base for processing strategies. Therefore, the specimens were solely laser beam melted without post-processing like heat treatment. The evaluation of the experiments shows that an increase in cutting speed has different effects depending on the material. For stainless steel the measured forces regarding the machining direction to the layers approach the same values. In contrast, the influence of the layers regarding the forces appearing during orthogonal cutting of the materials IN718 and Ti6Al4V differ for lower cutting speeds.
Fast ultrasonic visualisation under sodium. Application to the fast neutron reactors
International Nuclear Information System (INIS)
Imbert, Ch.
1997-01-01
The fast ultrasonic visualization under sodium is in the programme of research and development on the inspection inside the fast neutron reactors. This work is about the development of a such system of fast ultrasonic imaging under sodium, in order to improve the existing visualization systems. This system is based on the principle of orthogonal imaging, it uses two linear antennas with an important dephasing having 128 piezo-composite elements of central frequency equal to 1.6 MHz. (N.C.)
Representations for the extreme zeros of orthogonal polynomials
van Doorn, Erik A.; van Foreest, Nicky D.; Zeifman, Alexander I.
2009-01-01
We establish some representations for the smallest and largest zeros of orthogonal polynomials in terms of the parameters in the three-terms recurrence relation. As a corollary we obtain representations for the endpoints of the true interval of orthogonality. Implications of these results for the
Construction of MDS self-dual codes from orthogonal matrices
Shi, Minjia; Sok, Lin; Solé, Patrick
2016-01-01
In this paper, we give algorithms and methods of construction of self-dual codes over finite fields using orthogonal matrices. Randomization in the orthogonal group, and code extension are the main tools. Some optimal, almost MDS, and MDS self-dual codes over both small and large prime fields are constructed.
Processing of dual-orthogonal cw polarimetric radar signals
Babur, G.
2009-01-01
The thesis consists of two parts. The first part is devoted to the theory of dual-orthogonal polarimetric radar signals with continuous waveforms. The thesis presents a comparison of the signal compression techniques, namely correlation and de-ramping methods, for the dual-orthogonal sophisticated
Nonambipolarity, orthogonal conductivity, poloidal flow, and torque
International Nuclear Information System (INIS)
Hulbert, G.W.; Perkins, F.W.
1989-02-01
Nonambipolar processes, such as neutral injection onto trapped orbits or ripple-diffusion loss of α-particles, act to charge a plasma. A current j/sub r/ across magnetic surfaces must arise in the bulk plasma to maintain charge neutrality. An axisymmetric, neoclassical model of the bulk plasma shows that these currents are carried by the ions and exert a j/sub r/B/sub θ/R/c torque in the toroidal direction. A driven poloidal flow V/sub θ/ = E/sub r/'c/B must also develop. The average current density is related to the radial electric field E/sub r/' = E/sub r/ + v/sub /phi//B/sub θ//c in a frame moving with the plasma via the orthogonal conductivity = σ/sub /perpendicular//E/sub r/', which has the value σ/sub /perpendicular// = (1.65ε/sup 1/2/)(ne 2 ν/sub ii//MΩ/sub θ/ 2 ) in the banana regime. If an ignited plasma loses an appreciable fraction Δ of its thermonuclear α-particles by banana ripple diffusion, then the torque will spin the plasma to sonic rotation in a time /tau//sub s/ ∼ 2/tau//sub E//Δ, /tau//sub E/ being the energy confinement time. 10 refs., 1 fig
Ocean Models and Proper Orthogonal Decomposition
Salas-de-Leon, D. A.
2007-05-01
The increasing computational developments and the better understanding of mathematical and physical systems resulted in an increasing number of ocean models. Long time ago, modelers were like a secret organization and recognize each other by using secret codes and languages that only a select group of people was able to recognize and understand. The access to computational systems was reduced, on one hand equipment and the using time of computers were expensive and restricted, and on the other hand, they required an advance computational languages that not everybody wanted to learn. Now a days most college freshman own a personal computer (PC or laptop), and/or have access to more sophisticated computational systems than those available for research in the early 80's. The resource availability resulted in a mayor access to all kind models. Today computer speed and time and the algorithms does not seem to be a problem, even though some models take days to run in small computational systems. Almost every oceanographic institution has their own model, what is more, in the same institution from one office to the next there are different models for the same phenomena, developed by different research member, the results does not differ substantially since the equations are the same, and the solving algorithms are similar. The algorithms and the grids, constructed with algorithms, can be found in text books and/or over the internet. Every year more sophisticated models are constructed. The Proper Orthogonal Decomposition is a technique that allows the reduction of the number of variables to solve keeping the model properties, for which it can be a very useful tool in diminishing the processes that have to be solved using "small" computational systems, making sophisticated models available for a greater community.
Skew-orthogonal polynomials, differential systems and random matrix theory
International Nuclear Information System (INIS)
Ghosh, S.
2007-01-01
We study skew-orthogonal polynomials with respect to the weight function exp[-2V (x)], with V (x) = Σ K=1 2d (u K /K)x K , u 2d > 0, d > 0. A finite subsequence of such skew-orthogonal polynomials arising in the study of Orthogonal and Symplectic ensembles of random matrices, satisfy a system of differential-difference-deformation equation. The vectors formed by such subsequence has the rank equal to the degree of the potential in the quaternion sense. These solutions satisfy certain compatibility condition and hence admit a simultaneous fundamental system of solutions. (author)
Orthogonal polynomials on the unit circle part 2 spectral theory
Simon, Barry
2013-01-01
This two-part book is a comprehensive overview of the theory of probability measures on the unit circle, viewed especially in terms of the orthogonal polynomials defined by those measures. A major theme involves the connections between the Verblunsky coefficients (the coefficients of the recurrence equation for the orthogonal polynomials) and the measures, an analog of the spectral theory of one-dimensional Schrödinger operators. Among the topics discussed along the way are the asymptotics of Toeplitz determinants (Szegő's theorems), limit theorems for the density of the zeros of orthogonal po
Orthogonal polynomials on the unit circle part 1 classical theory
2009-01-01
This two-part book is a comprehensive overview of the theory of probability measures on the unit circle, viewed especially in terms of the orthogonal polynomials defined by those measures. A major theme involves the connections between the Verblunsky coefficients (the coefficients of the recurrence equation for the orthogonal polynomials) and the measures, an analog of the spectral theory of one-dimensional Schrodinger operators. Among the topics discussed along the way are the asymptotics of Toeplitz determinants (SzegÅ‘'s theorems), limit theorems for the density of the zeros of orthogonal po
Orthogonal Algorithm of Logic Probability and Syndrome-Testable Analysis
Institute of Scientific and Technical Information of China (English)
无
1990-01-01
A new method,orthogonal algoritm,is presented to compute the logic probabilities(i.e.signal probabilities)accurately,The transfer properties of logic probabilities are studied first,which are useful for the calculation of logic probability of the circuit with random independent inputs.Then the orthogonal algoritm is described to compute the logic probability of Boolean function realized by a combinational circuit.This algorithm can make Boolean function “ORTHOGONAL”so that the logic probabilities can be easily calculated by summing up the logic probabilities of all orthogonal terms of the Booleam function.
Orthogonally Based Digital Content Management Applicable to Projects-bases
Directory of Open Access Journals (Sweden)
Daniel MILODIN
2009-01-01
Full Text Available There is defined the concept of digital content. The requirements of an efficient management of the digital content are established. There are listed the quality characteristics of digital content. Orthogonality indicators of digital content are built up. They are meant to measure the image, the sound as well as the text orthogonality as well. Projects-base concept is introduced. There is presented the model of structuring the content in order to maximize orthogonality via a convergent iterative process. The model is instantiated for the digital content of a projects-base. It is introduced the application used to test the model. The paper ends with conclusions.
Simulating Nonequilibrium Radiation via Orthogonal Polynomial Refinement
2015-01-07
measured by the preprocessing time, computer memory space, and average query time. In many search procedures for the number of points np of a data set, a...analytic expression for the radiative flux density is possible by the commonly accepted local thermal equilibrium ( LTE ) approximation. A semi...Vol. 227, pp. 9463-9476, 2008. 10. Galvez, M., Ray-Tracing model for radiation transport in three-dimensional LTE system, App. Physics, Vol. 38
A summation procedure for expansions in orthogonal polynomials
International Nuclear Information System (INIS)
Garibotti, C.R.; Grinstein, F.F.
1977-01-01
Approximants to functions defined by formal series expansions in orthogonal polynomials are introduced. They are shown to be convergent even out of the elliptical domain where the original expansion converges
Systems of Differential Equations with Skew-Symmetric, Orthogonal Matrices
Glaister, P.
2008-01-01
The solution of a system of linear, inhomogeneous differential equations is discussed. The particular class considered is where the coefficient matrix is skew-symmetric and orthogonal, and where the forcing terms are sinusoidal. More general matrices are also considered.
Skew-orthogonal polynomials and random matrix theory
Ghosh, Saugata
2009-01-01
Orthogonal polynomials satisfy a three-term recursion relation irrespective of the weight function with respect to which they are defined. This gives a simple formula for the kernel function, known in the literature as the Christoffel-Darboux sum. The availability of asymptotic results of orthogonal polynomials and the simple structure of the Christoffel-Darboux sum make the study of unitary ensembles of random matrices relatively straightforward. In this book, the author develops the theory of skew-orthogonal polynomials and obtains recursion relations which, unlike orthogonal polynomials, depend on weight functions. After deriving reduced expressions, called the generalized Christoffel-Darboux formulas (GCD), he obtains universal correlation functions and non-universal level densities for a wide class of random matrix ensembles using the GCD. The author also shows that once questions about higher order effects are considered (questions that are relevant in different branches of physics and mathematics) the ...
Using orthogonal design to determine optimal conditions for ...
African Journals Online (AJOL)
African Journal of Biotechnology ... Because of the narrow genetic diversity of common wheat and elite agronomic traits of many wild relatives, it is very ... Key words: Protoplast, fusion, orthogonal design method, Mingxian 169, Y2155a.
Orthogonal Projector Kit (OPK) as a new teaching aids with ...
African Journals Online (AJOL)
... as a new teaching aids with innovation ICT in teaching and learning 21 st century. ... Mathematics education filled with abstract concepts, the use of teaching aids is ... This article aims to introduce and express the importance of Orthogonal ...
Pihlainen, Katja; Sippola, Erkki; Kostiainen, Risto
2003-04-25
A fast liquid chromatography-electrospray tandem mass spectrometric (LC-ESI-MS-MS) method by using a monolithic column, gradient elution and ion trap mass spectrometer was developed for 14 forensically interesting and chemically different compounds. All compounds were eluted within 2.5 min and the total analysis time was 5 min including stabilisation time required for the next injection. All the compounds, basics, neutrals and acids were efficiently ionised by positive ion ESI. A laboratory library including MS-MS spectra and retention times was developed and tested. Results with 476 standard samples and 50 authentic samples showed that the compounds studied can be unambiguously identified with the library. A quantitative method was developed for the compounds using external calibration. The evaluation process showed good linearity of the method and reasonable repeatability. Limits of detection ranged from 10.0 to 50.0 ng/ml.
Non-Orthogonal Opportunistic Beamforming: Performance Analysis and Implementation
Xia, Minghua
2012-04-01
Aiming to achieve the sum-rate capacity in multi-user multi-antenna systems where $N_t$ antennas are implemented at the transmitter, opportunistic beamforming (OBF) generates~$N_t$ orthonormal beams and serves $N_t$ users during each channel use, which results in high scheduling delay over the users, especially in densely populated networks. Non-orthogonal OBF with more than~$N_t$ transmit beams can be exploited to serve more users simultaneously and further decrease scheduling delay. However, the inter-beam interference will inevitably deteriorate the sum-rate. Therefore, there is a tradeoff between sum-rate and scheduling delay for non-orthogonal OBF. In this context, system performance and implementation of non-orthogonal OBF with $N>N_t$ beams are investigated in this paper. Specifically, it is analytically shown that non-orthogonal OBF is an interference-limited system as the number of users $K \\\\to \\\\infty$. When the inter-beam interference reaches its minimum for fixed $N_t$ and~$N$, the sum-rate scales as $N\\\\ln\\\\left(\\\\frac{N}{N-N_t}\\ ight)$ and it degrades monotonically with the number of beams $N$ for fixed $N_t$. On the contrary, the average scheduling delay is shown to scale as $\\\\frac{1}{N}K\\\\ln{K}$ channel uses and it improves monotonically with $N$. Furthermore, two practical non-orthogonal beamforming schemes are explicitly constructed and they are demonstrated to yield the minimum inter-beam interference for fixed $N_t$ and $N$. This study reveals that, if user traffic is light and one user can be successfully served within a single transmission, non-orthogonal OBF can be applied to obtain lower worst-case delay among the users. On the other hand, if user traffic is heavy, non-orthogonal OBF is inferior to orthogonal OBF in terms of sum-rate and packet delay.
Bounds and asymptotics for orthogonal polynomials for varying weights
Levin, Eli
2018-01-01
This book establishes bounds and asymptotics under almost minimal conditions on the varying weights, and applies them to universality limits and entropy integrals. Orthogonal polynomials associated with varying weights play a key role in analyzing random matrices and other topics. This book will be of use to a wide community of mathematicians, physicists, and statisticians dealing with techniques of potential theory, orthogonal polynomials, approximation theory, as well as random matrices. .
COMPUTER GRAPHICAL REPRESENTATION, IN TREBLE ORTHOGONAL PROJECTION, OF A POINT
Directory of Open Access Journals (Sweden)
SLONOVSCHI Andrei
2017-05-01
Full Text Available In the stages of understanding and study, by students, of descriptive geometry, the treble orthogonal projection of a point, creates problems in the situations in that one or more descriptive coordinates are zero. Starting from these considerations the authors have created an original computer program which offers to the students the possibility to easily understanding of the way in which a point is represented, in draught, in the treble orthogonal projection whatever which are its values of the descriptive coordinates.
Non-Archimedean analogues of orthogonal and symmetric operators
International Nuclear Information System (INIS)
Albeverio, S; Bayod, J M; Perez-Garsia, C; Khrennikov, A Yu; Cianci, R
1999-01-01
We study orthogonal and symmetric operators on non-Archimedean Hilbert spaces in connection with the p-adic quantization. This quantization describes measurements with finite precision. Symmetric (bounded) operators on p-adic Hilbert spaces represent physical observables. We study the spectral properties of one of the most important quantum operators, namely, the position operator (which is represented on p-adic Hilbert L 2 -space with respect to the p-adic Gaussian measure). Orthogonal isometric isomorphisms of p-adic Hilbert spaces preserve the precision of measurements. We study properties of orthogonal operators. It is proved that every orthogonal operator on non-Archimedean Hilbert space is continuous. However, there are discontinuous operators with dense domain of definition that preserve the inner product. There exist non-isometric orthogonal operators. We describe some classes of orthogonal isometric operators on finite-dimensional spaces. We study some general questions in the theory of non-Archimedean Hilbert spaces (in particular, general connections between the topology, norm and inner product)
Highly sensitive rotation sensing based on orthogonal fiber-optic structures
Yang, Yi; Wang, Zi-nan; Xu, Lian-yu; Wang, Cui-yun; Jia, Lei; Yu, Xiao-qi; Shao, Shan; Li, Zheng-bin
2011-08-01
In traditional fiber-optic gyroscopes (FOG), the polarization state of counter propagating waves is critically controlled, and only the mode polarized along one particular direction survives. This is important for a traditional single mode fiber gyroscope as the requirement of reciprocity. However, there are some fatal defects such as low accuracy and poor bias stability in traditional structures. In this paper, based on the idea of polarization multiplexing, a double-polarization structure is put forward and experimentally studied. In highly birefringent fibers or standard single mode fibers with induced anisotropy, two orthogonal polarization modes can be used at the same time. Therefore, in polarization maintaining fibers (PMF), each pair of counter propagating beams preserve reciprocity within their own polarization state. Two series of sensing results are gotten in the fast and slow axes in PMF. The two sensing results have their own systematic drifts and the correlation of random noise in them is approximately zero. So, beams in fast and slow axes work as two independent and orthogonal gyroscopes. In this way, amount of information is doubled, providing opportunity to eliminate noise and improve sensitivity. Theoretically, this double-polarization structure can achieve a sensitivity of 10-18 deg/h. Computer simulation demonstrates that random noise and systematic drifts are largely reduced in this novel structure. In experiment, a forty-hour stability test targeting the earth's rotation velocity is carried out. Experiment result shows that the orthogonal fiber-optic structure has two big advantages compared with traditional ones. Firstly, the structure gets true value without any bias correction in any axis and even time-varying bias does not affect the acquisition of true value. The unbiasedness makes the structure very attractive when sudden disturbances or temperature drifts existing in working environment. Secondly, the structure lowers bias for more than
Consequences of wave function orthogonality for medium energy nuclear reactions
International Nuclear Information System (INIS)
Noble, J.V.
1978-01-01
In the usual models of high-energy bound-state to continuum transitions no account is taken of the orthogonality of the bound and continuum wave functions. This orthogonality induces considerable cancellations in the overlap integrals expressing the transition amplitudes for reactions such as (e,e'p), (γ,p), and (π,N), which are simply not included in the distorted-wave Born-approximation calculations which to date remain the only computationally feasible heirarchy of approximations. The object of this paper is to present a new formulation of the bound-state to continuum transition problem, based upon flux conservation, in which the orthogonality of wave functions is taken into account ab initio. The new formulation, while exact if exact wave functions are used, offers the possibility of using approximate wave functions for the continuum states without doing violence to the cancellations induced by orthogonality. The method is applied to single-particle states obeying the Schroedinger and Dirac equations, as well as to a coupled-channel model in which absorptive processes can be described in a fully consistent manner. Several types of absorption vertex are considered, and in the (π,N) case the equivalence of pseudoscalar and pseudovector πNN coupling is seen to follow directly from wave function orthogonality
Generalized Pseudospectral Method and Zeros of Orthogonal Polynomials
Directory of Open Access Journals (Sweden)
Oksana Bihun
2018-01-01
Full Text Available Via a generalization of the pseudospectral method for numerical solution of differential equations, a family of nonlinear algebraic identities satisfied by the zeros of a wide class of orthogonal polynomials is derived. The generalization is based on a modification of pseudospectral matrix representations of linear differential operators proposed in the paper, which allows these representations to depend on two, rather than one, sets of interpolation nodes. The identities hold for every polynomial family pνxν=0∞ orthogonal with respect to a measure supported on the real line that satisfies some standard assumptions, as long as the polynomials in the family satisfy differential equations Apν(x=qν(xpν(x, where A is a linear differential operator and each qν(x is a polynomial of degree at most n0∈N; n0 does not depend on ν. The proposed identities generalize known identities for classical and Krall orthogonal polynomials, to the case of the nonclassical orthogonal polynomials that belong to the class described above. The generalized pseudospectral representations of the differential operator A for the case of the Sonin-Markov orthogonal polynomials, also known as generalized Hermite polynomials, are presented. The general result is illustrated by new algebraic relations satisfied by the zeros of the Sonin-Markov polynomials.
Role of therapeutic fasting in women's health: An overview
Pradeep M.K Nair; Pranav G Khawale
2016-01-01
Fasting is a therapeutic tool practiced since millennia by different cultures and medical systems heterogeneously. PubMed and Google Scholar search engines were searched using the keywords ?fasting,? ?intermittent fasting,? ?calorie restriction,? ?women?s health,? ?women?s disorders,? ?fasting and aging,? and ?fasting and health.? All the animal and human studies which address women?s health and disorders were included in the review. Fasting has shown to improve the reproductive and mental he...
Guidance and search help resource listing examples of common queries that can be used in the Google Search Appliance search request, including examples of special characters, or query term seperators that Google Search Appliance recognizes.
Metabolic Effects of Intermittent Fasting.
Patterson, Ruth E; Sears, Dorothy D
2017-08-21
The objective of this review is to provide an overview of intermittent fasting regimens, summarize the evidence on the health benefits of intermittent fasting, and discuss physiological mechanisms by which intermittent fasting might lead to improved health outcomes. A MEDLINE search was performed using PubMed and the terms "intermittent fasting," "fasting," "time-restricted feeding," and "food timing." Modified fasting regimens appear to promote weight loss and may improve metabolic health. Several lines of evidence also support the hypothesis that eating patterns that reduce or eliminate nighttime eating and prolong nightly fasting intervals may result in sustained improvements in human health. Intermittent fasting regimens are hypothesized to influence metabolic regulation via effects on (a) circadian biology, (b) the gut microbiome, and (c) modifiable lifestyle behaviors, such as sleep. If proven to be efficacious, these eating regimens offer promising nonpharmacological approaches to improving health at the population level, with multiple public health benefits.
Orthogonal polynomials derived from the tridiagonal representation approach
Alhaidari, A. D.
2018-01-01
The tridiagonal representation approach is an algebraic method for solving second order differential wave equations. Using this approach in the solution of quantum mechanical problems, we encounter two new classes of orthogonal polynomials whose properties give the structure and dynamics of the corresponding physical system. For a certain range of parameters, one of these polynomials has a mix of continuous and discrete spectra making it suitable for describing physical systems with both scattering and bound states. In this work, we define these polynomials by their recursion relations and highlight some of their properties using numerical means. Due to the prime significance of these polynomials in physics, we hope that our short expose will encourage experts in the field of orthogonal polynomials to study them and derive their properties (weight functions, generating functions, asymptotics, orthogonality relations, zeros, etc.) analytically.
On some orthogonality properties of Maxwell's multipole vectors
International Nuclear Information System (INIS)
Gramada, Apostol
2007-01-01
We determine the location of the expansion points with respect to which the two Maxwell's multipole vectors of the quadrupole moment and the dipole vector of a distribution of charge form an orthogonal trihedron. We find that with respect to these 'orthogonality centres' both the dipole and the quadrupole moments are each characterized by a single real parameter. We further show that the orthogonality centres coincide with the stationary points of the magnitude of the quadrupole moment and, therefore, they can be seen as an extension of the concept of centre of the dipole moment of a neutral system introduced previously in the literature. The nature of the stationary points then provides the means for the classification of a distribution of charge in two different categories
Orthogonal Expansions for VIX Options Under Affine Jump Diffusions
DEFF Research Database (Denmark)
Barletta, Andrea; Nicolato, Elisa
2017-01-01
In this work we derive new closed–form pricing formulas for VIX options in the jump-diffusion SVJJ model proposed by Duffie et al. (2000). Our approach is based on the classic methodology of approximating a density function with an orthogonal expansion of polynomials weighted by a kernel. Orthogo......In this work we derive new closed–form pricing formulas for VIX options in the jump-diffusion SVJJ model proposed by Duffie et al. (2000). Our approach is based on the classic methodology of approximating a density function with an orthogonal expansion of polynomials weighted by a kernel...
Quantitative Boltzmann-Gibbs Principles via Orthogonal Polynomial Duality
Ayala, Mario; Carinci, Gioia; Redig, Frank
2018-06-01
We study fluctuation fields of orthogonal polynomials in the context of particle systems with duality. We thereby obtain a systematic orthogonal decomposition of the fluctuation fields of local functions, where the order of every term can be quantified. This implies a quantitative generalization of the Boltzmann-Gibbs principle. In the context of independent random walkers, we complete this program, including also fluctuation fields in non-stationary context (local equilibrium). For other interacting particle systems with duality such as the symmetric exclusion process, similar results can be obtained, under precise conditions on the n particle dynamics.
Automorphisms of Algebras and Bochner's Property for Vector Orthogonal Polynomials
Horozov, Emil
2016-05-01
We construct new families of vector orthogonal polynomials that have the property to be eigenfunctions of some differential operator. They are extensions of the Hermite and Laguerre polynomial systems. A third family, whose first member has been found by Y. Ben Cheikh and K. Douak is also constructed. The ideas behind our approach lie in the studies of bispectral operators. We exploit automorphisms of associative algebras which transform elementary vector orthogonal polynomial systems which are eigenfunctions of a differential operator into other systems of this type.
Problems of the orthogonalized plane wave method. 1
International Nuclear Information System (INIS)
Farberovich, O.V.; Kurganskii, S.I.; Domashevskaya, E.P.
1979-01-01
The main problems of the orthogonalized plane wave method are discussed including (a) consideration of core states; (b) effect of overlap of wave functions of external core states upon the band structure; (c) calculation of d-type states. The modified orthogonal plane wave method (MOPW method) of Deegan and Twose is applied in a general form to solve the problems of the usual OPW method. For the first time the influence on the spectrum of the main parameters of the MOPW method is studied systematically by calculating the electronic energy spectrum in the transition metals Nb and V. (author)
Hung, Yu-Han; Tseng, Chin-Hao; Hwang, Sheng-Kwang
2018-06-01
This Letter investigates an optically injected semiconductor laser for conversion from non-orthogonally to orthogonally polarized optical single-sideband modulation. The underlying mechanism relies solely on nonlinear laser characteristics and, thus, only a typical semiconductor laser is required as the key conversion unit. This conversion can be achieved for a broadly tunable frequency range up to at least 65 GHz. After conversion, the microwave phase quality, including linewidth and phase noise, is mostly preserved, and simultaneous microwave amplification up to 23 dB is feasible.
Adaptive integrand decomposition in parallel and orthogonal space
International Nuclear Information System (INIS)
Mastrolia, Pierpaolo; Peraro, Tiziano; Primo, Amedeo
2016-01-01
We present the integrand decomposition of multiloop scattering amplitudes in parallel and orthogonal space-time dimensions, d=d ∥ +d ⊥ , being d ∥ the dimension of the parallel space spanned by the legs of the diagrams. When the number n of external legs is n≤4, the corresponding representation of multiloop integrals exposes a subset of integration variables which can be easily integrated away by means of Gegenbauer polynomials orthogonality condition. By decomposing the integration momenta along parallel and orthogonal directions, the polynomial division algorithm is drastically simplified. Moreover, the orthogonality conditions of Gegenbauer polynomials can be suitably applied to integrate the decomposed integrand, yielding the systematic annihilation of spurious terms. Consequently, multiloop amplitudes are expressed in terms of integrals corresponding to irreducible scalar products of loop momenta and external ones. We revisit the one-loop decomposition, which turns out to be controlled by the maximum-cut theorem in different dimensions, and we discuss the integrand reduction of two-loop planar and non-planar integrals up to n=8 legs, for arbitrary external and internal kinematics. The proposed algorithm extends to all orders in perturbation theory.
Crossover ensembles of random matrices and skew-orthogonal polynomials
International Nuclear Information System (INIS)
Kumar, Santosh; Pandey, Akhilesh
2011-01-01
Highlights: → We study crossover ensembles of Jacobi family of random matrices. → We consider correlations for orthogonal-unitary and symplectic-unitary crossovers. → We use the method of skew-orthogonal polynomials and quaternion determinants. → We prove universality of spectral correlations in crossover ensembles. → We discuss applications to quantum conductance and communication theory problems. - Abstract: In a recent paper (S. Kumar, A. Pandey, Phys. Rev. E, 79, 2009, p. 026211) we considered Jacobi family (including Laguerre and Gaussian cases) of random matrix ensembles and reported exact solutions of crossover problems involving time-reversal symmetry breaking. In the present paper we give details of the work. We start with Dyson's Brownian motion description of random matrix ensembles and obtain universal hierarchic relations among the unfolded correlation functions. For arbitrary dimensions we derive the joint probability density (jpd) of eigenvalues for all transitions leading to unitary ensembles as equilibrium ensembles. We focus on the orthogonal-unitary and symplectic-unitary crossovers and give generic expressions for jpd of eigenvalues, two-point kernels and n-level correlation functions. This involves generalization of the theory of skew-orthogonal polynomials to crossover ensembles. We also consider crossovers in the circular ensembles to show the generality of our method. In the large dimensionality limit, correlations in spectra with arbitrary initial density are shown to be universal when expressed in terms of a rescaled symmetry breaking parameter. Applications of our crossover results to communication theory and quantum conductance problems are also briefly discussed.
Orthogonal experimental study on high frequency cascade thermoacoustic engine
International Nuclear Information System (INIS)
Hu Zhongjun; Li Qing; Li Zhengyu; Li Qiang
2008-01-01
Orthogonal experiment design and variance analysis were adopted to investigate a miniature cascade thermoacoustic engine, which consisted of one standing wave stage and one traveling wave stage in series, operating at about 470 Hz, using helium as the working gas. Optimum matching of the heater powers between stages was very important for the performance of a cascade thermoacoustic engine, which was obtained from the orthogonal experiments. The orthogonal experiment design considered three experimental factors, i.e. the charging pressure and the heater powers in the two stages, which varied on five different levels, respectively. According to the range analysis and variance analysis from the orthogonal experiments, the charging pressure was the most sensitive factor influencing the dynamic pressure amplitude and onset temperature. The total efficiency and the dynamic pressure amplitude increased when the traveling wave stage heater power increased. The optimum ratio of the heater powers between the traveling wave stage and the standing wave stage was about 1.25, compromising the total efficiency with the dynamic pressure amplitude
Synthesis of an Orthogonal Topological Analogue of Helicene
DEFF Research Database (Denmark)
Wixe, Torbjörn; Wallentin, Carl‐Johan; Johnson, Magnus T.
2013-01-01
The synthesis of an orthogonal topological pentamer analogue of helicene is presented. This analogue forms a tubular structure with its aromatic systems directed parallel to the axis of propagation, which creates a cavity with the potential to function as a host molecule. The synthetic strategy r...
Secrecy Capacity of a Class of Orthogonal Relay Eavesdropper Channels
Directory of Open Access Journals (Sweden)
Aggarwal Vaneet
2009-01-01
Full Text Available The secrecy capacity of relay channels with orthogonal components is studied in the presence of an additional passive eavesdropper node. The relay and destination receive signals from the source on two orthogonal channels such that the destination also receives transmissions from the relay on its channel. The eavesdropper can overhear either one or both of the orthogonal channels. Inner and outer bounds on the secrecy capacity are developed for both the discrete memoryless and the Gaussian channel models. For the discrete memoryless case, the secrecy capacity is shown to be achieved by a partial decode-and-forward (PDF scheme when the eavesdropper can overhear only one of the two orthogonal channels. Two new outer bounds are presented for the Gaussian model using recent capacity results for a Gaussian multiantenna point-to-point channel with a multiantenna eavesdropper. The outer bounds are shown to be tight for two subclasses of channels. The first subclass is one in which the source and relay are clustered, and the eavesdropper receives signals only on the channel from the source and the relay to the destination, for which the PDF strategy is optimal. The second is a subclass in which the source does not transmit to the relay, for which a noise-forwarding strategy is optimal.
Orthogonal bases of radial functions for charge density refinements
International Nuclear Information System (INIS)
Restori, R.
1990-01-01
Charge density determination from X-ray measurements necessitates the evaluation of the Fourier-Bessel transforms of the radial functions used to expand the charge density. Analytical expressions are given here for four sets of orthogonal functions which can substitute for the 'traditional exponential functions' set in least-squares refinements. (orig.)
Interactive 3D segmentation using connected orthogonal contours
de Bruin, P. W.; Dercksen, V. J.; Post, F. H.; Vossepoel, A. M.; Streekstra, G. J.; Vos, F. M.
2005-01-01
This paper describes a new method for interactive segmentation that is based on cross-sectional design and 3D modelling. The method represents a 3D model by a set of connected contours that are planar and orthogonal. Planar contours overlayed on image data are easily manipulated and linked contours
Adaptive integrand decomposition in parallel and orthogonal space
Energy Technology Data Exchange (ETDEWEB)
Mastrolia, Pierpaolo [Dipartimento di Fisica ed Astronomia, Università di Padova,Via Marzolo 8, 35131 Padova (Italy); INFN, Sezione di Padova,Via Marzolo 8, 35131 Padova (Italy); Peraro, Tiziano [Higgs Centre for Theoretical Physics, School of Physics and Astronomy,The University of Edinburgh,James Clerk Maxwell Building,Peter Guthrie Tait Road, Edinburgh EH9 3FD, Scotland (United Kingdom); Primo, Amedeo [Dipartimento di Fisica ed Astronomia, Università di Padova,Via Marzolo 8, 35131 Padova (Italy); INFN, Sezione di Padova,Via Marzolo 8, 35131 Padova (Italy)
2016-08-29
We present the integrand decomposition of multiloop scattering amplitudes in parallel and orthogonal space-time dimensions, d=d{sub ∥}+d{sub ⊥}, being d{sub ∥} the dimension of the parallel space spanned by the legs of the diagrams. When the number n of external legs is n≤4, the corresponding representation of multiloop integrals exposes a subset of integration variables which can be easily integrated away by means of Gegenbauer polynomials orthogonality condition. By decomposing the integration momenta along parallel and orthogonal directions, the polynomial division algorithm is drastically simplified. Moreover, the orthogonality conditions of Gegenbauer polynomials can be suitably applied to integrate the decomposed integrand, yielding the systematic annihilation of spurious terms. Consequently, multiloop amplitudes are expressed in terms of integrals corresponding to irreducible scalar products of loop momenta and external ones. We revisit the one-loop decomposition, which turns out to be controlled by the maximum-cut theorem in different dimensions, and we discuss the integrand reduction of two-loop planar and non-planar integrals up to n=8 legs, for arbitrary external and internal kinematics. The proposed algorithm extends to all orders in perturbation theory.
Dynamic imaging of skeletal muscle contraction in three orthogonal directions
Lopata, R.G.; van Dijk, J.P; Pillen, S.; Nillisen, M.M.; Maas, H.; Thijssen, J.M.; Stegeman, D.F.; Korte, C.L.
2010-01-01
In this study, a multidimensional strain estimation method using biplane ultrasound is presented to assess local relative deformation (i.e., local strain) in three orthogonal directions in skeletal muscles during induced and voluntary contractions. The method was tested in the musculus biceps
Dynamic imaging of skeletal muscle contraction in three orthogonal directions.
Lopata, R.G.P.; Dijk, J.P. van; Pillen, S.; Nillesen, M.M.; Maas, H.; Thijssen, J.M.; Stegeman, D.F.; Korte, C.L. de
2010-01-01
In this study, a multidimensional strain estimation method using biplane ultrasound is presented to assess local relative deformation (i.e., local strain) in three orthogonal directions in skeletal muscles during induced and voluntary contractions. The method was tested in the musculus biceps
Some p-ranks related to orthogonal spaces
Blokhuis, A.; Moorhouse, G.E.
1995-01-01
We determine the p-rank of the incidence matrix of hyperplanes of PG(n, p e) and points of a nondegenerate quadric. This yields new bounds for ovoids and the size of caps in finite orthogonal spaces. In particular, we show the nonexistence of ovoids in O10+ (2e ),O10+ (3e ),O9 (5e ),O12+ (5e
Short-Term Memory in Orthogonal Neural Networks
White, Olivia L.; Lee, Daniel D.; Sompolinsky, Haim
2004-04-01
We study the ability of linear recurrent networks obeying discrete time dynamics to store long temporal sequences that are retrievable from the instantaneous state of the network. We calculate this temporal memory capacity for both distributed shift register and random orthogonal connectivity matrices. We show that the memory capacity of these networks scales with system size.
Cospectral Graphs and Regular Orthogonal Matrices of Level 2
Abiad Monge, A.; Haemers, W.H.
2012-01-01
Abstract: For a graph Γ with adjacency matrix A, we consider a switching operation that takes Γ into a graph Γ' with adjacency matrix A', defined by A' = QtAQ, where Q is a regular orthogonal matrix of level 2 (that is, QtQ = I, Q1 = 1, 2Q is integral, and Q is not a permutation matrix). If such an
Application of Orthogonal Design to Optimize Extraction of ...
African Journals Online (AJOL)
Purpose: To optimize the extraction technology of polysaccharides from Cynomorium songaricum Rupr by ultrasonic-assisted extraction (UAE). Methods: Four parameters including ultrasonic power, ratio of raw material to water, extraction temperature, and extraction time were optimized by orthogonal design. The effects of ...
Constructing General Orthogonal Fractional Factorial Split-Plot Designs
Sartono, B.; Goos, P.; Schoen, E.
2015-01-01
While the orthogonal design of split-plot fractional factorial experiments has received much attention already, there are still major voids in the literature. First, designs with one or more factors acting at more than two levels have not yet been considered. Second, published work on nonregular
Orthogonal designs Hadamard matrices, quadratic forms and algebras
Seberry, Jennifer
2017-01-01
Orthogonal designs have proved fundamental to constructing code division multiple antenna systems for more efficient mobile communications. Starting with basic theory, this book develops the algebra and combinatorics to create new communications modes. Intended primarily for researchers, it is also useful for graduate students wanting to understand some of the current communications coding theories.
Orthogonal feature selection method. [For preprocessing of man spectral data
Energy Technology Data Exchange (ETDEWEB)
Kowalski, B R [Univ. of Washington, Seattle; Bender, C F
1976-01-01
A new method of preprocessing spectral data for extraction of molecular structural information is desired. This SELECT method generates orthogonal features that are important for classification purposes and that also retain their identity to the original measurements. A brief introduction to chemical pattern recognition is presented. A brief description of the method and an application to mass spectral data analysis follow. (BLM)
A turbulent jet in crossflow analysed with proper orthogonal decomposition
DEFF Research Database (Denmark)
Meyer, Knud Erik; Pedersen, Jakob Martin; Özcan, Oktay
2007-01-01
and pipe diameter was 2400 and the jet to crossflow velocity ratios were R = 3.3 and R = 1.3. The experimental data have been analysed by proper orthogonal decomposition (POD). For R = 3.3, the results in several different planes indicate that the wake vortices are the dominant dynamic flow structures...
Differentiation by integration using orthogonal polynomials, a survey
Diekema, E.; Koornwinder, T.H.
2012-01-01
This survey paper discusses the history of approximation formulas for n-th order derivatives by integrals involving orthogonal polynomials. There is a large but rather disconnected corpus of literature on such formulas. We give some results in greater generality than in the literature. Notably we
Sparsely-Packetized Predictive Control by Orthogonal Matching Pursuit
DEFF Research Database (Denmark)
Nagahara, Masaaki; Quevedo, Daniel; Østergaard, Jan
2012-01-01
We study packetized predictive control, known to be robust against packet dropouts in networked systems. To obtain sparse packets for rate-limited networks, we design control packets via an ℓ0 optimization, which can be eectively solved by orthogonal matching pursuit. Our formulation ensures...
Short-term memory in orthogonal neural networks
International Nuclear Information System (INIS)
White, Olivia L.; Lee, Daniel D.; Sompolinsky, Haim
2004-01-01
We study the ability of linear recurrent networks obeying discrete time dynamics to store long temporal sequences that are retrievable from the instantaneous state of the network. We calculate this temporal memory capacity for both distributed shift register and random orthogonal connectivity matrices. We show that the memory capacity of these networks scales with system size
Dral, Pavlo O; Wu, Xin; Spörkel, Lasse; Koslowski, Axel; Thiel, Walter
2016-03-08
The semiempirical orthogonalization-corrected OMx methods (OM1, OM2, and OM3) go beyond the standard MNDO model by including additional interactions in the electronic structure calculation. When augmented with empirical dispersion corrections, the resulting OMx-Dn approaches offer a fast and robust treatment of noncovalent interactions. Here we evaluate the performance of the OMx and OMx-Dn methods for a variety of ground-state properties using a large and diverse collection of benchmark sets from the literature, with a total of 13035 original and derived reference data. Extensive comparisons are made with the results from established semiempirical methods (MNDO, AM1, PM3, PM6, and PM7) that also use the NDDO (neglect of diatomic differential overlap) integral approximation. Statistical evaluations show that the OMx and OMx-Dn methods outperform the other methods for most of the benchmark sets.
A convergence study for SPDEs using combined Polynomial Chaos and Dynamically-Orthogonal schemes
International Nuclear Information System (INIS)
Choi, Minseok; Sapsis, Themistoklis P.; Karniadakis, George Em
2013-01-01
We study the convergence properties of the recently developed Dynamically Orthogonal (DO) field equations [1] in comparison with the Polynomial Chaos (PC) method. To this end, we consider a series of one-dimensional prototype SPDEs, whose solution can be expressed analytically, and which are associated with both linear (advection equation) and nonlinear (Burgers equation) problems with excitations that lead to unimodal and strongly bi-modal distributions. We also propose a hybrid approach to tackle the singular limit of the DO equations for the case of deterministic initial conditions. The results reveal that the DO method converges exponentially fast with respect to the number of modes (for the problems considered) giving same levels of computational accuracy comparable with the PC method but (in many cases) with substantially smaller computational cost compared to stochastic collocation, especially when the involved parametric space is high-dimensional
Velocity field calculation for non-orthogonal numerical grids
Energy Technology Data Exchange (ETDEWEB)
Flach, G. P. [Savannah River Site (SRS), Aiken, SC (United States). Savannah River National Lab. (SRNL)
2015-03-01
Computational grids containing cell faces that do not align with an orthogonal (e.g. Cartesian, cylindrical) coordinate system are routinely encountered in porous-medium numerical simulations. Such grids are referred to in this study as non-orthogonal grids because some cell faces are not orthogonal to a coordinate system plane (e.g. xy, yz or xz plane in Cartesian coordinates). Non-orthogonal grids are routinely encountered at the Savannah River Site in porous-medium flow simulations for Performance Assessments and groundwater flow modeling. Examples include grid lines that conform to the sloping roof of a waste tank or disposal unit in a 2D Performance Assessment simulation, and grid surfaces that conform to undulating stratigraphic surfaces in a 3D groundwater flow model. Particle tracking is routinely performed after a porous-medium numerical flow simulation to better understand the dynamics of the flow field and/or as an approximate indication of the trajectory and timing of advective solute transport. Particle tracks are computed by integrating the velocity field from cell to cell starting from designated seed (starting) positions. An accurate velocity field is required to attain accurate particle tracks. However, many numerical simulation codes report only the volumetric flowrate (e.g. PORFLOW) and/or flux (flowrate divided by area) crossing cell faces. For an orthogonal grid, the normal flux at a cell face is a component of the Darcy velocity vector in the coordinate system, and the pore velocity for particle tracking is attained by dividing by water content. For a non-orthogonal grid, the flux normal to a cell face that lies outside a coordinate plane is not a true component of velocity with respect to the coordinate system. Nonetheless, normal fluxes are often taken as Darcy velocity components, either naively or with accepted approximation. To enable accurate particle tracking or otherwise present an accurate depiction of the velocity field for a non-orthogonal
International Nuclear Information System (INIS)
Feng, Hua-tao; Su, Min; Rifai, Farida Nur; Li, Pingjing; Li, Sam F.Y.
2017-01-01
The deep involvement of glycans or carbohydrate moieties in biological processes makes glycan patterns an important direction for the clinical and medicine researches. A multiplexing CE mapping method for glycan analysis was developed in this study. By applying different CE separation mechanisms, the potential of combined parallel applications of capillary zone electrophoresis (CZE), micellar electrokinetic chromatography (MEKC) and capillary gel electrophoresis (CGE) for rapid and accurate identification of glycan was investigated. The combination of CZE and MEKC demonstrated enhancing chromatography separation capacity without the compromises of sample pre-treatment and glycan concentration. The separation mechanisms for multiplexing platform were selected based on the orthogonalities of the separation of glycan standards. MEKC method exhibited promising ability for the analysis of small GU value glycans and thus complementing the unavailability of CZE. The method established required only small amount of samples, simple instrument and single fluorescent labelling for sensitive detection. This integrated method can be used to search important glycan patterns appearing in biopharmaceutical products and other glycoproteins with clinical importance. - Highlights: • Cross-validation of analytes in complex samples was done with different CE separation mechanisms. • A simple strategy is used to confirm peak identification and extend capacity of CE separation. • The method uses small amount of sample, simple instrument and single fluorescent labeling. • Selection of mechanisms is based on orthogonalities of GU values of glycan standards. • Micellar electrokinetic chromatography was suitable for analysis of small or highly sialylated glycans.
Energy Technology Data Exchange (ETDEWEB)
Feng, Hua-tao [Department of Chemistry, National University of Singapore, 3 Science Drive 3, Singapore 117543 (Singapore); NUS Environmental Research Institute, 5A Engineering Drive 1, T-Lab Building, Singapore 117411 (Singapore); Su, Min; Rifai, Farida Nur [Department of Chemistry, National University of Singapore, 3 Science Drive 3, Singapore 117543 (Singapore); Li, Pingjing [NUS Environmental Research Institute, 5A Engineering Drive 1, T-Lab Building, Singapore 117411 (Singapore); Li, Sam F.Y., E-mail: chmlifys@nus.edu.sg [Department of Chemistry, National University of Singapore, 3 Science Drive 3, Singapore 117543 (Singapore); NUS Environmental Research Institute, 5A Engineering Drive 1, T-Lab Building, Singapore 117411 (Singapore)
2017-02-08
The deep involvement of glycans or carbohydrate moieties in biological processes makes glycan patterns an important direction for the clinical and medicine researches. A multiplexing CE mapping method for glycan analysis was developed in this study. By applying different CE separation mechanisms, the potential of combined parallel applications of capillary zone electrophoresis (CZE), micellar electrokinetic chromatography (MEKC) and capillary gel electrophoresis (CGE) for rapid and accurate identification of glycan was investigated. The combination of CZE and MEKC demonstrated enhancing chromatography separation capacity without the compromises of sample pre-treatment and glycan concentration. The separation mechanisms for multiplexing platform were selected based on the orthogonalities of the separation of glycan standards. MEKC method exhibited promising ability for the analysis of small GU value glycans and thus complementing the unavailability of CZE. The method established required only small amount of samples, simple instrument and single fluorescent labelling for sensitive detection. This integrated method can be used to search important glycan patterns appearing in biopharmaceutical products and other glycoproteins with clinical importance. - Highlights: • Cross-validation of analytes in complex samples was done with different CE separation mechanisms. • A simple strategy is used to confirm peak identification and extend capacity of CE separation. • The method uses small amount of sample, simple instrument and single fluorescent labeling. • Selection of mechanisms is based on orthogonalities of GU values of glycan standards. • Micellar electrokinetic chromatography was suitable for analysis of small or highly sialylated glycans.
Optical orthogonal code-division multiple-access system - Part 2: Multibits/sequence-period OOCDMA
Kwon, Hyuck M.
1994-08-01
In a recently proposed optical orthogonal code division multiple-access (OOCDMA) system, one bit of user's data is transmitted per sequence-period, and a threshold is employed for the final bit decision. In this paper, a system that can transmit multibits per sequence-period is introduced, and avalanche photodiode (APD) noise, thermal noise, and interference, are included. This system, derived by exploiting orthogonal properties of the OOCDMA code sequence and using a maximum search (instead of a threshold) in the final decision, is log(sub 2) F times higher in throughput, where F is sequence-period. For example, four orders of magnitude are better in bit error probability at - 56 dBW received laser power, with F = 1000 chips, 10 'marks' in a sequence, and 10 users of 30 Mb/s data rate for one-bit/sequence-period and 270 Mb/s data rate for multibits/sequence-period system. Furthermore, an exact analysis is performed for the log(sub 2)F bits/sequence-period system with a hard-limiter placed before the receiver, and its performance is compared to the performance without hard-limiter, for the chip-synchronous case. The improvement from using a hard-limiter is significant in the log(sub 2)F bits/sequence-period OCCDMA system.
Intermittent search strategies
Bénichou, O.; Loverdo, C.; Moreau, M.; Voituriez, R.
2011-01-01
This review examines intermittent target search strategies, which combine phases of slow motion, allowing the searcher to detect the target, and phases of fast motion during which targets cannot be detected. It is first shown that intermittent search strategies are actually widely observed at various scales. At the macroscopic scale, this is, for example, the case of animals looking for food; at the microscopic scale, intermittent transport patterns are involved in a reaction pathway of DNA-binding proteins as well as in intracellular transport. Second, generic stochastic models are introduced, which show that intermittent strategies are efficient strategies that enable the minimization of search time. This suggests that the intrinsic efficiency of intermittent search strategies could justify their frequent observation in nature. Last, beyond these modeling aspects, it is proposed that intermittent strategies could also be used in a broader context to design and accelerate search processes.
Fsheikh, Ahmed H.
2013-01-01
A nonlinear orthogonal matching pursuit (NOMP) for sparse calibration of reservoir models is presented. Sparse calibration is a challenging problem as the unknowns are both the non-zero components of the solution and their associated weights. NOMP is a greedy algorithm that discovers at each iteration the most correlated components of the basis functions with the residual. The discovered basis (aka support) is augmented across the nonlinear iterations. Once the basis functions are selected from the dictionary, the solution is obtained by applying Tikhonov regularization. The proposed algorithm relies on approximate gradient estimation using an iterative stochastic ensemble method (ISEM). ISEM utilizes an ensemble of directional derivatives to efficiently approximate gradients. In the current study, the search space is parameterized using an overcomplete dictionary of basis functions built using the K-SVD algorithm.
Orthogonal Analysis Based Performance Optimization for Vertical Axis Wind Turbine
Directory of Open Access Journals (Sweden)
Lei Song
2016-01-01
Full Text Available Geometrical shape of a vertical axis wind turbine (VAWT is composed of multiple structural parameters. Since there are interactions among the structural parameters, traditional research approaches, which usually focus on one parameter at a time, cannot obtain performance of the wind turbine accurately. In order to exploit overall effect of a novel VAWT, we firstly use a single parameter optimization method to obtain optimal values of the structural parameters, respectively, by Computational Fluid Dynamics (CFD method; based on the results, we then use an orthogonal analysis method to investigate the influence of interactions of the structural parameters on performance of the wind turbine and to obtain optimization combination of the structural parameters considering the interactions. Results of analysis of variance indicate that interactions among the structural parameters have influence on performance of the wind turbine, and optimization results based on orthogonal analysis have higher wind energy utilization than that of traditional research approaches.
Tomographic Approach in Three-Orthogonal-Basis Quantum Key Distribution
International Nuclear Information System (INIS)
Liang Wen-Ye; Yin Zhen-Qiang; Chen Hua; Li Hong-Wei; Chen Wei; Han Zheng-Fu; Wen Hao
2015-01-01
At present, there is an increasing awareness of some three-orthogonal-basis quantum key distribution protocols, such as, the reference-frame-independent (RFI) protocol and the six-state protocol. For secure key rate estimations of these protocols, there are two methods: one is the conventional approach, and another is the tomographic approach. However, a comparison between these two methods has not been given yet. In this work, with the general model of rotation channel, we estimate the key rate using conventional and tomographic methods respectively. Results show that conventional estimation approach in RFI protocol is equivalent to tomographic approach only in the case of that one of three orthogonal bases is always aligned. In other cases, tomographic approach performs much better than the respective conventional approaches of the RFI protocol and the six-state protocol. Furthermore, based on the experimental data, we illustrate the deep connections between tomography and conventional RFI approach representations. (paper)
Quantum secret sharing using orthogonal multiqudit entangled states
Bai, Chen-Ming; Li, Zhi-Hui; Liu, Cheng-Ji; Li, Yong-Ming
2017-12-01
In this work, we investigate the distinguishability of orthogonal multiqudit entangled states under restricted local operations and classical communication. According to these properties, we propose a quantum secret sharing scheme to realize three types of access structures, i.e., the ( n, n)-threshold, the restricted (3, n)-threshold and restricted (4, n)-threshold schemes (called LOCC-QSS scheme). All cooperating players in the restricted threshold schemes are from two disjoint groups. In the proposed protocol, the participants use the computational basis measurement and classical communication to distinguish between those orthogonal states and reconstruct the original secret. Furthermore, we also analyze the security of our scheme in four primary quantum attacks and give a simple encoding method in order to better prevent the participant conspiracy attack.
Force Modelling in Orthogonal Cutting Considering Flank Wear Effect
Rathod, Kanti Bhikhubhai; Lalwani, Devdas I.
2017-05-01
In the present work, an attempt has been made to provide a predictive cutting force model during orthogonal cutting by combining two different force models, that is, a force model for a perfectly sharp tool plus considering the effect of edge radius and a force model for a worn tool. The first force model is for a perfectly sharp tool that is based on Oxley's predictive machining theory for orthogonal cutting as the Oxley's model is for perfectly sharp tool, the effect of cutting edge radius (hone radius) is added and improve model is presented. The second force model is based on worn tool (flank wear) that was proposed by Waldorf. Further, the developed combined force model is also used to predict flank wear width using inverse approach. The performance of the developed combined total force model is compared with the previously published results for AISI 1045 and AISI 4142 materials and found reasonably good agreement.
A General Approach for Orthogonal 4-Tap Integer Multiwavelet Transforms
Directory of Open Access Journals (Sweden)
Mingli Jing
2010-01-01
Full Text Available An algorithm for orthogonal 4-tap integer multiwavelet transforms is proposed. We compute the singular value decomposition (SVD of block recursive matrices of transform matrix, and then transform matrix can be rewritten in a product of two block diagonal matrices and a permutation matrix. Furthermore, we factorize the block matrix of block diagonal matrices into triangular elementary reversible matrices (TERMs, which map integers to integers by rounding arithmetic. The cost of factorizing block matrix into TERMs does not increase with the increase of the dimension of transform matrix, and the proposed algorithm is in-place calculation and without allocating auxiliary memory. Examples of integer multiwavelet transform using DGHM and CL are given, which verify that the proposed algorithm is an executable algorithm and outperforms the existing algorithm for orthogonal 4-tap integer multiwavelet transform.
Least squares orthogonal polynomial approximation in several independent variables
International Nuclear Information System (INIS)
Caprari, R.S.
1992-06-01
This paper begins with an exposition of a systematic technique for generating orthonormal polynomials in two independent variables by application of the Gram-Schmidt orthogonalization procedure of linear algebra. It is then demonstrated how a linear least squares approximation for experimental data or an arbitrary function can be generated from these polynomials. The least squares coefficients are computed without recourse to matrix arithmetic, which ensures both numerical stability and simplicity of implementation as a self contained numerical algorithm. The Gram-Schmidt procedure is then utilised to generate a complete set of orthogonal polynomials of fourth degree. A theory for the transformation of the polynomial representation from an arbitrary basis into the familiar sum of products form is presented, together with a specific implementation for fourth degree polynomials. Finally, the computational integrity of this algorithm is verified by reconstructing arbitrary fourth degree polynomials from their values at randomly chosen points in their domain. 13 refs., 1 tab
Discriminants and functional equations for polynomials orthogonal on the unit circle
International Nuclear Information System (INIS)
Ismail, M.E.H.; Witte, N.S.
2000-01-01
We derive raising and lowering operators for orthogonal polynomials on the unit circle and find second order differential and q-difference equations for these polynomials. A general functional equation is found which allows one to relate the zeros of the orthogonal polynomials to the stationary values of an explicit quasi-energy and implies recurrences on the orthogonal polynomial coefficients. We also evaluate the discriminants and quantized discriminants of polynomials orthogonal on the unit circle
International Nuclear Information System (INIS)
Shlesinger, Michael F
2009-01-01
There are a wide variety of searching problems from molecules seeking receptor sites to predators seeking prey. The optimal search strategy can depend on constraints on time, energy, supplies or other variables. We discuss a number of cases and especially remark on the usefulness of Levy walk search patterns when the targets of the search are scarce.
Radar Measurements of Ocean Surface Waves using Proper Orthogonal Decomposition
2017-03-30
Golinval, 2002, Physical interpretation of the proper orthogonal modes using the singular value decomposition, Journal of Sound and Vibration, 249...complex and contain contributions from the environment (e.g., wind, waves, currents) as well as artifacts associated with electromagnetic (EM) (wave...Although there is no physical basis/ interpretation inherent to the method because it is purely a mathematical tool, there has been an increasing
TEACHING BASIC ELEMENTS IN TECHNICAL DRAWING – ORTHOGONAL PROJECTIONS
Directory of Open Access Journals (Sweden)
CLINCIU Ramona
2017-05-01
Full Text Available The paper presents applications developed using AutoCAD and 3D Studio MAX programs. These applications are constructed such as to enable, gradually, the development of the spatial abilities of the students and, at the same time, to enable the understanding of the principles for the representation of the orthogonal projections of the parts, as well as for the construction of their axonometric projections.
Orthogonal frequency division multiple access fundamentals and applications
Jiang, Tao; Zhang, Yan
2010-01-01
Supported by the expert-level advice of pioneering researchers, Orthogonal Frequency Division Multiple Access Fundamentals and Applications provides a comprehensive and accessible introduction to the foundations and applications of one of the most promising access technologies for current and future wireless networks. It includes authoritative coverage of the history, fundamental principles, key techniques, and critical design issues of OFDM systems. Covering various techniques of effective resource management for OFDM/OFDMA-based wireless communication systems, this cutting-edge reference:Add
Cospectral graphs and regular orthogonal matrices of level 2
Abiad Monge, A.; Haemers, W.H.
2012-01-01
For a graph Γ with adjacency matrix A , we consider a switching operation that takes Γ into a graph Γ′ with adjacency matrix A′ , defined by A′ = Q⊤AQ , where Q is a regular orthogonal matrix of level 2 (that is, Q⊤Q=I , Q1 = 1, 2Q is integral, and Q is not a permutation matrix). If such an
Discrete Orthogonal Transforms and Neural Networks for Image Interpolation
Directory of Open Access Journals (Sweden)
J. Polec
1999-09-01
Full Text Available In this contribution we present transform and neural network approaches to the interpolation of images. From transform point of view, the principles from [1] are modified for 1st and 2nd order interpolation. We present several new interpolation discrete orthogonal transforms. From neural network point of view, we present interpolation possibilities of multilayer perceptrons. We use various configurations of neural networks for 1st and 2nd order interpolation. The results are compared by means of tables.
A general boundary capability embedded in an orthogonal mesh
International Nuclear Information System (INIS)
Hewett, D.W.; Yu-Jiuan Chen
1995-01-01
The authors describe how they hold onto orthogonal mesh discretization when dealing with curved boundaries. Special difference operators were constructed to approximate numerical zones split by the domain boundary; the operators are particularly simple for this rectangular mesh. The authors demonstrated that this simple numerical approach, termed Dynamic Alternating Direction Implicit, turned out to be considerably more efficient than more complex grid-adaptive algorithms that were tried previously
Fast Algorithms for Fitting Active Appearance Models to Unconstrained Images
Tzimiropoulos, Georgios; Pantic, Maja
2016-01-01
Fitting algorithms for Active Appearance Models (AAMs) are usually considered to be robust but slow or fast but less able to generalize well to unseen variations. In this paper, we look into AAM fitting algorithms and make the following orthogonal contributions: We present a simple “project-out‿
Morville, Peter
2010-01-01
What people are saying about Search Patterns "Search Patterns is a delight to read -- very thoughtful and thought provoking. It's the most comprehensive survey of designing effective search experiences I've seen." --Irene Au, Director of User Experience, Google "I love this book! Thanks to Peter and Jeffery, I now know that search (yes, boring old yucky who cares search) is one of the coolest ways around of looking at the world." --Dan Roam, author, The Back of the Napkin (Portfolio Hardcover) "Search Patterns is a playful guide to the practical concerns of search interface design. It cont
Minimal parameter solution of the orthogonal matrix differential equation
Bar-Itzhack, Itzhack Y.; Markley, F. Landis
1990-01-01
As demonstrated in this work, all orthogonal matrices solve a first order differential equation. The straightforward solution of this equation requires n sup 2 integrations to obtain the element of the nth order matrix. There are, however, only n(n-1)/2 independent parameters which determine an orthogonal matrix. The questions of choosing them, finding their differential equation and expressing the orthogonal matrix in terms of these parameters are considered. Several possibilities which are based on attitude determination in three dimensions are examined. It is shown that not all 3-D methods have useful extensions to higher dimensions. It is also shown why the rate of change of the matrix elements, which are the elements of the angular rate vector in 3-D, are the elements of a tensor of the second rank (dyadic) in spaces other than three dimensional. It is proven that the 3-D Gibbs vector (or Cayley Parameters) are extendable to other dimensions. An algorithm is developed emplying the resulting parameters, which are termed Extended Rodrigues Parameters, and numerical results are presented of the application of the algorithm to a fourth order matrix.
Limited-memory adaptive snapshot selection for proper orthogonal decomposition
Energy Technology Data Exchange (ETDEWEB)
Oxberry, Geoffrey M. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Kostova-Vassilevska, Tanya [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Arrighi, Bill [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Chand, Kyle [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2015-04-02
Reduced order models are useful for accelerating simulations in many-query contexts, such as optimization, uncertainty quantification, and sensitivity analysis. However, offline training of reduced order models can have prohibitively expensive memory and floating-point operation costs in high-performance computing applications, where memory per core is limited. To overcome this limitation for proper orthogonal decomposition, we propose a novel adaptive selection method for snapshots in time that limits offline training costs by selecting snapshots according an error control mechanism similar to that found in adaptive time-stepping ordinary differential equation solvers. The error estimator used in this work is related to theory bounding the approximation error in time of proper orthogonal decomposition-based reduced order models, and memory usage is minimized by computing the singular value decomposition using a single-pass incremental algorithm. Results for a viscous Burgers’ test problem demonstrate convergence in the limit as the algorithm error tolerances go to zero; in this limit, the full order model is recovered to within discretization error. The resulting method can be used on supercomputers to generate proper orthogonal decomposition-based reduced order models, or as a subroutine within hyperreduction algorithms that require taking snapshots in time, or within greedy algorithms for sampling parameter space.
MRI isotropic resolution reconstruction from two orthogonal scans
Tamez-Pena, Jose G.; Totterman, Saara; Parker, Kevin J.
2001-07-01
An algorithm for the reconstructions of ISO-resolution volumetric MR data sets from two standard orthogonal MR scans having anisotropic resolution has been developed. The reconstruction algorithm starts by registering a pair of orthogonal volumetric MR data sets. The registration is done by maximizing the correlation between the gradient magnitude using a simple translation-rotation model in a multi-resolution approach. Then algorithm assumes that the individual voxels on the MR data are an average of the magnetic resonance properties of an elongated imaging volume. Then, the process is modeled as the projection of MR properties into a single sensor. This model allows the derivation of a set of linear equations that can be used to recover the MR properties of every single voxel in the SO-resolution volume given only two orthogonal MR scans. Projections on convex sets (POCS) was used to solve the set of linear equations. Experimental results show the advantage of having a ISO-resolution reconstructions for the visualization and analysis of small and thin muscular structures.
Parallel and orthogonal stimulus in ultradiluted neural networks
International Nuclear Information System (INIS)
Sobral, G. A. Jr.; Vieira, V. M.; Lyra, M. L.; Silva, C. R. da
2006-01-01
Extending a model due to Derrida, Gardner, and Zippelius, we have studied the recognition ability of an extreme and asymmetrically diluted version of the Hopfield model for associative memory by including the effect of a stimulus in the dynamics of the system. We obtain exact results for the dynamic evolution of the average network superposition. The stimulus field was considered as proportional to the overlapping of the state of the system with a particular stimulated pattern. Two situations were analyzed, namely, the external stimulus acting on the initialization pattern (parallel stimulus) and the external stimulus acting on a pattern orthogonal to the initialization one (orthogonal stimulus). In both cases, we obtained the complete phase diagram in the parameter space composed of the stimulus field, thermal noise, and network capacity. Our results show that the system improves its recognition ability for parallel stimulus. For orthogonal stimulus two recognition phases emerge with the system locking at the initialization or stimulated pattern. We confront our analytical results with numerical simulations for the noiseless case T=0
Islamic fasting and multiple sclerosis
2014-01-01
Background Month-long daytime Ramadan fasting pose s major challenges to multiple sclerosis (MS) patients in Muslim countries. Physicians should have practical knowledge on the implications of fasting on MS. We present a summary of database searches (Cochrane Database of Systematic Reviews, PubMed) and a mini-symposium on Ramadan fasting and MS. In this symposium, we aimed to review the effect of fasting on MS and suggest practical guidelines on management. Discussion In general, fasting is possible for most stable patients. Appropriate amendment of drug regimens, careful monitoring of symptoms, as well as providing patients with available evidence on fasting and MS are important parts of management. Evidence from experimental studies suggests that calorie restriction before disease induction reduces inflammation and subsequent demyelination and attenuates disease severity. Fasting does not appear to have unfavorable effects on disease course in patients with mild disability (Expanded Disability Status Scale (EDSS) score ≤3). Most experts believed that during fasting (especially in summer), some MS symptoms (fatigue, fatigue perception, dizziness, spasticity, cognitive problems, weakness, vision, balance, gait) might worsen but return to normal levels during feasting. There was a general consensus that fasting is not safe for patients: on high doses of anti-convulsants, anti-spastics, and corticosteroids; with coagulopathy or active disease; during attacks; with EDSS score ≥7. Summary These data suggest that MS patients should have tailored care. Fasting in MS patients is a challenge that is directly associated with the spiritual belief of the patient. PMID:24655543
Energy Technology Data Exchange (ETDEWEB)
Imbert, Ch
1997-05-30
The fast ultrasonic visualization under sodium is in the programme of research and development on the inspection inside the fast neutron reactors. This work is about the development of a such system of fast ultrasonic imaging under sodium, in order to improve the existing visualization systems. This system is based on the principle of orthogonal imaging, it uses two linear antennas with an important dephasing having 128 piezo-composite elements of central frequency equal to 1.6 MHz. (N.C.)
AUTHOR|(SzGeCERN)749939
2015-01-01
As the volume of electronically available information grows, relevant items become harder to find. This work presents an approach to personalizing search results in scientific publication databases. This work focuses on re-ranking search results from existing search engines like Solr or ElasticSearch. This work also includes the development of Obelix, a new recommendation system used to re-rank search results. The project was proposed and performed at CERN, using the scientific publications available on the CERN Document Server (CDS). This work experiments with re-ranking using offline and online evaluation of users and documents in CDS. The experiments conclude that the personalized search result outperform both latest first and word similarity in terms of click position in the search result for global search in CDS.
Integrated, Dual Orthogonal Antennas for Polarimetric Ground Penetrating Radar
Pauli, Mario; Wiesbeck, Werner
2015-04-01
Ground penetrating radar systems are mostly equipped with single polarized antennas, for example with single linear polarization or with circular polarization. The radiated waves are partly reflected at the ground surface and very often the penetrating waves are distorted in their polarization. The distortion depends on the ground homogeneity and the orientation of the antennas relative to the ground structure. The received signals from the reflecting objects may most times only be classified according to their coverage and intensity. This makes the recognition of the objects difficult or impossible. In airborne and spaceborne Remote Sensing the systems are meanwhile mostly equipped with front ends with dual orthogonal polarized antennas for a full polarimetric operation. The received signals, registered in 2x2 scattering matrices according to co- and cross polarization, are processed for the evaluation of all features of the targets. Ground penetrating radars could also profit from the scientific results of Remote Sensing. The classification of detected objects for their structure and orientation requires more information in the reflected signal than can be measured with a single polarization [1, 2]. In this paper dual linear, orthogonal polarized antennas with a common single, frequency independent phase center, are presented [3]. The relative bandwidth of these antennas can be 1:3, up to 1:4. The antenna is designed to work in the frequency range between 3 GHz and 11 GHz, but can be easily adapted to the GPR frequency range by scaling. The size of the antenna scaled for operation in typical GPR frequencies would approximately be 20 by 20 cm2. By the implementation in a dielectric carrier it could be reduced in size if required. The major problem for ultra wide band, dual polarized antennas is the frequency independent feed network, realizing the required phase shifts. For these antennas a network, which is frequency independent over a wide range, has been
Adaptive PID control based on orthogonal endocrine neural networks.
Milovanović, Miroslav B; Antić, Dragan S; Milojković, Marko T; Nikolić, Saša S; Perić, Staniša Lj; Spasić, Miodrag D
2016-12-01
A new intelligent hybrid structure used for online tuning of a PID controller is proposed in this paper. The structure is based on two adaptive neural networks, both with built-in Chebyshev orthogonal polynomials. First substructure network is a regular orthogonal neural network with implemented artificial endocrine factor (OENN), in the form of environmental stimuli, to its weights. It is used for approximation of control signals and for processing system deviation/disturbance signals which are introduced in the form of environmental stimuli. The output values of OENN are used to calculate artificial environmental stimuli (AES), which represent required adaptation measure of a second network-orthogonal endocrine adaptive neuro-fuzzy inference system (OEANFIS). OEANFIS is used to process control, output and error signals of a system and to generate adjustable values of proportional, derivative, and integral parameters, used for online tuning of a PID controller. The developed structure is experimentally tested on a laboratory model of the 3D crane system in terms of analysing tracking performances and deviation signals (error signals) of a payload. OENN-OEANFIS performances are compared with traditional PID and 6 intelligent PID type controllers. Tracking performance comparisons (in transient and steady-state period) showed that the proposed adaptive controller possesses performances within the range of other tested controllers. The main contribution of OENN-OEANFIS structure is significant minimization of deviation signals (17%-79%) compared to other controllers. It is recommended to exploit it when dealing with a highly nonlinear system which operates in the presence of undesirable disturbances. Copyright © 2016 Elsevier Ltd. All rights reserved.
The endoscopic classification of representations orthogonal and symplectic groups
Arthur, James
2013-01-01
Within the Langlands program, endoscopy is a fundamental process for relating automorphic representations of one group with those of another. In this book, Arthur establishes an endoscopic classification of automorphic representations of orthogonal and symplectic groups G. The representations are shown to occur in families (known as global L-packets and A-packets), which are parametrized by certain self-dual automorphic representations of an associated general linear group GL(N). The central result is a simple and explicit formula for the multiplicity in the automorphic discrete spectrum of G
Cavity enhanced interference of orthogonal modes in a birefringent medium
Kolluru, Kiran; Saha, Sudipta; Gupta, S. Dutta
2018-03-01
Interference of orthogonal modes in a birefringent crystal mediated by a rotator is known to lead to interesting physical effects (Solli et al., 2003). In this paper we show that additional feedback offered by a Fabry-Perot cavity (containing the birefringent crystal and the rotator) can lead to a novel strong interaction regime. Usual signatures of the strong interaction regime like the normal mode splitting and avoided crossings, sensitive to the rotator orientation, are reported. A high finesse cavity is shown to offer an optical setup for measuring small angles. The results are based on direct calculations of the cavity transmissions along with an analysis of its dispersion relation.
ORIENTATION FIELD RECONSTRUCTION OF ALTERED FINGERPRINT USING ORTHOGONAL WAVELETS
Directory of Open Access Journals (Sweden)
Mini M.G.
2016-11-01
Full Text Available Ridge orientation field is an important feature for fingerprint matching and fingerprint reconstruction. Matching of the altered fingerprint against its unaltered mates can be done by extracting the available features in the altered fingerprint and using it along with approximated ridge orientation. This paper presents a method for approximating ridge orientation field of altered fingerprints. In the proposed method, sine and cosine of doubled orientation of the fingerprint is decomposed using orthogonal wavelets and reconstructed back using only the approximation coefficients. No prior information about the singular points is needed for orientation approximation. The method is found suitable for orientation estimation of low quality fingerprint images also.
Introduction to orthogonal, symplectic and unitary representations of finite groups
Riehm, Carl R
2011-01-01
Orthogonal, symplectic and unitary representations of finite groups lie at the crossroads of two more traditional subjects of mathematics-linear representations of finite groups, and the theory of quadratic, skew symmetric and Hermitian forms-and thus inherit some of the characteristics of both. This book is written as an introduction to the subject and not as an encyclopaedic reference text. The principal goal is an exposition of the known results on the equivalence theory, and related matters such as the Witt and Witt-Grothendieck groups, over the "classical" fields-algebraically closed, rea
Orthogonal polarization in lasers physical phenomena and engineering applications
Zhang, Shulian
2013-01-01
This practical book summarizes the latest research results of orthogonally polarized lasers, birefringence laser cavities, and their applications. Coverage ranges from basic principles and technologies to the characteristics of different cavities and lasers to various measurement techniques. A number of figures, experimental designs, and measurement curves are included, helping readers gain a thorough understanding of the many applications in modern engineering and start their own projects. Many types of relevant lasers (Helium/Neon lasers, Nd:YAG lasers, laser diodes, etc.) are also discussed
Neural Based Orthogonal Data Fitting The EXIN Neural Networks
Cirrincione, Giansalvo
2008-01-01
Written by three leaders in the field of neural based algorithms, Neural Based Orthogonal Data Fitting proposes several neural networks, all endowed with a complete theory which not only explains their behavior, but also compares them with the existing neural and traditional algorithms. The algorithms are studied from different points of view, including: as a differential geometry problem, as a dynamic problem, as a stochastic problem, and as a numerical problem. All algorithms have also been analyzed on real time problems (large dimensional data matrices) and have shown accurate solutions. Wh
Directed Formation of DNA Nanoarrays through Orthogonal Self-Assembly
Directory of Open Access Journals (Sweden)
Eugen Stulz
2011-06-01
Full Text Available We describe the synthesis of terpyridine modified DNA strands which selectively form DNA nanotubes through orthogonal hydrogen bonding and metal complexation interactions. The short DNA strands are designed to self-assemble into long duplexes through a sticky-end approach. Addition of weakly binding metals such as Zn(II and Ni(II induces the formation of tubular arrays consisting of DNA bundles which are 50-200 nm wide and 2-50 nm high. TEM shows additional long distance ordering of the terpy-DNA complexes into fibers.
Orthogonal functions, discrete variable representation, and generalized gauss quadratures
DEFF Research Database (Denmark)
Schneider, B. I.; Nygaard, Nicolai
2002-01-01
in the original representation. This has been exploited in bound-state, scattering, and time-dependent problems using the so-called, discrete variable representation (DVR). At the core of this approach is the mathematical three-term recursion relationship satisfied by the classical orthogonal functions...... functions, this is not the case. However, they may be computed in a stable numerical fashion, via the recursion. In essence, this is an application of the well-known Lanczos recursion approach. Once the recursion coefficients are known, it is possible to compute the points and weights of quadratures on...
Magnitude conversion to unified moment magnitude using orthogonal regression relation
Das, Ranjit; Wason, H. R.; Sharma, M. L.
2012-05-01
Homogenization of earthquake catalog being a pre-requisite for seismic hazard assessment requires region based magnitude conversion relationships. Linear Standard Regression (SR) relations fail when both the magnitudes have measurement errors. To accomplish homogenization, techniques like Orthogonal Standard Regression (OSR) are thus used. In this paper a technique is proposed for using such OSR for preparation of homogenized earthquake catalog in moment magnitude Mw. For derivation of orthogonal regression relation between mb and Mw, a data set consisting of 171 events with observed body wave magnitudes (mb,obs) and moment magnitude (Mw,obs) values has been taken from ISC and GCMT databases for Northeast India and adjoining region for the period 1978-2006. Firstly, an OSR relation given below has been developed using mb,obs and Mw,obs values corresponding to 150 events from this data set. M=1.3(±0.004)m-1.4(±0.130), where mb,proxy are body wave magnitude values of the points on the OSR line given by the orthogonality criterion, for observed (mb,obs, Mw,obs) points. A linear relation is then developed between these 150 mb,obs values and corresponding mb,proxy values given by the OSR line using orthogonality criterion. The relation obtained is m=0.878(±0.03)m+0.653(±0.15). The accuracy of the above procedure has been checked with the rest of the data i.e., 21 events values. The improvement in the correlation coefficient value between mb,obs and Mw estimated using the proposed procedure compared to the correlation coefficient value between mb,obs and Mw,obs shows the advantage of OSR relationship for homogenization. The OSR procedure developed in this study can be used to homogenize any catalog containing various magnitudes (e.g., ML, mb, MS) with measurement errors, by their conversion to unified moment magnitude Mw. The proposed procedure also remains valid in case the magnitudes have measurement errors of different orders, i.e. the error variance ratio is
Orthogonal Bases used for Feed Forward Control of Wind Turbines
DEFF Research Database (Denmark)
Odgaard, Peter Fogh; Stoustrup, Jakob
2011-01-01
In optimizing wind turbines it can be of a large help to use information of wind speeds at upwind turbine for the control of downwind turbines, it is, however, problematic to use these measurements directly since they are highly inﬂuenced by turbulence behind the wind turbine rotor plane. In this....... In this paper an orthogonal basis is use to extract the general trends in the wind signal, which are forward to the down wind turbines. This concept controller is designed and simulated on a generic 4.8 MW wind turbine model, which shows the potential of this proposed scheme....
Magnetic particle detection in unshielded environment using orthogonal fluxgate gradiometer
Energy Technology Data Exchange (ETDEWEB)
Elrefai, Ahmed L., E-mail: a.lotfyelrefai@gmail.com; Sasada, Ichiro [Applied Science for Electronics and Materials, Kyushu University, Kasuga (Japan)
2015-05-07
A new detection system for magnetic particles, which can operate in an unshielded environment, is developed using a fundamental mode orthogonal fluxgate gradiometer. The proposed detection system offers the advantages of cost, size, and weight reduction as compared to contamination detection systems using superconducting quantum interference device sensor. The detection system can be used to detect metallic contamination in foods or lithium ion battery production lines. The system has been investigated numerically to optimize various design parameters of the system. Experimental setup has been developed to evaluate some of the numerically predicted results. Steel balls were successfully detected down to the diameter of 50 μm.
Transfer Function Identification Using Orthogonal Fourier Transform Modeling Functions
Morelli, Eugene A.
2013-01-01
A method for transfer function identification, including both model structure determination and parameter estimation, was developed and demonstrated. The approach uses orthogonal modeling functions generated from frequency domain data obtained by Fourier transformation of time series data. The method was applied to simulation data to identify continuous-time transfer function models and unsteady aerodynamic models. Model fit error, estimated model parameters, and the associated uncertainties were used to show the effectiveness of the method for identifying accurate transfer function models from noisy data.
Nucleic acid constructs containing orthogonal site selective recombinases (OSSRs)
Energy Technology Data Exchange (ETDEWEB)
Gilmore, Joshua M.; Anderson, J. Christopher; Dueber, John E.
2017-08-29
The present invention provides for a recombinant nucleic acid comprising a nucleotide sequence comprising a plurality of constructs, wherein each construct independently comprises a nucleotide sequence of interest flanked by a pair of recombinase recognition sequences. Each pair of recombinase recognition sequences is recognized by a distinct recombinase. Optionally, each construct can, independently, further comprise one or more genes encoding a recombinase capable of recognizing the pair of recombinase recognition sequences of the construct. The recombinase can be an orthogonal (non-cross reacting), site-selective recombinase (OSSR).
Directory of Open Access Journals (Sweden)
Chih-Hong Lin
2015-01-01
Full Text Available Because the V-belt continuously variable transmission (CVT system driven by permanent magnet synchronous motor (PMSM has much unknown nonlinear and time-varying characteristics, the better control performance design for the linear control design is a time consuming procedure. In order to overcome difficulties for design of the linear controllers, the hybrid recurrent Laguerre-orthogonal-polynomial neural network (NN control system which has online learning ability to respond to the system’s nonlinear and time-varying behaviors is proposed to control PMSM servo-driven V-belt CVT system under the occurrence of the lumped nonlinear load disturbances. The hybrid recurrent Laguerre-orthogonal-polynomial NN control system consists of an inspector control, a recurrent Laguerre-orthogonal-polynomial NN control with adaptive law, and a recouped control with estimated law. Moreover, the adaptive law of online parameters in the recurrent Laguerre-orthogonal-polynomial NN is derived using the Lyapunov stability theorem. Furthermore, the optimal learning rate of the parameters by means of modified particle swarm optimization (PSO is proposed to achieve fast convergence. Finally, to show the effectiveness of the proposed control scheme, comparative studies are demonstrated by experimental results.
International Nuclear Information System (INIS)
Xiong, Guojiang; Li, Yinhong; Chen, Jinfu; Shi, Dongyuan; Duan, Xianzhong
2014-01-01
Highlights: • New method for dynamic economic dispatch problem using POLBBO. • Considering valve-point effects, ramp rate limits, transmission network losses. • POLBBO is able to balance the global exploration and the local exploitation. • An effective simultaneous constraints handling technique is proposed. • The achieved results by POLBBO are better than those reported in other literatures. - Abstract: Shortage of energy resources, rising power generation cost, and increasing electric energy demand make the dynamic economic dispatch (DED) increasingly necessary in today’s competitive electricity market. In this paper, an enhanced biogeography-based optimization (BBO) referred to as POLBBO is proposed to solve the DED problem with valve-point effects. BBO is a relatively new powerful population-based meta-heuristic algorithm inspired by biogeography and has been extensively applied to many scientific and engineering problems. However, its direct-copying-based migration and random mutation operators make BBO possess good local exploitation ability but lack enough global exploration ability. To remedy the defect, on one hand, an efficient operator named polyphyletic migration operator is proposed to enhance the search ability of POLBBO. This operator can not only generate new features from more promising areas in the search space, but also effectively increase the population diversity. On the other hand, an orthogonal learning (OL) strategy based on orthogonal experimental design is presented. The OL strategy can quickly discover useful information from the search experiences and effectively utilize the information to construct a more promising solution, and thereby provide a systematic and elaborate reasoning method to guide the search directions of POLBBO. In addition, an effective simultaneous constraints handling technique without penalty factor settings is developed to handle various complicated constraints of the DED problem. Finally, four test
Bifurcations in two-image photometric stereo for orthogonal illuminations
Kozera, R.; Prokopenya, A.; Noakes, L.; Śluzek, A.
2017-07-01
This paper discusses the ambiguous shape recovery in two-image photometric stereo for a Lambertian surface. The current uniqueness analysis refers to linearly independent light-source directions p = (0, 0, -1) and q arbitrary. For this case necessary and sufficient condition determining ambiguous reconstruction is governed by a second-order linear partial differential equation with constant coefficients. In contrast, a general position of both non-colinear illumination directions p and q leads to a highly non-linear PDE which raises a number of technical difficulties. As recently shown, the latter can also be handled for another family of orthogonal illuminations parallel to the OXZ-plane. For the special case of p = (0, 0, -1) a potential ambiguity stems also from the possible bifurcations of sub-local solutions glued together along a curve defined by an algebraic equation in terms of the data. This paper discusses the occurrence of similar bifurcations for such configurations of orthogonal light-source directions. The discussion to follow is supplemented with examples based on continuous reflectance map model and generated synthetic images.
Statistical benchmarking for orthogonal electrostatic quantum dot qubit devices
Gamble, John; Frees, Adam; Friesen, Mark; Coppersmith, S. N.
2014-03-01
Quantum dots in semiconductor systems have emerged as attractive candidates for the implementation of quantum information processors because of the promise of scalability, manipulability, and integration with existing classical electronics. A limitation in current devices is that the electrostatic gates used for qubit manipulation exhibit strong cross-capacitance, presenting a barrier for practical scale-up. Here, we introduce a statistical framework for making precise the notion of orthogonality. We apply our method to analyze recently implemented designs at the University of Wisconsin-Madison that exhibit much increased orthogonal control than was previously possible. We then use our statistical modeling to future device designs, providing practical guidelines for devices to have robust control properties. Sandia National Laboratories is a multi-program laboratory managed and operated by Sandia Corporation, a wholly owned subsidiary of Lockheed Martin Corporation, for the U.S. Department of Energy Nuclear Security Administration under contract DE-AC04-94AL85000. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressly or implied, of the US Government. This work was supported in part by the Laboratory Directed Research and Development program at Sandia National Laboratories, by ARO (W911NF-12-0607), and by the United States Department of Defense.
Downlink Non-Orthogonal Multiple Access (NOMA) in Poisson Networks
Ali, Konpal S.
2018-03-21
A network model is considered where Poisson distributed base stations transmit to $N$ power-domain non-orthogonal multiple access (NOMA) users (UEs) each that employ successive interference cancellation (SIC) for decoding. We propose three models for the clustering of NOMA UEs and consider two different ordering techniques for the NOMA UEs: mean signal power-based and instantaneous signal-to-intercell-interference-and-noise-ratio-based. For each technique, we present a signal-to-interference-and-noise ratio analysis for the coverage of the typical UE. We plot the rate region for the two-user case and show that neither ordering technique is consistently superior to the other. We propose two efficient algorithms for finding a feasible resource allocation that maximize the cell sum rate $\\\\mathcal{R}_{\\ m tot}$, for general $N$, constrained to: 1) a minimum rate $\\\\mathcal{T}$ for each UE, 2) identical rates for all UEs. We show the existence of: 1) an optimum $N$ that maximizes the constrained $\\\\mathcal{R}_{\\ m tot}$ given a set of network parameters, 2) a critical SIC level necessary for NOMA to outperform orthogonal multiple access. The results highlight the importance in choosing the network parameters $N$, the constraints, and the ordering technique to balance the $\\\\mathcal{R}_{\\ m tot}$ and fairness requirements. We also show that interference-aware UE clustering can significantly improve performance.
Power system frequency estimation based on an orthogonal decomposition method
Lee, Chih-Hung; Tsai, Men-Shen
2018-06-01
In recent years, several frequency estimation techniques have been proposed by which to estimate the frequency variations in power systems. In order to properly identify power quality issues under asynchronously-sampled signals that are contaminated with noise, flicker, and harmonic and inter-harmonic components, a good frequency estimator that is able to estimate the frequency as well as the rate of frequency changes precisely is needed. However, accurately estimating the fundamental frequency becomes a very difficult task without a priori information about the sampling frequency. In this paper, a better frequency evaluation scheme for power systems is proposed. This method employs a reconstruction technique in combination with orthogonal filters, which may maintain the required frequency characteristics of the orthogonal filters and improve the overall efficiency of power system monitoring through two-stage sliding discrete Fourier transforms. The results showed that this method can accurately estimate the power system frequency under different conditions, including asynchronously sampled signals contaminated by noise, flicker, and harmonic and inter-harmonic components. The proposed approach also provides high computational efficiency.
Cerenkov luminescence tomography based on preconditioning orthogonal matching pursuit
Liu, Haixiao; Hu, Zhenhua; Wang, Kun; Tian, Jie; Yang, Xin
2015-03-01
Cerenkov luminescence imaging (CLI) is a novel optical imaging method and has been proved to be a potential substitute of the traditional radionuclide imaging such as positron emission tomography (PET) and single-photon emission computed tomography (SPECT). This imaging method inherits the high sensitivity of nuclear medicine and low cost of optical molecular imaging. To obtain the depth information of the radioactive isotope, Cerenkov luminescence tomography (CLT) is established and the 3D distribution of the isotope is reconstructed. However, because of the strong absorption and scatter, the reconstruction of the CLT sources is always converted to an ill-posed linear system which is hard to be solved. In this work, the sparse nature of the light source was taken into account and the preconditioning orthogonal matching pursuit (POMP) method was established to effectively reduce the ill-posedness and obtain better reconstruction accuracy. To prove the accuracy and speed of this algorithm, a heterogeneous numerical phantom experiment and an in vivo mouse experiment were conducted. Both the simulation result and the mouse experiment showed that our reconstruction method can provide more accurate reconstruction result compared with the traditional Tikhonov regularization method and the ordinary orthogonal matching pursuit (OMP) method. Our reconstruction method will provide technical support for the biological application for Cerenkov luminescence.
Non-Orthogonal Multiple Access for Ubiquitous Wireless Sensor Networks.
Anwar, Asim; Seet, Boon-Chong; Ding, Zhiguo
2018-02-08
Ubiquitous wireless sensor networks (UWSNs) have become a critical technology for enabling smart cities and other ubiquitous monitoring applications. Their deployment, however, can be seriously hampered by the spectrum available to the sheer number of sensors for communication. To support the communication needs of UWSNs without requiring more spectrum resources, the power-domain non-orthogonal multiple access (NOMA) technique originally proposed for 5th Generation (5G) cellular networks is investigated for UWSNs for the first time in this paper. However, unlike 5G networks that operate in the licensed spectrum, UWSNs mostly operate in unlicensed spectrum where sensors also experience cross-technology interferences from other devices sharing the same spectrum. In this paper, we model the interferences from various sources at the sensors using stochastic geometry framework. To evaluate the performance, we derive a theorem and present new closed form expression for the outage probability of the sensors in a downlink scenario under interference limited environment. In addition, diversity analysis for the ordered NOMA users is performed. Based on the derived outage probability, we evaluate the average link throughput and energy consumption efficiency of NOMA against conventional orthogonal multiple access (OMA) technique in UWSNs. Further, the required computational complexity for the NOMA users is presented.
Downlink Non-Orthogonal Multiple Access (NOMA) in Poisson Networks
Ali, Konpal S.; Haenggi, Martin; Elsawy, Hesham; Chaaban, Anas; Alouini, Mohamed-Slim
2018-01-01
A network model is considered where Poisson distributed base stations transmit to $N$ power-domain non-orthogonal multiple access (NOMA) users (UEs) each that employ successive interference cancellation (SIC) for decoding. We propose three models for the clustering of NOMA UEs and consider two different ordering techniques for the NOMA UEs: mean signal power-based and instantaneous signal-to-intercell-interference-and-noise-ratio-based. For each technique, we present a signal-to-interference-and-noise ratio analysis for the coverage of the typical UE. We plot the rate region for the two-user case and show that neither ordering technique is consistently superior to the other. We propose two efficient algorithms for finding a feasible resource allocation that maximize the cell sum rate $\\mathcal{R}_{\\rm tot}$, for general $N$, constrained to: 1) a minimum rate $\\mathcal{T}$ for each UE, 2) identical rates for all UEs. We show the existence of: 1) an optimum $N$ that maximizes the constrained $\\mathcal{R}_{\\rm tot}$ given a set of network parameters, 2) a critical SIC level necessary for NOMA to outperform orthogonal multiple access. The results highlight the importance in choosing the network parameters $N$, the constraints, and the ordering technique to balance the $\\mathcal{R}_{\\rm tot}$ and fairness requirements. We also show that interference-aware UE clustering can significantly improve performance.
Modeling of Particle Emission During Dry Orthogonal Cutting
Khettabi, Riad; Songmene, Victor; Zaghbani, Imed; Masounave, Jacques
2010-08-01
Because of the risks associated with exposure to metallic particles, efforts are being put into controlling and reducing them during the metal working process. Recent studies by the authors involved in this project have presented the effects of cutting speeds, workpiece material, and tool geometry on particle emission during dry machining; the authors have also proposed a new parameter, named the dust unit ( D u), for use in evaluating the quantity of particle emissions relative to the quantity of chips produced during a machining operation. In this study, a model for predicting the particle emission (dust unit) during orthogonal turning is proposed. This model, which is based on the energy approach combined with the microfriction and the plastic deformation of the material, takes into account the tool geometry, the properties of the worked material, the cutting conditions, and the chip segmentation. The model is validated using experimental results obtained during the orthogonal turning of 6061-T6 aluminum alloy, AISI 1018, AISI 4140 steels, and grey cast iron. A good agreement was found with experimental results. This model can help in designing strategies for reducing particle emission during machining processes, at the source.
State orthogonality, boson bunching parameter and bosonic enhancement factor
Marchewka, Avi; Granot, Er'el
2016-04-01
It is emphasized that the bunching parameter β ≡ p B / p D , i.e. the ratio between the probability to measure two bosons and two distinguishable particles at the same state, is a constant of motion and depends only on the overlap between the initial wavefunctions. This ratio is equal to β = 2 / (1 + I 2), where I is the overlap integral between the initial wavefunctions. That is, only when the initial wavefunctions are orthogonal this ratio is equal to 2, however, this bunching ratio can be reduced to 1, when the two wavefunctions are identical. This simple equation explains the experimental evidences of a beam splitter. A straightforward conclusion is that by measuring the local bunching parameter β (at any point in space and time) it is possible to evaluate a global parameter I (the overlap between the initial wavefunctions). The bunching parameter is then generalized to arbitrary number of particles, and in an analogy to the two-particles scenario, the well-known bosonic enhancement appears only when all states are orthogonal.
State orthogonality, boson bunching parameter and bosonic enhancement factor
International Nuclear Information System (INIS)
Marchewka, A.; Granot, E.
2016-01-01
Bosons bunching is the tendency of bosons to bunch together with respect to distinguishable particles. It is emphasized that the bunching parameter β = p_B/p_D, i.e. the ratio between the probability to measure 2 bosons and 2 distinguishable particles at the same state, is a constant of motion and depends only on the overlap between the initial wavefunctions. This ratio is equal to β = 2/(1 + l"2), where l is the overlap integral between the initial wavefunctions. That is, only when the initial wavefunctions are orthogonal this ratio is equal to 2, however, this bunching ratio can be reduced to 1, when the two wavefunctions are identical. This simple equation explains the experimental evidences of a beam splitter. A straightforward conclusion is that by measuring the local bunching parameter β (at any point in space and time) it is possible to evaluate a global parameter l (the overlap between the initial wavefunctions). The bunching parameter is then generalized to arbitrary number of particles, and in an analogy to the two-particles scenario, the well-known bosonic enhancement appears only when all states are orthogonal
Supervised orthogonal discriminant subspace projects learning for face recognition.
Chen, Yu; Xu, Xiao-Hong
2014-02-01
In this paper, a new linear dimension reduction method called supervised orthogonal discriminant subspace projection (SODSP) is proposed, which addresses high-dimensionality of data and the small sample size problem. More specifically, given a set of data points in the ambient space, a novel weight matrix that describes the relationship between the data points is first built. And in order to model the manifold structure, the class information is incorporated into the weight matrix. Based on the novel weight matrix, the local scatter matrix as well as non-local scatter matrix is defined such that the neighborhood structure can be preserved. In order to enhance the recognition ability, we impose an orthogonal constraint into a graph-based maximum margin analysis, seeking to find a projection that maximizes the difference, rather than the ratio between the non-local scatter and the local scatter. In this way, SODSP naturally avoids the singularity problem. Further, we develop an efficient and stable algorithm for implementing SODSP, especially, on high-dimensional data set. Moreover, the theoretical analysis shows that LPP is a special instance of SODSP by imposing some constraints. Experiments on the ORL, Yale, Extended Yale face database B and FERET face database are performed to test and evaluate the proposed algorithm. The results demonstrate the effectiveness of SODSP. Copyright © 2013 Elsevier Ltd. All rights reserved.
USC orthogonal multiprocessor for image processing with neural networks
Hwang, Kai; Panda, Dhabaleswar K.; Haddadi, Navid
1990-07-01
This paper presents the architectural features and imaging applications of the Orthogonal MultiProcessor (OMP) system, which is under construction at the University of Southern California with research funding from NSF and assistance from several industrial partners. The prototype OMP is being built with 16 Intel i860 RISC microprocessors and 256 parallel memory modules using custom-designed spanning buses, which are 2-D interleaved and orthogonally accessed without conflicts. The 16-processor OMP prototype is targeted to achieve 430 MIPS and 600 Mflops, which have been verified by simulation experiments based on the design parameters used. The prototype OMP machine will be initially applied for image processing, computer vision, and neural network simulation applications. We summarize important vision and imaging algorithms that can be restructured with neural network models. These algorithms can efficiently run on the OMP hardware with linear speedup. The ultimate goal is to develop a high-performance Visual Computer (Viscom) for integrated low- and high-level image processing and vision tasks.
Cornière (de), Alexandre
2016-01-01
Search engines enable advertisers to target consumers based on the query they have entered. In a framework with horizontal product differentiation, imperfect product information and in which consumers incur search costs, I study a game in which advertisers have to choose a price and a set of relevant keywords. The targeting mechanism brings about three kinds of efficiency gains, namely lower search costs, better matching, and more intense product market price-competition. A monopolistic searc...
Impact of Decorrelation on Search Efficiency of Ambiguity Resolution
Directory of Open Access Journals (Sweden)
LU Liguo
2015-05-01
Full Text Available The decorrelation performance of LAMBDA algorithm, LLL algorithm and Seysen algorithm are analyzed with evaluation indexes, i.e., condition number, orthogonal defect and S(A. Moreover, relationships between decorrelation performance of the above algorithms and ambiguity search efficiency are evaluated using theoretical and practical validation, respectively. The results validate that there is no inevitable relation between decorrelation performance of variance-covariance matrix of original ambiguity and search efficiency, whereas, traditional views consider that search efficiency can be enhanced just by improving decorrelation performance. Further analysis shows that the essence to improving search efficiency major depends on the permutation of basis vectors according to a certain direction.
Tunkelang, Daniel
2009-01-01
We live in an information age that requires us, more than ever, to represent, access, and use information. Over the last several decades, we have developed a modern science and technology for information retrieval, relentlessly pursuing the vision of a "memex" that Vannevar Bush proposed in his seminal article, "As We May Think." Faceted search plays a key role in this program. Faceted search addresses weaknesses of conventional search approaches and has emerged as a foundation for interactive information retrieval. User studies demonstrate that faceted search provides more
Decomposition of orthogonal polygons in a set of rectanglеs
Shestakov, E.; Voronov, A.
2009-01-01
Algorithm for covering orthogonal integrated circuit layout objects is considered. Objects of the research are special single-connected orthogonal polygons which are generated during decomposition of any multiply connected polygon in a set of single-connected orthogonal polygons. Developed algorithm for covering polygons based on the mathematical techinque of logic matrix transformation. Results described in this paper, can be applied in computer geometry and image analysis.
A high-order q-difference equation for q-Hahn multiple orthogonal polynomials
DEFF Research Database (Denmark)
Arvesú, J.; Esposito, Chiara
2012-01-01
A high-order linear q-difference equation with polynomial coefficients having q-Hahn multiple orthogonal polynomials as eigenfunctions is given. The order of the equation coincides with the number of orthogonality conditions that these polynomials satisfy. Some limiting situations when are studie....... Indeed, the difference equation for Hahn multiple orthogonal polynomials given in Lee [J. Approx. Theory (2007), ), doi: 10.1016/j.jat.2007.06.002] is obtained as a limiting case....
International Nuclear Information System (INIS)
Vasile, A.
2001-01-01
Fast reactors have capacities to spare uranium natural resources by their breeding property and to propose solutions to the management of radioactive wastes by limiting the inventory of heavy nuclei. This article highlights the role that fast reactors could play for reducing the radiotoxicity of wastes. The conversion of 238 U into 239 Pu by neutron capture is more efficient in fast reactors than in light water reactors. In fast reactors multi-recycling of U + Pu leads to fissioning up to 95% of the initial fuel ( 238 U + 235 U). 2 strategies have been studied to burn actinides: - the multi-recycling of heavy nuclei is made inside the fuel element (homogeneous option); - the unique recycling is made in special irradiation targets placed inside the core or at its surroundings (heterogeneous option). Simulations have shown that, for the same amount of energy produced (400 TWhe), the mass of transuranium elements (Pu + Np + Am + Cm) sent to waste disposal is 60,9 Kg in the homogeneous option and 204.4 Kg in the heterogeneous option. Experimental programs are carried out in Phenix and BOR60 reactors in order to study the feasibility of such strategies. (A.C.)
DEFF Research Database (Denmark)
Pagh, Peter
Bogen omfatter en gennemgang af lovgivning, praksis og teori vedrørende køb af fast ejendom og offentligretlig og privatretlig regulering. Bogen belyser bl.a. de privatretlige emner: købers misligholdelsesbeføjelser, servitutter, naboret, hævd og erstatningsansvar for miljøskader samt den...
Self-assembly of orthogonal three-axis sensors
International Nuclear Information System (INIS)
Cho, J. H.; Hu, S.; Gracias, D. H.
2008-01-01
Conventional planar microfabrication is widely utilized to construct sensors for the measurement of physical or chemical properties. However, in these devices, the information component measured is typically restricted to only one vectorial axis. Here, we describe a self-assembling strategy that can be utilized to construct three dimensional (3D) cubic devices that facilitate measurement along three axes. This 3D measurement is achieved by arranging sensing elements orthogonally; any sensing element that can be lithographically patterned can be utilized. The 3D arrangement of sensors allows for the measurement of angular and orientation parameters. As an example, we describe a three-axis cantilever based sensor and demonstrate measurement of an evaporated analyte using resonant frequency shifts of cantilevers in each of the x, y, and z axes
q-analogue of the Krawtchouk and Meixner orthogonal polynomials
International Nuclear Information System (INIS)
Campigotto, C.; Smirnov, Yu.F.; Enikeev, S.G.
1993-06-01
The comparative analysis of Krawtchouk polynomials on a uniform grid with Wigner D-functions for the SU(2) group is presented. As a result the partnership between corresponding properties of the polynomials and D-functions is established giving the group-theoretical interpretation of the Krawtchouk polynomials properties. In order to extend such an analysis on the quantum groups SU q (2) and SU q (1,1), q-analogues of Krawtchouk and Meixner polynomials of a discrete variable are studied. The total set of characteristics of these polynomials is calculated, including the orthogonality condition, normalization factor, recurrent relation, the explicit analytic expression, the Rodrigues formula, the difference derivative formula and various particular cases and values. (R.P.) 22 refs.; 2 tabs
Orthogonal functions, discrete variable representation, and generalized gauss quadratures
DEFF Research Database (Denmark)
Schneider, B. I.; Nygaard, Nicolai
2002-01-01
in the original representation. This has been exploited in bound-state, scattering, and time-dependent problems using the so-called, discrete variable representation (DVR). At the core of this approach is the mathematical three-term recursion relationship satisfied by the classical orthogonal functions......, the distinction between spectral and grid approaches becomes blurred. In fact, the two approaches can be related by a similarity transformation. By the exploitation of this idea, calculations can be considerably simplified by removing the need to compute difficult matrix elements of the Hamiltonian...... functions, this is not the case. However, they may be computed in a stable numerical fashion, via the recursion. In essence, this is an application of the well-known Lanczos recursion approach. Once the recursion coefficients are known, it is possible to compute the points and weights of quadratures on...
Study of α-16O scattering by orthogonality condition models
International Nuclear Information System (INIS)
Breitschaft, A.M.; Canto, L.F.; Schechter, H.
1983-01-01
The use of approximate microscopic theories in α- 16 O scattering is investigated. The Orthogonality Condition Model (OCM) with both the direct potential of the Resonating Group Method (RMG) and with an effective local potential, V sub(eff), derived from Kernels of Generator Coordinate Method (GCM) is employed to study collisions at CM energies up to 30 MeV, for all relevant partial waves. Although the predictions of the OCM are consistent with 'exact' RGM results in both cases, the nuclear phase-shifts obtained with the effective potential are better. The presence of ambiguities in the derivation of V sub(eff) is noticed. The nature of such ambiguities is discussed. (Author) [pt
Study of α-16O scattering by orthogonality condition models
International Nuclear Information System (INIS)
Breitschaft, A.M.; Canto, L.F.; Schechter, H.
1982-01-01
The use of approximate microscopic theories in α- 16 O scattering is investigated. The Orthogonality Condition Model (OCM) with the direct potential of the Resonating Group Method (RGM) and with an effective local potential V sub(eff') derived from Kernels of the Generator Coordinate Method (GCM) is employed to study collisions at CM energies up to 30 MeV, for all relevant partial waves. Although the predictions of the OCM are consistent with 'exact' RGM results in both cases, the nuclear phase-shifts obtained with the effective potential are better. It is noticed the presence of ambiguities in the derivation of V sub(eff'). The nature of such ambiguities is discussed. (Author) [pt
Landmine detection using two-tapped joint orthogonal matching pursuits
Goldberg, Sean; Glenn, Taylor; Wilson, Joseph N.; Gader, Paul D.
2012-06-01
Joint Orthogonal Matching Pursuits (JOMP) is used here in the context of landmine detection using data obtained from an electromagnetic induction (EMI) sensor. The response from an object containing metal can be decomposed into a discrete spectrum of relaxation frequencies (DSRF) from which we construct a dictionary. A greedy iterative algorithm is proposed for computing successive residuals of a signal by subtracting away the highest matching dictionary element at each step. The nal condence of a particular signal is a combination of the reciprocal of this residual and the mean of the complex component. A two-tap approach comparing signals on opposite sides of the geometric location of the sensor is examined and found to produce better classication. It is found that using only a single pursuit does a comparable job, reducing complexity and allowing for real-time implementation in automated target recognition systems. JOMP is particularly highlighted in comparison with a previous EMI detection algorithm known as String Match.
Downlink scheduling using non-orthogonal uplink beams
Eltayeb, Mohammed E.
2014-04-01
Opportunistic schedulers rely on the feedback of the channel state information of users in order to perform user selection and downlink scheduling. This feedback increases with the number of users, and can lead to inefficient use of network resources and scheduling delays. We tackle the problem of feedback design, and propose a novel class of nonorthogonal codes to feed back channel state information. Users with favorable channel conditions simultaneously transmit their channel state information via non-orthogonal beams to the base station. The proposed formulation allows the base station to identify the strong users via a simple correlation process. After deriving the minimum required code length and closed-form expressions for the feedback load and downlink capacity, we show that i) the proposed algorithm reduces the feedback load while matching the achievable rate of full feedback algorithms operating over a noiseless feedback channel, and ii) the proposed codes are superior to the Gaussian codes.
Relativistic resonances as non-orthogonal states in Hilbert space
Blum, W
2003-01-01
We analyze the energy-momentum properties of relativistic short-lived particles with the result that they are characterized by two 4-vectors: in addition to the familiar energy-momentum vector (timelike) there is an energy-momentum 'spread vector' (spacelike). The wave functions in space and time for unstable particles are constructed. For the relativistic properties of unstable states we refer to Wigner's method of Poincare group representations that are induced by representations of the space-time translation and rotation groups. If stable particles, unstable particles and resonances are treated as elementary objects that are not fundamentally different one has to take into account that they will not generally be orthogonal to each other in their state space. The scalar product between a stable and an unstable state with otherwise identical properties is calculated in a particular Lorentz frame. The spin of an unstable particle is not infinitely sharp but has a 'spin spread' giving rise to 'spin neighbors'....
Orthogonally Evolved AI to Improve Difficulty Adjustment in Video Games
DEFF Research Database (Denmark)
Hintze, Arend; Olson, Randal; Lehman, Joel Anthony
2016-01-01
Computer games are most engaging when their difficulty is well matched to the player's ability, thereby providing an experience in which the player is neither overwhelmed nor bored. In games where the player interacts with computer-controlled opponents, the difficulty of the game can be adjusted...... not only by changing the distribution of opponents or game resources, but also through modifying the skill of the opponents. Applying evolutionary algorithms to evolve the artificial intelligence that controls opponent agents is one established method for adjusting opponent difficulty. Less-evolved agents...... (i.e. agents subject to fewer generations of evolution) make for easier opponents, while highly-evolved agents are more challenging to overcome. In this publication we test a new approach for difficulty adjustment in games: orthogonally evolved AI, where the player receives support from collaborating...
Downlink scheduling using non-orthogonal uplink beams
Eltayeb, Mohammed E.; Al-Naffouri, Tareq Y.; Bahrami, Hamid Reza Talesh
2014-01-01
Opportunistic schedulers rely on the feedback of the channel state information of users in order to perform user selection and downlink scheduling. This feedback increases with the number of users, and can lead to inefficient use of network resources and scheduling delays. We tackle the problem of feedback design, and propose a novel class of nonorthogonal codes to feed back channel state information. Users with favorable channel conditions simultaneously transmit their channel state information via non-orthogonal beams to the base station. The proposed formulation allows the base station to identify the strong users via a simple correlation process. After deriving the minimum required code length and closed-form expressions for the feedback load and downlink capacity, we show that i) the proposed algorithm reduces the feedback load while matching the achievable rate of full feedback algorithms operating over a noiseless feedback channel, and ii) the proposed codes are superior to the Gaussian codes.
An analysis dictionary learning algorithm under a noisy data model with orthogonality constraint.
Zhang, Ye; Yu, Tenglong; Wang, Wenwu
2014-01-01
Two common problems are often encountered in analysis dictionary learning (ADL) algorithms. The first one is that the original clean signals for learning the dictionary are assumed to be known, which otherwise need to be estimated from noisy measurements. This, however, renders a computationally slow optimization process and potentially unreliable estimation (if the noise level is high), as represented by the Analysis K-SVD (AK-SVD) algorithm. The other problem is the trivial solution to the dictionary, for example, the null dictionary matrix that may be given by a dictionary learning algorithm, as discussed in the learning overcomplete sparsifying transform (LOST) algorithm. Here we propose a novel optimization model and an iterative algorithm to learn the analysis dictionary, where we directly employ the observed data to compute the approximate analysis sparse representation of the original signals (leading to a fast optimization procedure) and enforce an orthogonality constraint on the optimization criterion to avoid the trivial solutions. Experiments demonstrate the competitive performance of the proposed algorithm as compared with three baselines, namely, the AK-SVD, LOST, and NAAOLA algorithms.
MHD STABILITY OF INTERSTELLAR MEDIUM PHASE TRANSITION LAYERS. I. MAGNETIC FIELD ORTHOGONAL TO FRONT
International Nuclear Information System (INIS)
Stone, Jennifer M.; Zweibel, Ellen G.
2009-01-01
We consider the scenario of a magnetic field orthogonal to a front separating two media of different temperatures and densities, such as cold and warm neutral interstellar gas, in a two-dimensional plane-parallel geometry. A linear stability analysis is performed to assess the behavior of both evaporation and condensation fronts when subject to incompressible, corrugational perturbations with wavelengths larger than the thickness of the front. We discuss the behavior of fronts in both super-Alfvenic and sub-Alfvenic flows. Since the propagation speed of fronts is slow in the interstellar medium (ISM), it is the sub-Alfvenic regime that is relevant, and magnetic fields are a significant influence on front dynamics. In this case, we find that evaporation fronts, which are unstable in the hydrodynamic regime, are stabilized. Condensation fronts are unstable, but for parameters typical of the neutral ISM the growth rates are so slow that steady-state fronts are effectively stable. However, the instability may become important if condensation proceeds at a sufficiently fast rate. This paper is the first in a series exploring the linear and nonlinear effects of magnetic field strength and orientation on the corrugational instability, with the ultimate goal of addressing outstanding questions about small-scale ISM structure.
An Analysis Dictionary Learning Algorithm under a Noisy Data Model with Orthogonality Constraint
Directory of Open Access Journals (Sweden)
Ye Zhang
2014-01-01
Full Text Available Two common problems are often encountered in analysis dictionary learning (ADL algorithms. The first one is that the original clean signals for learning the dictionary are assumed to be known, which otherwise need to be estimated from noisy measurements. This, however, renders a computationally slow optimization process and potentially unreliable estimation (if the noise level is high, as represented by the Analysis K-SVD (AK-SVD algorithm. The other problem is the trivial solution to the dictionary, for example, the null dictionary matrix that may be given by a dictionary learning algorithm, as discussed in the learning overcomplete sparsifying transform (LOST algorithm. Here we propose a novel optimization model and an iterative algorithm to learn the analysis dictionary, where we directly employ the observed data to compute the approximate analysis sparse representation of the original signals (leading to a fast optimization procedure and enforce an orthogonality constraint on the optimization criterion to avoid the trivial solutions. Experiments demonstrate the competitive performance of the proposed algorithm as compared with three baselines, namely, the AK-SVD, LOST, and NAAOLA algorithms.
Orthogonal views improves localisation in bone scans of wrist
International Nuclear Information System (INIS)
Roth, A.L.
1997-01-01
Full text: Of all nuclear medicine studies, bone scans are the most fundamental. However, straightforward these may seem, there are always mechanisms that can be implemented which assist in a more precise diagnosis, particularly in areas with an intricate bone structure. An 18-year-old right-handed student presented to her doctor with a one month history of pain over the right distal radio-ulna joint area. Clinically, she had prominence of the right ulna, which suggested that there may have been a previous injury to the wrist. Also, pronation/supination were painful where there was swelling of the extensor carpi ulnaris tendon, as well as some discomfort with clicking in ulna deviation/rotation. The X-rays demonstrated some premature radial epiphysial closure. A bone scan was requested to attempt to localise the main inflammatory focus. The dynamic study was performed in the planar projection with an immediate blood pool for 300k being taken. These demonstrated a vascular blush medially. A medial blood pool image was acquired and it localised the abnormal vascularity as being dorsal. A separate focal area of less intense blood pooling was also noted in the line of the distal ulna. Delayed images showed increased uptake localised to the ulna styloid. Anatomically, the superficial vascular blush correlated with tenosynovitis. Hence, the orthogonal initial and delayed images were definitive in the diagnoses of tenosynovitis of the extensor carpi ulnaris tendon. This clearly complements the information provided by the palmar view. However, it is important to remember that an increased radiation dose to the technologist is incurred as a result of the extra orthogonal view, hence attention to technique is imperative
Orthogonal views improves localisation in bone scans of wrist
Energy Technology Data Exchange (ETDEWEB)
Roth, A.L.
1997-09-01
Full text: Of all nuclear medicine studies, bone scans are the most fundamental. However, straightforward these may seem, there are always mechanisms that can be implemented which assist in a more precise diagnosis, particularly in areas with an intricate bone structure. An 18-year-old right-handed student presented to her doctor with a one month history of pain over the right distal radio-ulna joint area. Clinically, she had prominence of the right ulna, which suggested that there may have been a previous injury to the wrist. Also, pronation/supination were painful where there was swelling of the extensor carpi ulnaris tendon, as well as some discomfort with clicking in ulna deviation/rotation. The X-rays demonstrated some premature radial epiphysial closure. A bone scan was requested to attempt to localise the main inflammatory focus. The dynamic study was performed in the planar projection with an immediate blood pool for 300k being taken. These demonstrated a vascular blush medially. A medial blood pool image was acquired and it localised the abnormal vascularity as being dorsal. A separate focal area of less intense blood pooling was also noted in the line of the distal ulna. Delayed images showed increased uptake localised to the ulna styloid. Anatomically, the superficial vascular blush correlated with tenosynovitis. Hence, the orthogonal initial and delayed images were definitive in the diagnoses of tenosynovitis of the extensor carpi ulnaris tendon. This clearly complements the information provided by the palmar view. However, it is important to remember that an increased radiation dose to the technologist is incurred as a result of the extra orthogonal view, hence attention to technique is imperative.
African Journals Online (AJOL)
Search tips: Search terms are case-insensitive; Common words are ignored; By default only articles containing all terms in the query are returned (i.e., AND is implied); Combine multiple words with OR to find articles containing either term; e.g., education OR research; Use parentheses to create more complex queries; e.g., ...
Accelerated Profile HMM Searches.
Directory of Open Access Journals (Sweden)
Sean R Eddy
2011-10-01
Full Text Available Profile hidden Markov models (profile HMMs and probabilistic inference methods have made important contributions to the theory of sequence database homology search. However, practical use of profile HMM methods has been hindered by the computational expense of existing software implementations. Here I describe an acceleration heuristic for profile HMMs, the "multiple segment Viterbi" (MSV algorithm. The MSV algorithm computes an optimal sum of multiple ungapped local alignment segments using a striped vector-parallel approach previously described for fast Smith/Waterman alignment. MSV scores follow the same statistical distribution as gapped optimal local alignment scores, allowing rapid evaluation of significance of an MSV score and thus facilitating its use as a heuristic filter. I also describe a 20-fold acceleration of the standard profile HMM Forward/Backward algorithms using a method I call "sparse rescaling". These methods are assembled in a pipeline in which high-scoring MSV hits are passed on for reanalysis with the full HMM Forward/Backward algorithm. This accelerated pipeline is implemented in the freely available HMMER3 software package. Performance benchmarks show that the use of the heuristic MSV filter sacrifices negligible sensitivity compared to unaccelerated profile HMM searches. HMMER3 is substantially more sensitive and 100- to 1000-fold faster than HMMER2. HMMER3 is now about as fast as BLAST for protein searches.
Vollinger, C
2013-01-01
Conventional ferrite-tuned cavities operate either with bias fields that are orthogonal or parallel to the magnetic RF-field. For a cavity that tunes rapidly over an overall frequency range around 100-400 MHz with high Q, we use ferrite garnets exposed to an innovative new biasing method consisting of a superposition of perpendicular and parallel magnetic fields. This method leads to a significant enlargement of the high-Q cavity tuning range by defining an operation point close to the magnetic saturation and thus improving ferrite material behaviour. A further advantage of this technique is the fast tuning speed resulting from the fact that tuning is carried out either with pure parallel biasing, or together with a very small change of operating point from perpendicular bias. In this paper, several scaled test models of ferrite-filled resonators are shown; measurements on the set-ups are compared and discussed.
Representations for the extreme zeros of orthogonal polynomials (vol 233, pg 847, 2009)
van Doorn, Erik A.; van Foreest, Nicky D.; Zeifman, Alexander I.
2013-01-01
We correct representations for the endpoints of the true interval of orthogonality of a sequence of orthogonal polynomials that were stated by us in the Journal of Computational and Applied Mathematics 233 (2009) 847-851. (c) 2013 Elsevier B.V. All rights reserved.
A note on the zeros of Freud-Sobolev orthogonal polynomials
Moreno-Balcazar, Juan J.
2007-10-01
We prove that the zeros of a certain family of Sobolev orthogonal polynomials involving the Freud weight function e-x4 on are real, simple, and interlace with the zeros of the Freud polynomials, i.e., those polynomials orthogonal with respect to the weight function e-x4. Some numerical examples are shown.
Bio-inspired supramolecular materials by orthogonal self-assembly of hydrogelators and phospholipids
Boekhoven, J.; Brizard, AMA; Stuart, M. C A; Florusse, L.J.; Raffy, G.; Del Guerzo, A.; van Esch, J.H.
2016-01-01
The orthogonal self-assembly of multiple components is a powerful strategy towards the formation of complex biomimetic architectures, but so far the rules for designing such systems are unclear. Here we show how to identify orthogonal self-assembly at the supramolecular level and describe
On the non-orthogonal sampling scheme for Gabor's signal expansion
Bastiaans, M.J.; Leest, van A.J.; Veen, J.P.
2000-01-01
Gabor's signal expansion and the Gabor transform are formulated on a non-orthogonal time-frequency lattice instead of on the traditional rectangular lattice [1,2]. The reason for doing so is that a non-orthogonal sampling geometry might be better adapted to the form of the window functions (in the
Aspects of Orthogonality in the Development of the National Digital Wealth (NDW
Directory of Open Access Journals (Sweden)
Ion IVAN
2014-01-01
Full Text Available There are presented aspects of orthogonality in the development of the national digital wealth. There is presented the concept of NDW. Are identified quality characteristics. Are built orthogonality metrics for software development applications which are parts of NDW.
2017-10-01
AWARD NUMBER: W81XWH-16-1-0595 TITLE: Prostate-Specific Membrane Antigen (PSMA) Targeted Bio -orthogonal Therapy for Metastatic Prostate Cancer...Sep 2016 - 14 Sep 2017 4. TITLE AND SUBTITLE Prostate-Specific Membrane Antigen (PSMA) Targeted Bio -orthogonal Therapy for Metastatic Prostate
Hamadi, Youssef; Saubion, Frédéric
2012-01-01
Autonomous combinatorial search (AS) represents a new field in combinatorial problem solving. Its major standpoint and originality is that it considers that problem solvers must be capable of self-improvement operations. This is the first book dedicated to AS.
PCT Uncertainty Analysis Using Unscented Transform with Random Orthogonal Matrix
Energy Technology Data Exchange (ETDEWEB)
Fynana, Douglas A.; Ahn, Kwang-Il [KAERI, Daejeon (Korea, Republic of); Lee, John C. [Univ. of Michigan, Michigan (United States)
2015-05-15
Most Best Estimate Plus Uncertainty (BEPU) methods employ nonparametric order statistics through Wilks' formula to quantify uncertainties of best estimate simulations of nuclear power plant (NPP) transients. 95%/95% limits, the 95''t{sup h} percentile at a 95% confidence level, are obtained by randomly sampling all uncertainty contributors through conventional Monte Carlo (MC). Advantages are simple implementation of MC sampling of input probability density functions (pdfs) and limited computational expense of 1''s{sup t}, 2''n{sup d}, and 3''r{sup d} order Wilks' formula requiring only 59, 93, or 124 simulations, respectively. A disadvantage of small sample size is large sample to sample variation of statistical estimators. This paper presents a new efficient sampling based algorithm for accurate estimation of mean and variance of the output parameter pdf. The algorithm combines a deterministic sampling method, the unscented transform (UT), with random sampling through the generation of a random orthogonal matrix (ROM). The UT guarantees the mean, covariance, and 3''r{sup d} order moments of the multivariate input parameter distributions are exactly preserved by the sampled input points and the orthogonal transformation of the points by a ROM guarantees the sample error of all 4''t{sup h} order and higher moments are unbiased. The UT with ROM algorithm is applied to the uncertainty quantification of the peak clad temperature (PCT) during a large break loss-of-coolant accident (LBLOCA) in an OPR1000 NPP to demonstrate the applicability of the new algorithm to BEPU. This paper presented a new algorithm combining the UT with ROM for efficient multivariate parameter sampling that ensures sample input covariance and 3''r{sup d} order moments are exactly preserved and 4''th moment errors are small and unbiased. The advantageous sample properties guarantee higher order accuracy and
Orthogonal optimization of a water hydraulic pilot-operated pressure-reducing valve
Mao, Xuyao; Wu, Chao; Li, Bin; Wu, Di
2017-12-01
In order to optimize the comprehensive characteristics of a water hydraulic pilot-operated pressure-reducing valve, numerical orthogonal experimental design was adopted. Six parameters of the valve, containing diameters of damping plugs, volume of spring chamber, half cone angle of main spool, half cone angle of pilot spool, mass of main spool and diameter of main spool, were selected as the orthogonal factors, and each factor has five different levels. An index of flowrate stability, pressure stability and pressure overstrike stability (iFPOS) was used to judge the merit of each orthogonal attempt. Embedded orthogonal process turned up and a final optimal combination of these parameters was obtained after totally 50 numerical orthogonal experiments. iFPOS could be low to a fairly low value which meant that the valve could have much better stabilities. During the optimization, it was also found the diameters of damping plugs and main spool played important roles in stability characteristics of the valve.
Elsheikh, Ahmed H.
2013-06-01
We introduce a nonlinear orthogonal matching pursuit (NOMP) for sparse calibration of subsurface flow models. Sparse calibration is a challenging problem as the unknowns are both the non-zero components of the solution and their associated weights. NOMP is a greedy algorithm that discovers at each iteration the most correlated basis function with the residual from a large pool of basis functions. The discovered basis (aka support) is augmented across the nonlinear iterations. Once a set of basis functions are selected, the solution is obtained by applying Tikhonov regularization. The proposed algorithm relies on stochastically approximated gradient using an iterative stochastic ensemble method (ISEM). In the current study, the search space is parameterized using an overcomplete dictionary of basis functions built using the K-SVD algorithm. The proposed algorithm is the first ensemble based algorithm that tackels the sparse nonlinear parameter estimation problem. © 2013 Elsevier Ltd.
International Nuclear Information System (INIS)
Klotz, E.; Linde, R.; Tiemens, U.; Weiss, H.
1978-01-01
A system has been constructed for fast tomosynthesis, whereby X-ray photographs are made of a single layer of an object. Twenty five X-ray tubes illuminate the object simultaneously at different angles. The resulting coded image is decoded by projecting it with a pattern of lenses that have the same form as the pattern of X-ray tubes. The coded image is optically correlated with the pattern of the sources. The scale of this can be adjusted so that the desired layer of the object is portrayed. Experimental results of its use in a hospital are presented. (C.F.)
Stochastic Ocean Predictions with Dynamically-Orthogonal Primitive Equations
Subramani, D. N.; Haley, P., Jr.; Lermusiaux, P. F. J.
2017-12-01
The coastal ocean is a prime example of multiscale nonlinear fluid dynamics. Ocean fields in such regions are complex and intermittent with unstationary heterogeneous statistics. Due to the limited measurements, there are multiple sources of uncertainties, including the initial conditions, boundary conditions, forcing, parameters, and even the model parameterizations and equations themselves. For efficient and rigorous quantification and prediction of these uncertainities, the stochastic Dynamically Orthogonal (DO) PDEs for a primitive equation ocean modeling system with a nonlinear free-surface are derived and numerical schemes for their space-time integration are obtained. Detailed numerical studies with idealized-to-realistic regional ocean dynamics are completed. These include consistency checks for the numerical schemes and comparisons with ensemble realizations. As an illustrative example, we simulate the 4-d multiscale uncertainty in the Middle Atlantic/New York Bight region during the months of Jan to Mar 2017. To provide intitial conditions for the uncertainty subspace, uncertainties in the region were objectively analyzed using historical data. The DO primitive equations were subsequently integrated in space and time. The probability distribution function (pdf) of the ocean fields is compared to in-situ, remote sensing, and opportunity data collected during the coincident POSYDON experiment. Results show that our probabilistic predictions had skill and are 3- to 4- orders of magnitude faster than classic ensemble schemes.
Aeroelastic System Development Using Proper Orthogonal Decomposition and Volterra Theory
Lucia, David J.; Beran, Philip S.; Silva, Walter A.
2003-01-01
This research combines Volterra theory and proper orthogonal decomposition (POD) into a hybrid methodology for reduced-order modeling of aeroelastic systems. The out-come of the method is a set of linear ordinary differential equations (ODEs) describing the modal amplitudes associated with both the structural modes and the POD basis functions for the uid. For this research, the structural modes are sine waves of varying frequency, and the Volterra-POD approach is applied to the fluid dynamics equations. The structural modes are treated as forcing terms which are impulsed as part of the uid model realization. Using this approach, structural and uid operators are coupled into a single aeroelastic operator. This coupling converts a free boundary uid problem into an initial value problem, while preserving the parameter (or parameters) of interest for sensitivity analysis. The approach is applied to an elastic panel in supersonic cross ow. The hybrid Volterra-POD approach provides a low-order uid model in state-space form. The linear uid model is tightly coupled with a nonlinear panel model using an implicit integration scheme. The resulting aeroelastic model provides correct limit-cycle oscillation prediction over a wide range of panel dynamic pressure values. Time integration of the reduced-order aeroelastic model is four orders of magnitude faster than the high-order solution procedure developed for this research using traditional uid and structural solvers.
Combining orthogonal polarization for elongated target detection with GPR
International Nuclear Information System (INIS)
Lualdi, Maurizio; Lombardi, Federico
2014-01-01
For an accurate imaging of ground penetrating radar data the polarization characteristics of the propagating electromagnetic (EM) wavefield and wave amplitude variations with antenna pattern orientation must be taken into account. For objects that show some directionality feature and cylindrical shape any misalignment between transmitter and target can strongly modify the polarization state of the backscattered wavefield, thus conditioning the detection capability of the system. Hints on the depolarization can be used to design the optimal GPR antenna survey to avoid omissions and pitfalls during data processing. This research addresses the issue of elongated target detection through a multi azimuth (or multi polarization) approach based on the combination of mutually orthogonal GPR data. Results from the analysis of the formal scattering problem demonstrate how this strategy can reach a scalar formulation of the scattering matrix and achieve a rotational invariant quantity. The effectiveness of the algorithm is then evaluated with a detailed field example showing results closely proximal to those obtained under the optimal alignment condition: detection is significantly improved and the risk of target missing is reduced. (paper)
Systematic Identification of MCU Modulators by Orthogonal Interspecies Chemical Screening.
Arduino, Daniela M; Wettmarshausen, Jennifer; Vais, Horia; Navas-Navarro, Paloma; Cheng, Yiming; Leimpek, Anja; Ma, Zhongming; Delrio-Lorenzo, Alba; Giordano, Andrea; Garcia-Perez, Cecilia; Médard, Guillaume; Kuster, Bernhard; García-Sancho, Javier; Mokranjac, Dejana; Foskett, J Kevin; Alonso, M Teresa; Perocchi, Fabiana
2017-08-17
The mitochondrial calcium uniporter complex is essential for calcium (Ca 2+ ) uptake into mitochondria of all mammalian tissues, where it regulates bioenergetics, cell death, and Ca 2+ signal transduction. Despite its involvement in several human diseases, we currently lack pharmacological agents for targeting uniporter activity. Here we introduce a high-throughput assay that selects for human MCU-specific small-molecule modulators in primary drug screens. Using isolated yeast mitochondria, reconstituted with human MCU, its essential regulator EMRE, and aequorin, and exploiting a D-lactate- and mannitol/sucrose-based bioenergetic shunt that greatly minimizes false-positive hits, we identify mitoxantrone out of more than 600 clinically approved drugs as a direct selective inhibitor of human MCU. We validate mitoxantrone in orthogonal mammalian cell-based assays, demonstrating that our screening approach is an effective and robust tool for MCU-specific drug discovery and, more generally, for the identification of compounds that target mitochondrial functions. Copyright © 2017 Elsevier Inc. All rights reserved.
Predicting coastal morphological changes with empirical orthogonal functionmethod
Directory of Open Access Journals (Sweden)
Fernando Alvarez
2016-01-01
Full Text Available In order to improve the accuracy of prediction when using the empirical orthogonal function (EOF method, this paper describes a novel approach for two-dimensional (2D EOF analysis based on extrapolating both the spatial and temporal EOF components for long-term prediction of coastal morphological changes. The approach was investigated with data obtained from a process-based numerical model, COAST2D, which was applied to an idealized study site with a group of shore-parallel breakwaters. The progressive behavior of the spatial and temporal EOF components, related to bathymetric changes over a training period, was demonstrated, and EOF components were extrapolated with combined linear and exponential functions for long-term prediction. The extrapolated EOF components were then used to reconstruct bathymetric changes. The comparison of the reconstructed bathymetric changes with the modeled results from the COAST2D model illustrates that the presented approach can be effective for long-term prediction of coastal morphological changes, and extrapolating both the spatial and temporal EOF components yields better results than extrapolating only the temporal EOF component.
Statistical mechanics of learning orthogonal signals for general covariance models
International Nuclear Information System (INIS)
Hoyle, David C
2010-01-01
Statistical mechanics techniques have proved to be useful tools in quantifying the accuracy with which signal vectors are extracted from experimental data. However, analysis has previously been limited to specific model forms for the population covariance C, which may be inappropriate for real world data sets. In this paper we obtain new statistical mechanical results for a general population covariance matrix C. For data sets consisting of p sample points in R N we use the replica method to study the accuracy of orthogonal signal vectors estimated from the sample data. In the asymptotic limit of N,p→∞ at fixed α = p/N, we derive analytical results for the signal direction learning curves. In the asymptotic limit the learning curves follow a single universal form, each displaying a retarded learning transition. An explicit formula for the location of the retarded learning transition is obtained and we find marked variation in the location of the retarded learning transition dependent on the distribution of population covariance eigenvalues. The results of the replica analysis are confirmed against simulation
Theory of direct sunlight transmission through orthogonal screen cells
International Nuclear Information System (INIS)
Aljofi, E.K.
2006-01-01
The Purpose of this paper is to investigate the feasibility of using the Rawshan screens to control high light intensity and to avoid excessive solar radiation penetrating inside the building interior. The exploration of the environmental characteristics of this device indicates an ideal solution to utilize available daylight in the arid atmosphere, reduces energy consumption due to the us of artificial light and ensures the continuity of the traditional architecture and the country heritage. A systematic analysis of direct sunlight transmission has been explored using a mathematical approach. The study intends to construct a predictive tool for the architects through which different specifications of the Rawshan screens were identified as far as direct beam of light concerned. The predictive tool was set-up to investigate various parameters of the screen such as the screen configurations, the aperture configurations, the change in orientation and the effect of the sky condition. The analysis of light transmission through the screen were set-up for orthogonal shapes
Babaee, Hessam; Choi, Minseok; Sapsis, Themistoklis P.; Karniadakis, George Em
2017-09-01
We develop a new robust methodology for the stochastic Navier-Stokes equations based on the dynamically-orthogonal (DO) and bi-orthogonal (BO) methods [1-3]. Both approaches are variants of a generalized Karhunen-Loève (KL) expansion in which both the stochastic coefficients and the spatial basis evolve according to system dynamics, hence, capturing the low-dimensional structure of the solution. The DO and BO formulations are mathematically equivalent [3], but they exhibit computationally complimentary properties. Specifically, the BO formulation may fail due to crossing of the eigenvalues of the covariance matrix, while both BO and DO become unstable when there is a high condition number of the covariance matrix or zero eigenvalues. To this end, we combine the two methods into a robust hybrid framework and in addition we employ a pseudo-inverse technique to invert the covariance matrix. The robustness of the proposed method stems from addressing the following issues in the DO/BO formulation: (i) eigenvalue crossing: we resolve the issue of eigenvalue crossing in the BO formulation by switching to the DO near eigenvalue crossing using the equivalence theorem and switching back to BO when the distance between eigenvalues is larger than a threshold value; (ii) ill-conditioned covariance matrix: we utilize a pseudo-inverse strategy to invert the covariance matrix; (iii) adaptivity: we utilize an adaptive strategy to add/remove modes to resolve the covariance matrix up to a threshold value. In particular, we introduce a soft-threshold criterion to allow the system to adapt to the newly added/removed mode and therefore avoid repetitive and unnecessary mode addition/removal. When the total variance approaches zero, we show that the DO/BO formulation becomes equivalent to the evolution equation of the Optimally Time-Dependent modes [4]. We demonstrate the capability of the proposed methodology with several numerical examples, namely (i) stochastic Burgers equation: we
Keep Searching and You’ll Find
DEFF Research Database (Denmark)
Laursen, Keld
2012-01-01
This article critically reviews and synthesizes the contributions found in theoretical and empirical studies of firm-level innovation search processes. It explores the advantages and disadvantages of local and non-local search, discusses organizational responses, and identifies potential exogenous...... different search strategies, but end up with very similar technological profiles in fast-growing technologies. The article concludes by highlighting what we have learnt from the literature and suggesting some new avenues for research....
Oliver, B. M.
Attention is given to the approaches which would provide the greatest chance of success in attempts related to the discovery of extraterrestrial advanced cultures in the Galaxy, taking into account the principle of least energy expenditure. The energetics of interstellar contact are explored, giving attention to the use of manned spacecraft, automatic probes, and beacons. The least expensive approach to a search for other civilizations involves a listening program which attempts to detect signals emitted by such civilizations. The optimum part of the spectrum for the considered search is found to be in the range from 1 to 2 GHz. Antenna and transmission formulas are discussed along with the employment of matched gates and filters, the probable characteristics of the signals to be detected, the filter-signal mismatch loss, surveys of the radio sky, the conduction of targeted searches.
Directory of Open Access Journals (Sweden)
Haiwen Li
2018-01-01
Full Text Available The estimation speed of positioning parameters determines the effectiveness of the positioning system. The time of arrival (TOA and direction of arrival (DOA parameters can be estimated by the space-time two-dimensional multiple signal classification (2D-MUSIC algorithm for array antenna. However, this algorithm needs much time to complete the two-dimensional pseudo spectral peak search, which makes it difficult to apply in practice. Aiming at solving this problem, a fast estimation method of space-time two-dimensional positioning parameters based on Hadamard product is proposed in orthogonal frequency division multiplexing (OFDM system, and the Cramer-Rao bound (CRB is also presented. Firstly, according to the channel frequency domain response vector of each array, the channel frequency domain estimation vector is constructed using the Hadamard product form containing location information. Then, the autocorrelation matrix of the channel response vector for the extended array element in frequency domain and the noise subspace are calculated successively. Finally, by combining the closed-form solution and parameter pairing, the fast joint estimation for time delay and arrival direction is accomplished. The theoretical analysis and simulation results show that the proposed algorithm can significantly reduce the computational complexity and guarantee that the estimation accuracy is not only better than estimating signal parameters via rotational invariance techniques (ESPRIT algorithm and 2D matrix pencil (MP algorithm but also close to 2D-MUSIC algorithm. Moreover, the proposed algorithm also has certain adaptability to multipath environment and effectively improves the ability of fast acquisition of location parameters.
List search hardware for interpretive software
Altaber, Jacques; Mears, B; Rausch, R
1979-01-01
Interpreted languages, e.g. BASIC, are simple to learn, easy to use, quick to modify and in general 'user-friendly'. However, a critically time consuming process during interpretation is that of list searching. A special microprogrammed device for fast list searching has therefore been developed at the SPS Division of CERN. It uses bit- sliced hardware. Fast algorithms perform search, insert and delete of a six-character name and its value in a list of up to 1000 pairs. The prototype shows retrieval times of the order of 10-30 microseconds. (11 refs).
Solution of the ratchet-shakedown Bree problem with an extra orthogonal primary load
International Nuclear Information System (INIS)
Bradford, R.A.W.
2015-01-01
The complete shakedown and ratcheting solution is derived analytically for a flat plate subject to unequal biaxial primary membrane stresses and a cyclic secondary bending stress in one in-plane direction (x). The Tresca yield condition and elastic-perfectly plastic behaviour are assumed. It is shown that the results can be expressed in the form of a “universal” ratchet diagram applicable for all magnitudes of orthogonal load. For sufficiently large cyclic bending stresses, tensile ratcheting can occur in the x direction if the x direction primary membrane stress exceeds half that in the orthogonal direction. Conversely, for sufficiently large cyclic bending stresses ratcheting in the x direction will be compressive if the x direction primary membrane stress is less than half that in the orthogonal direction. When the x direction primary membrane stress is exactly half that in the orthogonal direction ratcheting cannot occur however large the cyclic secondary bending stress. - Highlights: • A complete shakedown and ratcheting solution is derived analytically. • The problem is Bree-like but with an extra orthogonal primary load. • The ratchet diagram can be expressed in a form applicable to any orthogonal load. • Tensile ratcheting can occur if the primary load exceeds half the orthogonal load. • Compressive ratcheting can occur for smaller primary loads
Influence of mesh non-orthogonality on numerical simulation of buoyant jet flows
International Nuclear Information System (INIS)
Ishigaki, Masahiro; Abe, Satoshi; Sibamoto, Yasuteru; Yonomoto, Taisuke
2017-01-01
Highlights: • Influence of mesh non-orthogonality on numerical solution of buoyant jet flows. • Buoyant jet flows are simulated with hexahedral and prismatic meshes. • Jet instability with prismatic meshes may be overestimated compared to that with hexahedral meshes. • Modified solvers that can reduce the influence of mesh non-orthogonality and reduce computation time are proposed. - Abstract: In the present research, we discuss the influence of mesh non-orthogonality on numerical solution of a type of buoyant flow. Buoyant jet flows are simulated numerically with hexahedral and prismatic mesh elements in an open source Computational Fluid Dynamics (CFD) code called “OpenFOAM”. Buoyant jet instability obtained with the prismatic meshes may be overestimated compared to that obtained with the hexahedral meshes when non-orthogonal correction is not applied in the code. Although the non-orthogonal correction method can improve the instability generated by mesh non-orthogonality, it may increase computation time required to reach a convergent solution. Thus, we propose modified solvers that can reduce the influence of mesh non-orthogonality and reduce the computation time compared to the existing solvers in OpenFOAM. It is demonstrated that calculations for a buoyant jet with a large temperature difference are performed faster by the modified solver.
Influence of mesh non-orthogonality on numerical simulation of buoyant jet flows
Energy Technology Data Exchange (ETDEWEB)
Ishigaki, Masahiro, E-mail: ishigaki.masahiro@jaea.go.jp; Abe, Satoshi; Sibamoto, Yasuteru; Yonomoto, Taisuke
2017-04-01
Highlights: • Influence of mesh non-orthogonality on numerical solution of buoyant jet flows. • Buoyant jet flows are simulated with hexahedral and prismatic meshes. • Jet instability with prismatic meshes may be overestimated compared to that with hexahedral meshes. • Modified solvers that can reduce the influence of mesh non-orthogonality and reduce computation time are proposed. - Abstract: In the present research, we discuss the influence of mesh non-orthogonality on numerical solution of a type of buoyant flow. Buoyant jet flows are simulated numerically with hexahedral and prismatic mesh elements in an open source Computational Fluid Dynamics (CFD) code called “OpenFOAM”. Buoyant jet instability obtained with the prismatic meshes may be overestimated compared to that obtained with the hexahedral meshes when non-orthogonal correction is not applied in the code. Although the non-orthogonal correction method can improve the instability generated by mesh non-orthogonality, it may increase computation time required to reach a convergent solution. Thus, we propose modified solvers that can reduce the influence of mesh non-orthogonality and reduce the computation time compared to the existing solvers in OpenFOAM. It is demonstrated that calculations for a buoyant jet with a large temperature difference are performed faster by the modified solver.
Mathematical programming solver based on local search
Gardi, Frédéric; Darlay, Julien; Estellon, Bertrand; Megel, Romain
2014-01-01
This book covers local search for combinatorial optimization and its extension to mixed-variable optimization. Although not yet understood from the theoretical point of view, local search is the paradigm of choice for tackling large-scale real-life optimization problems. Today's end-users demand interactivity with decision support systems. For optimization software, this means obtaining good-quality solutions quickly. Fast iterative improvement methods, like local search, are suited to satisfying such needs. Here the authors show local search in a new light, in particular presenting a new kind of mathematical programming solver, namely LocalSolver, based on neighborhood search. First, an iconoclast methodology is presented to design and engineer local search algorithms. The authors' concern about industrializing local search approaches is of particular interest for practitioners. This methodology is applied to solve two industrial problems with high economic stakes. Software based on local search induces ex...
Brachytherapy reconstruction using orthogonal scout views from the CT
International Nuclear Information System (INIS)
Perez, J.; Lliso, F.; Carmona, V.; Bea, J.; Tormo, A.; Petschen, I.
1996-01-01
Introduction: CT assisted brachytherapy planning is demonstrating to have great advantages as external RT planning does. One of the problems we have found in this approach with the conventional gynecological Fletcher applicators is the high amount of artefacts (ovoids with rectal and vessical protections) in the CT slice. We have introduced a reconstruction method based on scout views in order to avoid this problem, allowing us to perform brachytherapy reconstruction completely CT assisted. We use a virtual simulation chain by General Electric Medical Systems. Method and discussion: Two orthogonal scout views (0 and 90 tube positions) are performed. The reconstruction method takes into account the virtual position of the focus and the fact that there is only divergence in the transverse plane. Algorithms developed for sources as well as for reference points localisation (A, B, lymphatic Fletcher trapezoid, pelvic wall, etc.) are presented. This method has the following practical advantages: the porte-cassette is not necessary, the image quality can be improved (it is very helpful in pelvic lateral views that are critical in conventional radiographs), the total time to get the data is smaller than for conventional radiographs (reduction of patient motion effects) and problems that appear in CT-slice based reconstruction in the case of strongly curved intrauterine applicators are avoided. Even though the resolution is smaller than in conventional radiographs it is good enough for brachytherapy. Regarding the CT planning this method presents the interesting feature that the co-ordinate system is the same for the reconstruction process that for the CT-slices set. As the application can be reconstructed from scout views and the doses can be evaluated on CT slices it is easier to correlate the dose values obtained for the traditional points with those provided by the CT information
Electrocardiogram ST-Segment Morphology Delineation Method Using Orthogonal Transformations.
Directory of Open Access Journals (Sweden)
Miha Amon
Full Text Available Differentiation between ischaemic and non-ischaemic transient ST segment events of long term ambulatory electrocardiograms is a persisting weakness in present ischaemia detection systems. Traditional ST segment level measuring is not a sufficiently precise technique due to the single point of measurement and severe noise which is often present. We developed a robust noise resistant orthogonal-transformation based delineation method, which allows tracing the shape of transient ST segment morphology changes from the entire ST segment in terms of diagnostic and morphologic feature-vector time series, and also allows further analysis. For these purposes, we developed a new Legendre Polynomials based Transformation (LPT of ST segment. Its basis functions have similar shapes to typical transient changes of ST segment morphology categories during myocardial ischaemia (level, slope and scooping, thus providing direct insight into the types of time domain morphology changes through the LPT feature-vector space. We also generated new Karhunen and Lo ève Transformation (KLT ST segment basis functions using a robust covariance matrix constructed from the ST segment pattern vectors derived from the Long Term ST Database (LTST DB. As for the delineation of significant transient ischaemic and non-ischaemic ST segment episodes, we present a study on the representation of transient ST segment morphology categories, and an evaluation study on the classification power of the KLT- and LPT-based feature vectors to classify between ischaemic and non-ischaemic ST segment episodes of the LTST DB. Classification accuracy using the KLT and LPT feature vectors was 90% and 82%, respectively, when using the k-Nearest Neighbors (k = 3 classifier and 10-fold cross-validation. New sets of feature-vector time series for both transformations were derived for the records of the LTST DB which is freely available on the PhysioNet website and were contributed to the LTST DB. The
International Nuclear Information System (INIS)
Hung, Shih-Yu; Shen, Ming-Ho; Chang, Ying-Pin
2009-01-01
The sequential neural-network approximation and orthogonal array (SNAOA) were used to shorten the cooling time for the rapid cooling process such that the normalized maximum resolved stress in silicon wafer was always below one in this study. An orthogonal array was first conducted to obtain the initial solution set. The initial solution set was treated as the initial training sample. Next, a back-propagation sequential neural network was trained to simulate the feasible domain to obtain the optimal parameter setting. The size of the training sample was greatly reduced due to the use of the orthogonal array. In addition, a restart strategy was also incorporated into the SNAOA so that the searching process may have a better opportunity to reach a near global optimum. In this work, we considered three different cooling control schemes during the rapid thermal process: (1) downward axial gas flow cooling scheme; (2) upward axial gas flow cooling scheme; (3) dual axial gas flow cooling scheme. Based on the maximum shear stress failure criterion, the other control factors such as flow rate, inlet diameter, outlet width, chamber height and chamber diameter were also examined with respect to cooling time. The results showed that the cooling time could be significantly reduced using the SNAOA approach
International Nuclear Information System (INIS)
Futatani, S.; Benkadda, S.; Del-Castillo-Negrete, D.
2009-01-01
The spatiotemporal multiscale dynamics of the turbulent transport of impurities is studied in the context of the collisional drift wave turbulence. Two turbulence regimes are considered: a quasihydrodynamic regime and a quasiadiabatic regime. The impurity is assumed to be a passive scalar advected by the corresponding ExB turbulent flow in the presence of diffusion. Two mixing scenarios are studied: a freely decaying case, and a forced case in which the scalar is forced by an externally imposed gradient. The results of the direct numerical simulations are analyzed using proper orthogonal decomposition (POD) techniques. The multiscale analysis is based on a space-time separable POD of the impurity field. The low rank spatial POD eigenfunctions capture the large scale coherent structures and the high rank eigenfunctions capture the small scale fluctuations. The temporal evolution at each scale is dictated by the corresponding temporal POD eigenfunctions. Contrary to the decaying case in which the POD spectrum decays fast, the spectrum in the forced case is relatively flat. The most striking difference between these two mixing scenarios is in the temporal dynamics of the small scale structures. In the decaying case the POD reveals the presence of 'bursty' dynamics in which successively small (high POD rank) scales are intermittently activated during the mixing process. On the other hand, in the forced simulations the temporal dynamics exhibits stationary fluctuations. Spatial intermittency or 'patchiness' in the mixing process characterizes the distribution of the passive tracer in the decaying quasihydrodynamic regime. In particular, in this case the probability distribution function of the low rank POD spatial reconstruction error is non-Gaussian. The spatiotemporal POD scales exhibit a diffusive-type scaling in the quasiadiabatic regime. However, this scaling seems to be absent in the quasihydrodynamic regime that shows no scaling (in the decaying case) or two
Energy Technology Data Exchange (ETDEWEB)
Barbaro, M. [ENEA, Centro Ricerche `Ezio Clementel`, Bologna (Italy). Dipt. Innovazione
1997-11-01
A numerical method is described which generates an orthogonal curvilinear mesh, subject to the constraint that mesh lines are matched to all boundaries of a closed, simply connected two-dimensional region of arbitrary shape. The method is based on the solution, by an iterative finite-difference technique, of an elliptic differential system of equations for the Cartesian coordinates of the orthogonal grid nodes. The interior grid distribution is controlled by a technique which ensures that coordinate lines can be concentrated as desired. Examples of orthogonal meshes inscribed in various geometrical figures are included.
An Orthogonal Multi-Swarm Cooperative PSO Algorithm with a Particle Trajectory Knowledge Base
Directory of Open Access Journals (Sweden)
Jun Yang
2017-01-01
Full Text Available A novel orthogonal multi-swarm cooperative particle swarm optimization (PSO algorithm with a particle trajectory knowledge base is presented in this paper. Different from the traditional PSO algorithms and other variants of PSO, the proposed orthogonal multi-swarm cooperative PSO algorithm not only introduces an orthogonal initialization mechanism and a particle trajectory knowledge base for multi-dimensional optimization problems, but also conceives a new adaptive cooperation mechanism to accomplish the information interaction among swarms and particles. Experiments are conducted on a set of benchmark functions, and the results show its better performance compared with traditional PSO algorithm in aspects of convergence, computational efficiency and avoiding premature convergence.
Intrinsic Regularization in a Lorentz invariant non-orthogonal Euclidean Space
Tornow, Carmen
2006-01-01
It is shown that the Lorentz transformations can be derived for a non-orthogonal Euclidean space. In this geometry one finds the same relations of special relativity as the ones known from the orthogonal Minkowski space. In order to illustrate the advantage of a non-orthogonal Euclidean metric the two-point Green’s function at x = 0 for a self-interacting scalar field is calculated. In contrast to the Minkowski space the one loop mass correction derived from this function gives a convergent r...
Shamsudin, F.; Midden, C.J.H.
2007-01-01
In this study, we explore whether people’s worldviews are orthogonal. An orthogonal structure of worldviews was found from two independent studies in multi-cultural communities to be affected by a coal power plant technology. The two-dimensional worldview orientations were in rectangular(orthogonal)
Colored Range Searching in Linear Space
DEFF Research Database (Denmark)
Grossi, Roberto; Vind, Søren Juhl
2014-01-01
In colored range searching, we are given a set of n colored points in d ≥ 2 dimensions to store, and want to support orthogonal range queries taking colors into account. In the colored range counting problem, a query must report the number of distinct colors found in the query range, while...... an answer to the colored range reporting problem must report the distinct colors in the query range. We give the first linear space data structure for both problems in two dimensions (d = 2) with o(n) worst case query time. We also give the first data structure obtaining almost-linear space usage and o...
International Nuclear Information System (INIS)
1975-01-01
Full text: The meeting was attended by 15 participants from seven countries and two international organizations. The Eighth Annual Meeting of the International Working Group on Fast Reactors (IWGFR) was attended by representatives from France, Fed. Rep. Germany, Italy, Japan, United Kingdom, Union of Soviet Socialist Republics and the United States of America - countries that have made significant progress in developing the technology and physics of sodium cooled fast reactors and have extensive national programmes in this field - as well as by representatives of the Commission of the European Communities and the IAEA. The design of fast-reactor power plants is a more difficult task than developing facilities with thermal reactors. Different reactor kinetics and dynamics, a hard neutron spectrum, larger integral doses of fuel and structural material irradiation, higher core temperatures, the use of an essentially novel coolant, and, as a result of all these factors, the additional reliability and safety requirements that are imposed on the planning and operation of sodium cooled fast reactors - all these factors pose problems that can be solved comprehensively only by countries with a high level of scientific and technical development. The exchange of experience between these countries and their combined efforts in solving the fundamental problems that arise in planning, constructing and operating fast reactors are promoting technical progress and reducing the relative expenditure required for various studies on developing and introducing commercial fast reactors. For this reason, the meeting concentrated on reviewing and discussing national fast reactor programmes. The situation with regard to planning, constructing and operating fast experimental and demonstration reactors in the countries concerned, the experience accumulated in operating them, the difficulties arising during operation and ways of over-coming them, the search for optimal designs for the power
Fatmaa El Zahraa Mohamed Abdou
2004-01-01
A general study about the internet search engines, the study deals main 7 points; the differance between search engines and search directories, components of search engines, the percentage of sites covered by search engines, cataloging of sites, the needed time for sites appearance in search engines, search capabilities, and types of search engines.
Orthogonal Cas9 proteins for RNA-guided gene regulation and editing
Church, George M.; Esvelt, Kevin; Mali, Prashant
2017-03-07
Methods of modulating expression of a target nucleic acid in a cell are provided including use of multiple orthogonal Cas9 proteins to simultaneously and independently regulate corresponding genes or simultaneously and independently edit corresponding genes.
Orthogonal rational functions on the unit circle: from the scalar to the matrix case.
Bultheel, A.; Gonzalez-Vera, P.; Hendriksen, E.; Njastad, O.
2006-01-01
Special functions and orthogonal polynomials in particular have been around for centuries. Can you imagine mathematics without trigonometric functions, the exponential function or polynomials? In the twentieth century the emphasis was on special functions satisfying linear differential equations,
Gerrard, Simon R.; Hardiman, Claire; Shelbourne, Montserrat; Nandhakumar, Iris; Nordé n, Bengt; Brown, Tom
2012-01-01
chemistry for the synthesis of dimeric, trimeric, and oligomeric modular DNA scaffolds from cyclic, double-stranded, 80-mer DNA nanoconstructs. This particular combination of orthogonal click reactions was more effective for nanoassembly than others explored
Spin nematic and orthogonal nematic states in S=1 non-Heisenberg magnet
International Nuclear Information System (INIS)
Fridman, Yu.A.; Kosmachev, O.A.; Klevets, Ph.N.
2013-01-01
Phases of S=1 non-Heisenberg magnet at various relationships between the exchange integrals are studied in the mean-field limit at zero temperature. It is shown that four phases can be realized in the system under consideration: the ferromagnetic, antiferromagnetic, nematic, and the orthogonal nematic states. The phase diagram is constructed. It is shown that the phase transitions between the ferromagnetic phase and the orthogonal nematic phase and between the antiferromagnetic phase and the orthogonal nematic phase are the degenerated first-order transitions. For the first time the spectra of elementary excitations in all phases are obtained within the mean-field limit. - Highlights: ► We investigated phases of S=1 non-Heisenberg magnet. ► Found four phases: ferromagnetic, antiferromagnetic, nematic, and orthogonal nematic. ► The phase diagram is determined. ► The spectra of elementary excitations are obtained in all phases for the first time.
Lindeboom, Jerome A.; Mathura, Keshen R.; Ince, Can
2006-01-01
Tumor microcirculatory characteristics until now have only been assessed by histological examination of biopsies or invasive imaging technique. The recent introduction of orthogonal polarization spectral (OPS) imaging as a new tool for in vivo visualization of human microcirculation makes it
On the 2-orthogonal polynomials and the generalized birth and death processes
Directory of Open Access Journals (Sweden)
Zerouki Ebtissem
2006-01-01
Full Text Available We discuss the connections between the 2-orthogonal polynomials and the generalized birth and death processes. Afterwards, we find the sufficient conditions to give an integral representation of the transition probabilities from these processes.
A Comparative Study for Orthogonal Subspace Projection and Constrained Energy Minimization
National Research Council Canada - National Science Library
Du, Qian; Ren, Hsuan; Chang, Chein-I
2003-01-01
...: orthogonal subspace projection (OSP) and constrained energy minimization (CEM). It is shown that they are closely related and essentially equivalent provided that the noise is white with large SNR...
Volume-of-fluid algorithm on a non-orthogonal grid
International Nuclear Information System (INIS)
Jang, W.; Lien, F.S.; Ji, H.
2005-01-01
In the present study, a novel VOF method on a non-orthogonal grid is proposed and tested for several benchmark problems, including a simple translation test, a reversed single vortex flow and a shearing flow, with the objective to demonstrate the feasibility and accuracy of the present approach. Excellent agreement between the solutions obtained on both orthogonal and non-orthogonal meshes is achieved. The sensitivity of various methods to the L 1 error in evaluating the interface normal and volume flux at each face of a non-orthogonal cell is examined. Time integration methods based on the operator-splitting approach in curvilinear coordinates, including the explicit-implicit (EX-IM) and explicit-explicit (EX-EX) combinations, are tested. (author)
van den Oever, Huub L. A.; Dzoljic, Misa; Ince, Can; Hollmann, Markus W.; Mokken, Fleur C.
2006-01-01
We used Orthogonal Polarization Spectral Imaging to examine the microcirculation of the vaginal mucosa in nine anesthetized patients during two consecutive anesthetic interventions: hypervolemic hemodilution using hydroxyethyl starch followed by thoracic epidural lidocaine. Images taken before and
Gap-filling meteorological variables with Empirical Orthogonal Functions
Graf, Alexander
2017-04-01
Gap-filling or modelling surface-atmosphere fluxes critically depends on an, ideally continuous, availability of their meteorological driver variables, such as e.g. air temperature, humidity, radiation, wind speed and precipitation. Unlike for eddy-covariance-based fluxes, data gaps are not unavoidable for these measurements. Nevertheless, missing or erroneous data can occur in practice due to instrument or power failures, disturbance, and temporary sensor or station dismounting for e.g. agricultural management or maintenance. If stations with similar measurements are available nearby, using their data for imputation (i.e. estimating missing data) either directly, after an elevation correction or via linear regression, is usually preferred over linear interpolation or monthly mean diurnal cycles. The popular implementation of regional networks of (partly low-cost) stations increases both, the need and the potential, for such neighbour-based imputation methods. For repeated satellite imagery, Beckers and Rixen (2003) suggested an imputation method based on empirical orthogonal functions (EOFs). While exploiting the same linear relations between time series at different observation points as regression, it is able to use information from all observation points to simultaneously estimate missing data at all observation points, provided that never all observations are missing at the same time. Briefly, the method uses the ability of the first few EOFs of a data matrix to reconstruct a noise-reduced version of this matrix; iterating missing data points from an initial guess (the column-wise averages) to an optimal version determined by cross-validation. The poster presents and discusses lessons learned from adapting and applying this methodology to station data. Several years of 10-minute averages of air temperature, pressure and humidity, incoming shortwave, longwave and photosynthetically active radiation, wind speed and precipitation, measured by a regional (70 km by
Orthogonal translation components for the in vivo incorporation of unnatural amino acids
Schultz, Peter G.; Xie, Jianming; Zeng, Huaqiang
2012-07-10
The invention relates to orthogonal pairs of tRNAs and aminoacyl-tRNA synthetases that can incorporate unnatural amino acids into proteins produced in eubacterial host cells such as E. coli, or in a eukaryotic host such as a yeast cell. The invention provides, for example but not limited to, novel orthogonal synthetases, methods for identifying and making the novel synthetases, methods for producing proteins containing unnatural amino acids, and translation systems.
Performance of an Orthogonal Multicarrier CDMA System in a Multicell/Multipath Environment
Energy Technology Data Exchange (ETDEWEB)
Yoon, W.S. [Ajou University, Suwon (Korea)
1999-08-01
We have considered an improved orthogonal multicarrier (MC) CDMA system. This system combines the advantages of both DS-CDMA with a concatenated spreading scheme and an MC modulation technique to combat the effects of a multipath fading channel and intersymbol interference (IS). The performance of the system is analyzed under a multicell, multiuser, and multipath Rician fading channel. The system is shown to outperform the orthogonal MC-CDMA system with a conventional PN sequence. (author). 4 refs., 3 figs.
Image compression based on orthogonal balanced multiwavelets with symmetry/antisymmetry
Zhang, Liping; Zhao, Yi
2018-03-01
Multiwavelets have orthogonality, compacted support and symmetry simultaneously, these properties are very important for signal processing. However, most of Multiwavelets require related prefilters. An approach to construction of symmetry/antisymmetry orthogonal filter is proposed and its corresponding balanced filter is constructed, no any prefilter is necessary. Experimental results prove its performance is superior to DGHM and CL multiwavelets, higher than Bi9/7.
Amplitude Noise Suppression and Orthogonal Multiplexing Using Injection-Locked Single-Mode VCSEL
DEFF Research Database (Denmark)
Lyubopytov, Vladimir; von Lerber, Tuomo; Lassas, Matti
2017-01-01
We experimentally demonstrate BER reduction and orthogonal modulation using an injection locked single-mode VCSEL. It allows us suppressing an amplitude noise of optical signal and/or double the capacity of an information channel.......We experimentally demonstrate BER reduction and orthogonal modulation using an injection locked single-mode VCSEL. It allows us suppressing an amplitude noise of optical signal and/or double the capacity of an information channel....
On Linear Combinations of Two Orthogonal Polynomial Sequences on the Unit Circle
Directory of Open Access Journals (Sweden)
Suárez C
2010-01-01
Full Text Available Let be a monic orthogonal polynomial sequence on the unit circle. We define recursively a new sequence of polynomials by the following linear combination: , , . In this paper, we give necessary and sufficient conditions in order to make be an orthogonal polynomial sequence too. Moreover, we obtain an explicit representation for the Verblunsky coefficients and in terms of and . Finally, we show the relation between their corresponding Carathéodory functions and their associated linear functionals.
International Nuclear Information System (INIS)
Yahiaoui, S.-A.; Bentaiba, M.
2011-01-01
We present a method for obtaining the quasi-exact solutions of the Rabi Hamiltonian in the framework of the asymptotic iteration method (AIM). The energy eigenvalues, the eigenfunctions and the associated Bender-Dunne orthogonal polynomials are deduced. We show (i) that orthogonal polynomials are generated from the upper limit (i.e., truncation limit) of polynomial solutions deduced from AIM, and (ii) prove to have nonpositive norm. (authors)
Orthogonal Multi-Carrier DS-CDMA with Frequency-Domain Equalization
Tanaka, Ken; Tomeba, Hiromichi; Adachi, Fumiyuki
Orthogonal multi-carrier direct sequence code division multiple access (orthogonal MC DS-CDMA) is a combination of orthogonal frequency division multiplexing (OFDM) and time-domain spreading, while multi-carrier code division multiple access (MC-CDMA) is a combination of OFDM and frequency-domain spreading. In MC-CDMA, a good bit error rate (BER) performance can be achieved by using frequency-domain equalization (FDE), since the frequency diversity gain is obtained. On the other hand, the conventional orthogonal MC DS-CDMA fails to achieve any frequency diversity gain. In this paper, we propose a new orthogonal MC DS-CDMA that can obtain the frequency diversity gain by applying FDE. The conditional BER analysis is presented. The theoretical average BER performance in a frequency-selective Rayleigh fading channel is evaluated by the Monte-Carlo numerical computation method using the derived conditional BER and is confirmed by computer simulation of the orthogonal MC DS-CDMA signal transmission.
Directory of Open Access Journals (Sweden)
Moret Nicola
2010-01-01
Full Text Available Abstract We address the efficient realization of a filtered multitone (FMT modulation system and its orthogonal design. FMT modulation can be viewed as a Discrete Fourier Transform (DFT modulated filter bank (FB. It generalizes the popular orthogonal frequency division multiplexing (OFDM scheme by deploying frequency confined subchannel pulses. We compare three realizations that have been described by Cvetković and Vetterli (1998, and Weiss and Stewart (2000, and Tonello (2006. A detailed derivation of them is performed in the time-domain via the exploitation of different FB polyphase decompositions. We then consider the design of an orthogonal FMT system and we exploit the third realization which allows simplifying the orthogonal FB design and obtaining a block diagonal system matrix with independent subblocks. A numerical method is then presented to obtain an orthogonal FB with well frequency confined subchannel pulses for arbitrarily large number of subchannels. Several examples of pulses with minimal length are reported and their performance is evaluated in typical multipath fading channels. Finally, we compare the orthogonal FMT system with a cyclically prefixed OFDM system in the IEEE 802.11 wireless LAN channel. In this scenario, FMT with minimal length pulses and single tap subchannel equalization outperforms the OFDM system in achievable rate.
Directory of Open Access Journals (Sweden)
Andrea M. Tonello
2010-01-01
Full Text Available We address the efficient realization of a filtered multitone (FMT modulation system and its orthogonal design. FMT modulation can be viewed as a Discrete Fourier Transform (DFT modulated filter bank (FB. It generalizes the popular orthogonal frequency division multiplexing (OFDM scheme by deploying frequency confined subchannel pulses. We compare three realizations that have been described by Cvetković and Vetterli (1998, and Weiss and Stewart (2000, and Tonello (2006. A detailed derivation of them is performed in the time-domain via the exploitation of different FB polyphase decompositions. We then consider the design of an orthogonal FMT system and we exploit the third realization which allows simplifying the orthogonal FB design and obtaining a block diagonal system matrix with independent subblocks. A numerical method is then presented to obtain an orthogonal FB with well frequency confined subchannel pulses for arbitrarily large number of subchannels. Several examples of pulses with minimal length are reported and their performance is evaluated in typical multipath fading channels. Finally, we compare the orthogonal FMT system with a cyclically prefixed OFDM system in the IEEE 802.11 wireless LAN channel. In this scenario, FMT with minimal length pulses and single tap subchannel equalization outperforms the OFDM system in achievable rate.
Moret, Nicola; Tonello, Andrea M.
2010-12-01
We address the efficient realization of a filtered multitone (FMT) modulation system and its orthogonal design. FMT modulation can be viewed as a Discrete Fourier Transform (DFT) modulated filter bank (FB). It generalizes the popular orthogonal frequency division multiplexing (OFDM) scheme by deploying frequency confined subchannel pulses. We compare three realizations that have been described by Cvetković and Vetterli (1998), and Weiss and Stewart (2000), and Tonello (2006). A detailed derivation of them is performed in the time-domain via the exploitation of different FB polyphase decompositions. We then consider the design of an orthogonal FMT system and we exploit the third realization which allows simplifying the orthogonal FB design and obtaining a block diagonal system matrix with independent subblocks. A numerical method is then presented to obtain an orthogonal FB with well frequency confined subchannel pulses for arbitrarily large number of subchannels. Several examples of pulses with minimal length are reported and their performance is evaluated in typical multipath fading channels. Finally, we compare the orthogonal FMT system with a cyclically prefixed OFDM system in the IEEE 802.11 wireless LAN channel. In this scenario, FMT with minimal length pulses and single tap subchannel equalization outperforms the OFDM system in achievable rate.
Fast Convolution Module (Fast Convolution Module)
National Research Council Canada - National Science Library
Bierens, L
1997-01-01
This report describes the design and realisation of a real-time range azimuth compression module, the so-called 'Fast Convolution Module', based on the fast convolution algorithm developed at TNO-FEL...
FAST: FAST Analysis of Sequences Toolbox
Directory of Open Access Journals (Sweden)
Travis J. Lawrence
2015-05-01
Full Text Available FAST (FAST Analysis of Sequences Toolbox provides simple, powerful open source command-line tools to filter, transform, annotate and analyze biological sequence data. Modeled after the GNU (GNU’s Not Unix Textutils such as grep, cut, and tr, FAST tools such as fasgrep, fascut, and fastr make it easy to rapidly prototype expressive bioinformatic workflows in a compact and generic command vocabulary. Compact combinatorial encoding of data workflows with FAST commands can simplify the documentation and reproducibility of bioinformatic protocols, supporting better transparency in biological data science. Interface self-consistency and conformity with conventions of GNU, Matlab, Perl, BioPerl, R and GenBank help make FAST easy and rewarding to learn. FAST automates numerical, taxonomic, and text-based sorting, selection and transformation of sequence records and alignment sites based on content, index ranges, descriptive tags, annotated features, and in-line calculated analytics, including composition and codon usage. Automated content- and feature-based extraction of sites and support for molecular population genetic statistics makes FAST useful for molecular evolutionary analysis. FAST is portable, easy to install and secure thanks to the relative maturity of its Perl and BioPerl foundations, with stable releases posted to CPAN. Development as well as a publicly accessible Cookbook and Wiki are available on the FAST GitHub repository at https://github.com/tlawrence3/FAST. The default data exchange format in FAST is Multi-FastA (specifically, a restriction of BioPerl FastA format. Sanger and Illumina 1.8+ FastQ formatted files are also supported. FAST makes it easier for non-programmer biologists to interactively investigate and control biological data at the speed of thought.
Orthogonal stack of global tide gauge sea level data
Trupin, A.; Wahr, J.
1990-01-01
Yearly and monthly tide gauge sea level data from around the globe are fitted to numerically generated equilibrium tidal data to search for the 18.6 year lunar tide and 14 month pole tide. Both tides are clearly evident in the results, and their amplitudes and phases are found to be consistent with a global equilibrium response. Global, monthly sea level data from outside the Baltic sea and Gulf of Bothnia are fitted to global atmospheric pressure data to study the response of the ocean to pressure fluctuations. The response is found to be inverted barometer at periods greater than two months. Global averages of tide gauge data, after correcting for the effects of post glacial rebound on individual station records, reveal an increase in sea level over the last 80 years of between 1.1 mm/yr and 1.9 mm/yr.
Impact of intermittent fasting on glucose homeostasis.
Varady, Krista A
2016-07-01
This article provides an overview of the most recent human trials that have examined the impact of intermittent fasting on glucose homeostasis. Our literature search retrieved one human trial of alternate day fasting, and three trials of Ramadan fasting published in the past 12 months. Current evidence suggests that 8 weeks of alternate day fasting that produces mild weight loss (4% from baseline) has no effect on glucose homeostasis. As for Ramadan fasting, decreases in fasting glucose, insulin, and insulin resistance have been noted after 4 weeks in healthy normal weight individuals with mild weight loss (1-2% from baseline). However, Ramadan fasting may have little impact on glucoregulatory parameters in women with polycystic ovarian syndrome who failed to observe weight loss. Whether intermittent fasting is an effective means of regulating glucose homeostasis remains unclear because of the scarcity of studies in this area. Large-scale, longer-term randomized controlled trials will be required before the use of fasting can be recommended for the prevention and treatment of metabolic diseases.
Directory of Open Access Journals (Sweden)
Masjed-Jamei Mohammad
2005-01-01
Full Text Available From the main equation ( a x 2 +bx+c y ″ n ( x +( dx+e y ′ n ( x −n( ( n−1 a+d y n ( x =0 , n∈ ℤ + , six finite and infinite classes of orthogonal polynomials can be extracted. In this work, first we have a survey on these classes, particularly on finite classes, and their corresponding rational orthogonal polynomials, which are generated by Mobius transform x=p z −1 +q , p≠0 , q∈ℝ . Some new integral relations are also given in this section for the Jacobi, Laguerre, and Bessel orthogonal polynomials. Then we show that the rational orthogonal polynomials can be a very suitable tool to compute the inverse Laplace transform directly, with no additional calculation for finding their roots. In this way, by applying infinite and finite rational classical orthogonal polynomials, we give three basic expansions of six ones as a sample for computation of inverse Laplace transform.
Savic, Dobrica
2014-01-01
Libraries are facing many challenges today. In addition to diminishing funding and increased user expectations, the use of classic library catalogues is becoming an additional challenge. Library users require fast and easy access to information resources regardless whether the format used is paper or electronic. Google search, with its speed and simplicity, set up a new standard for information retrieval which is hard to achieve with the previous generation of library search facilities. Put i...
Garman, Nancy
1999-01-01
Describes common options and features to consider in evaluating which meta search engine will best meet a searcher's needs. Discusses number and names of engines searched; other sources and specialty engines; search queries; other search options; and results options. (AEF)
Practical fulltext search in medical records
Directory of Open Access Journals (Sweden)
Vít Volšička
2015-09-01
Full Text Available Performing a search through previously existing documents, including medical reports, is an integral part of acquiring new information and educational processes. Unfortunately, finding relevant information is not always easy, since many documents are saved in free text formats, thereby making it difficult to search through them. A full-text search is a viable solution for searching through documents. The full-text search makes it possible to efficiently search through large numbers of documents and to find those that contain specific search phrases in a short time. All leading database systems currently offer full-text search, but some do not support the complex morphology of the Czech language. Apache Solr provides full support options and some full-text libraries. This programme provides the good support of the Czech language in the basic installation, and a wide range of settings and options for its deployment over any platform. The library had been satisfactorily tested using real data from the hospitals. Solr provided useful, fast, and accurate searches. However, there is still a need to make adjustments in order to receive effective search results, particularly by correcting typographical errors made not only in the text, but also when entering words in the search box and creating a list of frequently used abbreviations and synonyms for more accurate results.
Circular parameters of polynomials orthogonal on several arcs of the unit circle
International Nuclear Information System (INIS)
Lukashov, A L
2004-01-01
The asymptotic behaviour of the circular parameters (a n ) of the polynomials orthogonal on the unit circle with respect to Geronimus measures is analysed. It is shown that only when the harmonic measures of the arcs making up the support of the orthogonality measure are rational do the corresponding parameters form a pseudoperiodic sequence starting from some index (that is, after a suitable rotation of the circle and the corresponding modification of the orthogonality measures they form a periodic sequence). In addition it is demonstrated that if the harmonic measures of these arcs are linearly independent over the field of rational numbers, then the sets of limit points of the sequences of absolute values of the circular parameters |a n | and of their ratios (a n+k /a n ) n=1 ∞ are a closed interval on the real line and a continuum in the complex plane, respectively.
Directory of Open Access Journals (Sweden)
Monika GARG
2012-08-01
Full Text Available In this paper, an integrated approach is proposed for non-recursive formulation of connection coefficients of different orthogonal functions in terms of a generic orthogonal function. The application of these coefficients arises when the product of two orthogonal basis functions are to be expressed in terms of single basis functions. Two significant advantages are achieved; one, the non-recursive formulations avoid memory and stack overflows in computer implementations; two, the integrated approach provides for digital hardware once-designed can be used for different functions. Computational savings achieved with the proposed non-recursive formulation vis-à-vis recursive formulation, reported in the literature so far, have been demonstrated using MATLAB PROFILER.
Bi-orthogonality conditions for power flow analysis in fluid-loaded elastic cylindrical shells
DEFF Research Database (Denmark)
Ledet, Lasse; Sorokin, Sergey V.; Larsen, Jan Balle
2015-01-01
The paper addresses the classical problem of time-harmonic forced vibrations of a fluid-loaded cylindrical shell considered as a multi-modal waveguide carrying infinitely many waves. Firstly, a modal method for formulation of Green’s matrix is derived by means of modal decomposition. The method...... builds on the recent advances on bi-orthogonality conditions for multi-modal waveguides, which are derived here for an elastic fluid-filled cylindrical shell. Subsequently, modal decomposition is applied to the bi-orthogonality conditions to formulate explicit algebraic equations to express the modal...... vibro-acoustic waveguide is subjected to separate pressure and velocity acoustical excitations. Further, it has been found and justified that the bi-orthogonality conditions can be used as a ’root finder’ to solve the dispersion equation. Finally, it is discussed how to predict the response of a fluid...
Designing Uniquely Addressable Bio-orthogonal Synthetic Scaffolds for DNA and RNA Origami.
Kozyra, Jerzy; Ceccarelli, Alessandro; Torelli, Emanuela; Lopiccolo, Annunziata; Gu, Jing-Ying; Fellermann, Harold; Stimming, Ulrich; Krasnogor, Natalio
2017-07-21
Nanotechnology and synthetic biology are rapidly converging, with DNA origami being one of the leading bridging technologies. DNA origami was shown to work well in a wide array of biotic environments. However, the large majority of extant DNA origami scaffolds utilize bacteriophages or plasmid sequences thus severely limiting its future applicability as a bio-orthogonal nanotechnology platform. In this paper we present the design of biologically inert (i.e., "bio-orthogonal") origami scaffolds. The synthetic scaffolds have the additional advantage of being uniquely addressable (unlike biologically derived ones) and hence are better optimized for high-yield folding. We demonstrate our fully synthetic scaffold design with both DNA and RNA origamis and describe a protocol to produce these bio-orthogonal and uniquely addressable origami scaffolds.
Dual comb generation from a mode-locked fiber laser with orthogonally polarized interlaced pulses.
Akosman, Ahmet E; Sander, Michelle Y
2017-08-07
Ultra-high precision dual-comb spectroscopy traditionally requires two mode-locked, fully stabilized lasers with complex feedback electronics. We present a novel mode-locked operation regime in a thulium-holmium co-doped fiber laser, a frequency-halved state with orthogonally polarized interlaced pulses, for dual comb generation from a single source. In a linear fiber laser cavity, an ultrafast pulse train composed of co-generated, equal intensity and orthogonally polarized consecutive pulses at half of the fundamental repetition rate is demonstrated based on vector solitons. Upon optical interference of the orthogonally polarized pulse trains, two stable microwave RF beat combs are formed, effectively down-converting the optical properties into the microwave regime. These co-generated, dual polarization interlaced pulse trains, from one all-fiber laser configuration with common mode suppression, thus provide an attractive compact source for dual-comb spectroscopy, optical metrology and polarization entanglement measurements.
A square-plate ultrasonic linear motor operating in two orthogonal first bending modes.
Chen, Zhijiang; Li, Xiaotian; Chen, Jianguo; Dong, Shuxiang
2013-01-01
A novel square-plate piezoelectric ultrasonic linear motor operated in two orthogonal first bending vibration modes (B₁) is proposed. The piezoelectric vibrator of the linear motor is simply made of a single PZT ceramic plate (sizes: 15 x 15 x 2 mm) and poled in its thickness direction. The top surface electrode of the square ceramic plate was divided into four active areas along its two diagonal lines for exciting two orthogonal B₁ modes. The achieved driving force and speed from the linear motor are 1.8 N and 230 mm/s, respectively, under one pair orthogonal voltage drive of 150 V(p-p) at the resonance frequency of 92 kHz. The proposed linear motor has advantages over conventional ultrasonic linear motors, such as relatively larger driving force, very simple working mode and structure, and low fabrication cost.
Gerrard, Simon R.
2012-10-23
Thermodynamic instability is a problem when assembling and purifying complex DNA nanostructures formed by hybridization alone. To address this issue, we have used photochemical fixation and orthogonal copper-free, ring-strain-promoted, click chemistry for the synthesis of dimeric, trimeric, and oligomeric modular DNA scaffolds from cyclic, double-stranded, 80-mer DNA nanoconstructs. This particular combination of orthogonal click reactions was more effective for nanoassembly than others explored. The complex nanostructures are stable to heat and denaturation agents and can therefore be purified and characterized. They are addressable in a sequence-specific manner by triplex formation, and they can be reversibly and selectively deconstructed. Nanostructures utilizing this orthogonal, chemical fixation methodology can be used as building blocks for nanomachines and functional DNA nanoarchitectures. © 2012 American Chemical Society.
The advantages of orthogonal acceleration in ICP time-of-flight mass spectrometry
International Nuclear Information System (INIS)
Gaal, Andrew
2004-01-01
The OptiMass 8000 incorporates an orthogonal acceleration time-of-flight mass spectrometer. A general schematic of the instrument is given. The continuous ion beam is chopped by an orthogonal accelerator. A push out pulse supply is coupled to the accelerator for providing repetitive push-out voltages at a frequency of 30 kHz. The ion packets that are sliced out of the beam then travel within the field free space towards the SMARTGATE ion blanker. Orthogonal accelerator parameters are set to enable temporal-spatial focusing at the SMARTGATE ion blanker, so that iso-mass ion packets are resolved in time. Any ion packets of unwanted specie are ejected from the direction of travel by supplying pulsed voltages onto the deflection plates of the SMARTGATE. The ions to be measured are let through SMARTGATE and travel further down the field free space, to enter the ion reflectron. The ion reflectron increases the resolution of the mass spectrometer by means of temporal-energy focussing. After reflection, the ions travel within the field free space towards the discrete-dynode detector. In comparison to other acceleration geometries used in elemental time-of-flight mass spectrometry the OptiMass 8000 orthogonal acceleration geometry ultimately leads to superior resolution. As the energy spread is about 3 orders of magnitude lower in the time-of-flight direction for an oaTOFMS in comparison to an on-axis system, aberration acquired in the initial stages of acceleration are much lower. As a result the orthogonal acceleration scheme provides superior resolution at the first spatial focus point and the detector. The orthogonal acceleration time-of-flight analyzer of the OptiMass 8000 is able to provide resolution of at least 1800 at mass 238. (author)
Energy Technology Data Exchange (ETDEWEB)
Starke, G. [Universitaet Karlsruhe (Germany)
1994-12-31
For nonselfadjoint elliptic boundary value problems which are preconditioned by a substructuring method, i.e., nonoverlapping domain decomposition, the author introduces and studies the concept of subspace orthogonalization. In subspace orthogonalization variants of Krylov methods the computation of inner products and vector updates, and the storage of basis elements is restricted to a (presumably small) subspace, in this case the edge and vertex unknowns with respect to the partitioning into subdomains. The author investigates subspace orthogonalization for two specific iterative algorithms, GMRES and the full orthogonalization method (FOM). This is intended to eliminate certain drawbacks of the Arnoldi-based Krylov subspace methods mentioned above. Above all, the length of the Arnoldi recurrences grows linearly with the iteration index which is therefore restricted to the number of basis elements that can be held in memory. Restarts become necessary and this often results in much slower convergence. The subspace orthogonalization methods, in contrast, require the storage of only the edge and vertex unknowns of each basis element which means that one can iterate much longer before restarts become necessary. Moreover, the computation of inner products is also restricted to the edge and vertex points which avoids the disturbance of the computational flow associated with the solution of subdomain problems. The author views subspace orthogonalization as an alternative to restarting or truncating Krylov subspace methods for nonsymmetric linear systems of equations. Instead of shortening the recurrences, one restricts them to a subset of the unknowns which has to be carefully chosen in order to be able to extend this partial solution to the entire space. The author discusses the convergence properties of these iteration schemes and its advantages compared to restarted or truncated versions of Krylov methods applied to the full preconditioned system.
Fasting and rheumatic diseases
Mohammad Hassan Jokar
2015-01-01
Fasting is one of the important religious practices of Muslims, in which the individuals abstain from eating and drinking from dawn to sunset. Fasting is not obligatory or even not allowed, in case it causes health problems to the fasting individual. Rheumatic diseases are a major group of chronic diseases which can bring about numerous problems while fasting. The aim of this article is to review the impact of Islamic fasting on rheumatic patients, based on the scientific evidences.
Islam, Muhammad F.; Islam, Mohammed N.
2012-04-01
The objective of this paper is to develop a novel approach for encryption and compression of biometric information utilizing orthogonal coding and steganography techniques. Multiple biometric signatures are encrypted individually using orthogonal codes and then multiplexed together to form a single image, which is then embedded in a cover image using the proposed steganography technique. The proposed technique employs three least significant bits for this purpose and a secret key is developed to choose one from among these bits to be replaced by the corresponding bit of the biometric image. The proposed technique offers secure transmission of multiple biometric signatures in an identification document which will be protected from unauthorized steganalysis attempt.
Directory of Open Access Journals (Sweden)
Iman Yousefi
2015-01-01
Full Text Available This paper presents parameter estimation of Permanent Magnet Synchronous Motor (PMSM using a combinatorial algorithm. Nonlinear fourth-order space state model of PMSM is selected. This model is rewritten to the linear regression form without linearization. Noise is imposed to the system in order to provide a real condition, and then combinatorial Orthogonal Projection Algorithm and Recursive Least Squares (OPA&RLS method is applied in the linear regression form to the system. Results of this method are compared to the Orthogonal Projection Algorithm (OPA and Recursive Least Squares (RLS methods to validate the feasibility of the proposed method. Simulation results validate the efficacy of the proposed algorithm.
International Nuclear Information System (INIS)
Li Shun; Zhang Sijiong
2014-01-01
A numerical model is presented to simulate the influence function of deformable mirror actuators. The numerical model is formed by Bessel Fourier orthogonal functions, which are constituted of Bessel orthogonal functions and a Fourier basis. A detailed comparison is presented between the new Bessel Fourier model, the Zernike model, the Gaussian influence function and the modified Gaussian influence function. Numerical experiments indicate that the new numerical model is easy to use and more accurate compared with other numerical models. The new numerical model can be used for describing deformable mirror performances and numerical simulations of adaptive optics systems. (research papers)
Reduction of snapshots for MIMO radar detection by block/group orthogonal matching pursuit
Ali, Hussain El Hosiny
2014-10-01
Multiple-input multiple-output (MIMO) radar works on the principle of transmission of independent waveforms at each element of its antenna array and is widely used for surveillance purposes. In this work, we investigate MIMO radar target localization problem with compressive sensing. Specifically, we try to solve the problem of estimation of target location in MIMO radar by group and block sparsity algorithms. It will lead us to a reduced number of snapshots required and also we can achieve better radar resolution. We will use group orthogonal matching pursuit (GOMP) and block orthogonal matching pursuit (BOMP) for our problem. © 2014 IEEE.
The Role of Orthogonal Polynomials in Tailoring Spherical Distributions to Kurtosis Requirements
Directory of Open Access Journals (Sweden)
Luca Bagnato
2016-08-01
Full Text Available This paper carries out an investigation of the orthogonal-polynomial approach to reshaping symmetric distributions to fit in with data requirements so as to cover the multivariate case. With this objective in mind, reference is made to the class of spherical distributions, given that they provide a natural multivariate generalization of univariate even densities. After showing how to tailor a spherical distribution via orthogonal polynomials to better comply with kurtosis requirements, we provide operational conditions for the positiveness of the resulting multivariate Gram–Charlier-like expansion, together with its kurtosis range. Finally, the approach proposed here is applied to some selected spherical distributions.
Zeros and logarithmic asymptotics of Sobolev orthogonal polynomials for exponential weights
Díaz Mendoza, C.; Orive, R.; Pijeira Cabrera, H.
2009-12-01
We obtain the (contracted) weak zero asymptotics for orthogonal polynomials with respect to Sobolev inner products with exponential weights in the real semiaxis, of the form , with [gamma]>0, which include as particular cases the counterparts of the so-called Freud (i.e., when [phi] has a polynomial growth at infinity) and Erdös (when [phi] grows faster than any polynomial at infinity) weights. In addition, the boundness of the distance of the zeros of these Sobolev orthogonal polynomials to the convex hull of the support and, as a consequence, a result on logarithmic asymptotics are derived.
Face Hallucination with Linear Regression Model in Semi-Orthogonal Multilinear PCA Method
Asavaskulkiet, Krissada
2018-04-01
In this paper, we propose a new face hallucination technique, face images reconstruction in HSV color space with a semi-orthogonal multilinear principal component analysis method. This novel hallucination technique can perform directly from tensors via tensor-to-vector projection by imposing the orthogonality constraint in only one mode. In our experiments, we use facial images from FERET database to test our hallucination approach which is demonstrated by extensive experiments with high-quality hallucinated color faces. The experimental results assure clearly demonstrated that we can generate photorealistic color face images by using the SO-MPCA subspace with a linear regression model.
Modal analysis of fluid flows using variants of proper orthogonal decomposition
Rowley, Clarence; Dawson, Scott
2017-11-01
This talk gives an overview of several methods for analyzing fluid flows, based on variants of proper orthogonal decomposition. These methods may be used to determine simplified, approximate models that capture the essential features of these flows, in order to better understand the dominant physical mechanisms, and potentially to develop appropriate strategies for model-based flow control. We discuss balanced proper orthogonal decomposition as an approximation of balanced truncation, and explain connections with system identification methods such as the eigensystem realization algorithm. We demonstrate the methods on several canonical examples, including a linearized channel flow and the flow past a circular cylinder. Supported by AFOSR, Grant FA9550-14-1-0289.
TORE SUPRA fast reciprocating radio frequency probe
International Nuclear Information System (INIS)
Thomas, C.E. Jr.; Harris, J.H.; Haste, G.R.; Kwon, M.; Goulding, R.H.; Hoffman, D.J.; Saoutic, B.; Becoulet, A.; Fraboulet, D.; Beaumont, B.; Kuus, H.; Ladurelle, L.; Pascal, J.Y.
1995-01-01
A fast reciprocating ion cyclotron range of frequencies (ICRF) probe was installed and operated on TORE SUPRA during 1992/1993. The body of the probe was originally used on the ATF experiment at Oak Ridge National Laboratory. The probe was adapted for use on TORE SUPRA, and mounted on one of the two fast reciprocating probe mounts. The probe consists of two orthogonal single-turn wire loops, mounted so that one loop senses toroidal rf magnetic fields and the other senses poloidal rf magnetic fields. The probe began operation in June, 1993. The probe active area is approximately 5 cm long by 2 cm, and the reciprocating mount has a slow stroke (5 cm/s) of 30 cm and a fast stroke (1.5 m/s) of about 10 cm. The probe was operated at distances from the plasma edge ranging from 30 to -5 cm (i.e., inside the last closed flux surface). The probe design, electronics, calibration, data acquisition, and data processing are discussed. First data from the probe are presented as a function of ICRF power, distance from the plasma, loop orientation, and other plasma parameters. Initial data show parametric instabilities do not play an important role for ICRF in the TORE SUPRA edge and scrape-off-layer (SOL) plasmas. Additionally it is observed that the probe signal has little or no dependence on position in the SOL/plasma edge
Fasting abbreviation among patients submitted to oncologic surgery: systematic review
PINTO, Andressa dos Santos; GRIGOLETTI, Shana Souza; MARCADENTI, Aline
2015-01-01
INTRODUCTION: The abbreviation of perioperative fasting among candidates to elective surgery have been associated with shorter hospital stay and decreased postoperative complications. OBJECTIVE: To conduct a systematic review from randomized controlled trials to detect whether the abbreviation of fasting is beneficial to patients undergoing cancer surgery compared to traditional fasting protocols. METHOD: A literature search was performed in electronic databases: MEDLINE (PubMed), SciELO...
Improving PHENIX search with Solr, Nutch and Drupal
International Nuclear Information System (INIS)
Morrison, Dave; Sourikova, Irina
2012-01-01
During its 20 years of R and D, construction and operation the PHENIX experiment at the Relativistic Heavy Ion Collider (RHIC) has accumulated large amounts of proprietary collaboration data that is hosted on many servers around the world and is not open for commercial search engines for indexing and searching. The legacy search infrastructure did not scale well with the fast growing PHENIX document base and produced results inadequate in both precision and recall. After considering the possible alternatives that would provide an aggregated, fast, full text search of a variety of data sources and file formats we decided to use Nutch [1] as a web crawler and Solr [2] as a search engine. To present XML-based Solr search results in a user-friendly format we use Drupal [3] as a web interface to Solr. We describe the experience of building a federated search for a heterogeneous collection of 10 million PHENIX documents with Nutch, Solr and Drupal.
Improving PHENIX search with Solr, Nutch and Drupal.
Morrison, Dave; Sourikova, Irina
2012-12-01
During its 20 years of R&D, construction and operation the PHENIX experiment at the Relativistic Heavy Ion Collider (RHIC) has accumulated large amounts of proprietary collaboration data that is hosted on many servers around the world and is not open for commercial search engines for indexing and searching. The legacy search infrastructure did not scale well with the fast growing PHENIX document base and produced results inadequate in both precision and recall. After considering the possible alternatives that would provide an aggregated, fast, full text search of a variety of data sources and file formats we decided to use Nutch [1] as a web crawler and Solr [2] as a search engine. To present XML-based Solr search results in a user-friendly format we use Drupal [3] as a web interface to Solr. We describe the experience of building a federated search for a heterogeneous collection of 10 million PHENIX documents with Nutch, Solr and Drupal.
Directory of Open Access Journals (Sweden)
Tim eAppelhans
2016-02-01
Full Text Available East Africa is characterized by a rather dry annual precipitation climatology with two distinct rainy seasons. In order to investigate sea surface temperature driven precipitation anomalies for the region we use the algorithm of empirical orthogonal teleconnection analysis as a data mining tool. We investigate the entire East African domain as well as 5 smaller sub-regions mainly located in areas of mountainous terrain. In searching for influential sea surface temperature patterns we do not focus any particular season or oceanic region. Furthermore, we investigate different time lags from zero to twelve months. The strongest influence is identified for the immediate (i.e. non-lagged influences of the Indian Ocean in close vicinity to the East African coast. None of the most important modes are located in the tropical Pacific Ocean, though the region is sometimes coupled with the Indian Ocean basin. Furthermore, we identify a region in the southern Indian Ocean around the Kerguelen Plateau which has not yet been reported in the literature with regard to precipitation modulation in East Africa. Finally, it is observed that not all regions in East Africa are equally influenced by the identified patterns.
Orthogonal polynomials on $R^+$ and birth-death processes with killing
Coolen-Schrijner, Pauline; Coolen-Schrijner, Pauline; van Doorn, Erik A.; Elaydi, S.; Cushing, J.; Lasser, R.; Ruffing, A.; Papageorgiou, V.; Van Assche, W.
2007-01-01
The purpose of this paper is to extend some results of Karlin and McGregor's and Chihara's concerning the three-terms recurrence relation for polynomials orthogonal with respect to a measure on the nonnegative real axis. Our findings are relevant for the analysis of a type of Markov chains known as
DEFF Research Database (Denmark)
Kreft, Stefanie K.; Petersen, Michael Åxman; Nielsen, Mogens Brøndsted
2015-01-01
We study the effects of the proximity of the orthogonal dipole-switching moiety dihydroazulene/vinylheptafulvene (DHA/VHF) to carbon nanotubes (CNTs). The switches are introduced into a micelle surrounding the CNTs, thereby achieving very close proximity between the molecules and the CNTs...... of the CNTs and the resulting reversible redshift of the nanotubes' emission by the change of the molecules' conformation....
A direct method for the synthesis of orthogonally protected furyl- and thienyl- amino acids.
Hudson, Alex S; Caron, Laurent; Colgin, Neil; Cobb, Steven L
2015-04-01
The synthesis of unnatural amino acids plays a key part in expanding the potential application of peptide-based drugs and in the total synthesis of peptide natural products. Herein, we report a direct method for the synthesis of orthogonally protected 5-membered heteroaromatic amino acids.
G-matrices, J-orthogonal Matrices, and Their Sign Patterns
Czech Academy of Sciences Publication Activity Database
Fiedler, Miroslav; Hall, F.J.; Rozložník, Miroslav
-, subm. 2015 (2018) ISSN 0024-3795 R&D Projects: GA ČR(CZ) GAP108/11/0853 Institutional support: RVO:67985807 Keywords : G-matrix * J-orthogonal matrich * Cauchy matrix * sign pattern matrix Subject RIV: BA - General Mathematics Impact factor: 0.973, year: 2016
Blount, Benjamin A; Weenink, Tim; Vasylechko, Serge; Ellis, Tom
2012-01-01
Yeast is an ideal organism for the development and application of synthetic biology, yet there remain relatively few well-characterised biological parts suitable for precise engineering of this chassis. In order to address this current need, we present here a strategy that takes a single biological part, a promoter, and re-engineers it to produce a fine-graded output range promoter library and new regulated promoters desirable for orthogonal synthetic biology applications. A highly constitutive Saccharomyces cerevisiae promoter, PFY1p, was identified by bioinformatic approaches, characterised in vivo and diversified at its core sequence to create a 36-member promoter library. TetR regulation was introduced into PFY1p to create a synthetic inducible promoter (iPFY1p) that functions in an inverter device. Orthogonal and scalable regulation of synthetic promoters was then demonstrated for the first time using customisable Transcription Activator-Like Effectors (TALEs) modified and designed to act as orthogonal repressors for specific PFY1-based promoters. The ability to diversify a promoter at its core sequences and then independently target Transcription Activator-Like Orthogonal Repressors (TALORs) to virtually any of these sequences shows great promise toward the design and construction of future synthetic gene networks that encode complex "multi-wire" logic functions.
Self-orthogonal codes from some bush-type Hadamard matrices ...
African Journals Online (AJOL)
By means of a construction method outlined by Harada and Tonchev, we determine some non-binary self-orthogonal codes obtained from the row span of orbit matrices of Bush-type Hadamard matrices that admit a xed-point-free and xed-block-free automorphism of prime order. We show that the code [20; 15; 4]5 obtained ...
Best polynomial degree reduction on q-lattices with applications to q-orthogonal polynomials
Ait-Haddou, Rachid; Goldman, Ron
2015-01-01
We show that a weighted least squares approximation of q-Bézier coefficients provides the best polynomial degree reduction in the q-L2-norm. We also provide a finite analogue of this result with respect to finite q-lattices and we present applications of these results to q-orthogonal polynomials. © 2015 Elsevier Inc. All rights reserved.
The construction of a class of trivariate nonseparable compactly supported orthogonal wavelets
International Nuclear Information System (INIS)
Huang Yongdong; Lei Chongmin; Yang Miao
2009-01-01
In this paper, under a mild condition, the construction of compactly supported orthogonal wavelets is obtained. Wavelets inherit the symmetry of the corresponding scaling function and satisfy the vanishing moment condition originating in the symbols of the scaling function. An example is also given to demonstrate the general theory.
Orthogonality-condition model for bound states with a separable expansion of the potential
International Nuclear Information System (INIS)
Pal, K.F.
1984-01-01
A very efficient solution of the equation of Saito's orthogonality-condition model (OCM) is reported for bound states by means of a separable expansion of the potential (PSE method). Some simplifications of the published formulae of the PSE method is derived, which facilitate its application to the OCM and may be useful in solving the Schroedinger equation as well. (author)
Blount, Benjamin A.; Weenink, Tim; Vasylechko, Serge; Ellis, Tom
2012-01-01
Yeast is an ideal organism for the development and application of synthetic biology, yet there remain relatively few well-characterised biological parts suitable for precise engineering of this chassis. In order to address this current need, we present here a strategy that takes a single biological part, a promoter, and re-engineers it to produce a fine-graded output range promoter library and new regulated promoters desirable for orthogonal synthetic biology applications. A highly constitutive Saccharomyces cerevisiae promoter, PFY1p, was identified by bioinformatic approaches, characterised in vivo and diversified at its core sequence to create a 36-member promoter library. TetR regulation was introduced into PFY1p to create a synthetic inducible promoter (iPFY1p) that functions in an inverter device. Orthogonal and scalable regulation of synthetic promoters was then demonstrated for the first time using customisable Transcription Activator-Like Effectors (TALEs) modified and designed to act as orthogonal repressors for specific PFY1-based promoters. The ability to diversify a promoter at its core sequences and then independently target Transcription Activator-Like Orthogonal Repressors (TALORs) to virtually any of these sequences shows great promise toward the design and construction of future synthetic gene networks that encode complex “multi-wire” logic functions. PMID:22442681
Comparative Performance Evaluation of Orthogonal-Signal-Generators-Based Single-Phase PLL Algorithms
DEFF Research Database (Denmark)
Han, Yang; Luo, Mingyu; Zhao, Xin
2016-01-01
The orthogonal signal generator based phase-locked loops (OSG-PLLs) are among the most popular single-phase PLLs within the areas of power electronics and power systems, mainly because they are often easy to be implement and offer a robust performance against the grid disturbances. The main aim o...
On the non-existence of orthogonal instanton bundles on P^{2n+1}
Directory of Open Access Journals (Sweden)
Łucja Farnik
2009-11-01
Full Text Available In this paper we prove that there do not exist orthogonal instanton bundles on P^{2n+1} . In order to demonstrate this fact, we propose a new way of representing the invariant, introduced by L. Costa and G. Ottaviani, related to a rank 2n instanton bundle on P^{2n+1}.
A family of orthogonal polynomials to solve the inverse equation of punctual kinetics
International Nuclear Information System (INIS)
Suescun D, D.; Bonilla L, H. F.; Figueroa J, J. H.
2015-09-01
This paper proposes a new method to reduce fluctuations in the reactivity calculation, a discrete family of orthogonal polynomials that can soften the nuclear power is used, regarded as the set of data needed to calculate the reactivity in a nuclear reactor. The final results show an improvement in the calculation precision of reactivity, compared to some papers presented in the literature. (Author)
Orthogonality and quantum geometry: Towards a relational reconstruction of quantum theory
Zhong, S.
2015-01-01
This thesis is an in-depth mathematical study of the non-orthogonality relation between the (pure) states of quantum systems. In Chapter 2, I define quantum Kripke frames, the protagonists of this thesis. A quantum Kripke frame is a Kripke frame in which the binary relation possesses some simple
Performance of super-orthogonal space-time trellis code in a multipath environment
CSIR Research Space (South Africa)
Sokoya, OA
2007-09-01
Full Text Available This paper investigates the performance of Super-Orthogonal Space-time Trellis Code (SOSTTC) designed primarily for non-frequency selective (i.e. flat) fading channel but now applied to a frequency selective fading channel. A new decoding trellis...
On cyclic orthogonal double covers of circulant graphs by special infinite graphs
Directory of Open Access Journals (Sweden)
R. El-Shanawany
2017-12-01
Full Text Available In this article, a technique to construct cyclic orthogonal double covers (CODCs of regular circulant graphs by certain infinite graph classes such as complete bipartite and tripartite graphs and disjoint union of butterfly and K1,2n−10 is introduced.
Czech Academy of Sciences Publication Activity Database
Knížek, J.; Tichý, Petr; Beránek, L.; Šindelář, Jan; Vojtěšek, B.; Bouchal, P.; Nenutil, R.; Dedík, O.
2010-01-01
Roč. 7, č. 10 (2010), s. 48-60 ISSN 0974-5718 Grant - others:GA MZd(CZ) NS9812; GA ČR(CZ) GAP304/10/0868 Institutional research plan: CEZ:AV0Z10300504; CEZ:AV0Z10750506 Keywords : polynomial regression * orthogonalization * numerical methods * markers * biomarkers Subject RIV: BA - General Mathematics
Best polynomial degree reduction on q-lattices with applications to q-orthogonal polynomials
Ait-Haddou, Rachid
2015-06-07
We show that a weighted least squares approximation of q-Bézier coefficients provides the best polynomial degree reduction in the q-L2-norm. We also provide a finite analogue of this result with respect to finite q-lattices and we present applications of these results to q-orthogonal polynomials. © 2015 Elsevier Inc. All rights reserved.
Gabor's signal expansion based on a non-orthogonal sampling geometry
Bastiaans, M.J.; Caulfield, H. J.
2002-01-01
Gabor’s signal expansion and the Gabor transform are formulated on a nonorthogonal time-frequency lattice instead of on the traditional rectangular lattice. The reason for doing so is that a non-orthogonal sampling geometry might be better adapted to the form of the window functions (in the
Yang, Pan; Peng, Yulan; Zhao, Haina; Luo, Honghao; Jin, Ya; He, Yushuang
2015-01-01
Static shear wave elastography (SWE) is used to detect breast lesions, but slice and plane selections result in discrepancies. To evaluate the intraobserver reproducibility of continuous SWE, and whether quantitative elasticities in orthogonal planes perform better in the differential diagnosis of breast lesions. One hundred and twenty-two breast lesions scheduled for ultrasound-guided biopsy were recruited. Continuous SWE scans were conducted in orthogonal planes separately. Quantitative elasticities and histopathology results were collected. Reproducibility in the same plane and diagnostic performance in different planes were evaluated. The maximum and mean elasticities of the hardest portion, and standard deviation of whole lesion, had high inter-class correlation coefficients (0.87 to 0.95) and large areas under receiver operation characteristic curve (0.887 to 0.899). Without loss of accuracy, sensitivities had increased in orthogonal planes compared with single plane (from 73.17% up to 82.93% at most). Mean elasticity of whole lesion and lesion-to-parenchyma ratio were significantly less reproducible and less accurate. Continuous SWE is highly reproducible for the same observer. The maximum and mean elasticities of the hardest portion and standard deviation of whole lesion are most reliable. Furthermore, the sensitivities of the three parameters are improved in orthogonal planes without loss of accuracies.
International Nuclear Information System (INIS)
Shi Jinping; Chen Lixin; Xie Qiuying; Zhang Liwen; Teng Jianjian
2012-01-01
Objective: This study was to explore the feasibility of using the orthogonal plane dose formed by the coronal and sagittal plane to verify the volumetric modulated arc therapy (VMAT) plan. Methods: The VMAT plans of 12 patients were included in this study. The orthogonal plane dose formed by the coronal and sagittal plane were measured based on the combination of 2D ionization chamber array and multicube phantom, and the point dose were measured based on a multiple hole cylindrical phantom attached with two 0.125 cm 3 ionization chamber probes. Results: In the measurement of the point dose, the average error was 1.5% in high dose area (more than 80% of maximum), and 1.7% in low dose area (less than 80% of maximum), respectively. The discrepancy of point dose measurement was 1.3% between the 2D ionization chamber array and the VMAT planning system. In the measurement of the orthogonal plane dose, the pass rate of γ were 93.7% for 2%/2 mm and 97.2% for 3%/3 mm. Conclusion: It is reliable for using the orthogonal plane dose formed by the coronal and sagittal plane to verify the VMAT plan. (authors)
Birth-death processes with killing : orthogonal polynomials and quasi-stationary distributions
Coolen-Schrijner, Pauline; van Doorn, Erik A.
2005-01-01
The Karlin-McGregor representation for the transition probabilities of a birth-death process with an absorbing bottom state involves a sequence of orthogonal polynomials and the corresponding measure. This representation can be generalized to a setting in which a transition to the absorbing state
Deformation of the three-term recursion relation and generation of new orthogonal polynomials
International Nuclear Information System (INIS)
Alhaidari, A D
2002-01-01
We find solutions for a linear deformation of the three-term recursion relation. The orthogonal polynomials of the first and second kind associated with the deformed relation are obtained. The new density (weight) function is written in terms of the original one and the deformation parameters
Directory of Open Access Journals (Sweden)
F. A. Romaniuk
2012-01-01
Full Text Available The paper considers formers of orthogonal components of the first, second and fifth current harmonics. The formers are made on the basis of the Goertzel algorithm. The paper also contains investigations of frequency and dynamic properties of these formers.
Efficient decoupling schemes with bounded controls based on Eulerian orthogonal arrays
International Nuclear Information System (INIS)
Wocjan, Pawel
2006-01-01
The task of decoupling, i.e., removing unwanted internal couplings of a quantum system and its couplings to an environment, plays an important role in quantum control theory. There are many efficient decoupling schemes based on combinatorial concepts such as orthogonal arrays, difference schemes, and Hadamard matrices. So far these combinatorial decoupling schemes have relied on the ability to effect sequences of instantaneous, arbitrarily strong control Hamiltonians (bang-bang controls). To overcome the shortcomings of bang-bang control, Viola and Knill proposed a method called 'Eulerian decoupling' that allows the use of bounded-strength controls for decoupling. However, their method was not directly designed to take advantage of the local structure of internal couplings and couplings to an environment that typically occur in multipartite quantum systems. In this paper we define a combinatorial structure called Eulerian orthogonal array. It merges the desirable properties of orthogonal arrays and Eulerian cycles in Cayley graphs (that are the basis of Eulerian decoupling). We show that this structure gives rise to decoupling schemes with bounded-strength control Hamiltonians that can be used to remove both internal couplings and couplings to an environment of a multipartite quantum system. Furthermore, we show how to construct Eulerian orthogonal arrays having good parameters in order to obtain efficient decoupling schemes
Terstappen, Leonardus Wendelinus Mathias Marie; de Grooth, B.G.; ten Napel, C.H.H.; van Berkel, W.; Greve, Jan
1986-01-01
Light scattering properties of human lymphocyte subpopulations selected by immunofluorescence were studied with a flow cytometer. Regulatory and B-lymphocytes showed a low orthogonal light scatter signal, whereas cytotoxic lymphocytes identified with leu-7, leu-11 and leu-15 revealed a large
Lv, C L; Liu, Q B; Cai, C Y; Huang, J; Zhou, G W; Wang, Y G
2015-01-01
In the transmission electron microscopy, a revised real space (RRS) method has been confirmed to be a more accurate dynamical electron diffraction simulation method for low-energy electron diffraction than the conventional multislice method (CMS). However, the RRS method can be only used to calculate the dynamical electron diffraction of orthogonal crystal system. In this work, the expression of the RRS method for non-orthogonal crystal system is derived. By taking Na2 Ti3 O7 and Si as examples, the correctness of the derived RRS formula for non-orthogonal crystal system is confirmed by testing the coincidence of numerical results of both sides of Schrödinger equation; moreover, the difference between the RRS method and the CMS for non-orthogonal crystal system is compared at the accelerating voltage range from 40 to 10 kV. Our results show that the CMS method is almost the same as the RRS method for the accelerating voltage above 40 kV. However, when the accelerating voltage is further lowered to 20 kV or below, the CMS method introduces significant errors, not only for the higher-order Laue zone diffractions, but also for zero-order Laue zone. These indicate that the RRS method for non-orthogonal crystal system is necessary to be used for more accurate dynamical simulation when the accelerating voltage is low. Furthermore, the reason for the increase of differences between those diffraction patterns calculated by the RRS method and the CMS method with the decrease of the accelerating voltage is discussed. © 2015 The Authors Journal of Microscopy © 2015 Royal Microscopical Society.
P A M Dirac meets M G Krein: matrix orthogonal polynomials and Dirac's equation
International Nuclear Information System (INIS)
Duran, Antonio J; Gruenbaum, F Alberto
2006-01-01
The solution of several instances of the Schroedinger equation (1926) is made possible by using the well-known orthogonal polynomials associated with the names of Hermite, Legendre and Laguerre. A relativistic alternative to this equation was proposed by Dirac (1928) involving differential operators with matrix coefficients. In 1949 Krein developed a theory of matrix-valued orthogonal polynomials without any reference to differential equations. In Duran A J (1997 Matrix inner product having a matrix symmetric second order differential operator Rocky Mt. J. Math. 27 585-600), one of us raised the question of determining instances of these matrix-valued polynomials going along with second order differential operators with matrix coefficients. In Duran A J and Gruenbaum F A (2004 Orthogonal matrix polynomials satisfying second order differential equations Int. Math. Res. Not. 10 461-84), we developed a method to produce such examples and observed that in certain cases there is a connection with the instance of Dirac's equation with a central potential. We observe that the case of the central Coulomb potential discussed in the physics literature in Darwin C G (1928 Proc. R. Soc. A 118 654), Nikiforov A F and Uvarov V B (1988 Special Functions of Mathematical Physics (Basle: Birkhauser) and Rose M E 1961 Relativistic Electron Theory (New York: Wiley)), and its solution, gives rise to a matrix weight function whose orthogonal polynomials solve a second order differential equation. To the best of our knowledge this is the first instance of a connection between the solution of the first order matrix equation of Dirac and the theory of matrix-valued orthogonal polynomials initiated by M G Krein
Han, Dongxue; Han, Jianlei; Huo, Shengwei; Qu, Zuoming; Jiao, Tifeng; Liu, Minghua; Duan, Pengfei
2018-05-29
The orthogonal- or co-assembly of achiral perylene bisimide (PBI) with chiral gelators can be regulated by solvents. While the coassembly leads to the formation of chiroptical nanofibers through chirality transfer, the orthogonal assemblies could not. Moreover, protonation on the coassembled nanofibers could light up the circularly polarized luminescence (CPL).
U.S. Department of Health & Human Services — HCUP Fast Stats provides easy access to the latest HCUP-based statistics for health information topics. HCUP Fast Stats uses visual statistical displays in...
Fast foods are quick, reasonably priced, and readily available alternatives to home cooking. While convenient and economical for a busy lifestyle, fast foods are typically high in calories, fat, saturated fat, ...
... challenge to eat healthy when going to a fast food place. In general, avoiding items that are deep ... challenge to eat healthy when going to a fast food place. In general, avoiding items that are deep ...
Shokoufeh Bonakdaran
2016-01-01
Considering the emphasis of Islam on the importance of fasting, Muslims attempt to fast from dawn until sunset during the holy month of Ramadan. Fasting is associated with several benefits for normal and healthy individuals. However, it could pose high risks to the health of diabetic patients due to certain physiological changes. This study aimed to compare the physiological changes associated with fasting in healthy individuals and diabetic patients during Ramadan. Furthermore, we reviewed t...
Visual search in barn owls: Task difficulty and saccadic behavior.
Orlowski, Julius; Ben-Shahar, Ohad; Wagner, Hermann
2018-01-01
How do we find what we are looking for? A target can be in plain view, but it may be detected only after extensive search. During a search we make directed attentional deployments like saccades to segment the scene until we detect the target. Depending on difficulty, the search may be fast with few attentional deployments or slow with many, shorter deployments. Here we study visual search in barn owls by tracking their overt attentional deployments-that is, their head movements-with a camera. We conducted a low-contrast feature search, a high-contrast orientation conjunction search, and a low-contrast orientation conjunction search, each with set sizes varying from 16 to 64 items. The barn owls were able to learn all of these tasks and showed serial search behavior. In a subsequent step, we analyzed how search behavior of owls changes with search complexity. We compared the search mechanisms in these three serial searches with results from pop-out searches our group had reported earlier. Saccade amplitude shortened and fixation duration increased in difficult searches. Also, in conjunction search saccades were guided toward items with shared target features. These data suggest that during visual search, barn owls utilize mechanisms similar to those that humans use.
Shima, Tomoyuki; Tomeba, Hiromichi; Adachi, Fumiyuki
Orthogonal multi-carrier direct sequence code division multiple access (orthogonal MC DS-CDMA) is a combination of time-domain spreading and orthogonal frequency division multiplexing (OFDM). In orthogonal MC DS-CDMA, the frequency diversity gain can be obtained by applying frequency-domain equalization (FDE) based on minimum mean square error (MMSE) criterion to a block of OFDM symbols and can improve the bit error rate (BER) performance in a severe frequency-selective fading channel. FDE requires an accurate estimate of the channel gain. The channel gain can be estimated by removing the pilot modulation in the frequency domain. In this paper, we propose a pilot-assisted channel estimation suitable for orthogonal MC DS-CDMA with FDE and evaluate, by computer simulation, the BER performance in a frequency-selective Rayleigh fading channel.
International Nuclear Information System (INIS)
Broomfield, A.M.
1985-01-01
The paper concerns the Prototype Fast Reactor (PFR), which is a liquid metal cooled fast reactor power station, situated at Dounreay, Scotland. The principal design features of a Fast Reactor and the PFR are given, along with key points of operating history, and health and safety features. The role of the PFR in the development programme for commercial reactors is discussed. (U.K.)
International Nuclear Information System (INIS)
1980-02-01
The subject is discussed as follows: brief description of fast reactors; advantage in conserving uranium resources; experience, in UK and elsewhere, in fast reactor design, construction and operation; safety; production of plutonium, security aspects; consideration of future UK fast reactor programme. (U.K.)
Ramadan, fasting and pregnancy
DEFF Research Database (Denmark)
Ahmed, Urfan Zahoor; Lykke, Jacob Alexander
2014-01-01
In Islam, the month of Ramadan is a period of fasting lasting 29 or 30 days. Epidemiological studies among Muslims in Denmark have not been conducted, but studies show, that fasting among pregnant Muslim women is common. Fasting does not increase the risk of growth restriction or preterm delivery...
Fast reactors: the industrial perspective
International Nuclear Information System (INIS)
Vaughan, R.D.
1986-01-01
Industrial participation in the development of the fast reactor is reviewed, from the construction of PFR at Dounreay to the initial steps towards collaboration in Europe. The optimum design of the fast reactor has changed considerably from the days when it was needed urgently to forestall a shortage of uranium to today when uranium is abundant and cheap. The evolution of the reactor design over this period is described. Collaboration in Europe is shown to be the only answer to high development costs and the search for a reactor which will compete with thermal reactors in today's environment. The partner countries in this collaboration are all motivated differently, and this is leading to some delays in concluding the necessary agreements. The objective on the industrial front is now to participate in the two or three demonstration fast reactors that will be built in Europe during the remainder of the century leading, it is hoped, to a competitive reactor design by the year 2000. (author)
ATLAS Fast Physics Monitoring: TADA
AUTHOR|(INSPIRE)INSPIRE-00375930; The ATLAS collaboration; Elsing, Markus
2017-01-01
The ATLAS experiment at the LHC is recording data from proton-proton collisions with 13 TeV center-of-mass energy since spring 2015. The collaboration is using a fast physics monitoring framework (TADA) to automatically perform a broad range of fast searches for early signs of new physics and to monitor the data quality across the year with the full analysis level calibrations applied to the rapidly growing data.TADA is designed to provide fast feedback directly after the collected data has been fully calibrated and processed at the Tier-0, the CERN Data Center. The system can monitor a large range of physics channels, offline data quality and physics performance quantities nearly final analysis level object calibrations. TADA output is available on a website accessible by the whole collaboration that gets updated twice a day with the data from newly processed runs. Hints of potentially interesting physics signals or performance issues identified in this way are reported to be followed up by physics or combin...
ATLAS fast physics monitoring: TADA
Sabato, G.; Elsing, M.; Gumpert, C.; Kamioka, S.; Moyse, E.; Nairz, A.; Eifert, T.; ATLAS Collaboration
2017-10-01
The ATLAS experiment at the LHC has been recording data from proton-proton collisions with 13 TeV center-of-mass energy since spring 2015. The collaboration is using a fast physics monitoring framework (TADA) to automatically perform a broad range of fast searches for early signs of new physics and to monitor the data quality across the year with the full analysis level calibrations applied to the rapidly growing data. TADA is designed to provide fast feedback directly after the collected data has been fully calibrated and processed at the Tier-0. The system can monitor a large range of physics channels, offline data quality and physics performance quantities. TADA output is available on a website accessible by the whole collaboration. It gets updated twice a day with the data from newly processed runs. Hints of potentially interesting physics signals or performance issues identified in this way are reported to be followed up by physics or combined performance groups. The note reports as well about the technical aspects of TADA: the software structure to obtain the input TAG files, the framework workflow and structure, the webpage and its implementation.
ATLAS Fast Physics Monitoring: TADA
Elsing, Markus; The ATLAS collaboration; Sabato, Gabriele; Kamioka, Shusei; Nairz, Armin Michael; Moyse, Edward; Gumpert, Christian
2016-01-01
The ATLAS Experiment at the LHC is recording data from proton-proton collisions with 13 TeV center-of-mass energy since spring 2015. The collaboration is using a fast physics monitoring framework (TADA) to automatically perform a broad range of fast searches for early signs of new physics and to monitor the data quality across the year with the full analysis level calibrations applied to the rapidly growing data. TADA is designed to provide fast feedback directly after the collected data has been fully calibrated and processed at the Tier-0. The system can monitor a large range of physics channels, offline data quality and physics performance quantities nearly final analysis level object calibrations. TADA output is available on a website accessible by the whole collaboration that gets updated twice a day with the data from newly processed runs. Hints of potentially interesting physics signals or performance issues identified in this way are reported to be followed up by physics or combined performance groups...
Directory of Open Access Journals (Sweden)
Kosuke Saito
Full Text Available Circulating lipid molecules reflect biological processes in the body and, thus, are useful tools for preclinical estimation of the efficacy and safety of newly developed drugs. However, background information on profiles of circulating lipid molecules in preclinical animal models is limited. Therefore, we examined the effects of multiple factors such as sex (fasted male vs. female, age (fasted 10 vs. 30 weeks old, and feeding conditions (feeding vs. fasting, 16 vs. 22 hr fasting, 10 AM vs. 4 PM blood collection, on the global profiles of lipid molecules in plasma from Sprague-Dawley rats by using a lipidomic approach. Our assay platform determined 262 lipid molecules (68 phospholipids, 20 sphingolipids, 138 neutral lipids, and 36 polyunsaturated fatty acids and their metabolites in rat plasma. Multivariate discriminant analysis (orthogonal partial least squares discriminant analysis and heat maps of statistically significant lipid molecules revealed that the plasma lipid profiles in rats are predominantly influenced by feeding conditions, followed by sex and age. In addition, the fasting duration (16 vs. 22 hr fasting or the time of blood collection (10 AM vs. 4 PM blood collection has limited or no contribution on the profiles of lipid molecules in rat plasma. Our results provide useful, fundamental information for exploring and validating biomarkers in future preclinical studies and may help to establish regulatory standards for such studies.
Searching for New Double Stars with a Computer
Bryant, T. V.
2015-04-01
The advent of computers with large amounts of RAM memory and fast processors, as well as easy internet access to large online astronomical databases, has made computer searches based on astrometric data practicable for most researchers. This paper describes one such search that has uncovered hitherto unrecognized double stars.
Ramadan, fasting and pregnancy
DEFF Research Database (Denmark)
Ahmed, Urfan Zahoor; Lykke, Jacob Alexander
2014-01-01
In Islam, the month of Ramadan is a period of fasting lasting 29 or 30 days. Epidemiological studies among Muslims in Denmark have not been conducted, but studies show, that fasting among pregnant Muslim women is common. Fasting does not increase the risk of growth restriction or preterm delivery......, but there are reports of decreased foetal movements. Furthermore, the fasting may have long-term health consequences for the offspring, especially when they reach their middle age. According to Islam and the interpretation, pregnant and breast-feeding women are allowed to postpone the fasting of the month of Ramadan...
DEFF Research Database (Denmark)
Ahmed, Urfan Zahoor; Lykke, Jacob Alexander
2014-01-01
In Islam, the month of Ramadan is a period of fasting lasting 29 or 30 days. Epidemiological studies among Muslims in Denmark have not been conducted, but studies show, that fasting among pregnant Muslim women is common. Fasting does not increase the risk of growth restriction or preterm delivery......, but there are reports of decreased foetal movements. Furthermore, the fasting may have long-term health consequences for the offspring, especially when they reach their middle age. According to Islam and the interpretation, pregnant and breast-feeding women are allowed to postpone the fasting of the month of Ramadan...
Fast and Flexible Multivariate Time Series Subsequence Search
National Aeronautics and Space Administration — Multivariate Time-Series (MTS) are ubiquitous, and are generated in areas as disparate as sensor recordings in aerospace systems, music and video streams, medical...
Search of Large Super-Fast Rotator between NEAs
Czech Academy of Sciences Publication Activity Database
Carbognani, A.; Pravec, Petr; Kušnirák, Peter; Hornoch, Kamil; Galád, Adrián; Monte, S.; Bertaina, M.
2016-01-01
Roč. 87, č. 1 (2016), s. 66-71 ISSN 0037-8720. [Italian national workshop of planetary sciences /12./. Bormio, 02.02.2015-06.02.2015] R&D Projects: GA ČR GAP209/12/0229 Institutional support: RVO:67985815 Keywords : minor planets * near Earth asteroids * rotation periods Subject RIV: BN - Astronomy, Celestial Mechanics, Astrophysics http://sait.oat.ts.astro.it/MmSAI/87/PDF/66.pdf
Kmer-SSR: a fast and exhaustive SSR search algorithm.
Pickett, Brandon D; Miller, Justin B; Ridge, Perry G
2017-12-15
One of the main challenges with bioinformatics software is that the size and complexity of datasets necessitate trading speed for accuracy, or completeness. To combat this problem of computational complexity, a plethora of heuristic algorithms have arisen that report a 'good enough' solution to biological questions. However, in instances such as Simple Sequence Repeats (SSRs), a 'good enough' solution may not accurately portray results in population genetics, phylogenetics and forensics, which require accurate SSRs to calculate intra- and inter-species interactions. We present Kmer-SSR, which finds all SSRs faster than most heuristic SSR identification algorithms in a parallelized, easy-to-use manner. The exhaustive Kmer-SSR option has 100% precision and 100% recall and accurately identifies every SSR of any specified length. To identify more biologically pertinent SSRs, we also developed several filters that allow users to easily view a subset of SSRs based on user input. Kmer-SSR, coupled with the filter options, accurately and intuitively identifies SSRs quickly and in a more user-friendly manner than any other SSR identification algorithm. The source code is freely available on GitHub at https://github.com/ridgelab/Kmer-SSR. perry.ridge@byu.edu. © The Author(s) 2017. Published by Oxford University Press.
Introduction to Search with Sphinx From installation to relevance tuning
Aksyonoff, Andrew
2011-01-01
This concise introduction to Sphinx shows you how to use this free software to index an enormous number of documents and provide fast results to both simple and complex searches. Written by the creator of Sphinx, this authoritative book is short and to the point. Understand the particular way Sphinx conducts searchesInstall and configure Sphinx, and run a few basic testsIssue basic queries to Sphinx at the application levelLearn the syntax of search text and the effects of various search optionsGet strategies for dealing with large data sets, such as multi-index searchingApply relevance and r
A New Approximate Chimera Donor Cell Search Algorithm
Holst, Terry L.; Nixon, David (Technical Monitor)
1998-01-01
The objectives of this study were to develop chimera-based full potential methodology which is compatible with overflow (Euler/Navier-Stokes) chimera flow solver and to develop a fast donor cell search algorithm that is compatible with the chimera full potential approach. Results of this work included presenting a new donor cell search algorithm suitable for use with a chimera-based full potential solver. This algorithm was found to be extremely fast and simple producing donor cells as fast as 60,000 per second.
van Doorn, Erik A.; van Foreest, N.D.; Zeifman, Alexander I.
2013-01-01
We correct representations for the endpoints of the true interval of orthogonality of a sequence of orthogonal polynomials that were stated by us in the Journal of Computational and Applied Mathematics 233 (2009) 847–851.
Differential forms orthogonal to holomorphic functions or forms, and their properties
Aizenberg, L A
1983-01-01
The authors consider the problem of characterizing the exterior differential forms which are orthogonal to holomorphic functions (or forms) in a domain D\\subset {\\mathbf C}^n with respect to integration over the boundary, and some related questions. They give a detailed account of the derivation of the Bochner-Martinelli-Koppelman integral representation of exterior differential forms, which was obtained in 1967 and has already found many important applications. They study the properties of \\overline \\partial-closed forms of type (p, n - 1), 0\\leq p\\leq n - 1, which turn out to be the duals (with respect to the orthogonality mentioned above) to holomorphic functions (or forms) in several complex variables, and resemble holomorphic functions of one complex variable in their properties.
Orthogonal and symplectic Yangians and Yang–Baxter R-operators
International Nuclear Information System (INIS)
Isaev, A.P.; Karakhanyan, D.; Kirschner, R.
2016-01-01
Yang–Baxter R operators symmetric with respect to the orthogonal and symplectic algebras are considered in an uniform way. Explicit forms for the spinorial and metaplectic R operators are obtained. L operators, obeying the RLL relation with the orthogonal or symplectic fundamental R matrix, are considered in the interesting cases, where their expansion in inverse powers of the spectral parameter is truncated. Unlike the case of special linear algebra symmetry the truncation results in additional conditions on the Lie algebra generators of which the L operators is built and which can be fulfilled in distinguished representations only. Further, generalized L operators, obeying the modified RLL relation with the fundamental R matrix replaced by the spinorial or metaplectic one, are considered in the particular case of linear dependence on the spectral parameter. It is shown how by fusion with respect to the spinorial or metaplectic representation these first order spinorial L operators reproduce the ordinary L operators with second order truncation.
Radar orthogonality and radar length in Finsler and metric spacetime geometry
Pfeifer, Christian
2014-09-01
The radar experiment connects the geometry of spacetime with an observers measurement of spatial length. We investigate the radar experiment on Finsler spacetimes which leads to a general definition of radar orthogonality and radar length. The directions radar orthogonal to an observer form the spatial equal time surface an observer experiences and the radar length is the physical length the observer associates to spatial objects. We demonstrate these concepts on a forth order polynomial Finsler spacetime geometry which may emerge from area metric or premetric linear electrodynamics or in quantum gravity phenomenology. In an explicit generalization of Minkowski spacetime geometry we derive the deviation from the Euclidean spatial length measure in an observers rest frame explicitly.
Orthogonal and symplectic Yangians and Yang–Baxter R-operators
Energy Technology Data Exchange (ETDEWEB)
Isaev, A.P., E-mail: isaevap@theor.jinr.ru [Bogoliubov Lab., Joint Institute of Nuclear Research, Dubna (Russian Federation); Karakhanyan, D., E-mail: karakhan@yerphi.am [Yerevan Physics Institute, 2 Alikhanyan br., 0036 Yerevan (Armenia); Kirschner, R., E-mail: Roland.Kirschner@itp.uni-leipzig.de [Institut für Theoretische Physik, Universität Leipzig, PF 100 920, D-04009 Leipzig (Germany)
2016-03-15
Yang–Baxter R operators symmetric with respect to the orthogonal and symplectic algebras are considered in an uniform way. Explicit forms for the spinorial and metaplectic R operators are obtained. L operators, obeying the RLL relation with the orthogonal or symplectic fundamental R matrix, are considered in the interesting cases, where their expansion in inverse powers of the spectral parameter is truncated. Unlike the case of special linear algebra symmetry the truncation results in additional conditions on the Lie algebra generators of which the L operators is built and which can be fulfilled in distinguished representations only. Further, generalized L operators, obeying the modified RLL relation with the fundamental R matrix replaced by the spinorial or metaplectic one, are considered in the particular case of linear dependence on the spectral parameter. It is shown how by fusion with respect to the spinorial or metaplectic representation these first order spinorial L operators reproduce the ordinary L operators with second order truncation.
Energy Technology Data Exchange (ETDEWEB)
Fang, L. [LMP, Ecole Centrale de Pékin, Beihang University, Beijing 100191 (China); Co-Innovation Center for Advanced Aero-Engine, Beihang University, Beijing 100191 (China); Sun, X.Y. [LMP, Ecole Centrale de Pékin, Beihang University, Beijing 100191 (China); Liu, Y.W., E-mail: liuyangwei@126.com [National Key Laboratory of Science and Technology on Aero-Engine Aero-Thermodynamics, School of Energy and Power Engineering, Beihang University, Beijing 100191 (China); Co-Innovation Center for Advanced Aero-Engine, Beihang University, Beijing 100191 (China)
2016-12-09
In order to shed light on understanding the subgrid-scale (SGS) modelling methodology, we analyze and define the concepts of assumption and restriction in the modelling procedure, then show by a generalized derivation that if there are multiple stationary restrictions in a modelling, the corresponding assumption function must satisfy a criterion of orthogonality. Numerical tests using one-dimensional nonlinear advection equation are performed to validate this criterion. This study is expected to inspire future research on generally guiding the SGS modelling methodology. - Highlights: • The concepts of assumption and restriction in the SGS modelling procedure are defined. • A criterion of orthogonality on the assumption and restrictions is derived. • Numerical tests using one-dimensional nonlinear advection equation are performed to validate this criterion.
Directory of Open Access Journals (Sweden)
Yi Liu
2015-01-01
Full Text Available The design and simulation of a 10 × 8 multibeam dual-band orthogonal linearly polarized antenna array operating at Ku-band are presented for transmit-receive applications. By using patches with different coupling methods as elements, both perpendicular polarization in 12.25–12.75 GHz band and horizontal polarization in 14.0–14.5 GHz band are realized in a shared antenna aperture. A microstrip Rotman lens is employed as the beamforming network with 7 input ports, which can generate a corresponding number of beams to cover −30°–30° with 5 dB beamwidth along one dimension. This type of multibeam orthogonal linearly polarized planar antenna is a good candidate for satellite communication (SatCom.
A Low-Complexity Euclidean Orthogonal LDPC Architecture for Low Power Applications
Directory of Open Access Journals (Sweden)
M. Revathy
2015-01-01
Full Text Available Low-density parity-check (LDPC codes have been implemented in latest digital video broadcasting, broadband wireless access (WiMax, and fourth generation of wireless standards. In this paper, we have proposed a high efficient low-density parity-check code (LDPC decoder architecture for low power applications. This study also considers the design and analysis of check node and variable node units and Euclidean orthogonal generator in LDPC decoder architecture. The Euclidean orthogonal generator is used to reduce the error rate of the proposed LDPC architecture, which can be incorporated between check and variable node architecture. This proposed decoder design is synthesized on Xilinx 9.2i platform and simulated using Modelsim, which is targeted to 45 nm devices. Synthesis report proves that the proposed architecture greatly reduces the power consumption and hardware utilizations on comparing with different conventional architectures.
A Low-Complexity Euclidean Orthogonal LDPC Architecture for Low Power Applications.
Revathy, M; Saravanan, R
2015-01-01
Low-density parity-check (LDPC) codes have been implemented in latest digital video broadcasting, broadband wireless access (WiMax), and fourth generation of wireless standards. In this paper, we have proposed a high efficient low-density parity-check code (LDPC) decoder architecture for low power applications. This study also considers the design and analysis of check node and variable node units and Euclidean orthogonal generator in LDPC decoder architecture. The Euclidean orthogonal generator is used to reduce the error rate of the proposed LDPC architecture, which can be incorporated between check and variable node architecture. This proposed decoder design is synthesized on Xilinx 9.2i platform and simulated using Modelsim, which is targeted to 45 nm devices. Synthesis report proves that the proposed architecture greatly reduces the power consumption and hardware utilizations on comparing with different conventional architectures.
Díaz Mendoza, C.; Orive, R.; Pijeira Cabrera, H.
2008-10-01
We study the asymptotic behavior of the zeros of a sequence of polynomials whose weighted norms, with respect to a sequence of weight functions, have the same nth root asymptotic behavior as the weighted norms of certain extremal polynomials. This result is applied to obtain the (contracted) weak zero distribution for orthogonal polynomials with respect to a Sobolev inner product with exponential weights of the form e-[phi](x), giving a unified treatment for the so-called Freud (i.e., when [phi] has polynomial growth at infinity) and Erdös (when [phi] grows faster than any polynomial at infinity) cases. In addition, we provide a new proof for the bound of the distance of the zeros to the convex hull of the support for these Sobolev orthogonal polynomials.
Axial buckling scrutiny of doubly orthogonal slender nanotubes via nonlocal continuum theory
Energy Technology Data Exchange (ETDEWEB)
Kiani, Keivan [K.N. Toosi University of Technolog, Tehran (Iran, Islamic Republic of)
2015-10-15
Using nonlocal Euler-Bernoulli beam theory, buckling behavior of elastically embedded Doubly orthogonal single-walled carbon nanotubes (DOSWCNTs) is studied. The nonlocal governing equations are obtained. In fact, these are coupled fourth-order integroordinary differential equations which are very difficult to be solved explicitly. As an alternative solution, Galerkin approach in conjunction with assumed mode method is employed, and the axial compressive buckling load of the nanosystem is evaluated. For DOSWCNTs with simply supported tubes, the influences of the slenderness ratio, aspect ratio, intertube free space, small-scale parameter, and properties of the surrounding elastic matrix on the axial buckling load of the nanosystem are addressed. The proposed model could be considered as a pivotal step towards better understanding the buckling behavior of more complex nanosystems such as doubly orthogonal membranes or even jungles of carbon nanotubes.
Algorithm of orthogonal bi-axle for auto-separating of watermelon seeds
Sun, Yong; Guan, Miao; Yu, Daoqin; Wang, Jing
2007-11-01
During the process of watermelon seeds characteristic extraction as well as separation, watermelon seeds' major and minor axes, the length and width ratio have played a very important role in appearance regulating degree evaluation. It is quite difficult to find the answer of orthogonal bi-axes because the watermelon seeds are flat and irregular in shape and what's more there is no rule to follow. After a lot of experiments and research, the author proposed the algorithm of orthogonal bi-axes algorithm for granulated object. It has been put into practice and proved in the application of auto-separation system for watermelon seeds. This algorithm has the advantage of lower time complexity and higher precision compared with other algorithms. The algorithm can be used in the solution of other similar granulated objects, and has the widespread application value.
Video-based depression detection using local Curvelet binary patterns in pairwise orthogonal planes.
Pampouchidou, Anastasia; Marias, Kostas; Tsiknakis, Manolis; Simos, Panagiotis; Fan Yang; Lemaitre, Guillaume; Meriaudeau, Fabrice
2016-08-01
Depression is an increasingly prevalent mood disorder. This is the reason why the field of computer-based depression assessment has been gaining the attention of the research community during the past couple of years. The present work proposes two algorithms for depression detection, one Frame-based and the second Video-based, both employing Curvelet transform and Local Binary Patterns. The main advantage of these methods is that they have significantly lower computational requirements, as the extracted features are of very low dimensionality. This is achieved by modifying the previously proposed algorithm which considers Three-Orthogonal-Planes, to only Pairwise-Orthogonal-Planes. Performance of the algorithms was tested on the benchmark dataset provided by the Audio/Visual Emotion Challenge 2014, with the person-specific system achieving 97.6% classification accuracy, and the person-independed one yielding promising preliminary results of 74.5% accuracy. The paper concludes with open issues, proposed solutions, and future plans.
The investigation of the non-orthogonal basis expansion method for a three-fermion system
International Nuclear Information System (INIS)
Baoqiu Chen; Kentucky Univ., Lexington, KY
1992-01-01
In this paper, the non-orthogonal basis expansion method has been extended to solve a three-fermion system. The radial wavefunction of such a system is expanded in terms of a non-orthogonal Gaussian basis. All matrix elements of the Hamiltonian, including the central, tensor and spin-orbit potentials are derived in analytical forms. The new method simplifies the three-body system calculations, which are usually rather tedious by other methods. The method can be used to calculate energies for both the ground state and low excited states and has been used further to investigate the other nuclear properties of a three-body system such as Λ 3 H. (Author)
Vector 33: A reduce program for vector algebra and calculus in orthogonal curvilinear coordinates
Harper, David
1989-06-01
This paper describes a package with enables REDUCE 3.3 to perform algebra and calculus operations upon vectors. Basic algebraic operations between vectors and between scalars and vectors are provided, including scalar (dot) product and vector (cross) product. The vector differential operators curl, divergence, gradient and Laplacian are also defined, and are valid in any orthogonal curvilinear coordinate system. The package is written in RLISP to allow algebra and calculus to be performed using notation identical to that for operations. Scalars and vectors can be mixed quite freely in the same expression. The package will be of interest to mathematicians, engineers and scientists who need to perform vector calculations in orthogonal curvilinear coordinates.
Generation of a strong attosecond pulse train with an orthogonally polarized two-color laser field
International Nuclear Information System (INIS)
Kim, Chul Min; Kim, I Jong; Nam, Chang Hee
2005-01-01
We theoretically investigate the high-order harmonic generation from a neon atom irradiated by an intense two-color femtosecond laser pulse, in which the fundamental field and its second harmonic are linearly polarized and orthogonal to each other. In contrast to usual high-harmonic generation with linearly polarized fundamental field alone, a very strong and clean high-harmonic spectrum, consisting of both odd and even orders of harmonics, can be generated in the orthogonally polarized two-color laser field with proper selection of the relative phase between the fundamental and second-harmonic fields. In time domain, this results in a strong and regular attosecond pulse train. The origin of these behaviors is elucidated by analyzing semiclassical electron paths and by simulating high-harmonic generation quantum mechanically
An orthogonality condition model treatment of elastic and inelastic (α, 12C) scattering
International Nuclear Information System (INIS)
Suzuki, Y.; Imanishi, B.
1981-02-01
Elastic and inelastic scattering of α-particles on the deformed nucleus 12 C are investigated in the range of incident α-particle energies of 9 to 11 MeV by using the coupled-channel method with orthogonality condition. A doubly folded potential generated by the shell model wave functions of the α-particle and the deformed nucleus 12 C is employed for the relative motion between the α-particle and 12 C. Good agreement between theory and experiment is obtained for the elastic and inelastic angular distributions and the resonance structures. It is found, from the Born series expansion of the T-matrix, that the orthogonality constraint stresses the effects of the channel-coupling between the elastic and inelastic processes, and it indicates that the DWBA does not work well in this system. (author)
DEFF Research Database (Denmark)
Lykke, Marianne; Price, Susan; Delcambre, Lois
2012-01-01
Professional, workplace searching is different from general searching, because it is typically limited to specific facets and targeted to a single answer. We have developed the semantic component (SC) model, which is a search feature that allows searchers to structure and specify the search to co...
DEFF Research Database (Denmark)
2006-01-01
Sound search is provided by the major search engines, however, indexing is text based, not sound based. We will establish a dedicated sound search services with based on sound feature indexing. The current demo shows the concept of the sound search engine. The first engine will be realased June...
Rajashekar, TB
1998-01-01
The World Wide Web is emerging as an all-in-one information source. Tools for searching Web-based information include search engines, subject directories and meta search tools. We take a look at key features of these tools and suggest practical hints for effective Web searching.
Kawagoe, Kiyotomo
2001-01-01
Searches for new particles and new physics were extensively performed at LEP. Although no evidence for new particle/physics was discovered, the null results set very stringent limits to theories beyond the standard model. In this paper, searches at LEP and anomalies observed in the searches are presented. Future prospect of searches at the new energy frontier machines is also discussed.
Matrix-Vector Based Fast Fourier Transformations on SDR Architectures
Directory of Open Access Journals (Sweden)
Y. He
2008-05-01
Full Text Available Today Discrete Fourier Transforms (DFTs are applied in various radio standards based on OFDM (Orthogonal Frequency Division Multiplex. It is important to gain a fast computational speed for the DFT, which is usually achieved by using specialized Fast Fourier Transform (FFT engines. However, in face of the Software Defined Radio (SDR development, more general (parallel processor architectures are often desirable, which are not tailored to FFT computations. Therefore, alternative approaches are required to reduce the complexity of the DFT. Starting from a matrix-vector based description of the FFT idea, we will present different factorizations of the DFT matrix, which allow a reduction of the complexity that lies between the original DFT and the minimum FFT complexity. The computational complexities of these factorizations and their suitability for implementation on different processor architectures are investigated.
A Fast LMMSE Channel Estimation Method for OFDM Systems
Directory of Open Access Journals (Sweden)
Zhou Wen
2009-01-01
Full Text Available A fast linear minimum mean square error (LMMSE channel estimation method has been proposed for Orthogonal Frequency Division Multiplexing (OFDM systems. In comparison with the conventional LMMSE channel estimation, the proposed channel estimation method does not require the statistic knowledge of the channel in advance and avoids the inverse operation of a large dimension matrix by using the fast Fourier transform (FFT operation. Therefore, the computational complexity can be reduced significantly. The normalized mean square errors (NMSEs of the proposed method and the conventional LMMSE estimation have been derived. Numerical results show that the NMSE of the proposed method is very close to that of the conventional LMMSE method, which is also verified by computer simulation. In addition, computer simulation shows that the performance of the proposed method is almost the same with that of the conventional LMMSE method in terms of bit error rate (BER.
Fast and efficient indexing approach for object recognition
Hefnawy, Alaa; Mashali, Samia A.; Rashwan, Mohsen; Fikri, Magdi
1999-08-01
This paper introduces a fast and efficient indexing approach for both 2D and 3D model-based object recognition in the presence of rotation, translation, and scale variations of objects. The indexing entries are computed after preprocessing the data by Haar wavelet decomposition. The scheme is based on a unified image feature detection approach based on Zernike moments. A set of low level features, e.g. high precision edges, gray level corners, are estimated by a set of orthogonal Zernike moments, calculated locally around every image point. A high dimensional, highly descriptive indexing entries are then calculated based on the correlation of these local features and employed for fast access to the model database to generate hypotheses. A list of the most candidate models is then presented by evaluating the hypotheses. Experimental results are included to demonstrate the effectiveness of the proposed indexing approach.
Fast Prediction Method for Steady-State Heat Convection
Wáng, Yì
2012-03-14
A reduced model by proper orthogonal decomposition (POD) and Galerkin projection methods for steady-state heat convection is established on a nonuniform grid. It was verified by thousands of examples that the results are in good agreement with the results obtained from the finite volume method. This model can also predict the cases where model parameters far exceed the sample scope. Moreover, the calculation time needed by the model is much shorter than that needed for the finite volume method. Thus, the nonuniform POD-Galerkin projection method exhibits high accuracy, good suitability, and fast computation. It has universal significance for accurate and fast prediction. Also, the methodology can be applied to more complex modeling in chemical engineering and technology, such as reaction and turbulence. © 2012 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
Numerical modelling of orthogonal cutting: application to woodworking with a bench plane
Nairn, John A.
2016-01-01
A numerical model for orthogonal cutting using the material point method was applied to woodcutting using a bench plane. The cutting process was modelled by accounting for surface energy associated with wood fracture toughness for crack growth parallel to the grain. By using damping to deal with dynamic crack propagation and modelling all contact between wood and the plane, simulations could initiate chip formation and proceed into steady-state chip propagation including chip curling. Once st...
Protein-like Nanoparticles Based on Orthogonal Self-Assembly of Chimeric Peptides.
Jiang, Linhai; Xu, Dawei; Namitz, Kevin E; Cosgrove, Michael S; Lund, Reidar; Dong, He
2016-10-01
A novel two-component self-assembling chimeric peptide is designed where two orthogonal protein folding motifs are linked side by side with precisely defined position relative to one another. The self-assembly is driven by a combination of symmetry controlled molecular packing, intermolecular interactions, and geometric constraint to limit the assembly into compact dodecameric protein nanoparticles. © 2016 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
Genetic interaction studies are a powerful approach to identify functional interactions between genes. This approach can reveal networks of regulatory hubs and connect uncharacterized genes to well-studied pathways. However, this approach has previously been limited to simple gene inactivation studies. Here, we present an orthogonal CRISPR/Cas-mediated genetic interaction approach that allows the systematic activation of one gene while simultaneously knocking out a second gene in the same cell.
Darboux partners of pseudoscalar Dirac potentials associated with exceptional orthogonal polynomials
International Nuclear Information System (INIS)
Schulze-Halberg, Axel; Roy, Barnana
2014-01-01
We introduce a method for constructing Darboux (or supersymmetric) pairs of pseudoscalar and scalar Dirac potentials that are associated with exceptional orthogonal polynomials. Properties of the transformed potentials and regularity conditions are discussed. As an application, we consider a pseudoscalar Dirac potential related to the Schrödinger model for the rationally extended radial oscillator. The pseudoscalar partner potentials are constructed under the first- and second-order Darboux transformations
International Nuclear Information System (INIS)
Schulze-Halberg, Axel; Roy, Pinaki
2017-01-01
We construct energy-dependent potentials for which the Schrödinger equations admit solutions in terms of exceptional orthogonal polynomials. Our method of construction is based on certain point transformations, applied to the equations of exceptional Hermite, Jacobi and Laguerre polynomials. We present several examples of boundary-value problems with energy-dependent potentials that admit a discrete spectrum and the corresponding normalizable solutions in closed form.
KELEŞ, Taliha; ALTUN, Murat
2016-01-01
Regression analysis is a statistical technique for investigating and modeling the relationship between variables. The purpose of this study was the trivial presentation of the equation for orthogonal regression (OR) and the comparison of classical linear regression (CLR) and OR techniques with respect to the sum of squared perpendicular distances. For that purpose, the analyses were shown by an example. It was found that the sum of squared perpendicular distances of OR is smaller. Thus, it wa...
A device for identification of respective images in orthogonal localization roentgenograms
International Nuclear Information System (INIS)
Ganchev, M.
1977-01-01
Some problems which might be solved with the device, originally intended for localization of implanted radioactive wires, include: conjugation check-up of orthogonal localization roentgenograms; localization of partially screened radioactive sources in the patient body; localization of Fletcher's trapezium points in the pelvis; identification of the respective images of contrast filled lymph nodes and localization of some bone hallmarks, visible only on one of two localization roentgenograms. (author)
Czech Academy of Sciences Publication Activity Database
Vejchodský, Tomáš; Šolín, Pavel
2008-01-01
Roč. 218, č. 1 (2008), s. 192-200 ISSN 0377-0427 R&D Projects: GA AV ČR IAA100760702; GA ČR GA102/05/0629; GA ČR(CZ) GA102/07/0496 Institutional research plan: CEZ:AV0Z10190503; CEZ:AV0Z20570509 Keywords : static condensation of internal degrees of freedom * orthogonalization * ILU preconditioning Subject RIV: BA - General Mathematics Impact factor: 1.048, year: 2008
Zeininger, Lukas; Stiegler, Lisa M S; Portilla, Luis; Halik, Marcus; Hirsch, Andreas
2018-04-01
Invited for this month's cover picture is the group of Prof. Dr. Andreas Hirsch from Friedrich Alexander University (Germany). The cover picture shows shell-by-shell coated nanoparticle 'chameleons'-wet-chemically surface-modified nanoparticles that can reversibly adjust their dispersibility to entirely orthogonal solvent environments. Read the full text of their Full Paper at https://doi.org/10.1002/open.201800011.
Darboux partners of pseudoscalar Dirac potentials associated with exceptional orthogonal polynomials
Energy Technology Data Exchange (ETDEWEB)
Schulze-Halberg, Axel, E-mail: xbataxel@gmail.com [Department of Mathematics and Actuarial Science, Indiana University Northwest, 3400 Broadway, Gary, IN 46408 (United States); Department of Physics, Indiana University Northwest, 3400 Broadway, Gary, IN 46408 (United States); Roy, Barnana, E-mail: barnana@isical.ac.in [Physics and Applied Mathematics Unit, Indian Statistical Institute, Kolkata 700108 (India)
2014-10-15
We introduce a method for constructing Darboux (or supersymmetric) pairs of pseudoscalar and scalar Dirac potentials that are associated with exceptional orthogonal polynomials. Properties of the transformed potentials and regularity conditions are discussed. As an application, we consider a pseudoscalar Dirac potential related to the Schrödinger model for the rationally extended radial oscillator. The pseudoscalar partner potentials are constructed under the first- and second-order Darboux transformations.
Schmitt, Margaret A; Biddle, Wil; Fisk, John Domenic
2018-04-18
The relative quantitative importance of the factors that determine the fidelity of translation is largely unknown, which makes predicting the extent to which the degeneracy of the genetic code can be broken challenging. Our strategy of using orthogonal tRNA/aminoacyl tRNA synthetase pairs to precisely direct the incorporation of a single amino acid in response to individual sense and nonsense codons provides a suite of related data with which to examine the plasticity of the code. Each directed sense codon reassignment measurement is an in vivo competition experiment between the introduced orthogonal translation machinery and the natural machinery in E. coli. This report discusses 20 new, related genetic codes, in which a targeted E. coli wobble codon is reassigned to tyrosine utilizing the orthogonal tyrosine tRNA/aminoacyl tRNA synthetase pair from Methanocaldococcus jannaschii. One at a time, reassignment of each targeted sense codon to tyrosine is quantified in cells by measuring the fluorescence of GFP variants in which the essential tyrosine residue is encoded by a non-tyrosine codon. Significantly, every wobble codon analyzed may be partially reassigned with efficiencies ranging from 0.8% to 41%. The accumulation of the suite of data enables a qualitative dissection of the relative importance of the factors affecting the fidelity of translation. While some correlation was observed between sense codon reassignment and either competing endogenous tRNA abundance or changes in aminoacylation efficiency of the altered orthogonal system, no single factor appears to predominately drive translational fidelity. Evaluation of relative cellular fitness in each of the 20 quantitatively-characterized proteome-wide tyrosine substitution systems suggests that at a systems level, E. coli is robust to missense mutations.
Numerical stability of orthogonalization methods with a non-standard inner product
Czech Academy of Sciences Publication Activity Database
Rozložník, Miroslav; Tůma, Miroslav; Smoktunowicz, A.; Kopal, J.
2012-01-01
Roč. 52, č. 4 (2012), s. 1035-1058 ISSN 0006-3835 R&D Projects: GA ČR(CZ) GAP108/11/0853; GA AV ČR IAA100300802 Institutional support: RVO:67985807 Keywords : orthogonalization schemes * QR factorization * Gram–Schmidt process * preconditioning * rounding error analysis Subject RIV: BA - General Mathematics Impact factor: 0.977, year: 2012
Czech Academy of Sciences Publication Activity Database
Rozložník, Miroslav; Okulicka-Dłużewska, F.; Smoktunowicz, A.
2015-01-01
Roč. 36, č. 2 (2015), s. 727-751 ISSN 0895-4798 R&D Projects: GA ČR(CZ) GAP108/11/0853 Institutional support: RVO:67985807 Keywords : symmetric indefinite matrices * Cholesky-like factorization * orthogonalization techniques * indefinite bilinear forms * Gram-Schmidt process * rounding error analysis Subject RIV: BA - General Mathematics Impact factor: 1.883, year: 2015
Strict optical orthogonal codes for purely asynchronous code-division multiple-access applications
Zhang, Jian-Guo
1996-12-01
Strict optical orthogonal codes are presented for purely asynchronous optical code-division multiple-access (CDMA) applications. The proposed code can strictly guarantee the peaks of its cross-correlation functions and the sidelobes of any of its autocorrelation functions to have a value of 1 in purely asynchronous data communications. The basic theory of the proposed codes is given. An experiment on optical CDMA systems is also demonstrated to verify the characteristics of the proposed code.
International Nuclear Information System (INIS)
Morhac, M.; Matousek, V.
2008-01-01
The efficient algorithm to compress multidimensional symmetrical γ-ray events is presented. The reduction of data volume can be achieved due to both the symmetry of the γ-ray spectra and compression capabilities of the employed adaptive orthogonal transform. Illustrative examples prove in the favor of the proposed compression algorithm. The algorithm was implemented for on-line compression of events. Acquired compressed data can be later processed in an interactive way
An ACE-based Nonlinear Extension to Traditional Empirical Orthogonal Function Analysis
DEFF Research Database (Denmark)
Hilger, Klaus Baggesen; Nielsen, Allan Aasbjerg; Andersen, Ole
2001-01-01
This paper shows the application of the empirical orthogonal unctions/principal component transformation on global sea surface height and temperature data from 1996 and 1997. A nonlinear correlation analysis of the transformed data is proposed and performed by applying the alternating conditional...... expectations algorithm. New canonical variates are found that indicate that the highest correlation between ocean temperature and height is associated with the build-up of the El Niño during the last half of 1997....
International Nuclear Information System (INIS)
Ginejtite, V.L.; Balyavichyus, L.Z.
1979-01-01
Some shortcomings of the semiempirical method CNDO/1 (complete naglect of differential overlap) taking into account wave function orthogonalities of outer valence electrons to inner shells are being explained. To avoid these shortcomings the introduction of pseudopotential is recommended. Addition of the potential excludes overestimation of attraction among chemically unbounded atoms, corrects underestimation of the single, double and triple S-S coupling, gives reasons for some suppositions of the semiempirical methods, gives a truthful distribution of the electronic levels
Energy Technology Data Exchange (ETDEWEB)
Schulze-Halberg, Axel, E-mail: axgeschu@iun.edu [Department of Mathematics and Actuarial Science, Indiana University Northwest, 3400 Broadway, Gary IN 46408 (United States); Department of Physics, Indiana University Northwest, 3400 Broadway, Gary IN 46408 (United States); Roy, Pinaki, E-mail: pinaki@isical.ac.in [Physics and Applied Mathematics Unit, Indian Statistical Institute, Kolkata 700108 (India)
2017-03-15
We construct energy-dependent potentials for which the Schrödinger equations admit solutions in terms of exceptional orthogonal polynomials. Our method of construction is based on certain point transformations, applied to the equations of exceptional Hermite, Jacobi and Laguerre polynomials. We present several examples of boundary-value problems with energy-dependent potentials that admit a discrete spectrum and the corresponding normalizable solutions in closed form.
Czech Academy of Sciences Publication Activity Database
Liesen, J.; Strakoš, Zdeněk
2008-01-01
Roč. 50, č. 3 (2008), s. 485-503 ISSN 0036-1445 R&D Projects: GA AV ČR 1ET400300415; GA AV ČR IAA100300802 Institutional research plan: CEZ:AV0Z10300504 Keywords : Krylov subspace methods * orthogonal bases * short reccurences * conjugate gradient -like methods Subject RIV: IN - Informatics, Computer Science Impact factor: 2.739, year: 2008
Orthogonal linear polarization tunable-beat ring laser with a superluminescent diode
Energy Technology Data Exchange (ETDEWEB)
Takahashi, Y.; Yoshino, T. [Department of Electronic Engineering, Faculty of Engineering, Gunma University, 1-5-1 Tenjin-cho, Kiryu, Gunma 376 (Japan)
1997-09-01
An orthogonal linear polarization operated ring laser with a superluminescent diode has been demonstrated to generate a tunable optical beat signal. The ring cavity contains a superluminescent diode as the optical gain medium, Faraday rotators, and a variable phase retarder (Babinet-Soleil compensator). By controlling the retarder, we changed the beat frequency in the range from a few tens of megahertz to 100 MHz. {copyright} 1997 Optical Society of America
Energy Technology Data Exchange (ETDEWEB)
Sanginés, R., E-mail: roberto.sangines@ccadet.unam.mx; Sobral, H.
2013-10-01
The evolution of laser induced ablation plume on aluminum targets has been investigated in orthogonal pre-ablation double pulse scheme at atmospheric pressure from the earliest stages of plasma evolution. Time-resolved emission spectra from neutrals, singly- and doubly-ionized species obtained with the double pulse experiment have been compared with those from the single pulse configuration. Signal-to-noise enhancement reaches values of up to 15 depending on the analyzed species; and the lower the charge state the later its maximum signal-to-noise ratio is reached. Ablation plume dynamics was monitored from 10 ns after the plasma onset via shadowgraphy and fast-photography with narrow interference filters to follow the evolution of individual species. Results show that ionic species from the target are located at the plasma core while nitrogen from the background air is found at the plume peripheral. Initially both configurations exhibit similar ablation plume sizes and their expansions were successfully fitted with the strong explosion model for the first 500 ns. At later times a good agreement was obtained by using the drag model, which predicts that the plume expansion eventually stops due to interaction with the background gas particles. The emission enhancement measured in the double pulse scheme is discussed in terms of the models describing the plume dynamics. - Highlights: • Production of 2 + ions at the earliest stages of plasma evolution • The higher the charge state the inner the location within the ablation plume. • The expansion rate of the second (ablation) plume was measured. • Shock and drag models successfully fit the ablation shock front expansion.
Collinear integration affects visual search at V1.
Chow, Hiu Mei; Jingling, Li; Tseng, Chia-huei
2013-08-29
Perceptual grouping plays an indispensable role in figure-ground segregation and attention distribution. For example, a column pops out if it contains element bars orthogonal to uniformly oriented element bars. Jingling and Tseng (2013) have reported that contextual grouping in a column matters to visual search behavior: When a column is grouped into a collinear (snakelike) structure, a target positioned on it became harder to detect than on other noncollinear (ladderlike) columns. How and where perceptual grouping interferes with selective attention is still largely unknown. This article contributes to this little-studied area by asking whether collinear contour integration interacts with visual search before or after binocular fusion. We first identified that the previously mentioned search impairment occurs with a distractor of five or nine elements but not one element in a 9 × 9 search display. To pinpoint the site of this effect, we presented the search display with a short collinear bar (one element) to one eye and the extending collinear bars to the other eye, such that when properly fused, the combined binocular collinear length (nine elements) exceeded the critical length. No collinear search impairment was observed, implying that collinear information before binocular fusion shaped participants' search behavior, although contour extension from the other eye after binocular fusion enhanced the effect of collinearity on attention. Our results suggest that attention interacts with perceptual grouping as early as V1.
The profile of attention differs between locations orthogonal to and in line with reach direction.
Stewart, Emma E M; Ma-Wyatt, Anna
2017-11-01
People make movements in a variety of directions when interacting with the world around them. It has been well documented that attention shifts to the goal of an upcoming movement, whether the movement is a saccade or a reach. However, recent evidence suggests that the direction of a movement may influence the spatial spread of attention (Stewart & Ma-Wyatt, 2015, Journal of Vision, 15(5), 10). We investigated whether the spatiotemporal profile of attention differs depending on where that location is situated relative to the direction of movement, and if this pattern is consistent across different movement effectors. We compared attentional facilitation at locations in line with or orthogonal to the movement, for reach-only, reach-plus-saccade, and saccade-only conditions. Results show that the spatiotemporal profile of attention differs across different movement combinations, and is also different at target locations orthogonal to and in line with the movement direction. Specifically, when a reach alone was made, there was a general decrease in attention at all locations during the movement and a general increase in attention at all locations with a saccade only. However, the concurrent reach and saccade condition showed a premovement attentional facilitation at locations orthogonal to movement direction, but not those in line with the movement direction. These results suggest attentional guidance may be more important at differing time points, depending on the type of movement.
Non-orthogonal transmission in multi-user systems with Grassmannian beamforming
Xia, Minghua
2011-06-01
Aiming to achieve the sum-rate capacity in multiuser multi-input multi-output (MIMO) channels with N t antennas implemented at the transmitter, opportunistic beamforming (OBF) generates N t orthonormal beams and serves N t users during each transmission, which results in high scheduling delay over the users, especially in densely populated wireless networks. Non-orthogonal OBF with more than N t transmit beams can be exploited to serve more users simultaneously and further decreases scheduling delay. However, the inter-beam interference will inevitably deteriorate the sum-rate. Therefore, there is a tradeoff between the sum-rate and the increasing number of transmit beams. In this context, the sum-rate of non-orthogonal OBF with N > N t beams are studied, where the transmitter is based on the Grassmannian beamforming. Our results show that non-orthogonal OBF is an interference-limited system. Moreover, when the inter-beam interference reaches its minimum for fixed N t and N, the sum-rate scales as N ln (N/N-N t) and it decreases monotonically with N for fixed N t. Numerical results corroborate the accuracy of our analyses. © 2011 IEEE.
A novel calibration method for non-orthogonal shaft laser theodolite measurement system
Energy Technology Data Exchange (ETDEWEB)
Wu, Bin, E-mail: wubin@tju.edu.cn, E-mail: xueting@tju.edu.cn; Yang, Fengting; Ding, Wen [State Key Laboratory of Precision Measuring Technology and Instruments, Tianjin University, Tianjin 300072 (China); Xue, Ting, E-mail: wubin@tju.edu.cn, E-mail: xueting@tju.edu.cn [College of Electrical Engineering and Automation, Tianjin Key Laboratory of Process Measurement and Control, Tianjin University, Tianjin 300072 (China)
2016-03-15
Non-orthogonal shaft laser theodolite (N-theodolite) is a new kind of large-scale metrological instrument made up by two rotary tables and one collimated laser. There are three axes for an N-theodolite. According to naming conventions in traditional theodolite, rotary axes of two rotary tables are called as horizontal axis and vertical axis, respectively, and the collimated laser beam is named as sight axis. And the difference between N-theodolite and traditional theodolite is obvious, since the former one with no orthogonal and intersecting accuracy requirements. So the calibration method for traditional theodolite is no longer suitable for N-theodolite, while the calibration method applied currently is really complicated. Thus this paper introduces a novel calibration method for non-orthogonal shaft laser theodolite measurement system to simplify the procedure and to improve the calibration accuracy. A simple two-step process, calibration for intrinsic parameters and for extrinsic parameters, is proposed by the novel method. And experiments have shown its efficiency and accuracy.
Sparse orthogonal population representation of spatial context in the retrosplenial cortex.
Mao, Dun; Kandler, Steffen; McNaughton, Bruce L; Bonin, Vincent
2017-08-15
Sparse orthogonal coding is a key feature of hippocampal neural activity, which is believed to increase episodic memory capacity and to assist in navigation. Some retrosplenial cortex (RSC) neurons convey distributed spatial and navigational signals, but place-field representations such as observed in the hippocampus have not been reported. Combining cellular Ca 2+ imaging in RSC of mice with a head-fixed locomotion assay, we identified a population of RSC neurons, located predominantly in superficial layers, whose ensemble activity closely resembles that of hippocampal CA1 place cells during the same task. Like CA1 place cells, these RSC neurons fire in sequences during movement, and show narrowly tuned firing fields that form a sparse, orthogonal code correlated with location. RSC 'place' cell activity is robust to environmental manipulations, showing partial remapping similar to that observed in CA1. This population code for spatial context may assist the RSC in its role in memory and/or navigation.Neurons in the retrosplenial cortex (RSC) encode spatial and navigational signals. Here the authors use calcium imaging to show that, similar to the hippocampus, RSC neurons also encode place cell-like activity in a sparse orthogonal representation, partially anchored to the allocentric cues on the linear track.
International Nuclear Information System (INIS)
Huang, Jinhong; Guo, Li; Feng, Qianjin; Chen, Wufan; Feng, Yanqiu
2015-01-01
Image reconstruction from undersampled k-space data accelerates magnetic resonance imaging (MRI) by exploiting image sparseness in certain transform domains. Employing image patch representation over a learned dictionary has the advantage of being adaptive to local image structures and thus can better sparsify images than using fixed transforms (e.g. wavelets and total variations). Dictionary learning methods have recently been introduced to MRI reconstruction, and these methods demonstrate significantly reduced reconstruction errors compared to sparse MRI reconstruction using fixed transforms. However, the synthesis sparse coding problem in dictionary learning is NP-hard and computationally expensive. In this paper, we present a novel sparsity-promoting orthogonal dictionary updating method for efficient image reconstruction from highly undersampled MRI data. The orthogonality imposed on the learned dictionary enables the minimization problem in the reconstruction to be solved by an efficient optimization algorithm which alternately updates representation coefficients, orthogonal dictionary, and missing k-space data. Moreover, both sparsity level and sparse representation contribution using updated dictionaries gradually increase during iterations to recover more details, assuming the progressively improved quality of the dictionary. Simulation and real data experimental results both demonstrate that the proposed method is approximately 10 to 100 times faster than the K-SVD-based dictionary learning MRI method and simultaneously improves reconstruction accuracy. (paper)
Jitter-Robust Orthogonal Hermite Pulses for Ultra-Wideband Impulse Radio Communications
Directory of Open Access Journals (Sweden)
Ryuji Kohno
2005-03-01
Full Text Available The design of a class of jitter-robust, Hermite polynomial-based, orthogonal pulses for ultra-wideband impulse radio (UWB-IR communications systems is presented. A unified and exact closed-form expression of the auto- and cross-correlation functions of Hermite pulses is provided. Under the assumption that jitter values are sufficiently smaller than pulse widths, this formula is used to decompose jitter-shifted pulses over an orthonormal basis of the Hermite space. For any given jitter probability density function (pdf, the decomposition yields an equivalent distribution of N-by-N matrices which simplifies the convolutional jitter channel model onto a multiplicative matrix model. The design of jitter-robust orthogonal pulses is then transformed into a generalized eigendecomposition problem whose solution is obtained with a Jacobi-like simultaneous diagonalization algorithm applied over a subset of samples of the channel matrix distribution. Examples of the waveforms obtained with the proposed design and their improved auto- and cross-correlation functions are given. Simulation results are presented, which demonstrate the superior performance of a pulse-shape modulated (PSM- UWB-IR system using the proposed pulses, over the same system using conventional orthogonal Hermite pulses, in jitter channels with additive white Gaussian noise (AWGN.
Critical points for finite Fibonacci chains of point delta-interactions and orthogonal polynomials
International Nuclear Information System (INIS)
De Prunele, E
2011-01-01
For a one-dimensional Schroedinger operator with a finite number n of point delta-interactions with a common intensity, the parameters are the intensity, the n - 1 intercenter distances and the mass. Critical points are points in the parameters space of the Hamiltonian where one bound state appears or disappears. The study of critical points for Hamiltonians with point delta-interactions arranged along a Fibonacci chain is shown to be closely related to the study of the so-called Fibonacci operator, a discrete one-dimensional Schroedinger-type operator, which occurs in the context of tight binding Hamiltonians. These critical points are the zeros of orthogonal polynomials previously studied in the context of special diatomic linear chains with elastic nearest-neighbor interaction. Properties of the zeros (location, asymptotic behavior, gaps, ...) are investigated. The perturbation series from the solvable periodic case is determined. The measure which yields orthogonality is investigated numerically from the zeros. It is shown that the transmission coefficient at zero energy can be expressed in terms of the orthogonal polynomials and their associated polynomials. In particular, it is shown that when the number of point delta-interactions is equal to a Fibonacci number minus 1, i.e. when the intervals between point delta-interactions form a palindrome, all the Fibonacci chains at critical points are completely transparent at zero energy. (paper)
A Dynamic BI–Orthogonal Field Equation Approach to Efficient Bayesian Inversion
Directory of Open Access Journals (Sweden)
Tagade Piyush M.
2017-06-01
Full Text Available This paper proposes a novel computationally efficient stochastic spectral projection based approach to Bayesian inversion of a computer simulator with high dimensional parametric and model structure uncertainty. The proposed method is based on the decomposition of the solution into its mean and a random field using a generic Karhunen-Loève expansion. The random field is represented as a convolution of separable Hilbert spaces in stochastic and spatial dimensions that are spectrally represented using respective orthogonal bases. In particular, the present paper investigates generalized polynomial chaos bases for the stochastic dimension and eigenfunction bases for the spatial dimension. Dynamic orthogonality is used to derive closed-form equations for the time evolution of mean, spatial and the stochastic fields. The resultant system of equations consists of a partial differential equation (PDE that defines the dynamic evolution of the mean, a set of PDEs to define the time evolution of eigenfunction bases, while a set of ordinary differential equations (ODEs define dynamics of the stochastic field. This system of dynamic evolution equations efficiently propagates the prior parametric uncertainty to the system response. The resulting bi-orthogonal expansion of the system response is used to reformulate the Bayesian inference for efficient exploration of the posterior distribution. The efficacy of the proposed method is investigated for calibration of a 2D transient diffusion simulator with an uncertain source location and diffusivity. The computational efficiency of the method is demonstrated against a Monte Carlo method and a generalized polynomial chaos approach.
Lu, Zhao; Sun, Jing; Butts, Kenneth
2014-05-01
Support vector regression for approximating nonlinear dynamic systems is more delicate than the approximation of indicator functions in support vector classification, particularly for systems that involve multitudes of time scales in their sampled data. The kernel used for support vector learning determines the class of functions from which a support vector machine can draw its solution, and the choice of kernel significantly influences the performance of a support vector machine. In this paper, to bridge the gap between wavelet multiresolution analysis and kernel learning, the closed-form orthogonal wavelet is exploited to construct new multiscale asymmetric orthogonal wavelet kernels for linear programming support vector learning. The closed-form multiscale orthogonal wavelet kernel provides a systematic framework to implement multiscale kernel learning via dyadic dilations and also enables us to represent complex nonlinear dynamics effectively. To demonstrate the superiority of the proposed multiscale wavelet kernel in identifying complex nonlinear dynamic systems, two case studies are presented that aim at building parallel models on benchmark datasets. The development of parallel models that address the long-term/mid-term prediction issue is more intricate and challenging than the identification of series-parallel models where only one-step ahead prediction is required. Simulation results illustrate the effectiveness of the proposed multiscale kernel learning.
Huang, Jinhong; Guo, Li; Feng, Qianjin; Chen, Wufan; Feng, Yanqiu
2015-07-21
Image reconstruction from undersampled k-space data accelerates magnetic resonance imaging (MRI) by exploiting image sparseness in certain transform domains. Employing image patch representation over a learned dictionary has the advantage of being adaptive to local image structures and thus can better sparsify images than using fixed transforms (e.g. wavelets and total variations). Dictionary learning methods have recently been introduced to MRI reconstruction, and these methods demonstrate significantly reduced reconstruction errors compared to sparse MRI reconstruction using fixed transforms. However, the synthesis sparse coding problem in dictionary learning is NP-hard and computationally expensive. In this paper, we present a novel sparsity-promoting orthogonal dictionary updating method for efficient image reconstruction from highly undersampled MRI data. The orthogonality imposed on the learned dictionary enables the minimization problem in the reconstruction to be solved by an efficient optimization algorithm which alternately updates representation coefficients, orthogonal dictionary, and missing k-space data. Moreover, both sparsity level and sparse representation contribution using updated dictionaries gradually increase during iterations to recover more details, assuming the progressively improved quality of the dictionary. Simulation and real data experimental results both demonstrate that the proposed method is approximately 10 to 100 times faster than the K-SVD-based dictionary learning MRI method and simultaneously improves reconstruction accuracy.
International Nuclear Information System (INIS)
Paulinelli, H G; De Souza, S M; Rojas, Onofre
2013-01-01
In this paper we explore the entanglement in an orthogonal dimer-plaquette Ising–Heisenberg chain, assembled between plaquette edges, also known as orthogonal dimer plaquettes. The quantum entanglement properties involving an infinite chain structure are quite important, not only because the mathematical calculation is cumbersome but also because real materials are well represented by infinite chains. Using the local gauge symmetry of this model, we are able to map onto a simple spin-1 like Ising and spin-1/2 Heisenberg dimer model with single effective ion anisotropy. Thereafter this model can be solved using the decoration transformation and transfer matrix approach. First, we discuss the phase diagram at zero temperature of this model, where we find five ground states, one ferromagnetic, one antiferromagnetic, one triplet–triplet disordered and one triplet–singlet disordered phase, beside a dimer ferromagnetic–antiferromagnetic phase. In addition, we discuss the thermodynamic properties such as entropy, where we display the residual entropy. Furthermore, using the nearest site correlation function it is possible also to analyze the pairwise thermal entanglement for both orthogonal dimers. Additionally, we discuss the threshold temperature of the entangled region as a function of Hamiltonian parameters. We find a quite interesting thin reentrance threshold temperature for one of the dimers, and we also discuss the differences and similarities for both dimers. (paper)
No need for external orthogonality in subsystem density-functional theory.
Unsleber, Jan P; Neugebauer, Johannes; Jacob, Christoph R
2016-08-03
Recent reports on the necessity of using externally orthogonal orbitals in subsystem density-functional theory (SDFT) [Annu. Rep. Comput. Chem., 8, 2012, 53; J. Phys. Chem. A, 118, 2014, 9182] are re-investigated. We show that in the basis-set limit, supermolecular Kohn-Sham-DFT (KS-DFT) densities can exactly be represented as a sum of subsystem densities, even if the subsystem orbitals are not externally orthogonal. This is illustrated using both an analytical example and in basis-set free numerical calculations for an atomic test case. We further show that even with finite basis sets, SDFT calculations using accurate reconstructed potentials can closely approach the supermolecular KS-DFT density, and that the deviations between SDFT and KS-DFT decrease as the basis-set limit is approached. Our results demonstrate that formally, there is no need to enforce external orthogonality in SDFT, even though this might be a useful strategy when developing projection-based DFT embedding schemes.
Eising, Selma; Xin, Bo-Tao; Kleinpenning, Fleur; Heming, Juriaan; Florea, Bogdan; Overkleeft, Herman; Bonger, Kimberly Michelle
2018-05-28
Bioorthogonal chemistry can be used for the selective modification of biomolecules without interfering with any other functionality present. Recent developments in the field provided orthogonal bioorthogonal reactions for modification of multiple biomolecules simultaneously. During our research, we have observed exceptional high reaction rates in the bioorthogonal inverse electron-demand Diels-Alder (iEDDA) reaction between non-strained vinylboronic acids (VBAs) and dipyridyl-s-tetrazines relative to that of tetrazines bearing a methyl or phenyl substituent. As VBAs are mild Lewis acids, we hypothesize that coordination of the pyridyl nitrogen to the boronic acid promotes the tetrazine ligation. Here, we explore the molecular basis and scope of the VBA-tetrazine ligation in more detail and benefit from its unique reactivity in the simultaneous orthogonal tetrazine labelling of two proteins modified with VBA and norbornene, a widely used strained alkene. We further show that the two orthogonal iEDDA reactions can be carried out in living cells by labelling of the proteasome using a non-selective probe equipped with a VBA and a subunit-selective one bearing a norbornene. © 2018 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
A new design and rationale for 3D orthogonally oversampled k-space trajectories.
Pipe, James G; Zwart, Nicholas R; Aboussouan, Eric A; Robison, Ryan K; Devaraj, Ajit; Johnson, Kenneth O
2011-11-01
A novel center-out 3D trajectory for sampling magnetic resonance data is presented. The trajectory set is based on a single Fermat spiral waveform, which is substantially undersampled in the center of k-space. Multiple trajectories are combined in a "stacked cone" configuration to give very uniform sampling throughout a "hub," which is very efficient in terms of gradient performance and uniform trajectory spacing. The fermat looped, orthogonally encoded trajectories (FLORET) design produces less gradient-efficient trajectories near the poles, so multiple orthogonal hub designs are shown. These multihub designs oversample k-space twice with orthogonal trajectories, which gives unique properties but also doubles the minimum scan time for critical sampling of k-space. The trajectory is shown to be much more efficient than the conventional stack of cones trajectory, and has nearly the same signal-to-noise ratio efficiency (but twice the minimum scan time) as a stack of spirals trajectory. As a center-out trajectory, it provides a shorter minimum echo time than stack of spirals, and its spherical k-space coverage can dramatically reduce Gibbs ringing. Copyright © 2011 Wiley Periodicals, Inc.
Myanmar Language Search Engine
Pann Yu Mon; Yoshiki Mikami
2011-01-01
With the enormous growth of the World Wide Web, search engines play a critical role in retrieving information from the borderless Web. Although many search engines are available for the major languages, but they are not much proficient for the less computerized languages including Myanmar. The main reason is that those search engines are not considering the specific features of those languages. A search engine which capable of searching the Web documents written in those languages is highly n...
Armstrong, Mark
2016-01-01
The paper discusses situations in which consumers search through their options in a deliberate order, in contrast to more familiar models with random search. Topics include: network effects (consumers may be better off following the same search order as other consumers); the use of price and non-price advertising to direct search; the impact of consumers starting a new search with their previous supplier; the incentive sellers have to merge or co-locate with other sellers; and the incentive a...
International Nuclear Information System (INIS)
Collier, J.
1990-01-01
The arguments for and against the fast breeder reactor are debated. The case for the fast reactor is that the world energy demand will increase due to increasing population over the next forty years and that the damage to the global environment from burning fossil fuels which contribute to the greenhouse effect. Nuclear fission is the only large scale energy source which can achieve a cut in the use of carbon based fuels although energy conservation and renewable sources will also be important. Fast reactors produce more energy from uranium than other types of (thermal) reactors such as AGRs and PWRs. Fast reactors would be important from about 2020 onwards especially as by then many thermal reactors will need to be replaced. Fast reactors are also safer than normal reactors. The arguments against fast reactors are largely economic. The cost, especially the capital cost is very high. The viability of the technology is also questioned. (UK)
International Nuclear Information System (INIS)
Davis, D.A.; Baker, M.A.W.; Hall, R.S.
1990-01-01
Following submission of written evidence, the Energy Committee members asked questions of three witnesses from the Central Electricity Generating Board and Nuclear Electric (which will be the government owned company running nuclear power stations after privatisation). Both questions and answers are reported verbatim. The points raised include where the responsibility for the future fast reactor programme should lie, with government only or with private enterprise or both and the viability of fast breeder reactors in the future. The case for the fast reactor was stated as essentially strategic not economic. This raised the issue of nuclear cost which has both a construction and a decommissioning element. There was considerable discussion as to the cost of building a European Fast reactor and the cost of the electricity it would generate compared with PWR type reactors. The likely demand for fast reactors will not arrive for 20-30 years and the need to build a fast reactor now is questioned. (UK)
International Nuclear Information System (INIS)
Heinzel, V.
1975-01-01
The author gives a survey of 'fast breeder reactors'. In detail the process of breeding, the reasons for the development of fast breeders, the possible breeder reactors, the design criteria, fuels, cladding, coolant, and safety aspects are reported on. Design data of some experimental reactors already in operation are summarized in stabular form. 300 MWe Prototype-Reactors SNR-300 and PFR are explained in detail and data of KWU helium-cooled fast breeder reactors are given. (HR) [de