WorldWideScience

Sample records for hidden line algorithm

  1. On quantum algorithms for noncommutative hidden subgroups

    Energy Technology Data Exchange (ETDEWEB)

    Ettinger, M. [Los Alamos National Lab., NM (United States); Hoeyer, P. [Odense Univ. (Denmark)

    1998-12-01

    Quantum algorithms for factoring and discrete logarithm have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the possibility of extending this general viewpoint to finding hidden subgroups of noncommutative groups. The authors present a quantum algorithm for the special case of dihedral groups which determines the hidden subgroup in a linear number of calls to the input function. They also explore the difficulties of developing an algorithm to process the data to explicitly calculate a generating set for the subgroup. A general framework for the noncommutative hidden subgroup problem is discussed and they indicate future research directions.

  2. The hidden line removel algorithm and its implementation of 3D wireframe model%三维线框模型物体的隐藏线消除算法与实现

    Institute of Scientific and Technical Information of China (English)

    李军民; 袁青

    2012-01-01

    目的 研究计算机图形学中隐藏面和隐藏线的消除,以便更直观、更形象地获取地理、工程信息.方法 剔除指定视点下明显不可见的面和线,获取可见线之后对,对有线子段用中点判断法.结果 正确地得到了三维物体的投影图.结论 该算法能成功地应用在仿真模拟和几何造型系统中,减少了二步消隐过程中直线直交计算的工作量,具有较好的消隐效率.%Aim In order to get a direct and vivid geographic or engineering information, in this article the elimination of hidden surface and hidden line in computer graphics is studied. Methods To clear obvious hidden lines and surface at the assigned view point at first, then get the visible lines, and a the Middle-Point algorithm to the fragments of the line. Results The correct projection of three-dimensional objects is obtained. Conclusion This algorithm can be well applyed in the area of analogue simulation and geometric model system.

  3. Genetic Algorithms Principles Towards Hidden Markov Model

    Directory of Open Access Journals (Sweden)

    Nabil M. Hewahi

    2011-10-01

    Full Text Available In this paper we propose a general approach based on Genetic Algorithms (GAs to evolve Hidden Markov Models (HMM. The problem appears when experts assign probability values for HMM, they use only some limited inputs. The assigned probability values might not be accurate to serve in other cases related to the same domain. We introduce an approach based on GAs to find
    out the suitable probability values for the HMM to be mostly correct in more cases than what have been used to assign the probability values.

  4. Search algorithms, hidden labour and information control

    Directory of Open Access Journals (Sweden)

    Paško Bilić

    2016-06-01

    Full Text Available The paper examines some of the processes of the closely knit relationship between Google’s ideologies of neutrality and objectivity and global market dominance. Neutrality construction comprises an important element sustaining the company’s economic position and is reflected in constant updates, estimates and changes to utility and relevance of search results. Providing a purely technical solution to these issues proves to be increasingly difficult without a human hand in steering algorithmic solutions. Search relevance fluctuates and shifts through continuous tinkering and tweaking of the search algorithm. The company also uses third parties to hire human raters for performing quality assessments of algorithmic updates and adaptations in linguistically and culturally diverse global markets. The adaptation process contradicts the technical foundations of the company and calculations based on the initial Page Rank algorithm. Annual market reports, Google’s Search Quality Rating Guidelines, and reports from media specialising in search engine optimisation business are analysed. The Search Quality Rating Guidelines document provides a rare glimpse into the internal architecture of search algorithms and the notions of utility and relevance which are presented and structured as neutral and objective. Intertwined layers of ideology, hidden labour of human raters, advertising revenues, market dominance and control are discussed throughout the paper.

  5. Search algorithms, hidden labour and information control

    Directory of Open Access Journals (Sweden)

    Paško Bilić

    2016-06-01

    Full Text Available The paper examines some of the processes of the closely knit relationship between Google’s ideologies of neutrality and objectivity and global market dominance. Neutrality construction comprises an important element sustaining the company’s economic position and is reflected in constant updates, estimates and changes to utility and relevance of search results. Providing a purely technical solution to these issues proves to be increasingly difficult without a human hand in steering algorithmic solutions. Search relevance fluctuates and shifts through continuous tinkering and tweaking of the search algorithm. The company also uses third parties to hire human raters for performing quality assessments of algorithmic updates and adaptations in linguistically and culturally diverse global markets. The adaptation process contradicts the technical foundations of the company and calculations based on the initial Page Rank algorithm. Annual market reports, Google’s Search Quality Rating Guidelines, and reports from media specialising in search engine optimisation business are analysed. The Search Quality Rating Guidelines document provides a rare glimpse into the internal architecture of search algorithms and the notions of utility and relevance which are presented and structured as neutral and objective. Intertwined layers of ideology, hidden labour of human raters, advertising revenues, market dominance and control are discussed throughout the paper.

  6. Bayesian online algorithms for learning in discrete Hidden Markov Models

    OpenAIRE

    Alamino, Roberto C.; Caticha, Nestor

    2008-01-01

    We propose and analyze two different Bayesian online algorithms for learning in discrete Hidden Markov Models and compare their performance with the already known Baldi-Chauvin Algorithm. Using the Kullback-Leibler divergence as a measure of generalization we draw learning curves in simplified situations for these algorithms and compare their performances.

  7. Engineering of Algorithms for Hidden Markov models and Tree Distances

    DEFF Research Database (Denmark)

    Sand, Andreas

    grown exponentially because of drastic improvements in the technology behind DNA and RNA sequencing, and focus on the research field has increased due to its potential to expand our knowledge about biological mechanisms and to improve public health. There has therefore been a continuously growing demand...... of the algorithms to exploit the parallel architecture of modern computers. In this PhD dissertation, I present my work with algorithmic optimizations and parallelizations in primarily two areas in algorithmic bioinformatics: algorithms for analyzing hidden Markov models and algorithms for computing distance...... measures between phylogenetic trees. Hidden Markov models is a class of probabilistic models that is used in a number of core applications in bioinformatics such as modeling of proteins, gene finding and reconstruction of species and population histories. I show how a relatively simple parallelization can...

  8. Evolving the Topology of Hidden Markov Models using Evolutionary Algorithms

    DEFF Research Database (Denmark)

    Thomsen, Réne

    2002-01-01

    Hidden Markov models (HMM) are widely used for speech recognition and have recently gained a lot of attention in the bioinformatics community, because of their ability to capture the information buried in biological sequences. Usually, heuristic algorithms such as Baum-Welch are used to estimate...

  9. Hidden blazars and emission line variability of high redshift quasars

    Directory of Open Access Journals (Sweden)

    Feng Ma

    2001-01-01

    Full Text Available We have carried out a survey to search for hidden blazars in a sample of z 2 radio{loud quasars. The idea is based on our prediction that we should be able to see large C IV line variability not associated with observed continuum variations or most other emission lines in every radio{loud quasar. Here we report the initial results including the discovery of large C IV line variations in two quasars.

  10. Heterogeneous Web Data Extraction Algorithm Based On Modified Hidden Conditional Random Fields

    OpenAIRE

    Cui Cheng

    2014-01-01

    As it is of great importance to extract useful information from heterogeneous Web data, in this paper, we propose a novel heterogeneous Web data extraction algorithm using a modified hidden conditional random fields model. Considering the traditional linear chain based conditional random fields can not effectively solve the problem of complex and heterogeneous Web data extraction, we modify the standard hidden conditional random fields in three aspects, which are 1) Using the hidden Markov mo...

  11. Efficient decoding algorithms for generalized hidden Markov model gene finders

    Directory of Open Access Journals (Sweden)

    Delcher Arthur L

    2005-01-01

    Full Text Available Abstract Background The Generalized Hidden Markov Model (GHMM has proven a useful framework for the task of computational gene prediction in eukaryotic genomes, due to its flexibility and probabilistic underpinnings. As the focus of the gene finding community shifts toward the use of homology information to improve prediction accuracy, extensions to the basic GHMM model are being explored as possible ways to integrate this homology information into the prediction process. Particularly prominent among these extensions are those techniques which call for the simultaneous prediction of genes in two or more genomes at once, thereby increasing significantly the computational cost of prediction and highlighting the importance of speed and memory efficiency in the implementation of the underlying GHMM algorithms. Unfortunately, the task of implementing an efficient GHMM-based gene finder is already a nontrivial one, and it can be expected that this task will only grow more onerous as our models increase in complexity. Results As a first step toward addressing the implementation challenges of these next-generation systems, we describe in detail two software architectures for GHMM-based gene finders, one comprising the common array-based approach, and the other a highly optimized algorithm which requires significantly less memory while achieving virtually identical speed. We then show how both of these architectures can be accelerated by a factor of two by optimizing their content sensors. We finish with a brief illustration of the impact these optimizations have had on the feasibility of our new homology-based gene finder, TWAIN. Conclusions In describing a number of optimizations for GHMM-based gene finders and making available two complete open-source software systems embodying these methods, it is our hope that others will be more enabled to explore promising extensions to the GHMM framework, thereby improving the state-of-the-art in gene prediction

  12. Quantum algorithm for identifying hidden polynomial function graphs

    NARCIS (Netherlands)

    Decker, T.; Draisma, J.; Wocjan, P.

    2009-01-01

    We consider a natural generalization of an abelian Hidden Subgroup Problem where the subgroups and their cosets correspond to graphs of linear functions over a finite field F with d elements. The hidden functions of the generalized problem are not restricted to be linear but can also be m-variate po

  13. Belief Bisimulation for Hidden Markov Models Logical Characterisation and Decision Algorithm

    DEFF Research Database (Denmark)

    Jansen, David N.; Nielson, Flemming; Zhang, Lijun

    2012-01-01

    This paper establishes connections between logical equivalences and bisimulation relations for hidden Markov models (HMM). Both standard and belief state bisimulations are considered. We also present decision algorithms for the bisimilarities. For standard bisimilarity, an extension of the usual...

  14. Algorithms for a parallel implementation of Hidden Markov Models with a small state space

    DEFF Research Database (Denmark)

    Nielsen, Jesper; Sand, Andreas

    2011-01-01

    Two of the most important algorithms for Hidden Markov Models are the forward and the Viterbi algorithms. We show how formulating these using linear algebra naturally lends itself to parallelization. Although the obtained algorithms are slow for Hidden Markov Models with large state spaces......, they require very little communication between processors, and are fast in practice on models with a small state space. We have tested our implementation against two other imple- mentations on artificial data and observe a speed-up of roughly a factor of 5 for the forward algorithm and more than 6...... for the Viterbi algorithm. We also tested our algorithm in the Coalescent Hidden Markov Model framework, where it gave a significant speed-up....

  15. Using frame correlation algorithm in a duration distribution based hidden Markov model

    Institute of Scientific and Technical Information of China (English)

    王作英; 崔小东

    2000-01-01

    The assumption of frame independence is a widely known weakness of traditional hidden Markov model (HMM). In this paper, a frame correlation algorithm based on the duration distribution based hidden Markov model (DDBHMM) is proposed. In the algorithm, an AR model is used to depict the low pass effect of vocal tract from which stems the inertia leading to frame correlation. In the preliminary experiment of middle vocabulary speaker dependent isolated word recognition, our frame correlation algorithm outperforms the frame independent one. The average error reduction is about 20% .

  16. Algorithms for Hidden Markov Models Restricted to Occurrences of Regular Expressions

    DEFF Research Database (Denmark)

    Tataru, Paula; Sand, Andreas; Hobolth, Asger;

    2013-01-01

    Hidden Markov Models (HMMs) are widely used probabilistic models, particularly for annotating sequential data with an underlying hidden structure. Patterns in the annotation are often more relevant to study than the hidden structure itself. A typical HMM analysis consists of annotating the observed...... data using a decoding algorithm and analyzing the annotation to study patterns of interest. For example, given an HMM modeling genes in DNA sequences, the focus is on occurrences of genes in the annotation. In this paper, we define a pattern through a regular expression and present a restriction...

  17. A Convergent Differential Evolution Algorithm with Hidden Adaptation Selection for Engineering Optimization

    Directory of Open Access Journals (Sweden)

    Zhongbo Hu

    2014-01-01

    Full Text Available Many improved differential Evolution (DE algorithms have emerged as a very competitive class of evolutionary computation more than a decade ago. However, few improved DE algorithms guarantee global convergence in theory. This paper developed a convergent DE algorithm in theory, which employs a self-adaptation scheme for the parameters and two operators, that is, uniform mutation and hidden adaptation selection (haS operators. The parameter self-adaptation and uniform mutation operator enhance the diversity of populations and guarantee ergodicity. The haS can automatically remove some inferior individuals in the process of the enhancing population diversity. The haS controls the proposed algorithm to break the loop of current generation with a small probability. The breaking probability is a hidden adaptation and proportional to the changes of the number of inferior individuals. The proposed algorithm is tested on ten engineering optimization problems taken from IEEE CEC2011.

  18. Algorithmic information theory and the hidden variable question

    Science.gov (United States)

    Fuchs, Christopher

    1992-01-01

    The admissibility of certain nonlocal hidden-variable theories are explained via information theory. Consider a pair of Stern-Gerlach devices with fixed nonparallel orientations that periodically perform spin measurements on identically prepared pairs of electrons in the singlet spin state. Suppose the outcomes are recorded as binary strings l and r (with l sub n and r sub n denoting their n-length prefixes). The hidden-variable theories considered here require that there exists a recursive function which may be used to transform l sub n into r sub n for any n. This note demonstrates that such a theory cannot reproduce all the statistical predictions of quantum mechanics. Specifically, consider an ensemble of outcome pairs (l,r). From the associated probability measure, the Shannon entropies H sub n and H bar sub n for strings l sub n and pairs (l sub n, r sub n) may be formed. It is shown that such a theory requires that the absolute value of H bar sub n - H sub n be bounded - contrasting the quantum mechanical prediction that it grow with n.

  19. Optimizing the Forward Algorithm for Hidden Markov Model on IBM Roadrunner clusters

    Directory of Open Access Journals (Sweden)

    SOIMAN, S.-I.

    2015-05-01

    Full Text Available In this paper we present a parallel solution of the Forward Algorithm for Hidden Markov Models. The Forward algorithm compute a probability of a hidden state from Markov model at a certain time, this process being recursively. The whole process requires large computational resources for those models with a large number of states and long observation sequences. Our solution in order to reduce the computational time is a multilevel parallelization of Forward algorithm. Two types of cores were used in our implementation, for each level of parallelization, cores that are graved on the same chip of PowerXCell8i processor. This hybrid architecture of processors permitted us to obtain a speedup factor over 40 relative to the sequential algorithm for a model with 24 states and 25 millions of observable symbols. Experimental results showed that the parallel Forward algorithm can evaluate the probability of an observation sequence on a hidden Markov model 40 times faster than the classic one does. Based on the performance obtained, we demonstrate the applicability of this parallel implementation of Forward algorithm in complex problems such as large vocabulary speech recognition.

  20. Streaming Algorithms for Line Simplification

    DEFF Research Database (Denmark)

    Abam, Mohammad; de Berg, Mark; Hachenberger, Peter

    2010-01-01

    this problem in a streaming setting, where we only have a limited amount of storage, so that we cannot store all the points. We analyze the competitive ratio of our algorithms, allowing resource augmentation: we let our algorithm maintain a simplification with 2k (internal) points and compare the error of our...

  1. A Line Extraction Algorithm for Hand Drawings

    Institute of Scientific and Technical Information of China (English)

    赵明

    1995-01-01

    This paper presents an algorithm for extracting lines from hand drawings.It starts from contour pixel tracing,fits them into contour segments,and then extracts skeleton lines from the contour segments.The algorithm finds all contours in one scan of the input matrix without detecting and marking multiple pixels.In line extraction,the method Elastic Contour Segment Tracing is proposed which extracts lines by referring to the contour segments at both sides,overcoming noise and passing through blotted areas by fitting and extrapolation. Experiments on free hand mechanical drawings,sketches,letter/numerals,as well as Chinese characters are carried out and satisfactory results are achieved.

  2. Discovering Hidden Networks in On-line Social Networks

    Directory of Open Access Journals (Sweden)

    Pooja Wadhwa

    2014-04-01

    Full Text Available Rapid developments in information technology and Web 2.0 have provided a platform for the evolution of terrorist organizations, extremists from a traditional pyramidal structure to a technology enabled networked structure. Growing presence of these subversive groups on social networking sites has emerged as one of the prominent threats to the society, governments and law enforcement agencies across the world. Identifying messages relevant to the domain of security can serve as a stepping stone in criminal network analysis. In this paper, we deploy a rule based approach for classifying messages in Twitter which can also successfully reveal overlapping clusters. The approach incorporates dictionaries of enriched themes where each theme is categorized by semantically related words. The message is vectorized according to the security dictionaries and is termed as ‘Security Vector’. The documents are classified in categories on the basis of security associations. Further, the approach can also be used along the temporal dimension for classifying messages into topics and rank the most prominent topics of conversation at a particular instance of time. We further employ social network analysis techniques to visualize the hidden network at a particular time. Some of the results of our approach obtained through experiment with information network of Twitter are also discussed.

  3. ALFA: an automated line fitting algorithm

    CERN Document Server

    Wesson, Roger

    2015-01-01

    I present the Automated Line Fitting Algorithm, ALFA, a new code which can fit emission line spectra of arbitrary wavelength coverage and resolution, fully automatically. In contrast to traditional emission line fitting methods which require the identification of spectral features suspected to be emission lines, ALFA instead uses a list of lines which are expected to be present to construct a synthetic spectrum. The parameters used to construct the synthetic spectrum are optimised by means of a genetic algorithm. Uncertainties are estimated using the noise structure of the residuals. An emission line spectrum containing several hundred lines can be fitted in a few seconds using a single processor of a typical contemporary desktop or laptop PC. I show that the results are in excellent agreement with those measured manually for a number of spectra. Where discrepancies exist, the manually measured fluxes are found to be less accurate than those returned by ALFA. Together with the code NEAT (Wesson et al. 2012), ...

  4. Hidden Broad Line Seyfert 2 Galaxies in the CfA and 12micron Samples

    OpenAIRE

    Tran, Hien D.

    2001-01-01

    We report the results of a spectropolarimetric survey of the CfA and 12micron samples of Seyfert 2 galaxies (S2s). Polarized (hidden) broad line regions (HBLRs) are confirmed in a number of galaxies, and several new cases (F02581-1136, MCG -3-58-7, NGC 5995, NGC 6552, NGC 7682) are reported. The 12micron S2 sample shows a significantly higher incidence of HBLR (50%) than its CfA counterpart (30%), suggesting that the latter may be incomplete in hidden AGNs. Compared to the non-HBLR S2s, the H...

  5. Two Methods for Antialiased Wireframe Drawing with Hidden Line Removal

    DEFF Research Database (Denmark)

    Bærentzen, Jakob Andreas; Munk-Lund, Steen; Gjøl, Mikkel

    2008-01-01

    Two novel and robust techniques for wireframe drawing are proposed. Neither suffer from the well-known artifacts associated with the standard two pass, offset based techniques for wireframe drawing. Both methods draw prefiltered lines and produce high-quality antialiased results without super...

  6. A search for non-hidden broad-line region Seyfert 2 galaxies

    CERN Document Server

    Petrov, Georgi P

    2016-01-01

    According to the unified model of active galactic nuclei, Seyfert 2 galaxies are physically the same as Seyfert 1 objects and they possess a broad-line region (BLR), but it is hidden from the observer due to their orientation. In the past few years, various authors reported that not all Seyfert 2 galaxies harbor a BLR. We compiled a sample of 38 Seyfert 2 galaxies to find non-hidden broad-line region (non-HBLR) objects. Using the theory of Nicastro et al. which suggests the existence of a critical value of the Eddington ratio below which BLR can't be formed, we found 26 non-HBLR Seyfert 2 candidates. We found also that 5 of these 26 non-HBLR objects could be low-ionization nuclear emission-line regions (LINERs).

  7. The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts

    CERN Document Server

    Moore, Cristopher; Russell, A; Schulman, L J; Moore, Cristopher; Rockmore, Daniel; Russell, Alexander; Schulman, Leonard J.

    2005-01-01

    Many quantum algorithms, including Shor's celebrated factoring and discrete log algorithms, proceed by reduction to a Hidden Subgroup problem, in which an unknown subgroup H of a group G must be determined from a uniform superposition on a left coset of H. These hidden subgroup problems are typically solved by Fourier sampling. When G is nonabelian, two important variants of Fourier sampling have been identified: the weak standard method, where only representation names are measured, and the strong standard method, where full measurement (i.e., the row and column of the representation, in a suitably chosen basis) occurs. It has remained open whether the strong standard method is indeed stronger. In this article, we settle this question in the affirmative. We show that hidden subgroups H of the q-hedral groups, i.e., semidirect products Z_q \\ltimes Z_p where q | (p-1), and in particular the affine groups A_p, can be information-theoretically reconstructed using the strong standard method. Moreover, if |H| = p/...

  8. THE DIFFERENCES IN THE TORUS GEOMETRY BETWEEN HIDDEN AND NON-HIDDEN BROAD LINE ACTIVE GALACTIC NUCLEI

    Energy Technology Data Exchange (ETDEWEB)

    Ichikawa, Kohei; Ueda, Yoshihiro [Department of Astronomy, Kyoto University, Kitashirakawa-Oiwake-cho, Sakyo-ku, Kyoto 606-8502 (Japan); Packham, Christopher; Lopez-Rodriguez, Enrique; Alsip, Crystal D. [Department of Physics and Astronomy, University of Texas at San Antonio, One UTSA Circle, San Antonio, TX 78249 (United States); Almeida, Cristina Ramos; Ramos, Andrés Asensio; González-Martín, Omaira [Instituto de Astrofísica de Canarias, C/Vía Láctea, s/n, E-38205 La Laguna, Tenerife (Spain); Alonso-Herrero, Almudena [Instituto de Física de Cantabria, CSIC-Universidad de Cantabria, E-39005 Santander (Spain); Díaz-Santos, Tanio [Spitzer Science Center, California Institute of Technology, MS 220-6, Pasadena, CA 91125 (United States); Elitzur, Moshe [Department of Physics and Astronomy, University of Kentucky, Lexington, KY 40506-0055 (United States); Hönig, Sebastian F. [School of Physics and Astronomy, University of Southampton, Southampton SO17 1BJ (United Kingdom); Imanishi, Masatoshi [Subaru Telescope, 650 North A’ohoku Place, Hilo, HI 96720 (United States); Levenson, Nancy A. [Gemini Observatory, Southern Operations Center, c/o AURA, Casilla 603, La Serena (Chile); Mason, Rachel E. [Gemini Observatory, Northern Operations Center, 670 N. A’ohoku Place, Hilo, HI 96720 (United States); Perlman, Eric S., E-mail: ichikawa@kusastro.kyoto-u.ac.jp [Department of Physics and Space Sciences, 150 W. University Blvd., Florida Institute of Technology, Melbourne, FL 32901 (United States)

    2015-04-20

    We present results from the fitting of infrared (IR) spectral energy distributions of 21 active galactic nuclei (AGNs) with clumpy torus models. We compiled high spatial resolution (∼0.3–0.7 arcsec) mid-IR (MIR) N-band spectroscopy, Q-band imaging, and nuclear near- and MIR photometry from the literature. Combining these nuclear near- and MIR observations, far-IR photometry, and clumpy torus models enables us to put constraints on the torus properties and geometry. We divide the sample into three types according to the broad line region (BLR) properties: type-1s, type-2s with scattered or hidden broad line region (HBLR) previously observed, and type-2s without any published HBLR signature (NHBLR). Comparing the torus model parameters gives us the first quantitative torus geometrical view for each subgroup. We find that NHBLR AGNs have smaller torus opening angles and larger covering factors than HBLR AGNs. This suggests that the chance to observe scattered (polarized) flux from the BLR in NHBLR could be reduced by the dual effects of (a) less scattering medium due to the reduced scattering volume given the small torus opening angle and (b) the increased torus obscuration between the observer and the scattering region. These effects give a reasonable explanation for the lack of observed HBLR in some type-2 AGNs.

  9. A hidden Markov model-based algorithm for identifying tumour subtype using array CGH data

    Directory of Open Access Journals (Sweden)

    Zhang Ke

    2011-12-01

    Full Text Available Abstract Background The recent advancement in array CGH (aCGH research has significantly improved tumor identification using DNA copy number data. A number of unsupervised learning methods have been proposed for clustering aCGH samples. Two of the major challenges for developing aCGH sample clustering are the high spatial correlation between aCGH markers and the low computing efficiency. A mixture hidden Markov model based algorithm was developed to address these two challenges. Results The hidden Markov model (HMM was used to model the spatial correlation between aCGH markers. A fast clustering algorithm was implemented and real data analysis on glioma aCGH data has shown that it converges to the optimal cluster rapidly and the computation time is proportional to the sample size. Simulation results showed that this HMM based clustering (HMMC method has a substantially lower error rate than NMF clustering. The HMMC results for glioma data were significantly associated with clinical outcomes. Conclusions We have developed a fast clustering algorithm to identify tumor subtypes based on DNA copy number aberrations. The performance of the proposed HMMC method has been evaluated using both simulated and real aCGH data. The software for HMMC in both R and C++ is available in ND INBRE website http://ndinbre.org/programs/bioinformatics.php.

  10. Discrete channel modelling based on genetic algorithm and simulated annealing for training hidden Markov model

    Institute of Scientific and Technical Information of China (English)

    Zhao Zhi-Jin; Zheng Shi-Lian; Xu Chun-Yun; Kong Xian-Zheng

    2007-01-01

    Hidden Markov models (HMMs) have been used to model burst error sources of wireless channels. This paper proposes a hybrid method of using genetic algorithm (GA) and simulated annealing (SA) to train HMM for discrete channel modelling. The proposed method is compared with pure GA, and experimental results show that the HMMs trained by the hybrid method can better describe the error sequences due to SA's ability of facilitating hill-climbing at the later stage of the search. The burst error statistics of the HMMs trained by the proposed method and the corresponding error sequences are also presented to validate the proposed method.

  11. Intense gamma-ray lines from hidden vector dark matter decay

    Energy Technology Data Exchange (ETDEWEB)

    Arina, Chiara; Hambye, Thomas [Universite Libre de Bruxelles (Belgium). Service de Physique Theorique; Ibarra, Alejandro [Technische Univ. Muenchen, Garching (Germany). Physik-Department; Weniger, Christoph [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany)

    2009-12-15

    Scenarios with hidden, spontaneously broken, non-abelian gauge groups contain a natural dark matter candidate, the hidden vector, whose longevity is due to an accidental custodial symmetry in the renormalizable Lagrangian. Nevertheless, non-renormalizable dimension six operators break the custodial symmetry and induce the decay of the dark matter particle at cosmological times. We discuss in this paper the cosmic ray signatures of this scenario and we show that the decay of hidden vector dark matter particles generically produce an intense gamma ray line which could be observed by the Fermi-LAT experiment, if the scale of custodial symmetry breaking is close to the Grand Unification scale. This gamma line proceeds directly from a tree level dark matter 2-body decay in association with a Higgs boson. Within this model we also perform a determination of the relic density constraints taking into account the dark matter annihilation processes with one dark matter particle in the final state. The corresponding direct detection rates can be easily of order the current experimental sensitivities. (orig.)

  12. New algorithm for detection of dangerous objects hidden on a human body using passive THz camera

    Science.gov (United States)

    Trofimov, Vyacheslav A.; Trofimov, Vladislav V.; Kuchik, Igor E.; Shestakov, Ivan L.

    2016-10-01

    We discuss a correlation function using for developing of new algorithm that allows us to detect a hidden object without analyzing of image captured by the passive THz camera. Main idea of this approach concludes in correlation calculating between the image characteristics and corresponding characteristics of standard image. Obviously, a difference in temperature between a person body and object hidden under clothes takes place always. However, this difference can be invisible for human eyes. Using the correlation function we can increase a contrast between two objects and this allows to see an object or to produce alarm by computer. We discuss a choice of standard image characteristics for an achievement of correlation function for high contrast. Other feature of our approach arises from a possibility of a person image coming to the THz camera by using a computer processing of the image only. It means that we can "decrease" a distance between a person and the passive THz camera. This algorithm is very convenient for using and has a high performance.

  13. Assembly line balancing using genetic algorithms

    OpenAIRE

    Tanyer, Muzaffer

    1997-01-01

    Ankara : Department of Industrial Engineering and Institute of Engineering and Sciences, Bilkent Univ., 1997. Thesis (Master's) -- Bilkent University, 1997. Includes bibliographical references leaves 69-73 For the last few decades, the genetic algorithms (GAs) have been used as a kind of heuristic in many areas of manufacturing. Facility layout, scheduling, process planning, and assembly line balancing are some of the areas where GAs are already popular. GAs are more efficie...

  14. Subexponential-Time Algorithms for Hidden Subgroup Problems Over Product Groups

    CERN Document Server

    Alagic, G; Russell, A; Alagic, Gorjan; Moore, Cristopher; Russell, Alexander

    2006-01-01

    We study the hidden subgroup problem (HSP) over groups of the form G^n where G is a group of constant size. While these groups are structurally simpler than the symmetric groups S_n, for which solving the HSP would yield a quantum algorithm for Graph Isomorphism, they share an important property with S_n: almost all of their irreducible representations are exponentially large. As a consequence, recent negative results show that any quantum algorithm that attempts to solve the HSP over these groups by measuring coset states must perform highly entangled measurements on \\Omega(n) registers. This distinguishes them from, say, the dihedral groups, whose representations are of constant size and where single-register Fourier sampling provides sufficient information to solve the HSP. Here we give quantum algorithms for many groups of this form, which distinguish an order-2 subgroup from the trivial subgroup in time 2^{O(\\sqrt{n \\log n})}. Our algorithm combines the general idea behind Kuperberg's sieve for dihedral ...

  15. On-line Viterbi Algorithm and Its Relationship to Random Walks

    CERN Document Server

    ?rámek, Rastislav; Vina?, Tomá?

    2007-01-01

    In this paper, we introduce the on-line Viterbi algorithm for decoding hidden Markov models (HMMs) in much smaller than linear space. Our analysis on two-state HMMs suggests that the expected maximum memory used to decode sequence of length $n$ with $m$-state HMM can be as low as $\\Theta(m\\log n)$, without a significant slow-down compared to the classical Viterbi algorithm. Classical Viterbi algorithm requires $O(mn)$ space, which is impractical for analysis of long DNA sequences (such as complete human genome chromosomes) and for continuous data streams. We also experimentally demonstrate the performance of the on-line Viterbi algorithm on a simple HMM for gene finding on both simulated and real DNA sequences.

  16. Implementing EM and Viterbi algorithms for Hidden Markov Model in linear memory

    Directory of Open Access Journals (Sweden)

    Winters-Hilt Stephen

    2008-04-01

    Full Text Available Abstract Background The Baum-Welch learning procedure for Hidden Markov Models (HMMs provides a powerful tool for tailoring HMM topologies to data for use in knowledge discovery and clustering. A linear memory procedure recently proposed by Miklós, I. and Meyer, I.M. describes a memory sparse version of the Baum-Welch algorithm with modifications to the original probabilistic table topologies to make memory use independent of sequence length (and linearly dependent on state number. The original description of the technique has some errors that we amend. We then compare the corrected implementation on a variety of data sets with conventional and checkpointing implementations. Results We provide a correct recurrence relation for the emission parameter estimate and extend it to parameter estimates of the Normal distribution. To accelerate estimation of the prior state probabilities, and decrease memory use, we reverse the originally proposed forward sweep. We describe different scaling strategies necessary in all real implementations of the algorithm to prevent underflow. In this paper we also describe our approach to a linear memory implementation of the Viterbi decoding algorithm (with linearity in the sequence length, while memory use is approximately independent of state number. We demonstrate the use of the linear memory implementation on an extended Duration Hidden Markov Model (DHMM and on an HMM with a spike detection topology. Comparing the various implementations of the Baum-Welch procedure we find that the checkpointing algorithm produces the best overall tradeoff between memory use and speed. In cases where sequence length is very large (for Baum-Welch, or state number is very large (for Viterbi, the linear memory methods outlined may offer some utility. Conclusion Our performance-optimized Java implementations of Baum-Welch algorithm are available at http://logos.cs.uno.edu/~achurban. The described method and implementations will aid

  17. ITAC volume assessment through a Gaussian hidden Markov random field model-based algorithm.

    Science.gov (United States)

    Passera, Katia M; Potepan, Paolo; Brambilla, Luca; Mainardi, Luca T

    2008-01-01

    In this paper, a semi-automatic segmentation method for volume assessment of Intestinal-type adenocarcinoma (ITAC) is presented and validated. The method is based on a Gaussian hidden Markov random field (GHMRF) model that represents an advanced version of a finite Gaussian mixture (FGM) model as it encodes spatial information through the mutual influences of neighboring sites. To fit the GHMRF model an expectation maximization (EM) algorithm is used. We applied the method to a magnetic resonance data sets (each of them composed by T1-weighted, Contrast Enhanced T1-weighted and T2-weighted images) for a total of 49 tumor-contained slices. We tested GHMRF performances with respect to FGM by both a numerical and a clinical evaluation. Results show that the proposed method has a higher accuracy in quantifying lesion area than FGM and it can be applied in the evaluation of tumor response to therapy.

  18. Isolated Word Recognition Using Ergodic Hidden Markov Models and Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Warih Maharani

    2012-03-01

    Full Text Available Speech to Text was one of speech recognition applications which speech signal was processed, recognized and converted into a textual representation. Hidden Markov Model (HMM was the widely used method in speech recognition. However, the level of accuracy using HMM was strongly influenced by the optimalization of extraction process and modellling methods. Hence in this research, the use of genetic algorithm (GA method to optimize the Ergodic HMM was tested. In Hybrid HMM-GA, GA was used to optimize the Baum-welch method in the training process. It was useful to improve the accuracy of the recognition result which is produced by the HMM parameters that generate the low accuracy when the HMM are tested. Based on the research, the percentage increases the level of accuracy of 20% to 41%. Proved that the combination of GA in HMM method can gives more optimal results when compared with the HMM system that not combine with any method.

  19. Hidden Markov Model and Forward-Backward Algorithm in Crude Oil Price Forecasting

    Science.gov (United States)

    Talib Bon, Abdul; Isah, Nuhu

    2016-11-01

    In light of the importance of crude oil to the world's economy, it is not surprising that economists have devoted great efforts towards developing methods to forecast price and volatility levels. Crude oil is an important energy commodity to mankind. Several causes have made crude oil prices to be volatile such as economic, political and social. Hence, forecasting the crude oil prices is essential to avoid unforeseen circumstances towards economic activity. In this study, daily crude oil prices data was obtained from WTI dated 2nd January to 29th May 2015. We used Hidden Markov Model (HMM) and Forward-Backward Algorithm to forecasting the crude oil prices. In this study, the analyses were done using Maple software. Based on the study, we concluded that model (0 3 0) is able to produce accurate forecast based on a description of history patterns in crude oil prices.

  20. An Efficient Algorithm for the Detection of Exposed and Hidden Wormhole Attack

    Directory of Open Access Journals (Sweden)

    ZUBAIR AHMED KHAN

    2016-07-01

    Full Text Available MANETs (Mobile Ad Hoc Networks are slowly integrating into our everyday lives, their most prominent uses are visible in the disaster and war struck areas where physical infrastructure is almost impossible or very hard to build. MANETs like other networks are facing the threat of malicious users and their activities. A number of attacks have been identified but the most severe of them is the wormhole attack which has the ability to succeed even in case of encrypted traffic and secure networks. Once wormhole is launched successfully, the severity increases by the fact that attackers can launch other attacks too. This paper presents a comprehensive algorithm for the detection of exposed as well as hidden wormhole attack while keeping the detection rate to maximum and at the same reducing false alarms. The algorithm does not require any extra hardware, time synchronization or any special type of nodes. The architecture consists of the combination of Routing Table, RTT (Round Trip Time and RSSI (Received Signal Strength Indicator for comprehensive detection of wormhole attack. The proposed technique is robust, light weight, has low resource requirements and provides real-time detection against the wormhole attack. Simulation results show that the algorithm is able to provide a higher detection rate, packet delivery ratio, negligible false alarms and is also better in terms of Ease of Implementation, Detection Accuracy/ Speed and processing overhead.

  1. Fall-Detection Algorithm Using 3-Axis Acceleration: Combination with Simple Threshold and Hidden Markov Model

    Directory of Open Access Journals (Sweden)

    Dongha Lim

    2014-01-01

    Full Text Available Falls are a serious medical and social problem among the elderly. This has led to the development of automatic fall-detection systems. To detect falls, a fall-detection algorithm that combines a simple threshold method and hidden Markov model (HMM using 3-axis acceleration is proposed. To apply the proposed fall-detection algorithm and detect falls, a wearable fall-detection device has been designed and produced. Several fall-feature parameters of 3-axis acceleration are introduced and applied to a simple threshold method. Possible falls are chosen through the simple threshold and are applied to two types of HMM to distinguish between a fall and an activity of daily living (ADL. The results using the simple threshold, HMM, and combination of the simple method and HMM were compared and analyzed. The combination of the simple threshold method and HMM reduced the complexity of the hardware and the proposed algorithm exhibited higher accuracy than that of the simple threshold method.

  2. On-line monitoring of pharmaceutical production processes using Hidden Markov Model.

    Science.gov (United States)

    Zhang, Hui; Jiang, Zhuangde; Pi, J Y; Xu, H K; Du, R

    2009-04-01

    This article presents a new method for on-line monitoring of pharmaceutical production process, especially the powder blending process. The new method consists of two parts: extracting features from the Near Infrared (NIR) spectroscopy signals and recognizing patterns from the features. Features are extracted from spectra by using Partial Least Squares method (PLS). The pattern recognition is done by using Hidden Markov Model (HMM). A series of experiments are conducted to evaluate the effectiveness of this new method. In the experiments, wheat powder and corn powder are blended together at a set concentration. The proposed method can effectively detect the blending uniformity (the success rate is 99.6%). In comparison to the conventional Moving Block of Standard Deviation (MBSD), the proposed method has a number of advantages, including higher reliability, higher robustness and more transparent decision making. It can be used for effective on-line monitoring of pharmaceutical production processes.

  3. ADAPTIVE LEARNING OF HIDDEN MARKOV MODELS FOR EMOTIONAL SPEECH

    Directory of Open Access Journals (Sweden)

    A. V. Tkachenia

    2014-01-01

    Full Text Available An on-line unsupervised algorithm for estimating the hidden Markov models (HMM parame-ters is presented. The problem of hidden Markov models adaptation to emotional speech is solved. To increase the reliability of estimated HMM parameters, a mechanism of forgetting and updating is proposed. A functional block diagram of the hidden Markov models adaptation algorithm is also provided with obtained results, which improve the efficiency of emotional speech recognition.

  4. On-line Fault Diagnosis in Industrial Processes Using Variable Moving Window and Hidden Markov Model

    Institute of Scientific and Technical Information of China (English)

    周韶园; 谢磊; 王树青

    2005-01-01

    An integrated framework is presented to represent and classify process data for on-line identifying abnormal operating conditions. It is based on pattern recognition principles and consists of a feature extraction step, by which wavelet transform and principal component analysis are used to capture the inherent characteristics from process measurements, followed by a similarity assessment step using hidden Markov model (HMM) for pattern comparison. In most previous cases, a fixed-length moving window was employed to track dynamic data, and often failed to capture enough information for each fault and sometimes even deteriorated the diagnostic performance. A variable moving window, the length of which is modified with time, is introduced in this paper and case studies on the Tennessee Eastman process illustrate the potential of the proposed method.

  5. Algorithm for predictive control implementation on fiber optic transmission lines

    Science.gov (United States)

    Andreev, Vladimir A.; Burdin, Vladimir A.; Voronkov, Andrey A.

    2014-04-01

    This paper presents the algorithm for predictive control implementation on fiber-optic transmission lines. In order to improve the maintenance of fiber optic communication lines, the algorithm prediction uptime optic communication cables have been worked out. It considers the results of scheduled preventive maintenance and database of various works on the track cable line during maintenance.

  6. Algorithm for a Microfluidic Assembly Line

    OpenAIRE

    Schneider, Tobias M.; Mandre, Shreyas; Brenner, Michael P.

    2011-01-01

    Microfluidic technology has revolutionized the control of flows at small scales giving rise to new possibilities for assembling complex structures on the microscale. We analyze different possible algorithms for assembling arbitrary structures, and demonstrate that a sequential assembly algorithm can manufacture arbitrary 3D structures from identical constituents. We illustrate the algorithm by showing that a modified Hele-Shaw cell with 7 controlled flowrates can be designed to construct the ...

  7. ISO observations and models of galaxies with Hidden Broad Line Regions

    CERN Document Server

    Efstathiou, A

    2005-01-01

    In this paper we present ISO mid-infrared spectrophotometry and far-infrared photometry of galaxies with Hidden Broad Line Regions (HBLR). We also present radiative transfer models of their spectral energy distributions which enable us to separate the contributions from the dusty disc of the AGN and the dusty starbursts. We find that the combination of tapered discs (discs whose thickness increases with distance from the central source in the inner part but stays constant in the outer part) and starbursts provide good fits to the data. The tapered discs dominate in the mid-infrared part of the spectrum and the starbursts in the far-infrared. After correcting the AGN luminosity for anisotropic emission we find that the ratio of the AGN luminosity to the starburst luminosity, L(AGN)/L(SB), ranges from about unity for IRAS14454-4343 to about 13 for IRAS01475-0740. Our results suggest that the warm IRAS colours of HBLR are due to the relatively high L(AGN)/L(SB). Our fits are consistent with the unified model and...

  8. Algorithms for semi on-line multiprocessor scheduling problems

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    In the classical multiprocessor scheduling problems, it is assumed that the problems are considered in off-line or on-line environment. But in practice, problems are often not really off-line or on-line but somehow in between. This means that, with respect to the on-line problem, some further information about the tasks is available, which allows the improvement of the performance of the best possible algorithms. Problems of this class are called semi on-line ones. The authors studied two semi on-line multiprocessor scheduling problems, in which, the total processing time of all tasks is known in advance, or all processing times lie in a given interval. They proposed approximation algorithms for minimizing the makespan and analyzed their performance guarantee. The algorithms improve the known results for 3 or more processor cases in the literature.

  9. Algorithmic Construction of Local Hidden Variable Models for Entangled Quantum States

    Science.gov (United States)

    Hirsch, Flavien; Quintino, Marco Túlio; Vértesi, Tamás; Pusey, Matthew F.; Brunner, Nicolas

    2016-11-01

    Constructing local hidden variable (LHV) models for entangled quantum states is a fundamental problem, with implications for the foundations of quantum theory and for quantum information processing. It is, however, a challenging problem, as the model should reproduce quantum predictions for all possible local measurements. Here we present a simple method for building LHV models, applicable to any entangled state and considering continuous sets of measurements. This leads to a sequence of tests which, in the limit, fully captures the set of quantum states admitting a LHV model. Similar methods are developed for local hidden state models. We illustrate the practical relevance of these methods with several examples.

  10. Algorithmic Construction of Local Hidden Variable Models for Entangled Quantum States.

    Science.gov (United States)

    Hirsch, Flavien; Quintino, Marco Túlio; Vértesi, Tamás; Pusey, Matthew F; Brunner, Nicolas

    2016-11-04

    Constructing local hidden variable (LHV) models for entangled quantum states is a fundamental problem, with implications for the foundations of quantum theory and for quantum information processing. It is, however, a challenging problem, as the model should reproduce quantum predictions for all possible local measurements. Here we present a simple method for building LHV models, applicable to any entangled state and considering continuous sets of measurements. This leads to a sequence of tests which, in the limit, fully captures the set of quantum states admitting a LHV model. Similar methods are developed for local hidden state models. We illustrate the practical relevance of these methods with several examples.

  11. A Novel Assembly Line Balancing Method Based on PSO Algorithm

    Directory of Open Access Journals (Sweden)

    Xiaomei Hu

    2014-01-01

    Full Text Available Assembly line is widely used in manufacturing system. Assembly line balancing problem is a crucial question during design and management of assembly lines since it directly affects the productivity of the whole manufacturing system. The model of assembly line balancing problem is put forward and a general optimization method is proposed. The key data on assembly line balancing problem is confirmed, and the precedence relations diagram is described. A double objective optimization model based on takt time and smoothness index is built, and balance optimization scheme based on PSO algorithm is proposed. Through the simulation experiments of examples, the feasibility and validity of the assembly line balancing method based on PSO algorithm is proved.

  12. The Hidden Poor: Over Three-Quarters of a Million Older Californians Overlooked by Official Poverty Line.

    Science.gov (United States)

    Padilla-Frausto, Imelda D; Wallace, Steven P

    2015-08-01

    More than three-quarters of a million (772,000) older Californians are among the "hidden poor"--older adults with incomes above the federal poverty line (FPL) but below a minimally decent standard of living as determined by the Elder Economic Security Standard™ Index (Elder Index) in 2011. This policy brief uses the most recent Elder Index calculations to document the wide discrepancy that exists between the FPL and the Elder Index. This study finds that the FPL significantly underestimates the number of economically insecure older adults who are unable to make ends meet. Yet, because many public assistance programs are aligned with the FPL, potentially hundreds of thousands of economically insecure older Californians are denied aid. The highest rates of the hidden poor among older adults are found among renters, Latinos, women, those who are raising grandchildren, and people in the oldest age groups. Raising the income and asset eligibility requirement thresholds for social support programs such as Supplemental Security Income (SSI), housing, health care, and food assistance would help California's older hidden poor make ends meet.

  13. Line matching for automatic change detection algorithm

    Science.gov (United States)

    Dhollande, Jérôme; Monnin, David; Gond, Laetitia; Cudel, Christophe; Kohler, Sophie; Dieterlen, Alain

    2012-06-01

    During foreign operations, Improvised Explosive Devices (IEDs) are one of major threats that soldiers may unfortunately encounter along itineraries. Based on a vehicle-mounted camera, we propose an original approach by image comparison to detect signicant changes on these roads. The classic 2D-image registration techniques do not take into account parallax phenomena. The consequence is that the misregistration errors could be detected as changes. According to stereovision principles, our automatic method compares intensity proles along corresponding epipolar lines by extrema matching. An adaptive space warping compensates scale dierence in 3D-scene. When the signals are matched, the signal dierence highlights changes which are marked in current video.

  14. Application of the Viterbi Algorithm in Hidden Markov Models for Exploring Irrigation Decision Series

    Science.gov (United States)

    Andriyas, S.; McKee, M.

    2014-12-01

    Anticipating farmers' irrigation decisions can provide the possibility of improving the efficiency of canal operations in on-demand irrigation systems. Although multiple factors are considered during irrigation decision making, for any given farmer there might be one factor playing a major role. Identification of that biophysical factor which led to a farmer deciding to irrigate is difficult because of high variability of those factors during the growing season. Analysis of the irrigation decisions of a group of farmers for a single crop can help to simplify the problem. We developed a hidden Markov model (HMM) to analyze irrigation decisions and explore the factor and level at which the majority of farmers decide to irrigate. The model requires observed variables as inputs and the hidden states. The chosen model inputs were relatively easily measured, or estimated, biophysical data, including such factors (i.e., those variables which are believed to affect irrigation decision-making) as cumulative evapotranspiration, soil moisture depletion, soil stress coefficient, and canal flows. Irrigation decision series were the hidden states for the model. The data for the work comes from the Canal B region of the Lower Sevier River Basin, near Delta, Utah. The main crops of the region are alfalfa, barley, and corn. A portion of the data was used to build and test the model capability to explore that factor and the level at which the farmer takes the decision to irrigate for future irrigation events. Both group and individual level behavior can be studied using HMMs. The study showed that the farmers cannot be classified into certain classes based on their irrigation decisions, but vary in their behavior from irrigation-to-irrigation across all years and crops. HMMs can be used to analyze what factor and, subsequently, what level of that factor on which the farmer most likely based the irrigation decision. The study shows that the HMM is a capable tool to study a process

  15. A novel approach to computationally efficient algorithms for transmission loss and line flow formulations

    Energy Technology Data Exchange (ETDEWEB)

    Nanda, J.; Lai, L.L.; Ma, J.T.; Rajkumar, N. [City University, London (United Kingdom). Energy Systems Group; Nanda, A. [Joslyn High Voltage Corp., Chicago, IL (United States); Prasad, M. [ABB, Neww Delhi (India)

    1999-11-01

    This paper presents a novel approach to powerful, effective and computationally efficient algorithms for formulation and evaluation of transmission loss and line flow through efficient loss coefficients and distribution factors, respectively, which are uniquely suitable for real term application. These loss coefficients and distribution factors are generated extremely elegantly and efficiently from the hidden treasures of an available load flow solution with trivial computational burden. Results on few IEEE Test systems are extremely exciting which reveal that the loss coefficients evaluated at the normal operating conditions are quite robust and for all practical purposes need not be re-evaluated for wide changes in system operating conditions for evaluation of transmission loss or economic load dispatch solution. (author)

  16. A twist on folding: Predicting optimal sequences and optimal folds of simple protein models with the hidden-force algorithm

    CERN Document Server

    Kolossváry, István

    2012-01-01

    We propose a new way of looking at global optimization of off-lattice protein models. We present a dual optimization concept of predicting optimal sequences as well as optimal folds. We validate the utility of the recently introduced hidden-force Monte Carlo optimization algorithm by finding significantly lower energy folds for minimalist protein models than previously reported. Further, we also find the protein sequence that yields the lowest energy fold amongst all sequences for a given chain length and residue mixture. In particular, for protein models with a binary sequence, we show that the sequence-optimized folds form more compact cores than the lowest energy folds of the historically fixed, Fibonacci-series sequences of chain lengths of 13, 21, 34, 55, and 89. We emphasize that while the protein model we used is minimalist, the methodology is applicable to detailed protein models, and sequence optimization may yield novel folds and aid de novo protein design.

  17. On-line EM algorithm for the normalized gaussian network.

    Science.gov (United States)

    Sato, M; Ishii, S

    2000-02-01

    A normalized gaussian network (NGnet) (Moody & Darken, 1989) is a network of local linear regression units. The model softly partitions the input space by normalized gaussian functions, and each local unit linearly approximates the output within the partition. In this article, we propose a new on-line EMalgorithm for the NGnet, which is derived from the batch EMalgorithm (Xu, Jordan, &Hinton 1995), by introducing a discount factor. We show that the on-line EM algorithm is equivalent to the batch EM algorithm if a specific scheduling of the discount factor is employed. In addition, we show that the on-line EM algorithm can be considered as a stochastic approximation method to find the maximum likelihood estimator. A new regularization method is proposed in order to deal with a singular input distribution. In order to manage dynamic environments, where the input-output distribution of data changes over time, unit manipulation mechanisms such as unit production, unit deletion, and unit division are also introduced based on probabilistic interpretation. Experimental results show that our approach is suitable for function approximation problems in dynamic environments. We also apply our on-line EM algorithm to robot dynamics problems and compare our algorithm with the mixtures-of-experts family.

  18. Lining seam elimination algorithm and surface crack detection in concrete tunnel lining

    Science.gov (United States)

    Qu, Zhong; Bai, Ling; An, Shi-Quan; Ju, Fang-Rong; Liu, Ling

    2016-11-01

    Due to the particularity of the surface of concrete tunnel lining and the diversity of detection environments such as uneven illumination, smudges, localized rock falls, water leakage, and the inherent seams of the lining structure, existing crack detection algorithms cannot detect real cracks accurately. This paper proposed an algorithm that combines lining seam elimination with the improved percolation detection algorithm based on grid cell analysis for surface crack detection in concrete tunnel lining. First, check the characteristics of pixels within the overlapping grid to remove the background noise and generate the percolation seed map (PSM). Second, cracks are detected based on the PSM by the accelerated percolation algorithm so that the fracture unit areas can be scanned and connected. Finally, the real surface cracks in concrete tunnel lining can be obtained by removing the lining seam and performing percolation denoising. Experimental results show that the proposed algorithm can accurately, quickly, and effectively detect the real surface cracks. Furthermore, it can fill the gap in the existing concrete tunnel lining surface crack detection by removing the lining seam.

  19. SUPERLINEAR CONVERGENCE OF THE DFP ALGORITHM WITHOUT EXACT LINE SEARCH

    Institute of Scientific and Technical Information of China (English)

    濮定国

    2001-01-01

    @@ Broyden algorithms are very efficient methods for solving the nonlinear programming problem: min {f(x); x ∈ Rn}. (1) With exact line search, Powell[1] proved that the rate of convergence of these algorithms is one-step Q-superlinear for a twice continuously differentiable and uniformly convex function,and pu[2] extended this result for LC1 function. Pu and Yu[3] proved that if the points which are given by these algorithms are convergent they are globally convergent for continuously differentiable functions without convexity.

  20. Multidiscontinuity algorithm for world-line Monte Carlo simulations.

    Science.gov (United States)

    Kato, Yasuyuki

    2013-01-01

    We introduce a multidiscontinuity algorithm for the efficient global update of world-line configurations in Monte Carlo simulations of interacting quantum systems. This algorithm is a generalization of the two-discontinuity algorithms introduced in Refs. [N. Prokof'ev, B. Svistunov, and I. Tupitsyn, Phys. Lett. A 238, 253 (1998)] and [O. F. Syljuåsen and A. W. Sandvik, Phys. Rev. E 66, 046701 (2002)]. This generalization is particularly effective for studying Bose-Einstein condensates (BECs) of composite particles. In particular, we demonstrate the utility of the generalized algorithm by simulating a Hamiltonian for an S=1 antiferromagnet with strong uniaxial single-ion anisotropy. The multidiscontinuity algorithm not only solves the freezing problem that arises in this limit, but also allows the efficient computing of the off-diagonal correlator that characterizes a BEC of composite particles.

  1. Contourlet domain hidden Markov tree based detection algorithm for DRDC through-wall SAR (TWSAR) system applications

    Science.gov (United States)

    Chan, Brigitte

    2010-04-01

    DRDC Ottawa is investigating high resolution synthetic aperture radar (SAR) techniques to perform 3-D imaging through walls in urban operations. Through-wall capabilities of interest include room mapping, imaging of in-wall structures, and detection of objects of interest. Such capabilities would greatly enhance situational awareness for military forces operating in the urban battle space. Current activities include hardware and software development and testing of an L-band through-wall SAR (TWSAR) system. Detection algorithms and automatic target recognition (ATR) systems are under investigation using experimental 2-D data. ATR may be more difficult in urban environments due to the high number of detectable objects and multi-path artifacts. Furthermore, penetrating through walls presents a formidable challenge as wall effects can greatly interfere with image quality inside buildings. By classifying wall material, wall compensation algorithms can be applied to enhance the image. In this paper, we present results from our preliminary investigation on detecting internal and external wall structures and their features (including doors and windows as well as internal wall construction) from scenes acquired with a single channel L-band TWSAR system. We evaluate the effectiveness of automatic detection based on the contourlet domain hidden Markov tree in the context of detecting wall edges and building features, while minimizing the amount of false edge detection. This work will form the basis of wall compensation algorithm development. The detection technique will also be used to detect objects of interests beyond walls once the SAR images have been wall compensated.

  2. A Single Hidden Layered Fuzzy Back propagation Algorithm for Joint Radio Resource Management in Radio Access Systems

    Directory of Open Access Journals (Sweden)

    J.Preethi

    2010-07-01

    Full Text Available In this paper, we propose a single hidden layered fuzzy neural algorithm, which is able to provide a better quality of service constraints in a multi-cell scenario with three different radio access technologies (RATs namely the Universal Mobile Telecommunication Systems (UMTS, the Wireless Local Area Network (WLAN and the Global System for Mobile Telecommunication (GSM /Enhanced Data rate for GSM Evolution (EDGE Radio access Network (GERAN. This proposed algorithm works in two steps; the first step is to select a suitable combination of cells among the three different RATs. The second step chooses the most appropriate RAT to which the users can be attached and to choose the suitable bandwidth to allocate for the users. The Joint Radio Resource Management (JRRM makes use of fuzzy neural approach to manage dynamically the allocation and deallocation of the different radio resources among thedifferent radio access systems for spectrum bands allocated to each of these systems. By simulation results, we have shown that the proposed algorithm selects the most appropriate RAT in a multi-cell scenario.

  3. Staff line detection and revision algorithm based on subsection projection and correlation algorithm

    Science.gov (United States)

    Yang, Yin-xian; Yang, Ding-li

    2013-03-01

    Staff line detection plays a key role in OMR technology, and is the precon-ditions of subsequent segmentation 1& recognition of music sheets. For the phenomena of horizontal inclination & curvature of staff lines and vertical inclination of image, which often occur in music scores, an improved approach based on subsection projection is put forward to realize the detection of original staff lines and revision in an effect to implement staff line detection more successfully. Experimental results show the presented algorithm can detect and revise staff lines fast and effectively.

  4. The l1-l2 regularization framework unmasks the hypoxia signature hidden in the transcriptome of a set of heterogeneous neuroblastoma cell lines

    Directory of Open Access Journals (Sweden)

    Rosasco Lorenzo

    2009-10-01

    Full Text Available Abstract Background Gene expression signatures are clusters of genes discriminating different statuses of the cells and their definition is critical for understanding the molecular bases of diseases. The identification of a gene signature is complicated by the high dimensional nature of the data and by the genetic heterogeneity of the responding cells. The l1-l2 regularization is an embedded feature selection technique that fulfills all the desirable properties of a variable selection algorithm and has the potential to generate a specific signature even in biologically complex settings. We studied the application of this algorithm to detect the signature characterizing the transcriptional response of neuroblastoma tumor cell lines to hypoxia, a condition of low oxygen tension that occurs in the tumor microenvironment. Results We determined the gene expression profile of 9 neuroblastoma cell lines cultured under normoxic and hypoxic conditions. We studied a heterogeneous set of neuroblastoma cell lines to mimic the in vivo situation and to test the robustness and validity of the l1-l2 regularization with double optimization. Analysis by hierarchical, spectral, and k-means clustering or supervised approach based on t-test analysis divided the cell lines on the bases of genetic differences. However, the disturbance of this strong transcriptional response completely masked the detection of the more subtle response to hypoxia. Different results were obtained when we applied the l1-l2 regularization framework. The algorithm distinguished the normoxic and hypoxic statuses defining signatures comprising 3 to 38 probesets, with a leave-one-out error of 17%. A consensus hypoxia signature was established setting the frequency score at 50% and the correlation parameter ε equal to 100. This signature is composed by 11 probesets representing 8 well characterized genes known to be modulated by hypoxia. Conclusion We demonstrate that l1-l2 regularization

  5. Resolving the optical emission lines of Lya blob 'B1' at z=2.38: another hidden quasar

    CERN Document Server

    Overzier, R A; Dijkstra, M; Hatch, N A; Lehnert, M D; Villar-Martín, M; Wilman, R J; Zirm, A W

    2013-01-01

    We have used the SINFONI near-infrared integral field unit on the VLT to resolve the optical emission line structure of one of the brightest (L~1e44 erg/s) and nearest (z=2.38) of all Lya blobs (LABs). The target, known in the literature as object 'B1' (Francis et al. 1996), lies at a redshift where the main optical emission lines are accessible in the observed near-infrared. We detect luminous [OIII]4959,5007A and Ha emission with a spatial extent of at least 32x40 kpc (4"x5"). The dominant optical emission line component shows relatively broad lines (600-800 km/s, FWHM) and line ratios consistent with AGN-photoionization. The new evidence for AGN photoionization, combined with previously detected CIV and luminous, warm infrared emission, suggest that B1 is the site of a hidden quasar. This is confirmed by the fact that [OII] is relatively weak compared to [OIII] (extinction-corrected [OIII]/[OII] of about 3.8), which is indicative of a high, Seyfert-like ionization parameter. From the [OIII] luminosity we i...

  6. Liver Tumor Segmentation from MR Images Using 3D Fast Marching Algorithm and Single Hidden Layer Feedforward Neural Network

    Directory of Open Access Journals (Sweden)

    Trong-Ngoc Le

    2016-01-01

    Full Text Available Objective. Our objective is to develop a computerized scheme for liver tumor segmentation in MR images. Materials and Methods. Our proposed scheme consists of four main stages. Firstly, the region of interest (ROI image which contains the liver tumor region in the T1-weighted MR image series was extracted by using seed points. The noise in this ROI image was reduced and the boundaries were enhanced. A 3D fast marching algorithm was applied to generate the initial labeled regions which are considered as teacher regions. A single hidden layer feedforward neural network (SLFN, which was trained by a noniterative algorithm, was employed to classify the unlabeled voxels. Finally, the postprocessing stage was applied to extract and refine the liver tumor boundaries. The liver tumors determined by our scheme were compared with those manually traced by a radiologist, used as the “ground truth.” Results. The study was evaluated on two datasets of 25 tumors from 16 patients. The proposed scheme obtained the mean volumetric overlap error of 27.43% and the mean percentage volume error of 15.73%. The mean of the average surface distance, the root mean square surface distance, and the maximal surface distance were 0.58 mm, 1.20 mm, and 6.29 mm, respectively.

  7. Optimisation of Hidden Markov Model using Baum–Welch algorithm for prediction of maximum and minimum temperature over Indian Himalaya

    Indian Academy of Sciences (India)

    J C Joshi; Tankeshwar Kumar; Sunita Srivastava; Divya Sachdeva

    2017-02-01

    Maximum and minimum temperatures are used in avalanche forecasting models for snow avalanche hazard mitigation over Himalaya. The present work is a part of development of Hidden Markov Model (HMM) based avalanche forecasting system for Pir-Panjal and Great Himalayan mountain ranges of the Himalaya. In this work, HMMs have been developed for forecasting of maximum and minimum temperatures for Kanzalwan in Pir-Panjal range and Drass in Great Himalayan range with a lead time of two days. The HMMs have been developed using meteorological variables collected from these stations during the past 20 winters from 1992 to 2012. The meteorological variables have been used to define observations and states of the models and to compute model parameters (initial state, state transition and observation probabilities). The model parameters have been used in the Forward and the Viterbi algorithms to generate temperature forecasts. To improve the model forecasts, the model parameters have been optimised using Baum–Welch algorithm. The models have been compared with persistence forecast by root mean square errors (RMSE) analysis using independent data of two winters (2012–13, 2013–14). The HMM for maximum temperature has shown a 4–12% and 17–19% improvement in the forecast over persistence forecast, for day-1 and day-2, respectively. For minimum temperature, it has shown 6–38% and 5–12% improvement for day-1 and day-2, respectively.

  8. 基于遗传算法和隐马尔可夫模型的Web信息抽取的改进%Improvement of Web Information Extraction Based on Genetic Algorithm and Hidden Markov Model

    Institute of Scientific and Technical Information of China (English)

    李荣; 胡志军; 郑家恒

    2012-01-01

    In order to further enhance the accuracy and efficiency of Web information extraction, for the shortcomings of hybrid method of genetic algorithm and first-order hidden Markov model in the initial value selection and parameter optimization, an improved combined method embedded with genetic algorithm and second-order hidden Markov model was presented. In the hierarchical preprocessing phase, text was segmented hierarchically into proper lines,blocks and words by using the format information and text features. And then the embedded genetic algorithm and second-order hidden Markov hybrid model were adopted to train parameters,and the optimal and sub-optimal chromosomes were all retained to modify initial parameters of Baum-Welch algorithm and genetic algorithm was used repeatedly to fine-tune the second-order hidden Markov model. Finally the improved Viterbi algorithm was used to extract Web information. Experimental results show that the new method improves the performance in precision, recall and time.%为了进一步提高Web信息抽取的准确性和效率,针对Web信息抽取的遗传算法和一阶隐马尔可夫模型混合方法在初值选取和参数寻优上的不足,提出了一种遗传算法和二阶隐马尔可夫模型内嵌结合的改进方法.在分层预处理阶段,利用格式信息和文本特征将文本切分成文本行、块或单个的词等恰当的层次;然后采用内嵌的遗传算法和二阶隐马尔可夫混合模型训练参数,保留最优和次优染色体,修正Baum-Welch算法的初始参数,多次使用遗传算法微调二阶隐马尔可夫模型;最后用改进的Viterbi算法实现Web信息抽取.实验结果表明,改进方法在精确度、召回率指标和时间性能上均比遗传算法和一阶隐马尔可夫模型的混合方法具有更好的性能.

  9. A Two-Channel Training Algorithm for Hidden Markov Model and Its Application to Lip Reading

    Directory of Open Access Journals (Sweden)

    Yong Lian

    2005-06-01

    Full Text Available Hidden Markov model (HMM has been a popular mathematical approach for sequence classification such as speech recognition since 1980s. In this paper, a novel two-channel training strategy is proposed for discriminative training of HMM. For the proposed training strategy, a novel separable-distance function that measures the difference between a pair of training samples is adopted as the criterion function. The symbol emission matrix of an HMM is split into two channels: a static channel to maintain the validity of the HMM and a dynamic channel that is modified to maximize the separable distance. The parameters of the two-channel HMM are estimated by iterative application of expectation-maximization (EM operations. As an example of the application of the novel approach, a hierarchical speaker-dependent visual speech recognition system is trained using the two-channel HMMs. Results of experiments on identifying a group of confusable visemes indicate that the proposed approach is able to increase the recognition accuracy by an average of 20% compared with the conventional HMMs that are trained with the Baum-Welch estimation.

  10. On-line learning algorithms for locally recurrent neural networks.

    Science.gov (United States)

    Campolucci, P; Uncini, A; Piazza, F; Rao, B D

    1999-01-01

    This paper focuses on on-line learning procedures for locally recurrent neural networks with emphasis on multilayer perceptron (MLP) with infinite impulse response (IIR) synapses and its variations which include generalized output and activation feedback multilayer networks (MLN's). We propose a new gradient-based procedure called recursive backpropagation (RBP) whose on-line version, causal recursive backpropagation (CRBP), presents some advantages with respect to the other on-line training methods. The new CRBP algorithm includes as particular cases backpropagation (BP), temporal backpropagation (TBP), backpropagation for sequences (BPS), Back-Tsoi algorithm among others, thereby providing a unifying view on gradient calculation techniques for recurrent networks with local feedback. The only learning method that has been proposed for locally recurrent networks with no architectural restriction is the one by Back and Tsoi. The proposed algorithm has better stability and higher speed of convergence with respect to the Back-Tsoi algorithm, which is supported by the theoretical development and confirmed by simulations. The computational complexity of the CRBP is comparable with that of the Back-Tsoi algorithm, e.g., less that a factor of 1.5 for usual architectures and parameter settings. The superior performance of the new algorithm, however, easily justifies this small increase in computational burden. In addition, the general paradigms of truncated BPTT and RTRL are applied to networks with local feedback and compared with the new CRBP method. The simulations show that CRBP exhibits similar performances and the detailed analysis of complexity reveals that CRBP is much simpler and easier to implement, e.g., CRBP is local in space and in time while RTRL is not local in space.

  11. Approximation Algorithm for Line Segment Coverage for Wireless Sensor Network

    CERN Document Server

    Dash, Dinesh; Gupta, Arobinda; Nandy, Subhas C

    2010-01-01

    The coverage problem in wireless sensor networks deals with the problem of covering a region or parts of it with sensors. In this paper, we address the problem of covering a set of line segments in sensor networks. A line segment ` is said to be covered if it intersects the sensing regions of at least one sensor distributed in that region. We show that the problem of ?nding the minimum number of sensors needed to cover each member in a given set of line segments in a rectangular area is NP-hard. Next, we propose a constant factor approximation algorithm for the problem of covering a set of axis-parallel line segments. We also show that a PTAS exists for this problem.

  12. CIME Summer Course on Exploiting Hidden Structure in Matrix Computations : Algorithms and Applications

    CERN Document Server

    Simoncini, Valeria

    2016-01-01

    Focusing on special matrices and matrices which are in some sense "near" to structured matrices, this volume covers a broad range of topics of current interest in numerical linear algebra. Exploitation of these less obvious structural properties can be of great importance in the design of efficient numerical methods, for example algorithms for matrices with low-rank block structure, matrices with decay, and structured tensor computations. Applications range from quantum chemistry to queuing theory. Structured matrices arise frequently in applications. Examples include banded and sparse matrices, Toeplitz-type matrices, and matrices with semi-separable or quasi-separable structure, as well as Hamiltonian and symplectic matrices. The associated literature is enormous, and many efficient algorithms have been developed for solving problems involving such matrices. The text arose from a C.I.M.E. course held in Cetraro (Italy) in June 2015 which aimed to present this fast growing field to young researchers, exploit...

  13. A new algorithm to extract hidden rules of gastric cancer data based on ontology.

    Science.gov (United States)

    Mahmoodi, Seyed Abbas; Mirzaie, Kamal; Mahmoudi, Seyed Mostafa

    2016-01-01

    Cancer is the leading cause of death in economically developed countries and the second leading cause of death in developing countries. Gastric cancers are among the most devastating and incurable forms of cancer and their treatment may be excessively complex and costly. Data mining, a technology that is used to produce analytically useful information, has been employed successfully with medical data. Although the use of traditional data mining techniques such as association rules helps to extract knowledge from large data sets, sometimes the results obtained from a data set are so large that it is a major problem. In fact, one of the disadvantages of this technique is a lot of nonsense and redundant rules due to the lack of attention to the concept and meaning of items or the samples. This paper presents a new method to discover association rules using ontology to solve the expressed problems. This paper reports a data mining based on ontology on a medical database containing clinical data on patients referring to the Imam Reza Hospital at Tabriz. The data set used in this paper is gathered from 490 random visitors to the Imam Reza Hospital at Tabriz, who had been suspicions of having gastric cancer. The proposed data mining algorithm based on ontology makes rules more intuitive, appealing and understandable, eliminates waste and useless rules, and as a minor result, significantly reduces Apriori algorithm running time. The experimental results confirm the efficiency and advantages of this algorithm.

  14. Application of Genetic Algorithm for the Discovery of Hidden Temporal Patterns in Earthquakes Data

    Directory of Open Access Journals (Sweden)

    Sohair F Higazi

    2013-12-01

    Full Text Available Time Series Data mining (TSDM is one of the most widely used technique that deals with temporal patterns. Genetic algorithm (GA is a predictive TSDM search technique that is used for solving search/optimization problems. GA is based on the principles and mechanisms of natural selections to find the most nearest optimal solution available from a list of solutions. GA relies on a set of important fundamentals, such as chromosome, crossover and mutation. GA is applied to earthquakes data in the year 2003-2004 in the Suez Gulf in Egypt, gathered from the Egyptian National Seismic Network. The study does not aim to building time series models from the point of time, since the analysis neither include the time nor the prediction of when an earth quake will occur, but to determine the possibility of occurrence of a strong magnitude earthquake after specific sequence of previous earthquakes as temporal pattern. The temporal pattern cluster used is a "circle". The objective function used is a function that gives the highest percentage of correct classification. Empirical results show that crossover and mutation probabilities are 0.4 and .01 respectively for both the training and the testing sample. The algorithm yields 96.98% correct classification for the training sample, and 95.35% for the testing sample.

  15. A consensus line search algorithm for molecular potential energy functions.

    Science.gov (United States)

    Rurainski, Alexander; Hildebrandt, Andreas; Lenhof, Hans-Peter

    2009-07-15

    Force field based energy minimization of molecular structures is a central task in computational chemistry and biology. Solving this problem usually requires efficient local minimization techniques, i.e., iterative two-step methods that search first for a descent direction and then try to estimate the step width. The second step, the so called line search, typically uses polynomial interpolation schemes to estimate the next trial step. However, dependent on local properties of the objective function alternative schemes may be more appropriate especially if the objective function shows singularities or exponential behavior. As the choice of the best interpolation scheme cannot be made a priori, we propose a new consensus line search approach that performs several different interpolation schemes at each step and then decides which one is the most reliable at the current position. Although a naive consensus approach would lead to severe performance impacts, our method does not require additional evaluations of the energy function, imposing only negligible computational overhead. Additionally, our method can be easily adapted to the local behavior of other objective functions by incorporating suitable interpolation schemes or omitting non-fitting schemes. The performance of our consensus line search approach has been evaluated and compared to established standard line search algorithms by minimizing the structures of a large set of molecules using different force fields. The proposed algorithm shows better performance in almost all test cases, i.e., it reduces the number of iterations and function and gradient evaluations, leading to significantly reduced run times.

  16. A New Algorithm for Identifying Cis-Regulatory Modules Based on Hidden Markov Model

    Directory of Open Access Journals (Sweden)

    Haitao Guo

    2017-01-01

    Full Text Available The discovery of cis-regulatory modules (CRMs is the key to understanding mechanisms of transcription regulation. Since CRMs have specific regulatory structures that are the basis for the regulation of gene expression, how to model the regulatory structure of CRMs has a considerable impact on the performance of CRM identification. The paper proposes a CRM discovery algorithm called ComSPS. ComSPS builds a regulatory structure model of CRMs based on HMM by exploring the rules of CRM transcriptional grammar that governs the internal motif site arrangement of CRMs. We test ComSPS on three benchmark datasets and compare it with five existing methods. Experimental results show that ComSPS performs better than them.

  17. A novel seizure detection algorithm informed by hidden Markov model event states

    Science.gov (United States)

    Baldassano, Steven; Wulsin, Drausin; Ung, Hoameng; Blevins, Tyler; Brown, Mesha-Gay; Fox, Emily; Litt, Brian

    2016-06-01

    Objective. Recently the FDA approved the first responsive, closed-loop intracranial device to treat epilepsy. Because these devices must respond within seconds of seizure onset and not miss events, they are tuned to have high sensitivity, leading to frequent false positive stimulations and decreased battery life. In this work, we propose a more robust seizure detection model. Approach. We use a Bayesian nonparametric Markov switching process to parse intracranial EEG (iEEG) data into distinct dynamic event states. Each event state is then modeled as a multidimensional Gaussian distribution to allow for predictive state assignment. By detecting event states highly specific for seizure onset zones, the method can identify precise regions of iEEG data associated with the transition to seizure activity, reducing false positive detections associated with interictal bursts. The seizure detection algorithm was translated to a real-time application and validated in a small pilot study using 391 days of continuous iEEG data from two dogs with naturally occurring, multifocal epilepsy. A feature-based seizure detector modeled after the NeuroPace RNS System was developed as a control. Main results. Our novel seizure detection method demonstrated an improvement in false negative rate (0/55 seizures missed versus 2/55 seizures missed) as well as a significantly reduced false positive rate (0.0012 h versus 0.058 h-1). All seizures were detected an average of 12.1 ± 6.9 s before the onset of unequivocal epileptic activity (unequivocal epileptic onset (UEO)). Significance. This algorithm represents a computationally inexpensive, individualized, real-time detection method suitable for implantable antiepileptic devices that may considerably reduce false positive rate relative to current industry standards.

  18. Stacking Spectra in Protoplanetary Disks: Detecting Intensity Profiles from Hidden Molecular Lines in HD 163296

    Science.gov (United States)

    Yen, Hsi-Wei; Koch, Patrick M.; Liu, Hauyu Baobab; Puspitaningrum, Evaria; Hirano, Naomi; Lee, Chin-Fei; Takakuwa, Shigehisa

    2016-12-01

    We introduce a new stacking method in Keplerian disks that (1) enhances signal-to-noise ratios (S/Ns) of detected molecular lines and (2) makes visible otherwise-undetectable weak lines. Our technique takes advantage of the Keplerian rotational velocity pattern. It aligns spectra according to their different centroid velocities at their different positions in a disk and stacks them. After aligning, the signals are accumulated in a narrower velocity range as compared to the original line width without alignment. Moreover, originally correlated noise becomes decorrelated. Stacked and aligned spectra thus have a higher S/N. We apply our method to Atacama Large Millimeter/Submillimeter Array (ALMA) archival data of DCN (3-2), DCO+ (3-2), N2D+ (3-2), and H2CO (3{}{0,3}-2{}{0,2}), (3{}{2,2}-2{}{2,1}), and (3{}{2,1}-2{}{2,0}) in the protoplanetary disk around HD 163296. As a result, (1) the S/Ns of the originally detected DCN (3-2), DCO+ (3-2), H2CO (3{}{0,3}-2{}{0,2}), and N2D+ (3-2) lines are boosted by a factor of ≳4-5 at their spectral peaks, implying one order of magnitude shorter integration times to reach the original S/N; and (2) the previously undetectable spectra of the H2CO (3{}{2,2}-2{}{2,1}) and (3{}{2,1}-2{}{2,0}) lines are materialized at more than 3σ. These dramatically enhanced S/Ns allow us to measure intensity distributions in all lines with high significance. The principle of our method can be applied not only to Keplerian disks but also to any systems with ordered kinematic patterns.

  19. Singular point detection algorithm based on the transition line of the fingerprint orientation image

    CSIR Research Space (South Africa)

    Mathekga, ME

    2009-11-01

    Full Text Available A new algorithm for identifying and locating singular points on a fingerprint image is presented. This algorithm is based on properties of the fingerprint orientation image, including a feature defined as a transition line. The transition line...

  20. Eliminating harmonics in line to line voltage using genetic algorithm using multilevel inverter

    Energy Technology Data Exchange (ETDEWEB)

    Gunasekaran, R. [Excel College of Engineering and Technology, Komarapalayam (India). Electrical and Electronics Engineering; Karthikeyan, C. [K.S. Rangasamy College of Engineering, Tamil Nadu (India). Electrical and Electronics Engineering

    2017-04-15

    In this project the total harmonic distortion (THD) minimization of the multilevel inverters output voltage is discussed. The approach in reducing harmonics contents in inverters output voltage is THD elimination. The switching angles are varied with the fundamental frequency so the output THD is minimized. In three phase applications, the line voltage harmonics are of the main concern from the load point of view. Using a genetic algorithm, a THD minimization process is directly applied to the line to line voltage of the inverter. Genetic (GA) algorithm allows the determination of the optimized parameters and consequently an optimal operating point of the circuit and a wide pass band with a unity gain is obtained.

  1. Stacking Spectra in Protoplanetary Disks: Detecting Intensity Profiles from Hidden Molecular Lines in HD 163296

    CERN Document Server

    Yen, Hsi-Wei; Liu, Hauyu Baobab; Puspitaningrum, Evaria; Hirano, Naomi; Lee, Chin-Fei; Takakuwa, Shigehisa

    2016-01-01

    We introduce a new stacking method in Keplerian disks that (1) enhances signal-to-noise ratios (S/N) of detected molecular lines and (2) that makes visible otherwise undetectable weak lines. Our technique takes advantage of the Keplerian rotational velocity pattern. It aligns spectra according to their different centroid velocities at their different positions in a disk and stacks them. After aligning, the signals are accumulated in a narrower velocity range as compared to the original line width without alignment. Moreover, originally correlated noise becomes de-correlated. Stacked and aligned spectra, thus, have a higher S/N. We apply our method to ALMA archival data of DCN (3-2), DCO+ (3-2), N2D+ (3-2), and H2CO (3_0,3-2_0,2), (3_2,2-2_2,1), and (3_2,1-2_2,0) in the protoplanetary disk around HD 163296. As a result, (1) the S/N of the originally detected DCN (3-2), DCO+ (3-2), and H2CO (3_0,3-2_0,2) and N2D+ (3-2) lines are boosted by a factor of >4-5 at their spectral peaks, implying one order of magnitud...

  2. Optimization of assembly line balancing using genetic algorithm

    Institute of Scientific and Technical Information of China (English)

    N Barathwaj; P Raja; S Gokulraj

    2015-01-01

    In a manufacturing industry, mixed model assembly line (MMAL) is preferred in order to meet the variety in product demand. MMAL balancing helps in assembling products with similar characteristics in a random fashion. The objective of this work aims in reducing the number of workstations, work load index between stations and within each station. As manual contribution of workers in final assembly line is more, ergonomics is taken as an additional objective function. Ergonomic risk level of a workstation is evaluated using a parameter called accumulated risk posture (ARP), which is calculated using rapid upper limb assessment (RULA) check sheet. This work is based on the case study of an MMAL problem in Rane (Madras) Ltd. (India), in which a problem based genetic algorithm (GA) has been proposed to minimize the mentioned objectives. The working of the genetic operators such as selection, crossover and mutation has been modified with respect to the addressed MMAL problem. The results show that there is a significant impact over productivity and the process time of the final assembled product, i.e., the rate of production is increased by 39.5% and the assembly time for one particular model is reduced to 13 min from existing 18 min. Also, the space required using the proposed assembly line is only 200 m2 against existing 350 m2. Further, the algorithm helps in reducing workers fatigue (i.e., ergonomic friendly).

  3. Resolving the Optical Emission Lines of Lyα Blob "B1" at z = 2.38: Another Hidden Quasar

    Science.gov (United States)

    Overzier, R. A.; Nesvadba, N. P. H.; Dijkstra, M.; Hatch, N. A.; Lehnert, M. D.; Villar-Martín, M.; Wilman, R. J.; Zirm, A. W.

    2013-07-01

    We have used the SINFONI near-infrared integral field unit on the Very Large Telescope to resolve the optical emission line structure of one of the brightest (L Lyα ≈ 1044 erg s-1) and nearest (z ≈ 2.38) of all Lyα blobs (LABs). The target, known in the literature as object "B1", lies at a redshift where the main optical emission lines are accessible in the observed near-infrared. We detect luminous [O III] λλ4959, 5007 and Hα emission with a spatial extent of at least 32 × 40 kpc (4'' × 5''). The dominant optical emission line component shows relatively broad lines (600-800 km s-1, FWHM) and line ratios consistent with active galactic nucleus (AGN) photoionization. The new evidence for AGN photoionization, combined with previously detected C IV and luminous, warm infrared emission, suggest that B1 is the site of a hidden quasar. This is confirmed by the fact that [O II] is relatively weak compared with [O III] (extinction-corrected [O III]/[O II] of about 3.8), which is indicative of a high, Seyfert-like ionization parameter. From the extinction-corrected [O III] luminosity we infer a bolometric AGN luminosity of ~3 × 1046 erg s-1, and further conclude that the obscured AGN may be Compton-thick given existing X-ray limits. The large line widths observed are consistent with clouds moving within the narrow-line region of a luminous QSO. The AGN scenario is capable of producing sufficient ionizing photons to power the Lyα, even in the presence of dust. By performing a census of similar objects in the literature, we find that virtually all luminous LABs harbor obscured quasars. Based on simple duty-cycle arguments, we conclude that AGNs are the main drivers of the Lyα in LABs rather than the gravitational heating and subsequent cooling suggested by cold stream models. We also conclude that the empirical relation between LABs and overdense environments at high redshift must be due to a more fundamental correlation between AGNs (or massive galaxies) and

  4. Extended Approach to Water Flow Algorithm for Text Line Segmentation

    Institute of Scientific and Technical Information of China (English)

    Darko Brodi(c)

    2012-01-01

    This paper proposes a new approach to the water flow algorithm for text line segmentation.In the basic method the hypothetical water flows under few specified angles which have been defined by water flow angle as parameter.It is applied to the document image frame from left to right and vice versa.As a result,the unwetted and wetted areas are established.Thesc areas separate text from non-text elements in each text line,respectively.Hence,they represent the control areas that are of major importance for text line segmentation.Primarily,an extended approach means extraction of the connected-components by bounding boxes ovcr text.By this way,each connected component is mutually separated.Hence,the water flow angle,which defines the unwetted areas,is determined adaptively.By choosing appropriate water flow angle,the unwetted areas are lengthening which leads to the better text line segmentation.Results of this approach are encouraging due to the text line segmentation improvement which is the most challenging step in document image processing.

  5. An Algorithm to detect balancing of iterated line sigraph.

    Science.gov (United States)

    Sinha, Deepa; Sethi, Anshu

    2015-01-01

    A signedgraph (or sigraph in short) S is a graph G in which each edge x carries a value [Formula: see text] called its sign   denoted specially as [Formula: see text]. Given a sigraph S,  H = L(S)   called the line sigraph of S is that sigraph in which edges of S are represented as vertices, two of these vertices are defined to be adjacent whenever the corresponding edges in S have a vertex in common and any such edge ef is defined to be negative whenever both e and f are negative edges in S. Here S is called root sigraph of H. Iterated signed line graphs [Formula: see text] = [Formula: see text] k [Formula: see text] [Formula: see text], S:= [Formula: see text] is defined similarly. In this paper, we give an algorithm to obtain iterated line sigraph and detect for which value of 'k' it is balanced and determine its complexity. In the end we will propose a technique that will use adjacency matrix of S and adjacency matrix of [Formula: see text] which is balanced for some 'k' as a parameter to encrypt a network and forward the data in the form of balanced [Formula: see text] and will decrypt it by applying inverse matrix operations.

  6. A new nonuniformity correction algorithm for infrared line scanners

    Science.gov (United States)

    Sui, Jing; Jin, Wei-qi; Dong, Li-quan; Wang, Xia

    2006-05-01

    Nonuniformity correction (NUC) is a critical task for achieving higher performances in modern infrared imaging systems. The striping fixed pattern noise produced by the scanning-type infrared imaging system can hardly be removed clearly by many scene-based non-uniformity correction methods, which can work effectively for staring focal plane arrays (FPA). We proposed an improved nonuniformity algorithm that corrects the aggregate nonuniformity by two steps for the infrared line scanners (IRLS). The novel contribution in our approach is the integration of local constant statistics (LCS) constraint and neural networks. First, the nonuniformity due to the readout electronics is corrected by treating every row of pixels as one channel and normalizing the channel outputs so that each channel produces pixels with the same mean and standard deviation as median value of the local channels statistics. Second, for IRLS every row is generated by pushbrooming one detector on line sensors, we presume each detector has one neuron with a weight and an offset as correction parameters, which can update column by column recursively at Least Mean Square sense. A one-dimensional median filter is used to produce ideal output of linear neural network and some optimization strategies are added to increase the robustness of learning process. Applications to both simulated and real infrared images demonstrated that this algorithm is self-adaptive and able to complete NUC by only one frames. If the nonuniformity is not so severe then only the first step can obtain a good correction result. Combination of two steps can achieve a higher correction level and remove stripe pattern noise clearly.

  7. Scheduling to minimize average completion time: Off-line and on-line algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Hall, L.A. [Johns Hopkins Univ., Baltimore, MD (United States); Shmoys, D.B. [Cornell Univ., Ithaca, NY (United States); Wein, J. [Polytechnic Univ., Brooklyn, NY (United States)

    1996-12-31

    Time-indexed linear programming formulations have recently received a great deal of attention for their practical effectiveness in solving a number of single-machine scheduling problems. We show that these formulations are also an important tool in the design of approximation algorithms with good worst-case performance guarantees. We give simple new rounding techniques to convert an optimal fractional solution into a feasible schedule for which we can prove a constant-factor performance guarantee, thereby giving the first theoretical evidence of the strength of these relaxations. Specifically, we consider the problem of minimizing the total weighted job completion time on a single machine subject to precedence constraints, and give a polynomial-time (4 + {epsilon})-approximation algorithm, for any {epsilon} > 0; the best previously known guarantee for this problem was superlogarithmic. With somewhat larger constants, we also show how to extend this result to the case with release date constraints, and still more generally, to the case with m identical parallel machines. We give two other techniques for problems in which there are release dates, but no precedence constraints: the first is based on other new LP rounding algorithms, whereas the second is a general framework for designing on-line algorithms to minimize the total weighted completion time.

  8. The Congestion Management of Transmission Line using Bacterial Foraging Algorithm

    Directory of Open Access Journals (Sweden)

    Rasul Mokhtarpur

    2012-12-01

    Full Text Available The power systems movement to the electricity industry restructuring circumstance is done with the purpose of deformation of this industry up to elimination of exclusion and fairy competition increment and freely accessing to transmission line. But the possibility of congestion creation in the transmission line could encounter market role makers with problems such as energy price exclusion, difference in energy price at some busses and abusing of some jobbers in the market in these new systems. The study and survey in the interest of prevention and lowering of this phenomenon is done in the name of 'Congestion Management'.In this study after investigation of energy markets and the definition of congestion, local marginal price concept and ordinary method are introduced and then Bacterial Foraging Optimization Algorithm will be investigated in order to optimal determination of Local Marginal Price (LMP in the busses with purpose of production minimizing in pool market and lately it will be tested on a 24-bus standard network to formulate the optimization problem and to make it applicable.

  9. Development of hybrid genetic algorithms for product line designs.

    Science.gov (United States)

    Balakrishnan, P V Sundar; Gupta, Rakesh; Jacob, Varghese S

    2004-02-01

    In this paper, we investigate the efficacy of artificial intelligence (AI) based meta-heuristic techniques namely genetic algorithms (GAs), for the product line design problem. This work extends previously developed methods for the single product design problem. We conduct a large scale simulation study to determine the effectiveness of such an AI based technique for providing good solutions and bench mark the performance of this against the current dominant approach of beam search (BS). We investigate the potential advantages of pursuing the avenue of developing hybrid models and then implement and study such hybrid models using two very distinct approaches: namely, seeding the initial GA population with the BS solution, and employing the BS solution as part of the GA operator's process. We go on to examine the impact of two alternate string representation formats on the quality of the solutions obtained by the above proposed techniques. We also explicitly investigate a critical managerial factor of attribute importance in terms of its impact on the solutions obtained by the alternate modeling procedures. The alternate techniques are then evaluated, using statistical analysis of variance, on a fairy large number of data sets, as to the quality of the solutions obtained with respect to the state-of-the-art benchmark and in terms of their ability to provide multiple, unique product line options.

  10. The Study on On-line Scheduling Algorithm of Imprecise Computation under Transient Overload

    Institute of Scientific and Technical Information of China (English)

    WEIZhenhua; HONGBingrong; QIAOYongqiang; CAIZesu; PENGJunjie

    2003-01-01

    Transient overload always occurs in realtime computer system. An on-line scheduling algorithm of imprecise computation is proposed in this paper to deal with it. This algorithm can be sure of getting acceptable computation result under the condition of overload, and at the same time it can improve the computation precision as much as possible. The system model of imprecise computation and the on-line imprecise computation algorithm are elaborated. And the algorithm is proved correct by simulation.

  11. A LINE SEARCH AND TRUST REGION ALGORITHM WITH TRUST REGION RADIUS CONVERGING TO ZERO

    Institute of Scientific and Technical Information of China (English)

    Jin-yan Fan; Wen-bao Ai; Qun-ying Zhang

    2004-01-01

    In this paper, we present a new line search and trust region algorithm for unconstrained optimization problem with the trust region radius converging to zero. The new trust region algorithm performs a backtracking line search from the failed. Point instead of resolving the subproblem when the trial step results in an increase in the objective function. We show that the algorithm preserves the convergence properties of the traditional trust region algorithms. Numerical results are also given.

  12. 基于压缩视频的隐写算法研究%Write a Compression Algorithm Based on Hidden Video

    Institute of Scientific and Technical Information of China (English)

    李继光

    2014-01-01

    视频隐写是以视频为载体的隐写技术,根据嵌入时载体视频是否经过压缩编码将视频隐写分为基于原始视频的隐写和基于压缩视频的隐写两个大类。该文介绍了几种常见的基于压缩视频的隐写算法,给出了一般原理模型,对AC系数、DC系数和运动矢量等编码单元上隐写算法进行了简单介绍,提出了提高隐藏率的基本思想。%Video steganography is a video steganography technology, according to the embedded video compression coding is the carrier through the video steganography is divided into the original video steganography and steganalysis based on compressed video based on two categories. This paper introduces several common write algorithm of compressed video based on the implicit, general principle of model, algorithm written hidden AC coefficients, DC coefficients and motion vectors encoding unit were in-troduced, raises the basic thought hidden rate.

  13. EQUILIBRIUM ALGORITHMS WITH NONMONOTONE LINE SEARCH TECHNIQUE FOR SOLVING THE TRAFFIC ASSIGNMENT PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    ZHAO Hui; GAO Ziyou

    2005-01-01

    This paper presents a unified framework of the nonmonotone convex combination algorithms (such as Frank-Wolfe Algorithm) for solving the traffic assignment problems. Global convergence results are established under mild conditions. The line search procedure used in our algorithm includes the nonmonotone Armijo rule, the nonmonotone Goldstein rule and the nonmonotone Wolfe rule as special cases. So, the new algorithm can be viewed as a generalization of the regular convex combination algorithm.

  14. On-line least squares support vector machine algorithm in gas prediction

    Institute of Scientific and Technical Information of China (English)

    ZHAO Xiao-hu; WANG Gang; ZHAO Ke-ke; TAN De-jian

    2009-01-01

    Traditional coal mine safety prediction methods are off-line and do not have dynamic prediction functions. The Support Vector Machine (SVM) is a new machine learning algorithm that has excellent properties. The least squares support vector machine (LS-SVM) algorithm is an improved algorithm of SVM. But the common LS-SVM algorithm, used directly in safety predictions, has some problems. We have first studied gas prediction problems and the basic theory of LS-SVM. Given these problems, we have investigated the affect of the time factor about safety prediction and present an on-line prediction algorithm, based on LS-SVM. Finally, given our observed data, we used the on-line algorithm to predict gas emissions and used other related algorithm to com- pare its performance. The simulation results have verified the validity of the new algorithm.

  15. Parsing algorithm for line-drawing pattern recognition

    Science.gov (United States)

    Wang, Patrick S. P.; Zhang, Y. Y.

    1991-02-01

    The concept of " universal array grammar" for off-line line drawing patterns is proposed and an algurithm for transforming two-dirrensional line drawing patterns to parsing sequences based on the " universal array grammar" is constructed.

  16. Fusion Recommendation Algorithm Based on Hidden Markov Models%基于隐马尔科夫模型的融合推荐算法

    Institute of Scientific and Technical Information of China (English)

    杨安驹; 杨云; 周嫒嫒; 闵玉涓; 秦怡

    2015-01-01

    针对传统的基于项目的协同过滤推荐算法中数据稀疏问题,以及受时间效应影响推荐准确度较低问题,提出将隐马尔科夫模型与传统的基于项目的协同过滤推荐算法相融合的推荐算法HMM-ItemCF。算法通过隐马尔科夫模型对系统中所有用户的评分行为,与目标用户的历史评分行为进行统筹分析,找到一批用户下一时刻概率最高的评分对象,并将这些评分对象发生概率与传统的项目相似度计算方法相加权得到新的相似度,最终产生推荐结果。仿真实验中对算法的重要参数进行训练,并与其他算法进行对比,证明改进后的算法是有效的。%In view of the problems of the traditional collaborative filtering recommendation algorithm based on the project of data sparseness and the low accuracy of recommendation, the thesis puts forward the HMM-ItemCF recommendation algorithm which combines Hidden Markov Model with the traditional collaborative filtering recommendation algorithm based on the project. The al-gorithm using Hidden Markov Model to all the users in the system evaluation behavior and the history of the target user behavior to carry on the overall analysis, to find the probability of the next moment a group of users with the highest score object, and the probability of occurrence of these scores with traditional objects project weighted similarity calculation method to get a new recom-mendation similarity ultimately produce results. The simulation experiment is carried out on the algorithm with an important pa-rameter in the training, and compared with other algorithms. It proves that the improved algorithm is effective.

  17. Impact of different disassembly line balancing algorithms on the performance of dynamic kanban system for disassembly line

    Science.gov (United States)

    Kizilkaya, Elif A.; Gupta, Surendra M.

    2005-11-01

    In this paper, we compare the impact of different disassembly line balancing (DLB) algorithms on the performance of our recently introduced Dynamic Kanban System for Disassembly Line (DKSDL) to accommodate the vagaries of uncertainties associated with disassembly and remanufacturing processing. We consider a case study to illustrate the impact of various DLB algorithms on the DKSDL. The approach to the solution, scenario settings, results and the discussions of the results are included.

  18. The derivation of on-line algorithms, with an application to finding palindromes

    NARCIS (Netherlands)

    Jeuring, J.T.

    1994-01-01

    A theory for the derivation of on-line algorithms is presented. The algorithms are derived in the Bird-Meertens calculus for program transformations. This calculus provides a concise functional notation for algorithms, and a few powerful theorems for proving equalities of functions. The

  19. 直线生成的像素行算法%Straight line generation algorithm based on pixel line

    Institute of Scientific and Technical Information of China (English)

    厉玉蓉; 董付国; 刘岩; 牛翠霞

    2011-01-01

    On the basis of Bresenham algorithm and other fast algorithms based on multi-pixel incremental generation method, we proposes and implements a new algorithm based on pixel line, considering that the increment between adjacent pixels is determined by the line slope. We take full advantage of the relativity between pixels in the same line, generating all pixels in a pixel line once. The new algorithm guarantees the same line precision as the Bresenham algorithm, using only integer operation and shift operations, which can give a higher speed and can easily be implemented in hardware. The smaller the angle between the line and the coordination axis is, the more efficiency this algorithm can obtain. This algorithm based on pixel line is of great significance.%在Bresenham算法基础上,采用多点画线法的思想,设计并实现了直线快速生成的像素行算法.根据相邻像素之间的增量取决于直线斜率这一特点,该算法一次生成一个像素行中所有像素点坐标.算法分析与大量实验结果均表明,在保证直线精确度与Bresenham算法相同的情况下,像素行算法减少了大量计算,提高了直线生成效率,直线与x或y坐标轴夹角α越小,算法速度就越快,提高倍数接近于1/tanα,具有较大的理论价值和实际意义.

  20. On-line Scheduling Algorithm for Penicillin Fed-batch Fermentation

    Institute of Scientific and Technical Information of China (English)

    XUE Yao-feng; YUAN Jing-qi

    2005-01-01

    An on-line scheduling algorithm to maximize gross profit of penicillin fed-batch fermentation is proposed. According to the on-line classification method, fed-batch fermentation batches are classified into three categories. Using the scheduling strategy, the optimal termination sequence of batches is obtained. Pseudo on-line simulations for testing the proposed algorithm with the data from industrial scale penicillin fermentation are carried out.

  1. THE RESEARCH OF LINE MATCHING ALGORITHM UNDER THE IMPROVED HOMOGRAPH MATRIX CONSTRAINT CONDITION

    OpenAIRE

    Wang, W.; Lou, A.; Wang, J.

    2012-01-01

    Focusing on the mismatching problems in line matching, this paper integrates the radiation information and the geometry information of the imagery as the multi-constraint conditions, and presents an improved line matching algorithm based on the improved homograph matrix constraint condition. This algorithm firstly obtains the homologous points by feature matching, and for each line to be matched, it calculates the homograph matrix with the homologous points in the neighbourhood of th...

  2. Inter-Circuit Fault Location Algorithm for Two-Parallel Transmission Line

    Institute of Scientific and Technical Information of China (English)

    张庆超; 李大勇; 李晖; 屈洪鑫

    2003-01-01

    A novel numerical algorithm of fault location estimation for four-line fault without ground connection involving phases from each of the parallel lines is presented in this paper. It is based on one-terminal voltage and current data. The loop and nodal equations comparing faulted phase to non-faulted phase of two-parallel lines are introduced in the fault location estimation model, in which the source impedance of a remote end is not involved. The effects of load flow and fault resistance on the accuracy of fault location are effectively eliminated, therefore a precise algorithm of locating fault is derived. The algorithm is demonstrated by digital computer simulations.

  3. A FAST BIT-LOADING ALGORITHM FOR HIGH SPEED POWER LINE COMMUNICATIONS

    Institute of Scientific and Technical Information of China (English)

    Zhang Shengqing; Zhao Li; Zou Cairong

    2012-01-01

    Adaptive bit-loading is a key technology in high speed power line communications with the Orthogonal Frequency Division Multiplexing (OFDM) modulation technology.According to the real situation of the transmitting power spectrum limited in high speed power line communications,this paper explored the adaptive bit loading algorithm to maximize transmission bit number when transmitting power spectral density and bit error rate are not exceed upper limit.With the characteristics of the power line channel,first of all,it obtains the optimal bit loading algorithm,and then provides the improved algorithm to reduce the computational complexity.Based on the analysis and simulation,it offers a non-iterative bit allocation algorithm,and finally the simulation shows that this new algorithm can greatly reduce the computational complexity,and the actual bit allocation results close to optimal.

  4. PERBANDINGAN ALGORITMA HIDDEN SPACE REMOVAL: Z-UFFER DAN SCANLINE DILIHAT DARI PENGGUNAAN MEMORI DAN KECEPATAN

    Directory of Open Access Journals (Sweden)

    Djoni Haryadi Setiabudi

    2001-01-01

    Full Text Available Hidden surface removal is an algorithm used to hide part of the object which is blocked by the object in front of it. If there are two plane crossed each other displayed without Hidden surface removal algorithm, the crossing section is invisible, because one object will block another object without crossing. The crossing sections can be displayed using Hidden surface removal algorithm. Z buffer algorithm implements Hidden Surface Removal by entering color and depth of the visible plane into the buffer, then displays the result on the screen. Scan Line algorithm will scanning the screen row by row of each object surface in three dimension and then displays on the screen after each row scanning. Both of the algorithms will be compared based on the memory usage dan time needed to execute. The experiment shows that Scanline algorithm uses less memory compared with Z-Buffer algoritm. Furthermore, based on the speed, the Scanline is better than the Z-Buffer if the object is collected on the y row, but the Z-Buffer is better than the Scanline if the object scattered and used all rows on the drawing plane and has more surface do displayed. Abstract in Bahasa Indonesia : Hidden surface removal adalah suatu algoritma yang digunakan untuk menghilangkan penampilan bagian yang tertutup oleh objek yang didepannya. Apabila ada dua bidang yang berpotongan, apabila ditampilkan biasa tanpa menggunakan algoritma Hidden surface removal maka bagian yang berpotongan itu akan tidak kelihatan, oleh karena bidang yang satu ditutupi oleh bagian yang lain tanpa memotong. Oleh karena itu untuk menampilkan bidang perpotongan, diperlukan Algoritma Hidden surface removal. Algoritma Z buffer melaksanakan proses Hidden Surface Removal dengan memasukkan warna dan kedalaman bidang permukaan yang tampak ke dalam buffer, dan kemudian setelah selesai hasilnya ditampilkan ke layar. Algoritma Scan Line melakukan scanning untuk setiap baris dari layar bidang gambar untuk setiap

  5. A least mean squares CUBIC algorithm for on-line differential of sampled analog signals

    Science.gov (United States)

    Allum, J. H. J.

    1975-01-01

    A digital computer algorithm is developed for on-line time differentiation of sampled analog voltage signals. The derivative is obtained by employing a least mean squares technique. The recursive algorithm results in a considerable reduction in computer time compared to a complete new solution of the normal equations each time a new data point is accepted. Implementation of the algorithm on a digital computer is discussed. Examples are simulated on a DEC PDP-8 computer.

  6. On-line blind source separation algorithm based on second order statistics

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    An on-line blind source separation (BSS) algorithm is presented in this paper under the assumption that sources are temporarily correlated signals. By using only some of the observed samples in a recursive calculation, the whitening matrix and the rotation matrix could be approximately obtained through the measurement of only one cost function. Simulations show good performance of the algorithm.

  7. An Adaptive Lattice Algorithm for Spectral Line Estimation.

    Science.gov (United States)

    1987-06-01

    with linear phase are important in applications like speech processing and data transmission, because in these applications a nonlinear phase filter is...phase are important in applications like speech processing and data transmission, because in these applications a nonlinear phase filter is harmful. The...Perspective, Proc IEEE, Vol. 69, pp. 1395-1414, Nov. 1981. 12. Friedlander, B. and M. Morf, Least Squares Algorithms for Linear- Phase Filtering , IEEE

  8. A dynamic programming algorithm for the buffer allocation problem in homogeneous asymptotically reliable serial production lines

    Directory of Open Access Journals (Sweden)

    Diamantidis A. C.

    2004-01-01

    Full Text Available In this study, the buffer allocation problem (BAP in homogeneous, asymptotically reliable serial production lines is considered. A known aggregation method, given by Lim, Meerkov, and Top (1990, for the performance evaluation (i.e., estimation of throughput of this type of production lines when the buffer allocation is known, is used as an evaluative method in conjunction with a newly developed dynamic programming (DP algorithm for the BAP. The proposed algorithm is applied to production lines where the number of machines is varying from four up to a hundred machines. The proposed algorithm is fast because it reduces the volume of computations by rejecting allocations that do not lead to maximization of the line's throughput. Numerical results are also given for large production lines.

  9. Improved Fault Classification in Series Compensated Transmission Line: Comparative Evaluation of Chebyshev Neural Network Training Algorithms.

    Science.gov (United States)

    Vyas, Bhargav Y; Das, Biswarup; Maheshwari, Rudra Prakash

    2016-08-01

    This paper presents the Chebyshev neural network (ChNN) as an improved artificial intelligence technique for power system protection studies and examines the performances of two ChNN learning algorithms for fault classification of series compensated transmission line. The training algorithms are least-square Levenberg-Marquardt (LSLM) and recursive least-square algorithm with forgetting factor (RLSFF). The performances of these algorithms are assessed based on their generalization capability in relating the fault current parameters with an event of fault in the transmission line. The proposed algorithm is fast in response as it utilizes postfault samples of three phase currents measured at the relaying end corresponding to half-cycle duration only. After being trained with only a small part of the generated fault data, the algorithms have been tested over a large number of fault cases with wide variation of system and fault parameters. Based on the studies carried out in this paper, it has been found that although the RLSFF algorithm is faster for training the ChNN in the fault classification application for series compensated transmission lines, the LSLM algorithm has the best accuracy in testing. The results prove that the proposed ChNN-based method is accurate, fast, easy to design, and immune to the level of compensations. Thus, it is suitable for digital relaying applications.

  10. HIDDEN WEBPAGE INFORMATION EXTRACTION ALGORITHM USING DOM STATE TRANSFER%基于DO M状态转换的隐网页信息抽取算法

    Institute of Scientific and Technical Information of China (English)

    房勇; 李银胜

    2015-01-01

    A great deal of dynamic JavaScript containing in webpages leads to most of the webpage contents being invisible to traditional webpage crawlers.Therefore we proposed a DOM state transfer-based hidden webpage information extraction algorithm.The algorithm incrementally constructs the DOM state transfer machine and uses DOM nodes and their click events as the inputting events of transfer machine.For the transfer paths which can result in the variation of object nodes,recursive search will be done;By the playback of click path it automatically completes contents grasping of the object nodes;By covering the prototype of audiomonitor method it obtains all the clickable nodes in DOM tree as the candidate nodes.The algorithm employs RTDM algorithm and self-defined filter to compress DOM state space in order to shrink the search space,and carries out heuristic search by defining the distance between candidate nodes in DOM tree and object nodes as the h marking.Experiment demonstrated that the algorithm studied has excellent performance,it achieved 89.48% accuracy in hidden webpage content extraction,and could be used in the fields of automatic webpage test and webpage crawler,etc.%由于网页大量包含动态JavaScript脚本,造成大部分网页内容对传统的网页爬虫不可见。为此,提出一种基于DOM状态转换的隐网页信息抽取算法。该算法增量地构建DOM状态转换机,以DOM节点及其点击事件作为状态机的输入事件。对能够引起目标节点变化的转换路径进行递归搜索;通过重放点击路径,自动完成目标节点的内容抓取;通过覆盖监听器方法原型,获取DOM树中所有可点击的节点作为候选节点。该算法应用RTDM算法和自定义过滤器来对DOM状态空间进行压缩,以缩减搜索空间,定义DOM树中候选节点到目标节点的距离作为h打分,进行启发式搜索。实验表明,所研究算法性能优良,对隐网页

  11. Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search

    Institute of Scientific and Technical Information of China (English)

    2009-01-01

    In this paper, we propose a smoothing algorithm for solving the monotone symmetric cone complementarity problems (SCCP for short) with a nonmonotone line search. We show that the nonmonotone algorithm is globally convergent under an assumption that the solution set of the problem concerned is nonempty. Such an assumption is weaker than those given in most existing algorithms for solving optimization problems over symmetric cones. We also prove that the solution obtained by the algorithm is a maximally complementary solution to the monotone SCCP under some assumptions.

  12. A Fast Inspection of Tool Electrode and Drilling Depth in EDM Drilling by Detection Line Algorithm

    OpenAIRE

    Kuo-Yi Huang

    2008-01-01

    The purpose of this study was to develop a novel measurement method using a machine vision system. Besides using image processing techniques, the proposed system employs a detection line algorithm that detects the tool electrode length and drilling depth of a workpiece accurately and effectively. Different boundaries of areas on the tool electrode are defined: a baseline between base and normal areas, a ND-line between normal and drilling areas (accumulating carbon area), and a DD-line betwee...

  13. 基于启发式查询词选择算法的Hidden Web获取研究%Research on crawling Hidden Web based on heuristic query selection algorithm

    Institute of Scientific and Technical Information of China (English)

    姚全珠; 杨增辉; 张楠; 田元

    2007-01-01

    Hidden Web因为其隐蔽性而难以直接抓取,因此成为信息检索研究的一个新领域.提出了一种获取Hidden Web信息的方法,讨论了实现的关键技术.通过设计提出的启发式查询词选择算法,提高了抓取的效率.实验证明了该模型和算法的有效性.

  14. A Novel Assembly Line Scheduling Algorithm Based on CE-PSO

    Directory of Open Access Journals (Sweden)

    Xiaomei Hu

    2015-01-01

    Full Text Available With the widespread application of assembly line in enterprises, assembly line scheduling is an important problem in the production since it directly affects the productivity of the whole manufacturing system. The mathematical model of assembly line scheduling problem is put forward and key data are confirmed. A double objective optimization model based on equipment utilization and delivery time loss is built, and optimization solution strategy is described. Based on the idea of solution strategy, assembly line scheduling algorithm based on CE-PSO is proposed to overcome the shortcomings of the standard PSO. Through the simulation experiments of two examples, the validity of the assembly line scheduling algorithm based on CE-PSO is proved.

  15. Composite cone-beam filtered backprojection algorithm based on nutating line

    Institute of Scientific and Technical Information of China (English)

    WANG Yu; OU Zong-ying; SU Tie-ming; WANG Feng

    2006-01-01

    The FDK algorithm is the most popular cone beam algorithm in the medical and industrial imaging field.Due to data insufficiency acquired from a circular trajectory,the images reconstructed by the FDK algorithm suffer from the intensity droping with increasing cone angle.To overcome the drawback,a modified FDK algorithm is presented by convert the 1D ramp filtering direction from along the horizontal lines to along the nutating lines based on the result of Turbell.Unlike Turbell's method,there is no need for our algorithm to rebin the cone-beam data into 3D parallel-beam data before reconstructing.Moreover pre-weighting of the projection data is corrected by compensating for the cone angle effect.In addition,another correction term derived from the result of Hu is also induced into our algorithm.The simulation experiments demonstrate that the final algorithm can suppress the intensity drop associated with the FDK algorithm.

  16. An approach to a comprehensive test framework for analysis and evaluation of text line segmentation algorithms.

    Science.gov (United States)

    Brodic, Darko; Milivojevic, Dragan R; Milivojevic, Zoran N

    2011-01-01

    The paper introduces a testing framework for the evaluation and validation of text line segmentation algorithms. Text line segmentation represents the key action for correct optical character recognition. Many of the tests for the evaluation of text line segmentation algorithms deal with text databases as reference templates. Because of the mismatch, the reliable testing framework is required. Hence, a new approach to a comprehensive experimental framework for the evaluation of text line segmentation algorithms is proposed. It consists of synthetic multi-like text samples and real handwritten text as well. Although the tests are mutually independent, the results are cross-linked. The proposed method can be used for different types of scripts and languages. Furthermore, two different procedures for the evaluation of algorithm efficiency based on the obtained error type classification are proposed. The first is based on the segmentation line error description, while the second one incorporates well-known signal detection theory. Each of them has different capabilities and convenience, but they can be used as supplements to make the evaluation process efficient. Overall the proposed procedure based on the segmentation line error description has some advantages, characterized by five measures that describe measurement procedures.

  17. An Approach to a Comprehensive Test Framework for Analysis and Evaluation of Text Line Segmentation Algorithms

    Science.gov (United States)

    Brodic, Darko; Milivojevic, Dragan R.; Milivojevic, Zoran N.

    2011-01-01

    The paper introduces a testing framework for the evaluation and validation of text line segmentation algorithms. Text line segmentation represents the key action for correct optical character recognition. Many of the tests for the evaluation of text line segmentation algorithms deal with text databases as reference templates. Because of the mismatch, the reliable testing framework is required. Hence, a new approach to a comprehensive experimental framework for the evaluation of text line segmentation algorithms is proposed. It consists of synthetic multi-like text samples and real handwritten text as well. Although the tests are mutually independent, the results are cross-linked. The proposed method can be used for different types of scripts and languages. Furthermore, two different procedures for the evaluation of algorithm efficiency based on the obtained error type classification are proposed. The first is based on the segmentation line error description, while the second one incorporates well-known signal detection theory. Each of them has different capabilities and convenience, but they can be used as supplements to make the evaluation process efficient. Overall the proposed procedure based on the segmentation line error description has some advantages, characterized by five measures that describe measurement procedures. PMID:22164106

  18. Line clipping against polygonal window algorithm based on the multiple virtual boxes rejecting

    Institute of Scientific and Technical Information of China (English)

    WANG Jin; LU Guo-dong; PENG Qun-sheng; WU Xuan-hui

    2005-01-01

    This paper presents a new algorithm for line clipping against a polygonal window by exploiting the local relationship between each line segment and the polygon. Firstly, a minimal enclosing box (MEB) of the polygon is adopted to reject the invisible line segments located outside the MEB. Secondly, a 45° rotated box is used to encode the endpoint of the line segment, and then reject a portion of the invisible segments crossing polygon corners. Finally, instead of encoding the endpoints of all line segments with respect to the polygonal window, each vertex of the polygon is encoded, taking the line segment to be clipped as reference. For efficient encoding of the polygon vertices, a new concept, termed with slope adaptive virtual box, is introduced regarding each line segment. Such a box can not only conveniently reject all totally invisible lines lying outside the MEB conveniently, but also precisely identify the edges of the polygon with which the line segment potentially intersects. With the summation of the vertex codes, it can be verified whether the line segment is separated from or potentially intersects the polygon window. Based on the product of the codes of adjacent vertices, singular cases of intersection can be solved accurately. Experimental results demonstrate the efficiency and stability of the new algorithm.

  19. Resolving the optical emission lines of Lya blob 'B1' at z=2.38: another hidden quasar

    OpenAIRE

    Overzier, R. A.; Nesvadba, N. P. H.; Dijkstra, M.; Hatch, N. A.; Lehnert, M.D.; Villar-Martín, M.; Wilman, R. J.; Zirm, A. W.

    2013-01-01

    We have used the SINFONI near-infrared integral field unit on the VLT to resolve the optical emission line structure of one of the brightest (L~1e44 erg/s) and nearest (z=2.38) of all Lya blobs (LABs). The target, known in the literature as object 'B1' (Francis et al. 1996), lies at a redshift where the main optical emission lines are accessible in the observed near-infrared. We detect luminous [OIII]4959,5007A and Ha emission with a spatial extent of at least 32x40 kpc (4"x5"). The dominant ...

  20. A New Algorithm for On- Line Handwriting Signature Verification Based on Evolutionary Computation

    Institute of Scientific and Technical Information of China (English)

    ZHENG Jianbin; ZHU Guangxi

    2006-01-01

    The paper proposes an on-line signature verification algorithm, through which test sample and template signatures can be optimizedly matched, based on evolutionary computation (EC). Firstly, the similarity of signature curve segment is defined, and shift and scale transforms are also introduced due to the randoness of on-line signature. Secondly,this paper puts forward signature verification matching algorithm after establishment of the mathematical model. Thirdly, the concrete realization of the algorithm based on EC is discussed as well. In addition, the influence of shift and scale on the matching result is fully considered in the algorithm.Finally, a computation example is given, and the matching results between the test sample curve and the template signature curve are analyzed in detail. The preliminary experiments reveal that the type of signature verification problem can be solved by EC.

  1. A two-level on-line learning algorithm of Artificial Neural Network with forward connections

    Directory of Open Access Journals (Sweden)

    Stanislaw Placzek

    2014-12-01

    Full Text Available An Artificial Neural Network with cross-connection is one of the most popular network structures. The structure contains: an input layer, at least one hidden layer and an output layer. Analysing and describing an ANN structure, one usually finds that the first parameter is the number of ANN’s layers. A hierarchical structure is a default and accepted way of describing the network. Using this assumption, the network structure can be described from a different point of view. A set of concepts and models can be used to describe the complexity of ANN’s structure in addition to using a two-level learning algorithm. Implementing the hierarchical structure to the learning algorithm, an ANN structure is divided into sub-networks. Every sub-network is responsible for finding the optimal value of its weight coefficients using a local target function to minimise the learning error. The second coordination level of the learning algorithm is responsible for coordinating the local solutions and finding the minimum of the global target function. In the article a special emphasis is placed on the coordinator’s role in the learning algorithm and its target function. In each iteration the coordinator has to send coordination parameters into the first level of subnetworks. Using the input X and the teaching Z vectors, the local procedures are working and finding their weight coefficients. At the same step the feedback information is calculated and sent to the coordinator. The process is being repeated until the minimum of local target functions is achieved. As an example, a two-level learning algorithm is used to implement an ANN in the underwriting process for classifying the category of health in a life insurance company.

  2. RESOLVING THE OPTICAL EMISSION LINES OF Ly{alpha} BLOB ''B1'' AT z = 2.38: ANOTHER HIDDEN QUASAR

    Energy Technology Data Exchange (ETDEWEB)

    Overzier, R. A. [Department of Astronomy, University of Texas at Austin, 1 University Station C1400, Austin, TX 78712 (United States); Nesvadba, N. P. H. [Institut d' Astrophysique Spatiale, CNRS, Universite Paris-Sud, F-91405 Orsay (France); Dijkstra, M. [Max-Planck-Institut fuer Astrophysik, Karl-Schwarzschild-Str. 1, D-85741 Garching (Germany); Hatch, N. A. [School of Physics and Astronomy, University of Nottingham, University Park, Nottingham NG7 2RD (United Kingdom); Lehnert, M. D. [GEPI, Observatoire de Paris, UMR 8111, CNRS, Universite Paris Diderot, 5 place Jules Janssen, F-92190 Meudon (France); Villar-Martin, M. [Centro de Astrobioloia (INTA-CSIC), Carretera de Ajalvir, km 4, E-28850 Torrejon de Ardoz, Madrid (Spain); Wilman, R. J. [Department of Physics, University of Durham, South Road, Durham DH13LE (United Kingdom); Zirm, A. W., E-mail: overzier@astro.as.utexas.edu [Dark Cosmology Centre, Niels Bohr Institute, University of Copenhagen, Juliane Maries Vej 30, DK-2100 Copenhagen (Denmark)

    2013-07-10

    We have used the SINFONI near-infrared integral field unit on the Very Large Telescope to resolve the optical emission line structure of one of the brightest (L{sub Ly{alpha}} Almost-Equal-To 10{sup 44} erg s{sup -1}) and nearest (z Almost-Equal-To 2.38) of all Ly{alpha} blobs (LABs). The target, known in the literature as object {sup B}1{sup ,} lies at a redshift where the main optical emission lines are accessible in the observed near-infrared. We detect luminous [O III] {lambda}{lambda}4959, 5007 and H{alpha} emission with a spatial extent of at least 32 Multiplication-Sign 40 kpc (4'' Multiplication-Sign 5''). The dominant optical emission line component shows relatively broad lines (600-800 km s{sup -1}, FWHM) and line ratios consistent with active galactic nucleus (AGN) photoionization. The new evidence for AGN photoionization, combined with previously detected C IV and luminous, warm infrared emission, suggest that B1 is the site of a hidden quasar. This is confirmed by the fact that [O II] is relatively weak compared with [O III] (extinction-corrected [O III]/[O II] of about 3.8), which is indicative of a high, Seyfert-like ionization parameter. From the extinction-corrected [O III] luminosity we infer a bolometric AGN luminosity of {approx}3 Multiplication-Sign 10{sup 46} erg s{sup -1}, and further conclude that the obscured AGN may be Compton-thick given existing X-ray limits. The large line widths observed are consistent with clouds moving within the narrow-line region of a luminous QSO. The AGN scenario is capable of producing sufficient ionizing photons to power the Ly{alpha}, even in the presence of dust. By performing a census of similar objects in the literature, we find that virtually all luminous LABs harbor obscured quasars. Based on simple duty-cycle arguments, we conclude that AGNs are the main drivers of the Ly{alpha} in LABs rather than the gravitational heating and subsequent cooling suggested by cold stream models. We

  3. A Line Search Multilevel Truncated Newton Algorithm for Computing the Optical Flow

    Directory of Open Access Journals (Sweden)

    Lluís Garrido

    2015-06-01

    Full Text Available We describe the implementation details and give the experimental results of three optimization algorithms for dense optical flow computation. In particular, using a line search strategy, we evaluate the performance of the unilevel truncated Newton method (LSTN, a multiresolution truncated Newton (MR/LSTN and a full multigrid truncated Newton (FMG/LSTN. We use three image sequences and four models of optical flow for performance evaluation. The FMG/LSTN algorithm is shown to lead to better optical flow estimation with less computational work than both the LSTN and MR/LSTN algorithms.

  4. Multisensor Processing Algorithms for Underwater Dipole Localization and Tracking Using MEMS Artificial Lateral-Line Sensors

    Directory of Open Access Journals (Sweden)

    Jones Douglas L

    2006-01-01

    Full Text Available An engineered artificial lateral-line system has been recently developed, consisting of a 16-element array of finely spaced MEMS hot-wire flow sensors. This represents a new class of underwater flow sensing instruments and necessitates the development of rapid, efficient, and robust signal processing algorithms. In this paper, we report on the development and implementation of a set of algorithms that assist in the localization and tracking of vibrational dipole sources underwater. Using these algorithms, accurate tracking of the trajectory of a moving dipole source has been demonstrated successfully.

  5. In-line print defect inspection system based on parallelized algorithms

    Science.gov (United States)

    Lv, Chao; Zhou, Hongjun

    2015-03-01

    The core algorithm of an on-line print defects detection system is template matching. In this paper, we introduce a kind of edge-based template matching based on Canny's edge detection method to find the edge information and do the matching work. Of all the detection algorithms, the most difficult problem is execution time, in order to reduce the execution time and improve the efficiency of execution, we introduce four different ways to solve and compare. They are Pyramidal algorithm, Multicore and Multi-Threading algorithm based on OpenMP, a Parallel algorithm based on Intel AVX Instruction Set, GPU computing based on OpenCL model. Through the results, we can find different characters of different ways, and then choose the best for your own system.

  6. Three-dimensional microscope vision system based on micro laser line scanning and adaptive genetic algorithms

    Science.gov (United States)

    Apolinar, J.; Rodríguez, Muñoz

    2017-02-01

    A microscope vision system to retrieve small metallic surface via micro laser line scanning and genetic algorithms is presented. In this technique, a 36 μm laser line is projected on the metallic surface through a laser diode head, which is placed to a small distance away from the target. The micro laser line is captured by a CCD camera, which is attached to the microscope. The surface topography is computed by triangulation by means of the line position and microscope vision parameters. The calibration of the microscope vision system is carried out by an adaptive genetic algorithm based on the line position. In this algorithm, an objective function is constructed from the microscope geometry to determine the microscope vision parameters. Also, the genetic algorithm provides the search space to calculate the microscope vision parameters with high accuracy in fast form. This procedure avoids errors produced by the missing of references and physical measurements, which are employed by the traditional microscope vision systems. The contribution of the proposed system is corroborated by an evaluation via accuracy and speed of the traditional microscope vision systems, which retrieve micro-scale surface topography.

  7. Hidden loss

    DEFF Research Database (Denmark)

    Kieffer-Kristensen, Rikke; Johansen, Karen Lise Gaardsvig

    2013-01-01

    to participate. RESULTS: All children were affected by their parents' ABI and the altered family situation. The children's expressions led the authors to identify six themes, including fear of losing the parent, distress and estrangement, chores and responsibilities, hidden loss, coping and support. The main...... the ill parent. These findings contribute to a deeper understanding of the traumatic process of parental ABI that some children experience and emphasize the importance of family-centred interventions that include the children....

  8. BAT AGN Spectroscopic Survey - IV: Near-Infrared Coronal Lines, Hidden Broad Lines, and Correlation with Hard X-ray Emission

    Science.gov (United States)

    Lamperti, Isabella; Koss, Michael; Trakhtenbrot, Benny; Schawinski, Kevin; Ricci, Claudio; Oh, Kyuseok; Landt, Hermine; Riffel, Rogério; Rodríguez-Ardila, Alberto; Gehrels, Neil; Harrison, Fiona; Masetti, Nicola; Mushotzky, Richard; Treister, Ezequiel; Ueda, Yoshihiro; Veilleux, Sylvain

    2017-01-01

    We provide a comprehensive census of the near-Infrared (NIR, 0.8-2.4 μm) spectroscopic properties of 102 nearby (z X-ray band (14-195 keV) from the Swift-Burst Alert Telescope (BAT) survey. With the launch of the James Webb Space Telescope this regime is of increasing importance for dusty and obscured AGN surveys. We measure black hole masses in 68% (69/102) of the sample using broad emission lines (34/102) and/or the velocity dispersion of the Ca II triplet or the CO band-heads (46/102). We find that emission line diagnostics in the NIR are ineffective at identifying bright, nearby AGN galaxies because ([Fe II] 1.257μm/Paβ and H2 2.12μm/Brγ) identify only 25% (25/102) as AGN with significant overlap with star forming galaxies and only 20% of Seyfert 2 have detected coronal lines (6/30). We measure the coronal line emission in Seyfert 2 to be weaker than in Seyfert 1 of the same bolometric luminosity suggesting obscuration by the nuclear torus. We find that the correlation between the hard X-ray and the [Fe II] coronal line luminosity is significantly better than with the [O III] λ5007 luminosity. Finally, we find 3/29 galaxies (10%) that are optically classified as Seyfert 2 show broad emission lines in the NIR. These AGN have the lowest levels of obscuration among the Seyfert 2s in our sample (log NH < 22.43 cm-2), and all show signs of galaxy-scale interactions or mergers suggesting that the optical broad emission lines are obscured by host galaxy dust.

  9. A Fast Inspection of Tool Electrode and Drilling Depth in EDM Drilling by Detection Line Algorithm

    Directory of Open Access Journals (Sweden)

    Kuo-Yi Huang

    2008-08-01

    Full Text Available The purpose of this study was to develop a novel measurement method using a machine vision system. Besides using image processing techniques, the proposed system employs a detection line algorithm that detects the tool electrode length and drilling depth of a workpiece accurately and effectively. Different boundaries of areas on the tool electrode are defined: a baseline between base and normal areas, a ND-line between normal and drilling areas (accumulating carbon area, and a DD-line between drilling area and dielectric fluid droplet on the electrode tip. Accordingly, image processing techniques are employed to extract a tool electrode image, and the centroid, eigenvector, and principle axis of the tool electrode are determined. The developed detection line algorithm (DLA is then used to detect the baseline, ND-line, and DD-line along the direction of the principle axis. Finally, the tool electrode length and drilling depth of the workpiece are estimated via detected baseline, ND-line, and DD-line. Experimental results show good accuracy and efficiency in estimation of the tool electrode length and drilling depth under different conditions. Hence, this research may provide a reference for industrial application in EDM drilling measurement.

  10. A Fast Inspection of Tool Electrode and Drilling Depth in EDM Drilling by Detection Line Algorithm.

    Science.gov (United States)

    Huang, Kuo-Yi

    2008-08-21

    The purpose of this study was to develop a novel measurement method using a machine vision system. Besides using image processing techniques, the proposed system employs a detection line algorithm that detects the tool electrode length and drilling depth of a workpiece accurately and effectively. Different boundaries of areas on the tool electrode are defined: a baseline between base and normal areas, a ND-line between normal and drilling areas (accumulating carbon area), and a DD-line between drilling area and dielectric fluid droplet on the electrode tip. Accordingly, image processing techniques are employed to extract a tool electrode image, and the centroid, eigenvector, and principle axis of the tool electrode are determined. The developed detection line algorithm (DLA) is then used to detect the baseline, ND-line, and DD-line along the direction of the principle axis. Finally, the tool electrode length and drilling depth of the workpiece are estimated via detected baseline, ND-line, and DD-line. Experimental results show good accuracy and efficiency in estimation of the tool electrode length and drilling depth under different conditions. Hence, this research may provide a reference for industrial application in EDM drilling measurement.

  11. Line Matching Algorithm for Aerial Image Combining image and object space similarity constraints

    Science.gov (United States)

    Wang, Jingxue; Wang, Weixi; Li, Xiaoming; Cao, Zhenyu; Zhu, Hong; Li, Miao; He, Biao; Zhao, Zhigang

    2016-06-01

    A new straight line matching method for aerial images is proposed in this paper. Compared to previous works, similarity constraints combining radiometric information in image and geometry attributes in object plane are employed in these methods. Firstly, initial candidate lines and the elevation values of lines projection plane are determined by corresponding points in neighborhoods of reference lines. Secondly, project reference line and candidate lines back forward onto the plane, and then similarity measure constraints are enforced to reduce the number of candidates and to determine the finial corresponding lines in a hierarchical way. Thirdly, "one-to-many" and "many-to-one" matching results are transformed into "one-to-one" by merging many lines into the new one, and the errors are eliminated simultaneously. Finally, endpoints of corresponding lines are detected by line expansion process combing with "image-object-image" mapping mode. Experimental results show that the proposed algorithm can be able to obtain reliable line matching results for aerial images.

  12. Numerical Modelling of a Void Behind Shaft Lining using FDM with a Concrete Spalling Algorithm

    Directory of Open Access Journals (Sweden)

    Slawomir Bock

    2014-01-01

    Originality/value: An important limitation of all continuous methods is the inability (except when using some additional tools to simulate the rotations of predefined elements (blocks and their separation from the rest of the object. The concrete spalling algorithm presented extends the capabilities of FLAC3D with the possibility of simulating the detachment and separation of destroyed lining fragments.

  13. Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms

    NARCIS (Netherlands)

    G. Galambos; A. van Vliet (André)

    1994-01-01

    textabstractIn this paper we discuss lower bounds for the asymptotic worst case ratio of on-line algorithms for different kind of bin packing problems. Recently, Galambos and Frenk gave a simple proof of the 1.536 ... lower bound for the 1-dimensional bin packing problem. Following their ideas, we p

  14. Optimization of meander line antennas for RFID applications by using genetic algorithm

    Science.gov (United States)

    Bucuci, Stefania C.; Anchidin, Liliana; Dumitrascu, Ana; Danisor, Alin; Berescu, Serban; Tamas, Razvan D.

    2015-02-01

    In this paper, we propose an approach of optimization of meander line antennas by using genetic algorithm. Such antennas are used in RFID applications. As opposed to other approaches for meander antennas, we propose the use of only two optimization objectives, i.e. gain and size. As an example, we have optimized a single meander dipole antenna, resonating at 869 MHz.

  15. Analysis of an on-line algorithm for solving large Markov chains

    NARCIS (Netherlands)

    Litvak, Nelly; Robert, Philippe

    2008-01-01

    Algorithms for ranking of web pages such as Google Page-Rank assign importance scores according to a stationary distribution of a Markov random walk on the web graph. Although in the classical search scheme the ranking scores are pre-computed off-line, several challenging problems in contemporary we

  16. Digital image steganography algorithm based on genetic algorithm and high hidden capacity%基于遗传算法和高隐藏容量的数字图像隐写算法

    Institute of Scientific and Technical Information of China (English)

    谭志伟; 孙新领; 杨观赐

    2016-01-01

    In order to obtain bigger steganography capacity and higher steganography security level,a digital image safety steganography algorithm based on genetic algorithm and high hidden capacity is proposed. The steganography is modeled as a search problem. The genetic algorithm is used to find out the optimal direction and starting point in the host image to hide the enciphered data,and make the steganography image obtain the maximal peak signal⁃to⁃noise ratio(PSNR),whose fitting func⁃tion is PSNR. Firstly,the host image,confidential image and chromosome should be prepared,after that the bit plane and bit direction genes are used to convert the host pixel sequence into bit sequence. And then,the confidential pixel bits are embed⁃ded into the corresponding pixel bits. Finally,the fitting function is used to determine the iteration times. The PSNR and struc⁃tural similarity index measure (SSIM) are used to assess the steganography result. Compared with other steganography algo⁃rithms,the proposed algorithm can significantly improve the steganography quality and safety. Its PSNR and SSIM are higher than those of other algorithms. In addition,its hidden capacity is big enough,which can reach up to 49.5%.%为了获得更大的隐写容量和更高的隐写安全级别,提出一种基于遗传算法和高隐藏容量的数字图像安全隐写算法。将隐写术作为一个搜索问题进行建模,遗传算法的目的是在宿主图像中找到最优的方向和最优的起始点用于隐藏加密数据,使得隐写图像获取最大的峰值信噪比,其拟合函数为峰值信噪比。首先准备宿主图像,机密图像和染色体,利用比特位面和比特方向基因将宿主像素序列转化为比特位序列;然后将机密像素位嵌入到相应的比特像素位;最后利用拟合函数决定迭代结束次数。运用峰值信噪比(PSNR)和结构相似性度量(SSIM)评估隐写结果,与其他隐写算法相比,该

  17. Motion Vector Estimation Using Line-Square Search Block Matching Algorithm for Video Sequences

    Directory of Open Access Journals (Sweden)

    Guo Bao-long

    2004-09-01

    Full Text Available Motion estimation and compensation techniques are widely used for video coding applications but the real-time motion estimation is not easily achieved due to its enormous computations. In this paper, a new fast motion estimation algorithm based on line search is presented, in which computation complexity is greatly reduced by using the line search strategy and a parallel search pattern. Moreover, the accurate search is achieved because the small square search pattern is used. It has a best-case scenario of only 9 search points, which is 4 search points less than the diamond search algorithm. Simulation results show that, compared with the previous techniques, the LSPS algorithm significantly reduces the computational requirements for finding motion vectors, and also produces close performance in terms of motion compensation errors.

  18. Line Balancing Using Largest Candidate Rule Algorithm In A Garment Industry: A Case Study

    Directory of Open Access Journals (Sweden)

    V. P.Jaganathan

    2014-12-01

    Full Text Available The emergence of fast changes in fashion has given rise to the need to shorten production cycle times in the garment industry. As effective usage of resources has a significant effect on the productivity and efficiency of production operations, garment manufacturers are urged to utilize their resources effectively in order to meet dynamic customer demand. This paper focuses specifically on line balancing and layout modification. The aim of assembly line balance in sewing lines is to assign tasks to the workstations, so that the machines of the workstation can perform the assigned tasks with a balanced loading. Largest Candidate Rule Algorithm (LCR has been deployed in this paper.

  19. Meta-heuristic algorithm to solve two-sided assembly line balancing problems

    Science.gov (United States)

    Wirawan, A. D.; Maruf, A.

    2016-02-01

    Two-sided assembly line is a set of sequential workstations where task operations can be performed at two sides of the line. This type of line is commonly used for the assembly of large-sized products: cars, buses, and trucks. This paper propose a Decoding Algorithm with Teaching-Learning Based Optimization (TLBO), a recently developed nature-inspired search method to solve the two-sided assembly line balancing problem (TALBP). The algorithm aims to minimize the number of mated-workstations for the given cycle time without violating the synchronization constraints. The correlation between the input parameters and the emergence point of objective function value is tested using scenarios generated by design of experiments. A two-sided assembly line operated in an Indonesia's multinational manufacturing company is considered as the object of this paper. The result of the proposed algorithm shows reduction of workstations and indicates that there is negative correlation between the emergence point of objective function value and the size of population used.

  20. Control and monitoring of on-line trigger algorithms using a SCADA system

    CERN Document Server

    van Herwijnen, E; Barczyk, A; Damodaran, B; Frank, M; Gaidioz, B; Gaspar, C; Jacobsson, R; Jost, B; Neufeld, N; Bonifazi, F; Callot, O; Lopes, H

    2006-01-01

    LHCb [1] has an integrated Experiment Control System (ECS) [2], based on the commercial SCADA system PVSS [3]. The novelty of this approach is that, in addition to the usual control and monitoring of experimental equipment, it provides control and monitoring for software processes, namely the on-line trigger algorithms. Algorithms based on Gaudi [4] (the LHCb software framework) compute the trigger decisions on an event filter farm of around 2000 PCs. Gaucho [5], the GAUdi Component Helping Online, was developed to allow the control and monitoring of Gaudi algorithms. Using Gaucho, algorithms can be monitored from the run control system provided by the ECS. To achieve this, Gaucho implements a hierarchical control system using Finite State Machines. In this article we describe the Gaucho architecture, the experience of monitoring a large number of software processes and some requirements for future extensions.

  1. A New Algorithm for Two—Dimensional Line Clipping via Geometric Transformation

    Institute of Scientific and Technical Information of China (English)

    汪灏泓; 吴瑞迅; 等

    1998-01-01

    Line segment clipping is a basic operation of the visualization process in computer graphics.So far there exist four computational models for clipping a line segment against a window,(1)the encoding,(2)the parametric,(3)the geometric transforma tion,and (4)the parallel cutting.This paper presents an algorithm that is based on the third method.By making use of symmetric properties of a window and transformation operations,both endpoints of a line segment are transformed,so that the basic cases are reduced into two that can be easily handled,thus the problems in NLN and AS where there are too many sub-procedure calls and basic cases that are difficult to deal with are tackled.Both analytical and experimental results from random input data show that the algorithm is better than other developed ones,in view of the speed and the number of operations.

  2. Dilute RKKY model for NMR line broadening in the hidden-order state of URu2Si2

    Science.gov (United States)

    Walstedt, R. E.; Kambe, S.; Tokunaga, Y.; Sakai, H.

    2016-01-01

    A well-known analytic model for Lorentzian broadening of metallic NMR lines by dilute localized magnetic centers embedded in a lattice has been applied to the case of the twofold-symmetry magnetism in URu2Si2 reported by R. Okazaki et al. [Science 331, 439 (2011), 10.1126/science.1197358]. The observed Lorentzian spectra are accounted for with a simple formula giving the 29Si NMR linewidth in terms of the susceptibility of the magnetic-broadening centers and a Ruderman-Kittel-Kasuya-Yosida (RKKY) coupling parameter. The concentration of such centers is estimated as c ˜0.01 . A numerical simulation of these effects confirms Lorentzian broadening with no measurable NMR shift and a width in reasonable agreement with the analytical model. The simulation shows further that domain effects on these spectra are largely absent. A four-site extended model of the broadening centers gives an estimate of the twofold susceptibility within a factor of 2 of the torque value of the susceptibility. Hypothetical superlattice effects are shown to be easily smoothed over by convolution with background Lorentzian broadening.

  3. A passive synthetic aperture phase correction algorithm for the asymmetric twin-line array sonar

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    A passive synthetic aperture based on phase correction algorithm for solving the port-starboard discrimination problem in the non-aligned towed twin-line array sonar, is described. This method creates a virtual array through applying the estimated phase correction into one array of twin-line arrays. Because the synthetic virtual array is aligned with the other array in twin-line arrays, the right port-starboard discriminated results can be obtained by array processing based on the new synthetic twin-line array. The effect of proposed method has been shown by simulated and sea-trials results in towed twin-line array sonar. With low extra computational loads, the proposed method is easy to apply to the practice.

  4. A Light-and-Fast SLAM Algorithm for Robots in Indoor Environments Using Line Segment Map

    Directory of Open Access Journals (Sweden)

    Bor-Woei Kuo

    2011-01-01

    Full Text Available Simultaneous Localization and Mapping (SLAM is an important technique for robotic system navigation. Due to the high complexity of the algorithm, SLAM usually needs long computational time or large amount of memory to achieve accurate results. In this paper, we present a lightweight Rao-Blackwellized particle filter- (RBPF- based SLAM algorithm for indoor environments, which uses line segments extracted from the laser range finder as the fundamental map structure so as to reduce the memory usage. Since most major structures of indoor environments are usually orthogonal to each other, we can also efficiently increase the accuracy and reduce the complexity of our algorithm by exploiting this orthogonal property of line segments, that is, we treat line segments that are parallel or perpendicular to each other in a special way when calculating the importance weight of each particle. Experimental results shows that our work is capable of drawing maps in complex indoor environments, needing only very low amount of memory and much less computational time as compared to other grid map-based RBPF SLAM algorithms.

  5. ALGORITHM AND IMPLEMENTATION OF AUTO-SEARCHING WELD LINE FOR WELDING MOBILE ROBOT

    Institute of Scientific and Technical Information of China (English)

    ZHANG Ke; L(U) Xueqin; WU Yixiong; LOU Songnian

    2006-01-01

    An algorithm of auto-searching weld line for welding mobile robot is presented.Auto-searching weld line is that the robot can automatically recognize a weld groove according to the characteristics of the weld groove before welding, and then adjust itself posture to the desired status preparing for welding, namely, it is a process that the robot autonomously aligns itself to the center of welding seam. Firstly, the configuration of welding mobile robot with the function of auto-searching weld line is introduced, then the algorithm and implementation of auto-searching weld line are presented on the basis of kinematics model of the robot, at last trajectory planning among auto-searching weld line is investigated in detail. The experiment result shows that the developed welding mobile robot can successfully implement the task of auto-searching weld line before welding, tracking error precision can be controlled to approximate ± 1.5 mm, and satisfy the requirement of practical welding project.

  6. On-line topical importance estimation: an effective focused crawling algorithm combining link and content analysis

    Institute of Scientific and Technical Information of China (English)

    Can WANG; Zi-yu GUAN; Chun CHEN; Jia-jun BU; Jun-feng WANG; Huai-zhong LIN

    2009-01-01

    Focused crawling is an important technique for topical resource discovery on the Web. The key issue in focusedcrawling is to prioritize uncrawled uniform resource locators (URLs) in the frontier to focus the crawling on relevant pages.Traditional focused crawlers mainly rely on content analysis. Link-based techniques are not effectively exploited despite their usefulness. In this paper, we propose a new frontier prioritizing algorithm, namely the on-line topical importance estimation (OTIE) algorithm. OTIE combines link-and content-based analysis to evaluate the priority of an uncrawled URL in the frontier. We performed real crawling experiments over 30 topics selected from the Open Directory Project (ODP) and compared harvest rate and target recall of the four crawling algorithms: breadth-first, link-context-prediction, on-line page importance computation (OPlC) and our OTIE. Experimental results showed that OTIE significantly outperforms the other three algorithms on the average target recall while maintaining an acceptable harvest rate. Moreover, OTIE is much faster than the traditional focused crawling algorithm.

  7. A new adaptive nonuniformity correction algorithm for infrared line scanner based on neural networks

    Institute of Scientific and Technical Information of China (English)

    Jing Sui; Liquan Dong; Weiqi Jin; Yayuan Zhang

    2007-01-01

    The striping pattern nonuniformity of the infrared line scanner (IRLS) severely limits the system performance. An adaptive nonuniformity correction (NUC) algorithm for IRLS using neural network is proposed.It uses a one-dimensional median filter to generate ideal output of network and can complete NUC by a single frame with a high correction level. Applications to both simulated and real infrared images show that the algorithm can obtain a satisfactory result with low complexity, no need of scene diversity or global motion between consecutive frames. It has the potential to realize real-time hardware-based applications.

  8. Cellular Genetic Algorithm with Communicating Grids for Assembly Line Balancing Problems

    Directory of Open Access Journals (Sweden)

    BRUDARU, O.

    2010-05-01

    Full Text Available This paper presents a new approach with cellular multigrid genetic algorithms for the "I"-shaped and "U"-shaped assembly line balancing problems, including parallel workstations and compatibility constraints. First, a cellular hybrid genetic algorithm that uses a single grid is described. Appropriate operators for mutation, hypermutation, and crossover and two devoration techniques are proposed for creating and maintaining groups based on similarity. This monogrid algorithm is extended for handling many populations placed on different grids. In the multigrid version, the population of each grid is organized in clusters using the positional information of the chromosomes. A similarity preserving communication protocol between the clusters placed on different grids is introduced. The experimental evaluation shows that the multigrid cellular genetic algorithm with communicating grids is better than the hybrid genetic algorithm used for building it, whereas it dominates the monogrid version in all cases. Absolute performance is evaluated using classical benchmarks. The role of certain components of the cellular algorithm is explained and the effect of some parameters is evaluated.

  9. A Novel Fault Location Algorithm for Double-Circuit Transmission Lines based on Distributed Parameter

    Institute of Scientific and Technical Information of China (English)

    商立群; 施围

    2006-01-01

    A new fault location algorithm for double-circuit transmission lines is described in this paper. The proposed method uses data extracted from two ends of the transmission lines and thus eliminates the effects of the source impedance and the fault resistance. The distributed parameter model and the modal transformation are also employed. Depending on modal transformation, the coupled equations of the lines are converted into decoupled ones. In this way, the mutual coupling effects between adjacent circuits of the lines are eliminated and therefore an accurate fault location can be achieved. The proposed method is tested via digital simulation using EMTP in conjunction with MATLAB. The test results corroborate the high accuracy of the proposed method.

  10. Line end shortening and application of novel correction algorithms in e-beam direct write

    Science.gov (United States)

    Freitag, Martin; Choi, Kang-Hoon; Gutsch, Manuela; Hohle, Christoph

    2011-03-01

    For the manufacturing of semiconductor technologies following the ITRS roadmap, we will face the nodes well below 32nm half pitch in the next 2~3 years. Despite being able to achieve the required resolution, which is now possible with electron beam direct write variable shaped beam (EBDW VSB) equipment and resists, it becomes critical to precisely reproduce dense line space patterns onto a wafer. This exposed pattern must meet the targets from the layout in both dimensions (horizontally and vertically). For instance, the end of a line must be printed in its entire length to allow a later placed contact to be able to land on it. Up to now, the control of printed patterns such as line ends is achieved by a proximity effect correction (PEC) which is mostly based on a dose modulation. This investigation of the line end shortening (LES) includes multiple novel approaches, also containing an additional geometrical correction, to push the limits of the available data preparation algorithms and the measurement. The designed LES test patterns, which aim to characterize the status of LES in a quick and easy way, were exposed and measured at Fraunhofer Center Nanoelectronic Technologies (CNT) using its state of the art electron beam direct writer and CD-SEM. Simulation and exposure results with the novel LES correction algorithms applied to the test pattern and a large production like pattern in the range of our target CDs in dense line space features smaller than 40nm will be shown.

  11. On a Hopping-Points SVD and Hough Transform-Based Line Detection Algorithm for Robot Localization and Mapping

    Directory of Open Access Journals (Sweden)

    Abhijeet Ravankar

    2016-05-01

    Full Text Available Line detection is an important problem in computer vision, graphics and autonomous robot navigation. Lines detected using a laser range sensor (LRS mounted on a robot can be used as features to build a map of the environment, and later to localize the robot in the map, in a process known as Simultaneous Localization and Mapping (SLAM. We propose an efficient algorithm for line detection from LRS data using a novel hopping-points Singular Value Decomposition (SVD and Hough transform-based algorithm, in which SVD is applied to intermittent LRS points to accelerate the algorithm. A reverse-hop mechanism ensures that the end points of the line segments are accurately extracted. Line segments extracted from the proposed algorithm are used to form a map and, subsequently, LRS data points are matched with the line segments to localize the robot. The proposed algorithm eliminates the drawbacks of point-based matching algorithms like the Iterative Closest Points (ICP algorithm, the performance of which degrades with an increasing number of points. We tested the proposed algorithm for mapping and localization in both simulated and real environments, and found it to detect lines accurately and build maps with good self-localization.

  12. On a Hopping-points SVD and Hough Transform-based Line Detection Algorithm for Robot Localization and Mapping

    Directory of Open Access Journals (Sweden)

    Abhijeet Ravankar

    2016-05-01

    Full Text Available Line detection is an important problem in computer vision, graphics and autonomous robot navigation. Lines detected using a laser range sensor (LRS mounted on a robot can be used as features to build a map of the environment, and later to localize the robot in the map, in a process known as Simultaneous Localization and Mapping (SLAM. We propose an efficient algorithm for line detection from LRS data using a novel hopping-points Singular Value Decomposition (SVD and Hough transform-based algorithm, in which SVD is applied to intermittent LRS points to accelerate the algorithm. A reverse-hop mechanism ensures that the end points of the line segments are accurately extracted. Line segments extracted from the proposed algorithm are used to form a map and, subsequently, LRS data points are matched with the line segments to localize the robot. The proposed algorithm eliminates the drawbacks of point-based matching algorithms like the Iterative Closest Points (ICP algorithm, the performance of which degrades with an increasing number of points. We tested the proposed algorithm for mapping and localization in both simulated and real environments, and found it to detect lines accurately and build maps with good self-localization.

  13. An on-line algorithm for creating self-organizing fuzzy neural networks.

    Science.gov (United States)

    Leng, Gang; Prasad, Girijesh; McGinnity, Thomas Martin

    2004-12-01

    This paper presents a new on-line algorithm for creating a self-organizing fuzzy neural network (SOFNN) from sample patterns to implement a singleton or Takagi-Sugeno (TS) type fuzzy model. The SOFNN is based on ellipsoidal basis function (EBF) neurons consisting of a center vector and a width vector. New methods of the structure learning and the parameter learning, based on new adding and pruning techniques and a recursive on-line learning algorithm, are proposed and developed. A proof of the convergence of both the estimation error and the linear network parameters is also given in the paper. The proposed methods are very simple and effective and generate a fuzzy neural model with a high accuracy and compact structure. Simulation work shows that the SOFNN has the capability of self-organization to determine the structure and parameters of the network automatically.

  14. The Calibration Algorithm of a 3D Color Measurement System based on the Line Feature

    Directory of Open Access Journals (Sweden)

    Ganhua Li

    2009-10-01

    Full Text Available This paper describes a novel 3 dimensional color measurement system. After 3 kinds of geometrical features are analyzed, the line features were selected. A calibration board with right-angled triangle outline was designed to improve the calibration precision. For this system, two algorithms are presented. One is the calibration algorithm between 2 dimensional laser range finder (2D LRF, while the other is for 2D LRF and the color camera. The result parameters were obtained through solving the constrain equations by the correspond data between the 2D LRF and other two sensors. The 3D color reconstruction experiments of real data prove the effectiveness and the efficient of the system and the algorithms.

  15. A Weighing Algorithm for Checking Missing Components in a Pharmaceutical Line

    Directory of Open Access Journals (Sweden)

    Alessandro Silvestri

    2014-11-01

    image. The goal of the present work is the development of an algorithm able to optimize the production line of a pharmaceutical firm. In particular, the proposed weighing procedure allows both checking missing components in packaging and minimizing false rejects of packages by dynamic scales. The main problem is the presence at the same time, in the same package, of different components with different variable weights. The consequence is uncertainty in recognizing the absence of one or more components.

  16. Optimization of meander line radiators for frequency selective surfaces by using genetic algorithm

    Science.gov (United States)

    Bucuci, Stefania C.; Dumitrascu, Ana; Danisor, Alin; Berescu, Serban; Tamas, Razvan D.

    2015-02-01

    In this paper we propose the use of frequency selective surfaces based on meander line radiators, as targets for monitoring slow displacements with synthetic aperture radars. The optimization of the radiators is performed by using genetic algorithms on only two parameters i.e., gain and size. As an example, we have optimized a single meander antenna, resonating in the X-band, at 9.65 GHz.

  17. Implementation on GPU-based acceleration of the m-line reconstruction algorithm for circle-plus-line trajectory computed tomography

    Science.gov (United States)

    Li, Zengguang; Xi, Xiaoqi; Han, Yu; Yan, Bin; Li, Lei

    2016-10-01

    The circle-plus-line trajectory satisfies the exact reconstruction data sufficiency condition, which can be applied in C-arm X-ray Computed Tomography (CT) system to increase reconstruction image quality in a large cone angle. The m-line reconstruction algorithm is adopted for this trajectory. The selection of the direction of m-lines is quite flexible and the m-line algorithm needs less data for accurate reconstruction compared with FDK-type algorithms. However, the computation complexity of the algorithm is very large to obtain efficient serial processing calculations. The reconstruction speed has become an important issue which limits its practical applications. Therefore, the acceleration of the algorithm has great meanings. Compared with other hardware accelerations, the graphics processing unit (GPU) has become the mainstream in the CT image reconstruction. GPU acceleration has achieved a better acceleration effect in FDK-type algorithms. But the implementation of the m-line algorithm's acceleration for the circle-plus-line trajectory is different from the FDK algorithm. The parallelism of the circular-plus-line algorithm needs to be analyzed to design the appropriate acceleration strategy. The implementation can be divided into the following steps. First, selecting m-lines to cover the entire object to be rebuilt; second, calculating differentiated back projection of the point on the m-lines; third, performing Hilbert filtering along the m-line direction; finally, the m-line reconstruction results need to be three-dimensional-resembled and then obtain the Cartesian coordinate reconstruction results. In this paper, we design the reasonable GPU acceleration strategies for each step to improve the reconstruction speed as much as possible. The main contribution is to design an appropriate acceleration strategy for the circle-plus-line trajectory m-line reconstruction algorithm. Sheep-Logan phantom is used to simulate the experiment on a single K20 GPU. The

  18. a Line-Based 3d Roof Model Reconstruction Algorithm: Tin-Merging and Reshaping (tmr)

    Science.gov (United States)

    Rau, J.-Y.

    2012-07-01

    Three-dimensional building model is one of the major components of a cyber-city and is vital for the realization of 3D GIS applications. In the last decade, the airborne laser scanning (ALS) data is widely used for 3D building model reconstruction and object extraction. Instead, based on 3D roof structural lines, this paper presents a novel algorithm for automatic roof models reconstruction. A line-based roof model reconstruction algorithm, called TIN-Merging and Reshaping (TMR), is proposed. The roof structural line, such as edges, eaves and ridges, can be measured manually from aerial stereo-pair, derived by feature line matching or inferred from ALS data. The originality of the TMR algorithm for 3D roof modelling is to perform geometric analysis and topology reconstruction among those unstructured lines and then reshapes the roof-type using elevation information from the 3D structural lines. For topology reconstruction, a line constrained Delaunay Triangulation algorithm is adopted where the input structural lines act as constraint and their vertex act as input points. Thus, the constructed TINs will not across the structural lines. Later at the stage of Merging, the shared edge between two TINs will be check if the original structural line exists. If not, those two TINs will be merged into a polygon. Iterative checking and merging of any two neighboured TINs/Polygons will result in roof polygons on the horizontal plane. Finally, at the Reshaping stage any two structural lines with fixed height will be used to adjust a planar function for the whole roof polygon. In case ALS data exist, the Reshaping stage can be simplified by adjusting the point cloud within the roof polygon. The proposed scheme reduces the complexity of 3D roof modelling and makes the modelling process easier. Five test datasets provided by ISPRS WG III/4 located at downtown Toronto, Canada and Vaihingen, Germany are used for experiment. The test sites cover high rise buildings and residential

  19. A Line-Based Adaptive-Weight Matching Algorithm Using Loopy Belief Propagation

    Directory of Open Access Journals (Sweden)

    Hui Li

    2015-01-01

    Full Text Available In traditional adaptive-weight stereo matching, the rectangular shaped support region requires excess memory consumption and time. We propose a novel line-based stereo matching algorithm for obtaining a more accurate disparity map with low computation complexity. This algorithm can be divided into two steps: disparity map initialization and disparity map refinement. In the initialization step, a new adaptive-weight model based on the linear support region is put forward for cost aggregation. In this model, the neural network is used to evaluate the spatial proximity, and the mean-shift segmentation method is used to improve the accuracy of color similarity; the Birchfield pixel dissimilarity function and the census transform are adopted to establish the dissimilarity measurement function. Then the initial disparity map is obtained by loopy belief propagation. In the refinement step, the disparity map is optimized by iterative left-right consistency checking method and segmentation voting method. The parameter values involved in this algorithm are determined with many simulation experiments to further improve the matching effect. Simulation results indicate that this new matching method performs well on standard stereo benchmarks and running time of our algorithm is remarkably lower than that of algorithm with rectangle-shaped support region.

  20. About one algorithm of the broken line approximation and a modeling of tool path for CNC plate cutting machines

    Science.gov (United States)

    Kurennov, D. V.; Petunin, A. A.; Repnitskii, V. B.; Shipacheva, E. N.

    2016-12-01

    The problem of approximating two-dimensional broken line with composite curve consisting of arc and line segments is considered. The resulting curve nodes have to coincide with source broken line nodes. This problem arises in the development of control programs for CNC (computer numerical control) cutting machines, permitting circular interpolation. An original algorithm is proposed minimizing the number of nodes for resulting composite curve. The algorithm is implemented in the environment of the Russian CAD system T-Flex CAD using its API (Application Program Interface). The algorithm optimality is investigated. The result of test calculation along with its geometrical visualization is given.

  1. Diagnostic performance of line-immunoassay based algorithms for incident HIV-1 infection

    Directory of Open Access Journals (Sweden)

    Schüpbach Jörg

    2012-04-01

    Full Text Available Abstract Background Serologic testing algorithms for recent HIV seroconversion (STARHS provide important information for HIV surveillance. We have previously demonstrated that a patient's antibody reaction pattern in a confirmatory line immunoassay (INNO-LIA™ HIV I/II Score provides information on the duration of infection, which is unaffected by clinical, immunological and viral variables. In this report we have set out to determine the diagnostic performance of Inno-Lia algorithms for identifying incident infections in patients with known duration of infection and evaluated the algorithms in annual cohorts of HIV notifications. Methods Diagnostic sensitivity was determined in 527 treatment-naive patients infected for up to 12 months. Specificity was determined in 740 patients infected for longer than 12 months. Plasma was tested by Inno-Lia and classified as either incident ( Results The 10 best algorithms had a mean raw sensitivity of 59.4% and a mean specificity of 95.1%. Adjustment for overrepresentation of patients in the first quarter year of infection further reduced the sensitivity. In the preferred model, the mean adjusted sensitivity was 37.4%. Application of the 10 best algorithms to four annual cohorts of HIV-1 notifications totalling 2'595 patients yielded a mean IIR of 0.35 in 2005/6 (baseline and of 0.45, 0.42 and 0.35 in 2008, 2009 and 2010, respectively. The increase between baseline and 2008 and the ensuing decreases were highly significant. Other adjustment models yielded different absolute IIR, although the relative changes between the cohorts were identical for all models. Conclusions The method can be used for comparing IIR in annual cohorts of HIV notifications. The use of several different algorithms in combination, each with its own sensitivity and specificity to detect incident infection, is advisable as this reduces the impact of individual imperfections stemming primarily from relatively low sensitivities and

  2. Online Learning in Discrete Hidden Markov Models

    OpenAIRE

    Alamino, Roberto C.; Caticha, Nestor

    2007-01-01

    We present and analyse three online algorithms for learning in discrete Hidden Markov Models (HMMs) and compare them with the Baldi-Chauvin Algorithm. Using the Kullback-Leibler divergence as a measure of generalisation error we draw learning curves in simplified situations. The performance for learning drifting concepts of one of the presented algorithms is analysed and compared with the Baldi-Chauvin algorithm in the same situations. A brief discussion about learning and symmetry breaking b...

  3. Throughput Optimal On-Line Algorithms for Advanced Resource Reservation in Ultra High-Speed Networks

    CERN Document Server

    Cohen, Reuven; Starobinski, David

    2007-01-01

    Advanced channel reservation is emerging as an important feature of ultra high-speed networks requiring the transfer of large files. Applications include scientific data transfers and database backup. In this paper, we present two new, on-line algorithms for advanced reservation, called BatchAll and BatchLim, that are guaranteed to achieve optimal throughput performance, based on multi-commodity flow arguments. Both algorithms are shown to have polynomial-time complexity and provable bounds on the maximum delay for 1+epsilon bandwidth augmented networks. The BatchLim algorithm returns the completion time of a connection immediately as a request is placed, but at the expense of a slightly looser competitive ratio than that of BatchAll. We also present a simple approach that limits the number of parallel paths used by the algorithms while provably bounding the maximum reduction factor in the transmission throughput. We show that, although the number of different paths can be exponentially large, the actual numb...

  4. RECONFIGURABLE PRODUCTION LINE MODELING AND SCHEDULING USING PETRI NETS AND GENETIC ALGORITHM

    Institute of Scientific and Technical Information of China (English)

    XIE Nan; LI Aiping

    2006-01-01

    In response to the production capacity and functionality variations, a genetic algorithm (GA) embedded with deterministic timed Petri nets(DTPN) for reconfigurable production line(RPL) is proposed to solve its scheduling problem. The basic DTPN modules are presented to model the corresponding variable structures in RPL, and then the scheduling model of the whole RPL is constructed. And in the scheduling algorithm, firing sequences of the Petri nets model are used as chromosomes, thus the selection, crossover, and mutation operator do not deal with the elements in the problem space, but the elements of Petri nets model. Accordingly, all the algorithms for GA operations embedded with Petri nets model are proposed. Moreover, the new weighted single-objective optimization based on reconfiguration cost and E/T is used. The results of a DC motor RPL scheduling suggest that the presented DTPN-GA scheduling algorithm has a significant impact on RPL scheduling, and provide obvious improvements over the conventional scheduling method in practice that meets duedate, minimizes reconfiguration cost, and enhances cost effectivity.

  5. A new speed optimization algorithm with application in pickling and rolling line

    Directory of Open Access Journals (Sweden)

    Xiaoyan Zhu

    2016-04-01

    Full Text Available In order to reduce equipment wear and operator pressure, as well as to improve the production efficiency of combined continuous pickling line and tandem cold rolling mill units, four sections’ speeds should be automatically optimized to control the three loopers’ abundance, which include the entry loopers’ entry speed, pickling speed, trimming speed, and tandem cold rolling mill entry speed. According to the optimal speed principle, a new optimization algorithm was proposed based on objective function. In this work, Nelder–Mead simplex method is applied to find the optimal solution by minimizing the objective function. In addition, the calculation of four initial speeds is specified, especially the initial tandem cold rolling mill entry speed. The proposed speed optimization algorithm was successfully applied to a 1450 mm continuous pickling line and tandem cold rolling mill. The acceleration and deceleration are smooth and steady when welding, trimming, or roll changing takes place in practice, the three loopers’ abundance are controlled in suitable range. Results show that the continuous pickling line unit could provide the material in maximum capacity to ensure that the tandem cold rolling mill unit’s production is efficient, and the rolling yield is greatly improved due to the decrease in the number of stops.

  6. A comparison of iterative algorithms and a mixed approach for in-line x-ray phase retrieval.

    Science.gov (United States)

    Meng, Fanbo; Zhang, Da; Wu, Xizeng; Liu, Hong

    2009-08-15

    Previous studies have shown that iterative in-line x-ray phase retrieval algorithms may have higher precision than direct retrieval algorithms. This communication compares three iterative phase retrieval algorithms in terms of accuracy and efficiency using computer simulations. We found the Fourier transformation based algorithm (FT) is of the fastest convergence, while the Poisson-solver based algorithm (PS) has higher precision. The traditional Gerchberg-Saxton algorithm (GS) is very slow and sometimes does not converge in our tests. Then a mixed FT-PS algorithm is presented to achieve both high efficiency and high accuracy. The mixed algorithm is tested using simulated images with different noise level and experimentally obtained images of a piece of chicken breast muscle.

  7. Hidden Subgroup States are Almost Orthogonal

    CERN Document Server

    Ettinger, M; Knill, E H; Ettinger, Mark; Hoyer, Peter; Knill, Emanuel

    1999-01-01

    It is well known that quantum computers can efficiently find a hidden subgroup $H$ of a finite Abelian group $G$. This implies that after only a polynomial (in $\\log |G|$) number of calls to the oracle function, the states corresponding to different candidate subgroups have exponentially small inner product. We show that this is true for noncommutative groups also. We present a quantum algorithm which identifies a hidden subgroup of an arbitrary finite group $G$ in only a linear (in $\\log |G|$) number of calls to the oracle function. This is exponentially better than the best classical algorithm. However our quantum algorithm requires an exponential amount of time, as in the classical case.

  8. Practical algorithms for simulation and reconstruction of digital in-line holograms

    CERN Document Server

    Latychevskaia, Tatiana

    2014-01-01

    Here, we present practical methods for simulation and reconstruction of in-line digital holograms recorded with plane and spherical waves. The algorithms described here are applicable to holographic imaging of an object exhibiting absorption as well as phase shifting properties. Optimal parameters, related to distances, sampling rate, and other factors for successful simulation and reconstruction of holograms are evaluated and criteria for the achievable resolution are worked out. Moreover, we show that the numerical procedures for the reconstruction of holograms recorded with plane and spherical waves are identical under certain conditions. Experimental examples of holograms and their reconstructions are also discussed.

  9. AI-BL1.0: a program for automatic on-line beamline optimization using the evolutionary algorithm.

    Science.gov (United States)

    Xi, Shibo; Borgna, Lucas Santiago; Zheng, Lirong; Du, Yonghua; Hu, Tiandou

    2017-01-01

    In this report, AI-BL1.0, an open-source Labview-based program for automatic on-line beamline optimization, is presented. The optimization algorithms used in the program are Genetic Algorithm and Differential Evolution. Efficiency was improved by use of a strategy known as Observer Mode for Evolutionary Algorithm. The program was constructed and validated at the XAFCA beamline of the Singapore Synchrotron Light Source and 1W1B beamline of the Beijing Synchrotron Radiation Facility.

  10. Ecodriver. D23.1: Report on test scenarios for val-idation of on-line vehicle algorithms

    NARCIS (Netherlands)

    Seewald, P.; Ivens, T.W.T.; Spronkmans, S.

    2014-01-01

    This deliverable provides a description of test scenarios that will be used for validation of WP22’s on-line vehicle algorithms. These algorithms consist of the two modules VE³ (Vehicle Energy and Environment Estimator) and RSG (Reference Signal Genera-tor) and will be tested using the Matlab/Simuli

  11. Fault Locating in HVDC Transmission Lines Using Generalized Regression Neural Network and Random Forest Algorithm

    Directory of Open Access Journals (Sweden)

    M. Farshad

    2013-09-01

    Full Text Available This paper presents a novel method based on machine learning strategies for fault locating in high voltage direct current (HVDC transmission lines. In the proposed fault-location method, only post-fault voltage signals measured at one terminal are used for feature extraction. In this paper, due to high dimension of input feature vectors, two different estimators including the generalized regression neural network (GRNN and the random forest (RF algorithm are examined to find the relation between the features and the fault location. The results of evaluation using training and test patterns obtained by simulating various fault types in a long overhead transmission line with different fault locations, fault resistance and pre-fault current values have indicated the efficiency and the acceptable accuracy of the proposed approach.

  12. 利用均匀离散曲波域LCHMM的图像降噪算法%Image denoising algorithm using Local Contextual Hidden Markov Model in uniform discrete curvelet domain

    Institute of Scientific and Technical Information of China (English)

    吴俊政; 严卫东; 边辉; 倪维平

    2012-01-01

    Using the Local Contextual Hidden Markov Model(LCHMM) in uniform discrete curvelet domain, an image denoising algorithm is proposed. After introducing the characteristics of the new transform, the statistical distribution rules of it are analyzed, which shows that the hidden markov model is suited to model the new transform's coefficients. The estimative coefficients of denoised image can be abtained by the model' s parameters, which are captured through expectation maximization training method. The proposed algorithm is applied to denoising the optical image and high resolution SAR image respectively. Compared with the LCHMMs in wavelet and contourlet domain, the experimental results show that the proposed algorithm can reduce noise effectively with well edge-preserving ability.%提出了一种在均匀离散曲波域中利用局部上下文隐马尔可夫模型进行建模的图像降噪算法.介绍均匀离散曲波变换的特点,分析其系数的统计分布规律,表明适合用隐马尔可夫模型对其进行建模.通过期望最大化训练获取模型的参数,利用参数得到降噪图像的系数估计.分别对光学图像和高分辨率的SAR图像进行了降噪实验,与小波域、轮廓波域的局部上下文隐马尔可夫模型等降噪方法进行比较,结果表明,提出的算法能够有效地去除噪声,具有较强的边缘保持能力.

  13. The Hidden Subgroup Problem

    CERN Document Server

    Wang, Frédéric

    2010-01-01

    We give an overview of the Hidden Subgroup Problem (HSP) as of July 2010, including new results discovered since the survey of arXiv:quant-ph/0411037v1. We recall how the problem provides a framework for efficient quantum algorithms and present the standard methods based on coset sampling. We study the Dihedral and Symmetric HSPs and how they relate to hard problems on lattices and graphs. Finally, we conclude with the known solutions and techniques, describe connections with efficient algorithms as well as miscellaneous variants of HSP. We also bring various contributions to the topic. We show that in theory, we can solve HSP over a given group inductively: the base case is solving HSP over its simple factor groups and the inductive step is building efficient oracles over a normal subgroup N and over the factor group G/N. We apply this analysis to the Dedekindian HSP to get an alternative abelian HSP algorithm based on a change of the underlying group. We also propose a quotient reduction by the normal group...

  14. Wideband Impulse Modulation and Receiver Algorithms for Multiuser Power Line Communications

    Directory of Open Access Journals (Sweden)

    Andrea M. Tonello

    2007-01-01

    Full Text Available We consider a bit-interleaved coded wideband impulse-modulated system for power line communications. Impulse modulation is combined with direct-sequence code-division multiple access (DS-CDMA to obtain a form of orthogonal modulation and to multiplex the users. We focus on the receiver signal processing algorithms and derive a maximum likelihood frequency-domain detector that takes into account the presence of impulse noise as well as the intercode interference (ICI and the multiple-access interference (MAI that are generated by the frequency-selective power line channel. To reduce complexity, we propose several simplified frequency-domain receiver algorithms with different complexity and performance. We address the problem of the practical estimation of the channel frequency response as well as the estimation of the correlation of the ICI-MAI-plus-noise that is needed in the detection metric. To improve the estimators performance, a simple hard feedback from the channel decoder is also used. Simulation results show that the scheme provides robust performance as a result of spreading the symbol energy both in frequency (through the wideband pulse and in time (through the spreading code and the bit-interleaved convolutional code.

  15. An Improved Multiobjective Particle Swarm Optimization Algorithm Using Minimum Distance of Point to Line

    Directory of Open Access Journals (Sweden)

    Zhengwu Fan

    2017-01-01

    Full Text Available In a multiobjective particle swarm optimization algorithm, selection of the global best particle for each particle of the population from a set of Pareto optimal solutions has a significant impact on the convergence and diversity of solutions, especially when optimizing problems with a large number of objectives. In this paper, a new method is introduced for selecting the global best particle, which is minimum distance of point to line multiobjective particle swarm optimization (MDPL-MOPSO. Using the basic concept of minimum distance of point to line and objective, the global best particle among archive members can be selected. Different test functions were used to test and compare MDPL-MOPSO with CD-MOPSO. The result shows that the convergence and diversity of MDPL-MOPSO are relatively better than CD-MOPSO. Finally, the proposed multiobjective particle swarm optimization algorithm is used for the Pareto optimal design of a five-degree-of-freedom vehicle vibration model, which resulted in numerous effective trade-offs among conflicting objectives, including seat acceleration, front tire velocity, rear tire velocity, relative displacement between sprung mass and front tire, and relative displacement between sprung mass and rear tire. The superiority of this work is demonstrated by comparing the obtained results with the literature.

  16. Multi-objective optimization algorithms for mixed model assembly line balancing problem with parallel workstations

    Directory of Open Access Journals (Sweden)

    Masoud Rabbani

    2016-12-01

    Full Text Available This paper deals with mixed model assembly line (MMAL balancing problem of type-I. In MMALs several products are made on an assembly line while the similarity of these products is so high. As a result, it is possible to assemble several types of products simultaneously without any additional setup times. The problem has some particular features such as parallel workstations and precedence constraints in dynamic periods in which each period also effects on its next period. The research intends to reduce the number of workstations and maximize the workload smoothness between workstations. Dynamic periods are used to determine all variables in different periods to achieve efficient solutions. A non-dominated sorting genetic algorithm (NSGA-II and multi-objective particle swarm optimization (MOPSO are used to solve the problem. The proposed model is validated with GAMS software for small size problem and the performance of the foregoing algorithms is compared with each other based on some comparison metrics. The NSGA-II outperforms MOPSO with respect to some comparison metrics used in this paper, but in other metrics MOPSO is better than NSGA-II. Finally, conclusion and future research is provided.

  17. The Three Dimensional Douglas-Peucker Algorithm for Generalization between River Network Line Element and DEM

    Directory of Open Access Journals (Sweden)

    DOU Shiqing

    2016-04-01

    Full Text Available At present, the three dimensional Douglas-Peucker (3D_DP algorithm is mainly used on generalization of a single type of DEM. This paper introduces the "bending adjustment index" to improve the 3D_DP algorithm, and puts forward a new method for generalizing river network and DEM in three-dimensional space. In this method, river network line vector data are extracted into 3D discrete point data sets which are added elevation attributes, and then they are merged with the 3D discrete point data sets of DEM. The generalization operations are made by the improved 3D_DP algorithm after the hierarchical selection of river networks. Through the contrast and analysis of the experimental results, the well experiment results have been achieved. Under the role of bending adjustment index, the overall distribution form of the rivers and the main terrain features can be reserved reasonably on the generalization. The river network and DEM data were generalized under the same simplified factor in this method. It improves the quality of the cartography generalization.

  18. [Research of adaptive notch filter based on QRD-LS algorithm for power line interference in ECG].

    Science.gov (United States)

    Wang, Shuyan; Dong, Jian; Guan, Xin

    2008-10-01

    In this paper, an adaptive notch filter based on QRD-LS algorithm for power line interference in ECG is researched. It can automatically eliminate the power line interference in order to improve the signal-to-interference ratio. Furthermore, QLD-LS algorithm, which is recursive least-squares minimization using systolic arrays, is employed to adjust the weight vector. Compared with the adaptive notch filter based on LMS (least mean square) algorithm, it has good robustness. Simulation examples confirm the results. QRD-LS adaptive notch filter has better performance in comparison with LMS method.

  19. Artificial Cooperative Search Algorithm based Load Frequency Control of Interconnected Power Systems with AC-DC Tie-lines

    Directory of Open Access Journals (Sweden)

    S. Ramesh kumar

    2014-05-01

    Full Text Available A maiden effort for optimal tuning of load frequency controller parameters using Artificial Cooperative Search (ACS algorithm for a two area interconnected power system with AC-DC parallel tie-lines has been presented in this paper. ACS is a recent swarm intelligence algorithm developed for solving numerical optimization problems. The swarm intelligence philosophy behind ACS algorithm is based on the migration of two artificial superorganisms as they biologically interact to achieve the global minimum value pertaining to the problem. The HVDC link in parallel with AC tie-line is used as system interconnection to effectively damp the frequency oscillations of the AC system. An integral square error criterion (ISE has been used as performance index to design the optimal parameters. A comparative study of tuned values has been presented to show the effectiveness of the Artificial Cooperative Search algorithm. The results demonstrate the success of ACS algorithm in solving Load frequency control (LFC optimization problem.

  20. Artificial Chattering Free on-line Modified Sliding Mode Algorithm: Applied in Continuum Robot Manipulator

    Directory of Open Access Journals (Sweden)

    Mohammad Mahdi Ebrahimi

    2013-11-01

    Full Text Available In this research, an artificial chattering free adaptive fuzzy modified sliding mode control design and application to continuum robotic manipulator has proposed in order to design high performance nonlinear controller in the presence of uncertainties. Regarding to the positive points in sliding mode controller, fuzzy logic controller and online tuning method, the output improves. Each method by adding to the previous controller has covered negative points. The main target in this research is design of model free estimator on-line sliding mode fuzzy algorithm for continuum robot manipulator to reach an acceptable performance. Continuum robot manipulators are highly nonlinear, and a number of parameters are uncertain, therefore design model free controller by both analytical and empirical paradigms are the main goal. Although classical sliding mode methodology has acceptable performance with known dynamic parameters such as stability and robustness but there are two important disadvantages as below: chattering phenomenon and mathematical nonlinear dynamic equivalent controller part. To solve the chattering fuzzy logic inference applied instead of dead zone function. To solve the equivalent problems in classical sliding mode controller this paper focuses on applied on-line tuning method in classical controller. This algorithm works very well in certain and uncertain environment. The system performance in sliding mode controller is sensitive to the sliding function. Therefore, compute the optimum value of sliding function for a system is the next challenge. This problem has solved by adjusting sliding function of the on-line method continuously in real-time. In this way, the overall system performance has improved with respect to the classical sliding mode controller. This controller solved chattering phenomenon as well as mathematical nonlinear equivalent part by applied modified PID supervisory method in modified fuzzy sliding mode controller and

  1. Application of Intelligence Based Genetic Algorithm for Job Sequencing Problem on Parallel Mixed-Model Assembly Line

    Directory of Open Access Journals (Sweden)

    A. Norozi

    2010-01-01

    Full Text Available Problem statement: In the area of globalization the degree of competition in the market increased and many companies attempted to manufacture the products efficiently to overcome the challenges faced. Approach: Mixed model assembly line was able to provide continuous flow of material and flexibility with regard to model change. The problem under study attempted to describe the mathematical programming limitation for minimizing the overall make-span and balancing objective for set of parallel lines. Results: A proposed mixed-integer model only able to find the best job sequence in each line to meet the problem objectives for the given number of job allotted to each line. Hence using the proposed mathematical model for large size problem was time consuming and inefficient as so many job allocation values should be checked. This study presented an intelligence based genetic algorithm approach to optimize the considered problem objectives through reducing the problem complexity. A heuristic algorithm was introduced to generate the initial population for intelligence based genetic algorithm. Then, it started to find the best sequence of jobs for each line based on the generated population by heuristic algorithm. By this means, intelligence based genetic algorithm only concentrated on those initial populations that produce better solutions instead of probing the entire search space. Conclusion/Recommendations: The results obtained from intelligence based genetic algorithm were used as an initial point for fine-tuning by simulated annealing to increase the quality of solution. In order to check the capability of proposed algorithm, several experimentations on the set of problems were done. As the total objective values in most of problems could not be improved by simulated algorithm, it proved the well performing of proposed intelligence based genetic algorithm in reaching the near optimal solutions.

  2. 基于隐条件随机场的异构Web数据源数据抽取算法研究%Research on Heterogeneous Web Data Extraction Algorithm Based on Hidden Conditional Random Fields

    Institute of Scientific and Technical Information of China (English)

    於实

    2012-01-01

    提出了一种基于改进的隐条件随机场的异构Web数据源数据抽取算法.通过对隐条件随机场进行的改进,对隐含变量进行更为准确的计算,并且克服了该模型的性能严重依赖于初始参数选择的问题,而且进行模型训练时不需要大量的人工标注的样本数据.实验结果表明,对比已有方法,本文算法在对具有缺省属性以及多属性特征的网站进行数据抽取时,在查全率,查准率以及F1值上都获得了令人满意的性能.%In this paper, we propose a novel heterogeneous Web data extraction algorithm based on modified hidden conditional random fields model. Firstly, the hidden conditional random fields model is modified to obtain more accurate calculation of implicit variables, and the problem that the model' s performance is heavily dependent on the choice of initial parameters is well solved. Moreover, the proposed model does not require a lot of manual labeling sample data to construct training data. Experimental results show that compared with the existing method, the proposed algorithm can obtain satisfactory performance both in websites with the default attributes and the websites with multi-attributes.

  3. Community structure detection algorithm based on hidden Markov random field%基于隐马尔可夫随机场的社区结构发现算法

    Institute of Scientific and Technical Information of China (English)

    刘栋; 刘震; 张贤坤

    2012-01-01

    针对社区结构发现问题,提出了一种基于隐马尔可夫随机场社区发现算法.该方法将网络中的顶点度数映射为顶点信息值,用马尔可夫随机场模型描述网络中上下文信息并构造系统能量函数,使用迭代条件模式算法对能量方程进行优化.该方法在Zachary空手道俱乐部网络、海豚关系网络以及美国大学足球联赛网络上进行验证,实验结果表明,该算法的准确率较高.%For the problem of community structure detection of complex networkt a community detection algorithm based on hidden Markov random field is presented. In this method, the network vertices information value corresponding to its degree is assumed, the HMRF model is applied to characterize the contexture-dependent information, and the energy function of system is defined, iterated conditional mode algorithm is applied to fulfill optimization. The algorithm is tested on Zachary karate clue network, dolphin social network and American College football network, and experimental result shows it has high accuracy rate.

  4. An inertia-free filter line-search algorithm for large-scale nonlinear programming

    Energy Technology Data Exchange (ETDEWEB)

    Chiang, Nai-Yuan; Zavala, Victor M.

    2016-02-15

    We present a filter line-search algorithm that does not require inertia information of the linear system. This feature enables the use of a wide range of linear algebra strategies and libraries, which is essential to tackle large-scale problems on modern computing architectures. The proposed approach performs curvature tests along the search step to detect negative curvature and to trigger convexification. We prove that the approach is globally convergent and we implement the approach within a parallel interior-point framework to solve large-scale and highly nonlinear problems. Our numerical tests demonstrate that the inertia-free approach is as efficient as inertia detection via symmetric indefinite factorizations. We also demonstrate that the inertia-free approach can lead to reductions in solution time because it reduces the amount of convexification needed.

  5. An Open-Source Implementation of the Critical-Line Algorithm for Portfolio Optimization

    Directory of Open Access Journals (Sweden)

    David H. Bailey

    2013-03-01

    Full Text Available Portfolio optimization is one of the problems most frequently encountered by financial practitioners. The main goal of this paper is to fill a gap in the literature by providing a well-documented, step-by-step open-source implementation of Critical Line Algorithm (CLA in scientific language. The code is implemented as a Python class object, which allows it to be imported like any other Python module, and integrated seamlessly with pre-existing code. We discuss the logic behind CLA following the algorithm’s decision flow. In addition, we developed several utilities that support finding answers to recurrent practical problems. We believe this publication will offer a better alternative to financial practitioners, many of whom are currently relying on generic-purpose optimizers which often deliver suboptimal solutions. The source code discussed in this paper can be downloaded at the authors’ websites (see Appendix.

  6. A FEASIBLE DIRECTION ALGORITHM WITHOUT LINE SEARCH FOR SOLVING MAX-BISECTION PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    Feng-min Xu; Cheng-xian Xu; Hong-gang Xue

    2005-01-01

    This paper concerns the solution of the NP-hard max-bisection problems. NCP functions are employed to convert max-bisection problems into continuous nonlinear programming problems. Solving the resulting continuous nonlinear programming problem generates a solution that gives an upper bound on the optimal value of the max-bisection problem.From the solution, the greedy strategy is used to generate a satisfactory approximate solution of the max-bisection problem. A feasible direction method without line searches is proposed to solve the resulting continuous nonlinear programming, and the convergence of the algorithm to KKT point of the resulting problem is proved. Numerical experiments and comparisons on well-known test problems, and on randomly generated test problems show that the proposed method is robust, and very efficient.

  7. Image Interpolation via Scanning Line Algorithm and Discontinuous B-Spline

    Directory of Open Access Journals (Sweden)

    Cheng-ming Liu

    2017-05-01

    Full Text Available Image interpolation is a basic operation in image processing. Lots of methods have been proposed, including convolution-based methods, edge modeling methods, point spread function (PSF-based methods or learning-based methods. Most of them, however, present a high computational complexity and are not suitable for real time applications. However, fast methods are not able to provide artifacts-free images. In this paper we describe a new image interpolation method by using scanning line algorithm which can generate C - 1 curves or surfaces. The C - 1 interpolation can truncate the interpolation curve at big skipping; hence, the image edge can be kept. Numerical experiments illustrate the efficiency of the novel method.

  8. Comparison of two extractable nuclear antigen testing algorithms: ALBIA versus ELISA/line immunoassay.

    Science.gov (United States)

    Chandratilleke, Dinusha; Silvestrini, Roger; Culican, Sue; Campbell, David; Byth-Wilson, Karen; Swaminathan, Sanjay; Lin, Ming-Wei

    2016-08-01

    Extractable nuclear antigen (ENA) antibody testing is often requested in patients with suspected connective tissue diseases. Most laboratories in Australia use a two step process involving a high sensitivity screening assay followed by a high specificity confirmation test. Multiplexing technology with Addressable Laser Bead Immunoassay (e.g., FIDIS) offers simultaneous detection of multiple antibody specificities, allowing a single step screening and confirmation. We compared our current diagnostic laboratory testing algorithm [Organtec ELISA screen / Euroimmun line immunoassay (LIA) confirmation] and the FIDIS Connective Profile. A total of 529 samples (443 consecutive+86 known autoantibody positivity) were run through both algorithms, and 479 samples (90.5%) were concordant. The same autoantibody profile was detected in 100 samples (18.9%) and 379 were concordant negative samples (71.6%). The 50 discordant samples (9.5%) were subdivided into 'likely FIDIS or current method correct' or 'unresolved' based on ancillary data. 'Unresolved' samples (n = 25) were subclassified into 'potentially' versus 'potentially not' clinically significant based on the change to clinical interpretation. Only nine samples (1.7%) were deemed to be 'potentially clinically significant'. Overall, we found that the FIDIS Connective Profile ENA kit is non-inferior to the current ELISA screen/LIA characterisation. Reagent and capital costs may be limiting factors in using the FIDIS, but potential benefits include a single step analysis and simultaneous detection of dsDNA antibodies.

  9. Faddeev-Jackiw approach to hidden symmetries

    CERN Document Server

    Wotzasek, C

    1994-01-01

    The study of hidden symmetries within Dirac's formalism does not possess a systematic procedure due to the lack of first-class constraints to act as symmetry generators. On the other hand, in the Faddeev-Jackiw approach, gauge and reparametrization symmetries are generated by the null eigenvectors of the sympletic matrix and not by constraints, suggesting the possibility of dealing systematically with hidden symmetries through this formalism. It is shown in this paper that indeed hidden symmetries of noninvariant or gauge fixed systems are equally well described by null eigenvectors of the sympletic matrix, just as the explicit invariances. The Faddeev-Jackiw approach therefore provide a systematic algorithm for treating all sorts of symmetries in an unified way. This technique is illustrated here by the SL(2,R) Kac-Moody current algebra of the 2-D induced gravity proposed by Polyakov, which is a hidden symmetry in the canonical approach of constrained systems via Dirac's method, after conformal and reparamet...

  10. 3D Reconstruction from 2D Line Drawings only with Visible Vertices and Edges

    Institute of Scientific and Technical Information of China (English)

    WANG Xuan; DONG Li-jun

    2014-01-01

    The human vision system can reconstruct a 3D object easily from single 2D line drawings even if the hidden lines of the object are invisible. Now, there are many methods have emulated this ability, but when the hidden lines of the object are invisible, these methods cannot reconstruct a complete 3D object. Therefore, we put forward a new algorithm to settle this hard problem. Our approach consists of two steps: (1) infer the invisible vertices and edges to complete the line drawing, (2) propose a vertex-based optimization method to reconstruct a 3D object.

  11. A genetic algorithm-based approach to flexible flow-line scheduling with variable lot sizes.

    Science.gov (United States)

    Lee, I; Sikora, R; Shaw, M J

    1997-01-01

    Genetic algorithms (GAs) have been used widely for such combinatorial optimization problems as the traveling salesman problem (TSP), the quadratic assignment problem (QAP), and job shop scheduling. In all of these problems there is usually a well defined representation which GA's use to solve the problem. We present a novel approach for solving two related problems-lot sizing and sequencing-concurrently using GAs. The essence of our approach lies in the concept of using a unified representation for the information about both the lot sizes and the sequence and enabling GAs to evolve the chromosome by replacing primitive genes with good building blocks. In addition, a simulated annealing procedure is incorporated to further improve the performance. We evaluate the performance of applying the above approach to flexible flow line scheduling with variable lot sizes for an actual manufacturing facility, comparing it to such alternative approaches as pair wise exchange improvement, tabu search, and simulated annealing procedures. The results show the efficacy of this approach for flexible flow line scheduling.

  12. Line-feature-based SLAM Algorithm%一种基于线特征的SLAM算法研究

    Institute of Scientific and Technical Information of China (English)

    韩锐; 李文锋

    2006-01-01

    A line-feature based SLAM algorithm is presented in this paper to resolve the conflict between the requirements of computational complexity and information-richness within the pointfeature based SLAM algorithm, All operations required for building and maintaining the map, such as model-setting, data association, and state-updating, are described and formulated. This approach has been programmed and successfully tested in the simulation work, and results are shown at the end of this paper.

  13. 改进的隐马尔可夫表情识别模型参数优化算法%Modified parameter optimization algorithm for facial expression recognition based on hidden Markov model

    Institute of Scientific and Technical Information of China (English)

    黄小娟; 吴荣腾

    2014-01-01

    人脸表情识别是人工智能领域中极富挑战性的课题,针对表情识别中存在的识别率低与计算量大的问题,提出了一种新的改进的隐马尔可夫表情识别模型参数优化的算法。先采用新的初始参数优化模型,然后利用Baum-Welch算法进行重估计,从而建立新的HMM人脸表情模型。实验结果表明,新模型明显提高了人脸表情的识别率并降低了计算量。%Facial expression recognition is quite a challenging subject in the field of artificial intelligence. Aiming at the problems of low recognition rate and the large computational problem of face expression recognition,a new modified parameter optimization algo-rithm is proposed for facial expression recognition based on the hidden Markov model. The method uses the initial parameters to opti-mize the model,and then uses Baum-Welch algorithm to estimate the parameters again. Hence,the new facial expression model based on HMM is established. The experimental results show that the new model significantly reduces the calculation amount and improve the facial expression recognition rate.

  14. On-line Fault Diagnosis in Industrial Processes Using Variable Moving Window and Hidden Markov Model%基于变长度移动窗口和HMM的工业过程故障在线诊断

    Institute of Scientific and Technical Information of China (English)

    周韶园; 谢磊; 王树青

    2005-01-01

    An integrated framework is presented to represent and classify process data for on-line identifying abnormal operating conditions. It is based on pattern recognition principles and consists of a feature extraction step, by which wavelet transform and principal component analysis are used to capture the inherent characteristics from process measurements, followed by a similarity assessment step using hidden Markov model (HMM) for pattern comparison. In most previous cases, a fixed-length moving window was employed to track dynamic data, and often failed to capture enough information for each fault and sometimes even deteriorated the diagnostic performance. A variable moving window, the length of which is modified with time, is introduced in this paper and case studies on the Tennessee Eastman process illustrate the potential of the proposed method.

  15. Web Data Text Extraction Algorithm Based on Hidden Nodes Resonance Dense Matching%基于隐节点共振致密配对的Web数据文本抽取

    Institute of Scientific and Technical Information of China (English)

    亢华爱

    2015-01-01

    Web网络中存在海量文本,需要进行合理高效的文本抽取,实现Web文本数据挖掘。由于Web文本数据的高维特性,文本抽取过程中自动分类配对困难。提出一种基于RBF神经网络隐节点共振致密配对的Web数据文本抽取算法,进行Web数据文本特征采样与关联主特征挖掘,在每次移动中形成RBF隐节点共振致密配对,得到最优文本特征选择的路径,建立RBF神经网络分类器,实现基于蚁群算法的特征抽取算法改进。实验结果表明,该算法能有效实现对隐节点的共振致密配对,特征挖掘跟踪性能较好,保障了挖掘性能,系统所提取的特征分量与其他模糊分量差距较小,文本正确抽取召回率高于传统方法,在Web网络数据文本抽取中具有优越可靠的应用价值。%There are a large number of text in Web network, we need for text extraction efficiently and implementation of Web text data mining. Due to the high dimensionality of the Web text data, matching difficulties of automatic text classifica⁃tion extraction process. A Web data text extraction algorithm of RBF neural network hidden nodes resonance dense pairing based text feature is proposed, Web data sampling associated with main feature mining, random selection to the mass data information, the formation of RBF hidden nodes in each move in resonance dense matching, get the path optimal text fea⁃ture selection, RBF neural network classifier, the improved feature extraction algorithm is obtained based on ant colony al⁃gorithm. The experimental results show that the algorithm can effectively realize the resonance of hidden nodes dense matching, feature mining has good tracking performance, it can guarantee the mining performance, the component features extracted from the system and other fuzzy component gap is smaller, the recall rate of correct text extraction is higher than traditional method, and it has good application value

  16. Factorization of J-unitary matrix polynomials on the line and a Schur algorithm for generalized Nevanlinna functions

    NARCIS (Netherlands)

    Alpay, D.; Dijksma, A.; Langer, H.

    2004-01-01

    We prove that a 2 × 2 matrix polynomial which is J-unitary on the real line can be written as a product of normalized elementary J-unitary factors and a J-unitary constant. In the second part we give an algorithm for this factorization using an analog of the Schur transformation.

  17. The Global Convergence of Self-Scaling BFGS Algorithm with Nonmonotone Line Search for Unconstrained Nonconvex Optimization Problems

    Institute of Scientific and Technical Information of China (English)

    Hong Xia YIN; Dong Lei DU

    2007-01-01

    The self-scaling quasi-Newton method solves an unconstrained optimization problem by scaling the Hessian approximation matrix before it is updated at each iteration to avoid the possible large eigenvalues in the Hessian approximation matrices of the objective function. It has been proved in the literature that this method has the global and superlinear convergence when the objective function is convex (or even uniformly convex). We propose to solve unconstrained nonconvex optimization problems by a self-scaling BFGS algorithm with nonmonotone linear search. Nonmonotone line search has been recognized in numerical practices as a competitive approach for solving large-scale nonlinear problems. We consider two different nonmonotone line search forms and study the global convergence of these nonmonotone self-scale BFGS algorithms. We prove that, under some weaker condition than that in the literature, both forms of the self-scaling BFGS algorithm are globally convergent for unconstrained nonconvex optimization problems.

  18. Advanced Discontinuous Galerkin Algorithms and First Open-Field Line Turbulence Simulations

    Science.gov (United States)

    Hammett, G. W.; Hakim, A.; Shi, E. L.

    2016-10-01

    New versions of Discontinuous Galerkin (DG) algorithms have interesting features that may help with challenging problems of higher-dimensional kinetic problems. We are developing the gyrokinetic code Gkeyll based on DG. DG also has features that may help with the next generation of Exascale computers. Higher-order methods do more FLOPS to extract more information per byte, thus reducing memory and communications costs (which are a bottleneck at exascale). DG uses efficient Gaussian quadrature like finite elements, but keeps the calculation local for the kinetic solver, also reducing communication. Sparse grid methods might further reduce the cost significantly in higher dimensions. The inner product norm can be chosen to preserve energy conservation with non-polynomial basis functions (such as Maxwellian-weighted bases), which can be viewed as a Petrov-Galerkin method. This allows a full- F code to benefit from similar Gaussian quadrature as used in popular δf gyrokinetic codes. Consistent basis functions avoid high-frequency numerical modes from electromagnetic terms. We will show our first results of 3 x + 2 v simulations of open-field line/SOL turbulence in a simple helical geometry (like Helimak/TORPEX), with parameters from LAPD, TORPEX, and NSTX. Supported by the Max-Planck/Princeton Center for Plasma Physics, the SciDAC Center for the Study of Plasma Microturbulence, and DOE Contract DE-AC02-09CH11466.

  19. Partially Hidden Markov Models

    DEFF Research Database (Denmark)

    Forchhammer, Søren Otto; Rissanen, Jorma

    1996-01-01

    Partially Hidden Markov Models (PHMM) are introduced. They differ from the ordinary HMM's in that both the transition probabilities of the hidden states and the output probabilities are conditioned on past observations. As an illustration they are applied to black and white image compression wher...

  20. Quantum Hidden Subgroup Problems A Mathematical Perspective

    CERN Document Server

    Lomonaco, S J; Lomonaco, Samuel J.; Kauffman, Louis H.

    2002-01-01

    The ultimate objective of this paper is to create a stepping stone to the development of new quantum algorithms. The strategy chosen is to begin by focusing on the class of abelian quantum hidden subgroup algorithms, i.e., the class of abelian algorithms of the Shor/Simon genre. Our strategy is to make this class of algorithms as mathematically transparent as possible. By the phrase "mathematically transparent" we mean to expose, to bring to the surface, and to make explicit the concealed mathematical structures that are inherently and fundamentally a part of such algorithms. In so doing, we create symbolic abelian quantum hidden subgroup algorithms that are analogous to the those symbolic algorithms found within such software packages as Axiom, Cayley, Maple, Mathematica, and Magma. As a spin-off of this effort, we create three different generalizations of Shor's quantum factoring algorithm to free abelian groups of finite rank. We refer to these algorithms as wandering (or vintage Z_Q) Shor algorithms. They...

  1. Model-driven product line engineering for mapping parallel algorithms to parallel computing platforms

    NARCIS (Netherlands)

    Arkin, Ethem; Tekinerdogan, Bedir

    2016-01-01

    Mapping parallel algorithms to parallel computing platforms requires several activities such as the analysis of the parallel algorithm, the definition of the logical configuration of the platform, the mapping of the algorithm to the logical configuration platform and the implementation of the sou

  2. Combining contour detection algorithms for the automatic extraction of the preparation line from a dental 3D measurement

    Science.gov (United States)

    Ahlers, Volker; Weigl, Paul; Schachtzabel, Hartmut

    2005-04-01

    Due to the increasing demand for high-quality ceramic crowns and bridges, the CAD/CAM-based production of dental restorations has been a subject of intensive research during the last fifteen years. A prerequisite for the efficient processing of the 3D measurement of prepared teeth with a minimal amount of user interaction is the automatic determination of the preparation line, which defines the sealing margin between the restoration and the prepared tooth. Current dental CAD/CAM systems mostly require the interactive definition of the preparation line by the user, at least by means of giving a number of start points. Previous approaches to the automatic extraction of the preparation line rely on single contour detection algorithms. In contrast, we use a combination of different contour detection algorithms to find several independent potential preparation lines from a height profile of the measured data. The different algorithms (gradient-based, contour-based, and region-based) show their strengths and weaknesses in different clinical situations. A classifier consisting of three stages (range check, decision tree, support vector machine), which is trained by human experts with real-world data, finally decides which is the correct preparation line. In a test with 101 clinical preparations, a success rate of 92.0% has been achieved. Thus the combination of different contour detection algorithms yields a reliable method for the automatic extraction of the preparation line, which enables the setup of a turn-key dental CAD/CAM process chain with a minimal amount of interactive screen work.

  3. THE SEGMENTATION OF A TEXT LINE FOR A HANDWRITTEN UNCONSTRAINED DOCUMENT USING THINING ALGORITHM

    NARCIS (Netherlands)

    Tsuruoka, S.; Adachi, Y.; Yoshikawa, T.

    2004-01-01

    For printed documents, the projection analysis of black pixels is widely used for the segmentation of a text line. However, for handwritten documents, we think that the projection analysis is not appropriate, as the separating border line of a text line is not a straight line on a paper with no rule

  4. THE SEGMENTATION OF A TEXT LINE FOR A HANDWRITTEN UNCONSTRAINED DOCUMENT USING THINING ALGORITHM

    NARCIS (Netherlands)

    Tsuruoka, S.; Adachi, Y.; Yoshikawa, T.

    2004-01-01

    For printed documents, the projection analysis of black pixels is widely used for the segmentation of a text line. However, for handwritten documents, we think that the projection analysis is not appropriate, as the separating border line of a text line is not a straight line on a paper with no

  5. Algorithm of Parallel Oscillation Suppression Based on Dual Decomposition of Hidden Groups%基于隐性群体双模分解的并行振荡抑制算法

    Institute of Scientific and Technical Information of China (English)

    姚曙光

    2014-01-01

    The reality of the communication network composed of multiple network, complex network structure with multi task allocation, in task processing will produce parallel oscillation, the oscillation in complex networks is an important fac-tor to improve the inhibition of complex network parallel processing. Parallel oscillation by using the traditional method of singular value decomposition to reduce the dimensionality of the matching algorithm, the memory requirement and the time loss a lot of in the face of large-scale complex task is solved. This paper proposes a parallel oscillation suppression algo-rithm based on dual decomposition of hidden groups, first carries on the complex network of multi dimension business paral-lel processing model design, the index system of multi dimension business parameters of complex network parallel process-ing model, implicit parallel feature matching method to realize the double feature matching parallel processing. Simulation results show that, the parallel feature matching by using the algorithm of hidden groups of complex network, to realize the parallel processing and serial processing, the least square singular value decomposition time cost and space cost is reduced greatly, improve the speedup of 2 times, effectively inhibit the network oscillations. Algorithm in the complex network of multi task parallel processing in the number, it has the superior performance of delay and energy efficiency.%现实的通信网络由多重网络组成,构成具有多维任务分配的复杂网络结构,在任务处理中会产生并行振荡,对复杂网络中的振荡抑制是提高复杂网络并行处理的重要因素。传统的并行振荡方法采用奇异值分解降维的特征匹配算法,在面对大规模复杂任务求解时产生大量的内存需求和时间损耗。提出一种基于隐性群体双模分解的并行振荡抑制算法,首先进行复杂网络多维业务并行处理模型设计,得到了复杂网

  6. Image haze removal algorithm for transmission lines based on weighted Gaussian PDF

    Science.gov (United States)

    Wang, Wanguo; Zhang, Jingjing; Li, Li; Wang, Zhenli; Li, Jianxiang; Zhao, Jinlong

    2015-03-01

    Histogram specification is a useful algorithm of image enhancement field. This paper proposes an image haze removal algorithm of histogram specification based on the weighted Gaussian probability density function (Gaussian PDF). Firstly, we consider the characteristics of image histogram that captured when sunny, fogging and haze weather. Then, we solve the weak intensity of image specification through changing the variance and weighted Gaussian PDF. The performance of the algorithm could removal the effective of fog and experimental results show the superiority of the proposed algorithm compared with histogram specification. It also has much advantage in respect of low computational complexity, high efficiency, no manual intervention.

  7. Optimal Scheduling of Material Handling Devices in a PCB Production Line: Problem Formulation and a Polynomial Algorithm

    Directory of Open Access Journals (Sweden)

    Ada Che

    2008-01-01

    Full Text Available Modern automated production lines usually use one or multiple computer-controlled robots or hoists for material handling between workstations. A typical application of such lines is an automated electroplating line for processing printed circuit boards (PCBs. In these systems, cyclic production policy is widely used due to large lot size and simplicity of implementation. This paper addresses cyclic scheduling of a multihoist electroplating line with constant processing times. The objective is to minimize the cycle time, or equivalently to maximize the production throughput, for a given number of hoists. We propose a mathematical model and a polynomial algorithm for this scheduling problem. Computational results on randomly generated instances are reported.

  8. Recommending services via hybrid recommendation algorithms and hidden Markov model in cloud%基于混合推荐和隐马尔科夫模型的服务推荐方法

    Institute of Scientific and Technical Information of China (English)

    马建威; 陈洪辉; STEPHAN Reiff-Marganiec

    2016-01-01

    针对现阶段越来越多的服务开始部署于云环境,服务数量呈几何级增长,必须获取并推荐最优服务,而传统的基于内容的过滤或协同过滤方法缺乏对新用户和冗余服务的有效处理方法,提出一种在云环境下对最优服务进行有效推荐的方法。首先,分析2种协同过滤方法的优缺点,并提出改进的混合推荐算法;其次,针对常常被忽略的新用户学习策略,提出新用户偏好的确定方法;针对服务的动态变化情况,基于隐马尔科夫模型(hidden Markov model)提出一种冗余服务消解策略。最后,基于真实数据集和通过公开API获取的公共服务集进行实验。研究结果表明:所提出的算法与其他方法相比具有更高的准确度和更好的服务质量,能更有效地提高系统性能。%With the increase of the number of users using web services for online activities through thousands of services, proper services must be obtained; however, the existing methods such as content-based approaches or collaborative filtering do not consider new users and redundant services. An effective approach was proposed to recommend the most appropriate services in a cloud computing environment. Firstly, a hybrid collaborative filtering method was proposed to recommend services. The method greatly enhances the prediction of the current QoS value which may differ from that of the service publication phase. Secondly, a strategy was proposed to obtain the preferences of the new users who are neglected in other research. Thirdly, a HMM (hidden Markov model)-based approach was proposed to identify redundant services in a dynamic situation. Finally, several experiments were set up based on real data set and publicly published web services data set. The results show that the proposed algorithm has better performance than other methods.

  9. Fast characterization of line-end shortening and application of novel correction algorithms in e-beam direct write

    Science.gov (United States)

    Freitag, Martin; Choi, Kang-Hoon; Gutsch, Manuela; Hohle, Christoph; Galler, Reinhard; Krüger, Michael; Weidenmueller, Ulf

    2011-04-01

    For the manufacturing of semiconductor technologies following the ITRS roadmap, we will face the nodes well below 32nm half pitch in the next 2~3 years. Despite being able to achieve the required resolution, which is now possible with electron beam direct write variable shaped beam (EBDW VSB) equipment and resists, it becomes critical to precisely reproduce dense line space patterns onto a wafer. This exposed pattern must meet the targets from the layout in both dimensions (horizontally and vertically). For instance, the end of a line must be printed in its entire length to allow a later placed contact to be able to land on it. Up to now, the control of printed patterns such as line ends is achieved by a proximity effect correction (PEC) which is mostly based on a dose modulation. This investigation of the line end shortening (LES) includes multiple novel approaches, also containing an additional geometrical correction, to push the limits of the available data preparation algorithms and the measurement. The designed LES test patterns, which aim to characterize the status of LES in a quick and easy way, were exposed and measured at Fraunhofer Center Nanoelectronic Technologies (CNT) using its state of the art electron beam direct writer and CD-SEM. Simulation and exposure results with the novel LES correction algorithms applied to the test pattern and a large production like pattern in the range of our target CDs in dense line space features smaller than 40nm will be shown.

  10. A new wavelet-based reconstruction algorithm for twin image removal in digital in-line holography

    Science.gov (United States)

    Hattay, Jamel; Belaid, Samir; Aguili, Taoufik; Lebrun, Denis

    2016-07-01

    Two original methods are proposed here for digital in-line hologram processing. Firstly, we propose an entropy-based method to retrieve the focus plane which is very useful for digital hologram reconstruction. Secondly, we introduce a new approach to remove the so-called twin images reconstructed by holograms. This is achieved owing to the Blind Source Separation (BSS) technique. The proposed method is made up of two steps: an Adaptive Quincunx Lifting Scheme (AQLS) and a statistical unmixing algorithm. The AQLS tool is based on wavelet packet transform, whose role is to maximize the sparseness of the input holograms. The unmixing algorithm uses the Independent Component Analysis (ICA) tool. Experimental results confirm the ability of convolutive blind source separation to discard the unwanted twin image from in-line digital holograms.

  11. Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms

    CERN Document Server

    Khardon, R; Servedio, R A; 10.1613/jair.1655

    2011-01-01

    The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One method of increasing the expressiveness of learned hypotheses in this context is to expand the feature set to include conjunctions of basic features. This can be done explicitly or where possible by using a kernel function. Focusing on the well known Perceptron and Winnow algorithms, the paper demonstrates a tradeoff between the computational efficiency with which the algorithm can be run over the expanded feature space and the generalization ability of the corresponding learning algorithm. We first describe several kernel functions which capture either limited forms of conjunctions or all conjunctions. We show that these kernels can be used to efficiently run the Perceptron algorithm over a feature space of exponentially many conjunctions; however we also show that using such kernels, the Perceptron algorithm can provably make an ex...

  12. Entanglement without hidden nonlocality

    Science.gov (United States)

    Hirsch, Flavien; Túlio Quintino, Marco; Bowles, Joseph; Vértesi, Tamás; Brunner, Nicolas

    2016-11-01

    We consider Bell tests in which the distant observers can perform local filtering before testing a Bell inequality. Notably, in this setup, certain entangled states admitting a local hidden variable model in the standard Bell scenario can nevertheless violate a Bell inequality after filtering, displaying so-called hidden nonlocality. Here we ask whether all entangled states can violate a Bell inequality after well-chosen local filtering. We answer this question in the negative by showing that there exist entangled states without hidden nonlocality. Specifically, we prove that some two-qubit Werner states still admit a local hidden variable model after any possible local filtering on a single copy of the state.

  13. A Tabu Search Algorithm for the Parallel Assembly Line Balancing Problem

    OpenAIRE

    ÖZCAN, Uğur; ÇERÇİOĞLU, Hakan; GÖKÇEN, Hadi; TOKLU, Bilal

    2010-01-01

    In a production facility there may be more than one straight assembly line located in parallel. Balancing of parallel assembly lines will provide the flexibility to minimize the total number of workstations due to common resource. This type of problem is called as parallel assembly line balancing (PALB) problem. In this paper, a tabu search based approach is proposed for PALB problem with aim of maximizing line efficiency (LE) (or minimizing number of stations) and minimizing variation of wor...

  14. Investigation of Line Current Harmonics in Cascaded Multi-level Inverter Based Induction Motor Drive and an Adaptive On-line Selective Current Harmonic Elimination Algorithm

    Directory of Open Access Journals (Sweden)

    P. Avirajamanjula

    2015-03-01

    Full Text Available Multilevel Inverters (MLIs have drawn increasing attention in numerous applications, especially in drives, distributed energy resources area, utility etc. MLIs have the ability to synthesize a near sinusoidal output voltage wave with minimal Total Harmonic Distortion (THD in low frequency switching. Even though they offer lower THD, the presence of lower order harmonics is objectionable and harmonics elimination in Multilevel Inverters (MLIs has been receiving immense attention for the past few decades. Existing Selective Harmonic Elimination (SHE techniques can eliminate the objectionable lower order voltage harmonics with low switching frequency by solving the Fourier non-linear transcendental equations of the output voltage. The line current harmonics has a direct role to play on the magneto-motive force and results in increase of mismatching of air-gap permeance, vibrations, acoustic noise etc. This study proposes Normalized Least Mean Squares (NLMS algorithm based scheme to eliminate the selected dominant harmonics in load current using only the knowledge of the frequencies to be eliminated. The algorithm is simulated using MATLAB/SIMULINK tool for a three-phase VSI to eliminate the fifth and seventh harmonics. The informative simulation results verify the validity and effectiveness of the proposed algorithm. The system performance is analyzed based on the simulation results considering Total Harmonic Distortion (THD, magnitude of eliminated harmonics and frequency spectrum.

  15. Hidden circuits and argumentation

    Science.gov (United States)

    Leinonen, Risto; Kesonen, Mikko H. P.; Hirvonen, Pekka E.

    2016-11-01

    Despite the relevance of DC circuits in everyday life and schools, they have been shown to cause numerous learning difficulties at various school levels. In the course of this article, we present a flexible method for teaching DC circuits at lower secondary level. The method is labelled as hidden circuits, and the essential idea underlying hidden circuits is in hiding the actual wiring of DC circuits, but to make their behaviour evident for pupils. Pupils are expected to find out the wiring of the circuit which should enhance their learning of DC circuits. We present two possible ways to utilise hidden circuits in a classroom. First, they can be used to test and enhance pupils’ conceptual understanding when pupils are expected to find out which one of the offered circuit diagram options corresponds to the actual circuit shown. This method aims to get pupils to evaluate the circuits holistically rather than locally, and as a part of that aim this method highlights any learning difficulties of pupils. Second, hidden circuits can be used to enhance pupils’ argumentation skills with the aid of argumentation sheet that illustrates the main elements of an argument. Based on the findings from our co-operating teachers and our own experiences, hidden circuits offer a flexible and motivating way to supplement teaching of DC circuits.

  16. K­MEANS CLUSTERING FOR HIDDEN MARKOV MODEL

    NARCIS (Netherlands)

    Perrone, M.P.; Connell, S.D.

    2004-01-01

    An unsupervised k­means clustering algorithm for hidden Markov models is described and applied to the task of generating subclass models for individual handwritten character classes. The algorithm is compared to a related clustering method and shown to give a relative change in the error rate of as

  17. A Property-Based Integrated Line-Generating Algorithm%基于直线特性的直线生成集成算法

    Institute of Scientific and Technical Information of China (English)

    程锦; 陆国栋; 谭建荣

    2001-01-01

    Present line-generating algorithms, which include Bresenham algorithm, symmetrical algorithm and the algorithm based on the chain code theory of the line, are analyzed and compared in this paper. A property-based on the chain code theory of the line, are analyzed and compared in this paper. A property-based integrated line-generating algorithm, which is based on the Bresenham algorithm and makes full use of the symmetry, direction and continuity of the line, is presented to increase the speed of line generating. The results of our experiments have proved that the line-generating speed of the integrated algorithm is increased by more than 50 percent compared to that of Bresenham algorithm. The new algorithm is especially efficient for engineering drawings, in which the inclinations of most lines are 0°, 180°, ±90°, ±45 °and ±135°. In can be thought that the integrated line-generating algorithm has make great progress in the way to reach the minimum value of the operation time in generating a line. Existing CAD&CG algorithms must take into account the particularity and entireness of the object while the integrity and universality of the processing object is pursued. To handle the related algorithms in some special way according to the characteristics of engineering drawings is an effective method to improve present CAD&CG algorithms.%在分析和比较了现有的直线生成算法后,以Bresenham算法为基础,充分利用直线的对称性、方向性和连续性,设计了一个基于直线特性的直线生成集成算法,以进一步提高直线生成速度.实验表明,该集成算法与Bresenham算法相比,直线绘制速度提高了50%以上.特别是在工程图样中,由于绝大部分直线为水平线、垂直线、±45°方向直线,因此本算法将更为有效.

  18. How Hidden Can Be Even More Hidden?

    CERN Document Server

    Fraczek, Wojciech; Szczypiorski, Krzysztof

    2011-01-01

    The paper presents Deep Hiding Techniques (DHTs) that define general techniques that can be applied to every network steganography method to improve its undetectability and make steganogram extraction harder to perform. We define five groups of techniques that can make steganogram less susceptible to detection and extraction. For each of the presented group, examples of the usage are provided based on existing network steganography methods. To authors' best knowledge presented approach is the first attempt in the state of the art to systematically describe general solutions that can make steganographic communication more hidden and steganogram extraction harder to perform.

  19. Stabilization of stochastic systems with hidden Markovian jumps

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    This paper considers the adaptive control of discrete-time hybrid stochastic systems with unknown randomly jumping parameters described by a finite-state hidden Markov chain. An intuitive yet longstanding conjecture in this area is that such hybrid systems can be adaptively stabilized whenever the rate of transition of the hidden Markov chain is small enough. This paper provides a rigorous positive answer to this conjecture by establishing the global stability of a gradient-algorithm-based adaptive linear-quadratic control.

  20. Hidden Markov Models with Factored Gaussian Mixtures Densities

    Institute of Scientific and Technical Information of China (English)

    LI Hao-zheng; LIU Zhi-qiang; ZHU Xiang-hua

    2004-01-01

    We present a factorial representation of Gaussian mixture models for observation densities in Hidden Markov Models(HMMs), which uses the factorial learning in the HMM framework. We derive the reestimation formulas for estimating the factorized parameters by the Expectation Maximization (EM) algorithm. We conduct several experiments to compare the performance of this model structure with Factorial Hidden Markov Models(FHMMs) and HMMs, some conclusions and promising empirical results are presented.

  1. Search for Hidden Particles

    CERN Multimedia

    The SHiP Experiment is a new general-purpose fixed target facility at the SPS to search for hidden particles as predicted by a very large number of recently elaborated models of Hidden Sectors which are capable of accommodating dark matter, neutrino oscillations, and the origin of the full baryon asymmetry in the Universe. Specifically, the experiment is aimed at searching for very weakly interacting long lived particles including Heavy Neutral Leptons - right-handed partners of the active neutrinos; light supersymmetric particles - sgoldstinos, etc.; scalar, axion and vector portals to the hidden sector. The high intensity of the SPS and in particular the large production of charm mesons with the 400 GeV beam allow accessing a wide variety of light long-lived exotic particles of such models and of SUSY. Moreover, the facility is ideally suited to study the interactions of tau neutrinos.

  2. Algorithms for removing the hidden lines of 2D figures in assembly drawing%装配图中的二维图形消隐算法

    Institute of Scientific and Technical Information of China (English)

    赵启成; 宁伟; 杨元东; 刘佩学; 张海生

    2000-01-01

    在已有的消隐算法中,所采用的数据结构复杂,占用的存储容量大、效率低.提出了一种快速消隐被遮挡部分的算法,给出了视图的定义,利用视图的闭包矩形进行遮挡分析,缩小搜索消隐图素的范围,减少求交计算的次数.对消隐图素进行消隐分析的同时,采用了闭包矩形的重叠性检验,以进一步提高效率.

  3. 二维图形消隐算法的改进%An improvenent on algorithms for removing the hidden lines of two-dimension figures

    Institute of Scientific and Technical Information of China (English)

    李旭健; 孙绪保

    1999-01-01

    提出了一种快速有效的二维图形消隐算法.首先给出了视图的定义;然后利用视图的闭包矩形进行遮挡分析以缩小搜索消隐图素的范围,从而减少了求交计算的次数;最后,对待消隐图素进行消隐分析,同时也采用了闭包矩形的重叠性检验,进一步提高效率.最后给出了应用实例.

  4. Algorithms for On-line Order Batching in an Order-Picking Warehouse

    OpenAIRE

    Sebastian Henn

    2009-01-01

    In manual order picking systems, order pickers walk or ride through a distribution warehouse in order to collect items required by (internal or external) customers. Order batching consists of combining these – indivisible – customer orders into picking orders. With respect to order batching, two problem types can be distinguished: In off-line (static) batching all customer orders are known in advance. In on-line (dynamic) batching customer orders become available dynamically over time. This r...

  5. Solar Hidden Photon Search

    CERN Document Server

    Schwarz, Matthias; Redondo, Javier; Ringwald, Andreas; Wiedemann, Guenter

    2011-01-01

    The Solar Hidden Photon Search (SHIPS) is a joint astroparticle project of the Hamburger Sternwarte and DESY. The main target is to detect the solar emission of a new species of particles, so called Hidden Photons (HPs). Due to kinetic mixing, photons and HPs can convert into each other as they propagate. A small number of solar HPs - originating from photon to HP oscillations in the interior of the Sun - can be converted into photons in a long vacuum pipe pointing to the Sun - the SHIPS helioscope.

  6. Solar Hidden Photon Search

    Energy Technology Data Exchange (ETDEWEB)

    Schwarz, Matthias; Wiedemann, Guenter [Hamburg Univ. (Germany). Sternwarte; Lindner, Axel; Ringwald, Andreas [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Redondo, Javier [Max-Planck-Institut fuer Physik und Astrophysik, Muenchen (Germany)

    2011-11-15

    The Solar Hidden Photon Search (SHIPS) is a joint astroparticle project of the Hamburger Sternwarte and DESY. The main target is to detect the solar emission of a new species of particles, so called Hidden Photons (HPs). Due to kinetic mixing, photons and HPs can convert into each other as they propagate. A small number of solar HPs - originating from photon to HP oscillations in the interior of the Sun - can be converted into photons in a long vacuum pipe pointing to the Sun - the SHIPS helioscope. (orig.)

  7. Revealing hidden text in rolled and folded papyri

    Science.gov (United States)

    Baum, Daniel; Lindow, Norbert; Hege, Hans-Christian; Lepper, Verena; Siopi, Tzulia; Kutz, Frank; Mahlow, Kristin; Mahnke, Heinz-Eberhard

    2017-03-01

    Ancient Egyptian papyri are often folded, rolled up or kept as small packages, sometimes even sealed. Physically unrolling or unfolding these packages might severely damage them. We demonstrate a way to get access to the hidden script without physical unfolding by employing computed tomography and mathematical algorithms for virtual unrolling and unfolding. Our algorithmic approaches are combined with manual interaction. This provides the necessary flexibility to enable the unfolding of even complicated and partly damaged papyrus packages. In addition, it allows us to cope with challenges posed by the structure of ancient papyrus, which is rather irregular, compared to other writing substrates like metallic foils or parchment. Unfolding of packages is done in two stages. In the first stage, we virtually invert the physical folding process step by step until the partially unfolded package is topologically equivalent to a scroll or a papyrus sheet folded only along one fold line. To minimize distortions at this stage, we apply the method of moving least squares. In the second stage, the papyrus is flattened, which requires the definition of a medial surface. We have applied our software framework to several papyri. In this work, we present the results of applying our approaches to mockup papyri that were either rolled or folded along perpendicular fold lines. In the case of the folded papyrus, our approach represents the first attempt to address the unfolding of such complicated folds.

  8. Correlation Analysis Algorithm for Transmission Line Fault Location Based on Travelling Wave%行波相关法的输电线路故障定位

    Institute of Scientific and Technical Information of China (English)

    杜林; 庞军; 司马文霞

    2008-01-01

    This paper introduced correlation method to locate transmission line fault. First it described the principle of transmission line fault location based on traveling waves. The principle of correlation analysis is introduced, then the method using correlation analysis in fault location is given. Transmission line model is established with EMTP-ATP. Basing on the model, some kinds of fault are simulated. The feasibility of this algorithm is proved based on simulation results. By comparing with the classical wavelet analysis, this paper gave the advantages of this algorithm in two cases:noise influence suppression and accuracy of near distance fault location. Experiment is established to simulate transmission line grounding fault. The experiment result showed the correlation algorithm's validity . All the analysis result indicated that the correlation algorithm have a high precision.

  9. Exact and efficient cone-beam reconstruction algorithm for a short-scan circle combined with various lines

    Science.gov (United States)

    Dennerlein, Frank; Katsevich, Alexander; Lauritsch, Guenter; Hornegger, Joachim

    2005-04-01

    X-ray 3D rotational angiography based on C-arm systems has become a versatile and established tomographic imaging modality for high contrast objects in interventional environment. Improvements in data acquisition, e.g. by use of flat panel detectors, will enable C-arm systems to resolve even low-contrast details. However, further progress will be limited by the incompleteness of data acquisition on the conventional short-scan circular source trajectories. Cone artifacts, which result from that incompleteness, significantly degrade image quality by severe smearing and shading. To assure data completeness a combination of a partial circle with one or several line segments is investigated. A new and efficient reconstruction algorithm is deduced from a general inversion formula based on 3D Radon theory. The method is theoretically exact, possesses shift-invariant filtered backprojection (FBP) structure, and solves the long object problem. The algorithm is flexible in dealing with various circle and line configurations. The reconstruction method requires nothing more than the theoretically minimum length of scan trajectory. It consists of a conventional short-scan circle and a line segment approximately twice as long as the height of the region-of-interest. Geometrical deviations from the ideal source trajectory are considered in the implementation in order to handle data of real C-arm systems. Reconstruction results show excellent image quality free of cone artifacts. The proposed scan trajectory and reconstruction algorithm assure excellent image quality and allow low-contrast tomographic imaging with C-arm based cone-beam systems. The method can be implemented without any hardware modifications on systems commercially available today.

  10. 基于线段特征匹配的EKF-SLAM算法%EKF-SLAM Algorithm Based on Line Segment Matching

    Institute of Scientific and Technical Information of China (English)

    张国良; 汤文俊; 敬斌; 程展欣

    2012-01-01

    针对EKF-SLAM算法在机器人被“绑架”时失效的问题,提出一种新的基于线段特征匹配的EKF-SLAM算法——EKFLineSLAM算法.该算法在线段特征观测模型和改进的基于逐点搜索的线段提取算法的基础上,将线段特征匹配引入EKF-SLAM算法,并对线段长度和姿态角进行EKF更新,创建环境的线段特征地图.在未知室内结构化环境中,将该算法与弱匹配EKFLineSLAM算法进行比较,验证了EKFLineSLAM算法在结构化环境中克服机器人“绑架”问题的可行性和有效性.%For the problem of EKF-SLAM algorithm being invalid when robot is kidnapped, a new EKF-SLAM algorithm called "EKF-LineSLAM Algorithm" based on line segment matching is presented. This algorithm is based on the line segment observation model, and the improved line segment extraction algorithm based on point by point search. It introduces the line segment match in the EKF-SLAM algorithm, and renews the line segment's length and posture angle by EKF to find the line segment characteristic map. Finally, the presented algorithm and the weak matching EKFLineSLAM algorithm are compared in an unknown structured indoor environment. The comparison results confirm the feasibility and the effectiveness of the EKFLineSLAM algorithm for the kidnapped robot problem in structured environments.

  11. High resolution study of the ν2 and ν5 rovibrational fundamental bands of thionyl chloride: Interplay of an evolutionary algorithm and a line-by-line analysis

    Science.gov (United States)

    Roucou, Anthony; Dhont, Guillaume; Cuisset, Arnaud; Martin-Drumel, Marie-Aline; Thorwirth, Sven; Fontanari, Daniele; Meerts, W. Leo

    2017-08-01

    The ν2 and ν5 fundamental bands of thionyl chloride (SOCl2) were measured in the 420 cm-1-550 cm-1 region using the FT-far-IR spectrometer exploiting synchrotron radiation on the AILES beamline at SOLEIL. A straightforward line-by-line analysis is complicated by the high congestion of the spectrum due to both the high density of SOCl2 rovibrational bands and the presence of the ν2 fundamental band of sulfur dioxide produced by hydrolysis of SOCl2 with residual water. To overcome this difficulty, our assignment procedure for the main isotopologues 32S16O35Cl2 and 32S16O35Cl37Cl alternates between a direct fit of the spectrum, via a global optimization technique, and a traditional line-by-line analysis. The global optimization, based on an evolutionary algorithm, produces rotational constants and band centers that serve as useful starting values for the subsequent spectroscopic analysis. This work helped to identify the pure rotational submillimeter spectrum of 32S16O35Cl2 in the v2=1 and v5=1 vibrational states of Martin-Drumel et al. [J. Chem. Phys. 144, 084305 (2016)]. As a by-product, the rotational transitions of the v4=1 far-IR inactive state were identified in the submillimeter spectrum. A global fit gathering all the microwave, submillimeter, and far-IR data of thionyl chloride has been performed, showing that no major perturbation of rovibrational energy levels occurs for the main isotopologue of the molecule.

  12. Algorithm for spectral response analysis of superconducting microwave transmission-line resonator

    CERN Document Server

    Hanif, Muhammad

    2013-01-01

    It has always been a challenge for researchers to efficiently and accurately post process experimental data which is distorted by the noise. Superconducting microwave devices e.g. resonators, directional filters, beam-splitters etc. operate at frequency of several GHz to THz and temperatures well below critical temperature (Tc) with few exceptions like transition edge sensors where devices are operated at temperatures close to Tc. These devices are measured usually with vector network analyser in terms of scattering parameters. Two kinds of errors, systematic and drift can easily be removed from the measurements taken with VNA. However, random errors are not easy to address and remove due to their unpredictability and randomness. In this manuscript we will present an algorithm to post process experimental data to cope with measurements that have been corrupted or useful spectral response is buried in spurious signal. We have developed a robust and efficient algorithm, implemented in MATLAB, to detect peaks in...

  13. Modelling and control algorithms of the cross conveyors line with multiengine variable speed drives

    Science.gov (United States)

    Cheremushkina, M. S.; Baburin, S. V.

    2017-02-01

    The paper deals with the actual problem of developing the control algorithm that meets the technical requirements of the mine belt conveyors, and enables energy and resource savings taking into account a random sort of traffic. The most effective method of solution of these tasks is the construction of control systems with the use of variable speed drives for asynchronous motors. The authors designed the mathematical model of the system ‘variable speed multiengine drive – conveyor – control system of conveyors’ that takes into account the dynamic processes occurring in the elements of the transport system, provides an assessment of the energy efficiency of application the developed algorithms, which allows one to reduce the dynamic overload in the belt to 15-20%.

  14. Evolving the structure of hidden Markov Models

    DEFF Research Database (Denmark)

    won, K. J.; Prugel-Bennett, A.; Krogh, A.

    2006-01-01

    A genetic algorithm (GA) is proposed for finding the structure of hidden Markov Models (HMMs) used for biological sequence analysis. The GA is designed to preserve biologically meaningful building blocks. The search through the space of HMM structures is combined with optimization of the emission...... and transition probabilities using the classic Baum-Welch algorithm. The system is tested on the problem of finding the promoter and coding region of C. jejuni. The resulting HMM has a superior discrimination ability to a handcrafted model that has been published in the literature....

  15. OFDM System Channel Estimation with Hidden Pilot

    Institute of Scientific and Technical Information of China (English)

    YANG Feng; LIN Cheng-yu; ZHANG Wen-jun

    2007-01-01

    Channel estimation using pilot is common used in OFDM system. The pilot is usually time division multiplexed with the informative sequence. One of the main drawbacks is bandwidth losing. In this paper, a new method was proposed to perform channel estimation in OFDM system. The pilot is arithmetically added to the output of OFDM modulator. Receiver uses the hidden pilot to get an accurate estimation of the channel. Then pilot is removed after channel estimation. The Cramer-Rao lower bound for this method was deprived. The performance of the algorithm is then shown. Compared with traditional methods, the proposed algorithm increases the bandwidth efficiency dramatically.

  16. I/O-Efficient Algorithms for Computing Contour Lines on a Terrain

    DEFF Research Database (Denmark)

    Agarwal, Pankaj Kumar; Arge, Lars; Sadri, Bardia;

    2008-01-01

    /B) I/Os, where T is the total number edges in the output contours, B is the "block size," and sort(N) is the number of I/Os needed to sort N elements. The algorithm uses O(N/B) disk blocks. Each contour is generated individually with its composing segments sorted in clockwise or counterclockwise order...... individually with its composing segments sorted in clockwise or counterclockwise order....

  17. Accurate fault location algorithm on power transmission lines with use of two-end unsynchronized measurements

    Directory of Open Access Journals (Sweden)

    Mohamed Dine

    2012-01-01

    Full Text Available This paper presents a new approach to fault location on power transmission lines. This approach uses two-end unsynchronised measurements of the line and benefits from the advantages of digital technology and numerical relaying, which are available today and can easily be applied for off-line analysis. The approach is to modify the apparent impedance method using a very simple first-order formula. The new method is independent of fault resistance, source impedances and pre-fault currents. In addition, the data volume communicated between relays is sufficiently small enough to be transmitted easily using a digital protection channel. The proposed approach is tested via digital simulation using MATLand the applied test results corroborate the superior performance of the proposed approach.

  18. Accurate Fault Location Algorithm on Power Transmission Lines With Use of Two-end Unsynchronized Measurements

    Directory of Open Access Journals (Sweden)

    DINE Mohamed

    2012-10-01

    Full Text Available This paper presents a new approach of fault location on power transmission line. This approach uses two-end unsynchronizedmeasurements of the line and uses the advantages of digital technology and numerical relaying which are available today and can easily be applied for off-line analysis. The approach is based on modifying the apparent impedance method using a very simplefirst-order formula. It is shown that the new method is independent of fault resistance, source impedances and pre-fault currents. In addition, the data volume communicated between relays issufficiently small to be easily transmitted using a digital protection channel. The proposed approach was tested via digital simulation using MATLAB. Applied test results corroborate the superiorperformance of the proposed approach.

  19. Hidden scale in quantum mechanics

    CERN Document Server

    Giri, Pulak Ranjan

    2007-01-01

    We show that the intriguing localization of a free particle wave-packet is possible due to a hidden scale present in the system. Self-adjoint extensions (SAE) is responsible for introducing this scale in quantum mechanical models through the nontrivial boundary conditions. We discuss a couple of classically scale invariant free particle systems to illustrate the issue. In this context it has been shown that a free quantum particle moving on a full line may have localized wave-packet around the origin. As a generalization, it has also been shown that particles moving on a portion of a plane or on a portion of a three dimensional space can have unusual localized wave-packet.

  20. Exploratory Analysis of an On-line Evolutionary Algorithm for in Simulated Robots

    NARCIS (Netherlands)

    Haasdijk, E.; Smit, S.K.; Eiben, A.E.

    2012-01-01

    In traditional evolutionary robotics, robot controllers are evolved in a separate design phase preceding actual deployment; we call this off-line evolution. Alternatively, robot controllers can evolve while the robots perform their proper tasks, during the actual operational phase; we call this on-l

  1. Research on the Algorithm of Extracting Ridge and Valley Lines from Contour Data

    Institute of Scientific and Technical Information of China (English)

    JIN Hailiang; GAO Jingxiang

    2005-01-01

    In this paper, the authors put forward a brief and practical arithmetic for auto extracting terrain lines from digital terrain data after analyzing and comparing current arithmetics. This paper gives an experiment result that the ridge and valley extracted by the arithmetic is consistent with the experimental terrain.

  2. Software for evaluating magnetic induction field generated by power lines: implementation of a new algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Comelli, M.; Benes, M.; Bampo, A.; Villalta, R. [Regional Environment Protection Agency of Friuli Venezia Giulia (ARPA FVG), Environmental Physics, Udine (Italy)

    2006-07-01

    The Regional Environment Protection Agency of Friuli Venezia Giulia (A.R.P.A. F.V.G., Italy) has performed an analysis on existing software designed to calculate magnetic induction field generated by power lines. As far as the agency requirements are concerned the tested programs display some difficulties in the immediate processing of electrical and geometrical data supplied by plant owners, and in certain cases turn out to be inadequate in representing complex configurations of power lines. Furthermore, none of them is preset for cyclic calculus to determine the time evolution of induction in a certain exposure area. Finally, the output data are not immediately importable by ArcView, the G.I.S. used by A.R.P.A. F.V.G., and it is not always possible to implement the territory orography to determine the field at specified heights above the ground. P.h.i.d.e.l., an innovative software, tackles and works out al l the above mentioned problems. The power line wires interested in its implementation are represented by poly lines, and the field is analytically calculated, with no further approximation, not even when more power lines are concerned. Therefore, the obtained results, when compared with those of other programs, are the closest to experimental measurements. The output data can be employed both in G.I.S. and Excel environments, allowing the immediate overlaying of digital cartography and the determining of the 3 and 10 {mu}T bands, in compliance with the Italian Decree of the President of the Council of Ministers of 8 July 2003. (authors)

  3. On-line experimental validation of a model-based diagnostic algorithm dedicated to a solid oxide fuel cell system

    Science.gov (United States)

    Polverino, Pierpaolo; Esposito, Angelo; Pianese, Cesare; Ludwig, Bastian; Iwanschitz, Boris; Mai, Andreas

    2016-02-01

    In the current energetic scenario, Solid Oxide Fuel Cells (SOFCs) exhibit appealing features which make them suitable for environmental-friendly power production, especially for stationary applications. An example is represented by micro-combined heat and power (μ-CHP) generation units based on SOFC stacks, which are able to produce electric and thermal power with high efficiency and low pollutant and greenhouse gases emissions. However, the main limitations to their diffusion into the mass market consist in high maintenance and production costs and short lifetime. To improve these aspects, the current research activity focuses on the development of robust and generalizable diagnostic techniques, aimed at detecting and isolating faults within the entire system (i.e. SOFC stack and balance of plant). Coupled with appropriate recovery strategies, diagnosis can prevent undesired system shutdowns during faulty conditions, with consequent lifetime increase and maintenance costs reduction. This paper deals with the on-line experimental validation of a model-based diagnostic algorithm applied to a pre-commercial SOFC system. The proposed algorithm exploits a Fault Signature Matrix based on a Fault Tree Analysis and improved through fault simulations. The algorithm is characterized on the considered system and it is validated by means of experimental induction of faulty states in controlled conditions.

  4. Implementation of intensity ratio change and line-of-sight rate change algorithms for imaging infrared trackers

    Science.gov (United States)

    Viau, C. R.

    2012-06-01

    The use of the intensity change and line-of-sight (LOS) change concepts have previously been documented in the open-literature as techniques used by non-imaging infrared (IR) seekers to reject expendable IR countermeasures (IRCM). The purpose of this project was to implement IR counter-countermeasure (IRCCM) algorithms based on target intensity and kinematic behavior for a generic imaging IR (IIR) seeker model with the underlying goal of obtaining a better understanding of how expendable IRCM can be used to defeat the latest generation of seekers. The report describes the Intensity Ratio Change (IRC) and LOS Rate Change (LRC) discrimination techniques. The algorithms and the seeker model are implemented in a physics-based simulation product called Tactical Engagement Simulation Software (TESS™). TESS is developed in the MATLAB®/Simulink® environment and is a suite of RF/IR missile software simulators used to evaluate and analyze the effectiveness of countermeasures against various classes of guided threats. The investigation evaluates the algorithm and tests their robustness by presenting the results of batch simulation runs of surface-to-air (SAM) and air-to-air (AAM) IIR missiles engaging a non-maneuvering target platform equipped with expendable IRCM as self-protection. The report discusses how varying critical parameters such track memory time, ratio thresholds and hold time can influence the outcome of an engagement.

  5. Utilization of genetic algorithm in on-line tuning of fluid power servos

    Energy Technology Data Exchange (ETDEWEB)

    Halme, J.

    1997-12-31

    This study describes a robust and plausible method based on genetic algorithms suitable for tuning a regulator. The main advantages of the method presented is its robustness and easy-to-use feature. In this thesis the method is demonstrated by searching for appropriate control parameters of a state-feedback controller in a fluid power environment. To corroborate the robustness of the tuning method, two earlier studies are also presented in the appendix, where the presented tuning method is used in different kinds of regulator tuning situations. (orig.) 33 refs.

  6. An on-line calibration algorithm for external parameters of visual system based on binocular stereo cameras

    Science.gov (United States)

    Wang, Liqiang; Liu, Zhen; Zhang, Zhonghua

    2014-11-01

    Stereo vision is the key in the visual measurement, robot vision, and autonomous navigation. Before performing the system of stereo vision, it needs to calibrate the intrinsic parameters for each camera and the external parameters of the system. In engineering, the intrinsic parameters remain unchanged after calibrating cameras, and the positional relationship between the cameras could be changed because of vibration, knocks and pressures in the vicinity of the railway or motor workshops. Especially for large baselines, even minute changes in translation or rotation can affect the epipolar geometry and scene triangulation to such a degree that visual system becomes disabled. A technology including both real-time examination and on-line recalibration for the external parameters of stereo system becomes particularly important. This paper presents an on-line method for checking and recalibrating the positional relationship between stereo cameras. In epipolar geometry, the external parameters of cameras can be obtained by factorization of the fundamental matrix. Thus, it offers a method to calculate the external camera parameters without any special targets. If the intrinsic camera parameters are known, the external parameters of system can be calculated via a number of random matched points. The process is: (i) estimating the fundamental matrix via the feature point correspondences; (ii) computing the essential matrix from the fundamental matrix; (iii) obtaining the external parameters by decomposition of the essential matrix. In the step of computing the fundamental matrix, the traditional methods are sensitive to noise and cannot ensure the estimation accuracy. We consider the feature distribution situation in the actual scene images and introduce a regional weighted normalization algorithm to improve accuracy of the fundamental matrix estimation. In contrast to traditional algorithms, experiments on simulated data prove that the method improves estimation

  7. Aligning the Hidden Curriculum of Management Education With PRME

    DEFF Research Database (Denmark)

    Blasco, Maribel

    2012-01-01

    This article argues that mainstreaming responsible management education in line with the Principles of Responsible Management Education (PRME) requires close attention to the hidden curriculum (HC), that is, the implicit dimensions of educational experiences. Altering formal curricular goals...... combined with transformative learning and communities of practice theory, the article offers an inquiry-based framework for PRME implementation that takes these moral learning and socialization processes into account. It provides suggestions for how to address the hidden curriculum both in the diagnostic...

  8. Image Interpolation via Scanning Line Algorithm and Discontinuous B-Spline

    OpenAIRE

    Cheng-ming Liu; Ze-kun Wang; Hai-bo Pang; Jun-xiao Xue

    2017-01-01

    Image interpolation is a basic operation in image processing. Lots of methods have been proposed, including convolution-based methods, edge modeling methods, point spread function (PSF)-based methods or learning-based methods. Most of them, however, present a high computational complexity and are not suitable for real time applications. However, fast methods are not able to provide artifacts-free images. In this paper we describe a new image interpolation method by using scanning line algorit...

  9. A New Track Reconstruction Algorithm suitable for Parallel Processing based on Hit Triplets and Broken Lines

    CERN Document Server

    Schöning, Andre

    2016-01-01

    Track reconstruction in high track multiplicity environments at current and future high rate particle physics experiments is a big challenge and very time consuming. The search for track seeds and the fitting of track candidates are usually the most time consuming steps in the track reconstruction. Here, a new and fast track reconstruction method based on hit triplets is proposed which exploits a three-dimensional fit model including multiple scattering and hit uncertainties from the very start, including the search for track seeds. The hit triplet based reconstruction method assumes a homogeneous magnetic field which allows to give an analytical solutions for the triplet fit result. This method is highly parallelizable, needs fewer operations than other standard track reconstruction methods and is therefore ideal for the implementation on parallel computing architectures. The proposed track reconstruction algorithm has been studied in the context of the Mu3e-experiment and a typical LHC experiment.

  10. A New Track Reconstruction Algorithm suitable for Parallel Processing based on Hit Triplets and Broken Lines

    Science.gov (United States)

    Schöning, André

    2016-11-01

    Track reconstruction in high track multiplicity environments at current and future high rate particle physics experiments is a big challenge and very time consuming. The search for track seeds and the fitting of track candidates are usually the most time consuming steps in the track reconstruction. Here, a new and fast track reconstruction method based on hit triplets is proposed which exploits a three-dimensional fit model including multiple scattering and hit uncertainties from the very start, including the search for track seeds. The hit triplet based reconstruction method assumes a homogeneous magnetic field which allows to give an analytical solutions for the triplet fit result. This method is highly parallelizable, needs fewer operations than other standard track reconstruction methods and is therefore ideal for the implementation on parallel computing architectures. The proposed track reconstruction algorithm has been studied in the context of the Mu3e-experiment and a typical LHC experiment.

  11. World-line quantum Monte Carlo algorithm for a one-dimensional Bose model

    Energy Technology Data Exchange (ETDEWEB)

    Batrouni, G.G. (Thinking Machines Corporation, 245 First Street, Cambridge, Massachusetts 02142 (United States)); Scalettar, R.T. (Physics Department, University of California, Davis, California 95616 (United States))

    1992-10-01

    In this paper we provide a detailed description of the ground-state phase diagram of interacting, disordered bosons on a lattice. We describe a quantum Monte Carlo algorithm that incorporates in an efficient manner the required bosonic wave-function symmetry. We consider the ordered case, where we evaluate the compressibility gap and show the lowest three Mott insulating lobes. We obtain the critical ratio of interaction strength to hopping at which the onset of superfluidity occurs for the first lobe, and the critical exponents {nu} and {ital z}. For the disordered model we show the effect of randomness on the phase diagram and the superfluid correlations. We also measure the response of the superfluid density, {rho}{sub {ital s}}, to external perturbations. This provides an unambiguous characterization of the recently observed Bose and Anderson glass phases.

  12. Hidden neural networks

    DEFF Research Database (Denmark)

    Krogh, Anders Stærmose; Riis, Søren Kamaric

    1999-01-01

    A general framework for hybrids of hidden Markov models (HMMs) and neural networks (NNs) called hidden neural networks (HNNs) is described. The article begins by reviewing standard HMMs and estimation by conditional maximum likelihood, which is used by the HNN. In the HNN, the usual HMM probability...... parameters are replaced by the outputs of state-specific neural networks. As opposed to many other hybrids, the HNN is normalized globally and therefore has a valid probabilistic interpretation. All parameters in the HNN are estimated simultaneously according to the discriminative conditional maximum...... likelihood criterion. The HNN can be viewed as an undirected probabilistic independence network (a graphical model), where the neural networks provide a compact representation of the clique functions. An evaluation of the HNN on the task of recognizing broad phoneme classes in the TIMIT database shows clear...

  13. Coupling of Hidden Sector

    CERN Document Server

    Królikowski, Wojciech

    2016-01-01

    A hypothetic Hidden Sector of the Universe, consisting of sterile fermions ("sterinos") and sterile mediating bosons ("sterons") of mass dimension 1 (not 2!) - the last described by an antisymmetric tensor field - requires to exist also a scalar isovector and scalar isoscalar in order to be able to construct electroweak invariant coupling (before spontaneously breaking its symmetry). The introduced scalar isoscalar might be a resonant source for the diphoton excess of 750 GeV, suggested recently by experiment.

  14. METHODOLOGY AND ALGORITHM OF OPTIMIZATION OF THE NEED OF SETTLEMENTS FOR TECHNICAL INSPECTION LINES FOR VEHICLES

    Directory of Open Access Journals (Sweden)

    Maslennikov Valeriy Aleksandrovich

    2016-06-01

    Full Text Available The current methods of predicting the demand of the community for the lines of technical inspection of vehicles do not fully take into account the probabilistic and statistical nature of the complaints of car owners. This results in significant mistakes in the determination of the number of such lines, accompanied by insufficient rhythm of their operation. The design errors related to the complexity of accurate account for calendar fluctuations of the number of appeals can be partially or completely eliminated by using mathematical apparatus of the queuing theory. In this case, the complex technical system is considered as an open multi-channel queuing system with limited queue length. The received flows and serviced requests are considered to be the simplest. From a practical point of view, the replacement of one type of computational model by the other allows ensuring a more sustainable mode of calculating operations using the computer. The paper also provides a calculation expression for defining the lower and upper confidence limits of the dispersion of the average values of the number of arrivals of vehicles at the technical inspection that allows setting the interval of uncertainty for searching the optimal solution.

  15. Hidden variables and hidden time in quantum theory

    OpenAIRE

    Kurakin, Pavel V.

    2005-01-01

    Bell's theorem proves only that hidden variables evolving in true physical time can't exist; still the theorem's meaning is usually interpreted intolerably wide. The concept of hidden time (and, in general, hidden space-time) is introduced. Such concept provides a whole new class of physical theories, fully compatible with current knowledge, but giving new tremendous possibilities. Those theories do not violate Bell's theorem.

  16. Fuzzy theory-based fault location algorithm for electric power transmission lines with OPGW

    Energy Technology Data Exchange (ETDEWEB)

    Egawa, Masanao; Sugiyama, Koichi; Kanemaru, Kimiharu; Kano, Hitoshi

    1988-11-20

    OPGW (optical fiber composite overhead grounding wire) is used for advanced information system in major power transmission lines. Attention has been gathered on its application to the maintenance and monitoring, especially the FL unit to locate section where a fault has occurred. A fault location system has been developed, employing the overhead grounding wire (GW) current as the fault information. GW currents have distinctive features in its distribution in the fault section, making its location simple. The new location technique applies the fuzzy theory to incorporate this human thinking into a computer. This method defines the feature of GW current in the fault section with a fuzzy set and, assuming that a fault is more likely to have occurred in a section with more data belonging to this set, determines the section with the largest proportion of such data as the fault section. Two systems have been put in operation based on this method and successfully located faults by lightning strokes. 18 references, 14 figures, 2 tables.

  17. LINES

    Directory of Open Access Journals (Sweden)

    Minas Bakalchev

    2015-10-01

    Full Text Available The perception of elements in a system often creates their interdependence, interconditionality, and suppression. The lines from a basic geometrical element have become the model of a reductive world based on isolation according to certain criteria such as function, structure, and social organization. Their traces are experienced in the contemporary world as fragments or ruins of a system of domination of an assumed hierarchical unity. How can one release oneself from such dependence or determinism? How can the lines become less “systematic” and forms more autonomous, and less reductive? How is a form released from modernistic determinism on the new controversial ground? How can these elements or forms of representation become forms of action in the present complex world? In this paper, the meaning of lines through the ideas of Le Corbusier, Leonidov, Picasso, and Hitchcock is presented. Spatial research was made through a series of examples arising from the projects of the architectural studio “Residential Transformations”, which was a backbone for mapping the possibilities ranging from playfulness to exactness, as tactics of transformation in the different contexts of the contemporary world.

  18. Self-adaptive PID controller of microwave drying rotary device tuning on-line by genetic algorithms

    Institute of Scientific and Technical Information of China (English)

    杨彪; 梁贵安; 彭金辉; 郭胜惠; 李玮; 张世敏; 李英伟; 白松

    2013-01-01

    The control design, based on self-adaptive PID with genetic algorithms(GA) tuning on-line was investigated, for the temperature control of industrial microwave drying rotary device with the multi-layer(IMDRDWM) and with multivariable nonlinear interaction of microwave and materials. The conventional PID control strategy incorporated with optimization GA was put forward to maintain the optimum drying temperature in order to keep the moisture content below 1%, whose adaptation ability included the cost function of optimization GA according to the output change. Simulations on five different industrial process models and practical temperature process control system for selenium-enriched slag drying intensively by using IMDRDWM were carried out systematically, indicating the reliability and effectiveness of control design. The parameters of proposed control design are all on-line implemented without iterative predictive calculations, and the closed-loop system stability is guaranteed, which makes the developed scheme simpler in its synthesis and application, providing the practical guidelines for the control implementation and the parameter design.

  19. Line-of-Sight Observables Algorithms for the Helioseismic and Magnetic Imager (HMI) Instrument Tested with Interferometric Bidimensional Spectrometer (IBIS) Observations

    Science.gov (United States)

    Couvidat, Sébastien; Rajaguru, S. P.; Wachter, Richard; Sankarasubramanian, K.; Schou, Jesper; Scherrer, Philip H.

    2012-05-01

    The Helioseismic and Magnetic Imager (HMI) instrument onboard the Solar Dynamics Observatory produces line-of-sight (LOS) observables (Doppler velocity, magnetic-field strength, Fe i line width, line depth, and continuum intensity) as well as vector magnetic-field maps at the solar surface. The accuracy of LOS observables is dependent on the algorithm used to translate a sequence of HMI filtergrams into the corresponding observables. Using one hour of high-cadence imaging spectropolarimetric observations of a sunspot in the Fe i line at 6173 Å through the Interferometric Bidimensional Spectrometer installed at the Dunn Solar Telescope, and the Milne-Eddington inversion of the corresponding Stokes vectors, we test the accuracy of the observables algorithm currently implemented in the HMI data-analysis pipeline: the MDI-like algorithm. In an attempt to improve the accuracy of HMI observables, we also compare this algorithm to others that may be implemented in the future: a least-squares fit with a Gaussian profile, a least-squares fit with a Voigt profile, and the use of second Fourier coefficients in the MDI-like algorithm.

  20. Error statistics of hidden Markov model and hidden Boltzmann model results

    Directory of Open Access Journals (Sweden)

    Newberg Lee A

    2009-07-01

    Full Text Available Abstract Background Hidden Markov models and hidden Boltzmann models are employed in computational biology and a variety of other scientific fields for a variety of analyses of sequential data. Whether the associated algorithms are used to compute an actual probability or, more generally, an odds ratio or some other score, a frequent requirement is that the error statistics of a given score be known. What is the chance that random data would achieve that score or better? What is the chance that a real signal would achieve a given score threshold? Results Here we present a novel general approach to estimating these false positive and true positive rates that is significantly more efficient than are existing general approaches. We validate the technique via an implementation within the HMMER 3.0 package, which scans DNA or protein sequence databases for patterns of interest, using a profile-HMM. Conclusion The new approach is faster than general naïve sampling approaches, and more general than other current approaches. It provides an efficient mechanism by which to estimate error statistics for hidden Markov model and hidden Boltzmann model results.

  1. Error statistics of hidden Markov model and hidden Boltzmann model results

    Science.gov (United States)

    Newberg, Lee A

    2009-01-01

    Background Hidden Markov models and hidden Boltzmann models are employed in computational biology and a variety of other scientific fields for a variety of analyses of sequential data. Whether the associated algorithms are used to compute an actual probability or, more generally, an odds ratio or some other score, a frequent requirement is that the error statistics of a given score be known. What is the chance that random data would achieve that score or better? What is the chance that a real signal would achieve a given score threshold? Results Here we present a novel general approach to estimating these false positive and true positive rates that is significantly more efficient than are existing general approaches. We validate the technique via an implementation within the HMMER 3.0 package, which scans DNA or protein sequence databases for patterns of interest, using a profile-HMM. Conclusion The new approach is faster than general naïve sampling approaches, and more general than other current approaches. It provides an efficient mechanism by which to estimate error statistics for hidden Markov model and hidden Boltzmann model results. PMID:19589158

  2. A high-linearity and high-resolution delay line structure with a calibration algorithm in delay-based LINC transmitters

    Science.gov (United States)

    Yue, Han; Shushan, Qiao; Yong, Hei

    2016-01-01

    In order to overcome the bottleneck of low linearity and low resolution, an improved delay line structure is proposed with a calibration algorithm to conquer PVT (process, voltage and temperature) variations for an all-digital design. The chip is implemented in 0.13 μm CMOS technology. Measurement results show that the proposed structure with the calibration algorithm can evidently improve the linearity and resolution of the delay line. The delay resolution is 2 ps and the root mean square jitter of the delay is 4.71 ps, leading to an error vector magnitude enhancement of 1.32 dB.

  3. Discriminative training of self-structuring hidden control neural models

    DEFF Research Database (Denmark)

    Sørensen, Helge Bjarup Dissing; Hartmann, Uwe; Hunnerup, Preben

    1995-01-01

    This paper presents a new training algorithm for self-structuring hidden control neural (SHC) models. The SHC models were trained non-discriminatively for speech recognition applications. Better recognition performance can generally be achieved, if discriminative training is applied instead. Thus...

  4. A Constraint Model for Constrained Hidden Markov Models

    DEFF Research Database (Denmark)

    Christiansen, Henning; Have, Christian Theil; Lassen, Ole Torp

    2009-01-01

    A Hidden Markov Model (HMM) is a common statistical model which is widely used for analysis of biological sequence data and other sequential phenomena. In the present paper we extend HMMs with constraints and show how the familiar Viterbi algorithm can be generalized, based on constraint solving...

  5. Pruning Boltzmann networks and hidden Markov models

    DEFF Research Database (Denmark)

    Pedersen, Morten With; Stork, D.

    1996-01-01

    We present sensitivity-based pruning algorithms for general Boltzmann networks. Central to our methods is the efficient calculation of a second-order approximation to the true weight saliencies in a cross-entropy error. Building upon previous work which shows a formal correspondence between linear...... Boltzmann chains and hidden Markov models (HMMs), we argue that our method can be applied to HMMs as well. We illustrate pruning on Boltzmann zippers, which are equivalent to two HMMs with cross-connection links. We verify that our second-order approximation preserves the rank ordering of weight saliencies...

  6. Detecting Structural Breaks using Hidden Markov Models

    DEFF Research Database (Denmark)

    Ntantamis, Christos

    Testing for structural breaks and identifying their location is essential for econometric modeling. In this paper, a Hidden Markov Model (HMM) approach is used in order to perform these tasks. Breaks are defined as the data points where the underlying Markov Chain switches from one state to another....... The locations of the breaks are subsequently obtained by assigning states to data points according to the Maximum Posterior Mode (MPM) algorithm. The Integrated Classification Likelihood-Bayesian Information Criterion (ICL-BIC) allows for the determination of the number of regimes by taking into account...... in the monetary policy of United States, the dierent functional form being variants of the Taylor (1993) rule....

  7. Learning Hidden Markov Models using Non-Negative Matrix Factorization

    CERN Document Server

    Cybenko, George

    2008-01-01

    The Baum-Welsh algorithm together with its derivatives and variations has been the main technique for learning Hidden Markov Models (HMM) from observational data. We present an HMM learning algorithm based on the non-negative matrix factorization (NMF) of higher order Markovian statistics that is structurally different from the Baum-Welsh and its associated approaches. The described algorithm supports estimation of the number of recurrent states of an HMM and iterates the non-negative matrix factorization (NMF) algorithm to improve the learned HMM parameters. Numerical examples are provided as well.

  8. Hidden Markov Model Application to Transfer The Trader Online Forex Brokers

    Directory of Open Access Journals (Sweden)

    Farida Suharleni

    2012-05-01

    Full Text Available Hidden Markov Model is elaboration of Markov chain, which is applicable to cases that can’t directly observe. In this research, Hidden Markov Model is used to know trader’s transition to broker forex online. In Hidden Markov Model, observed state is observable part and hidden state is hidden part. Hidden Markov Model allows modeling system that contains interrelated observed state and hidden state. As observed state in trader’s transition to broker forex online is category 1, category 2, category 3, category 4, category 5 by condition of every broker forex online, whereas as hidden state is broker forex online Marketiva, Masterforex, Instaforex, FBS and Others. First step on application of Hidden Markov Model in this research is making construction model by making a probability of transition matrix (A from every broker forex online. Next step is making a probability of observation matrix (B by making conditional probability of five categories, that is category 1, category 2, category 3, category 4, category 5 by condition of every broker forex online and also need to determine an initial state probability (π from every broker forex online. The last step is using Viterbi algorithm to find hidden state sequences that is broker forex online sequences which is the most possible based on model and observed state that is the five categories. Application of Hidden Markov Model is done by making program with Viterbi algorithm using Delphi 7.0 software with observed state based on simulation data. Example: By the number of observation T = 5 and observed state sequences O = (2,4,3,5,1 is found hidden state sequences which the most possible with observed state O as following : where X1 = FBS, X2 = Masterforex, X3 = Marketiva, X4 = Others, and X5 = Instaforex.

  9. 对ANN技术表达船体曲线算法的改进%Improvement on Algorithm of Ship Lines with ANN Technology

    Institute of Scientific and Technical Information of China (English)

    谭家华; 包丛喜

    2001-01-01

    应用人工神经元网络(ANN)技术表达船体曲线。根据问题性质,选用小波基作为前向单层神经网络的神经元激励函数,结合逐层学习(OHLO)算法对一艘3.6万吨散货船的后半体进行了表达。编程运算结果表明,该方法速度较传统的BP算法有较大提高。%By Applying technology of artificial neural networks(ANN)to express hull lines,a wavelet function is chosen as the activation function of the neurons of the progressive single-layer network in combination with the algorithm of optimizing hidden layer output(OHLO).The method is used to express the aft part of the hull of a 36 000 t bulk carrier.The results show that the calculation speed of this improved algorithm is much quicker than that of the conventional BP Algorithm.

  10. Research on the Improvement on Spectral Line in MUSIC Algorithm%MUSIC算法中谱线改进处理的研究

    Institute of Scientific and Technical Information of China (English)

    白春惠

    2016-01-01

    MUSIC算法,即多信号分类算法,常用于同频信号测向系统,主要利用信号分量相对应的信号子空间和信号分量正交的噪声子空间的正交性来对信源进行估计计算。在实际测向过程中,信号子空间和噪声子空间并不能实现完全正交,并且测试环境引入噪声干扰,对测向结果都构成影响。基于以上问题,对MUSIC算法进行了改进,加入了两种谱线改进算法,分别是谱线增强算法和谱二阶算法;通过对信号进行谱线增强,提高信号的信噪比,并在信号测向过程中加入二阶导数识别算法、提高信号测向角度识别率等方法,能够有效提高信号的信噪比和抗干扰性,增强了测向算法的识别率和精准度。%MUSIC algorithm, or Multiple Signal Classification algorithm, which is often used in same frequency signal direction finding system,mainly uses the orthogonality between signal subspace corresponding to signal components and noise subspace orthogonal to signal components to perform estimation for signal source.In practical process,both the orthogonality between signal subspace and noise subspace not ideal, and noise from test environment influence the result of direction finding. Based on the above problems, a method of improvement on MUSIC algorithm is proposed, and includes two algorithms for spectral line improvement, spectral line enhancer algorithm and second derivative of spectral line algorithm.With the spectral line enhancer algorithm able to improve the SNR of signal,combining with second derivative of spectral line algorithm in the process of direction finding and other methods to improve angular resolution,the recognition rate and accuracy of direction finding algorithm can be enhanced.

  11. 直列式智力五环游戏算法研究%ON ALGORITHM OF IN-LINE INTELLIGNET FIVE-RING GAME

    Institute of Scientific and Technical Information of China (English)

    卜星; 武苏里; 白玉杰; 谢小军

    2011-01-01

    In this paper we study the data structures and algorithms composed in in-line intelligent five-ring game. 4 kinds of algorithms,one-by-one replacement, 4 pieces gapping, 11 pieces gapping and all pieces homing are presented in this paper, they effectually solve the homing problem in in-line intelligent five-ring game. The optimisation of these algorithms is also discussed.%对直列式智力五环中所包含的数据结构、算法问题进行了研究,提出了逐位替换、配4、配11和整体归位4种算法,有效地解决了直列式智力五环的归位问题,并讨论了算法的优化问题.

  12. Hidden figures are ever present.

    Science.gov (United States)

    Mens, L H; Leeuwenberg, E L

    1988-11-01

    Preference judgments about alternative interpretations of unambiguous patterns can be explained in terms of a rivalry between a preferred and a second-best interpretation (cf. Leeuwenberg & Buffart, 1983). We tested whether this second-best interpretation corresponds to a suppressed but concurrently present interpretation or whether it merely reflects an alternative view that happens to be preferred less often. Two patterns were present immediately following each other with a very short onset asynchrony: a complete pattern and one out of three possible subpatterns of it, corresponding to the best, the second best, or an odd interpretation of the complete pattern. Subjects indicated which subpattern was presented by choosing among the three subpatterns shown after each trial. The scores, corrected for response-bias effects, indicated a relative facilitation of the second-best interpretation, in agreement with its predicted "hidden" presence. This result is more in line with theories that capitalize on the quality of the finally selected representation than with processing models aimed at reaching one single solution as fast and as economically as possible.

  13. Optimal Energy Management, Location and Size for Stationary Energy Storage System in a Metro Line Based on Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Huan Xia

    2015-10-01

    Full Text Available The installation of stationary super-capacitor energy storage system (ESS in metro systems can recycle the vehicle braking energy and improve the pantograph voltage profile. This paper aims to optimize the energy management, location, and size of stationary super-capacitor ESSes simultaneously and obtain the best economic efficiency and voltage profile of metro systems. Firstly, the simulation platform of an urban rail power supply system, which includes trains and super-capacitor energy storage systems, is established. Then, two evaluation functions from the perspectives of economic efficiency and voltage drop compensation are put forward. Ultimately, a novel optimization method that combines genetic algorithms and a simulation platform of urban rail power supply system is proposed, which can obtain the best energy management strategy, location, and size for ESSes simultaneously. With actual parameters of a Chinese metro line applied in the simulation comparison, certain optimal scheme of ESSes’ energy management strategy, location, and size obtained by a novel optimization method can achieve much better performance of metro systems from the perspectives of two evaluation functions. The simulation result shows that with the increase of weight coefficient, the optimal energy management strategy, locations and size of ESSes appear certain regularities, and the best compromise between economic efficiency and voltage drop compensation can be obtained by a novel optimization method, which can provide a valuable reference to subway company.

  14. Wavelet domain hidden markovian bayesian document segmentation

    Institute of Scientific and Technical Information of China (English)

    Sun Junxi; Xiao Changyan; Zhang Su; Chen Yazhu

    2005-01-01

    A novel algorithm for Bayesian document segmentation is proposed based on the wavelet domain hidden Markov tree (HMT) model. Once the parameters of model are known, according to the sequential maximum a posterior probability (SMAP) rule, firstly, the likelihood probability of HMT model for each pattern is computed from fine to coarse procedure. Then, the interscale state transition probability is solved using Expectation Maximum (EM) algorithm based on hybrid-quadtree and multiscale context information is fused from coarse to fine procedure. In order to get pixellevel segmentation, the redundant wavelet domain Gaussian mixture model (GMM) is employed to formulate pixel-level statistical property. The experiment results show that the proposed scheme is feasible and robust.

  15. Probabilistic Resilience in Hidden Markov Models

    Science.gov (United States)

    Panerati, Jacopo; Beltrame, Giovanni; Schwind, Nicolas; Zeltner, Stefan; Inoue, Katsumi

    2016-05-01

    Originally defined in the context of ecological systems and environmental sciences, resilience has grown to be a property of major interest for the design and analysis of many other complex systems: resilient networks and robotics systems other the desirable capability of absorbing disruption and transforming in response to external shocks, while still providing the services they were designed for. Starting from an existing formalization of resilience for constraint-based systems, we develop a probabilistic framework based on hidden Markov models. In doing so, we introduce two new important features: stochastic evolution and partial observability. Using our framework, we formalize a methodology for the evaluation of probabilities associated with generic properties, we describe an efficient algorithm for the computation of its essential inference step, and show that its complexity is comparable to other state-of-the-art inference algorithms.

  16. Hidden attractors in dynamical systems

    Science.gov (United States)

    Dudkowski, Dawid; Jafari, Sajad; Kapitaniak, Tomasz; Kuznetsov, Nikolay V.; Leonov, Gennady A.; Prasad, Awadhesh

    2016-06-01

    Complex dynamical systems, ranging from the climate, ecosystems to financial markets and engineering applications typically have many coexisting attractors. This property of the system is called multistability. The final state, i.e., the attractor on which the multistable system evolves strongly depends on the initial conditions. Additionally, such systems are very sensitive towards noise and system parameters so a sudden shift to a contrasting regime may occur. To understand the dynamics of these systems one has to identify all possible attractors and their basins of attraction. Recently, it has been shown that multistability is connected with the occurrence of unpredictable attractors which have been called hidden attractors. The basins of attraction of the hidden attractors do not touch unstable fixed points (if exists) and are located far away from such points. Numerical localization of the hidden attractors is not straightforward since there are no transient processes leading to them from the neighborhoods of unstable fixed points and one has to use the special analytical-numerical procedures. From the viewpoint of applications, the identification of hidden attractors is the major issue. The knowledge about the emergence and properties of hidden attractors can increase the likelihood that the system will remain on the most desirable attractor and reduce the risk of the sudden jump to undesired behavior. We review the most representative examples of hidden attractors, discuss their theoretical properties and experimental observations. We also describe numerical methods which allow identification of the hidden attractors.

  17. Managing Hidden Costs of Offshoring

    DEFF Research Database (Denmark)

    Larsen, Marcus M.; Pedersen, Torben

    2014-01-01

    This chapter investigates the concept of the ‘hidden costs’ of offshoring, i.e. unexpected offshoring costs exceeding the initially expected costs. Due to the highly undefined nature of these costs, we position our analysis towards the strategic responses of firms’ realisation of hidden costs....... In this regard, we argue that a major response to the hidden costs of offshoring is the identification and utilisation of strategic mechanisms in the organisational design to eventually achieving system integration in a globally dispersed and disaggregated organisation. This is heavily moderated by a learning...

  18. Ontology-based Knowledge Extraction from Hidden Web

    Institute of Scientific and Technical Information of China (English)

    SONG Hui; MA Fan-yuan; LIU Xiao-qiang

    2004-01-01

    Hidden Web provides great amount of domain-specific data for constructing knowledge services. Most previous knowledge extraction researches ignore the valuable data hidden in Web database, and related works do not refer how to make extracted information available for knowledge system. This paper describes a novel approach to build a domain-specific knowledge service with the data retrieved from Hidden Web. Ontology serves to model the domain knowledge. Queries forms of different Web sites are translated into machine-understandable format, defined knowledge concepts, so that they can be accessed automatically. Also knowledge data are extracted from Web pages and organized in ontology format knowledge. The experiment proves the algorithm achieves high accuracy and the system facilitates constructing knowledge services greatly.

  19. Variational Infinite Hidden Conditional Random Fields

    NARCIS (Netherlands)

    Bousmalis, Konstantinos; Zafeiriou, Stefanos; Morency, Louis-Philippe; Pantic, Maja; Ghahramani, Zoubin

    2015-01-01

    Hidden conditional random fields (HCRFs) are discriminative latent variable models which have been shown to successfully learn the hidden structure of a given classification problem. An Infinite hidden conditional random field is a hidden conditional random field with a countably infinite number of

  20. Evidence Feed Forward Hidden Markov Model: A New Type of Hidden Markov Model

    CERN Document Server

    DelRose, Michael; Frederick, Philip; 10.5121/ijaia.2011.2101

    2011-01-01

    The ability to predict the intentions of people based solely on their visual actions is a skill only performed by humans and animals. The intelligence of current computer algorithms has not reached this level of complexity, but there are several research efforts that are working towards it. With the number of classification algorithms available, it is hard to determine which algorithm works best for a particular situation. In classification of visual human intent data, Hidden Markov Models (HMM), and their variants, are leading candidates. The inability of HMMs to provide a probability in the observation to observation linkages is a big downfall in this classification technique. If a person is visually identifying an action of another person, they monitor patterns in the observations. By estimating the next observation, people have the ability to summarize the actions, and thus determine, with pretty good accuracy, the intention of the person performing the action. These visual cues and linkages are important...

  1. 基于蚁群算法输电线路检修计划的制定%Maintenance scheduling of transmission lines based on ant colony algorithm

    Institute of Scientific and Technical Information of China (English)

    于宏涛; 高立群; 李丽霞

    2011-01-01

    为了提高制定输电线路检修计划的工作效率,提出了一种输电线路检修计划模型.该模型为任务量均分的多旅行商问题模型,综合考虑了线路缺陷的严重程度和重要性,在保证线路检修时间始终控制在允许范围内,以可靠性理论中故障率为基础的经济损失风险最小为目标.应用了改进蚁群算法和基本蚁群算法对模型进行仿真比较,结果显示前者求解质量较好,这表明了改进蚁群算法能够改善基本蚁群算法易于陷入局部最优解的缺点.%In order to improve efficiency of making transmission lines maintenance scheduling, presented a model for transmission lines maintenance scheduling. The model based on a multiple traveling salesman problem of equal task, took account of defect severity and importance of lines. Treated the minimal economic loss based on failure rate as the target in searching for the best maintenance scheduling. Limited meanwhile all line' s maintenance time to the range of its maintenance time-choice during the search. Applied both an improved ant colony algorithm and conventional ant colony algorithm to the problem. By contrast, the improved ant colony algorithm was superior to conventional ant colony algorithm in quality. The simulation results show the improved ant colony algorithm can improve the ability of escaping from local optimal solution.

  2. Numerically efficient angle, width, offset, and discontinuity determination of straight lines by the discrete Fourier-bilinear transformation algorithm.

    Science.gov (United States)

    Lou, X M; Hassebrook, L G; Lhamon, M E; Li, J

    1997-01-01

    We introduce a new method for determining the number of straight lines, line angles, offsets, widths, and discontinuities in complicated images. In this method, line angles are obtained by searching the peaks of a hybrid discrete Fourier and bilinear transformed line angle spectrum. Numerical advantages and performance are demonstrated.

  3. Evidence Feed Forward Hidden Markov Model: A New Type Of Hidden Markov Model

    Directory of Open Access Journals (Sweden)

    Michael Del Rose

    2011-01-01

    Full Text Available The ability to predict the intentions of people based solely on their visual actions is a skill only performed by humans and animals. The intelligence of current computer algorithms has not reached this level of complexity, but there are several research efforts that are working towards it. With the number of classification algorithms available, it is hard to determine which algorithm works best for a particular situation. In classification of visual human intent data, Hidden Markov Models (HMM, and their variants, are leading candidates. The inability of HMMs to provide a probability in the observation to observation linkages is a big downfall in this classification technique. If a person is visually identifying an action of another person, they monitor patterns in the observations. By estimating the next observation, people have the ability to summarize the actions, and thus determine, with pretty good accuracy, the intention of the person performing the action. These visual cues and linkages are important in creating intelligent algorithms for determining human actions based on visual observations. The Evidence Feed Forward Hidden Markov Model is a newly developed algorithm which provides observation to observation linkages. The following research addresses the theory behind Evidence Feed Forward HMMs, provides mathematical proofs of their learning of these parameters to optimize the likelihood of observations with a Evidence Feed Forwards HMM, which is important in all computational intelligence algorithm, and gives comparative examples with standard HMMs in classification of both visual action data and measurement data; thus providing a strong base for Evidence Feed Forward HMMs in classification of many types of problems.

  4. Hidden Statistics of Schroedinger Equation

    Science.gov (United States)

    Zak, Michail

    2011-01-01

    Work was carried out in determination of the mathematical origin of randomness in quantum mechanics and creating a hidden statistics of Schr dinger equation; i.e., to expose the transitional stochastic process as a "bridge" to the quantum world. The governing equations of hidden statistics would preserve such properties of quantum physics as superposition, entanglement, and direct-product decomposability while allowing one to measure its state variables using classical methods.

  5. Microgenetic analysis of hidden figures

    OpenAIRE

    Marković Slobodan S.; Gvozdenović Vasilije P.

    2006-01-01

    In this study the phenomenological and processual aspects of the perception of hidden figures were compared. The question was whether the more probable percepts of hidden figures, compared to the less probable percepts, were generated in earlier stages of the perceptual process. In the pilot study the subjects were asked to say what they see in a complex linear pattern. The three most frequent and the three least frequent perceptual descriptions were selected. In the experiment the microgenes...

  6. AIRWAY LABELING USING A HIDDEN MARKOV TREE MODEL

    Science.gov (United States)

    Ross, James C.; Díaz, Alejandro A.; Okajima, Yuka; Wassermann, Demian; Washko, George R.; Dy, Jennifer; San José Estépar, Raúl

    2014-01-01

    We present a novel airway labeling algorithm based on a Hidden Markov Tree Model (HMTM). We obtain a collection of discrete points along the segmented airway tree using particles sampling [1] and establish topology using Kruskal’s minimum spanning tree algorithm. Following this, our HMTM algorithm probabilistically assigns labels to each point. While alternative methods label airway branches out to the segmental level, we describe a general method and demonstrate its performance out to the subsubsegmental level (two generations further than previously published approaches). We present results on a collection of 25 computed tomography (CT) datasets taken from a Chronic Obstructive Pulmonary Disease (COPD) study. PMID:25436039

  7. Managing Hidden Costs of Offshoring

    DEFF Research Database (Denmark)

    Larsen, Marcus M.; Pedersen, Torben

    2014-01-01

    This chapter investigates the concept of the ‘hidden costs’ of offshoring, i.e. unexpected offshoring costs exceeding the initially expected costs. Due to the highly undefined nature of these costs, we position our analysis towards the strategic responses of firms’ realisation of hidden costs. In......-by-doing process, where hidden costs motivate firms and their employees to search for new and better knowledge on how to successfully manage the organisation. We illustrate this thesis based on the case of the LEGO Group.......This chapter investigates the concept of the ‘hidden costs’ of offshoring, i.e. unexpected offshoring costs exceeding the initially expected costs. Due to the highly undefined nature of these costs, we position our analysis towards the strategic responses of firms’ realisation of hidden costs....... In this regard, we argue that a major response to the hidden costs of offshoring is the identification and utilisation of strategic mechanisms in the organisational design to eventually achieving system integration in a globally dispersed and disaggregated organisation. This is heavily moderated by a learning...

  8. The Hidden Costs of Offshoring

    DEFF Research Database (Denmark)

    Møller Larsen, Marcus; Manning, Stephan; Pedersen, Torben

    2011-01-01

    This study seeks to explain hidden costs of offshoring, i.e. unexpected costs resulting from the relocation of business tasks and activities outside the home country. We develop a model that highlights the role of complexity, design orientation and experience in explaining hidden costs of offshor...... of our study is to suggest how hidden costs of offshoring can be mitigated through an explicit orientation towards improving organizational processes and structures as well as experience with offshoring.......This study seeks to explain hidden costs of offshoring, i.e. unexpected costs resulting from the relocation of business tasks and activities outside the home country. We develop a model that highlights the role of complexity, design orientation and experience in explaining hidden costs...... of offshoring. Specifically, we propose that hidden costs can be explained by the combination of increasing structural, operational and social complexity of offshoring activities. In addition, we suggest that firm orientation towards organizational design as part of an offshoring strategy and offshoring...

  9. 一种基于隐马尔科夫模型的雷达辐射源识别算法%A Radar Emitter Recognition Algorithm Based on Hidden Markov Models

    Institute of Scientific and Technical Information of China (English)

    关一夫; 张国毅

    2015-01-01

    Aiming at the problem that modern radars use complex PRI modulation types which make them can’t be accurately recognized,this article puts forward a recognition method for radar emitters with complex PRI modulation types based on Hidden Markov Models. The method issues transforms the problem foregoing into a problem of recognition for specific code sequences with classification characteristics,modeling it as Hidden Markov Models by employing symbolic time series analysis theory of symbolic dynamics,and realizing the accurate recognition for emitters with such complex PRI modulation types as PRI jitter,pseudo random coded,etc. Simulation results demonstrate that the method issued possesses good recognition capability even when PRI values of different emitters exist partial overlap.%针对现代雷达采用复杂的PRI样式不能对其进行准确识别的问题,提出一种基于隐马尔科夫模型的复杂体制雷达辐射源识别算法。该算法将具有复杂PRI样式辐射源识别问题转化为对具有分类特征的码序列的识别问题,通过运用符号动力学中符号时间序列分析(symbolic time series analysis)理论,将上述码序列识别问题建模为隐马尔科夫模型予以解决,实现了对具有PRI抖动、伪随机编码等复杂PRI调制样式雷达辐射源的准确识别。仿真结果证明算法在PRI值有部分重叠的情况下仍具有很好的识别能力。

  10. Disease surveillance using a hidden Markov model

    Directory of Open Access Journals (Sweden)

    Wright Graeme

    2009-08-01

    Full Text Available Abstract Background Routine surveillance of disease notification data can enable the early detection of localised disease outbreaks. Although hidden Markov models (HMMs have been recognised as an appropriate method to model disease surveillance data, they have been rarely applied in public health practice. We aimed to develop and evaluate a simple flexible HMM for disease surveillance which is suitable for use with sparse small area count data and requires little baseline data. Methods A Bayesian HMM was designed to monitor routinely collected notifiable disease data that are aggregated by residential postcode. Semi-synthetic data were used to evaluate the algorithm and compare outbreak detection performance with the established Early Aberration Reporting System (EARS algorithms and a negative binomial cusum. Results Algorithm performance varied according to the desired false alarm rate for surveillance. At false alarm rates around 0.05, the cusum-based algorithms provided the best overall outbreak detection performance, having similar sensitivity to the HMMs and a shorter average time to detection. At false alarm rates around 0.01, the HMM algorithms provided the best overall outbreak detection performance, having higher sensitivity than the cusum-based Methods and a generally shorter time to detection for larger outbreaks. Overall, the 14-day HMM had a significantly greater area under the receiver operator characteristic curve than the EARS C3 and 7-day negative binomial cusum algorithms. Conclusion Our findings suggest that the HMM provides an effective method for the surveillance of sparse small area notifiable disease data at low false alarm rates. Further investigations are required to evaluation algorithm performance across other diseases and surveillance contexts.

  11. The Consensus String Problem and the Complexity of Comparing Hidden Markov Models

    DEFF Research Database (Denmark)

    Lyngsø, Rune Bang; Pedersen, Christian Nørgaard Storm

    2002-01-01

    The basic theory of hidden Markov models was developed and applied to problems in speech recognition in the late 1960s, and has since then been applied to numerous problems, e.g. biological sequence analysis. Most applications of hidden Markov models are based on efficient algorithms for computing...... the probability of generating a given string, or computing the most likely path generating a given string. In this paper we consider the problem of computing the most likely string, or consensus string, generated by a given model, and its implications on the complexity of comparing hidden Markov models. We show...... that computing the consensus string, and approximating its probability within any constant factor, is NP-hard, and that the same holds for the closely related labeling problem for class hidden Markov models. Furthermore, we establish the NP-hardness of comparing two hidden Markov models under the L∞- and L1...

  12. The Consensus String Problem and the Complexity of Comparing Hidden Markov Models

    DEFF Research Database (Denmark)

    Lyngsø, Rune Bang; Pedersen, Christian Nørgaard Storm

    2002-01-01

    The basic theory of hidden Markov models was developed and applied to problems in speech recognition in the late 1960s, and has since then been applied to numerous problems, e.g. biological sequence analysis. Most applications of hidden Markov models are based on efficient algorithms for computing...... the probability of generating a given string, or computing the most likely path generating a given string. In this paper we consider the problem of computing the most likely string, or consensus string, generated by a given model, and its implications on the complexity of comparing hidden Markov models. We show...... that computing the consensus string, and approximating its probability within any constant factor, is NP-hard, and that the same holds for the closely related labeling problem for class hidden Markov models. Furthermore, we establish the NP-hardness of comparing two hidden Markov models under the L∞- and L1...

  13. Free vibration analysis of straight-line beam regarded as distributed system by combining Wittrick-Williams algorithm and transfer dynamic stiffness coefficient method

    Energy Technology Data Exchange (ETDEWEB)

    Choi, Myung Soo; Yang, Kyong Uk [Chonnam National University, Yeosu (Korea, Republic of); Kondou, Takahiro [Kyushu University, Fukuoka (Japan); Bonkobara, Yasuhiro [University of Miyazaki, Miyazaki (Japan)

    2016-03-15

    We developed a method for analyzing the free vibration of a structure regarded as a distributed system, by combining the Wittrick-Williams algorithm and the transfer dynamic stiffness coefficient method. A computational algorithm was formulated for analyzing the free vibration of a straight-line beam regarded as a distributed system, to explain the concept of the developed method. To verify the effectiveness of the developed method, the natural frequencies of straight-line beams were computed using the finite element method, transfer matrix method, transfer dynamic stiffness coefficient method, the exact solution, and the developed method. By comparing the computational results of the developed method with those of the other methods, we confirmed that the developed method exhibited superior performance over the other methods in terms of computational accuracy, cost and user convenience.

  14. 基于DHSP的格上最短向量量子算法的研究%Research on Shortest Vector Problem of Quantum Algorithm Based on Dihedral Hidden Subgroup Problem

    Institute of Scientific and Technical Information of China (English)

    孙静; 袁家斌; 金广龙

    2013-01-01

    The shortest vector problem is the basis of the public key cryptosystem based on grid. With improvement on Kupcrberg's algorithm, a DHSP algorithm is presented that runs in polynomial time. Based on the polynomial DHSP algorithm and Oded Regev's theory, a polynomial time quantum algorithm is proposed which solves the shortest vector problem. The algorithm runs in O(n3) with the factor of () (n3). Finally, a brief performance analysis about the method is made. This algorithm will have an important influence on the public key cryp-tosystem based on grid.%SVP问题是格的公钥密码体制抗量子性的理论依据,论文运用量子计算分析SVP问题,对Kuperberg算法改进·提出了DH-SP多项式时间量子算法,并以此算法为模型框架,以Oded Regev算法理论为基础,提出近似因子为O(n3),时间复杂度是O(n4)的SVP量子算法,最后对其进行性能分析.论文算法的提出将对基于格的公钥密码体制的安全性带来重大威胁.

  15. Hidden Markov Model for Stock Selection

    Directory of Open Access Journals (Sweden)

    Nguyet Nguyen

    2015-10-01

    Full Text Available The hidden Markov model (HMM is typically used to predict the hidden regimes of observation data. Therefore, this model finds applications in many different areas, such as speech recognition systems, computational molecular biology and financial market predictions. In this paper, we use HMM for stock selection. We first use HMM to make monthly regime predictions for the four macroeconomic variables: inflation (consumer price index (CPI, industrial production index (INDPRO, stock market index (S&P 500 and market volatility (VIX. At the end of each month, we calibrate HMM’s parameters for each of these economic variables and predict its regimes for the next month. We then look back into historical data to find the time periods for which the four variables had similar regimes with the forecasted regimes. Within those similar periods, we analyze all of the S&P 500 stocks to identify which stock characteristics have been well rewarded during the time periods and assign scores and corresponding weights for each of the stock characteristics. A composite score of each stock is calculated based on the scores and weights of its features. Based on this algorithm, we choose the 50 top ranking stocks to buy. We compare the performances of the portfolio with the benchmark index, S&P 500. With an initial investment of $100 in December 1999, over 15 years, in December 2014, our portfolio had an average gain per annum of 14.9% versus 2.3% for the S&P 500.

  16. A New Improved Hough Transform Algorithm for Line Extraction%一种新的改进的 Hough 变换直线提取算法

    Institute of Scientific and Technical Information of China (English)

    孙雪琪; 宋小春

    2015-01-01

    Hough transform is a better line detection method ,which has good robustness .However ,the traditional Hough transform algorithm for straight line detection ,would detect false straight line and can not detect the shorter beeline , when the long and short beeline coexist .A new and improved Hough transform method for straight line detection is proposed to solve the above problem .After extracting a straight line in the transform space of the Hough transform ,the points in the transform space accumulator units are removed ,which are transformed form all the leeliners that pass various points on the extracted line ,so as to exclude the interference of the detected straight line on the other line detecting .Finally ,the improved Hough transform algorithm is compared with traditional Hough transform method .The experimental results showed that the improved Hough algorithm has a better line detection effect .%Hough 变换具有很好的鲁棒性,是一种较好的检测直线的方法。但是,目前的 Hough 变换在长短直线并存的情况下,会检测出虚假直线并漏检较短的直线。针对以上问题论文提出了一种新的改进的 Hough 变换直线检测方法。在Hough 变换的变换空间中提取出一条直线后,将过该直线上各点的所有直线在变换空间累加器单元中对应的映射点删除,从而排除该直线对其他直线检测的干扰。最后将改进的 Hough 变换算法与传统 Hough 变换方法进行比较,实验结果显示改进的 Hough 变换算法具有更好的直线检测效果。

  17. The Impact of a Line Probe Assay Based Diagnostic Algorithm on Time to Treatment Initiation and Treatment Outcomes for Multidrug Resistant TB Patients in Arkhangelsk Region, Russia

    Science.gov (United States)

    Eliseev, Platon; Balantcev, Grigory; Nikishova, Elena; Gaida, Anastasia; Bogdanova, Elena; Enarson, Donald; Ornstein, Tara; Detjen, Anne; Dacombe, Russell; Gospodarevskaya, Elena; Phillips, Patrick P. J.; Mann, Gillian; Squire, Stephen Bertel; Mariandyshev, Andrei

    2016-01-01

    Background In the Arkhangelsk region of Northern Russia, multidrug-resistant (MDR) tuberculosis (TB) rates in new cases are amongst the highest in the world. In 2014, MDR-TB rates reached 31.7% among new cases and 56.9% among retreatment cases. The development of new diagnostic tools allows for faster detection of both TB and MDR-TB and should lead to reduced transmission by earlier initiation of anti-TB therapy. Study Aim The PROVE-IT (Policy Relevant Outcomes from Validating Evidence on Impact) Russia study aimed to assess the impact of the implementation of line probe assay (LPA) as part of an LPA-based diagnostic algorithm for patients with presumptive MDR-TB focusing on time to treatment initiation with time from first-care seeking visit to the initiation of MDR-TB treatment rather than diagnostic accuracy as the primary outcome, and to assess treatment outcomes. We hypothesized that the implementation of LPA would result in faster time to treatment initiation and better treatment outcomes. Methods A culture-based diagnostic algorithm used prior to LPA implementation was compared to an LPA-based algorithm that replaced BacTAlert and Löwenstein Jensen (LJ) for drug sensitivity testing. A total of 295 MDR-TB patients were included in the study, 163 diagnosed with the culture-based algorithm, 132 with the LPA-based algorithm. Results Among smear positive patients, the implementation of the LPA-based algorithm was associated with a median decrease in time to MDR-TB treatment initiation of 50 and 66 days compared to the culture-based algorithm (BacTAlert and LJ respectively, p<0.001). In smear negative patients, the LPA-based algorithm was associated with a median decrease in time to MDR-TB treatment initiation of 78 days when compared to the culture-based algorithm (LJ, p<0.001). However, several weeks were still needed for treatment initiation in LPA-based algorithm, 24 days in smear positive, and 62 days in smear negative patients. Overall treatment outcomes

  18. 动线法自动制图的关键算法设计与实现%Study of the Cartographic Algorithm on Flow Line Symbol

    Institute of Scientific and Technical Information of China (English)

    王正; 王英杰

    2014-01-01

    The flow line method occupies a very important position in cartography. It is able to synthetically ex-press the direction of actions, the movement routes, the increase or decrease of the number, and the quality change of spatial entities or phenomena. Flow line method is a difficult subject in computer graphics, which has not been satisfactorily resolved. The traditional fixed-line method is linear symbols. However, there are many limitations in the practical application of linear symbols. To solve this problem, the author proposed the correla-tion algorithm of curve line symbol and developed a WEB-side system for the moving line method with respect to adaptive cartography, which is based on the open source software MapServer. This article is mainly consisted of three parts:the flow line symbolic algorithm, the database management system, and the map display system. The flow line symbolic algorithm was discussed based on the map display system developed by the Visual Stu-dio 2010 platform, which was consisted of curve symbolic algorithm, obstacles avoiding algorithm, and conflu-ence and difference algorithm. The database management system was established based on the shape file format of spatial data and Oracle environment attribute data. The map display system was used for WEB-side adaptive map display and other interactive functions. In the article, the floating population data was used as an example to verify and describe the system functions of the thematic map display, the hazard avoidance, and the confluence and difference calculations. According to the thematic map, we could analyze the floating population data easily, accurately, and intuitively. This provides great assistances in data supporting and decision making for other stud-ies of floating population and related disciplines. In addition to the floating population, the system is also adapt-ed to the data presentation and analysis of economic development, social factors, military combat, natural phe

  19. 无线局域网中存在隐藏终端的速率自适应算法%Rate adaptation algorithm with hidden terminals in WLAN.

    Institute of Scientific and Technical Information of China (English)

    冯文江; 袁俊峰

    2011-01-01

    Many rate adaptation schemes have been proposed so far for IEEE 802.11 standard,but most of the schemes don't consider the collision effect,resulting in the throughput degradation of the system. Though the Collision Aware Rate Adaptation (CARA) has considered the collision effect and has improved system performance effectively,it doesn't differentiate the reason of collision and would produce RTS turn on/off alternately in the environment with hidden terminals.This paper presents an enhanced CARA-EN-CARA,combining detective mechanism of hidden terminals,which can avoid RTS turn on/off alternately, reduce the probabilities of the collision effectively and further improve system performance. Simulation results show that the proposed scheme outperforms the original CARA significantly under various randomly-generated network topologies.%针对IEEE 802.11标准的无线局域网已有大量速率自适应算法,但是大多数算法的速率选择未考虑冲突的影响,可能导致系统吞吐量反而下降.CARA算法虽然考虑了冲突因素,能有效提高系统性能,但是该算法没有对造成冲突的原因进行进一步区分,在存在隐藏终端的无线局域网中可能产生RTS振荡效应.为此提出一种基于CARA的改进算法——EN-CARA算法,该算法结合了隐藏终端检测机制,能避免RTS振荡效应,有效降低冲突概率,进一步改善和提高系统性能.仿真结果表明,该算法在随机生成的拓扑架构下能取得比CARA更好的性能.

  20. Stargate of the Hidden Multiverse

    Directory of Open Access Journals (Sweden)

    Alexander Antonov

    2016-02-01

    Full Text Available Concept of Monoverse, which corresponds to the existing broad interpretation of the second postulate of the special theory of relativity, is not consistent with the modern astrophysical reality — existence of the dark matter and the dark energy, the total mass-energy of which is ten times greater than the mass-energy of the visible universe (which has been considered as the entire universe until very recent . This concept does not allow to explain their rather unusual properties — invisibility and lack of baryon content — which would seem to even destroy the very modern understanding of the term ‘matter’. However, all numerous alternative concepts of Multiverses, which have been proposed until today, are unable to explain these properties of the dark matter and dark energy. This article describes a new concept: the concept of the hidden Multiverse and hidden Supermultiverse, which mutual invisibility of parallel universes is explained by the physical reality of imaginary numbers. This concept completely explains the phenomenon of the dark matter and the dark energy. Moreover, it is shown that the dark matter and the dark energy are the experimental evidence for the existence of the hidden Multiverse. Described structure of the hidden Multiverse is fully consistent with the data obtained by the space stations WMAP and Planck. An extremely important property of the hidden Multiverse is an actual possibility of its permeation through stargate located on the Earth.

  1. Hidden photons in connection to dark matter

    Energy Technology Data Exchange (ETDEWEB)

    Andreas, Sarah; Ringwald, Andreas [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Goodsell, Mark D. [CPhT, Ecole Polytechnique, Palaiseau (France)

    2013-06-15

    Light extra U(1) gauge bosons, so called hidden photons, which reside in a hidden sector have attracted much attention since they are a well motivated feature of many scenarios beyond the Standard Model and furthermore could mediate the interaction with hidden sector dark matter.We review limits on hidden photons from past electron beam dump experiments including two new limits from such experiments at KEK and Orsay. In addition, we study the possibility of having dark matter in the hidden sector. A simple toy model and different supersymmetric realisations are shown to provide viable dark matter candidates in the hidden sector that are in agreement with recent direct detection limits.

  2. Discrete Fourier Transform (DFT algorithm, ultra-saturation phenomenon, unloaded transformer energizing with additional line/load from the supplying side, transformer differential protection.

    Directory of Open Access Journals (Sweden)

    bahram noshad

    2012-11-01

    Full Text Available One of mal-operations of the transformer differential protection during the unload transformer energizing with additional line/load from the supplying side is ultra-saturation phenomenon. In this paper, first a new model according to Discrete Fourier Transform (DFT algorithm for investigating the ultra-saturation phenomenon during the unload transformer energizing with additional line/load from the supplying side is presented and its effect on the differential protection of the transformer is considered. In this model, the nonlinear characteristic of the transformer core and the effect of current transformer are taken into account. It is assumed that the additional line/load from the supplying side of the power transformer is a resistive-inductive load. Also, the effect of the residual flux, inception angle and additional line/load from the supplying side on the ultra-saturation phenomenon is investigated. Then, the mal-operation of differential protection by using DFT algorithm is described.

  3. Information- Theoretic Analysis for the Difficulty of Extracting Hidden Information

    Institute of Scientific and Technical Information of China (English)

    ZHANG Wei-ming; LI Shi-qu; CAO Jia; LIU Jiu-fen

    2005-01-01

    The difficulty of extracting hidden information,which is essentially a kind of secrecy, is analyzed by information-theoretic method. The relations between key rate, message rate, hiding capacity and difficulty of extraction are studied in the terms of unicity distance of stego-key, and the theoretic conclusion is used to analyze the actual extracting attack on Least Significant Bit(LSB) steganographic algorithms.

  4. Effect of Noise on hidden data

    Directory of Open Access Journals (Sweden)

    Garima Tomar

    2012-02-01

    Full Text Available This paper simulates an effective data hiding technique i.e. steganography based on LSB insertion and RSA encryption in order to provide seven million times better security than the previous work. The Main idea of proposed scheme is to encrypt secret data by RSA 1024 algorithm, convert it in to binary sequence bit and then embedded into each cover pixels by modifying the least significant bits (LSBs of cover pixels. The result image is also known as steganography image. The PSNR value of this steganography image is 54.34 db. In this paper Baboon image is used for experimental purpous.This steganography image is transmitted through AWGN channel, and performance is simulated. The image and hidden data are reconstructed with the SNR level ≥9 dB.

  5. Detect and exploit hidden structure in fatty acid signature data

    Science.gov (United States)

    Budge, Suzanne; Bromaghin, Jeffrey; Thiemann, Gregory

    2017-01-01

    Estimates of predator diet composition are essential to our understanding of their ecology. Although several methods of estimating diet are practiced, methods based on biomarkers have become increasingly common. Quantitative fatty acid signature analysis (QFASA) is a popular method that continues to be refined and extended. Quantitative fatty acid signature analysis is based on differences in the signatures of prey types, often species, which are recognized and designated by investigators. Similarly, predator signatures may be structured by known factors such as sex or age class, and the season or region of sample collection. The recognized structure in signature data inherently influences QFASA results in important and typically beneficial ways. However, predator and prey signatures may contain additional, hidden structure that investigators either choose not to incorporate into an analysis or of which they are unaware, being caused by unknown ecological mechanisms. Hidden structure also influences QFASA results, most often negatively. We developed a new method to explore signature data for hidden structure, called divisive magnetic clustering (DIMAC). Our DIMAC approach is based on the same distance measure used in diet estimation, closely linking methods of data exploration and parameter estimation, and it does not require data transformation or distributional assumptions, as do many multivariate ordination methods in common use. We investigated the potential benefits of the DIMAC method to detect and subsequently exploit hidden structure in signature data using two prey signature libraries with quite different characteristics. We found that the existence of hidden structure in prey signatures can increase the confusion between prey types and thereby reduce the accuracy and precision of QFASA diet estimates. Conversely, the detection and exploitation of hidden structure represent a potential opportunity to improve predator diet estimates and may lead to new

  6. Hidden worlds in quantum physics

    CERN Document Server

    Gouesbet, Gérard

    2014-01-01

    The past decade has witnessed a resurgence in research and interest in the areas of quantum computation and entanglement. This new book addresses the hidden worlds or variables of quantum physics. Author Gérard Gouesbet studied and worked with a former student of Louis de Broglie, a pioneer of quantum physics. His presentation emphasizes the history and philosophical foundations of physics, areas that will interest lay readers as well as professionals and advanced undergraduate and graduate students of quantum physics. The introduction is succeeded by chapters offering background on relevant concepts in classical and quantum mechanics, a brief history of causal theories, and examinations of the double solution, pilot wave, and other hidden-variables theories. Additional topics include proofs of possibility and impossibility, contextuality, non-locality, classification of hidden-variables theories, and stochastic quantum mechanics. The final section discusses how to gain a genuine understanding of quantum mec...

  7. Hidden Variables or Positive Probabilities?

    CERN Document Server

    Rothman, T; Rothman, Tony

    2001-01-01

    Despite claims that Bell's inequalities are based on the Einstein locality condition, or equivalent, all derivations make an identical mathematical assumption: that local hidden-variable theories produce a set of positive-definite probabilities for detecting a particle with a given spin orientation. The standard argument is that because quantum mechanics assumes that particles are emitted in a superposition of states the theory cannot produce such a set of probabilities. We examine a paper by Eberhard who claims to show that a generalized Bell inequality, the CHSH inequality, can be derived solely on the basis of the locality condition, without recourse to hidden variables. We point out that he nonetheless assumes a set of positive-definite probabilities, which supports the claim that hidden variables or "locality" is not at issue here, positive-definite probabilities are. We demonstrate that quantum mechanics does predict a set of probabilities that violate the CHSH inequality; however these probabilities ar...

  8. The Hidden Costs of Offshoring

    DEFF Research Database (Denmark)

    Møller Larsen, Marcus; Manning, Stephan; Pedersen, Torben

    2011-01-01

    experience moderate the relationship between complexity and hidden costs negatively i.e. reduces the cost generating impact of complexity. We develop three hypotheses and test them on comprehensive data from the Offshoring Research Network (ORN). In general, we find support for our hypotheses. A key result...... of offshoring. Specifically, we propose that hidden costs can be explained by the combination of increasing structural, operational and social complexity of offshoring activities. In addition, we suggest that firm orientation towards organizational design as part of an offshoring strategy and offshoring...

  9. Hidden symmetries in jammed systems

    Science.gov (United States)

    Morse, Peter K.; Corwin, Eric I.

    2016-07-01

    There are deep, but hidden, geometric structures within jammed systems, associated with hidden symmetries. These can be revealed by repeated transformations under which these structures lead to fixed points. These geometric structures can be found in the Voronoi tesselation of space defined by the packing. In this paper we examine two iterative processes: maximum inscribed sphere (MIS) inversion and a real-space coarsening scheme. Under repeated iterations of the MIS inversion process we find invariant systems in which every particle is equal to the maximum inscribed sphere within its Voronoi cell. Using a real-space coarsening scheme we reveal behavior in geometric order parameters which is length-scale invariant.

  10. Hidden Crises and Communication : An Interactional Analysis of Hidden Crises

    NARCIS (Netherlands)

    Klarenbeek, Annette

    2011-01-01

    In this paper I describe the ways in which the communication discipline can make a hidden crisis transparent. For this purpose I examine the concept of crisis entrepreneurship from a communication point of view. Using discourse analysis, I analyse the discursive practices of crisis entrepreneurs in

  11. An Algorithm for Automatic Road Asphalt Edge Delineation from Mobile Laser Scanner Data Using the Line Clouds Concept

    Directory of Open Access Journals (Sweden)

    Carlos Cabo

    2016-09-01

    Full Text Available Accurate road asphalt extent delineation is needed for road and street planning, road maintenance, and road safety assessment. In this article, a new approach for automatic roadside delineation is developed based on the line clouds concept. The method relies on line cloud grouping from point cloud laser data. Using geometric criteria, the initial 3D LiDAR point data is structured in lines covering the road surface. These lines are then grouped according to a set of quasi-planar restriction rules. Road asphalt edge limits are extracted from the end points of lines belonging to these groups. Finally a two-stage smoothing procedure is applied to correct for edge occlusions and other anomalies. The method was tested on a 2.1 km stretch of road, and the results were checked using a RTK-GNSS measured dataset as ground truth. Correctness and completeness were 99% and 97%, respectively.

  12. A Novel Dynamic Physical Layer Impairment-Aware Routing and Wavelength Assignment (PLI-RWA) Algorithm for Mixed Line Rate (MLR) Wavelength Division Multiplexed (WDM) Optical Networks

    Science.gov (United States)

    Iyer, Sridhar

    2016-12-01

    The ever-increasing global Internet traffic will inevitably lead to a serious upgrade of the current optical networks' capacity. The legacy infrastructure can be enhanced not only by increasing the capacity but also by adopting advance modulation formats, having increased spectral efficiency at higher data rate. In a transparent mixed-line-rate (MLR) optical network, different line rates, on different wavelengths, can coexist on the same fiber. Migration to data rates higher than 10 Gbps requires the implementation of phase modulation schemes. However, the co-existing on-off keying (OOK) channels cause critical physical layer impairments (PLIs) to the phase modulated channels, mainly due to cross-phase modulation (XPM), which in turn limits the network's performance. In order to mitigate this effect, a more sophisticated PLI-Routing and Wavelength Assignment (PLI-RWA) scheme needs to be adopted. In this paper, we investigate the critical impairment for each data rate and the way it affects the quality of transmission (QoT). In view of the aforementioned, we present a novel dynamic PLI-RWA algorithm for MLR optical networks. The proposed algorithm is compared through simulations with the shortest path and minimum hop routing schemes. The simulation results show that performance of the proposed algorithm is better than the existing schemes.

  13. Hierarchical On-line Scheduling of Multiproduct Batch Plants with a Combined Approach of Mathematical Programming and Genetic Algorithm

    Institute of Scientific and Technical Information of China (English)

    陈理; 王克峰; 徐霄羽; 姚平经

    2004-01-01

    In this contribution we present an online scheduling algorithm for a real world multiproduct batch plant. The overall mixed integer nonlinear programming (MINLP) problem is hierarchically structured into a mixed integer linear programming (MILP) problem first and then a reduced dimensional MINLP problem, which are optimized by mathematical programming (MP) and genetic algorithm (GA) respectively. The basis idea relies on combining MP with GA to exploit their complementary capacity. The key features of the hierarchical model are explained and illustrated with some real world cases from the multiproduct batch plants.

  14. A new damping factor algorithm based on line search of the local minimum point for inverse approach

    Science.gov (United States)

    Zhang, Yaqi; Liu, Weijie; Lu, Fang; Zhang, Xiangkui; Hu, Ping

    2013-05-01

    The influence of damping factor on the convergence and computational efficiency of the inverse approach was studied through a series of practical examples. A new selection algorithm of the damping (relaxation) factor which takes into account of both robustness and calculation efficiency is proposed, then the computer program is implemented and tested on Siemens PLM NX | One-Step. The result is compared with the traditional Armijo rule through six examples such as U-beam, square box and cylindrical cup et al, confirming the effectiveness of proposed algorithm.

  15. A multi-objective genetic algorithm for a mixed-model assembly U-line balancing type-I problem considering human-related issues, training, and learning

    Science.gov (United States)

    Rabbani, Masoud; Montazeri, Mona; Farrokhi-Asl, Hamed; Rafiei, Hamed

    2016-07-01

    Mixed-model assembly lines are increasingly accepted in many industrial environments to meet the growing trend of greater product variability, diversification of customer demands, and shorter life cycles. In this research, a new mathematical model is presented considering balancing a mixed-model U-line and human-related issues, simultaneously. The objective function consists of two separate components. The first part of the objective function is related to balance problem. In this part, objective functions are minimizing the cycle time, minimizing the number of workstations, and maximizing the line efficiencies. The second part is related to human issues and consists of hiring cost, firing cost, training cost, and salary. To solve the presented model, two well-known multi-objective evolutionary algorithms, namely non-dominated sorting genetic algorithm and multi-objective particle swarm optimization, have been used. A simple solution representation is provided in this paper to encode the solutions. Finally, the computational results are compared and analyzed.

  16. Modeling Multiple Risks: Hidden Domain of Attraction

    CERN Document Server

    Mitra, Abhimanyu

    2011-01-01

    Hidden regular variation is a sub-model of multivariate regular variation and facilitates accurate estimation of joint tail probabilities. We generalize the model of hidden regular variation to what we call hidden domain of attraction. We exhibit examples that illustrate the need for a more general model and discuss detection and estimation techniques.

  17. Pentaquark states with hidden charm

    Science.gov (United States)

    Bijker, Roelof

    2017-07-01

    I develop an extension of the usual three-flavor quark model to four flavors (u, d, s and c), and discuss the classification of pentaquark states with hidden charm. This work is motivated by the recent observation of such states by the LHCb Collatoration at CERN.

  18. Microgenetic analysis of hidden figures

    Directory of Open Access Journals (Sweden)

    Marković Slobodan S.

    2006-01-01

    Full Text Available In this study the phenomenological and processual aspects of the perception of hidden figures were compared. The question was whether the more probable percepts of hidden figures, compared to the less probable percepts, were generated in earlier stages of the perceptual process. In the pilot study the subjects were asked to say what they see in a complex linear pattern. The three most frequent and the three least frequent perceptual descriptions were selected. In the experiment the microgenesis of the perception of hidden figures was investigated. The primed matching paradigm and the same-different task were used. In each experiment two types of test figures were contrasted: the more frequent and the less frequent ones. There were two prime types: identical (equal to test figures and complex (the pattern with hidden test figures. The prime duration was varied, 50 ms and 400 ms. The main result indicates that in the case of complex priming the more frequent test figures were processed significantly faster than the less frequent ones in both prime duration conditions. These results suggest that the faster the processing of a figure, the more probable the perceptual generation of this figure.

  19. 排序问题Pm,ai|on-line|Cmax的LPT算法%LPT Algorithm for Scheduling Problem Pm,ai|on-line|Cmax

    Institute of Scientific and Technical Information of China (English)

    赵传立; 唐恒永

    2000-01-01

    In this paper we discuss the on-line parallel processors scheduling problem where tasks arrive over time. Chen and Vestjens proved that the bound of LPT is 3/2. We generalize the result to the case where the processors have ready time.%讨论了任务实时到达的平行机在线排序问题。Chen和Vestjens证明了LPT算法的界为3/2。将这一结论推广到了处理机具有准备时间的情况。

  20. 双边多工位装配线平衡问题%Heuristic algorithm of two-sided with multi-parallel stations assembly line balancing

    Institute of Scientific and Technical Information of China (English)

    张宏林; 殷复鹏; 吴爱华

    2013-01-01

    针对装配线上一个位置左右两边各有多个工位的装配线平衡问题建立数学模型,提出一种启发式平衡算法.该算法分为两个阶段,阶段1从未分配的作业元素中找出能够分配给某一位置的作业,构成集合W;阶段2按照不违背作业优先关系、方位约束和工位时间不超过节拍的原则,把W中的部分或全部作业元素分配到该位置内的各工位上;依此循环,直至所有作业元素分配完毕.以某重型汽车装配翻车前的装配线平衡为例,说明了所提算法的有效性.%To study the complex assembly line balancing problem, such as two-sided with multi-stations assembly line balancing problem, a mathematical model based on some assumptions to this problem was set up and a heuristic balancing algorithm was proposed. The algorithm had two phases. Phase one was to find out the operations which could be assigned to one position, corresponding to the constraint conditions in the mathematical model, and set up the set W with them. And phase two was to select and assign operations from W to the right station of the position without violating rules as precedence, position constraint and station time. All operations' assignments were completed based on this cycle. Finally, a truck assembly line balancing problem was provided as example to verify the effectiveness of the algorithm.

  1. Icing Forecasting of High Voltage Transmission Line Using Weighted Least Square Support Vector Machine with Fireworks Algorithm for Feature Selection

    Directory of Open Access Journals (Sweden)

    Tiannan Ma

    2016-12-01

    Full Text Available Accurate forecasting of icing thickness has great significance for ensuring the security and stability of the power grid. In order to improve the forecasting accuracy, this paper proposes an icing forecasting system based on the fireworks algorithm and weighted least square support vector machine (W-LSSVM. The method of the fireworks algorithm is employed to select the proper input features with the purpose of eliminating redundant influence. In addition, the aim of the W-LSSVM model is to train and test the historical data-set with the selected features. The capability of this proposed icing forecasting model and framework is tested through simulation experiments using real-world icing data from the monitoring center of the key laboratory of anti-ice disaster, Hunan, South China. The results show that the proposed W-LSSVM-FA method has a higher prediction accuracy and it may be a promising alternative for icing thickness forecasting.

  2. Topic Information Collection based on the Hidden Markov Model

    Directory of Open Access Journals (Sweden)

    Hai-yan Jiang

    2013-02-01

    Full Text Available Specific-subject oriented information collection is one of the key technologies of vertical search engines, which directly affects the speed and relevance of search results. The topic information collection algorithm is widely used for its accuracy. The Hidden Markov Model (HMM is used to learn and judge the relevance between the Uniform Resource Locator (URL and the topic information. The Rocchio method is used to construct the prototype vectors relevant to the topic information, and the HMM is used to learn the preferred browsing paths. The concept maps including the semantics of the webpage are constructed and the web's link structures can be decided. The validity of the algorithm is proved by the experiment at last. Comparing with the Best-First algorithm, this algorithm can get more information pages and has higher precision ratio.

  3. Nonintentional behavioural responses to psi : hidden targets and hidden observers

    OpenAIRE

    Anderson, Mary-Jane Charlotte

    2012-01-01

    Psi is the phenomenon of apparently responding to or receiving information by means other than the recognised senses. Psi information may influence human behaviour, without the individual intending this or even being aware of it. This thesis seeks to investigate nonintentional behavioural responses to psi. We present five empirical studies that investigated nonintentional behavioural responses to psi information. In each study, the psi information was hidden from participants, ...

  4. Reduced-Rank Hidden Markov Models

    CERN Document Server

    Siddiqi, Sajid M; Gordon, Geoffrey J

    2009-01-01

    We introduce the Reduced-Rank Hidden Markov Model (RR-HMM), a generalization of HMMs that can model smooth state evolution as in Linear Dynamical Systems (LDSs) as well as non-log-concave predictive distributions as in continuous-observation HMMs. RR-HMMs assume an m-dimensional latent state and n discrete observations, with a transition matrix of rank k <= m. This implies the dynamics evolve in a k-dimensional subspace, while the shape of the set of predictive distributions is determined by m. Latent state belief is represented with a k-dimensional state vector and inference is carried out entirely in R^k, making RR-HMMs as computationally efficient as k-state HMMs yet more expressive. To learn RR-HMMs, we relax the assumptions of a recently proposed spectral learning algorithm for HMMs (Hsu, Kakade and Zhang 2009) and apply it to learn k-dimensional observable representations of rank-k RR-HMMs. The algorithm is consistent and free of local optima, and we extend its performance guarantees to cover the RR-...

  5. Feature learning for a hidden Markov model approach to landmine detection

    Science.gov (United States)

    Zhang, Xuping; Gader, Paul; Frigui, Hichem

    2007-04-01

    Hidden Markov Models (HMMs) are useful tools for landmine detection and discrimination using Ground Penetrating Radar (GPR). The performance of HMMs, as well as other feature-based methods, depends not only on the design of the classifier but on the features. Traditionally, algorithms for learning the parameters of classifiers have been intensely investigated while algorithms for learning parameters of the feature extraction process have been much less intensely investigated. In this paper, we describe experiments for learning feature extraction and classification parameters simultaneously in the context of using hidden Markov models for landmine detection.

  6. On-line monitoring of extraction process of Flos Lonicerae Japonicae using near infrared spectroscopy combined with synergy interval PLS and genetic algorithm

    Science.gov (United States)

    Yang, Yue; Wang, Lei; Wu, Yongjiang; Liu, Xuesong; Bi, Yuan; Xiao, Wei; Chen, Yong

    2017-07-01

    There is a growing need for the effective on-line process monitoring during the manufacture of traditional Chinese medicine to ensure quality consistency. In this study, the potential of near infrared (NIR) spectroscopy technique to monitor the extraction process of Flos Lonicerae Japonicae was investigated. A new algorithm of synergy interval PLS with genetic algorithm (Si-GA-PLS) was proposed for modeling. Four different PLS models, namely Full-PLS, Si-PLS, GA-PLS, and Si-GA-PLS, were established, and their performances in predicting two quality parameters (viz. total acid and soluble solid contents) were compared. In conclusion, Si-GA-PLS model got the best results due to the combination of superiority of Si-PLS and GA. For Si-GA-PLS, the determination coefficient (Rp2) and root-mean-square error for the prediction set (RMSEP) were 0.9561 and 147.6544 μg/ml for total acid, 0.9062 and 0.1078% for soluble solid contents, correspondingly. The overall results demonstrated that the NIR spectroscopy technique combined with Si-GA-PLS calibration is a reliable and non-destructive alternative method for on-line monitoring of the extraction process of TCM on the production scale.

  7. A TWO-STATE MIXED HIDDEN MARKOV MODEL FOR RISKY TEENAGE DRIVING BEHAVIOR

    Science.gov (United States)

    Jackson, John C.; Albert, Paul S.; Zhang, Zhiwei

    2016-01-01

    This paper proposes a joint model for longitudinal binary and count outcomes. We apply the model to a unique longitudinal study of teen driving where risky driving behavior and the occurrence of crashes or near crashes are measured prospectively over the first 18 months of licensure. Of scientific interest is relating the two processes and predicting crash and near crash outcomes. We propose a two-state mixed hidden Markov model whereby the hidden state characterizes the mean for the joint longitudinal crash/near crash outcomes and elevated g-force events which are a proxy for risky driving. Heterogeneity is introduced in both the conditional model for the count outcomes and the hidden process using a shared random effect. An estimation procedure is presented using the forward–backward algorithm along with adaptive Gaussian quadrature to perform numerical integration. The estimation procedure readily yields hidden state probabilities as well as providing for a broad class of predictors.

  8. Atmospheric compensation of thermal infrared hyperspectral imagery with the emissive empirical line method and the in-scene atmospheric compensation algorithms: a comparison

    Science.gov (United States)

    DiStasio, Robert J., Jr.; Resmini, Ronald G.

    2010-04-01

    The in-scene atmospheric compensation (ISAC) algorithm of Young et al. (2002) [14] (and as implemented in the ENVI® software system [16] as 'Thermal Atm Correction') is commonly applied to thermal infrared multi- and hyperspectral imagery (MSI and HSI, respectively). ISAC estimates atmospheric transmissivity and upwelling radiance using only the scene data. The ISAC-derived transmissivity and upwelling radiance are compared to those derived from the emissive empirical line method (EELM), another in-scene atmospheric compensation algorithm for thermal infrared MSI and HSI data. EELM is based on the presence of calibration targets (e.g., panels, water pools) captured in the spectral image data for which the emissivity and temperature are well known at the moment of MSI/HSI data acquisition. EELM is similar in concept to the empirical line method (ELM) algorithm commonly applied to visible/near-infrared to shortwave infrared (VNIR/SWIR) spectral imagery and is implemented as a custom ENVI® plugin application. Both ISAC and EELM are in-scene methods and do not require radiative transfer modeling. ISAC and EELM have been applied to airborne longwave infrared (LWIR; ~7.5 μm to ~13.5 μm) HSI data. Captured in the imagery are calibration panels and/or water pools maintained at different temperatures facilitating the application of EELM. Overall, the atmospheric compensation parameters derived from the two methods are in close agreement: the EELM-derived ground-leaving radiance spectra generally contain fewer residual atmospheric spectral features, although ISAC sometimes produces smoother ground-leaving radiance spectra. Nonetheless, the agreement is viewed as validation of ISAC. ISAC is an effective atmospheric compensation algorithm that is readily available to the remote sensing community in the ENVI® software system. Thus studies such as the present testing and comparing ISAC to other methods are important. The ISAC and EELM algorithms are discussed as are the

  9. 机场视距检查的动态直线算法研究%Study of dynamic-line algorithm on checking sight distance of airfield

    Institute of Scientific and Technical Information of China (English)

    许巍; 宋颖; 李明锋

    2012-01-01

    基于飞行员视线和机场跑道纵坡线型特点,应用求导计算、图形分析的方法,研究了机场视距安全要求,提出了视距检查的动态直线算法,给出了算法流程图,并编制了应用软件.结合设计实例对算法及程序进行了检验,发现视距安全检查时间大大缩短,计算结果避免了奇异值的出现,检查结论的几何意义明晰、有效.结果表明,该算法可较好地评价机场纵坡线型的视距安全,可以应用于机场地势设计工作.%Based on derivative and graphics analyzing, this paper studied the checking method of sight distance with characteristic of line of sight and vertical section of runway, put forward dynamic-line algorithm on checking the rationality of sight distance of airfield, presented flow chart of computer program, and realized the program. By applying the algorithm and program, two examples were analyzed. It is pointed that the checking time is shortened, and the final values of checking result avoid the singular solution. The result indicates that the algorithm is feasible and can reasonably check the rationality of sight distance of airfield. 6figs,8 refs.

  10. Modeling Driver Behavior near Intersections in Hidden Markov Model.

    Science.gov (United States)

    Li, Juan; He, Qinglian; Zhou, Hang; Guan, Yunlin; Dai, Wei

    2016-12-21

    Intersections are one of the major locations where safety is a big concern to drivers. Inappropriate driver behaviors in response to frequent changes when approaching intersections often lead to intersection-related crashes or collisions. Thus to better understand driver behaviors at intersections, especially in the dilemma zone, a Hidden Markov Model (HMM) is utilized in this study. With the discrete data processing, the observed dynamic data of vehicles are used for the inference of the Hidden Markov Model. The Baum-Welch (B-W) estimation algorithm is applied to calculate the vehicle state transition probability matrix and the observation probability matrix. When combined with the Forward algorithm, the most likely state of the driver can be obtained. Thus the model can be used to measure the stability and risk of driver behavior. It is found that drivers' behaviors in the dilemma zone are of lower stability and higher risk compared with those in other regions around intersections. In addition to the B-W estimation algorithm, the Viterbi Algorithm is utilized to predict the potential dangers of vehicles. The results can be applied to driving assistance systems to warn drivers to avoid possible accidents.

  11. On-line Detection of Gas Pipeline Based on the Real-Time Algorithm and Network Technology with Robot

    Institute of Scientific and Technical Information of China (English)

    YAN Bo; YAN Guo-zheng; DING Guo-qing; ZHOU Bing; FU Xi-guang; ZUO Jian-yong

    2004-01-01

    The detection system integrates control technology, network technology, video encoding and decoding, video transmiss-ion, multi-single chip microcomputer communication, dat-abase technology, computer software and robot technology. The robot can adaptively adjust its status according to diameter (from 400 mm to 650 mm) of pipeline. The maximum detection distance is up to 1 000 m. The method of video coding in the system is based on fractal transformation. The experiments show that the coding scheme is fast and good PSNR. The precision of on-line detection is up to 3% thickness of pipeline wall. The robot can also have a high precision of location up to 0.03 m. The control method is based on network and characterized by on-line and real-time. The experiment in real gas pipeline shows that the performance of the detection system is good.

  12. Simple Estimation of Incident HIV Infection Rates in Notification Cohorts Based on Window Periods of Algorithms for Evaluation of Line-Immunoassay Result Patterns

    Science.gov (United States)

    Schüpbach, Jörg; Gebhardt, Martin D.; Scherrer, Alexandra U.; Bisset, Leslie R.; Niederhauser, Christoph; Regenass, Stephan; Yerly, Sabine; Aubert, Vincent; Suter, Franziska; Pfister, Stefan; Martinetti, Gladys; Andreutti, Corinne; Klimkait, Thomas; Brandenberger, Marcel; Günthard, Huldrych F.

    2013-01-01

    Background Tests for recent infections (TRIs) are important for HIV surveillance. We have shown that a patient's antibody pattern in a confirmatory line immunoassay (Inno-Lia) also yields information on time since infection. We have published algorithms which, with a certain sensitivity and specificity, distinguish between incident (algorithms like other TRIs, i.e., based on their windows, we now determined their window periods. Methods We classified Inno-Lia results of 527 treatment-naïve patients with HIV-1 infection algorithms. The time after which all infections were ruled older, i.e. the algorithm's window, was determined by linear regression of the proportion ruled incident in dependence of time since infection. Window-based incident infection rates (IIR) were determined utilizing the relationship ‘Prevalence  =  Incidence x Duration’ in four annual cohorts of HIV-1 notifications. Results were compared to performance-based IIR also derived from Inno-Lia results, but utilizing the relationship ‘incident  =  true incident + false incident’ and also to the IIR derived from the BED incidence assay. Results Window periods varied between 45.8 and 130.1 days and correlated well with the algorithms' diagnostic sensitivity (R2 = 0.962; Palgorithms, the mean window-based IIR among the 748 notifications of 2005/06 was 0.457 compared to 0.453 obtained for performance-based IIR with a model not correcting for selection bias. Evaluation of BED results using a window of 153 days yielded an IIR of 0.669. Window-based IIR and performance-based IIR increased by 22.4% and respectively 30.6% in 2008, while 2009 and 2010 showed a return to baseline for both methods. Conclusions IIR estimations by window- and performance-based evaluations of Inno-Lia algorithm results were similar and can be used together to assess IIR changes between annual HIV notification cohorts. PMID:23990968

  13. ORDERED TREE-BASED ROUTING ALGORITHM FOR POWER LINE COMMUNICATION NETWORK%基于有序树的电力线网络路由算法

    Institute of Scientific and Technical Information of China (English)

    何华冰; 姚婷婷; 李云飞; 贾俊铖

    2016-01-01

    Power line communication (PLC)is getting more and more attentions because it transmits data only relying on existing widespread power line facilities without additional wiring cost.However,current power line network still has the problems of low routing efficiency and high communication delay.To overcome these problems,we propose a tree routing algorithm,short for PLC-TR,according to the characteristics of tree topology of power line network.Specifically,PLC-TR first organises the power line networks into an ordered tree,and then selects the routes by comparing their addresses,this minimises the network overhead caused by routing maintenance.It is shown through simulation that compared with the shortest path routing (SPR)which is traditionally one of the optimal algorithms,under the same disturbance the PLC-TR has lower average packet transmission delay and higher packet delivery rate.%电力线通信(PLC)依靠现有的分布广泛的电力线路设施进行数据传输不需要额外布线开销,越来越受到人们的关注。但是,目前电力线网络路由效率不高,通信延迟较大。为解决以上问题,根据电力线网络的树型拓扑结构的特点,提出一种树路由算法(PLC-TR)。算法将电力线网络组织成一棵有序树,并通过地址比较进行路由选择,最大限度降低了因路由维护产生的网络开销。通过仿真表明,和传统上性能优异的最短路径算法(SPR)相比,在同等干扰情况下,PLC-TR 具有较低的数据包平均传输时延和较高的数据包交付率。

  14. On-line monitoring the extract process of Fu-fang Shuanghua oral solution using near infrared spectroscopy and different PLS algorithms

    Science.gov (United States)

    Kang, Qian; Ru, Qingguo; Liu, Yan; Xu, Lingyan; Liu, Jia; Wang, Yifei; Zhang, Yewen; Li, Hui; Zhang, Qing; Wu, Qing

    2016-01-01

    An on-line near infrared (NIR) spectroscopy monitoring method with an appropriate multivariate calibration method was developed for the extraction process of Fu-fang Shuanghua oral solution (FSOS). On-line NIR spectra were collected through two fiber optic probes, which were designed to transmit NIR radiation by a 2 mm flange. Partial least squares (PLS), interval PLS (iPLS) and synergy interval PLS (siPLS) algorithms were used comparatively for building the calibration regression models. During the extraction process, the feasibility of NIR spectroscopy was employed to determine the concentrations of chlorogenic acid (CA) content, total phenolic acids contents (TPC), total flavonoids contents (TFC) and soluble solid contents (SSC). High performance liquid chromatography (HPLC), ultraviolet spectrophotometric method (UV) and loss on drying methods were employed as reference methods. Experiment results showed that the performance of siPLS model is the best compared with PLS and iPLS. The calibration models for AC, TPC, TFC and SSC had high values of determination coefficients of (R2) (0.9948, 0.9992, 0.9950 and 0.9832) and low root mean square error of cross validation (RMSECV) (0.0113, 0.0341, 0.1787 and 1.2158), which indicate a good correlation between reference values and NIR predicted values. The overall results show that the on line detection method could be feasible in real application and would be of great value for monitoring the mixed decoction process of FSOS and other Chinese patent medicines.

  15. HidSecSOFTSUSY: Incorporating effects from hidden sectors in the numerical computation of the MSSM spectrum

    Science.gov (United States)

    Keren-Zur, Boaz

    2011-02-01

    SOFTSUSY is a software designed to solve the RG equations of the MSSM and compute its low energy spectrum. HidSecSOFTSUSY is an extension of the SOFTSUSY package which modifies the beta functions to include contributions from light dynamic fields in the hidden sector. Program summaryProgram title: HidSecSOFTSUSY Catalogue identifier: AEHP_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEHP_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 4167 No. of bytes in distributed program, including test data, etc.: 141 411 Distribution format: tar.gz Programming language: C++, Fortran Computer: Personal computer Operating system: Tested on GNU/Linux Word size: 32 bits Classification: 11.6 External routines: Requires an installed version of SOFTSUSY ( http://projects.hepforge.org/softsusy/) Nature of problem: Calculating supersymmetric particle spectrum and mixing parameters while incorporating dynamic modes from the hidden sector into the renormalization group equations. The solution to the equations must be consistent with a high-scale boundary condition on supersymmetry breaking parameters, as well as a weak-scale boundary condition on gauge couplings, Yukawa couplings and the Higgs potential parameters. Solution method: Nested iterative algorithm. Running time: A few seconds per parameter point.

  16. An On-Line Algorithm for Measuring the Translational and Rotational Velocities of a Table Tennis Ball

    Science.gov (United States)

    Liu, Chunfang; Hayakawa, Yoshikazu; Nakashima, Akira

    This paper proposes an on-line method for estimating both translational and rotational velocities of a table tennis ball by using only a few consecutive frames of image data which are sensed by two high speed cameras. In order to estimate the translational velocity, three-dimensional (3D) position of the ball's center at each instant of camera frame is obtained, where the on-line method of reconstructing the 3D position from the two-dimensional (2D) image data of two cameras is proposed without the pattern matching process. The proposed method of estimating the rotational velocity belongs to the image registration methods, where in order to avoid the pattern matching process too, a rotation model of the ball is used to make an estimated image data from an image data sensed at the previous instant of camera frame and then the estimated image data are compared with the image data sensed at the next instant of camera frame to obtain the most plausible rotational velocity by using the least square and the conjugate gradient method. The effectiveness of the proposed method is shown by some experimental results in the case of a ball rotated by a rotation machine as well as in the case of a flying ball shot from a catapult machine.

  17. Genetic algorithm based on structural decoding algorithm for Multi-Manned Assembly Line Balancing Problem%基于结构式译码遗传算法平衡多人共站装配线

    Institute of Scientific and Technical Information of China (English)

    童科娜; 徐克林; 郑永前

    2013-01-01

    To solve Multi-Manned Assembly Line Balancing Problem of type II(MM-ALBP II), a mathematical model, aiming to minimize the cycle time firstly, the number of parallel operators secondly and the workload variances between operators thirdly, is constructed. A genetic algorithm is developed. Especially in the decoding stage a two-phase structural decoding algorithm is designed, which first optimally assigns the tasks to the sequential stations, and then the cycle time is further decreased by merging stations. The computational results demonstrate the feasibility and outstanding character of the proposed algorithm.%针对多人共站装配线第二类平衡问题,以最小化装配线节拍为主要目标,最小化平行操作工人数为第一辅助目标,最小化工人负荷标准差为第二辅助目标构建数学模型,在此基础上,构建结构式译码遗传算法,其中特别设计了两阶段结构式译码算法,在第一阶段,求解给定作业序列在单人工作站条件下的最优分配方案,第二阶段将方案中的工作站进行合并,以使节拍最小化.通过算例验证算法的有效性和可行性.

  18. Algorithm of Restoring Field of View Lines Based on Multi-camera%多摄像机视野分界线恢复算法

    Institute of Scientific and Technical Information of China (English)

    薛翠红; 于洋; 粱艳; 于明

    2012-01-01

    In this paper, a kind of method about restoring multi-camera' field of view line is researched. Harris corner detection and homograph method should be done to restore the field of view line between the cameras. First, it extracts corner features in the image using Harris corner detection algorithm. Next the feature point matching is performed between the images' overlap region. Then the homograph is computed according to matching points between images. Finally the FOV lines are restored by the image boundary points and images' homograph. This method can restore the camerag field of view line, with accuracy and robustness.%研究了一种多摄像机的视野(Field of View,FOV)分界线恢复方法,利用Harris角点检测和单应矩阵的方法完成摄像机视野分界线恢复。用Harris角点检测算法提取图像中角点特征;在有重叠区域图像间进行特征点匹配,再根据匹配点计算图像间的单应矩阵;最后由图像的边界点及图像间的单应矩阵计算摄像机的FOV分界线。该方法能准确恢复摄像机的视野分界线,具有准确性和鲁棒性。

  19. Adaptive de-noising method based on wavelet and adaptive learning algorithm in on-line PD monitoring

    Institute of Scientific and Technical Information of China (English)

    王立欣; 诸定秋; 蔡惟铮

    2002-01-01

    It is an important step in the online monitoring of partial discharge (PD) to extract PD pulses from various background noises. An adaptive de-noising method is introduced for adaptive noise reduction during detection of PD pulses. This method is based on Wavelet Transform (WT) , and in the wavelet domain the noises decomposed at the levels are reduced by independent thresholds. Instead of the standard hard thresholding function, a new type of hard thresholding function with continuous derivative is employed by this method. For the selection of thresholds, an unsupervised learning algorithm based on gradient in a mean square error (MSE) is present to search for the optimal threshold for noise reduction, and the optimal threshold is selected when the minimum MSE is obtained. With the simulating signals and on-site experimental data processed by this method,it is shown that the background noises such as narrowband noises can be reduced efficiently. Furthermore, it is proved that in comparison with the conventional wavelet de-noising method the adaptive de-noising method has a better performance in keeping the pulses and is more adaptive when suppressing the background noises of PD signals.

  20. About Non-Line-Of-Sight Satellite Detection and Exclusion in a 3D Map-Aided Localization Algorithm

    Directory of Open Access Journals (Sweden)

    François Peyret

    2013-01-01

    Full Text Available Reliable GPS positioning in city environment is a key issue: actually, signals are prone to multipath, with poor satellite geometry in many streets. Using a 3D urban model to forecast satellite visibility in urban contexts in order to improve GPS localization is the main topic of the present article. A virtual image processing that detects and eliminates possible faulty measurements is the core of this method. This image is generated using the position estimated a priori by the navigation process itself, under road constraints. This position is then updated by measurements to line-of-sight satellites only. This closed-loop real-time processing has shown very first promising full-scale test results.

  1. A RANSAC-based line features detection algorithm for point clouds%一种基于RANSAC的点云特征线提取算法

    Institute of Scientific and Technical Information of China (English)

    李宝; 程志全; 党岗; 金士尧

    2013-01-01

    The line features extracted from point clouds are very useful in the processing of point clouds, including symmetry detection, surface reconstruction, the registration from image to point clouds, etc. However, the ability of existing line feature extraction approaches to deal with noise, outliers, and missing parts in the data is limited. On the other hand, RANSAC (RANdom SAmpling Consensus) based methods are widely used in the fields of image processing and 3D model processing because of the robustness. Thus, a RANSAC based line features detection algorithm is proposed in this paper, in which RANSAC is first used to detect all the possible planes in the point clouds, then to detect the line features from the boundary points of the parameterization field of the planes with global constraints. This method is designed especially for point clouds obtained from architectures or mechanical parts, in which planar features are dominant. Result of experiments validates the robustness of the proposed algorithm in handling with various defections of point clouds, e. g. noise, outliers, and data missing.%点云中提取的特征线在点云处理中具有重要的应用价值,已被应用于对称性检测、表面重建及点云与图像之间的注册等.然而,已有的点云特征线提取算法无法有效地处理点云中不可避免的噪声、外点和数据缺失,而随机采样一致性RANSAC由于具有较高的鲁棒性,在图像和三维模型处理中具有广泛的应用.为此,针对由建筑物或机械部件等具有平面特征的物体扫描得到的点云,提出了一种基于RANSAC的特征线提取算法.本算法首先基于RANSAC在点云中检测出多个平面,然后将每个平面参数化域的边界点作为候选,在这些候选点上再应用基于全局约束的RANSAC得到最终的特征线.实验结果表明,该算法对点云中的噪声、外点和数据缺失具有很强的鲁棒性.

  2. A error predictive control model of mechanical processing based on double hidden layers & L-M algorithm to adjusting BP neural networks%基于双隐层L-M算法的BP神经网络机械加工误差预测控制模型

    Institute of Scientific and Technical Information of China (English)

    龚立雄; 万勇; 侯智; 黄敏; 姜建华

    2013-01-01

    Analyzed error transmission and formation, and constructed double hidden L-M algorithm BP neural network predictive control model according to multiple input and output. The model is used to predict and control total amount of feed,first and second amount of feed by means of the rigidity of process system,workpiece hardness,before and after processing the radial error. Experimental and simulation shows that the model can guide the production, optimize the machining process, improve products quality. Finally, software system of error predictive control with LABVIEW and MATLAB realize predictive control visualization.%分析了误差的来源和传递方式,针对机械加工过程高度非线性、多输入和多输出的特点,构造了双隐层L-M算法BP神经网络误差预测控制模型.根据工艺系统刚度、工件硬度、加工前、后径向误差来预测控制刀具径向总进刀量、第一、第二次刀具径向进刀量,实验和仿真结果表明该模型能指导生产、优化加工工艺和提高产品质量.最后,采用LAB-VIEW软件和MATLAB软件编制了误差预测控制系统,实现了预测控制的可视化.

  3. Ontology-Based Automatically Hidden Web Portal Index

    Institute of Scientific and Technical Information of China (English)

    SONGHui; PANLeyun; MAFanyuan

    2004-01-01

    Many valuable databases on the Web have non-crawlable contents that are “hidden” behind the search forms. Information is available only by filling out HTML forms manually to query the underlying databases. For accessing data behind forms by automated agents, the critical task is having the corresponding query interfaces of the hidden databases that can be understood by machine. This paper presents an automatic approach of hidden Web portal index for various domains. It discovers and scrapes the query forms from Web pages based the tag-tree presentation, and then interpret them into the uniform mediate interfaces with the aid of domain ontology definition. To achieve high transformation accuracy, the domain ontology is also used to filter out the interfaces that are not related to the specific domain. The query interfaces gained finally represented with common concepts can automatically be indexed and retrieved by program. The experiments indicate that the algorithms used are efficient and the system is materially useful for information system or personalized Web search system to retrieval contents from hidden Web.

  4. Automatic categorization of web pages and user clustering with mixtures of hidden Markov models

    NARCIS (Netherlands)

    Ypma, A.; Heskes, T.M.

    2003-01-01

    We propose mixtures of hidden Markov models for modelling clickstreams of web surfers. Hence, the page categorization is learned from the data without the need for a (possibly cumbersome) manual categorization. We provide an EM algorithm for training a mixture of HMMs and show that additional static

  5. Computer simulation of time-resolved optical imaging of objects hidden in turbid media

    NARCIS (Netherlands)

    Michielsen, K.; Raedt, H. De; Przeslawski, J.; Garcia, N.

    1998-01-01

    We review research on time-resolved optical imaging of objects hidden in strongly scattering media, with emphasis on the application to breast cancer detection. A method is presented to simulate the propagation of light in turbid media. Based on a numerical algorithm to solve the time-dependent diff

  6. Automatic categorization of web pages and user clustering with mixtures of hidden Markov models

    NARCIS (Netherlands)

    Ypma, A.; Heskes, T.M.

    2003-01-01

    We propose mixtures of hidden Markov models for modelling clickstreams of web surfers. Hence, the page categorization is learned from the data without the need for a (possibly cumbersome) manual categorization. We provide an EM algorithm for training a mixture of HMMs and show that additional static

  7. Quantum hidden Markov models based on transition operation matrices

    Science.gov (United States)

    Cholewa, Michał; Gawron, Piotr; Głomb, Przemysław; Kurzyk, Dariusz

    2017-04-01

    In this work, we extend the idea of quantum Markov chains (Gudder in J Math Phys 49(7):072105 [3]) in order to propose quantum hidden Markov models (QHMMs). For that, we use the notions of transition operation matrices and vector states, which are an extension of classical stochastic matrices and probability distributions. Our main result is the Mealy QHMM formulation and proofs of algorithms needed for application of this model: Forward for general case and Vitterbi for a restricted class of QHMMs. We show the relations of the proposed model to other quantum HMM propositions and present an example of application.

  8. Hidden Markov models in automatic speech recognition

    Science.gov (United States)

    Wrzoskowicz, Adam

    1993-11-01

    This article describes a method for constructing an automatic speech recognition system based on hidden Markov models (HMMs). The author discusses the basic concepts of HMM theory and the application of these models to the analysis and recognition of speech signals. The author provides algorithms which make it possible to train the ASR system and recognize signals on the basis of distinct stochastic models of selected speech sound classes. The author describes the specific components of the system and the procedures used to model and recognize speech. The author discusses problems associated with the choice of optimal signal detection and parameterization characteristics and their effect on the performance of the system. The author presents different options for the choice of speech signal segments and their consequences for the ASR process. The author gives special attention to the use of lexical, syntactic, and semantic information for the purpose of improving the quality and efficiency of the system. The author also describes an ASR system developed by the Speech Acoustics Laboratory of the IBPT PAS. The author discusses the results of experiments on the effect of noise on the performance of the ASR system and describes methods of constructing HMM's designed to operate in a noisy environment. The author also describes a language for human-robot communications which was defined as a complex multilevel network from an HMM model of speech sounds geared towards Polish inflections. The author also added mandatory lexical and syntactic rules to the system for its communications vocabulary.

  9. Multiple parts process planning in serial–parallel flexible flow lines: part II—solution method based on genetic algorithms with fixed- and variable-length chromosomes

    OpenAIRE

    Musharavati, Farayi; Hamouda, Abdelmagid Salem

    2015-01-01

    Multiple parts process planning (MPPP) is a hard optimization problem that requires the rigor and intensity of metaheuristic-based algorithms such as simulated annealing and genetic algorithms. In this paper, a solution method for this problem is developed based on genetic algorithms. Genetic algorithms solve problems by exploring a given search space. To do this, a landscape over which the search traverses is constructed based on a number of algorithm choices. Key algorithm choices include (...

  10. 空间直线度误差新算法及其编程%On the new algorithm and program for space straight line error

    Institute of Scientific and Technical Information of China (English)

    林翔

    2012-01-01

    对于空间直线度误差,通过"最小二乘法"或其他现行的算法,可以得到基准直线,但精度欠佳。在获取初步基准直线的基础上,有意识地"移动"、"转动"该直线,把直线度误差计算值进一步下降,向"最小包容区域"逼近,最终获得的直线度误差值真正符合"最小条件"判定准则。%As to avoid decreasing errors in space straight line,we can use the least square method or other algorithms to get a basic straight one which is considered to be lack of accuracy.The solution to the improvement of the accuracy is to rotate the line so as to approach to the minimum area and make the error meet the principle of minimum conditions.

  11. On Throughput Improvement of Wireless Ad Hoc Networks with Hidden Nodes

    Science.gov (United States)

    Choi, Hong-Seok; Lim, Jong-Tae

    In this letter, we present the throughput analysis of the wireless ad hoc networks based on the IEEE 802.11 MAC (Medium Access Control). Especially, our analysis includes the case with the hidden node problem so that it can be applied to the multi-hop networks. In addition, we suggest a new channel access control algorithm to maximize the network throughput and show the usefulness of the proposed algorithm through simulations.

  12. Stator Current Harmonics Evaluation by Flexible Neural Network Method With Reconstruction Structure During Learning Step Based On CFE/SS Algorithm for ACEC Generator of Rey Power Plant

    Directory of Open Access Journals (Sweden)

    Mohammad Reza Yousefi

    2010-07-01

    Full Text Available One method for on-line fault detection in synchronous generator is stator current harmonics analysis. In this paper, the flexible neural network with reconstruction structure during learning has been used to evaluate the stator current harmonics in different loads. Generator modeling, finite element method and state space model make training set of flexible neural network. Many points from generator capability curve are used to complete this set. Flexible neural network that is used in this paper is a perception network with single hidden layer, flexible hidden layer neuron and back propagation algorithms. Results are show that the trained flexible neural network can identify stator current harmonics for desired load from the capability curve. The error is less than 10% in compared to the values obtained directly from the CFE-SS algorithms. The parameters of modeled generator are 43950(KVA, 11(kV, 3000(rpm, 50(HZ, (PF=0.5.

  13. Hidden Variable Theories and Quantum Nonlocality

    Science.gov (United States)

    Boozer, A. D.

    2009-01-01

    We clarify the meaning of Bell's theorem and its implications for the construction of hidden variable theories by considering an example system consisting of two entangled spin-1/2 particles. Using this example, we present a simplified version of Bell's theorem and describe several hidden variable theories that agree with the predictions of…

  14. Estimating an Activity Driven Hidden Markov Model

    OpenAIRE

    Meyer, David A.; Shakeel, Asif

    2015-01-01

    We define a Hidden Markov Model (HMM) in which each hidden state has time-dependent $\\textit{activity levels}$ that drive transitions and emissions, and show how to estimate its parameters. Our construction is motivated by the problem of inferring human mobility on sub-daily time scales from, for example, mobile phone records.

  15. Insight: Exploring Hidden Roles in Collaborative Play

    Directory of Open Access Journals (Sweden)

    Tricia Shi

    2015-06-01

    Full Text Available This paper looks into interaction modes between players in co-located, collaborative games. In particular, hidden traitor games, in which one or more players is secretly working against the group mission, has the effect of increasing paranoia and distrust between players, so this paper looks into the opposite of a hidden traitor – a hidden benefactor. Rather than sabotaging the group mission, the hidden benefactor would help the group achieve the end goal while still having a reason to stay hidden. The paper explores what games with such a role can look like and how the role changes player interactions. Finally, the paper addresses the divide between video game and board game interaction modes; hidden roles are not common within video games, but they are of growing prevalence in board games. This fact, combined with the exploration of hidden benefactors, reveals that hidden roles is a mechanic that video games should develop into in order to match board games’ complexity of player interaction modes.

  16. Helioscope bounds on hidden sector photons

    Energy Technology Data Exchange (ETDEWEB)

    Redondo, J.

    2007-12-15

    The flux of hypothetical ''hidden photons'' from the Sun is computed under the assumption that they interact with normal matter only through kinetic mixing with the ordinary standard model photon. Requiring that the exotic luminosity is smaller than the standard photon luminosity provides limits for the mixing parameter down to {chi} hidden photon mass. Furthermore, it is pointed point out that helioscopes looking for solar axions are also sensitive to hidden photons. The recent results of the CAST collaboration are used to further constrain the mixing parameter {chi} at low masses (m{sub {gamma}}{sub '}<1 eV) where the luminosity bound is weaker. In this regime the solar hidden photon ux has a sizable contribution of longitudinally polarized hidden photons of low energy which are invisible for current helioscopes. (orig.)

  17. Heating up the Galaxy with hidden photons

    Energy Technology Data Exchange (ETDEWEB)

    Dubovsky, Sergei [Center for Cosmology and Particle Physics, Department of Physics, New York University,New York, NY, 10003 (United States); Hernández-Chifflet, Guzmán [Center for Cosmology and Particle Physics, Department of Physics, New York University,New York, NY, 10003 (United States); Instituto de Física, Facultad de Ingeniería, Universidad de la República,Montevideo, 11300 (Uruguay)

    2015-12-29

    We elaborate on the dynamics of ionized interstellar medium in the presence of hidden photon dark matter. Our main focus is the ultra-light regime, where the hidden photon mass is smaller than the plasma frequency in the Milky Way. We point out that as a result of the Galactic plasma shielding direct detection of ultra-light photons in this mass range is especially challenging. However, we demonstrate that ultra-light hidden photon dark matter provides a powerful heating source for the ionized interstellar medium. This results in a strong bound on the kinetic mixing between hidden and regular photons all the way down to the hidden photon masses of order 10{sup −20} eV.

  18. Helioscope bounds on hidden sector photons

    Energy Technology Data Exchange (ETDEWEB)

    Redondo, J.

    2007-12-15

    The flux of hypothetical ''hidden photons'' from the Sun is computed under the assumption that they interact with normal matter only through kinetic mixing with the ordinary standard model photon. Requiring that the exotic luminosity is smaller than the standard photon luminosity provides limits for the mixing parameter down to {chi} hidden photon mass. Furthermore, it is pointed point out that helioscopes looking for solar axions are also sensitive to hidden photons. The recent results of the CAST collaboration are used to further constrain the mixing parameter {chi} at low masses (m{sub {gamma}}{sub '}<1 eV) where the luminosity bound is weaker. In this regime the solar hidden photon ux has a sizable contribution of longitudinally polarized hidden photons of low energy which are invisible for current helioscopes. (orig.)

  19. Hidden Web信息获取

    Institute of Scientific and Technical Information of China (English)

    陈珂; 陈小英; 徐科

    2007-01-01

    如今Web上越来越多的信息可以通过查询接口获得,但为了获取某Hidden Web站点的页面,用户不得不键入一系列的关键词.由于没有直接指向Hidden Web页面的静态链接,当前大多搜索引擎不能发现和索引这些页面.然而,研究表明,由Hidden Web站点提供的高质量的信息对许多用户来说非常有价值.文章通过研究针对特定类型的表单,建立一个有效的Hidden Web爬虫,以便获取Hidden Web后台数据库信息.

  20. Detecting hidden sources-STUK/HUT team

    Energy Technology Data Exchange (ETDEWEB)

    Nikkinen, M.; Aarnio, P. [Helsinki Univ. of Technology, Espoo (Finland); Honkamaa, T.; Tiilikainen, H. [Finnish Centre for Radiation and Nuclear Safety, Helsinki (Finland)

    1997-12-31

    The task of the team was to locate and to identify hidden sources in a specified area in Padasjoki Auttoinen village. The team used AB-420 helicopter of the Finnish Frontier Guard. The team had two measuring systems: HPGe system (relative efficiency 18%) and 5`x5` NaI system. The team found two sources in real-time and additional two sources after 24 h analysis time. After the locations and characteristics of the sources were announced it was found out that altogether six sources would have been possible to find using the measured data. The total number of sources was ten. The NaI detector was good at detecting and locating the sources and HPGe was most useful in identification and calculation of the activity estimates. The following development should be made: 1) larger detectors are needed, 2) the software has to be improved. (This has been performed after the exercise) and 3) the navigation must be based on DGPS. visual navigation causes easily gaps between the flight lines and some sources may not be detected. (au).

  1. Hidden scale invariance of metals

    DEFF Research Database (Denmark)

    Hummel, Felix; Kresse, Georg; Dyre, Jeppe C.

    2015-01-01

    available. Hidden scale invariance is demonstrated in detail for magnesium by showing invariance of structure and dynamics. Computed melting curves of period three metals follow curves with invariance (isomorphs). The experimental structure factor of magnesium is predicted by assuming scale invariant...... of metals making the condensed part of the thermodynamic phase diagram effectively one dimensional with respect to structure and dynamics. DFT computed density scaling exponents, related to the Grüneisen parameter, are in good agreement with experimental values for the 16 elements where reliable data were......Density functional theory (DFT) calculations of 58 liquid elements at their triple point show that most metals exhibit near proportionality between the thermal fluctuations of the virial and the potential energy in the isochoric ensemble. This demonstrates a general “hidden” scale invariance...

  2. Hidden Markov models for prediction of protein features

    DEFF Research Database (Denmark)

    Bystroff, Christopher; Krogh, Anders

    2008-01-01

    Hidden Markov Models (HMMs) are an extremely versatile statistical representation that can be used to model any set of one-dimensional discrete symbol data. HMMs can model protein sequences in many ways, depending on what features of the protein are represented by the Markov states. For protein...... structure prediction, states have been chosen to represent either homologous sequence positions, local or secondary structure types, or transmembrane locality. The resulting models can be used to predict common ancestry, secondary or local structure, or membrane topology by applying one of the two standard...... algorithms for comparing a sequence to a model. In this chapter, we review those algorithms and discuss how HMMs have been constructed and refined for the purpose of protein structure prediction....

  3. Best-first Model Merging for Hidden Markov Model Induction

    CERN Document Server

    Stolcke, A; Stolcke, Andreas; Omohundro, Stephen M.

    1994-01-01

    This report describes a new technique for inducing the structure of Hidden Markov Models from data which is based on the general `model merging' strategy (Omohundro 1992). The process begins with a maximum likelihood HMM that directly encodes the training data. Successively more general models are produced by merging HMM states. A Bayesian posterior probability criterion is used to determine which states to merge and when to stop generalizing. The procedure may be considered a heuristic search for the HMM structure with the highest posterior probability. We discuss a variety of possible priors for HMMs, as well as a number of approximations which improve the computational efficiency of the algorithm. We studied three applications to evaluate the procedure. The first compares the merging algorithm with the standard Baum-Welch approach in inducing simple finite-state languages from small, positive-only training samples. We found that the merging procedure is more robust and accurate, particularly with a small a...

  4. An extended ANN-based high speed accurate distance protection algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Sanaye-Pasand, M. [University of Tehran, Tehran (Iran). School of Electrical and Computer Engineering; Khorashadi-Zadeh, H. [University of Birjand, Birjand (Iran). Department of Electrical Engineering

    2006-07-15

    This paper presents a new neural network based transmission line distance protection module. The proposed module uses samples of voltage and current signals to learn the hidden relationship existing in the input patterns. Simulation studies are preformed and influence of changing system parameters such as fault resistance and source impedance is studied. Details of the design procedure and the results of performance studies with the proposed relay are given in the paper. In addition, an extended ANN-based technique which, uses the proposed neural network distance relay as its basis is described. The extended technique uses neutral current as its new input. Since, this technique adds a new dimension to the input decision space, the accuracy of the algorithm is increased. Various simulation studies are performed and capabilities of the extended algorithm are investigated. Performance studies results show that the proposed algorithm is fast and accurate. Some of the simulation studies are presented in the paper. (author)

  5. Hidden Markov Modeling for Weigh-In-Motion Estimation

    Energy Technology Data Exchange (ETDEWEB)

    Abercrombie, Robert K [ORNL; Ferragut, Erik M [ORNL; Boone, Shane [ORNL

    2012-01-01

    This paper describes a hidden Markov model to assist in the weight measurement error that arises from complex vehicle oscillations of a system of discrete masses. Present reduction of oscillations is by a smooth, flat, level approach and constant, slow speed in a straight line. The model uses this inherent variability to assist in determining the true total weight and individual axle weights of a vehicle. The weight distribution dynamics of a generic moving vehicle were simulated. The model estimation converged to within 1% of the true mass for simulated data. The computational demands of this method, while much greater than simple averages, took only seconds to run on a desktop computer.

  6. Statistical Inference in Hidden Markov Models Using k-Segment Constraints.

    Science.gov (United States)

    Titsias, Michalis K; Holmes, Christopher C; Yau, Christopher

    2016-01-02

    Hidden Markov models (HMMs) are one of the most widely used statistical methods for analyzing sequence data. However, the reporting of output from HMMs has largely been restricted to the presentation of the most-probable (MAP) hidden state sequence, found via the Viterbi algorithm, or the sequence of most probable marginals using the forward-backward algorithm. In this article, we expand the amount of information we could obtain from the posterior distribution of an HMM by introducing linear-time dynamic programming recursions that, conditional on a user-specified constraint in the number of segments, allow us to (i) find MAP sequences, (ii) compute posterior probabilities, and (iii) simulate sample paths. We collectively call these recursions k-segment algorithms and illustrate their utility using simulated and real examples. We also highlight the prospective and retrospective use of k-segment constraints for fitting HMMs or exploring existing model fits. Supplementary materials for this article are available online.

  7. Hidden torsion, 3-manifolds, and homology cobordism

    CERN Document Server

    Cha, Jae Choon

    2011-01-01

    This paper continues our exploration of homology cobordism of 3-manifolds using our recent results on Cheeger-Gromov rho-invariants associated to amenable representations. We introduce a new type of torsion in 3-manifold groups we call hidden torsion, and an algebraic approximation we call local hidden torsion. We construct infinitely many hyperbolic 3-manifolds which have local hidden torsion in the transfinite lower central subgroup. By realizing Cheeger-Gromov invariants over amenable groups, we show that our hyperbolic 3-manifolds are not pairwise homology cobordant, yet remain indistinguishable by any prior known homology cobordism invariants.

  8. A survey of hidden-variables theories

    CERN Document Server

    Belinfante, F J

    1973-01-01

    A Survey of Hidden-Variables Theories is a three-part book on the hidden-variable theories, referred in this book as """"theories of the first kind"""". Part I reviews the motives in developing different types of hidden-variables theories. The quest for determinism led to theories of the first kind; the quest for theories that look like causal theories when applied to spatially separated systems that interacted in the past led to theories of the second kind. Parts II and III further describe the theories of the first kind and second kind, respectively. This book is written to make the literat

  9. Visible Effects of Invisible Hidden Valley Radiation

    CERN Document Server

    Carloni, Lisa

    2010-01-01

    Assuming there is a new gauge group in a Hidden Valley, and a new type of radiation, can we observe it through its effect on the kinematic distributions of recoiling visible particles? Specifically, what are the collider signatures of radiation in a hidden sector? We address these questions using a generic SU(N)-like Hidden Valley model that we implement in Pythia. We find that in both the e+e- and the LHC cases the kinematic distributions of the visible particles can be significantly affected by the valley radiation. Without a proper understanding of such effects, inferred masses of "communicators" and of invisible particles can be substantially off.

  10. The generation of straight lines algorithms on hexagonal grid%六角网格上的直线生成算法

    Institute of Scientific and Technical Information of China (English)

    刘勇奎; 沈红; 周晓敏

    2001-01-01

    经研究表明,屏幕上的点最佳分布是按六角网格形式分布的。文中首先讨论了六角网格的特点,并从图形图象处理的角度分析了它的优点,然后提出了在六角网格上的直线生成算法,此算法仅用了整数运算。%Many studies have shown that the best disposition of a discrete set of points on the plane can be reached if the points are on a hexagonal grid. This paper first discusses character of the hexagonal grid and gives its advantages over the square grid in view of displaying graphics and images. Then it describes an algorithm for the generation of straight lines on hexagonal grid. It uses only integer arithmetic.

  11. Enhanced spectral resolution by high-dimensional NMR using the filter diagonalization method and "hidden" dimensions.

    Science.gov (United States)

    Meng, Xi; Nguyen, Bao D; Ridge, Clark; Shaka, A J

    2009-01-01

    High-dimensional (HD) NMR spectra have poorer digital resolution than low-dimensional (LD) spectra, for a fixed amount of experiment time. This has led to "reduced-dimensionality" strategies, in which several LD projections of the HD NMR spectrum are acquired, each with higher digital resolution; an approximate HD spectrum is then inferred by some means. We propose a strategy that moves in the opposite direction, by adding more time dimensions to increase the information content of the data set, even if only a very sparse time grid is used in each dimension. The full HD time-domain data can be analyzed by the filter diagonalization method (FDM), yielding very narrow resonances along all of the frequency axes, even those with sparse sampling. Integrating over the added dimensions of HD FDM NMR spectra reconstitutes LD spectra with enhanced resolution, often more quickly than direct acquisition of the LD spectrum with a larger number of grid points in each of the fewer dimensions. If the extra-dimensions do not appear in the final spectrum, and are used solely to boost information content, we propose the moniker hidden-dimension NMR. This work shows that HD peaks have unmistakable frequency signatures that can be detected as single HD objects by an appropriate algorithm, even though their patterns would be tricky for a human operator to visualize or recognize, and even if digital resolution in an HD FT spectrum is very coarse compared with natural line widths.

  12. Aligning the Hidden Curriculum of Management Education with PRME: An Inquiry-Based Framework

    Science.gov (United States)

    Blasco, Maribel

    2012-01-01

    This article argues that mainstreaming responsible management education in line with the Principles of Responsible Management Education (PRME) requires close attention to the hidden curriculum (HC), that is, the implicit dimensions of educational experiences. Altering formal curricular goals and content alone is not enough to improve students'…

  13. Algorithm for Predicting Protein Secondary Structure

    CERN Document Server

    Senapati, K K; Bhaumik, D

    2010-01-01

    Predicting protein structure from amino acid sequence is one of the most important unsolved problems of molecular biology and biophysics.Not only would a successful prediction algorithm be a tremendous advance in the understanding of the biochemical mechanisms of proteins, but, since such an algorithm could conceivably be used to design proteins to carry out specific functions.Prediction of the secondary structure of a protein (alpha-helix, beta-sheet, coil) is an important step towards elucidating its three dimensional structure as well as its function. In this research, we use different Hidden Markov models for protein secondary structure prediction. In this paper we have proposed an algorithm for predicting protein secondary structure. We have used Hidden Markov model with sliding window for secondary structure prediction.The secondary structure has three regular forms, for each secondary structural element we are using one Hidden Markov Model.

  14. Neural Network Control Optimization based on Improved Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Zhaoyin Zhang

    2013-08-01

    Full Text Available To clearly find the effect of factors in network classification, the classification process of PNN is analyzed in detail. The XOR problem is described by PNN and the elements in PNN are also studied. Through simulations and combined with genetic algorithm, a novel PNN supervised learning algorithm is proposed. This algorithm introduces the classification accuracy of training samples to the network parameter learning. It adopts genetic algorithm to train the PNN smoothing parameter and hidden centric vector. Then the effects of hidden neuron number, hidden centric vector and smoothing parameter in PNN are verified in the experiments. It is shown that this algorithm is superior to other PNN learning algorithms on classification effect.

  15. 基于Kriging算法的隧道衬砌稳定可靠度分析%Reliability Analysis of Tunnel Lining Stability Based on Kriging Algorithm

    Institute of Scientific and Technical Information of China (English)

    苏永华; 张鹏; 李翔

    2009-01-01

    According to the conventional theory of deformation pressure, the four-stage idea for evolution of deformation pressure of surrounding rock was proposed when adding the plasticity-separateness process to it. On this basis, the performance function for structural stability of tunnel lining was developed, and the fact that the reliability evaluation is hampered by the implicit form of performance function was indicated. By using the expression capability of variance function for the characteristics of random variables and the interpolation technique in Kriging algorithm as well as Latin hypercube sampling method, both the formulation of variance function for minimum support resistance of surrounding rock and the interpolation of performance function for tunnel lining stability were derived, and then the corresponding process for accomplishing abovementioned tasks was also presented,thus the problem of the calculation of reliability index in the context of the non-explicit expression of performance function for tunnel lining stability was resolved. In comparison with Monte-Carlo simulation method, the iterations of computation process in this illustrative example through the proposed procedure were alleviated to a large extent, the absolute error of failure probability is only 0.004 9% and the relative error is approximate to 2.523 8%, which demonstrates that the Kriging algorithm is not only efficient but also can fulfill the precision level of calculated results.%根据以往的变形压力理论增加了塑性-分离阶段,由此提出了围岩变形压力发展过程的4个阶段,并在上述理论基础上建立了隧道衬砌结构稳定的功能函数,指出了该功能函数的隐式特征在求解可靠度时的困难.利用Kriging算法中变异函数对随机变量特征的表达能力和Kriging算法的插值技术,结合拉丁超立方试验设计抽样方法,推导出了隧道围岩最小支护阻力的变异函数建立方法以及隧道衬砌结构稳

  16. Hidden systematics of fission channels

    Directory of Open Access Journals (Sweden)

    Schmidt Karl-Heinz

    2013-12-01

    of the fissioning system obey a hidden systematics that can be explained by the number of states in the vicinity of the outer fission barrier as a function of mass asymmetry, if the potential is constructed as the sum of the macroscopic contribution of the compound nucleus and empirically determined fragment shells. This hidden systematics also explains the transition from asymmetric to symmetric fission around 226Th and around 258Fm.

  17. Coding with partially hidden Markov models

    DEFF Research Database (Denmark)

    Forchhammer, Søren; Rissanen, J.

    1995-01-01

    Partially hidden Markov models (PHMM) are introduced. They are a variation of the hidden Markov models (HMM) combining the power of explicit conditioning on past observations and the power of using hidden states. (P)HMM may be combined with arithmetic coding for lossless data compression. A general...... 2-part coding scheme for given model order but unknown parameters based on PHMM is presented. A forward-backward reestimation of parameters with a redefined backward variable is given for these models and used for estimating the unknown parameters. Proof of convergence of this reestimation is given....... The PHMM structure and the conditions of the convergence proof allows for application of the PHMM to image coding. Relations between the PHMM and hidden Markov models (HMM) are treated. Results of coding bi-level images with the PHMM coding scheme is given. The results indicate that the PHMM can adapt...

  18. UV Photography Shows Hidden Sun Damage

    Science.gov (United States)

    ... mcat1=de12", ]; for (var c = 0; c UV photography shows hidden sun damage A UV photograph gives ... developing skin cancer and prematurely aged skin. Normal photography UV photography 18 months of age: This boy's ...

  19. Fibroid Tumors in Women: A Hidden Epidemic?

    Science.gov (United States)

    ... Issue Past Issues Fibroid Tumors in Women: A Hidden Epidemic? Past Issues / Spring 2007 Table of Contents ... fibroids@rics.bwh.harvard.edu , or visit our Web site: www.fibroids.net . You may also write ...

  20. Hidden Regular Variation: Detection and Estimation

    CERN Document Server

    Mitra, Abhimanyu

    2010-01-01

    Hidden regular variation defines a subfamily of distributions satisfying multivariate regular variation on $\\mathbb{E} = [0, \\infty]^d \\backslash \\{(0,0, ..., 0) \\} $ and models another regular variation on the sub-cone $\\mathbb{E}^{(2)} = \\mathbb{E} \\backslash \\cup_{i=1}^d \\mathbb{L}_i$, where $\\mathbb{L}_i$ is the $i$-th axis. We extend the concept of hidden regular variation to sub-cones of $\\mathbb{E}^{(2)}$ as well. We suggest a procedure of detecting the presence of hidden regular variation, and if it exists, propose a method of estimating the limit measure exploiting its semi-parametric structure. We exhibit examples where hidden regular variation yields better estimates of probabilities of risk sets.

  1. Off-line cursive handwriting recognition using neural networks

    Science.gov (United States)

    Yanikoglu, Berrin A.; Sandon, Peter A.

    1993-09-01

    Recognition of general unconstrained cursive handwriting remains largely unsolved. We present a system for recognizing off-line cursive English text guided in part by global characteristics of the handwriting. A new method for finding the letter boundaries based on minimizing a heuristic cost function is introduced. The function is evaluated at each point along the baseline of the word to find the best possible segmentation points. The algorithm tries to find all the actual letter boundaries and as few additional ones as possible. After a normalization step that removes much of the style variation, the normalized segments are classified by a one hidden layer feedforward neural network. The word recognition algorithms find the segmentation points that are likely to be extraneous and generates all possible final segmentations of the word by either keeping or removing them. Interpreting the output of the neural network as posterior probabilities of letters, it then finds the word that maximizes the probability of having produced the image, over a set of 30,000 words and over all the possible final segmentations. We compared two hypotheses for finding the likelihood of words that are in the lexicon and found that using a Hidden Markov Model of English is significantly less successful than assuming independence among the letters of a word. In our initial test involving multiple writers, 68% of the words were in the top three choices.

  2. Hidden Statistics Approach to Quantum Simulations

    Science.gov (United States)

    Zak, Michail

    2010-01-01

    Recent advances in quantum information theory have inspired an explosion of interest in new quantum algorithms for solving hard computational (quantum and non-quantum) problems. The basic principle of quantum computation is that the quantum properties can be used to represent structure data, and that quantum mechanisms can be devised and built to perform operations with this data. Three basic non-classical properties of quantum mechanics superposition, entanglement, and direct-product decomposability were main reasons for optimism about capabilities of quantum computers that promised simultaneous processing of large massifs of highly correlated data. Unfortunately, these advantages of quantum mechanics came with a high price. One major problem is keeping the components of the computer in a coherent state, as the slightest interaction with the external world would cause the system to decohere. That is why the hardware implementation of a quantum computer is still unsolved. The basic idea of this work is to create a new kind of dynamical system that would preserve the main three properties of quantum physics superposition, entanglement, and direct-product decomposability while allowing one to measure its state variables using classical methods. In other words, such a system would reinforce the advantages and minimize limitations of both quantum and classical aspects. Based upon a concept of hidden statistics, a new kind of dynamical system for simulation of Schroedinger equation is proposed. The system represents a modified Madelung version of Schroedinger equation. It preserves superposition, entanglement, and direct-product decomposability while allowing one to measure its state variables using classical methods. Such an optimal combination of characteristics is a perfect match for simulating quantum systems. The model includes a transitional component of quantum potential (that has been overlooked in previous treatment of the Madelung equation). The role of the

  3. Hidden Local Symmetry and Beyond

    CERN Document Server

    Yamawaki, Koichi

    2016-01-01

    Gerry Brown was a godfather of our hidden local symmetry (HLS) for the vector meson from the birth of the theory throughout his life. The HLS is originated from very nature of the nonlinear realization of the symmetry G based on the manifold G/H, and thus is universal to any physics based on the nonlinear realization. Here I focus on the Higgs Lagrangian of the Standard Model (SM), which is shown to be equivalent to the nonlinear sigma model based on G/H= SU(2)_L x SU(2)_R/SU(2)_V with additional symmetry, the nonlinearly realized scale symmetry. Then the SM does have a dynamical gauge boson of the SU(2)_V HLS, "SM rho meson", in addition to the Higgs as a pseudo dilaton as well as the NG bosons to be absorbed into the W and Z. Based on the recent work done with S. Matsuzaki and H. Ohki, I discuss a novel possibility that the SM rho meson acquires kinetic term by the SM dynamics itself, which then stabilizes the skyrmion dormant in the SM as a viable candidate for the dark matter, what we call "Dark SM skyrmi...

  4. Hidden local symmetry and beyond

    Science.gov (United States)

    Yamawaki, Koichi

    Gerry Brown was a godfather of our hidden local symmetry (HLS) for the vector meson from the birth of the theory throughout his life. The HLS is originated from very nature of the nonlinear realization of the symmetry G based on the manifold G/H, and thus is universal to any physics based on the nonlinear realization. Here, I focus on the Higgs Lagrangian of the Standard Model (SM), which is shown to be equivalent to the nonlinear sigma model based on G/H = SU(2)L × SU(2)R/SU(2)V with additional symmetry, the nonlinearly-realized scale symmetry. Then, the SM does have a dynamical gauge boson of the SU(2)V HLS, "SM ρ meson", in addition to the Higgs as a pseudo-dilaton as well as the NG bosons to be absorbed in to the W and Z. Based on the recent work done with Matsuzaki and Ohki, I discuss a novel possibility that the SM ρ meson acquires kinetic term by the SM dynamics itself, which then stabilizes the skyrmion dormant in the SM as a viable candidate for the dark matter, what we call "dark SM skyrmion (DSMS)".

  5. Constraining solar hidden photons using HPGe detector

    Energy Technology Data Exchange (ETDEWEB)

    Horvat, R.; Kekez, D., E-mail: Dalibor.Kekez@irb.hr; Krčmar, M.; Krečak, Z.; Ljubičić, A.

    2013-04-25

    In this Letter we report on the results of our search for photons from a U(1) gauge factor in the hidden sector of the full theory. With our experimental setup we observe the single spectrum in a HPGe detector arising as a result of the photoelectric-like absorption of hidden photons emitted from the Sun on germanium atoms inside the detector. The main ingredient of the theory used in our analysis, a severely constrained kinetic mixing from the two U(1) gauge factors and massive hidden photons, entails both photon into hidden state oscillations and a minuscule coupling of hidden photons to visible matter, of which the latter our experimental setup has been designed to observe. On a theoretical side, full account was taken of the effects of refraction and damping of photons while propagating in Sun's interior as well as in the detector. We exclude hidden photons with kinetic couplings χ>(2.2×10{sup −13}–3×10{sup −7}) in the mass region 0.2 eV≲m{sub γ{sup ′}}≲30 keV. Our constraints on the mixing parameter χ in the mass region from 20 eV up to 15 keV prove even slightly better then those obtained recently by using data from the CAST experiment, albeit still somewhat weaker than those obtained from solar and HB stars lifetime arguments.

  6. Behavior of Supercooled Aqueous Solutions Stemming from Hidden Liquid-Liquid Transition in Water

    OpenAIRE

    Biddle, John W.; Holten, Vincent; Anisimov, Mikhail A.

    2014-01-01

    A popular hypothesis that explains the anomalies of supercooled water is the existence of a metastable liquid-liquid transition hidden below the line of homogeneous nucleation. If this transition exists and if it is terminated by a critical point, the addition of a solute should generate a line of liquid-liquid critical points emanating from the critical point of pure metastable water. We have analyzed thermodynamic consequences of this scenario. In particular, we consider the behavior of two...

  7. Single-hidden-layer feed-forward quantum neural network based on Grover learning.

    Science.gov (United States)

    Liu, Cheng-Yi; Chen, Chein; Chang, Ching-Ter; Shih, Lun-Min

    2013-09-01

    In this paper, a novel single-hidden-layer feed-forward quantum neural network model is proposed based on some concepts and principles in the quantum theory. By combining the quantum mechanism with the feed-forward neural network, we defined quantum hidden neurons and connected quantum weights, and used them as the fundamental information processing unit in a single-hidden-layer feed-forward neural network. The quantum neurons make a wide range of nonlinear functions serve as the activation functions in the hidden layer of the network, and the Grover searching algorithm outstands the optimal parameter setting iteratively and thus makes very efficient neural network learning possible. The quantum neuron and weights, along with a Grover searching algorithm based learning, result in a novel and efficient neural network characteristic of reduced network, high efficient training and prospect application in future. Some simulations are taken to investigate the performance of the proposed quantum network and the result show that it can achieve accurate learning.

  8. The Hidden Subgroup Problem in Affine Groups Basis Selection in Fourier Sampling

    CERN Document Server

    Moore, Cristopher; Russell, A; Schulman, L; Moore, Cristopher; Rockmore, Daniel; Russell, Alexander; Schulman, Leonard

    2002-01-01

    Some quantum algorithms, including Shor's celebrated factoring and discrete log algorithms, proceed by reduction to a hidden subgroup problem, in which a subgroup H of a group G must be determined from a quantum state uniformly supported on a left coset of H. These hidden subgroup problems are then solved by Fourier sampling: the quantum Fourier transform of the state is computed and measured. When the underlying group is non-Abelian, two important variants of the Fourier sampling paradigm have been identified: the weak standard method, where only representation names are measured, and the strong standard method, where full measurement occurs. It has remained open whether the strong standard method is indeed stronger, that is, whether there are hidden subgroups which can be reconstructed via the strong method by not by the weak, or any other known, method. In this article, we settle this question in the affirmative. We show that hidden subgroups of semidirect products of Z/p by Z/q, where q | (p-1) and q >= p...

  9. Landslide Displacement Prediction With Uncertainty Based on Neural Networks With Random Hidden Weights.

    Science.gov (United States)

    Lian, Cheng; Zeng, Zhigang; Yao, Wei; Tang, Huiming; Chen, Chun Lung Philip

    2016-12-01

    In this paper, we propose a new approach to establish a landslide displacement forecasting model based on artificial neural networks (ANNs) with random hidden weights. To quantify the uncertainty associated with the predictions, a framework for probabilistic forecasting of landslide displacement is developed. The aim of this paper is to construct prediction intervals (PIs) instead of deterministic forecasting. A lower-upper bound estimation (LUBE) method is adopted to construct ANN-based PIs, while a new single hidden layer feedforward ANN with random hidden weights for LUBE is proposed. Unlike the original implementation of LUBE, the input weights and hidden biases of the ANN are randomly chosen, and only the output weights need to be adjusted. Combining particle swarm optimization (PSO) and gravitational search algorithm (GSA), a hybrid evolutionary algorithm, PSOGSA, is utilized to optimize the output weights. Furthermore, a new ANN objective function, which combines a modified combinational coverage width-based criterion with one-norm regularization, is proposed. Two benchmark data sets and two real-world landslide data sets are presented to illustrate the capability and merit of our method. Experimental results reveal that the proposed method can construct high-quality PIs.

  10. Optical character recognition of handwritten Arabic using hidden Markov models

    Energy Technology Data Exchange (ETDEWEB)

    Aulama, Mohannad M. [University of Jordan; Natsheh, Asem M. [University of Jordan; Abandah, Gheith A. [University of Jordan; Olama, Mohammed M [ORNL

    2011-01-01

    The problem of optical character recognition (OCR) of handwritten Arabic has not received a satisfactory solution yet. In this paper, an Arabic OCR algorithm is developed based on Hidden Markov Models (HMMs) combined with the Viterbi algorithm, which results in an improved and more robust recognition of characters at the sub-word level. Integrating the HMMs represents another step of the overall OCR trends being currently researched in the literature. The proposed approach exploits the structure of characters in the Arabic language in addition to their extracted features to achieve improved recognition rates. Useful statistical information of the Arabic language is initially extracted and then used to estimate the probabilistic parameters of the mathematical HMM. A new custom implementation of the HMM is developed in this study, where the transition matrix is built based on the collected large corpus, and the emission matrix is built based on the results obtained via the extracted character features. The recognition process is triggered using the Viterbi algorithm which employs the most probable sequence of sub-words. The model was implemented to recognize the sub-word unit of Arabic text raising the recognition rate from being linked to the worst recognition rate for any character to the overall structure of the Arabic language. Numerical results show that there is a potentially large recognition improvement by using the proposed algorithms.

  11. Optical character recognition of handwritten Arabic using hidden Markov models

    Science.gov (United States)

    Aulama, Mohannad M.; Natsheh, Asem M.; Abandah, Gheith A.; Olama, Mohammed M.

    2011-04-01

    The problem of optical character recognition (OCR) of handwritten Arabic has not received a satisfactory solution yet. In this paper, an Arabic OCR algorithm is developed based on Hidden Markov Models (HMMs) combined with the Viterbi algorithm, which results in an improved and more robust recognition of characters at the sub-word level. Integrating the HMMs represents another step of the overall OCR trends being currently researched in the literature. The proposed approach exploits the structure of characters in the Arabic language in addition to their extracted features to achieve improved recognition rates. Useful statistical information of the Arabic language is initially extracted and then used to estimate the probabilistic parameters of the mathematical HMM. A new custom implementation of the HMM is developed in this study, where the transition matrix is built based on the collected large corpus, and the emission matrix is built based on the results obtained via the extracted character features. The recognition process is triggered using the Viterbi algorithm which employs the most probable sequence of sub-words. The model was implemented to recognize the sub-word unit of Arabic text raising the recognition rate from being linked to the worst recognition rate for any character to the overall structure of the Arabic language. Numerical results show that there is a potentially large recognition improvement by using the proposed algorithms.

  12. 基于机载激光点云数据的电力线自动提取算法%An Automated Extraction Algorithm of Power Lines Based on Airborne Laser Scanning Data

    Institute of Scientific and Technical Information of China (English)

    尹辉增; 孙轩; 聂振钢

    2012-01-01

    An efficient automated extraction algorithm of power lines based on Airborne Laser Scanning ( ALS) data was put forward. The algorithm adopted point clouds classification based on region part height histogram distribution patterns,lines extraction method with global direction feature in Hough space, mathematical estimating method of hanging point position and local partitioned polynomial fitting method. Four key problems were solved by use of the algorithm,namely, point clouds classification, plane position extraction of power lines,power line hanging points extraction and power line fitting. Finally,the applicability of the algorithm was proved by some practical engineering data%设计并开发了一种从机载激光扫描的三维点云数据中自动提取电力线的算法,采用局部高程分布直方图模式分类滤波、Hough特征空间中全局方向特征优先的线特征提取、悬挂点位置数学推算和局部分段多项式拟合的方法,有效解决了电力线提取过程中电力线点云与电塔点云的自动分类、电力线平面位置提取、电力线悬挂点提取、电力线拟合问题.最后通过实际的工程数据验证了该算法的实用性.

  13. Systematic Analysis of Majorization in Quantum Algorithms

    CERN Document Server

    Orus, R; Martín-Delgado, M A; Orus, Roman; Latorre, Jose I.; Martin-Delgado, Miguel A.

    2002-01-01

    Motivated by the need to uncover some underlying mathematical structure of efficient quantum computation, we carry out a systematic analysis of a wide variety of quantum algorithms from the majorization theory point of view. We conclude that step-by-step majorization is found in the known instances of efficient algorithms, namely in the quantum Fourier transform, in Grover's algorithm, in the hidden affine function problem, in searching by quantum adiabatic evolution and in deterministic quantum walks in continuous time solving a classically hard problem. On the other hand, the optimal quantum algorithm for parity determination, which does not provide any computational speed up, does not show step-by-step majorization. Furthermore, the efficient quantum algorithm for the hidden affine function problem does not make use of any entanglement while it does obey majorization. All the above results give support to a step-by-step Majorization Principle necessary for efficient quantum computation.

  14. Probing hidden sector photons through the Higgs window

    Energy Technology Data Exchange (ETDEWEB)

    Ahlers, M. [Oxford Univ. (United Kingdom). Rudolf Peierls Centre for Theoretical Physics; Jaeckel, J. [Durham Univ. (United Kingdom). Inst. for Particle Physics and Phenomenology; Redondo, J.; Ringwald, A. [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany)

    2008-07-15

    We investigate the possibility that a (light) hidden sector extra photon receives its mass via spontaneous symmetry breaking of a hidden sector Higgs boson, the so-called hidden-Higgs. The hidden-photon can mix with the ordinary photon via a gauge kinetic mixing term. The hidden-Higgs can couple to the Standard Model Higgs via a renormalizable quartic term - sometimes called the Higgs Portal. We discuss the implications of this light hidden-Higgs in the context of laser polarization and light-shining-through-the-wall experiments as well as cosmological, astrophysical, and non-Newtonian force measurements. For hidden-photons receiving their mass from a hidden-Higgs we find in the small mass regime significantly stronger bounds than the bounds on massive hidden sector photons alone. (orig.)

  15. Optimal State-Space Reduction for Pedigree Hidden Markov Models

    CERN Document Server

    Kirkpatrick, Bonnie

    2012-01-01

    To analyze whole-genome genetic data inherited in families, the likelihood is typically obtained from a Hidden Markov Model (HMM) having a state space of 2^n hidden states where n is the number of meioses or edges in the pedigree. There have been several attempts to speed up this calculation by reducing the state-space of the HMM. One of these methods has been automated in a calculation that is more efficient than the naive HMM calculation; however, that method treats a special case and the efficiency gain is available for only those rare pedigrees containing long chains of single-child lineages. The other existing state-space reduction method treats the general case, but the existing algorithm has super-exponential running time. We present three formulations of the state-space reduction problem, two dealing with groups and one with partitions. One of these problems, the maximum isometry group problem was discussed in detail by Browning and Browning. We show that for pedigrees, all three of these problems hav...

  16. Lepton mixing from the hidden sector

    CERN Document Server

    Ludl, P O

    2015-01-01

    Experimental results indicate a possible relation between the lepton and quark mixing matrices of the form U_PMNS \\approx V_CKM^\\dagger U_X, where U_X is a matrix with special structure related to the mechanism of neutrino mass generation. We propose a framework which can realize such a relation. The main ingredients of the framework are the double seesaw mechanism, SO(10) Grand Unification and a hidden sector of theory. The latter is composed of singlets (fermions and bosons) of the GUT symmetry with masses between the GUT and Planck scale. The interactions in this sector obey certain symmetries G_hidden. We explore the conditions under which symmetries G_hidden can produce flavour structures in the visible sector. Here the key elements are the basis-fixing symmetry and mediators which communicate information about properties of the hidden sector to the visible one. The interplay of SO(10) symmetry, basis-fixing symmetry identified as Z2 x Z2 and G_hidden can lead to the required form of U_X. A different kin...

  17. Fitting Hidden Markov Models to Psychological Data

    Directory of Open Access Journals (Sweden)

    Ingmar Visser

    2002-01-01

    Full Text Available Markov models have been used extensively in psychology of learning. Applications of hidden Markov models are rare however. This is partially due to the fact that comprehensive statistics for model selection and model assessment are lacking in the psychological literature. We present model selection and model assessment statistics that are particularly useful in applying hidden Markov models in psychology. These statistics are presented and evaluated by simulation studies for a toy example. We compare AIC, BIC and related criteria and introduce a prediction error measure for assessing goodness-of-fit. In a simulation study, two methods of fitting equality constraints are compared. In two illustrative examples with experimental data we apply selection criteria, fit models with constraints and assess goodness-of-fit. First, data from a concept identification task is analyzed. Hidden Markov models provide a flexible approach to analyzing such data when compared to other modeling methods. Second, a novel application of hidden Markov models in implicit learning is presented. Hidden Markov models are used in this context to quantify knowledge that subjects express in an implicit learning task. This method of analyzing implicit learning data provides a comprehensive approach for addressing important theoretical issues in the field.

  18. Probing Hidden Sector Photons through the Higgs Window.

    OpenAIRE

    Ahlers, M.; Jaeckel, J; Redondo, J.; Ringwald, A.

    2008-01-01

    We investigate the possibility that a (light) hidden sector extra photon receives its mass via spontaneous symmetry breaking of a hidden sector Higgs boson, the so-called hidden-Higgs. The hidden-photon can mix with the ordinary photon via a gauge kinetic mixing term. The hidden-Higgs can couple to the Standard Model Higgs via a renormalizable quartic term - sometimes called the Higgs Portal. We discuss the implications of this light hidden-Higgs in the context of laser polarization and light...

  19. The Hierarchical Dirichlet Process Hidden Semi-Markov Model

    CERN Document Server

    Johnson, Matthew J

    2012-01-01

    There is much interest in the Hierarchical Dirichlet Process Hidden Markov Model (HDP-HMM) as a natural Bayesian nonparametric extension of the traditional HMM. However, in many settings the HDP-HMM's strict Markovian constraints are undesirable, particularly if we wish to learn or encode non-geometric state durations. We can extend the HDP-HMM to capture such structure by drawing upon explicit-duration semi- Markovianity, which has been developed in the parametric setting to allow construction of highly interpretable models that admit natural prior information on state durations. In this paper we introduce the explicitduration HDP-HSMM and develop posterior sampling algorithms for efficient inference in both the direct-assignment and weak-limit approximation settings. We demonstrate the utility of the model and our inference methods on synthetic data as well as experiments on a speaker diarization problem and an example of learning the patterns in Morse code.

  20. A context dependent pair hidden Markov model for statistical alignment

    CERN Document Server

    Arribas-Gil, Ana

    2011-01-01

    This article proposes a novel approach to statistical alignment of nucleotide sequences by introducing a context dependent structure on the substitution process in the underlying evolutionary model. We propose to estimate alignments and context dependent mutation rates relying on the observation of two homologous sequences. The procedure is based on a generalized pair-hidden Markov structure, where conditional on the alignment path, the nucleotide sequences follow a Markov distribution. We use a stochastic approximation expectation maximization (saem) algorithm to give accurate estimators of parameters and alignments. We provide results both on simulated data and vertebrate genomes, which are known to have a high mutation rate from CG dinucleotide. In particular, we establish that the method improves the accuracy of the alignment of a human pseudogene and its functional gene.

  1. Self-accelerating Massive Gravity: Hidden Constraints and Characteristics

    CERN Document Server

    Motloch, Pavel; Motohashi, Hayato

    2016-01-01

    Self-accelerating backgrounds in massive gravity provide an arena to explore the Cauchy problem for derivatively coupled fields that obey complex constraints which reduce the phase space degrees of freedom. We present here an algorithm based on the Kronecker form of a matrix pencil that finds all hidden constraints, for example those associated with derivatives of the equations of motion, and characteristic curves for any 1+1 dimensional system of linear partial differential equations. With the Regge-Wheeler-Zerilli decomposition of metric perturbations into angular momentum and parity states, this technique applies to fully 3+1 dimensional perturbations of massive gravity around any isotropic self-accelerating background. Five spin modes of the massive graviton propagate once the constraints are imposed: two spin-2 modes with luminal characteristics present in the massless theory as well as two spin-1 modes and one spin-0 mode. Although the new modes all possess the same - typically spacelike - characteristi...

  2. A Dependent Hidden Markov Model of Credit Quality

    Directory of Open Access Journals (Sweden)

    Małgorzata Wiktoria Korolkiewicz

    2012-01-01

    Full Text Available We propose a dependent hidden Markov model of credit quality. We suppose that the "true" credit quality is not observed directly but only through noisy observations given by posted credit ratings. The model is formulated in discrete time with a Markov chain observed in martingale noise, where "noise" terms of the state and observation processes are possibly dependent. The model provides estimates for the state of the Markov chain governing the evolution of the credit rating process and the parameters of the model, where the latter are estimated using the EM algorithm. The dependent dynamics allow for the so-called "rating momentum" discussed in the credit literature and also provide a convenient test of independence between the state and observation dynamics.

  3. Supersymmetric leptogenesis and light hidden sectors

    CERN Document Server

    Weniger, Christoph

    2010-01-01

    Thermal leptogenesis and supergravity are attractive scenarios for physics beyond the standard model. However, it is well known that the super-weak interaction of the gravitino often leads to problems with primordial nucleosynthesis in the standard scenario of matter parity conserving MSSM + three right-handed neutrinos. We will present and compare two related solutions to these problems: 1) The conflict between BBN and leptogenesis can be avoided in presence of a hidden sector with light supersymmetric particles which open new decay channels for the dangerous long-lived particles. 2) If there is a condensate in the hidden sector, such additional decay channels can be alternatively opened by dynamical breaking of matter parity in the hidden sector.

  4. A novel extended kernel recursive least squares algorithm.

    Science.gov (United States)

    Zhu, Pingping; Chen, Badong; Príncipe, José C

    2012-08-01

    In this paper, a novel extended kernel recursive least squares algorithm is proposed combining the kernel recursive least squares algorithm and the Kalman filter or its extensions to estimate or predict signals. Unlike the extended kernel recursive least squares (Ex-KRLS) algorithm proposed by Liu, the state model of our algorithm is still constructed in the original state space and the hidden state is estimated using the Kalman filter. The measurement model used in hidden state estimation is learned by the kernel recursive least squares algorithm (KRLS) in reproducing kernel Hilbert space (RKHS). The novel algorithm has more flexible state and noise models. We apply this algorithm to vehicle tracking and the nonlinear Rayleigh fading channel tracking, and compare the tracking performances with other existing algorithms.

  5. PELACAKAN DAN PENGENALAN WAJAH MENGGUNAKAN METODE EMBEDDED HIDDEN MARKOV MODELS

    Directory of Open Access Journals (Sweden)

    Arie Wirawan Margono

    2004-01-01

    Full Text Available Tracking and recognizing human face becomes one of the important research subjects nowadays, where it is applicable in security system like room access, surveillance, as well as searching for person identity in police database. Because of applying in security case, it is necessary to have robust system for certain conditions such as: background influence, non-frontal face pose of male or female in different age and race. The aim of this research is to develop software which combines human face tracking using CamShift algorithm and face recognition system using Embedded Hidden Markov Models. The software uses video camera (webcam for real-time input, video AVI for dynamic input, and image file for static input. The software uses Object Oriented Programming (OOP coding style with C++ programming language, Microsoft Visual C++ 6.0® compiler, and assisted by some libraries of Intel Image Processing Library (IPL and Intel Open Source Computer Vision (OpenCV. System testing shows that object tracking based on skin complexion using CamShift algorithm comes out well, for tracking of single or even two face objects at once. Human face recognition system using Embedded Hidden Markov Models method has reach accuracy percentage of 82.76%, using 341 human faces in database that consists of 31 individuals with 11 poses and 29 human face testers. Abstract in Bahasa Indonesia : Pelacakan dan pengenalan wajah manusia merupakan salah satu bidang yang cukup berkembang dewasa ini, dimana aplikasi dapat diterapkan dalam bidang keamanan (security system seperti ijin akses masuk ruangan, pengawasan lokasi (surveillance, maupun pencarian identitas individu pada database kepolisian. Karena diterapkan dalam kasus keamanan, dibutuhkan sistem yang handal terhadap beberapa kondisi, seperti: pengaruh latar belakang, pose wajah non-frontal terhadap pria maupun wanita dalam perbedaan usia dan ras. Tujuan penelitiam ini adalah untuk membuat perangkat lunak yang menggabungkan

  6. A Fast SVD-Hidden-nodes based Extreme Learning Machine for Large-Scale Data Analytics.

    Science.gov (United States)

    Deng, Wan-Yu; Bai, Zuo; Huang, Guang-Bin; Zheng, Qing-Hua

    2016-05-01

    Big dimensional data is a growing trend that is emerging in many real world contexts, extending from web mining, gene expression analysis, protein-protein interaction to high-frequency financial data. Nowadays, there is a growing consensus that the increasing dimensionality poses impeding effects on the performances of classifiers, which is termed as the "peaking phenomenon" in the field of machine intelligence. To address the issue, dimensionality reduction is commonly employed as a preprocessing step on the Big dimensional data before building the classifiers. In this paper, we propose an Extreme Learning Machine (ELM) approach for large-scale data analytic. In contrast to existing approaches, we embed hidden nodes that are designed using singular value decomposition (SVD) into the classical ELM. These SVD nodes in the hidden layer are shown to capture the underlying characteristics of the Big dimensional data well, exhibiting excellent generalization performances. The drawback of using SVD on the entire dataset, however, is the high computational complexity involved. To address this, a fast divide and conquer approximation scheme is introduced to maintain computational tractability on high volume data. The resultant algorithm proposed is labeled here as Fast Singular Value Decomposition-Hidden-nodes based Extreme Learning Machine or FSVD-H-ELM in short. In FSVD-H-ELM, instead of identifying the SVD hidden nodes directly from the entire dataset, SVD hidden nodes are derived from multiple random subsets of data sampled from the original dataset. Comprehensive experiments and comparisons are conducted to assess the FSVD-H-ELM against other state-of-the-art algorithms. The results obtained demonstrated the superior generalization performance and efficiency of the FSVD-H-ELM. Copyright © 2016 Elsevier Ltd. All rights reserved.

  7. Prediction of protein binding sites in protein structures using hidden Markov support vector machine

    Directory of Open Access Journals (Sweden)

    Lin Lei

    2009-11-01

    Full Text Available Abstract Background Predicting the binding sites between two interacting proteins provides important clues to the function of a protein. Recent research on protein binding site prediction has been mainly based on widely known machine learning techniques, such as artificial neural networks, support vector machines, conditional random field, etc. However, the prediction performance is still too low to be used in practice. It is necessary to explore new algorithms, theories and features to further improve the performance. Results In this study, we introduce a novel machine learning model hidden Markov support vector machine for protein binding site prediction. The model treats the protein binding site prediction as a sequential labelling task based on the maximum margin criterion. Common features derived from protein sequences and structures, including protein sequence profile and residue accessible surface area, are used to train hidden Markov support vector machine. When tested on six data sets, the method based on hidden Markov support vector machine shows better performance than some state-of-the-art methods, including artificial neural networks, support vector machines and conditional random field. Furthermore, its running time is several orders of magnitude shorter than that of the compared methods. Conclusion The improved prediction performance and computational efficiency of the method based on hidden Markov support vector machine can be attributed to the following three factors. Firstly, the relation between labels of neighbouring residues is useful for protein binding site prediction. Secondly, the kernel trick is very advantageous to this field. Thirdly, the complexity of the training step for hidden Markov support vector machine is linear with the number of training samples by using the cutting-plane algorithm.

  8. Hidden Markov models estimation and control

    CERN Document Server

    Elliott, Robert J; Moore, John B

    1995-01-01

    As more applications are found, interest in Hidden Markov Models continues to grow. Following comments and feedback from colleagues, students and other working with Hidden Markov Models the corrected 3rd printing of this volume contains clarifications, improvements and some new material, including results on smoothing for linear Gaussian dynamics. In Chapter 2 the derivation of the basic filters related to the Markov chain are each presented explicitly, rather than as special cases of one general filter. Furthermore, equations for smoothed estimates are given. The dynamics for the Kalman filte

  9. Hidden simplicity of gauge theory amplitudes

    Energy Technology Data Exchange (ETDEWEB)

    Drummond, J M, E-mail: drummond@lapp.in2p3.f [LAPTH, Universite de Savoie, CNRS, B.P. 110, F-74941 Annecy-le-Vieux, Cedex (France)

    2010-11-07

    These notes were given as lectures at the CERN Winter School on Supergravity, Strings and Gauge Theory 2010. We describe the structure of scattering amplitudes in gauge theories, focussing on the maximally supersymmetric theory to highlight the hidden symmetries which appear. Using the Britto, Cachzo, Feng and Witten (BCFW) recursion relations we solve the tree-level S-matrix in N=4 super Yang-Mills theory and describe how it produces a sum of invariants of a large symmetry algebra. We review amplitudes in the planar theory beyond tree level, describing the connection between amplitudes and Wilson loops, and discuss the implications of the hidden symmetries.

  10. Hidden simplicity of gauge theory amplitudes

    Science.gov (United States)

    Drummond, J. M.

    2010-11-01

    These notes were given as lectures at the CERN Winter School on Supergravity, Strings and Gauge Theory 2010. We describe the structure of scattering amplitudes in gauge theories, focussing on the maximally supersymmetric theory to highlight the hidden symmetries which appear. Using the Britto, Cachzo, Feng and Witten (BCFW) recursion relations we solve the tree-level S-matrix in \\ {N}=4 super Yang-Mills theory and describe how it produces a sum of invariants of a large symmetry algebra. We review amplitudes in the planar theory beyond tree level, describing the connection between amplitudes and Wilson loops, and discuss the implications of the hidden symmetries.

  11. Hidden neural networks: application to speech recognition

    DEFF Research Database (Denmark)

    Riis, Søren Kamaric

    1998-01-01

    We evaluate the hidden neural network HMM/NN hybrid on two speech recognition benchmark tasks; (1) task independent isolated word recognition on the Phonebook database, and (2) recognition of broad phoneme classes in continuous speech from the TIMIT database. It is shown how hidden neural networks...... (HNNs) with much fewer parameters than conventional HMMs and other hybrids can obtain comparable performance, and for the broad class task it is illustrated how the HNN can be applied as a purely transition based system, where acoustic context dependent transition probabilities are estimated by neural...

  12. Dark Radiation from a hidden U(1)

    CERN Document Server

    Vogel, Hendrik

    2015-01-01

    We discuss the impact of a hidden sector consisting of Minicharged Particles (MCPs) and massless hidden photons on the expansion history of our Universe. We present parameter scans for the amount of extra relativistic particles (Neff) and the abundance of light nuclei for fermionic MCPs with masses between ~100 keV and 10 GeV and minicharges in the range 10^(-11)-1. Current CMB and BBN data significantly constrain the available parameter space of MCPs. The shown results are a valuable indicator for future experimental searches and are presented in a flexible way so that more accurate results on Neff can be easily interpreted.

  13. Hidden Symmetries, Central Charges and All That

    CERN Document Server

    de Wit, Bernard; Wit, Bernard de; Nicolai, Hermann

    2001-01-01

    In this review we discuss hidden symmetries of toroidal compactifications of eleven-dimensional supergravity. We recall alternative versions of this theory which exhibit traces of the hidden symmetries when still retaining the massive Kaluza-Klein states. We reconsider them in the broader perspective of M-theory which incorporates a more extended variety of BPS states. We also argue for a new geometry that may underly these theories. All our arguments point towards an extension of the number of space-time coordinates beyond eleven.

  14. Searching for hidden sectors in multiparticle production at the LHC

    CERN Document Server

    Sanchis-Lozano, Miguel-Angel; Moreno-Picot, Salvador

    2015-01-01

    We study the impact of a hidden sector beyond the Standard Model, e.g. a Hidden Valley model, on factorial moments and cumulants of multiplicity distributions in multiparticle production with a special emphasis on the prospects for LHC results.

  15. Entropy Rate for Hidden Markov Chains with rare transitions

    OpenAIRE

    2010-01-01

    We consider Hidden Markov Chains obtained by passing a Markov Chain with rare transitions through a noisy memoryless channel. We obtain asymptotic estimates for the entropy of the resulting Hidden Markov Chain as the transition rate is reduced to zero.

  16. The Corporate Illiterates: The Hidden Illiterates of Silicon Valley.

    Science.gov (United States)

    Chase, Sharon

    1991-01-01

    Describes the writing and business communication problems of college-educated workers in Silicon Valley. Discusses hidden illiterates in the universities and in the workplace. Offers solutions for professors and managers faced with the problem of hidden illiterates. (PRA)

  17. Design and Implementation of Domain based Semantic Hidden Web Crawler

    OpenAIRE

    Manvi; Bhatia, Komal Kumar; Dixit, Ashutosh

    2015-01-01

    Web is a wide term which mainly consists of surface web and hidden web. One can easily access the surface web using traditional web crawlers, but they are not able to crawl the hidden portion of the web. These traditional crawlers retrieve contents from web pages, which are linked by hyperlinks ignoring the information hidden behind form pages, which cannot be extracted using simple hyperlink structure. Thus, they ignore large amount of data hidden behind search forms. This paper emphasizes o...

  18. Matrix Product Operator Simulations of Quantum Algorithms

    Science.gov (United States)

    2015-02-01

    Communications, pages 174–188. Springer, 1999. Bibliography 145 [21] Michelangelo Grigni, Leonard Schulman, Monica Vazirani, and Umesh Vazirani...2007. [27] Andrew M Childs, Leonard J Schulman, and Umesh V Vazirani. Quan- tum algorithms for hidden nonlinear structures. In Foundations of...and quantum in- formation. Cambridge University Press, Cambridge, 2000. [86] Charles H Bennett, Ethan Bernstein, Gilles Brassard, and Umesh Vazirani

  19. Hidden Markov Model-based Pedestrian Navigation System using MEMS Inertial Sensors

    Science.gov (United States)

    Zhang, Yingjun; Liu, Wen; Yang, Xuefeng; Xing, Shengwei

    2015-02-01

    In this paper, a foot-mounted pedestrian navigation system using MEMS inertial sensors is implemented, where the zero-velocity detection is abstracted into a hidden Markov model with 4 states and 15 observations. Moreover, an observations extraction algorithm has been developed to extract observations from sensor outputs; sample sets are used to train and optimize the model parameters by the Baum-Welch algorithm. Finally, a navigation system is developed, and the performance of the pedestrian navigation system is evaluated using indoor and outdoor field tests, and the results show that position error is less than 3% of total distance travelled.

  20. Hidden Markov Model-based Pedestrian Navigation System using MEMS Inertial Sensors

    Directory of Open Access Journals (Sweden)

    Zhang Yingjun

    2015-02-01

    Full Text Available In this paper, a foot-mounted pedestrian navigation system using MEMS inertial sensors is implemented, where the zero-velocity detection is abstracted into a hidden Markov model with 4 states and 15 observations. Moreover, an observations extraction algorithm has been developed to extract observations from sensor outputs; sample sets are used to train and optimize the model parameters by the Baum-Welch algorithm. Finally, a navigation system is developed, and the performance of the pedestrian navigation system is evaluated using indoor and outdoor field tests, and the results show that position error is less than 3% of total distance travelled.

  1. Variational Hidden Conditional Random Fields with Coupled Dirichlet Process Mixtures

    NARCIS (Netherlands)

    Bousmalis, K.; Zafeiriou, S.; Morency, L.P.; Pantic, Maja; Ghahramani, Z.

    2013-01-01

    Hidden Conditional Random Fields (HCRFs) are discriminative latent variable models which have been shown to successfully learn the hidden structure of a given classification problem. An infinite HCRF is an HCRF with a countably infinite number of hidden states, which rids us not only of the necessit

  2. Perceptual consequences of "hidden" hearing loss.

    Science.gov (United States)

    Plack, Christopher J; Barker, Daphne; Prendergast, Garreth

    2014-09-09

    Dramatic results from recent animal experiments show that noise exposure can cause a selective loss of high-threshold auditory nerve fibers without affecting absolute sensitivity permanently. This cochlear neuropathy has been described as hidden hearing loss, as it is not thought to be detectable using standard measures of audiometric threshold. It is possible that hidden hearing loss is a common condition in humans and may underlie some of the perceptual deficits experienced by people with clinically normal hearing. There is some evidence that a history of noise exposure is associated with difficulties in speech discrimination and temporal processing, even in the absence of any audiometric loss. There is also evidence that the tinnitus experienced by listeners with clinically normal hearing is associated with cochlear neuropathy, as measured using Wave I of the auditory brainstem response. To date, however, there has been no direct link made between noise exposure, cochlear neuropathy, and perceptual difficulties. Animal experiments also reveal that the aging process itself, in the absence of significant noise exposure, is associated with loss of auditory nerve fibers. Evidence from human temporal bone studies and auditory brainstem response measures suggests that this form of hidden loss is common in humans and may have perceptual consequences, in particular, regarding the coding of the temporal aspects of sounds. Hidden hearing loss is potentially a major health issue, and investigations are ongoing to identify the causes and consequences of this troubling condition.

  3. The structural strength of glass: hidden damage

    NARCIS (Netherlands)

    Veer, F.A.; Rodichev, Y.M.

    2011-01-01

    We discuss “hidden damage” of glass by the rolling process, which results in heterogeneous distribution of microcracks on the edge surface of glass element, which are the fracture source deteriorating glass element strength. It is shown that removal of this damage on the edges of glass elements

  4. Discovering Hidden Treasures with GPS Technology

    Science.gov (United States)

    Nagel, Paul; Palmer, Roger

    2014-01-01

    "I found it!" Addison proudly proclaimed, as she used an iPhone and Global Positioning System (GPS) software to find the hidden geocache along the riverbank. Others in Lisa Bostick's fourth grade class were jealous, but there would be other geocaches to find. With the excitement of movies like "Pirates of the Caribbean" and…

  5. Hidden Markov Models for Human Genes

    DEFF Research Database (Denmark)

    Baldi, Pierre; Brunak, Søren; Chauvin, Yves

    1997-01-01

    We analyse the sequential structure of human genomic DNA by hidden Markov models. We apply models of widely different design: conventional left-right constructs and models with a built-in periodic architecture. The models are trained on segments of DNA sequences extracted such that they cover...

  6. Dermatologic hazards from hidden contacts with penicillin

    Energy Technology Data Exchange (ETDEWEB)

    Boonk, W.J.

    1981-01-01

    The unbridled use of penicillin after its discovery by Fleming has resulted in possible hazards to human health due to traces of the drug being present in food and other hidden sources. These hazards may include toxic effects, hypersensitivity reactions and possibly a raising of the frequency and duration of allergy to penicillin.

  7. The structural strength of glass: hidden damage

    NARCIS (Netherlands)

    Veer, F.A.; Rodichev, Y.M.

    2011-01-01

    We discuss “hidden damage” of glass by the rolling process, which results in heterogeneous distribution of microcracks on the edge surface of glass element, which are the fracture source deteriorating glass element strength. It is shown that removal of this damage on the edges of glass elements incr

  8. Computerized Testing: The Hidden Figures Test.

    Science.gov (United States)

    Jacobs, Ronald L.; And Others

    1985-01-01

    This study adapted the Hidden Figures Test for use on PLATO and determined the reliability of the computerized version compared to the paper and pencil version. Results indicate the test was successfully adapted with some modifications, and it was judged reliable although it may be measuring additional constructs. (MBR)

  9. Towards gauge unified, supersymmetric hidden strong dynamics

    CERN Document Server

    Chiang, Cheng-Wei; Ye, Fang

    2016-01-01

    We consider a class of models with extra complex scalars that are charged under both the Standard Model and a hidden strongly coupled $SU(N)_H$ gauge sector, and discuss the scenarios where the new scalars are identified as the messenger fields that mediate the spontaneously broken supersymmetries from the hidden sector to the visible sector. The new scalars are embedded into 5-plets and 10-plets of an $SU(5)_V$ gauge group that potentially unifies the Standard Model gauge groups. They also form a tower of bound states via hidden strong dynamics around the TeV scale. The Higgs bosons remain as elementary particles. Quadratically divergent contributions to the Higgs mass from the Standard Model fermions are canceled by the new scalar contributions to alleviate the fine-tuning problem. We also discuss a supersymmetrized version of this class of models, consisting of the minimal supersymmetric Standard Model plus extra chiral multiplets where the new scalars reside. Due to the hidden strong force, the new low-en...

  10. Hidden Costs and Challenges of Servitization

    DEFF Research Database (Denmark)

    Yang, Yifan; Slepniov, Dmitrij

    of these labels, the potential benefits of servitization are often overshadowed by costs associated with it. By using the cases of Chinese and Danish manufacturing firms, this study takes a closer look at possible hidden costs of servitization and contributes to our understanding of servitization performance...

  11. The Applications of Genetic Algorithms in Medicine

    OpenAIRE

    Ali Ghaheri; Saeed Shoar; Mohammad Naderan; Sayed Shahabuddin Hoseini

    2015-01-01

    A great wealth of information is hidden amid medical research data that in some cases cannot be easily analyzed, if at all, using classical statistical methods. Inspired by nature, metaheuristic algorithms have been developed to offer optimal or near-optimal solutions to complex data analysis and decision-making tasks in a reasonable time. Due to their powerful features, metaheuristic algorithms have frequently been used in other fields of sciences. In medicine, however, the use of these algo...

  12. Quantum Discord, CHSH Inequality and Hidden Variables -- Critical reassessment of hidden-variables models

    CERN Document Server

    Fujikawa, Kazuo

    2013-01-01

    Hidden-variables models are critically reassessed. It is first examined if the quantum discord is classically described by the hidden-variable model of Bell in the Hilbert space with $d=2$. The criterion of vanishing quantum discord is related to the notion of reduction and, surprisingly, the hidden-variable model in $d=2$, which has been believed to be consistent so far, is in fact inconsistent and excluded by the analysis of conditional measurement and reduction. The description of the full contents of quantum discord by the deterministic hidden-variables models is not possible. We also re-examine CHSH inequality. It is shown that the well-known prediction of CHSH inequality $|B|\\leq 2$ for the CHSH operator $B$ introduced by Cirel'son is not unique. This non-uniqueness arises from the failure of linearity condition in the non-contextual hidden-variables model in $d=4$ used by Bell and CHSH, in agreement with Gleason's theorem which excludes $d=4$ non-contextual hidden-variables models. If one imposes the l...

  13. A comparison of multidrug-resistant tuberculosis treatment commencement times in MDRTBPlus line probe assay and Xpert® MTB/RIF-based algorithms in a routine operational setting in Cape Town.

    Directory of Open Access Journals (Sweden)

    Pren Naidoo

    Full Text Available Xpert MTB/RIF was introduced as a screening test for all presumptive tuberculosis cases in primary health services in Cape Town, South Africa.To compare multidrug-resistant tuberculosis (MDR-TB treatment commencement times in MDRTBPlus Line Probe Assay and Xpert MTB/RIF-based algorithms in a routine operational setting.The study was undertaken in 10 of 29 high tuberculosis burden primary health facilities, selected through stratified random sampling. An observational study was undertaken as facilities transitioned to the Xpert MTB/RIF-based algorithm. MDR-TB diagnostic data were collected from electronic laboratory records and treatment data from clinical records and registers. Kaplan Meier time-to-event analysis was used to compare treatment commencement time, laboratory turnaround time and action delay between algorithms. A facility-level paired analysis was done: the median time-to-event was estimated per facility in each algorithm and mean differences between algorithms compared using a paired t-test. Cox proportional hazards regression was used to assess the effect of patient-level variables on treatment commencement time. The difference between algorithms was compared using the hazard ratio.The median treatment commencement time in the Xpert MTB/RIF-based algorithm was 17 days (95% CI 13 to 22 days, with a median laboratory turnaround time (to result available in the laboratory of <1 day (95% CI<1 to 1 day. There was a decrease of 25 days (95% CI 17 to 32 days, p<0.001 in median MDR-TB treatment commencement time in the Xpert MTB/RIF-based algorithm. We found no significant effect on treatment commencement times for the patient-level variables assessed.MDR-TB treatment commencement time was significantly reduced in the Xpert MTB/RIF-based algorithm. Changes in the health system may have contributed. However, an unacceptable level of delay remains. Health system and patient factors contributing to delay need to be evaluated and addressed to

  14. The hidden simplicity of biology

    Science.gov (United States)

    Davies, Paul C. W.; Imari Walker, Sara

    2016-10-01

    Life is so remarkable, and so unlike any other physical system, that it is tempting to attribute special factors to it. Physics is founded on the assumption that universal laws and principles underlie all natural phenomena, but is it far from clear that there are ‘laws of life’ with serious descriptive or predictive power analogous to the laws of physics. Nor is there (yet) a ‘theoretical biology’ in the same sense as theoretical physics. Part of the obstacle in developing a universal theory of biological organization concerns the daunting complexity of living organisms. However, many attempts have been made to glimpse simplicity lurking within this complexity, and to capture this simplicity mathematically. In this paper we review a promising new line of inquiry to bring coherence and order to the realm of biology by focusing on ‘information’ as a unifying concept.

  15. The hidden X suture: a technical note on a novel suture technique for alveolar ridge preservation

    Science.gov (United States)

    2016-01-01

    Purpose The present study investigated the impact of 2 different suture techniques, the conventional crossed mattress suture (X suture) and the novel hidden X suture, for alveolar ridge preservation (ARP) with an open healing approach. Methods This study was a prospective randomized controlled clinical trial. Fourteen patients requiring extraction of the maxillary or mandibular posterior teeth were enrolled and allocated into 2 groups. After extraction, demineralized bovine bone matrix mixed with 10% collagen (DBBM-C) was grafted and the socket was covered by porcine collagen membrane in a double-layer fashion. No attempt to obtain primary closure was made. The hidden X suture and conventional X suture techniques were performed in the test and control groups, respectively. Cone-beam computed tomographic (CBCT) images were taken immediately after the graft procedure and before implant surgery 4 months later. Additionally, the change in the mucogingival junction (MGJ) position was measured and was compared after extraction, after suturing, and 4 months after the operation. Results All sites healed without any complications. Clinical evaluations showed that the MGJ line shifted to the lingual side immediately after the application of the X suture by 1.56±0.90 mm in the control group, while the application of the hidden X suture rather pushed the MGJ line slightly to the buccal side by 0.25±0.66 mm. It was demonstrated that the amount of keratinized tissue (KT) preserved on the buccal side was significantly greater in the hidden X suture group 4 months after the procedure (Pclinical and radiographic verification of the efficacy of the hidden X suture in preserving the width of KT and the dimensions of the alveolar ridge after ARP. PMID:28050319

  16. Hidden State Conditional Random Field for Abnormal Activity Recognition in Smart Homes

    Directory of Open Access Journals (Sweden)

    Yu Tong

    2015-03-01

    Full Text Available As the number of elderly people has increased worldwide, there has been a surge of research into assistive technologies to provide them with better care by recognizing their normal and abnormal activities. However, existing abnormal activity recognition (AAR algorithms rarely consider sub-activity relations when recognizing abnormal activities. This paper presents an application of the Hidden State Conditional Random Field (HCRF method to detect and assess abnormal activities that often occur in elderly persons’ homes. Based on HCRF, this paper designs two AAR algorithms, and validates them by comparing them with a feature vector distance based algorithm in two experiments. The results demonstrate that the proposed algorithms favorably outperform the competitor, especially when abnormal activities have same sensor type and sensor number as normal activities.

  17. 多核处理器上的并行联机分析处理算法研究%Parallel On-Line Analysis Processing Algorithms Research on Multi-Core CPUs

    Institute of Scientific and Technical Information of China (English)

    周国亮; 王桂兰; 朱永利

    2013-01-01

    Computer hardware technology has greatly developed, especially large memory and multi-core, but the algorithm efficiency dose not improve with the development of hardware. The fundamental reason is the insufficient utilization of CPU cache and the limitation of single-thread programming. In the field of OLAP (on-line analysis processing), data cube computation is an important and time-consuming operation, so how to improve the perfor-mance of data cube computation is a difficult research point in this field. Based on the characteristics of multi-core CPUs, this paper proposes two parallel algorithms, MT-Multi-Way (multi-threading multi-way) and MT-BUC (multi-threading bottom-up computation), which utilize data partition and multi-thread cooperation. All these algo-rithms avoid cache contentions between threads and keep loading balance, so obtain near-linear speedup. Based on these algorithms, this paper suggests one unified framework for cube computation on multi-core CPUs, including how to partition data and resolve recursive program on multi-core CPUs for guiding cube computation parallelization.

  18. 基于直线特征的航拍图像机场跑道自动识别算法%Runway recognition algorithm in aerial image based on straight line characteristics

    Institute of Scientific and Technical Information of China (English)

    董银文; 苑秉成; 石钊铭; 王航宇

    2013-01-01

    针对航拍图像中机场跑道的区域灰度特征和边界直线特征,提出了一种基于直线特征的机场跑道自动识别算法.首先对航拍图像进行边缘检测;然后在归一化的边缘检测幅度图像中进行直线提取,并对提取的直线进行三次连接;再进行机场跑道边界平行直线对的提取;最后根据区域灰度特征对机场跑道区域进行验证,完成机场跑道的识别和定位.大量实验结果表明,本算法对云层遮挡等具有较强的鲁棒性,并且定位准确,是一种有效的机场跑道识别算法.%Aiming at the characteristics of area grey and edge line of runway, an algorithm for recognizing runway based on straight line characteristics is presented to achieve runway recognition correctly. Firstly, the edge detectors are used to get a edge image which has been number normalized, and straight lines are extracted in the edge image. Then the straight lines are connected three times and the parallel straight lines couple is extracted. Finally, the runway of airport is validated according to the characteristics of area grey. Many experiments show that this method can find the runway of airport exactly and quickly in aerial images, and is robust for the influence of cloud cover and noise. Experimental results verify the effectiveness of the proposed algorithm.

  19. APPLICATION OF A PRIMAL-DUAL INTERIOR POINT ALGORITHM USING EXACT SECOND ORDER INFORMATION WITH A NOVEL NON-MONOTONE LINE SEARCH METHOD TO GENERALLY CONSTRAINED MINIMAX OPTIMISATION PROBLEMS

    Directory of Open Access Journals (Sweden)

    INTAN S. AHMAD

    2008-04-01

    Full Text Available This work presents the application of a primal-dual interior point method to minimax optimisation problems. The algorithm differs significantly from previous approaches as it involves a novel non-monotone line search procedure, which is based on the use of standard penalty methods as the merit function used for line search. The crucial novel concept is the discretisation of the penalty parameter used over a finite range of orders of magnitude and the provision of a memory list for each such order. An implementation within a logarithmic barrier algorithm for bounds handling is presented with capabilities for large scale application. Case studies presented demonstrate the capabilities of the proposed methodology, which relies on the reformulation of minimax models into standard nonlinear optimisation models. Some previously reported case studies from the open literature have been solved, and with significantly better optimal solutions identified. We believe that the nature of the non-monotone line search scheme allows the search procedure to escape from local minima, hence the encouraging results obtained.

  20. 逐步线性回归与神经网络预测的算法对比分析%Algorithm Comparative Analysis with Stepwise Line arR ge ression and N eural Ne twork

    Institute of Scientific and Technical Information of China (English)

    谭立云; 刘海生; 谭龙

    2014-01-01

    逐步线性回归能较好地克服多重共线性现象的发生,因此逐步回归分析是探索多变量关系的最常用的分析方法,智能算法是现代数据分析的主要方法。本文通过一个实例进行了对比研究,预测结果显示:在预测的精度上,在隐含层数目相同时,RBF径向神经网络>BP神经网络>逐步线性回归>ELM极限学习机。通过对比分析,发现神经网络方法较回归分析预测效果更好,误差相对较小。%Gradient linear regression can well solve the occurrence of Multicollinearity , so the gradient regres-sion analysis is analytical method to research the correlation among multivariable.Intelligent algorithm is one of the dominant methods in modern data analysis.Both of the methods above are applied to one example and further to be compared.The forecasted result shows:for the accuracy of the forecasted results , when the num-ber of hidden layer is consistent ,RBF radial basis neural networks >BP neural networks >Gradient linear regression >ELM limit machine learning.Through the analysis of comparison , we infer that the accuracy and error of neural networks is smaller than the regression model.

  1. Research on identification method of heavy vehicle rollover based on hidden Markov model

    Science.gov (United States)

    Zhao, Zhiguo; Wang, Yeqin; Hu, Xiaoming; Tao, Yukai; Wang, Jinsheng

    2017-07-01

    Aiming at the problem of early warning credibility degradation as the heavy vehicle load and its center of gravity change greatly; the heavy vehicle rollover state identification method based on the Hidden Markov Model (HMM, is introduced to identify heavy vehicle lateral conditions dynamically in this paper. In this method, the lateral acceleration and roll angle are taken as the observation values of the model base. The Viterbi algorithm is used to predict the state sequence with the highest probability in the observed sequence, and the Markov prediction algorithm is adopted to calculate the state transition law and to predict the state of the vehicle in a certain period of time in the future. According to combination conditions of Double lane change and steering, applying Trucksim and Matlab trained hidden Markov model, the model is applied to the online identification of heavy vehicle rollover states. The identification results show that the model can accurately and efficiently identify the vehicle rollover state, and has good applicability. This study provides a novel method and a general strategy for active safety early warning and control of vehicles, which has reference significance for the application of the Hidden Markov theory in collision, rear-end and lane departure warning system.

  2. Self-accelerating massive gravity: Hidden constraints and characteristics

    Science.gov (United States)

    Motloch, Pavel; Hu, Wayne; Motohashi, Hayato

    2016-05-01

    Self-accelerating backgrounds in massive gravity provide an arena to explore the Cauchy problem for derivatively coupled fields that obey complex constraints which reduce the phase space degrees of freedom. We present here an algorithm based on the Kronecker form of a matrix pencil that finds all hidden constraints, for example those associated with derivatives of the equations of motion, and characteristic curves for any 1 +1 dimensional system of linear partial differential equations. With the Regge-Wheeler-Zerilli decomposition of metric perturbations into angular momentum and parity states, this technique applies to fully 3 +1 dimensional perturbations of massive gravity around any spherically symmetric self-accelerating background. Five spin modes of the massive graviton propagate once the constraints are imposed: two spin-2 modes with luminal characteristics present in the massless theory as well as two spin-1 modes and one spin-0 mode. Although the new modes all possess the same—typically spacelike—characteristic curves, the spin-1 modes are parabolic while the spin-0 modes are hyperbolic. The joint system, which remains coupled by nonderivative terms, cannot be solved as a simple Cauchy problem from a single noncharacteristic surface. We also illustrate the generality of the algorithm with other cases where derivative constraints reduce the number of propagating degrees of freedom or order of the equations.

  3. Quantum Computing and Hidden Variables II: The Complexity of Sampling Histories

    CERN Document Server

    Aaronson, S

    2004-01-01

    This paper shows that, if we could examine the entire history of a hidden variable, then we could efficiently solve problems that are believed to be intractable even for quantum computers. In particular, under any hidden-variable theory satisfying a reasonable axiom called "indifference to the identity," we could solve the Graph Isomorphism and Approximate Shortest Vector problems in polynomial time, as well as an oracle problem that is known to require quantum exponential time. We could also search an N-item database using O(N^{1/3}) queries, as opposed to O(N^{1/2}) queries with Grover's search algorithm. On the other hand, the N^{1/3} bound is optimal, meaning that we could probably not solve NP-complete problems in polynomial time. We thus obtain the first good example of a model of computation that appears slightly more powerful than the quantum computing model.

  4. Hidden penis release: adjunctive suprapubic lipectomy.

    Science.gov (United States)

    Horton, C E; Vorstman, B; Teasley, D; Winslow, B

    1987-08-01

    We believe the hidden penis may be caused and concealed by a prominent suprapubic fat pad in addition to the restrictive fibrous bands of the dartos fascia fixing the shaft of the penis proximally while loose skin folds prolapse distally over the phallus. A penis of inadequate length or appearance may affect body image. Patients with this problem often require psychological support. Hidden penis may be distinguished from micropenis by palpating adequate corpora and showing a stretched penile length within 2 SD of normal. Excision of suprapubic fat with sectioning of the tethering dartos bands will release and increase the length of the penis. Suprapubic fat pad resection may also be helpful to elongate a short penis in cases of adult microphallus, or after partial penectomy because of trauma or cancer. Circumcision is contraindicated.

  5. Laser experiments explore the hidden sector

    CERN Document Server

    Ahlers, M; Jaeckel, J; Redondo, J; Ringwald, A

    2007-01-01

    Recently, the laser experiments BMV and GammeV, searching for light shining through walls, have published data and calculated new limits on the allowed masses and couplings for axion-like particles. In this note we point out that these experiments can serve to constrain a much wider variety of hidden-sector particles such as, e.g., minicharged particles and hidden-sector photons. The new experiments improve the existing bounds from the older BFRT experiment by a factor of two. Moreover, we use the new PVLAS constraints on a possible rotation and ellipticity of light after it has passed through a strong magnetic field to constrain pure minicharged particle models. For masses <~0.05 eV, the charge is now restricted to be less than (3-4)x10^(-7) times the electron electric charge. This is the best laboratory bound and comparable to bounds inferred from the energy spectrum of the cosmic microwave background.

  6. Extended abstract of a hidden agenda

    Energy Technology Data Exchange (ETDEWEB)

    Goguen, J.; Malcolm, G. [Oxford Univ. (United Kingdom)

    1996-12-31

    The initial goal of our hidden research programme was both straightforward and ambitious: give a semantics for software engineering, and in particular for the object paradigm, supporting correctness proofs that are as simple and mechanical as possible. This emphasizes proofs rather than models, and thus suggests an equational approach, rather than one based on higher order logic, denotational semantics, or any kind of model, because equational proofs achieve maximal simplicity and mechanization, and yet are fully expressive. We introduce powerful coinduction techniques for proving behavioral properties of complex systems. We make the no doubt outrageous claim that our hidden approach gives simpler proofs than other formalisms; this is because we exploit algebraic structure that most other approaches discard.

  7. Hidden geometric correlations in real multiplex networks

    Science.gov (United States)

    Kleineberg, Kaj-Kolja; Boguñá, Marián; Ángeles Serrano, M.; Papadopoulos, Fragkiskos

    2016-11-01

    Real networks often form interacting parts of larger and more complex systems. Examples can be found in different domains, ranging from the Internet to structural and functional brain networks. Here, we show that these multiplex systems are not random combinations of single network layers. Instead, they are organized in specific ways dictated by hidden geometric correlations between the layers. We find that these correlations are significant in different real multiplexes, and form a key framework for answering many important questions. Specifically, we show that these geometric correlations facilitate the definition and detection of multidimensional communities, which are sets of nodes that are simultaneously similar in multiple layers. They also enable accurate trans-layer link prediction, meaning that connections in one layer can be predicted by observing the hidden geometric space of another layer. And they allow efficient targeted navigation in the multilayer system using only local knowledge, outperforming navigation in the single layers only if the geometric correlations are sufficiently strong.

  8. Binary hidden Markov models and varieties

    CERN Document Server

    Critch, Andrew J

    2012-01-01

    The technological applications of hidden Markov models have been extremely diverse and successful, including natural language processing, gesture recognition, gene sequencing, and Kalman filtering of physical measurements. HMMs are highly non-linear statistical models, and just as linear models are amenable to linear algebraic techniques, non-linear models are amenable to commutative algebra and algebraic geometry. This paper examines closely those HMMs in which all the random variables, called nodes, are binary. Its main contributions are (1) minimal defining equations for the 4-node model, comprising 21 quadrics and 29 cubics, which were computed using Gr\\"obner bases in the cumulant coordinates of Sturmfels and Zwiernik, and (2) a birational parametrization for every binary HMM, with an explicit inverse for recovering the hidden parameters in terms of observables. The new model parameters in (2) are hence rationally identifiable in the sense of Sullivant, Garcia-Puente, and Spielvogel, and each model's Zar...

  9. Algorithm for feature line extraction based on 3D point cloud models%基于三维点云模型的特征线提取算法

    Institute of Scientific and Technical Information of China (English)

    刘倩; 耿国华; 周明全; 赵璐璐; 李姬俊男

    2013-01-01

    针对以往算法存在无法区分尖锐和非尖锐特征点、提取的特征点与视角有关、特征点未连线等问题,提出一种基于高斯映射和曲率值分析的三维点云模型尖锐特征线提取算法.该算法先进行点云数据点的离散高斯映射,并将映射点集聚类;然后使用自适应迭代过程得到两个或多个面的相交线上曲率值和法向量发生突变的尖锐特征点,这些点与视角无关;最后,用改进的特征折线生长算法,将特征点连接,得到光顺特征线.实验证明,该算法具有良好的自适应性、抗噪性和准确性,是一种有效的三维模型特征线提取算法.%Abstract: This paper proposed a sharp feature line extraction algorithm of 3D point cloud models based on Gaussian map and curvature value analysis, which aimed to solve the problems that previous algorithms existed, including could not distinguish sharp and non-sharp feature points,the extracted feature points were relative to perspective, or feature points weren' t connected. First, this algorithm conducted discrete Gaussian map for point cloud data, and clustered these mapping point sets. Then it used an adaptive iterative procedure to get sharp feature points, these points mainty located on the intersection line of two or more point cloud surfaces, where curvature value or normal vector suddenly changed and they were independent of perspective. Finally,it used an improved feature polyline propagation algorithm, connected the feature points, and got smoothing feature 1ines. Experiments show that the algorithm has good adaptability, noise immunity and accuracy, it is an effective feature ex-tiaction algorithm for 3D models.

  10. 适用于时变系统的在线盲源分离算法研究%Research on on-line blind source separation algorithm for time-vary-ing system

    Institute of Scientific and Technical Information of China (English)

    邓大鹏; 李骏; 丁德强; 贺翥祯

    2016-01-01

    针对传统EASI算法收敛速率与稳态误差之间的矛盾,提出了一种基于估计函数期望的步长自适应算法(New Adaptive EASI),为了使这种算法能够更好地解决时变系统中不同条件下的盲源分离问题,提高信号的分离精度,建立了一种混合矩阵变化的在线检测机制,并将这种在线检测机制加入步长自适应算法中,对算法进行了改进.仿真实验表明,这种改进的步长自适应算法能够提高盲源分离初始阶段或是信道变化后分离初始阶段的信号恢复质量,解决源信号为非零均值信号时的盲源分离问题,并且能够准确地在线估计源信号的个数,实现信源数变化条件下的盲源分离.%Aiming at the contradiction between the convergence rate and the steady-state error of the traditional EASI algorithm, this paper presents a New Adaptive EASI algorithm based on the expectation of estimate function. In order to make the new algorithm be able to solve the BSS problems under different conditions of time-varying system better and improve the accuracy of separated signals, it sets up an on-line detection mechanism of the changes in mixing matrix and adds it to the New Adaptive EASI algorithm to modify the algorithm. Simulation results show that the modified New Adaptive EASI algorithm can improve the quality of separated signals in the initial stage of separation or just after the channel condition changes, do the on-line separation of nonzero mean mixed signals and accurately estimate the number of source signals online to solve the BSS problem under the condition that the number of the source signals varies during the separating process.

  11. Image segmentation and classification based on a 2D distributed hidden Markov model

    Science.gov (United States)

    Ma, Xiang; Schonfeld, Dan; Khokhar, Ashfaq

    2008-01-01

    In this paper, we propose a two-dimensional distributed hidden Markovmodel (2D-DHMM), where dependency of the state transition probability on any state is allowed as long as causality is preserved. The proposed 2D-DHMM model is result of a novel solution to a more general non-causal two-dimensional hidden Markovmodel (2D-HMM) that we proposed. Our proposed models can capture, for example, dependency among diagonal states, which can be critical in many image processing applications, for example, image segmentation. A new sets of basic image patterns are designed to enrich the variability of states, which in return largely improves the accuracy of state estimations and segmentation performance. We provide three algorithms for the training and classification of our proposed model. A new Expectation-Maximization (EM) algorithm suitable for estimation of the new model is derived, where a novel General Forward-Backward (GFB) algorithm is proposed for recursive estimation of the model parameters. A new conditional independent subset-state sequence structure decomposition of state sequences is proposed for the 2D Viterbi algorithm. Application to aerial image segmentation shows the superiority of our model compared to the existing models.

  12. The Hidden Gifts of Quiet Kids

    Science.gov (United States)

    Trierweiler, Hannah

    2006-01-01

    The author relates that she was an introvert child. It has always taken her time and energy to find her place in a group. As a grown-up, she still needed quiet time to regroup during a busy day. In this article, the author presents an interview with Marti Olsen Laney, author of "The Hidden Gifts of the Introverted Child." During the interview,…

  13. Finite State Transducers Approximating Hidden Markov Models

    CERN Document Server

    Kempe, A

    1999-01-01

    This paper describes the conversion of a Hidden Markov Model into a sequential transducer that closely approximates the behavior of the stochastic model. This transformation is especially advantageous for part-of-speech tagging because the resulting transducer can be composed with other transducers that encode correction rules for the most frequent tagging errors. The speed of tagging is also improved. The described methods have been implemented and successfully tested on six languages.

  14. Hidden symmetries in dilaton-axion gravity

    CERN Document Server

    Kechkin, O V

    1996-01-01

    Four--dimensional Einstein--Maxwell--dilaton--axion system restricted to space--times with one non--null Killing symmetry is formulated as the three--dimensional gravity coupled sigma--model. Several alternative representations are discussed and the associated hidden symmetries are revealed. The action of target space isometries on the initial set of (non--dualized ) variables is found. New mulicenter solutions are obtained via generating technique based on the formulation in terms of the non--dualized variables.

  15. Caldera rim collapse: A hidden volcanic hazard

    OpenAIRE

    Merle, Olivier; Michon, Laurent; Bachèlery, Patrick

    2008-01-01

    International audience; Following the emblematic flank collapse of Mount St Helens in 1981, numerous models of flank sliding have been proposed. These models have allowed to largely improve the understanding of mechanisms involved in such landslides, which represent a tremendous risk for populations living around volcanoes. In this article, a new mode of landslide formation, related to buried calderas, is described. The model emphasizes the paramount importance of the hidden ring fault that, ...

  16. Killing and letting die: hidden value assumptions.

    Science.gov (United States)

    Atkinson, G

    1983-01-01

    In this paper I argue for several related theses: first, that the distinction between killing and letting die, as it is drawn by ordinary persons in ordinary contexts, is more complex than is generally understood; second, that the key feature of this complexity lies in the presence of a hidden normative component in what appears to be a straightforwardly descriptive distinction; and, third, that this complexity renders the killing/letting die distinction an inadequate and hazardous guide for moral reasoning.

  17. Detection of UXO contaminated land fields using hidden Markov models in the SAR images generated by airborne radar system

    Science.gov (United States)

    Damarla, Thyagaraju; Nguyen, Lam H.; Ranney, Kenneth I.

    2001-08-01

    We present an algorithm based on hidden Markov models (HMM) to detect several types of unexploded ordinance (UXO). We use the synthetic aperture radar (SAR) images simulated for 155 mm artillery shell, 2.75 in rocket and 105 mm mortar to generate the codebook. The algorithm is used on the data collected at Yuma Proving ground (YPG). YPG is seeded with several types of UXOs for testing purposes. The data is collected using an ultra wideband SAR mounted on a telescoping boom to simulate the airborne radar. The algorithm has detected all the targets for which it is trained for and it also detected other UXOs that are similar in shape.

  18. Lepton mixing from the hidden sector

    Science.gov (United States)

    Ludl, P. O.; Smirnov, A. Yu.

    2015-10-01

    Experimental results indicate a possible relation between the lepton and quark mixing matrices of the form UPMNS≈VCKM†UX , where UX is a matrix with special structure related to the mechanism of neutrino mass generation. We propose a framework which can realize such a relation. The main ingredients of the framework are the double seesaw mechanism, SO(10) grand unification and a hidden sector of theory. The latter is composed of singlets (fermions and bosons) of the grand unified theory (GUT) symmetry with masses between the GUT and Planck scale. The interactions in this sector obey certain symmetries Ghidden. We explore the conditions under which symmetries Ghidden can produce flavor structures in the visible sector. Here the key elements are the basis-fixing symmetry and mediators which communicate information about properties of the hidden sector to the visible one. The interplay of SO(10) symmetry, basis-fixing symmetry identified as Z2×Z2 and Ghidden can lead to the required form of UX. A different kind of new physics is responsible for generation of the CKM mixing. We present the simplest realizations of the framework which differ by nature of the mediators and by symmetries of the hidden sector.

  19. Otoendoscopic treatment of hidden lesions in otomastoiditis

    Institute of Scientific and Technical Information of China (English)

    LIU Yang; SUN Jian-jun; LIN Yong-sheng; ZHAO Dan-heng; ZHAO Jing; LEI Fei

    2010-01-01

    Background Surgical treatments for chronic suppurative and cholesteatoma otitis media have been discussed for several decades, but recurrences still occur because of the complex dissection required and hidden lesions associated with otomastoiditis. This study investigated the technology and strategy behind the use of otoendoscopic-assisted otosurgery.Methods We reported on hidden lesions in 32 ears of patients with otomastoiditis between November 2006 and January 2009. All the patients were treated with the aid of an otoendoscope. The advantages of otoendoscopy, including multi-angle light scattering, aperture illumination, and magnification of the local operative field, were utilized in otologic microsurgery, and otoendoscopic operative techniques were introduced for operative sites such as the epitympanum, aditus of the antrum, facial recess, sinus tympani and the mastoid tip.Results All patients were followed up from 3 months to 2 years after surgery. All patients recovered well within 3 months following surgery, except for one case of epithelialization of the mastoid cavity occurring 6 months after surgery for cholesteatoma on the cerebellar surface and another case with Bezold's abscess, hyperplastic granulation tissue developed at the antrum.Conclusions Otoendoscopy can overcome the technical deficiency of rectilinearity of the visual axis associated with otomicroscopic illumination, which presents a problem when dealing with otomastoiditis lesions in hidden areas. This technique allows such lesions within the complex three-dimensional structure to be visualized and cleaned. Otoendoscopy thus has significant potential for improving the quality of surgery and reducing the risk of postoperative recurrence.

  20. Dark matter in the hidden gauge theory

    CERN Document Server

    Yamanaka, Nodoka; Gongyo, Shinya; Iida, Hideaki

    2014-01-01

    The cosmological scenario of the dark matter generated in the hidden gauge theory based on the grand unification is discussed. It is found that the stability of the dark matter halo of our Galaxy and the cosmic ray observation constrain, respectively, the dark matter mass and the unification scale between the standard model and the hidden gauge theory sectors. To obtain a phenomenologically consistent thermal evolution, the entropy of the standard model sector needs to be increased. We therefore propose a scenario where the mini-inflation is induced from the potential coupled to the Standard model sector, in particular the Higgs sector. This scenario makes consistent the current dark matter density as well as the baryon-to-photon ratio for the case of pion dark matter. For the glueball or heavy pion of hidden gauge theory, an additional mini-inflation in the standard model sector before the leptogenesis is required. We also propose the possibility to confirm this scenario by known prospective experimental app...

  1. 求解双边装配线第二类平衡问题的一种蚁群算法∗%Ant Algorithm for Two-sided Assembly Line Balancing of Type-2

    Institute of Scientific and Technical Information of China (English)

    胡俊逸; 张则强; 金初云

    2016-01-01

    Two-sided assembly line problem is more difficult than one-sided assembly line problem as the task distribution procedure. In this problem, besides the precedence constraints among tasks, the operation directions constraints of tasks and the requirement of parallel work should also be taken into consideration. The mathematical model and an ant colony algorithm were constructed to solve the Two-sided Assembly Line Balancing Problem of type-2(TALBP-Ⅱ). A hybrid ant-based search rule and a heuristic task distribu-tion rule were used in order to establish a feasible solution, global pheromone trail update and the optimum solution search strategy were considered. The feasibility of this algorithm was indicated by a case of a loader final assembly line.%双边装配线在任务分配过程中,除考虑任务先后关系约束外还需兼顾任务操作方位约束及任务操作的并行性要求。针对双边装配线第二类平衡问题提出了数学模型并构建了一种蚁群算法。此算法采用蚁群综合搜索规则、启发式任务分配规则构造一个可行解,对最优解的搜索过程提出了可行的规划方案。最后,通过为某型装载机的实例提出多组较好的平衡方案,验证了此算法的有效性。

  2. An Optimized Hidden Node Detection Paradigm for Improving the Coverage and Network Efficiency in Wireless Multimedia Sensor Networks

    Science.gov (United States)

    Alanazi, Adwan; Elleithy, Khaled

    2016-01-01

    Successful transmission of online multimedia streams in wireless multimedia sensor networks (WMSNs) is a big challenge due to their limited bandwidth and power resources. The existing WSN protocols are not completely appropriate for multimedia communication. The effectiveness of WMSNs varies, and it depends on the correct location of its sensor nodes in the field. Thus, maximizing the multimedia coverage is the most important issue in the delivery of multimedia contents. The nodes in WMSNs are either static or mobile. Thus, the node connections change continuously due to the mobility in wireless multimedia communication that causes an additional energy consumption, and synchronization loss between neighboring nodes. In this paper, we introduce an Optimized Hidden Node Detection (OHND) paradigm. The OHND consists of three phases: hidden node detection, message exchange, and location detection. These three phases aim to maximize the multimedia node coverage, and improve energy efficiency, hidden node detection capacity, and packet delivery ratio. OHND helps multimedia sensor nodes to compute the directional coverage. Furthermore, an OHND is used to maintain a continuous node– continuous neighbor discovery process in order to handle the mobility of the nodes. We implement our proposed algorithms by using a network simulator (NS2). The simulation results demonstrate that nodes are capable of maintaining direct coverage and detecting hidden nodes in order to maximize coverage and multimedia node mobility. To evaluate the performance of our proposed algorithms, we compared our results with other known approaches. PMID:27618048

  3. An Optimized Hidden Node Detection Paradigm for Improving the Coverage and Network Efficiency in Wireless Multimedia Sensor Networks.

    Science.gov (United States)

    Alanazi, Adwan; Elleithy, Khaled

    2016-09-07

    Successful transmission of online multimedia streams in wireless multimedia sensor networks (WMSNs) is a big challenge due to their limited bandwidth and power resources. The existing WSN protocols are not completely appropriate for multimedia communication. The effectiveness of WMSNs varies, and it depends on the correct location of its sensor nodes in the field. Thus, maximizing the multimedia coverage is the most important issue in the delivery of multimedia contents. The nodes in WMSNs are either static or mobile. Thus, the node connections change continuously due to the mobility in wireless multimedia communication that causes an additional energy consumption, and synchronization loss between neighboring nodes. In this paper, we introduce an Optimized Hidden Node Detection (OHND) paradigm. The OHND consists of three phases: hidden node detection, message exchange, and location detection. These three phases aim to maximize the multimedia node coverage, and improve energy efficiency, hidden node detection capacity, and packet delivery ratio. OHND helps multimedia sensor nodes to compute the directional coverage. Furthermore, an OHND is used to maintain a continuous node- continuous neighbor discovery process in order to handle the mobility of the nodes. We implement our proposed algorithms by using a network simulator (NS2). The simulation results demonstrate that nodes are capable of maintaining direct coverage and detecting hidden nodes in order to maximize coverage and multimedia node mobility. To evaluate the performance of our proposed algorithms, we compared our results with other known approaches.

  4. Hidden laser communications through matter. An application of meV-scale hidden photons

    Energy Technology Data Exchange (ETDEWEB)

    Jaeckel, Joerg [Durham Univ. (United Kingdom). Inst. for Particle Physics and Phenomenology; Redondo, Javier; Ringwald, Andreas [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany)

    2009-04-15

    Currently, there are a number of light-shining-through-walls experiments searching for hidden photons - light, sub-eV-scale, abelian gauge bosons beyond the standard model which mix kinetically with the standard photon. We show that in the case that one of these experiments finds evidence for hidden photons, laser communications through matter, using methods from free-space optics, can be realized in the very near future, with a channel capacity of more than 1 bit per second, for a distance up to the Earth's diameter. (orig.)

  5. 基于进化算法的隐神经元可调径向基函数网络%An Evolutionary Programming Based on Hidden Neuron Modifiable Radial Basis Function Networks

    Institute of Scientific and Technical Information of China (English)

    陈向东; 唐景山; 宋爱国

    2000-01-01

    In this paper,an improved radial basis function networks named hidden neuron modifiable radial basis function (IINMRBF) networks is proposed for target classification,and evolutionary programming (EP) is used as a learning algorithm to determine and modify the hidden neuron of HNMRBF nets.The result of passive sonar target classification shows that HNMRBF nets can effectively solve the problem of traditional neural networks,i.e.learning new target patterns on-line will cause forgetting of the old patterns.%本文提出了一种改进的称为隐神经元可调径向基函数神经网络(HNMRBF),并且应用进化规划算法作为聚类算法来决定和修改HNMRBF网络的隐神经元.最后,我们使用基于进化规划算法的HMRBF网络来进行被动声纳信号目标的分类,结果表明HNMRBF网络能有效地解决用传统神经网络时所遇到的问题,即在线学习新的目标模式时往往会遗忘旧的模式.

  6. Microwave background constraints on mixing of photons with hidden photons

    Energy Technology Data Exchange (ETDEWEB)

    Mirizzi, Alessandro [Max-Planck-Institut fuer Physik, Muenchen (Germany); Redondo, Javier [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Sigl, Guenter [Hamburg Univ. (Germany). 2. Inst. fuer Theoretische Physik

    2008-12-15

    Various extensions of the Standard Model predict the existence of hidden photons kinetically mixing with the ordinary photon. This mixing leads to oscillations between photons and hidden photons, analogous to the observed oscillations between different neutrino flavors. In this context, we derive new bounds on the photon-hidden photon mixing parameters using the high precision cosmic microwave background spectral data collected by the Far Infrared Absolute Spectrophotometer instrument on board of the Cosmic Background Explorer. Requiring the distortions of the CMB induced by the photon-hidden photon mixing to be smaller than experimental upper limits, this leads to a bound on the mixing angle {chi}{sub 0} hidden photon masses between 10{sup -14} eV and 10{sup -7} eV. This low-mass and low-mixing region of the hidden photon parameter space was previously unconstrained. (orig.)

  7. An Algorithm for the Tool Path Generation of Dental Restoration Based on the Guide Lines Planning%基于导动曲线规划的牙齿修复体精加工刀轨生成算法

    Institute of Scientific and Technical Information of China (English)

    韩厚年; 戴宁; 程筱胜; 董光雷; 杨峰; 孙玉春

    2012-01-01

    对于非凸区域加工范围的口腔修复体的行切走刀方式,针对跳刀频繁问题,提出了基于二维平面规划的导动曲线生成算法。该方法首先利用平行线段与加工区域求交得到交点,建立交点与加工区域边界的拓扑连接关系,根据对应关系按照一定的原则连接交点以及区域的边界点从而构建出连续的较少跳刀的导动曲线。最终生成刀具轨迹的跳刀次数与导动曲线的跳刀次数一致。实例表明该算法稳定快速且可靠,能显著减少跳刀次数,提高口腔修复体的加工效率。%In order to solve the problem of frequent retraction of direction parallel tool pam m me non-convex machining of dental restoration, the generation algorithm of guide lines planning on two-dimension plane is proposed. First of all, the topology relationship between the boundary of machining region and intersections obtained from the parallel line intersected with the machining region should be established, and then the intersections and points in the boundary to form continuous guide lines with less retraction should be linked, according to the corresponding re- lationship. The tool retraction of the resulting tool path generated by the present algorithm is equal to the number of guide lines. The testing results show that the algorithm is stable, fast and reliable, and it can significantly reduce the frequency of tool retraction and improve the processing efficiency of dental restoration.

  8. Design of concentrator based on electric line broadband carrier and relay routing algorithm%基于电力线宽带载波集中器设计与中继算法

    Institute of Scientific and Technical Information of China (English)

    陈可; 胡晓光

    2011-01-01

    The design scheme of concentrator based on electric line broadband carrier and its automatic relay routing algorithm are proposed. The concentrator takes S3C2440 chip as its core, adopting the electric line broadband carrier technology to communicate with the collector and the GPRS technology to communicate with the management center. Its software is based on the embedded Linux operating system, adopting the multi-channel I/O multiplexing technology and the embedded database technology to realize the receiving, transmitting and storage of user data. For low-voltage electric line, the automatic relay routing algorithm with relay constrains is employed for meter reading. The operating experience indicates that,the concentrator based on electric line broadband carrier has fast transmission speed,high reliability, excellent real-time performance and low operating cost, and the automatic relay routing algorithm with relay constrains improves the meter reading efficiency.%针对国内目前低压电力线抄表系统中采用的窄带载波集中器及人工中继路由方式,提出了基于电力线宽带载波的集中器设计方案及自动中继路由算法.宽带载波集中器硬件是以S3C2440为核心,采用电力线宽带载波技术与采集器通信、通用分组无线服务(GPRS)技术与管理中心通信;软件是基于嵌入式Linux操作系统设计,采用多路I/0复用技术以及嵌入式数据库技术实现对用户电量的接收、转发及存储.同时依据低压电力线的特点,采用具有中继约束条件的自动中继路由算法实现用户电量的抄收.运行经验和实践表明:宽带载波集中器具有传输速率快、可靠性高、实时性强和运行费用低等优点;具有中继约束条件的自动中继路由算法能有效缩短自动中继的时间,提高抄表效率.

  9. 蚁群算法在超高压输电线路故障测距的应用%Fault Location for EHV Transmission Line Based on Ant Colony Algorithm

    Institute of Scientific and Technical Information of China (English)

    刘迅; 黄纯

    2012-01-01

    Through analyzing the existing fault location methods and the effect of optimization for transmission line, a method of fault location based on ant colony algorithm is presented. Based on the distributing parameter transmission line model, the fault location function is educed according to the principle that the amplitude of fault point's voltage calculated from the two ends of a line is equal. The ant colony algorithm is introduced to resolve the fault location function optimization problems. To eliminate the effect of untransposed conductors and unbalanced transmission line impedances, phase components are transformed to model components. At last, the simulation based on a 750 kV transmission system model is presented to demonstrate that the algorithm is of high accuracy and not affected by fault type, system impedance, fault resistance, unsynchronized angle. The method has high practical value.%通过对现有输电线路故障测距方法的探讨以及优化算法测距效果的对比分析,提出了一种基于蚁群算法的故障测距方法.该方法基于线路分布参数模型,依据从线路两端分别推算出的故障点电压的幅值相等的原理,列出故障测距方程.引入蚁群算法来求解故障测距方程,并通过相模变换来减少实际线路的不换位和参数不平衡的影响.最后以750 kV超高压输电线路故障测距为例进行仿真,结果表明此算法测距精度高,不需要选择故障类型,不受系统阻抗、过渡电阻、不同步角的影响,有很强的实用价值.

  10. VISIBLE COSTS AND HIDDEN COSTS IN THE BAKING INDUSTRY

    Directory of Open Access Journals (Sweden)

    Criveanu Maria

    2013-04-01

    Full Text Available Hidden costs are present in the activity of any company, hardly identified in the traditional administrative accounting. The high levels of the hidden costs and their unknown presence have serious consequences on the decisions made by the managers. This paper aims at presenting some aspects related to the hidden costs that occur in the activity of the companies in the baking industry and the possibilities to reduce their level.

  11. Hidden History: A Mobile Application for Discovering Surrounding Landscapes

    OpenAIRE

    2016-01-01

    This thesis work describes the design, development and evaluation of a mobile application called Hidden History. This application lets users discover and explore three types of landscapes (Historic, Scenic and Cultural) using three different modes of discovery (Route, Explore and Tour). Before designing Hidden History, the feature set of other applications that help users explore surrounding landscapes were identified and analyzed. Hidden History was then designed to implement the best fea...

  12. HIDDEN WEB EXTRACTOR DYNAMIC WAY TO UNCOVER THE DEEP WEB

    OpenAIRE

    DR. ANURADHA; BABITA AHUJA

    2012-01-01

    In this era of digital tsunami of information on the web, everyone is completely dependent on the WWW for information retrieval. This has posed a challenging problem in extracting relevant data. Traditional web crawlers focus only on the surface web while the deep web keeps expanding behind the scene. The web databases are hidden behind the query interfaces. In this paper, we propose a Hidden Web Extractor (HWE) that can automatically discover and download data from the Hidden Web databases. ...

  13. Hidden Photons in Aharonov-Bohm-Type Experiments

    OpenAIRE

    Arias, Paola; Diaz, Christian; Diaz, Marco Aurelio; Jaeckel, Joerg; Koch, Benjamin; Redondo, Javier

    2016-01-01

    We discuss the Aharonov-Bohm effect in the presence of hidden photons kinetically mixed with the ordinary electromagnetic photons. The hidden photon field causes a slight phase shift in the observable interference pattern. It is then shown how the limited sensitivity of this experiment can be largely improved. The key observation is that the hidden photon field causes a leakage of the ordinary magnetic field into the supposedly field-free region. The direct measurement of this magnetic field ...

  14. VISIBLE COSTS AND HIDDEN COSTS IN THE BAKING INDUSTRY

    OpenAIRE

    Criveanu Maria; Ţaicu Marian

    2013-01-01

    Hidden costs are present in the activity of any company, hardly identified in the traditional administrative accounting. The high levels of the hidden costs and their unknown presence have serious consequences on the decisions made by the managers. This paper aims at presenting some aspects related to the hidden costs that occur in the activity of the companies in the baking industry and the possibilities to reduce their level.

  15. Improved Algorithm Based on the Parallel Main Line of BUG Theory%基于 BUG 理论的平行主线改进算法

    Institute of Scientific and Technical Information of China (English)

    马晓辉; 丁洪伟; 王梦瑶; 赵一帆

    2016-01-01

    基于 Pioneer3机器人平台提出一种未知环境中的机器人路径规划的改进算法。在 BUG 理论的基础上,通过先锋机器人实时读取机器人角度偏差的能力,即时重新规划机器人到达目标点的路线。改进算法缩短了 BUG 理论中的运动路径,提高了机器人避障的效率。%One of the improved algorithms for robot path planning in an unknown environment is proposed in this paper under the background in Pioneer3 robot platform.Based on the BUG theory and using the ability to read real time deviation of robot angle by pio-neer robot,the robot plans a rode to reach the goal point immediately.The improved algorithm reduces the motion path in the BUG theory and improves the efficiency of the robot obstacle avoidance.

  16. Simple estimates of the hidden beauty pentaquarks masses

    CERN Document Server

    Kopeliovich, Vladimir

    2015-01-01

    The masses of cryptoexotic pentaquarks with hidden beauty are estimated phenomenologically using the results by the LHCb collaboration which discovered recently the cryptoexotic pentaquarks with hidden charm. The expected masses of the hidden beauty pentaquarks are about $10.8\\, GeV$ and $10.7\\,GeV$ in the limit of some kind of heavy quark symmetry. The states with hidden strangeness considered in similar way have masses above $2\\, Gev$, by several hundreds of $MeV$ higher than states discussed previously in connection with the relatively light positive strangeness pentaquark $\\theta^+$.

  17. Critical scaling in hidden state inference for linear Langevin dynamics

    OpenAIRE

    Bravi, Barbara; Sollich, Peter

    2016-01-01

    We consider the problem of inferring the dynamics of unknown (i.e. hidden) nodes from a set of observed trajectories and we study analytically the average prediction error given by the Extended Plefka Expansion applied to it, as presented in [1]. We focus on a stochastic linear dynamics of continuous degrees of freedom interacting via random Gaussian couplings in the infinite network size limit. The expected error on the hidden time courses can be found as the equal-time hidden-to-hidden cova...

  18. The Reputation Evaluation Based on Optimized Hidden Markov Model in E-Commerce

    Directory of Open Access Journals (Sweden)

    Liu Chang

    2013-01-01

    Full Text Available Nowadays, a large number of reputation systems have been deployed in practical applications or investigated in the literature to protect buyers from deception and malicious behaviors in online transactions. As an efficient Bayesian analysis tool, Hidden Markov Model (HMM has been used into e-commerce to describe the dynamic behavior of sellers. Traditional solutions adopt Baum-Welch algorithm to train model parameters which is unstable due to its inability to find a globally optimal solution. Consequently, this paper presents a reputation evaluation mechanism based on the optimized Hidden Markov Model, which is called PSOHMM. The algorithm takes full advantage of the search mechanism in Particle Swarm Optimization (PSO algorithm to strengthen the learning ability of HMM and PSO has been modified to guarantee interval and normalization constraints in HMM. Furthermore, a simplified reputation evaluation framework based on HMM is developed and applied to analyze the specific behaviors of sellers. The simulation experiments demonstrate that the proposed PSOHMM has better performance to search optimal model parameters than BWHMM, has faster convergence speed, and is more stable than BWHMM. Compared with Average and Beta reputation evaluation mechanism, PSOHMM can reflect the behavior changes of sellers more quickly in e-commerce systems.

  19. Hidden photon CDM search at Tokyo

    CERN Document Server

    Suzuki, Jun'ya; Horie, Tomoki; Minowa, Makoto

    2015-01-01

    We report on a search for hidden photon cold dark matter (HP CDM) using a novel technique with a dish antenna. We constructed two independent apparatus: one is aiming at the detection of the HP with a mass of $\\sim\\,\\rm{eV}$ which employs optical instruments, and the other is for a mass of $\\sim5\\times10^{-5}\\, \\rm{eV}$ utilizing a commercially available parabolic antenna facing on a plane reflector. From the result of the measurements, we found no evidence for the existence of HP CDM and set upper limits on the photon-HP mixing parameter $\\chi$.

  20. Maurice Halbwachs: Official and hidden memory

    Directory of Open Access Journals (Sweden)

    Carretero, Angel

    2008-05-01

    Full Text Available This article tries to show, in general terms, how Maurice Halbwachs has discovered presence and vitality in the collective memorieswhich have been excluded from the socially-institutionalized world. In order to decipher his opaque writing, one should try for a sociology of the depths, for a sociological look that, separating itself from the dominant positivism of the social sciences, manages to penetrate the hidden logic that permanently underlies social life. This article seeks to uncover the nature of a collective memory that respects the vicissitudes of time, as well as its difficult relations both with official memory and with the dominant historical record.

  1. Die Beharrlichkeit im Verborgenen Hidden Persistence

    Directory of Open Access Journals (Sweden)

    Paula-Irene Villa

    2003-07-01

    Full Text Available Karin Flaake geht in ihrer psychoanalytischen Interpretation innerfamilialer Konstellationen der Frage nach, wie das Zur-Frau-Werden von jungen Frauen erlebt wird. Dabei kommt den körperliche Wandlungsprozessen der Pubertät und den darin eingelagerten expliziten sowie verborgenen Deutungen des Weiblichen – vor allem des weiblichen Körpers – durch die Eltern eine prominente Rolle zu.Karin Flaake’s psychoanalytical intepretations of family constellations explore how young women experience their coming of age and entering womanhood. Her analysis focuses on the bodily changes which women undergo during puberty and the explicit as well as hidden meanings assigned to them by the parents.

  2. Scaling dimensions in hidden Kerr/CFT

    CERN Document Server

    Lowe, David A; Skanata, Antun

    2011-01-01

    It has been proposed that a hidden conformal field theory (CFT) governs the dynamics of low frequency scattering in a general Kerr black hole background. We further investigate this correspondence by mapping higher order corrections to the massless wave equations in a Kerr background to an expansion within the CFT in terms of higher dimension operators. This implies the presence of infinite towers of CFT primary operators with positive conformal dimensions compatible with unitarity. The exact Kerr background softly breaks the conformal symmetry and the scaling dimensions of these operators run with frequency. The scale-invariant fixed point is dual to a degenerate case of flat spacetime.

  3. Hidden Kerr/CFT at finite frequencies

    CERN Document Server

    Lowe, David A; Skanata, Antun

    2013-01-01

    Massless fields propagating in a generic Kerr black hole background enjoy a hidden SL(2,R)xSL(2,R) symmetry. We determine how the exact mode functions decompose into representations of this symmetry group. This extends earlier results on the low frequency limit of the massless scalar case to finite frequencies and general spin. As an application, we numerically determine the parameters of the representations that appear in quasinormal modes. These results represent a first step to formulating a more precise mapping to a holographic dual conformal field theory for generic black holes.

  4. A New Hidden Web Crawling Approach

    OpenAIRE

    L.Saoudi; A.Boukerram; S.Mhamedi

    2015-01-01

    Traditional search engines deal with the Surface Web which is a set of Web pages directly accessible through hyperlinks and ignores a large part of the Web called hidden Web which is a great amount of valuable information of online database which is “hidden” behind the query forms. To access to those information the crawler have to fill the forms with a valid data, for this reason we propose a new approach which use SQLI technique in order to find the most promising keywords of a specific dom...

  5. Hidden Scale Invariance in Condensed Matter

    DEFF Research Database (Denmark)

    Dyre, J. C.

    2014-01-01

    . This means that the phase diagram becomes effectively one-dimensional with regard to several physical properties. Liquids and solids with isomorphs include most or all van der Waals bonded systems and metals, as well as weakly ionic or dipolar systems. On the other hand, systems with directional bonding...... (hydrogen bonds or covalent bonds) or strong Coulomb forces generally do not exhibit hidden scale invariance. The article reviews the theory behind this picture of condensed matter and the evidence for it coming from computer simulations and experiments...

  6. Fifty Years After, Hidden Children Speak

    Directory of Open Access Journals (Sweden)

    Léa Marcou

    2008-06-01

    Full Text Available “For fifty years, I have not spoken of my childhood years in France during the second world war. A hidden child, I lived under a false name amongst unknown people, being careful – as I had been taught – not to reveal, by a gesture or by a word, that I was Jewish. I knew I was in danger, still not understanding why and I was constantly afraid. I didn't know whether I would see again one day my parents from whom I had been suddenly taken away. Nonetheless what were my pains compared to those of...

  7. Uncovering the Hidden Costs of Offshoring

    DEFF Research Database (Denmark)

    Larsen, Marcus M.; Manning, Stephan; Pedersen, Torben

    2013-01-01

    This study investigates estimation errors due to hidden costs—the costs of implementation that are neglected in strategic decision-making processes—in the context of services offshoring. Based on data from the Offshoring Research Network, we find that decision makers are more likely to make cost......-estimation errors given increasing configuration and task complexity in captive offshoring and offshore outsourcing, respectively. Moreover, we show that experience and a strong orientation toward organizational design in the offshoring strategy reduce the cost-estimation errors that follow from complexity. Our...

  8. Cankerworm-crawl algorithm for line detection%一种直线检测的尺蠖蠕行算法

    Institute of Scientific and Technical Information of China (English)

    关柏青; 于新瑞; 王石刚

    2005-01-01

    从仿生学的角度提出了一种新的直线检测的尺蠖蠕行算法(cankerworm-crawl algorithm).该算法首先根据梯度方向将边缘像素集合划分成为具有一定梯度范围的子集,然后采用蠕行策略在独立的边缘点的子集内进行直线提取.理论分析和实验结果证明:该方法大大减小了直线特征提取的复杂度,并且具有较好的直线检测效果.

  9. THE APPROACHING TRAIN DETECTION ALGORITHM

    Directory of Open Access Journals (Sweden)

    S. V. Bibikov

    2015-09-01

    Full Text Available The paper deals with detection algorithm for rail vibroacoustic waves caused by approaching train on the background of increased noise. The urgency of algorithm development for train detection in view of increased rail noise, when railway lines are close to roads or road intersections is justified. The algorithm is based on the method of weak signals detection in a noisy environment. The information statistics ultimate expression is adjusted. We present the results of algorithm research and testing of the train approach alarm device that implements the proposed algorithm. The algorithm is prepared for upgrading the train approach alarm device “Signalizator-P".

  10. Efficient implementation of a real-time estimation system for thalamocortical hidden Parkinsonian properties

    Science.gov (United States)

    Yang, Shuangming; Deng, Bin; Wang, Jiang; Li, Huiyan; Liu, Chen; Fietkiewicz, Chris; Loparo, Kenneth A.

    2017-01-01

    Real-time estimation of dynamical characteristics of thalamocortical cells, such as dynamics of ion channels and membrane potentials, is useful and essential in the study of the thalamus in Parkinsonian state. However, measuring the dynamical properties of ion channels is extremely challenging experimentally and even impossible in clinical applications. This paper presents and evaluates a real-time estimation system for thalamocortical hidden properties. For the sake of efficiency, we use a field programmable gate array for strictly hardware-based computation and algorithm optimization. In the proposed system, the FPGA-based unscented Kalman filter is implemented into a conductance-based TC neuron model. Since the complexity of TC neuron model restrains its hardware implementation in parallel structure, a cost efficient model is proposed to reduce the resource cost while retaining the relevant ionic dynamics. Experimental results demonstrate the real-time capability to estimate thalamocortical hidden properties with high precision under both normal and Parkinsonian states. While it is applied to estimate the hidden properties of the thalamus and explore the mechanism of the Parkinsonian state, the proposed method can be useful in the dynamic clamp technique of the electrophysiological experiments, the neural control engineering and brain-machine interface studies.

  11. Wavelet-based SAR images despeckling using joint hidden Markov model

    Science.gov (United States)

    Li, Qiaoliang; Wang, Guoyou; Liu, Jianguo; Chen, Shaobo

    2007-11-01

    In the past few years, wavelet-domain hidden Markov models have proven to be useful tools for statistical signal and image processing. The hidden Markov tree (HMT) model captures the key features of the joint probability density of the wavelet coefficients of real-world data. One potential drawback to the HMT framework is the deficiency for taking account of intrascale correlations that exist among neighboring wavelet coefficients. In this paper, we propose to develop a joint hidden Markov model by fusing the wavelet Bayesian denoising technique with an image regularization procedure based on HMT and Markov random field (MRF). The Expectation Maximization algorithm is used to estimate hyperparameters and specify the mixture model. The noise-free wavelet coefficients are finally estimated by a shrinkage function based on local weighted averaging of the Bayesian estimator. It is shown that the joint method outperforms lee filter and standard HMT techniques in terms of the integrative measure of the equivalent number of looks (ENL) and Pratt's figure of merit(FOM), especially when dealing with speckle noise in large variance.

  12. Clustering Multivariate Time Series Using Hidden Markov Models

    Directory of Open Access Journals (Sweden)

    Shima Ghassempour

    2014-03-01

    Full Text Available In this paper we describe an algorithm for clustering multivariate time series with variables taking both categorical and continuous values. Time series of this type are frequent in health care, where they represent the health trajectories of individuals. The problem is challenging because categorical variables make it difficult to define a meaningful distance between trajectories. We propose an approach based on Hidden Markov Models (HMMs, where we first map each trajectory into an HMM, then define a suitable distance between HMMs and finally proceed to cluster the HMMs with a method based on a distance matrix. We test our approach on a simulated, but realistic, data set of 1,255 trajectories of individuals of age 45 and over, on a synthetic validation set with known clustering structure, and on a smaller set of 268 trajectories extracted from the longitudinal Health and Retirement Survey. The proposed method can be implemented quite simply using standard packages in R and Matlab and may be a good candidate for solving the difficult problem of clustering multivariate time series with categorical variables using tools that do not require advanced statistic knowledge, and therefore are accessible to a wide range of researchers.

  13. Landmine detection using discrete hidden Markov models with Gabor features

    Science.gov (United States)

    Frigui, Hichem; Missaoui, Oualid; Gader, Paul

    2007-04-01

    We propose a general method for detecting landmine signatures in vehicle mounted ground penetrating radar (GPR) using discrete hidden Markov models and Gabor wavelet features. Observation vectors are constructed based on the expansion of the signature's B-scan using a bank of scale and orientation selective Gabor filters. This expansion provides localized frequency description that gets encoded in the observation sequence. These observations do not impose an explicit structure on the mine model, and are used to naturally model the time-varying signatures produced by the interaction of the GPR and the landmines as the vehicle moves. The proposed method is evaluated on real data collected by a GPR mounted on a moving vehicle at three different geographical locations that include several lanes. The model parameters are optimized using the BaumWelch algorithm, and lane-based cross-validation, in which each mine lane is in turn treated as a test set with the rest of the lanes used for training, is used to train and test the model. Preliminary results show that observations encoded with Gabor wavelet features perform better than observation encoded with gradient-based edge features.

  14. Inferring topologies of complex networks with hidden variables.

    Science.gov (United States)

    Wu, Xiaoqun; Wang, Weihan; Zheng, Wei Xing

    2012-10-01

    Network topology plays a crucial role in determining a network's intrinsic dynamics and function, thus understanding and modeling the topology of a complex network will lead to greater knowledge of its evolutionary mechanisms and to a better understanding of its behaviors. In the past few years, topology identification of complex networks has received increasing interest and wide attention. Many approaches have been developed for this purpose, including synchronization-based identification, information-theoretic methods, and intelligent optimization algorithms. However, inferring interaction patterns from observed dynamical time series is still challenging, especially in the absence of knowledge of nodal dynamics and in the presence of system noise. The purpose of this work is to present a simple and efficient approach to inferring the topologies of such complex networks. The proposed approach is called "piecewise partial Granger causality." It measures the cause-effect connections of nonlinear time series influenced by hidden variables. One commonly used testing network, two regular networks with a few additional links, and small-world networks are used to evaluate the performance and illustrate the influence of network parameters on the proposed approach. Application to experimental data further demonstrates the validity and robustness of our method.

  15. Hidden Connectivity in Networks with Vulnerable Classes of Nodes

    Science.gov (United States)

    Krause, Sebastian M.; Danziger, Michael M.; Zlatić, Vinko

    2016-10-01

    In many complex systems representable as networks, nodes can be separated into different classes. Often these classes can be linked to a mutually shared vulnerability. Shared vulnerabilities may be due to a shared eavesdropper or correlated failures. In this paper, we show the impact of shared vulnerabilities on robust connectivity and how the heterogeneity of node classes can be exploited to maintain functionality by utilizing multiple paths. Percolation is the field of statistical physics that is generally used to analyze connectivity in complex networks, but in its existing forms, it cannot treat the heterogeneity of multiple vulnerable classes. To analyze the connectivity under these constraints, we describe each class as a color and develop a "color-avoiding" percolation. We present an analytic theory for random networks and a numerical algorithm for all networks, with which we can determine which nodes are color-avoiding connected and whether the maximal set percolates in the system. We find that the interaction of topology and color distribution implies a rich critical behavior, with critical values and critical exponents depending both on the topology and on the color distribution. Applying our physics-based theory to the Internet, we show how color-avoiding percolation can be used as the basis for new topologically aware secure communication protocols. Beyond applications to cybersecurity, our framework reveals a new layer of hidden structure in a wide range of natural and technological systems.

  16. Hidden Semi-Markov Models for Predictive Maintenance

    Directory of Open Access Journals (Sweden)

    Francesco Cartella

    2015-01-01

    Full Text Available Realistic predictive maintenance approaches are essential for condition monitoring and predictive maintenance of industrial machines. In this work, we propose Hidden Semi-Markov Models (HSMMs with (i no constraints on the state duration density function and (ii being applied to continuous or discrete observation. To deal with such a type of HSMM, we also propose modifications to the learning, inference, and prediction algorithms. Finally, automatic model selection has been made possible using the Akaike Information Criterion. This paper describes the theoretical formalization of the model as well as several experiments performed on simulated and real data with the aim of methodology validation. In all performed experiments, the model is able to correctly estimate the current state and to effectively predict the time to a predefined event with a low overall average absolute error. As a consequence, its applicability to real world settings can be beneficial, especially where in real time the Remaining Useful Lifetime (RUL of the machine is calculated.

  17. Hidden Connectivity in Networks with Vulnerable Classes of Nodes

    Directory of Open Access Journals (Sweden)

    Sebastian M. Krause

    2016-10-01

    Full Text Available In many complex systems representable as networks, nodes can be separated into different classes. Often these classes can be linked to a mutually shared vulnerability. Shared vulnerabilities may be due to a shared eavesdropper or correlated failures. In this paper, we show the impact of shared vulnerabilities on robust connectivity and how the heterogeneity of node classes can be exploited to maintain functionality by utilizing multiple paths. Percolation is the field of statistical physics that is generally used to analyze connectivity in complex networks, but in its existing forms, it cannot treat the heterogeneity of multiple vulnerable classes. To analyze the connectivity under these constraints, we describe each class as a color and develop a “color-avoiding” percolation. We present an analytic theory for random networks and a numerical algorithm for all networks, with which we can determine which nodes are color-avoiding connected and whether the maximal set percolates in the system. We find that the interaction of topology and color distribution implies a rich critical behavior, with critical values and critical exponents depending both on the topology and on the color distribution. Applying our physics-based theory to the Internet, we show how color-avoiding percolation can be used as the basis for new topologically aware secure communication protocols. Beyond applications to cybersecurity, our framework reveals a new layer of hidden structure in a wide range of natural and technological systems.

  18. An Effective Method of UAV Flight Path Planning On-Line in Wind Field Using Improved A* Searching Algorithm%基于风场信息的无人机在线航迹规划方法

    Institute of Scientific and Technical Information of China (English)

    屈耀红; 肖自兵; 袁冬莉

    2012-01-01

    To shorten the flight time of UAV, we propose an algorithm of UAV flight path planning on-line under battle field threats. Sections 1 through 3 of the full paper explain our method of flight path planning mentioned in the title, which we believe is better than the existing ones and whose core consists of: "UAV estimates the wind field information on-line using our proposed method during the flight. Then the choice of the extend nodes in A * search algorithm is considered according to the wind direction and the cost function is designed as the flight time". Section 3 is entitled " Method of UAV Flight Path Planning On-Line in Wind Field Using Improved A * Searching Algorithm"; for convenience, we divide it into four sub-sections: 3.1, 3.2, 3.3 and 3.4. Simulation results, presented in Figs. 4 and 5 and Table 2, and their analysis show preliminarily that the flight time is indeed less than that obtained with the traditional method based on the length of the flight path.%风场是影响无人机飞行速度的一个重要因素.为了缩短任务执行中的飞行时间,考虑战场环境存在外界威胁情况,提出了一种利用组合导航在线估计风场信息的无人机航迹规划方法.该方法基于飞行时间为代价,利用改进的A*搜索算法对航迹进行顺风搜索,从而实现最短理想耗时的航迹规划.计算机仿真结果表明,与传统的最短航迹长度规划方法相比,无人机按该方法规划的航迹飞行时,理想耗时最少.

  19. Landmine detection using mixture of discrete hidden Markov models

    Science.gov (United States)

    Frigui, Hichem; Hamdi, Anis; Missaoui, Oualid; Gader, Paul

    2009-05-01

    We propose a landmine detection algorithm that uses a mixture of discrete hidden Markov models. We hypothesize that the data are generated by K models. These different models reflect the fact that mines and clutter objects have different characteristics depending on the mine type, soil and weather conditions, and burial depth. Model identification could be achieved through clustering in the parameters space or in the feature space. However, this approach is inappropriate as it is not trivial to define a meaningful distance metric for model parameters or sequence comparison. Our proposed approach is based on clustering in the log-likelihood space, and has two main steps. First, one HMM is fit to each of the R individual sequence. For each fitted model, we evaluate the log-likelihood of each sequence. This will result in an R×R log-likelihood distance matrix that will be partitioned into K groups using a hierarchical clustering algorithm. In the second step, we pool the sequences, according to which cluster they belong, into K groups, and we fit one HMM to each group. The mixture of these K HMMs would be used to build a descriptive model of the data. An artificial neural networks is then used to fuse the output of the K models. Results on large and diverse Ground Penetrating Radar data collections show that the proposed method can identify meaningful and coherent HMM models that describe different properties of the data. Each HMM models a group of alarm signatures that share common attributes such as clutter, mine type, and burial depth. Our initial experiments have also indicated that the proposed mixture model outperform the baseline HMM that uses one model for the mine and one model for the background.

  20. Women's hidden transcripts about abortion in Brazil.

    Science.gov (United States)

    Nations, M K; Misago, C; Fonseca, W; Correia, L L; Campbell, O M

    1997-06-01

    Two folk medical conditions, "delayed" (atrasada) and "suspended" (suspendida) menstruation, are described as perceived by poor Brazilian women in Northeast Brazil. Culturally prescribed methods to "regulate" these conditions and provoke menstrual bleeding are also described, including ingesting herbal remedies, patent drugs, and modern pharmaceuticals. The ingestion of such self-administered remedies is facilitated by the cognitive ambiguity, euphemisms, folklore, etc., which surround conception and gestation. The authors argue that the ethnomedical conditions of "delayed" and "suspended" menstruation and subsequent menstrual regulation are part of the "hidden reproductive transcript" of poor and powerless Brazilian women. Through popular culture, they voice their collective dissent to the official, public opinion about the illegality and immorality of induced abortion and the chronic lack of family planning services in Northeast Brazil. While many health professionals consider women's explanations of menstrual regulation as a "cover-up" for self-induced abortions, such popular justifications may represent either an unconscious or artful manipulation of hegemonic, anti-abortion ideology expressed in prudent, unobtrusive and veiled ways. The development of safer abortion alternatives should consider women's hidden reproductive transcripts.