WorldWideScience

Sample records for arc-annotated subsequence matching

  1. Fast Arc-Annotated Subsequence Matching in Linear Space

    DEFF Research Database (Denmark)

    Bille, Philip; Gørtz, Inge Li

    2010-01-01

    for investigating the function of RNA molecules. Gramm et al. [ACM Trans. Algorithms 2006] gave an algorithm for this problem using O(nm) time and space, where m and n are the lengths of P and Q, respectively. In this paper we present; a new algorithm using O(nm) time and O(n+m,) space, thereby matching...... the previous time bound while significantly reducing the space from a quadratic term to linear. This is essential to process large RNA molecules where the space is a likely to be a bottleneck. To obtain our result we introduce several novel ideas which may be of independent interest for related problems on arc...

  2. Arc-preserving subsequences of arc-annotated sequences

    CERN Document Server

    Popov, Vladimir Yu

    2011-01-01

    Arc-annotated sequences are useful in representing the structural information of RNA and protein sequences. The longest arc-preserving common subsequence problem has been introduced as a framework for studying the similarity of arc-annotated sequences. In this paper, we consider arc-annotated sequences with various arc structures. We consider the longest arc preserving common subsequence problem. In particular, we show that the decision version of the 1-{\\sc fragment LAPCS(crossing,chain)} and the decision version of the 0-{\\sc diagonal LAPCS(crossing,chain)} are {\\bf NP}-complete for some fixed alphabet $\\Sigma$ such that $|\\Sigma| = 2$. Also we show that if $|\\Sigma| = 1$, then the decision version of the 1-{\\sc fragment LAPCS(unlimited, plain)} and the decision version of the 0-{\\sc diagonal LAPCS(unlimited, plain)} are {\\bf NP}-complete.

  3. Pattern matching in indeterminate and Arc-annotated sequences.

    Science.gov (United States)

    Aumi, Md Tanvir Islam; Moosa, Tanaeem M; Rahman, M Sohel

    2013-08-01

    In this paper, we present efficient algorithms for finding indeterminate Arc-Annotated patterns in indeterminate Arc-Annotated references. Our algorithms run in O(m+ (nm) w) time where n and m are respectively the length of our reference and pattern strings and w is the target machine word size. Here we have assumed the alphabet size to be constant, because, indeterminate Arc-Annotated sequences are used to model biological sequences. Clearly, for short patterns, our algorithms run in linear time and efficient algorithms for matching short patterns to reference genomes have huge applications in practical settings. We have also applied our algorithms to scan the ncRNAs without pseudoknots. We scanned three whole human chromosomes and it took only 2.5 - 4 minutes to scan one whole chromosome for an ncRNA family. Some relevant patents are discussed in.

  4. Matching Subsequences in Trees

    DEFF Research Database (Denmark)

    Bille, Philip; Gørtz, Inge Li

    2009-01-01

    Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the root and ends at a leaf. In this paper we propose this problem as a useful query primitive for XML data, and provide new...

  5. Compressed Subsequence Matching and Packed Tree Coloring

    DEFF Research Database (Denmark)

    Bille, Philip; Cording, Patrick Hagge; Gørtz, Inge Li

    2017-01-01

    We present a new algorithm for subsequence matching in grammar compressed strings. Given a grammar of size n compressing a string of size N and a pattern string of size m over an alphabet of size \\(\\sigma \\), our algorithm uses \\(O(n+\\frac{n\\sigma }{w})\\) space and \\(O(n+\\frac{n\\sigma }{w}+m\\log N......\\log w\\cdot occ)\\) or \\(O(n+\\frac{n\\sigma }{w}\\log w+m\\log N\\cdot occ)\\) time. Here w is the word size and occ is the number of minimal occurrences of the pattern. Our algorithm uses less space than previous algorithms and is also faster for \\(occ=o(\\frac{n}{\\log N})\\) occurrences. The algorithm uses...... a new data structure that allows us to efficiently find the next occurrence of a given character after a given position in a compressed string. This data structure in turn is based on a new data structure for the tree color problem, where the node colors are packed in bit strings....

  6. Linear Detrending Subsequence Matching in Time-Series Databases

    CERN Document Server

    Gil, Myeong-Seon; Kim, Bum-Soo

    2010-01-01

    Each time-series has its own linear trend, the directionality of a timeseries, and removing the linear trend is crucial to get the more intuitive matching results. Supporting the linear detrending in subsequence matching is a challenging problem due to a huge number of possible subsequences. In this paper we define this problem the linear detrending subsequence matching and propose its efficient index-based solution. To this end, we first present a notion of LD-windows (LD means linear detrending), which is obtained as follows: we eliminate the linear trend from a subsequence rather than each window itself and obtain LD-windows by dividing the subsequence into windows. Using the LD-windows we then present a lower bounding theorem for the index-based matching solution and formally prove its correctness. Based on the lower bounding theorem, we next propose the index building and subsequence matching algorithms for linear detrending subsequence matching.We finally show the superiority of our index-based solution...

  7. Energetics demands and physiological responses to boxing match and subsequent recovery.

    Science.gov (United States)

    Nassib, Sabri; Hammoudi-Nassib, Sarra; Chtara, Mokhtar; Mkaouer, Bessem; Maaouia, Ghazwa; Bezrati-Benayed, Ikram; Chamari, Karim

    2017-01-01

    Determining the physiological profile of athletes in boxing match is important for defining aspects of physical performance that are important to competitive performance. Therefore, examination of the energy pathway of high-level boxers' athletes can be very helpful for optimizing training and then improving boxing physical fitness and performance. The aim of the present study was to assess the physiological and cardiovascular responses during boxing matches and subsequent recovery. Fifteen male international level boxers (mean age 19.56±3.6 years; mean body mass 72.46±11.86 kg; mean height 176.50±7.22 cm) participated in this study. Blood samples were drawn from the antecubital vein before and after the boxing matches (T1: pre-match rest measure around 11:00 a.m., T2: measure at 3 minutes of post-match recovery; T3: measure at 60 minutes of recovery; T4: measure at 24 hours post-match - the match started around 11:30 a.m.). An analysis of glucose, triglycerides, lactate, cholesterol, creatinine, uric-acid, high density lipoprotein, and low density lipoprotein concentrations was performed for each sample. Participants did perform a maximal incremental test to measure maximal heart rate (HRmax). Heart rate responses to the matches were measured and expressed in percentage of HRmax. The average HR recorded during the match corresponded to 93±3.26% of HRmax. The levels of glucose, lactate, and cholesterol increased significantly from T1 to T2. Likewise, creatinine levels increased significantly from T1 to T2 and T3. However, the cholesterol level decreased significantly at T3 in comparison with T1. Moreover, 24-hour post-match creatinine levels were significantly lower and triglyceride levels were significantly higher compared with T1. The main results of this study revealed that the boxing matches stress the lipid metabolism system during boxing and post-match (for at least 24 hours) even if it is widely recognized boxing being mainly composed of repeated short

  8. Spanking and subsequent behavioral problems in toddlers: A propensity score-matched, prospective study in Japan.

    Science.gov (United States)

    Okuzono, Sakurako; Fujiwara, Takeo; Kato, Tsuguhiko; Kawachi, Ichiro

    2017-07-01

    Harsh or frequent spanking in early childhood is an established risk factor for later childhood behavioral problems as well as mental disorder in adulthood in Western societies. However, few studies have been conducted in Asian populations, where corporal punishment is relatively accepted. Moreover, the impacts of occasional spanking on subsequent behavioral problems remain uncertain. This study sought to investigate prospectively the association between the frequency of spanking of toddlers and later behavioral problems in Japanese children using national birth cohort data. We used data from the Longitudinal Survey of Newborns in the 21st Century, a population-based birth cohort data set collected by the Japanese Ministry of Health, Labour, and Welfare (N=29,182). Frequency of spanking ("never", "sometimes" and "always") and child behavioral problems were assessed via a caregiver questionnaire when the child was 3.5 years old and again at 5.5 years. Propensity score matching was used to examine the association between frequency of spanking and child behavioral problems, adjusting for parental socioeconomic status, child temperament and parenting behaviors. Compared to children who were never spanked, occasional spanking ("sometimes") showed a higher number of behavioral problems (on a 6-point scale) (coefficient: 0.11, 95% CI: 0.07-0.15), and frequent spanking ("always") showed an even larger number of behavioral problems compared with "sometimes" (coefficient: 0.08, 95% CI:0.01-0.16). Spanking of any self-reported frequency was associated with an increased risk for later behavioral problems in children. Copyright © 2017 Elsevier Ltd. All rights reserved.

  9. Identifying stimuli that alter immediate and subsequent levels of vocal stereotypy: a further analysis of functionally matched stimulation.

    Science.gov (United States)

    Lanovaz, Marc J; Fletcher, Sarah E; Rapp, John T

    2009-09-01

    We used a three-component multiple-schedule with a brief reversal design to evaluate the effects of structurally unmatched and matched stimuli on immediate and subsequent vocal stereotypy that was displayed by three children with autism spectrum disorders. For 2 of the 3 participants, access to matched stimuli, unmatched stimuli, and music decreased immediate levels of vocal stereotypy; however, with the exception of matched stimuli for one participant, none of the stimuli produced a clear abolishing operation for subsequent vocal stereotypy. That is, vocal stereotypy typically increased to baseline levels shortly after alternative stimulation was removed. Detection of motivating operations for each participant's vocal stereotypy was aided by the analysis of component distributions. The results are discussed in terms of immediate and subsequent effects of preferred stimuli on automatically reinforced problem behavior.

  10. Functional Outcomes, Subsequent Healthcare Utilization, and Mortality of Stroke Postacute Care Patients in Taiwan: A Nationwide Propensity Score-matched Study.

    Science.gov (United States)

    Peng, Li-Ning; Lu, Wan-Hsuan; Liang, Chih-Kuang; Chou, Ming-Yueh; Chung, Chih-Ping; Tsai, Shu-Ling; Chen, Zhi-Jun; Hsiao, Fei-Yuan; Chen, Liang-Kung

    2017-08-10

    To evaluate the benefits of the national stroke postacute care (PAC) program on clinical outcomes and subsequent healthcare utilization. Propensity score-matched case-control study using the National Health Insurance data. A total of 1480 stroke cases receiving PAC services and 3159 matched controls with similar stroke severity but without PAC services. Demographic characteristics, functional outcomes (modified Rankin Scale, Barthel Index, Lawton-Brody Instrumental Activities of Daily Living, Functional Oral Intake Scale, Mini-Nutritional Assessment, Berg Balance Test, Usual Gait Speed Test, 6-Minute Walk Test, Fugl-Meyer Assessment (modified sensation and motor), Mini-Mental State Examination, Motor Activity Log, and the Concise Chinese Aphasia Test), subsequent healthcare utilization (90-day stroke re-admission and emergency department visits), and 90-day mortality. After propensity score matching, baseline characteristics, stroke severity, and status of healthcare utilization before index stroke admission were similar between cases and controls. After PAC services, the case group obtained significant improvement in all functional domains and may have reduced subsequent disability. Among all functional assessments, balance was the most significantly improved domain and was suggestive for the reduction of subsequent falls risk and related injuries. Compared with controls, patients receiving PAC services had significantly lower 90-day hospital re-admissions [11.1% vs 21.0%, adjusted odds ratio (aOR) 0.47 with 95% confidence interval (CI) 0.34-0.64], stroke-related re-admissions (2.1% vs 8.8%, aOR 0.22, 95% CI 0.12-0.41), and emergency department visits (13.5% vs 24.0%, aOR 0.49, 95% CI 0.37-0.65), but the 90-day mortality rate remained similar between groups (1.4% case group vs 2.0% control group, aOR 0.68, 95% CI 0.29-1.62). PAC significantly improved the recovery of stroke patients in all functional domains through the program, with universal interorganizational

  11. The effects of different pre-game motivational interventions on athlete free hormonal state and subsequent performance in professional rugby union matches.

    Science.gov (United States)

    Cook, Christian J; Crewther, Blair T

    2012-07-16

    We examined the effect of different pre-match motivational interventions on athlete free testosterone (T) and cortisol (C) concentrations and subsequent match performance in professional rugby union. Male participants (n=12) playing at a senior or academy level in rugby union were recruited and each completed three interventions (15 min each) before a competitive game; 1) watching a video clip of successful skill execution by the player with positive coach feedback [VPCF1]; 2) watching a video clip of successful skill execution by an opposing player with cautionary coach feedback [VCCF], 3) the player left alone to self-motivate [SM1]. The first and last interventions were retested [VPCF2 and SM2]. Salivary free T and C measures were taken pre-intervention and pre-game. Within each game, players were rated by coaching staff on a key performance indicator (KPI) from identified skills and an overall performance indicator (OPI), where 1 = best performance to 5 = worst performance. The VPCF1 and VPCF2 interventions both promoted significant T responses (11.8% to 12.5%) before each game and more so than SM1, SM2 and VCCF. The VCCF approach produced the largest C response (17.6%) and this differed from all other treatments. The VPCF interventions were also associated with better game KPI (1.5 to 1.8) and OPI ratings (1.7 to 1.8) than SM1, SM2 and/or VCCF. Across all treatments, greater individual T responses and lower C responses were associated with better KPI and OPI outcomes. In conclusion, the pre-game presentation of motivational strategies to athletes involving specific video footage and coach feedback produced different outcomes on two indicators of match performance, which were also associated with changes in free hormonal state. Copyright © 2012 Elsevier Inc. All rights reserved.

  12. Matching theory

    CERN Document Server

    Plummer, MD

    1986-01-01

    This study of matching theory deals with bipartite matching, network flows, and presents fundamental results for the non-bipartite case. It goes on to study elementary bipartite graphs and elementary graphs in general. Further discussed are 2-matchings, general matching problems as linear programs, the Edmonds Matching Algorithm (and other algorithmic approaches), f-factors and vertex packing.

  13. Pattern matching

    NARCIS (Netherlands)

    A. Hak (Tony); J. Dul (Jan)

    2009-01-01

    textabstractPattern matching is comparing two patterns in order to determine whether they match (i.e., that they are the same) or do not match (i.e., that they differ). Pattern matching is the core procedure of theory-testing with cases. Testing consists of matching an “observed pattern” (a pattern

  14. Pattern matching

    OpenAIRE

    Hak, Tony; Dul, Jan

    2009-01-01

    textabstractPattern matching is comparing two patterns in order to determine whether they match (i.e., that they are the same) or do not match (i.e., that they differ). Pattern matching is the core procedure of theory-testing with cases. Testing consists of matching an “observed pattern” (a pattern of measured values) with an “expected pattern” (a hypothesis), and deciding whether these patterns match (resulting in a confirmation of the hypothesis) or do not match (resulting in a disconfirmat...

  15. Matching Matters!

    CERN Document Server

    Freitas, Ayres; Plehn, Tilman

    2016-01-01

    Effective Lagrangians are a useful tool for a data-driven approach to physics beyond the Standard Model at the LHC. However, for the new physics scales accessible at the LHC, the effective operator expansion is only relatively slowly converging at best. For tree-level processes, it has been found that the agreement between the effective Lagrangian and a range of UV-complete models depends sensitively on the appropriate definition of the matching. We extend this analysis to the one-loop level, which is relevant for electroweak precision data and Higgs decay to photons. We show that near the scale of electroweak symmetry breaking the validity of the effective theory description can be systematically improved through an appropriate matching procedure. In particular, we find a significant increase in accuracy when including suitable terms suppressed by the Higgs vacuum expectation value in the matching.

  16. Truecluster matching

    CERN Document Server

    Oehlschlägel, Jens

    2007-01-01

    Cluster matching by permuting cluster labels is important in many clustering contexts such as cluster validation and cluster ensemble techniques. The classic approach is to minimize the euclidean distance between two cluster solutions which induces inappropriate stability in certain settings. Therefore, we present the truematch algorithm that introduces two improvements best explained in the crisp case. First, instead of maximizing the trace of the cluster crosstable, we propose to maximize a chi-square transformation of this crosstable. Thus, the trace will not be dominated by the cells with the largest counts but by the cells with the most non-random observations, taking into account the marginals. Second, we suggest a probabilistic component in order to break ties and to make the matching algorithm truly random on random data. The truematch algorithm is designed as a building block of the truecluster framework and scales in polynomial time. First simulation results confirm that the truematch algorithm give...

  17. Fast and compact regular expression matching

    DEFF Research Database (Denmark)

    Bille, Philip; Farach-Colton, Martin

    2008-01-01

    We study 4 problems in string matching, namely, regular expression matching, approximate regular expression matching, string edit distance, and subsequence indexing, on a standard word RAM model of computation that allows logarithmic-sized words to be manipulated in constant time. We show how...

  18. Reducing the likelihood of long tennis matches.

    Science.gov (United States)

    Barnett, Tristan; Alan, Brown; Pollard, Graham

    2006-01-01

    Long matches can cause problems for tournaments. For example, the starting times of subsequent matches can be substantially delayed causing inconvenience to players, spectators, officials and television scheduling. They can even be seen as unfair in the tournament setting when the winner of a very long match, who may have negative aftereffects from such a match, plays the winner of an average or shorter length match in the next round. Long matches can also lead to injuries to the participating players. One factor that can lead to long matches is the use of the advantage set as the fifth set, as in the Australian Open, the French Open and Wimbledon. Another factor is long rallies and a greater than average number of points per game. This tends to occur more frequently on the slower surfaces such as at the French Open. The mathematical method of generating functions is used to show that the likelihood of long matches can be substantially reduced by using the tiebreak game in the fifth set, or more effectively by using a new type of game, the 50-40 game, throughout the match. Key PointsThe cumulant generating function has nice properties for calculating the parameters of distributions in a tennis matchA final tiebreaker set reduces the length of matches as currently being used in the US OpenA new 50-40 game reduces the length of matches whilst maintaining comparable probabilities for the better player to win the match.

  19. Fingerprint Matching and Non-Matching Analysis for Different Tolerance Rotation Degrees in Commercial Matching Algorithms

    Directory of Open Access Journals (Sweden)

    A. J. Perez-Diaz

    2010-08-01

    Full Text Available Fingerprint verification is the most important step in the fingerprint-based biometric systems. The matching score islinked to the chance of identifying a person. Nowadays, two fingerprint matching methods are the most popular: thecorrelation-based method and the minutiae-based method. In this work, three biometric systems were evaluated:Neurotechnology Verifinger 6.0 Extended, Innovatrics IDKit SDK and Griaule Fingerprint SDK 2007. The evaluationwas performed according to the experiments of the Fingerprint Verification Competition (FVC. The influence of thefingerprint rotation degrees on false match rate (FMR and false non-match rate (FNMR was evaluated. The resultsshowed that the FMR values increase as rotation degrees increase too, meanwhile, the FNMR values decrease.Experimental results demonstrate that Verifinger SDK shows good performance on false non-match testing, with anFNMR mean of 7%, followed by IDKit SDK (6.71% ~ 13.66% and Fingerprint SDK (50%. However, Fingerprint SDKdemonstrates a better performance on false match testing, with an FMR mean of ~0%, followed by Verifinger SDK(7.62% - 9% and IDKit SDK (above 28%. As result of the experiments, Verifinger SDK had, in general, the bestperformance. Subsequently, we calculated the regression functions to predict the behavior of FNMR and FMR fordifferent threshold values with different rotation degrees.

  20. Statistics of polarisation matching

    NARCIS (Netherlands)

    Naus, H.W.L.; Zwamborn, A.P.M.

    2014-01-01

    The reception of electromagnetic signals depends on the polarisation matching of the transmitting and receiving antenna. The practical matching differs from the theoretical one because of the noise deterioration of the transmitted and eventually received electromagnetic field. In other applications,

  1. Matching Through Position Auctions

    OpenAIRE

    Terence Johnson

    2009-01-01

    This paper studies how an intermediary should design two-sided matching markets when agents are privately informed about their quality as a partner and can make payments to the intermediary. Using a mechanism design approach, I derive sufficient conditions for assortative matching to be profit- or welfare-maximizing, and then show how to implement the optimal match and payments through two-sided position auctions. This sharpens our understanding of intermediated matching markets by clarifying...

  2. Hierarchical model of matching

    Science.gov (United States)

    Pedrycz, Witold; Roventa, Eugene

    1992-01-01

    The issue of matching two fuzzy sets becomes an essential design aspect of many algorithms including fuzzy controllers, pattern classifiers, knowledge-based systems, etc. This paper introduces a new model of matching. Its principal features involve the following: (1) matching carried out with respect to the grades of membership of fuzzy sets as well as some functionals defined on them (like energy, entropy,transom); (2) concepts of hierarchies in the matching model leading to a straightforward distinction between 'local' and 'global' levels of matching; and (3) a distributed character of the model realized as a logic-based neural network.

  3. Best matching theory & applications

    CERN Document Server

    Moghaddam, Mohsen

    2017-01-01

    Mismatch or best match? This book demonstrates that best matching of individual entities to each other is essential to ensure smooth conduct and successful competitiveness in any distributed system, natural and artificial. Interactions must be optimized through best matching in planning and scheduling, enterprise network design, transportation and construction planning, recruitment, problem solving, selective assembly, team formation, sensor network design, and more. Fundamentals of best matching in distributed and collaborative systems are explained by providing: § Methodical analysis of various multidimensional best matching processes § Comprehensive taxonomy, comparing different best matching problems and processes § Systematic identification of systems’ hierarchy, nature of interactions, and distribution of decision-making and control functions § Practical formulation of solutions based on a library of best matching algorithms and protocols, ready for direct applications and apps development. Design...

  4. REDUCING THE LIKELIHOOD OF LONG TENNIS MATCHES

    Directory of Open Access Journals (Sweden)

    Tristan Barnett

    2006-12-01

    Full Text Available Long matches can cause problems for tournaments. For example, the starting times of subsequent matches can be substantially delayed causing inconvenience to players, spectators, officials and television scheduling. They can even be seen as unfair in the tournament setting when the winner of a very long match, who may have negative aftereffects from such a match, plays the winner of an average or shorter length match in the next round. Long matches can also lead to injuries to the participating players. One factor that can lead to long matches is the use of the advantage set as the fifth set, as in the Australian Open, the French Open and Wimbledon. Another factor is long rallies and a greater than average number of points per game. This tends to occur more frequently on the slower surfaces such as at the French Open. The mathematical method of generating functions is used to show that the likelihood of long matches can be substantially reduced by using the tiebreak game in the fifth set, or more effectively by using a new type of game, the 50-40 game, throughout the match

  5. Uncertain Schema Matching

    CERN Document Server

    Gal, Avigdor

    2011-01-01

    Schema matching is the task of providing correspondences between concepts describing the meaning of data in various heterogeneous, distributed data sources. Schema matching is one of the basic operations required by the process of data and schema integration, and thus has a great effect on its outcomes, whether these involve targeted content delivery, view integration, database integration, query rewriting over heterogeneous sources, duplicate data elimination, or automatic streamlining of workflow activities that involve heterogeneous data sources. Although schema matching research has been o

  6. Matchings in hexagonal cacti

    Directory of Open Access Journals (Sweden)

    E. J. Farrell

    1987-01-01

    Full Text Available Explicit recurrences are derived for the matching polynomials of the basic types of hexagonal cacti, the linear cactus and the star cactus and also for an associated graph, called the hexagonal crown. Tables of the polynomials are given for each type of graph. Explicit formulae are then obtained for the number of defect-d matchings in the graphs, for various values of d. In particular, formulae are derived for the number of perfect matchings in all three types of graphs. Finally, results are given for the total number of matchings in the graphs.

  7. Association of Periodontitis and Subsequent Depression

    Science.gov (United States)

    Hsu, Chih-Chao; Hsu, Yi-Chao; Chen, Hsuan-Ju; Lin, Che-Chen; Chang, Kuang-Hsi; Lee, Chang-Yin; Chong, Lee-Won; Kao, Chia-Hung

    2015-01-01

    Abstract Periodontitis is a systemic and chronic inflammatory disease associated with multiple physical conditions. Distress and depression are other problems affecting the progression of periodontitis. However, the causal relationship between depression and periodontitis has not been adequately investigated. This aim of this study was to determine the association between periodontitis and the subsequent development of depression. We identified 12,708 patients with newly diagnosed periodontitis from 2000 to 2005 and 50,832 frequency-matched individuals without periodontitis. Both groups were followed until diagnosed with depression, withdrawal from the National Health Insurance program, or the end of 2011. The association between periodontitis and depressio was analyzed using Cox proportional hazard regression models. The incidence density rate of depression was higher in the periodontitis group than in the nonperiodontitis group, with an adjusted hazard ratio of 1.73 (95% confidence interval 1.58–1.89) when adjusting for sex, age, and comorbidity. Cox models revealed that periodontitis was an independent risk factor for depression in patients, except for comorbidities of diabetes mellitus (DM), alcohol abuse, and cancer. Periodontitis may increase the risk of subsequent depression and was suggested an independent risk factor regardless of sex, age, and most comorbidities. However, DM, alcohol abuse, and cancer may prevent the development of subsequent depression because of DM treatment, the paradoxical effect of alcohol, and emotional distress to cancer, respectively. Prospective studies on the relationship between periodontitis and depression are warranted. PMID:26705230

  8. Ontology Matching Across Domains

    Science.gov (United States)

    2010-05-01

    matching include GMO [1], Anchor-Prompt [2], and Similarity Flooding [3]. GMO is an iterative structural matcher, which uses RDF bipartite graphs to...AFRL under contract# FA8750-09-C-0058. References [1] Hu, W., Jian, N., Qu, Y., Wang, Y., “ GMO : a graph matching for ontologies”, in: Proceedings of

  9. Learning Graph Matching

    CERN Document Server

    Caetano, Tiberio S; Cheng, Li; Le, Quoc V; Smola, Alex J

    2008-01-01

    As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. Many formulations of this problem can be cast in general as a quadratic assignment problem, where a linear term in the objective function encodes node compatibility and a quadratic term encodes edge compatibility. The main research focus in this theme is about designing efficient algorithms for approximately solving the quadratic assignment problem, since it is NP-hard. In this paper we turn our attention to a different question: how to estimate compatibility functions such that the solution of the resulting graph matching problem best matches the expected solution that a human would manually provide. We present a method for learning graph matching: the training examples are pairs of graphs and the `labels' are ma...

  10. Matched-pair classification

    Energy Technology Data Exchange (ETDEWEB)

    Theiler, James P [Los Alamos National Laboratory

    2009-01-01

    Following an analogous distinction in statistical hypothesis testing, we investigate variants of machine learning where the training set comes in matched pairs. We demonstrate that even conventional classifiers can exhibit improved performance when the input data has a matched-pair structure. Online algorithms, in particular, converge quicker when the data is presented in pairs. In some scenarios (such as the weak signal detection problem), matched pairs can be generated from independent samples, with the effect not only doubling the nominal size of the training set, but of providing the structure that leads to better learning. A family of 'dipole' algorithms is introduced that explicitly takes advantage of matched-pair structure in the input data and leads to further performance gains. Finally, we illustrate the application of matched-pair learning to chemical plume detection in hyperspectral imagery.

  11. Learning graph matching.

    Science.gov (United States)

    Caetano, Tibério S; McAuley, Julian J; Cheng, Li; Le, Quoc V; Smola, Alex J

    2009-06-01

    As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. Many formulations of this problem can be cast in general as a quadratic assignment problem, where a linear term in the objective function encodes node compatibility and a quadratic term encodes edge compatibility. The main research focus in this theme is about designing efficient algorithms for approximately solving the quadratic assignment problem, since it is NP-hard. In this paper we turn our attention to a different question: how to estimate compatibility functions such that the solution of the resulting graph matching problem best matches the expected solution that a human would manually provide. We present a method for learning graph matching: the training examples are pairs of graphs and the 'labels' are matches between them. Our experimental results reveal that learning can substantially improve the performance of standard graph matching algorithms. In particular, we find that simple linear assignment with such a learning scheme outperforms Graduated Assignment with bistochastic normalisation, a state-of-the-art quadratic assignment relaxation algorithm.

  12. Latent fingerprint matching.

    Science.gov (United States)

    Jain, Anil K; Feng, Jianjiang

    2011-01-01

    Latent fingerprint identification is of critical importance to law enforcement agencies in identifying suspects: Latent fingerprints are inadvertent impressions left by fingers on surfaces of objects. While tremendous progress has been made in plain and rolled fingerprint matching, latent fingerprint matching continues to be a difficult problem. Poor quality of ridge impressions, small finger area, and large nonlinear distortion are the main difficulties in latent fingerprint matching compared to plain or rolled fingerprint matching. We propose a system for matching latent fingerprints found at crime scenes to rolled fingerprints enrolled in law enforcement databases. In addition to minutiae, we also use extended features, including singularity, ridge quality map, ridge flow map, ridge wavelength map, and skeleton. We tested our system by matching 258 latents in the NIST SD27 database against a background database of 29,257 rolled fingerprints obtained by combining the NIST SD4, SD14, and SD27 databases. The minutiae-based baseline rank-1 identification rate of 34.9 percent was improved to 74 percent when extended features were used. In order to evaluate the relative importance of each extended feature, these features were incrementally used in the order of their cost in marking by latent experts. The experimental results indicate that singularity, ridge quality map, and ridge flow map are the most effective features in improving the matching accuracy.

  13. Optimal Packed String Matching

    DEFF Research Database (Denmark)

    Ben-Kiki, Oren; Bille, Philip; Breslauer, Dany

    2011-01-01

    In the packed string matching problem, each machine word accommodates – characters, thus an n-character text occupies n/– memory words. We extend the Crochemore-Perrin constantspace O(n)-time string matching algorithm to run in optimal O(n/–) time and even in real-time, achieving a factor – speedup...... over traditional algorithms that examine each character individually. Our solution can be efficiently implemented, unlike prior theoretical packed string matching work. We adapt the standard RAM model and only use its AC0 instructions (i.e., no multiplication) plus two specialized AC0 packed string...

  14. Pediatric MATCH Infographic

    Science.gov (United States)

    Infographic explaining NCI-COG Pediatric MATCH, a cancer treatment clinical trial for children and adolescents, from 1 to 21 years of age, that is testing the use of precision medicine for pediatric cancers.

  15. Data Matching Imputation System

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — The DMIS dataset is a flat file record of the matching of several data set collections. Primarily it consists of VTRs, dealer records, Observer data in conjunction...

  16. Cognitive Levels Matching.

    Science.gov (United States)

    Brooks, Martin; And Others

    1983-01-01

    The Cognitive Levels Matching Project trains teachers to guide students' skill acquisition and problem-solving processes by assessing students' cognitive levels and adapting their teaching materials accordingly. (MLF)

  17. Human-eye versus computerized color matching.

    Science.gov (United States)

    Yap, A U; Sim, C P; Loh, W L; Teo, J H

    1999-01-01

    This project compared the difference in color matching between human-eye assessment and computerized colorimetry. Fifty dental personnel were asked to color match Vita Lumin shade tabs to seven different randomly arranged test tabs from the Z100 shade guide. All evaluators were blinded to the shades of the test tabs and were asked to match only body shade of the Vita Lumin tab to the middle third or body of each test tab. The results obtained were subsequently computed into L*a*b* values and compared with results obtained by computerized colorimetry. Results indicate that the difference in color matching between human-eye assessment and computerized colorimetry is shade dependent. Discrepancy was significant for b* coordinates for shades A1 and B2 and L* and b* coordinates for shade C4. For all shades evaluated, color difference between human-eye and computerized color matching is perceivable under clinical settings, as delta E values are greater than 3. There is a need for correction factors in the formal specification of the color-matching software due to the discrepancy between human-eye and computerized colorimetric color matching.

  18. Approaches for Stereo Matching

    Directory of Open Access Journals (Sweden)

    Takouhi Ozanian

    1995-04-01

    Full Text Available This review focuses on the last decade's development of the computational stereopsis for recovering three-dimensional information. The main components of the stereo analysis are exposed: image acquisition and camera modeling, feature selection, feature matching and disparity interpretation. A brief survey is given of the well known feature selection approaches and the estimation parameters for this selection are mentioned. The difficulties in identifying correspondent locations in the two images are explained. Methods as to how effectively to constrain the search for correct solution of the correspondence problem are discussed, as are strategies for the whole matching process. Reasons for the occurrence of matching errors are considered. Some recently proposed approaches, employing new ideas in the modeling of stereo matching in terms of energy minimization, are described. Acknowledging the importance of computation time for real-time applications, special attention is paid to parallelism as a way to achieve the required level of performance. The development of trinocular stereo analysis as an alternative to the conventional binocular one, is described. Finally a classification based on the test images for verification of the stereo matching algorithms, is supplied.

  19. Schema matching and mapping

    CERN Document Server

    Bellahsene, Zohra; Rahm, Erhard

    2011-01-01

    Requiring heterogeneous information systems to cooperate and communicate has now become crucial, especially in application areas like e-business, Web-based mash-ups and the life sciences. Such cooperating systems have to automatically and efficiently match, exchange, transform and integrate large data sets from different sources and of different structure in order to enable seamless data exchange and transformation. The book edited by Bellahsene, Bonifati and Rahm provides an overview of the ways in which the schema and ontology matching and mapping tools have addressed the above requirements

  20. Bayesian grid matching

    DEFF Research Database (Denmark)

    Hartelius, Karsten; Carstensen, Jens Michael

    2003-01-01

    A method for locating distorted grid structures in images is presented. The method is based on the theories of template matching and Bayesian image restoration. The grid is modeled as a deformable template. Prior knowledge of the grid is described through a Markov random field (MRF) model which...... nodes and the arc prior models variations in row and column spacing across the grid. Grid matching is done by placing an initial rough grid over the image and applying an ensemble annealing scheme to maximize the posterior distribution of the grid. The method can be applied to noisy images with missing...

  1. Middle matching mining algorithm

    Institute of Scientific and Technical Information of China (English)

    GUO Ping; CHEN Li

    2003-01-01

    A new algorithm for fast discovery of sequential patterns to solve the problems of too many candidate sets made by SPADE is presented, which is referred to as middle matching algorithm. Experiments on a large customer transaction database consisting of customer_id, transaction time, and transaction items demonstrate that the proposed algorithm performs better than SPADE attributed to its philosophy to generate a candidate set by matching two sequences in the middle place so as to reduce the number of the candidate sets.

  2. Factorized Graph Matching.

    Science.gov (United States)

    Zhou, Feng; de la Torre, Fernando

    2015-11-19

    Graph matching (GM) is a fundamental problem in computer science, and it plays a central role to solve correspondence problems in computer vision. GM problems that incorporate pairwise constraints can be formulated as a quadratic assignment problem (QAP). Although widely used, solving the correspondence problem through GM has two main limitations: (1) the QAP is NP-hard and difficult to approximate; (2) GM algorithms do not incorporate geometric constraints between nodes that are natural in computer vision problems. To address aforementioned problems, this paper proposes factorized graph matching (FGM). FGM factorizes the large pairwise affinity matrix into smaller matrices that encode the local structure of each graph and the pairwise affinity between edges. Four are the benefits that follow from this factorization: (1) There is no need to compute the costly (in space and time) pairwise affinity matrix; (2) The factorization allows the use of a path-following optimization algorithm, that leads to improved optimization strategies and matching performance; (3) Given the factorization, it becomes straight-forward to incorporate geometric transformations (rigid and non-rigid) to the GM problem. (4) Using a matrix formulation for the GM problem and the factorization, it is easy to reveal commonalities and differences between different GM methods. The factorization also provides a clean connection with other matching algorithms such as iterative closest point; Experimental results on synthetic and real databases illustrate how FGM outperforms state-of-the-art algorithms for GM. The code is available at http://humansensing.cs.cmu.edu/fgm.

  3. A Football Match

    Institute of Scientific and Technical Information of China (English)

    彭硕

    2002-01-01

    It was a Saturday morning, our school football team was going to have a match with the No. 28 Middle Schooh They were really a strong team. But we weren't afraid of them. We had many mare good players on our team, so we were stronger than ever before.

  4. Derivatives of Matching.

    Science.gov (United States)

    Herrnstein, R. J.

    1979-01-01

    The matching law for reinforced behavior solves a differential equation relating infinitesimal changes in behavior to infinitesimal changes in reinforcement. The equation expresses plausible conceptions of behavior and reinforcement, yields a simple nonlinear operator model for acquisition, and suggests a alternative to the economic law of…

  5. n! matchings, n! posets

    CERN Document Server

    Claesson, Anders

    2010-01-01

    We show that there are n! matchings on 2n points without, so called, left (neighbor) nestings. We also define a set of naturally labeled (2+2)-free posets, and show that there are n! such posets on n elements. Our work was inspired by Bousquet-M\\'elou, Claesson, Dukes and Kitaev [arXiv:0806.0666]. They gave bijections between four classes of combinatorial objects: matchings with no neighbor nestings (due to Stoimenow), unlabeled (2+2)-free posets, permutations avoiding a specific pattern, and so called ascent sequences. We believe that certain statistics on our matchings and posets could generalize the work of Bousquet-M\\'elou et al.\\ and we make a conjecture to that effect. We also identify natural subsets of matchings and posets that are equinumerous to the class of unlabeled (2+2)-free posets. We give bijections that show the equivalence of (neighbor) restrictions on nesting arcs with (neighbor) restrictions on crossing arcs. These bijections are thought to be of independent interest. One of the bijections...

  6. 'Wiggle matching' radiocarbon dates

    NARCIS (Netherlands)

    Ramsey, CB; van der Plicht, J; Weninger, B

    2001-01-01

    This paper covers three different methods of matching radiocarbon dates to the 'wiggles' of the calibration curve in those situations where the age difference between the C-14 dates is known. These methods are most often applied to tree-ring sequences. The simplest approach is to use a classical Chi

  7. Polytypic pattern matching

    NARCIS (Netherlands)

    Jeuring, J.T.

    2007-01-01

    The pattern matching problem can be informally specified as follows: given a pattern and a text, find all occurrences of the pattern in the text. The pattern and the text may both be lists, or they may both be trees, or they may both be multi-dimensional arrays, etc. This paper describes a general p

  8. Matching Supernovae to Galaxies

    Science.gov (United States)

    Kohler, Susanna

    2016-12-01

    developed a new automated algorithm for matching supernovae to their host galaxies. Their work builds on currently existing algorithms and makes use of information about the nearby galaxies, accounts for the uncertainty of the match, and even includes a machine learning component to improve the matching accuracy.Gupta and collaborators test their matching algorithm on catalogs of galaxies and simulated supernova events to quantify how well the algorithm is able to accurately recover the true hosts.Successful MatchingThe matching algorithms accuracy (purity) as a function of the true supernova-host separation, the supernova redshift, the true hosts brightness, and the true hosts size. [Gupta et al. 2016]The authors find that when the basic algorithm is run on catalog data, it matches supernovae to their hosts with 91% accuracy. Including the machine learning component, which is run after the initial matching algorithm, improves the accuracy of the matching to 97%.The encouraging results of this work which was intended as a proof of concept suggest that methods similar to this could prove very practical for tackling future survey data. And the method explored here has use beyond matching just supernovae to their host galaxies: it could also be applied to other extragalactic transients, such as gamma-ray bursts, tidal disruption events, or electromagnetic counterparts to gravitational-wave detections.CitationRavi R. Gupta et al 2016 AJ 152 154. doi:10.3847/0004-6256/152/6/154

  9. [Propensity score matching in SPSS].

    Science.gov (United States)

    Huang, Fuqiang; DU, Chunlin; Sun, Menghui; Ning, Bing; Luo, Ying; An, Shengli

    2015-11-01

    To realize propensity score matching in PS Matching module of SPSS and interpret the analysis results. The R software and plug-in that could link with the corresponding versions of SPSS and propensity score matching package were installed. A PS matching module was added in the SPSS interface, and its use was demonstrated with test data. Score estimation and nearest neighbor matching was achieved with the PS matching module, and the results of qualitative and quantitative statistical description and evaluation were presented in the form of a graph matching. Propensity score matching can be accomplished conveniently using SPSS software.

  10. Resurgence matches quantization

    Science.gov (United States)

    Couso-Santamaría, Ricardo; Mariño, Marcos; Schiappa, Ricardo

    2017-04-01

    The quest to find a nonperturbative formulation of topological string theory has recently seen two unrelated developments. On the one hand, via quantization of the mirror curve associated to a toric Calabi–Yau background, it has been possible to give a nonperturbative definition of the topological-string partition function. On the other hand, using techniques of resurgence and transseries, it has been possible to extend the string (asymptotic) perturbative expansion into a transseries involving nonperturbative instanton sectors. Within the specific example of the local {{{P}}2} toric Calabi–Yau threefold, the present work shows how the Borel–Padé–Écalle resummation of this resurgent transseries, alongside occurrence of Stokes phenomenon, matches the string-theoretic partition function obtained via quantization of the mirror curve. This match is highly non-trivial, given the unrelated nature of both nonperturbative frameworks, signaling at the existence of a consistent underlying structure.

  11. Resurgence Matches Quantization

    CERN Document Server

    Couso-Santamaría, Ricardo; Schiappa, Ricardo

    2016-01-01

    The quest to find a nonperturbative formulation of topological string theory has recently seen two unrelated developments. On the one hand, via quantization of the mirror curve associated to a toric Calabi-Yau background, it has been possible to give a nonperturbative definition of the topological-string partition function. On the other hand, using techniques of resurgence and transseries, it has been possible to extend the string (asymptotic) perturbative expansion into a transseries involving nonperturbative instanton sectors. Within the specific example of the local P2 toric Calabi-Yau threefold, the present work shows how the Borel-Pade-Ecalle resummation of this resurgent transseries, alongside occurrence of Stokes phenomenon, matches the string-theoretic partition function obtained via quantization of the mirror curve. This match is highly non-trivial, given the unrelated nature of both nonperturbative frameworks, signaling at the existence of a consistent underlying structure.

  12. Matchings on infinite graphs

    CERN Document Server

    Bordenave, Charles; Salez, Justin

    2011-01-01

    We prove that the local weak convergence of a sequence of graphs is enough to guarantee the convergence of their normalized matching numbers. The limiting quantity is described by a local recursion defined on the weak limit of the graph sequence. However, this recursion may admit several solutions, implying non-trivial long-range dependencies between the edges of a largest matching. We overcome this lack of correlation decay by introducing a perturbative parameter called the temperature, which we let progressively go to zero. When the local weak limit is a unimodular Galton-Watson tree, the recursion simplifies into a distributional equation, resulting into an explicit formula that considerably extends the well-known one by Karp and Sipser for Erd\\"os-R\\'enyi random graphs.

  13. The development of fatigue during match-play tennis.

    Science.gov (United States)

    Reid, Machar; Duffield, Rob

    2014-04-01

    Data describing the activity profile and physiological characteristics of tennis match-play are extensive. However, these data have generally provided descriptive accounts of the one-off match-play of amateur or lowly ranked professional players lasting tennis match-play, particularly in the men's game where matches can last >5 h. Furthermore, there is a distinct lack of evidence-based insight regarding the manifestation of fatigue within and between tennis matches, notwithstanding that skeletal muscle function has been reported to reduce following prolonged match-play. Moreover, it is evident that match-play evokes pronounced and prolonged physiological, neuromuscular and psychological perturbations that may be exacerbated with consecutive days of match-play. Separate to these internal load responses, a collection of non-uniform movement and technical performance changes are reported, though rarely from match-play data. Consequently, direct or causal links between altered physiological or muscle contractile function and subsequent match-play outcomes are lacking. Indeed, emerging evidence seems to infer that players adjust their game strategy, and the resultant execution of stroke play, to accommodate any such deterioration in physiological function. The purpose of this review was to discuss the available literature in terms of the physiological, mechanical and psychological responses that occur during prolonged match-play in the context of their likely effect on match-play performance.

  14. Characteristic Evolution and Matching

    Directory of Open Access Journals (Sweden)

    Winicour Jeffrey

    2005-12-01

    Full Text Available I review the development of numerical evolution codes for general relativity based upon the characteristic initial value problem. Progress is traced from the early stage of 1D feasibility studies to 2D axisymmetric codes that accurately simulate the oscillations and gravitational collapse of relativistic stars and to current 3D codes that provide pieces of a binary black hole spacetime. A prime application of characteristic evolution is to compute waveforms via Cauchy-characteristic matching, which is also reviewed.

  15. Match injury rates in professional soccer vary with match result, match venue, and type of competition.

    Science.gov (United States)

    Bengtsson, Håkan; Ekstrand, Jan; Waldén, Markus; Hägglund, Martin

    2013-07-01

    Player activities in soccer matches are influenced by the match result and match venue. It is not known whether injury rates are influenced by these factors. To investigate whether there are associations between injury rates and the match result, venue, and type of competition in male soccer. Cohort study; Level of evidence, 3. Twenty-six professional clubs from 10 countries were followed prospectively during 9 seasons (2001-2002 to 2009-2010). All matches, and injuries occurring in these matches, were registered by the team's medical staff. An injury was registered if it resulted in player absence from training or matches. Information about match result, venue, and type of competition for all reported matches was gathered by the authors from online databases. Injury rates in matches with varying match characteristics were compared by use of generalized estimating equations. Odds ratios (ORs) with 95% confidence intervals (CIs) were calculated. A total of 2738 injuries during 6010 matches were registered. There were no associations between odds of 1 injury occurrence and match result or type of competition, whereas the odds were decreased in matches played away compared with home matches (OR, 0.89; 95% CI, 0.80-0.99). The odds of 2 or more injury occurrences in a match were increased in matches resulting in a draw (OR, 1.39; 95% CI, 1.15-1.69) or loss (OR, 1.66; 95% CI, 1.38-1.98) compared with matches won and were decreased in other cup matches compared with league matches (OR, 0.57; 95% CI, 0.39-0.84) and in matches played away compared with home matches (OR, 0.70; 95% CI, 0.60-0.82). Finally, injuries with more than 1 week's absence occurred more frequently in Champions League matches compared with league matches both for matches with 1 injury (OR, 1.26; 95% CI, 1.09-1.45) and matches with 2 or more injuries (OR, 1.57; 95% CI, 1.13-2.20). The odds of 2 or more injury occurrences in professional soccer were higher in matches resulting in a loss or a draw compared

  16. One-Match and All-Match Categories for Keywords Matching in Chatbot

    Directory of Open Access Journals (Sweden)

    Abbas S. Lokman

    2010-01-01

    Full Text Available Problem statement: Artificial intelligence chatbot is a technology that makes interactions between men and machines using natural language possible. From literature of chatbots keywords/pattern matching techniques, potential issues for improvement had been discovered. The discovered issues are in the context of keywords arrangement for matching precedence and keywords variety for matching flexibility. Approach: Combining previous techniques/mechanisms with some additional adjustment, new technique to be used for keywords matching process is proposed. Using newly developed chatbot named ViDi (abbreviation for Virtual Diabetes physician which is a chatbot for diabetes education activity as a testing medium, the proposed technique named One-Match and All-Match Categories (OMAMC is being used to test the creation of possible keywords surrounding one sample input sentence. The result for possible keywords created by this technique then being compared to possible keywords created by previous chatbots techniques surrounding the same sample sentence in matching precedence and matching flexibility context. Results: OMAMC technique is found to be improving previous matching techniques in matching precedence and flexibility context. This improvement is seen to be useful for shortening matching time and widening matching flexibility within the chatbots keywords matching process. Conclusion: OMAMC for keywords matching in chatbot is shown to be an improvement over previous techniques in the context of keywords arrangement for matching precedence and keywords variety for matching flexibility.

  17. PATTERN MATCHING IN MODELS

    Directory of Open Access Journals (Sweden)

    Cristian GEORGESCU

    2005-01-01

    Full Text Available The goal of this paper is to investigate how such a pattern matching could be performed on models,including the definition of the input language as well as the elaboration of efficient matchingalgorithms. Design patterns can be considered reusable micro-architectures that contribute to anoverall system architecture. Frameworks are also closely related to design patterns. Componentsoffer the possibility to radically change the behaviors and services offered by an application bysubstitution or addition of new components, even a long time after deployment. Software testing isanother aspect of reliable development. Testing activities mainly consist in ensuring that a systemimplementation conforms to its specifications.

  18. Apfel's excellent match

    Science.gov (United States)

    1997-01-01

    Apfel's excellent match: This series of photos shows a water drop containing a surfactant (Triton-100) as it experiences a complete cycle of superoscillation on U.S. Microgravity Lab-2 (USML-2; October 1995). The time in seconds appears under the photos. The figures above the photos are the oscillation shapes predicted by a numerical model. The time shown with the predictions is nondimensional. Robert Apfel (Yale University) used the Drop Physics Module on USML-2 to explore the effect of surfactants on liquid drops. Apfel's research of surfactants may contribute to improvements in a variety of industrial processes, including oil recovery and environmental cleanup.

  19. Where is the match?

    OpenAIRE

    Alba Avilés, Manuel

    2015-01-01

    WhereIsTheMatch is a very ambitious project that consists of developing my own social network mobile app for Android. This app is focused on easily finding people and places to play sports. The main idea of this project is create a first step to a final product and my own developing style. I knew from the beginning that this would be a very hard and a very demanding task because of the several areas that are involved in the development of a mobile app, such as database implementation, interfa...

  20. Outsourced pattern matching

    DEFF Research Database (Denmark)

    Faust, Sebastian; Hazay, Carmit; Venturi, Daniele

    2013-01-01

    on concrete and important functionalities and give the first protocol for the pattern matching problem in the cloud. Loosely speaking, this problem considers a text T that is outsourced to the cloud S by a client C T . In a query phase, clients C 1, …, C l run an efficient protocol with the server S...... that contain confidential data (e.g., health related data about patient history). Our constructions offer simulation-based security in the presence of semi-honest and malicious adversaries (in the random oracle model) and limit the communication in the query phase to O(m) bits plus the number of occurrences...

  1. Boxed Permutation Pattern Matching

    DEFF Research Database (Denmark)

    Amit, Mika; Bille, Philip; Cording, Patrick Hagge

    2016-01-01

    the goal is to only find the boxed subsequences of T that are order-isomorphic to P. This problem was introduced by Bruner and Lackner who showed that it can be solved in O(n3) time. Cho et al. [CPM 2015] gave an O(n2m) time algorithm and improved it to O(n2 logm). In this paper we present a solution...

  2. Language experience changes subsequent learning.

    Science.gov (United States)

    Onnis, Luca; Thiessen, Erik

    2013-02-01

    What are the effects of experience on subsequent learning? We explored the effects of language-specific word order knowledge on the acquisition of sequential conditional information. Korean and English adults were engaged in a sequence learning task involving three different sets of stimuli: auditory linguistic (nonsense syllables), visual non-linguistic (nonsense shapes), and auditory non-linguistic (pure tones). The forward and backward probabilities between adjacent elements generated two equally probable and orthogonal perceptual parses of the elements, such that any significant preference at test must be due to either general cognitive biases, or prior language-induced biases. We found that language modulated parsing preferences with the linguistic stimuli only. Intriguingly, these preferences are congruent with the dominant word order patterns of each language, as corroborated by corpus analyses, and are driven by probabilistic preferences. Furthermore, although the Korean individuals had received extensive formal explicit training in English and lived in an English-speaking environment, they exhibited statistical learning biases congruent with their native language. Our findings suggest that mechanisms of statistical sequential learning are implicated in language across the lifespan, and experience with language may affect cognitive processes and later learning. Copyright © 2012 Elsevier B.V. All rights reserved.

  3. Generalized Orthogonal Matching Pursuit

    CERN Document Server

    Wang, Jian; Shim, Byonghyo

    2011-01-01

    As a greedy algorithm to recover sparse signals from compressed measurements, the orthogonal matching pursuit (OMP) algorithm has received much attention in recent years. In this paper, we introduce an extension of the orthogonal matching pursuit (gOMP) for pursuing efficiency in reconstructing sparse signals. Our approach, henceforth referred to as generalized OMP (gOMP), is literally a generalization of the OMP in the sense that multiple indices are identified per iteration. Owing to the selection of multiple "correct" indices, the gOMP algorithm is finished with much smaller number of iterations compared to the OMP. We show that the gOMP can perfectly reconstruct any $K$-sparse signals ($K > 1$), provided that the sensing matrix satisfies the RIP with $\\delta_{NK} < \\frac{\\sqrt{N}}{\\sqrt{K} + 2 \\sqrt{N}}$. We also demonstrate by empirical simulations that the gOMP has excellent recovery performance comparable to $\\ell_1$-minimization technique with fast processing speed and competitive computational com...

  4. 7 CFR 1401.8 - Subsequent holders.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 10 2010-01-01 2010-01-01 false Subsequent holders. 1401.8 Section 1401.8 Agriculture... PAYMENT § 1401.8 Subsequent holders. (a) General. A person who acquires a commodity certificate from another person shall be considered to be a “subsequent holder” of the certificate. Subsequent holders...

  5. Characteristic Evolution and Matching

    Directory of Open Access Journals (Sweden)

    Winicour Jeffrey

    2009-04-01

    Full Text Available I review the development of numerical evolution codes for general relativity based upon the characteristic initial value problem. Progress is traced from the early stage of 1D feasibility studies to 2D axisymmetric codes that accurately simulate the oscillations and gravitational collapse of relativistic stars and to current 3D codes that provide pieces of a binary black hole spacetime. Cauchy codes have now been successful at simulating all aspects of the binary black hole problem inside an artificially constructed outer boundary. A prime application of characteristic evolution is to eliminate the role of this artificial outer boundary via Cauchy-characteristic matching, by which the radiated waveform can be computed at null infinity. Progress in this direction is discussed.

  6. Matching with Commitments

    CERN Document Server

    Costello, Kevin; Tripathi, Pushkar

    2012-01-01

    We consider the following stochastic optimization problem first introduced by Chen et al. in \\cite{chen}. We are given a vertex set of a random graph where each possible edge is present with probability p_e. We do not know which edges are actually present unless we scan/probe an edge. However whenever we probe an edge and find it to be present, we are constrained to picking the edge and both its end points are deleted from the graph. We wish to find the maximum matching in this model. We compare our results against the optimal omniscient algorithm that knows the edges of the graph and present a 0.573 factor algorithm using a novel sampling technique. We also prove that no algorithm can attain a factor better than 0.898 in this model.

  7. The earliest matches.

    Directory of Open Access Journals (Sweden)

    Naama Goren-Inbar

    Full Text Available Cylindrical objects made usually of fired clay but sometimes of stone were found at the Yarmukian Pottery Neolithic sites of Sha'ar HaGolan and Munhata (first half of the 8(th millennium BP in the Jordan Valley. Similar objects have been reported from other Near Eastern Pottery Neolithic sites. Most scholars have interpreted them as cultic objects in the shape of phalli, while others have referred to them in more general terms as "clay pestles," "clay rods," and "cylindrical clay objects." Re-examination of these artifacts leads us to present a new interpretation of their function and to suggest a reconstruction of their technology and mode of use. We suggest that these objects were components of fire drills and consider them the earliest evidence of a complex technology of fire ignition, which incorporates the cylindrical objects in the role of matches.

  8. The earliest matches.

    Science.gov (United States)

    Goren-Inbar, Naama; Freikman, Michael; Garfinkel, Yosef; Goring-Morris, A Nigel; Goring-Morris, Nigel A; Grosman, Leore

    2012-01-01

    Cylindrical objects made usually of fired clay but sometimes of stone were found at the Yarmukian Pottery Neolithic sites of Sha'ar HaGolan and Munhata (first half of the 8(th) millennium BP) in the Jordan Valley. Similar objects have been reported from other Near Eastern Pottery Neolithic sites. Most scholars have interpreted them as cultic objects in the shape of phalli, while others have referred to them in more general terms as "clay pestles," "clay rods," and "cylindrical clay objects." Re-examination of these artifacts leads us to present a new interpretation of their function and to suggest a reconstruction of their technology and mode of use. We suggest that these objects were components of fire drills and consider them the earliest evidence of a complex technology of fire ignition, which incorporates the cylindrical objects in the role of matches.

  9. Optimizing Transmission Line Matching Circuits

    OpenAIRE

    Novak, S.

    1996-01-01

    When designing transmission line matching circuits, there exist often overlooked, additional, not much used, degree of choice in the selection of the transmission line impedance. In this work are presented results of CAD analysis for the two element transmission line matching networks, demonstrating that selecting matching circuits transmission lines with higher impedance, than usually used 50 or 75 ohms, can in most cases substantially decrease the physical dimension of the final matching ci...

  10. The development of fatigue during match-play tennis

    Science.gov (United States)

    Reid, Machar; Duffield, Rob

    2014-01-01

    Data describing the activity profile and physiological characteristics of tennis match-play are extensive. However, these data have generally provided descriptive accounts of the one-off match-play of amateur or lowly ranked professional players lasting 5 h. Furthermore, there is a distinct lack of evidence-based insight regarding the manifestation of fatigue within and between tennis matches, notwithstanding that skeletal muscle function has been reported to reduce following prolonged match-play. Moreover, it is evident that match-play evokes pronounced and prolonged physiological, neuromuscular and psychological perturbations that may be exacerbated with consecutive days of match-play. Separate to these internal load responses, a collection of non-uniform movement and technical performance changes are reported, though rarely from match-play data. Consequently, direct or causal links between altered physiological or muscle contractile function and subsequent match-play outcomes are lacking. Indeed, emerging evidence seems to infer that players adjust their game strategy, and the resultant execution of stroke play, to accommodate any such deterioration in physiological function. The purpose of this review was to discuss the available literature in terms of the physiological, mechanical and psychological responses that occur during prolonged match-play in the context of their likely effect on match-play performance. PMID:24668384

  11. An HLA matched donor! An HLA matched donor? What do you mean by: HLA matched donor?

    Science.gov (United States)

    van Rood, J J; Oudshoorn, M

    1998-07-01

    The term 'an HLA matched donor' is in general used without giving exact information on the level of resolution of the HLA typing. This can lead to misunderstandings. A proposal is formulated to agree on using six match categories according to the HLA typing technique used to indicate the level of confidence of the matching.

  12. Characteristic Evolution and Matching

    Directory of Open Access Journals (Sweden)

    Jeffrey Winicour

    2012-01-01

    Full Text Available I review the development of numerical evolution codes for general relativity based upon the characteristic initial-value problem. Progress in characteristic evolution is traced from the early stage of 1D feasibility studies to 2D-axisymmetric codes that accurately simulate the oscillations and gravitational collapse of relativistic stars and to current 3D codes that provide pieces of a binary black-hole spacetime. Cauchy codes have now been successful at simulating all aspects of the binary black-hole problem inside an artificially constructed outer boundary. A prime application of characteristic evolution is to extend such simulations to null infinity where the waveform from the binary inspiral and merger can be unambiguously computed. This has now been accomplished by Cauchy-characteristic extraction, where data for the characteristic evolution is supplied by Cauchy data on an extraction worldtube inside the artificial outer boundary. The ultimate application of characteristic evolution is to eliminate the role of this outer boundary by constructing a global solution via Cauchy-characteristic matching. Progress in this direction is discussed.

  13. Quantum image matching

    Science.gov (United States)

    Jiang, Nan; Dang, Yijie; Wang, Jian

    2016-09-01

    Quantum image processing (QIP) means the quantum-based methods to speed up image processing algorithms. Many quantum image processing schemes claim that their efficiency is theoretically higher than their corresponding classical schemes. However, most of them do not consider the problem of measurement. As we all know, measurement will lead to collapse. That is to say, executing the algorithm once, users can only measure the final state one time. Therefore, if users want to regain the results (the processed images), they must execute the algorithms many times and then measure the final state many times to get all the pixels' values. If the measurement process is taken into account, whether or not the algorithms are really efficient needs to be reconsidered. In this paper, we try to solve the problem of measurement and give a quantum image matching algorithm. Unlike most of the QIP algorithms, our scheme interests only one pixel (the target pixel) instead of the whole image. It modifies the probability of pixels based on Grover's algorithm to make the target pixel to be measured with higher probability, and the measurement step is executed only once. An example is given to explain the algorithm more vividly. Complexity analysis indicates that the quantum scheme's complexity is O(2n) in contradistinction to the classical scheme's complexity O(2^{2n+2m}), where m and n are integers related to the size of images.

  14. Matching theory for wireless networks

    CERN Document Server

    Han, Zhu; Saad, Walid

    2017-01-01

    This book provides the fundamental knowledge of the classical matching theory problems. It builds up the bridge between the matching theory and the 5G wireless communication resource allocation problems. The potentials and challenges of implementing the semi-distributive matching theory framework into the wireless resource allocations are analyzed both theoretically and through implementation examples. Academics, researchers, engineers, and so on, who are interested in efficient distributive wireless resource allocation solutions, will find this book to be an exceptional resource. .

  15. Pattern recognition and string matching

    CERN Document Server

    Cheng, Xiuzhen

    2002-01-01

    The research and development of pattern recognition have proven to be of importance in science, technology, and human activity. Many useful concepts and tools from different disciplines have been employed in pattern recognition. Among them is string matching, which receives much theoretical and practical attention. String matching is also an important topic in combinatorial optimization. This book is devoted to recent advances in pattern recognition and string matching. It consists of twenty eight chapters written by different authors, addressing a broad range of topics such as those from classifica­ tion, matching, mining, feature selection, and applications. Each chapter is self-contained, and presents either novel methodological approaches or applications of existing theories and techniques. The aim, intent, and motivation for publishing this book is to pro­ vide a reference tool for the increasing number of readers who depend upon pattern recognition or string matching in some way. This includes student...

  16. Matching conditions in relativistic astrophysics

    CERN Document Server

    Quevedo, Hernando

    2012-01-01

    We present an exact electrovacuum solution of Einstein-Maxwell equations with infinite sets of multipole moments which can be used to describe the exterior gravitational field of a rotating charged mass distribution. We show that in the special case of a slowly rotating and slightly deformed body, the exterior solution can be matched to an interior solution belonging to the Hartle-Thorne family of approximate solutions. To search for exact interior solutions, we propose to use the derivatives of the curvature eigenvalues to formulate a $C^3-$matching condition from which the minimum radius can be derived at which the matching of interior and exterior spacetimes can be carried out. We prove the validity of the $C^3-$matching in the particular case of a static mass with a quadrupole moment. The corresponding interior solution is obtained numerically and the matching with the exterior solution gives as a result the minimum radius of the mass configuration.

  17. Statistical methods for history matching

    DEFF Research Database (Denmark)

    Johansen, Kent

    Denne afhandling beskriver statistiske metoder til history matching af olieproduktion. History matching er en vigtig del af driften af et oliefelt og er ofte forbundet med problemer relateret til kompleksiteten af reservoiret og selve størrelsen af reservoirsimuleringsmodellen. Begrebet history m...... history matching metode. Den foreslåede metode forsøger at forbedre konvergensen af traditionel probability perturbation ved at inkludere kvalitativ gradient information.......Denne afhandling beskriver statistiske metoder til history matching af olieproduktion. History matching er en vigtig del af driften af et oliefelt og er ofte forbundet med problemer relateret til kompleksiteten af reservoiret og selve størrelsen af reservoirsimuleringsmodellen. Begrebet history...... matching dækker over arbejdsprocessen, hvor de fysiske parametre i en reservoirsimuleringsmodel bliver justeret således, at en simulering af olieproduktionen stemmer overens med egentlige målte produktionsdata. Mange history matching metoder er baseret på et geostatistisk fundament, hvilket også gør sig...

  18. Pattern Matching in Multiple Streams

    CERN Document Server

    Clifford, Raphael; Porat, Ely; Sach, Benjamin

    2012-01-01

    We investigate the problem of deterministic pattern matching in multiple streams. In this model, one symbol arrives at a time and is associated with one of s streaming texts. The task at each time step is to report if there is a new match between a fixed pattern of length m and a newly updated stream. As is usual in the streaming context, the goal is to use as little space as possible while still reporting matches quickly. We give almost matching upper and lower space bounds for three distinct pattern matching problems. For exact matching we show that the problem can be solved in constant time per arriving symbol and O(m+s) words of space. For the k-mismatch and k-differences problems we give O(k) time solutions that require O(m+ks) words of space. In all three cases we also give space lower bounds which show our methods are optimal up to a single logarithmic factor. Finally we set out a number of open problems related to this new model for pattern matching.

  19. 49 CFR 173.186 - Matches.

    Science.gov (United States)

    2010-10-01

    ...) Wax “Vesta” matches are matches that can be ignited by friction either on a prepared surface or on a solid surface. (c) Safety matches and wax “Vesta” matches must be tightly packed in securely closed... packaging with any material other than safety matches or wax “Vesta” matches, which must be packed...

  20. MATCHING IN INFORMAL FINANCIAL INSTITUTIONS.

    Science.gov (United States)

    Eeckhout, Jan; Munshi, Kaivan

    2010-09-01

    This paper analyzes an informal financial institution that brings heterogeneous agents together in groups. We analyze decentralized matching into these groups, and the equilibrium composition of participants that consequently arises. We find that participants sort remarkably well across the competing groups, and that they re-sort immediately following an unexpected exogenous regulatory change. These findings suggest that the competitive matching model might have applicability and bite in other settings where matching is an important equilibrium phenomenon. (JEL: O12, O17, G20, D40).

  1. Subsequent pregnancy outcome after previous foetal death

    NARCIS (Netherlands)

    Nijkamp, J. W.; Korteweg, F. J.; Holm, J. P.; Timmer, A.; Erwich, J. J. H. M.; van Pampus, M. G.

    2013-01-01

    Objective: A history of foetal death is a risk factor for complications and foetal death in subsequent pregnancies as most previous risk factors remain present and an underlying cause of death may recur. The purpose of this study was to evaluate subsequent pregnancy outcome after foetal death and to

  2. A Review of Subsequence Time Series Clustering

    Science.gov (United States)

    Teh, Ying Wah

    2014-01-01

    Clustering of subsequence time series remains an open issue in time series clustering. Subsequence time series clustering is used in different fields, such as e-commerce, outlier detection, speech recognition, biological systems, DNA recognition, and text mining. One of the useful fields in the domain of subsequence time series clustering is pattern recognition. To improve this field, a sequence of time series data is used. This paper reviews some definitions and backgrounds related to subsequence time series clustering. The categorization of the literature reviews is divided into three groups: preproof, interproof, and postproof period. Moreover, various state-of-the-art approaches in performing subsequence time series clustering are discussed under each of the following categories. The strengths and weaknesses of the employed methods are evaluated as potential issues for future studies. PMID:25140332

  3. Approximate Matching of Hierarchial Data

    DEFF Research Database (Denmark)

    Augsten, Nikolaus

    The goal of this thesis is to design, develop, and evaluate new methods for the approximate matching of hierarchical data represented as labeled trees. In approximate matching scenarios two items should be matched if they are similar. Computing the similarity between labeled trees is hard...... as in addition to the data values also the structure must be considered. A well-known measure for comparing trees is the tree edit distance. It is computationally expensive and leads to a prohibitively high run time. Our solution for the approximate matching of hierarchical data are pq-grams. The pq...... formally proof that the pq-gram index can be incrementally updated based on the log of edit operations without reconstructing intermediate tree versions. The incremental update is independent of the data size and scales to a large number of changes in the data. We introduce windowed pq...

  4. Matched Spectral Filter Imager Project

    Data.gov (United States)

    National Aeronautics and Space Administration — OPTRA proposes the development of an imaging spectrometer for greenhouse gas and volcanic gas imaging based on matched spectral filtering and compressive imaging....

  5. Improved bounds for stochastic matching

    CERN Document Server

    Li, Jian

    2010-01-01

    In this paper we study stochastic matching problems that are motivated by applications in online dating and kidney exchange programs. We consider two probing models: edge probing and matching probing. Our main result is an algorithm that finds a matching-probing strategy attaining a small constant approximation ratio. An interesting aspect of our approach is that we compare the cost our solution to the best edge-probing strategy. Thus, we indirectly show that the best matching-probing strategy is only a constant factor away from the best edge-probing strategy. Even though our algorithm has a slightly worse approximation ratio than a greedy algorithm for edge-probing strategies, we show that the two algorithms can be combined to get improved approximations.

  6. An Efficient Pattern Matching Algorithm

    Science.gov (United States)

    Sleit, Azzam; Almobaideen, Wesam; Baarah, Aladdin H.; Abusitta, Adel H.

    In this study, we present an efficient algorithm for pattern matching based on the combination of hashing and search trees. The proposed solution is classified as an offline algorithm. Although, this study demonstrates the merits of the technique for text matching, it can be utilized for various forms of digital data including images, audio and video. The performance superiority of the proposed solution is validated analytically and experimentally.

  7. Review og pattern matching approaches

    DEFF Research Database (Denmark)

    Manfaat, D.; Duffy, Alex; Lee, B. S.

    1996-01-01

    This paper presents a review of pattern matching techniques. The application areas for pattern matching are extensive, ranging from CAD systems to chemical analysis and from manufacturing to image processing. Published techniques and methods are classified and assessed within the context of three...... key issues: pattern classes, similiarity types and mathing methods. It has been shown that the techniques and approaches are as diverse and varied as the applications....

  8. 76 FR 17407 - Proposed Subsequent Arrangement

    Science.gov (United States)

    2011-03-29

    ... testing of plate- type nuclear fuel as part of a Reduced Enrichment for Research and Test Reactors (RERTR... and the Argentine Republic Concerning Peaceful Uses of Nuclear Energy. DATES: This subsequent..., Office of Nonproliferation and International Security, National Nuclear Security...

  9. Abortions: Does It Affect Subsequent Pregnancies?

    Science.gov (United States)

    Healthy Lifestyle Getting pregnant Could an abortion increase the risk of problems in a subsequent pregnancy? Answers from Roger W. Harms, M.D. Generally, abortion isn't thought to cause fertility issues or ...

  10. Crohn’s Disease: The Subsequent Visit

    OpenAIRE

    Manolakis, Catherine S.; Farraye, Francis A.; Di Palma, Jack A

    2013-01-01

    The diagnosis and subsequent management of Crohn’s disease are challenging for both the patient and the gastroenterologist. After the initial assessment, subsequent visits should assess the patient’s readiness to begin therapy, monitor progress if therapy has been initiated, assess for complications of the disease or therapy, and ensure that all appropriate health maintenance measures are current. This article is intended to be a companion to our earlier paper “Crohn’s Disease: The First Visi...

  11. Understanding Y haplotype matching probability.

    Science.gov (United States)

    Brenner, Charles H

    2014-01-01

    The Y haplotype population-genetic terrain is better explored from a fresh perspective rather than by analogy with the more familiar autosomal ideas. For haplotype matching probabilities, versus for autosomal matching probabilities, explicit attention to modelling - such as how evolution got us where we are - is much more important while consideration of population frequency is much less so. This paper explores, extends, and explains some of the concepts of "Fundamental problem of forensic mathematics - the evidential strength of a rare haplotype match". That earlier paper presented and validated a "kappa method" formula for the evidential strength when a suspect matches a previously unseen haplotype (such as a Y-haplotype) at the crime scene. Mathematical implications of the kappa method are intuitive and reasonable. Suspicions to the contrary raised in rest on elementary errors. Critical to deriving the kappa method or any sensible evidential calculation is understanding that thinking about haplotype population frequency is a red herring; the pivotal question is one of matching probability. But confusion between the two is unfortunately institutionalized in much of the forensic world. Examples make clear why (matching) probability is not (population) frequency and why uncertainty intervals on matching probabilities are merely confused thinking. Forensic matching calculations should be based on a model, on stipulated premises. The model inevitably only approximates reality, and any error in the results comes only from error in the model, the inexactness of the approximation. Sampling variation does not measure that inexactness and hence is not helpful in explaining evidence and is in fact an impediment. Alternative haplotype matching probability approaches that various authors have considered are reviewed. Some are based on no model and cannot be taken seriously. For the others, some evaluation of the models is discussed. Recent evidence supports the adequacy of

  12. Matching illumination of solid objects.

    Science.gov (United States)

    Pont, Sylvia C; Koenderink, Jan J

    2007-04-01

    The appearance of objects is determined by their surface reflectance and roughness and by the light field. Conversely, human observers might derive properties of the light field from the appearance of objects. The inverse problem has no unique solution, so perceptual interactions between reflectance, roughness, and lightfield are to be expected. In two separate experiments, we tested whether observers are able to match the illumination of spheres under collimated illumination only (matching of illumination direction) and under more or less diffuse illumination (matching of illumination direction and directedness of the beam). We found that observers are quite able to match collimated illumination directions of two rendered Lambertian spheres. Matching of the collimated beam directions of a Lambertian sphere and that of a real object with arbitrary reflectance and roughness properties resulted in similar results for the azimuthal angle, but in higher variance for the polar angle. Translucent objects and a tennis ball were found to be systematic outliers. If the directedness of the beam was also varied, the direction settings showed larger variance for more diffuse illumination. The directedness settings showed an overall quite large variance and, interestingly, interacted with the polar angle settings. We discuss possible photometrical mechanisms behind these effects.

  13. Fast and Flexible Multivariate Time Series Subsequence Search

    Science.gov (United States)

    Bhaduri, Kanishka; Oza, Nikunj C.; Zhu, Qiang; Srivastava, Ashok N.

    2010-01-01

    Multivariate Time-Series (MTS) are ubiquitous, and are generated in areas as disparate as sensor recordings in aerospace systems, music and video streams, medical monitoring, and financial systems. Domain experts are often interested in searching for interesting multivariate patterns from these MTS databases which often contain several gigabytes of data. Surprisingly, research on MTS search is very limited. Most of the existing work only supports queries with the same length of data, or queries on a fixed set of variables. In this paper, we propose an efficient and flexible subsequence search framework for massive MTS databases, that, for the first time, enables querying on any subset of variables with arbitrary time delays between them. We propose two algorithms to solve this problem (1) a List Based Search (LBS) algorithm which uses sorted lists for indexing, and (2) a R*-tree Based Search (RBS) which uses Minimum Bounding Rectangles (MBR) to organize the subsequences. Both algorithms guarantee that all matching patterns within the specified thresholds will be returned (no false dismissals). The very few false alarms can be removed by a post-processing step. Since our framework is also capable of Univariate Time-Series (UTS) subsequence search, we first demonstrate the efficiency of our algorithms on several UTS datasets previously used in the literature. We follow this up with experiments using two large MTS databases from the aviation domain, each containing several millions of observations. Both these tests show that our algorithms have very high prune rates (>99%) thus needing actual disk access for only less than 1% of the observations. To the best of our knowledge, MTS subsequence search has never been attempted on datasets of the size we have used in this paper.

  14. Multi data reservior history matching and uncertainty quantification framework

    KAUST Repository

    Katterbauer, Klemens

    2015-11-26

    A multi-data reservoir history matching and uncertainty quantification framework is provided. The framework can utilize multiple data sets such as production, seismic, electromagnetic, gravimetric and surface deformation data for improving the history matching process. The framework can consist of a geological model that is interfaced with a reservoir simulator. The reservoir simulator can interface with seismic, electromagnetic, gravimetric and surface deformation modules to predict the corresponding observations. The observations can then be incorporated into a recursive filter that subsequently updates the model state and parameters distributions, providing a general framework to quantify and eventually reduce with the data, uncertainty in the estimated reservoir state and parameters.

  15. Approximating Graphic TSP by Matchings

    CERN Document Server

    Mömke, Tobias

    2011-01-01

    We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges in order to make a given graph Eulerian, whereas our approach also allows for the removal of certain edges leading to a decreased cost. For the TSP on graphic metrics (graph-TSP), the approach yields a 1.461-approximation algorithm with respect to the Held-Karp lower bound. For graph-TSP restricted to a class of graphs that contains degree three bounded and claw-free graphs, we show that the integrality gap of the Held-Karp relaxation matches the conjectured ratio 4/3. The framework allows for generalizations in a natural way and also leads to a 1.586-approximation algorithm for the traveling salesman path problem on graphic metrics where the start and end vertices are prespecified.

  16. Error-tolerant Tree Matching

    CERN Document Server

    Oflazer, K

    1996-01-01

    This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree approximately, that is, within a certain error tolerance. It has natural language processing applications in searching for matches in example-based translation systems, and retrieval from lexical databases containing entries of complex feature structures. The algorithm has been implemented on SparcStations, and for large randomly generated synthetic tree databases (some having tens of thousands of trees) it can associatively search for trees with a small error, in a matter of tenths of a second to few seconds.

  17. Memristor-based pattern matching

    Science.gov (United States)

    Klimo, Martin; Such, Ondrej; Skvarek, Ondrej; Fratrik, Milan

    2014-10-01

    Pattern matching is a machine learning area that requires high-performance hardware. It has been hypothesized that massively parallel designs, which avoid von Neumann architecture, could provide a significant performance boost. Such designs can advantageously use memristive switches. This paper discusses a two-stage design that implements the induced ordered weighted average (IOWA) method for pattern matching. We outline the circuit structure and discuss how a functioning circuit can be achieved using metal oxide devices. We describe our simulations of memristive circuits and illustrate their performance on a vowel classification task.

  18. Rethinking the Match: A Proposal for Modern Match-Making.

    Science.gov (United States)

    Ray, Chris; Bishop, Steven E; Dow, Alan W

    2017-06-27

    Since the 1950s, the National Resident Matching Program, or "the Match," has governed the placement of medical students into residencies. The Match was created to protect students in an era when residency positions outnumbered applicants and hospitals pressured students early in their academic careers to commit to a residency position. Now, however, applicants outnumber positions, applicants are applying to increasing numbers of programs, and the costs of the Match for applicants and programs are high. Meanwhile, medical education is evolving toward a competency-based approach, a U.S. physician shortage is predicted, and some researchers describe a "July effect"-worse clinical outcomes correlated with the mass entry of new residents.Against this background, the authors argue for adopting a more modern, free-market approach to residency match-making that might better suit the needs of applicants, programs, and the public. They propose allowing students who have been identified by their medical schools as having achieved graduation-level competency to apply to residency programs at any point during the year. Residency programs would set their own application timetables and extend offers in an ongoing fashion. Students, counseled by their schools, would accept or decline offers as desired. The authors argue this approach would better support competency-based education while allowing applicants and programs more choice regarding how they engage and adapt within the selection process. The approach's staggered start times for new residents might attenuate the July effect and improve outcomes for patients. Medical students might also enter and thereby complete residency earlier, increasing the physician workforce.

  19. Relaxation matching algorithm for moving photogrammetry

    Science.gov (United States)

    Guo, Lei; Liu, Ke; Miao, Yinxiao; Zhu, Jigui

    2015-02-01

    Moving photogrammetry is an application of close range photogrammetry in industrial measurement to realize threedimensional coordinate measurement within large-scale volume. This paper describes an approach of relaxation matching algorithm applicable to moving photogrammetry according to the characteristics of accurate matching result of different measuring images. This method uses neighborhood matching support to improve the matching rate after coarse matching based on epipolar geometry constraint and precise matching using three images. It reflects the overall matching effect of all points, that means when a point is matched correctly, the matching results of those points round it must be correct. So for one point considered, the matching results of points round it are calculated to judge whether its result is correct. Analysis indicates that relaxation matching can eliminate the mismatching effectively and acquire 100% rate of correct matching. It will play a very important role in moving photogrammetry to ensure the following implement of ray bundle adjustment.

  20. Acute kidney injury is a risk factor for subsequent proteinuria.

    Science.gov (United States)

    Parr, Sharidan K; Matheny, Michael E; Abdel-Kader, Khaled; Greevy, Robert A; Bian, Aihua; Fly, James; Chen, Guanhua; Speroff, Theodore; Hung, Adriana M; Ikizler, T Alp; Siew, Edward D

    2017-09-16

    Acute kidney injury (AKI) is associated with subsequent chronic kidney disease (CKD), but the mechanism is unclear. To clarify this, we examined the association of AKI and new-onset or worsening proteinuria during the 12 months following hospitalization in a national retrospective cohort of United States Veterans hospitalized between 2004-2012. Patients with and without AKI were matched using baseline demographics, comorbidities, proteinuria, estimated glomerular filtration rate, blood pressure, angiotensin-converting enzyme inhibitor or angiotensin II receptor blocker (ACEI/ARB) use, and inpatient exposures linked to AKI. The distribution of proteinuria over one year post-discharge in the matched cohort was compared using inverse probability sampling weights. Subgroup analyses were based on diabetes, pre-admission ACEI/ARB use, and AKI severity. Among the 90,614 matched AKI and non-AKI pairs, the median estimated glomerular filtration rate was 62 mL/min/1.73m(2). The prevalence of diabetes and hypertension were 48% and 78%, respectively. The odds of having one plus or greater dipstick proteinuria was significantly higher during each month of follow-up in patients with AKI than in patients without AKI (odds ratio range 1.20-1.39). Odds were higher in patients with Stage II or III AKI (odds ratios 1.32-1.81) than in Stage I AKI (odds ratios 1.18-1.32), using non-AKI as the reference group. Results were consistent regardless of diabetes status or baseline ACEI/ARB use. Thus, AKI is a risk factor for incident or worsening proteinuria, suggesting a possible mechanism linking AKI and future CKD. The type of proteinuria, physiology, and clinical significance warrant further study as a potentially modifiable risk factor in the pathway from AKI to CKD. Published by Elsevier Inc.

  1. Towards optimal packed string matching

    DEFF Research Database (Denmark)

    Ben-Kiki, Oren; Bille, Philip; Breslauer, Dany

    2014-01-01

    In the packed string matching problem, it is assumed that each machine word can accommodate up to α characters, thus an n-character string occupies n/α memory words.(a) We extend the Crochemore–Perrin constant-space O(n)-time string-matching algorithm to run in optimal O(n/α) time and even in real......-time, achieving a factor α speedup over traditional algorithms that examine each character individually. Our macro-level algorithm only uses the standard AC0 instructions of the word-RAM model (i.e. no integer multiplication) plus two specialized micro-level AC0 word-size packed-string instructions. The main word...... matching work.(b) We also consider the complexity of the packed string matching problem in the classical word-RAM model in the absence of the specialized micro-level instructions wssm and wslm. We propose micro-level algorithms for the theoretically efficient emulation using parallel algorithms techniques...

  2. Matchings with Externalities and Attitudes

    DEFF Research Database (Denmark)

    Branzei, Simina; Michalak, Tomasz; Rahwan, Talal;

    2013-01-01

    Two-sided matchings are an important theoretical tool used to model markets and social interactions. In many real-life problems the utility of an agent is influenced not only by their own choices, but also by the choices that other agents make. Such an influence is called an externality. Whereas ...

  3. Fuzzy private matching (extended abstract)

    NARCIS (Netherlands)

    Chmielewski, L.; Hoepman, J.H.

    2008-01-01

    In the private matching problem, a client and a server each hold a set of n input elements. The client wants to privately compute the intersection of these two sets: he learns which elements he has in common with the server (and nothing more), while the server gains no information at all. In certain

  4. An Implementation of Bigraph Matching

    DEFF Research Database (Denmark)

    Glenstrup, Arne John; Damgaard, Troels Christoffer; Birkedal, Lars

    We describe a provably sound and complete matching algorithm for bigraphical reactive systems. The algorithm has been implemented in our BPL Tool, a first implementation of bigraphical reactive systems. We describe the tool and present a concrete example of how it can be used to simulate a model...

  5. Sensory exotropia subsequent to senile cataract

    Institute of Scientific and Technical Information of China (English)

    LOU Ding-hua; XU Ye-sheng; LI Yu-min

    2005-01-01

    To evaluate the phacoemulsification and intraocular lens implantation in patients with sensory exotropia subsequent to senile cataract. The authors prospectively studied the role of phacoemulsification and intraocular lens implantation on 25 patients by observing visual acuity, ocular alignment, binocular vision and diplopia pre-, 1 month post- and 3 months post-operation. The patients underwent follow-up for three months. Postoperatively, one patient had a corrected visual acuity of 20/50, and 24 patients had 20/40 or better. The ocular alignment, binocular vision and diplopia were resolved spontaneously. Phacoemulsification and intraocular lens implantation performed together is effective on sensory exotropia subsequent to senile cataract.

  6. Maternal Responsiveness and Subsequent Child Compliance.

    Science.gov (United States)

    Parpal, Mary; Maccoby, Eleanor E.

    1985-01-01

    Contrasts effects of three modes of mother/child interaction on children's subsequent compliance with maternal directives. Subjects were 39 children from lower-middle-class families, ranging in age from approximately three to four-and-a-half. Responsive play and noninteractive conditions produced higher levels of compliance than the untrained free…

  7. 28 CFR 2.14 - Subsequent proceedings.

    Science.gov (United States)

    2010-07-01

    ... 28 Judicial Administration 1 2010-07-01 2010-07-01 false Subsequent proceedings. 2.14 Section 2.14... proceedings. (a) Interim proceedings. The purpose of an interim hearing required by 18 U.S.C. 4208(h) shall be... date or commence rescission proceedings as provided by § 2.34; (iv) Advance the parole date...

  8. The effect of abortion on outcome of subsequent pregnancy

    Directory of Open Access Journals (Sweden)

    Abortion

    1999-08-01

    Full Text Available In a historical cohort study we evaluated the effects of spontaneous abortion on subsequent pregnancy outcome. 1693 pregnant women were classifield in three groups: 1100: without any prior pregnancy, group 1; 550: with history of one spontaneous abortion (G2A1, group 2; 43: with two or more prior spontaneous abortions and no other prior pregnancies, group 3. We collected data through interview, patient's records and physical examination. We matched the patients according to their age subgroups, history of chronic disease, drug administration and radiation during current pregnancy and familial marriage. Then we compared adverse outcome of present pregnancy in group 1 and 2 with the women without prior pregnancy. We analysed the data with Chi-square and Fisher's exact methods. In this study we concluded that history of one spontaneous abortion had no effect on subsequent pregnancy except on prolonged ROM (P<0.000, but history of two or more abortions significantly affects occurrence of stillbirth (RR=29, P=0.003 and placenta previa (RR=8.5, P=0.03. These findings suggest that pregnant women with history of two or more spontaneous abortion need special prenatal care.

  9. Chinese license plate character segmentation using multiscale template matching

    Science.gov (United States)

    Tian, Jiangmin; Wang, Guoyou; Liu, Jianguo; Xia, Yuanchun

    2016-09-01

    Character segmentation (CS) plays an important role in automatic license plate recognition and has been studied for decades. A method using multiscale template matching is proposed to settle the problem of CS for Chinese license plates. It is carried out on a binary image integrated from maximally stable extremal region detection and Otsu thresholding. Afterward, a uniform harrow-shaped template with variable length is designed, by virtue of which a three-dimensional matching space is constructed for searching of candidate segmentations. These segmentations are detected at matches with local minimum responses. Finally, the vertical boundaries of each single character are located for subsequent recognition. Experiments on a data set including 2349 license plate images of different quality levels show that the proposed method can achieve a higher accuracy at comparable time cost and is robust to images in poor conditions.

  10. Matching of equivalent field regions

    DEFF Research Database (Denmark)

    Appel-Hansen, Jørgen; Rengarajan, S.B.

    2005-01-01

    screen, having the same homogeneous medium on both sides and an impressed current on one aide, an alternative procedure is relevant. We make use of the fact that in the aperture the tangential component of the magnetic field due to the induced currents in the screen is zero. The use of such a procedure......In aperture problems, integral equations for equivalent currents are often found by enforcing matching of equivalent fields. The enforcement is made in the aperture surface region adjoining the two volumes on each side of the aperture. In the case of an aperture in a planar perfectly conducting...... shows that equivalent currents can be found by a consideration of only one of the two volumes into which the aperture plane divides the space. Furthermore, from a consideration of an automatic matching at the aperture, additional information about tangential as well as normal field components...

  11. Impedance-matched Marx generators

    Directory of Open Access Journals (Sweden)

    W. A. Stygar

    2017-04-01

    Full Text Available We have conceived a new class of prime-power sources for pulsed-power accelerators: impedance-matched Marx generators (IMGs. The fundamental building block of an IMG is a brick, which consists of two capacitors connected electrically in series with a single switch. An IMG comprises a single stage or several stages distributed axially and connected in series. Each stage is powered by a single brick or several bricks distributed azimuthally within the stage and connected in parallel. The stages of a multistage IMG drive an impedance-matched coaxial transmission line with a conical center conductor. When the stages are triggered sequentially to launch a coherent traveling wave along the coaxial line, the IMG achieves electromagnetic-power amplification by triggered emission of radiation. Hence a multistage IMG is a pulsed-power analogue of a laser. To illustrate the IMG approach to prime power, we have developed conceptual designs of two ten-stage IMGs with LC time constants on the order of 100 ns. One design includes 20 bricks per stage, and delivers a peak electrical power of 1.05 TW to a matched-impedance 1.22-Ω load. The design generates 113 kV per stage and has a maximum energy efficiency of 89%. The other design includes a single brick per stage, delivers 68 GW to a matched-impedance 19-Ω load, generates 113 kV per stage, and has a maximum energy efficiency of 90%. For a given electrical-power-output time history, an IMG is less expensive and slightly more efficient than a linear transformer driver, since an IMG does not use ferromagnetic cores.

  12. Template Matching on Parallel Architectures,

    Science.gov (United States)

    1985-07-01

    memory. The processors run asynchronously. Thus according to Hynn’s categories the Butterfl . is a MIMD machine. The processors of the Butterfly are...Generalized Butterfly Architecture This section describes timings for pattern matching on the generalized Butterfl .. Ihe implementations on the Butterfly...these algorithms. Thus the best implementation of the techniques on the generalized Butterfl % are the same as the implementation on the real Butterfly

  13. Monetary Exchange with Multilateral Matching

    DEFF Research Database (Denmark)

    Julien, Benoît; Kennes, John; King, Ian

    the results with Kiyotaki and Wright (1993), Trejos and Wright (1995), and Lagos and Wright (2005) respectively. We find that the multilateral matching setting generates very simple and intuitive equilibrium allocations that are similar to those in the other papers, but which have important differences....... Finally, analysis of the case of divisible goods and money can be performed without the assumption of large families (as in Shi (1997)) or the day and night structure of Lagos and Wright (2005)....

  14. Duplicate-based Schema Matching

    OpenAIRE

    Bilke, Alexander

    2007-01-01

    Die Integration unabhängig voneinander entwickelter Datenquellen stellt uns vor viele Probleme, die das Ergebnis verschiedener Arten von Heterogenität sind. Eine der größten Herausforderungen ist Schema Matching: der halb-automatische Prozess, in dem semantische Beziehungen zwischen Attributen in heterogenen Schemata erkannt werden. Verschiedene Lösungen, die Schemainformationen ausnutzen oder spezifische Eigenschaften aus Attributwerten extrahieren, wurden in der Literatur beschrieben. In di...

  15. Spurring Innovation with Matching Grants

    OpenAIRE

    2015-01-01

    Matching grants are one of the most common tools used in private sector development programs in developing countries and have been included in more than 60 World Bank projects totaling over US$1.2 billion, funding over 100,000 micro, small and medium enterprises. The Enterprise Revitalization and Employment Pilot (EREP) was designed as a two year pilot project aimed at improving firm capab...

  16. Matching Games with Additive Externalities

    DEFF Research Database (Denmark)

    Branzei, Simina; Michalak, Tomasz; Rahwan, Talal

    2012-01-01

    Two-sided matchings are an important theoretical tool used to model markets and social interactions. In many real life problems the utility of an agent is influenced not only by their own choices, but also by the choices that other agents make. Such an influence is called an externality. Whereas......, optimistic, and pessimistic behaviour, and provide both computational hardness results and polynomial-time algorithms for computing stable outcomes....

  17. On String Matching with Mismatches

    Directory of Open Access Journals (Sweden)

    Marius Nicolae

    2015-05-01

    Full Text Available In this paper, we consider several variants of the pattern matching with mismatches problem. In particular, given a text \\(T=t_1 t_2\\cdots t_n\\ and a pattern \\(P=p_1p_2\\cdots p_m\\, we investigate the following problems: (1 pattern matching with mismatches: for every \\(i, 1\\leq i \\leq n-m+1\\ output, the distance between \\(P\\ and \\(t_i t_{i+1}\\cdots t_{i+m-1}\\; and (2 pattern matching with \\(k\\ mismatches: output those positions \\(i\\ where the distance between \\(P\\ and \\(t_i t_{i+1}\\cdots t_{i+m-1}\\ is less than a given threshold \\(k\\. The distance metric used is the Hamming distance. We present some novel algorithms and techniques for solving these problems. We offer deterministic, randomized and approximation algorithms. We consider variants of these problems where there could be wild cards in either the text or the pattern or both. We also present an experimental evaluation of these algorithms. The source code is available at http://www.engr.uconn.edu/\\(\\sim\\man09004/kmis.zip.

  18. Incremental pattern matching for regular expressions

    NARCIS (Netherlands)

    Jalali, Arash; Ghamarian, Amir Hossein; Rensink, Arend; Fish, Andrew; Lambers, Leen

    2012-01-01

    Graph pattern matching lies at the heart of any graph transformation-based system. Incremental pattern matching is one approach proposed for reducingthe overall cost of pattern matching over successive transformations by preserving the matches that stay relevant after a rule application. An importan

  19. 32 CFR 806b.50 - Computer matching.

    Science.gov (United States)

    2010-07-01

    ... 32 National Defense 6 2010-07-01 2010-07-01 false Computer matching. 806b.50 Section 806b.50... PROGRAM Disclosing Records to Third Parties § 806b.50 Computer matching. Computer matching programs... on forms used in applying for benefits. Coordinate computer matching statements on forms with...

  20. Pregnancy scares and subsequent unintended pregnancy

    OpenAIRE

    Heather Gatny; Yasamin Kusunoki; Jennifer Barber

    2014-01-01

    Background: A substantial number of young women experience pregnancy scares - thinking they might be pregnant, and later discovering that they are not. Although pregnancy scares are distressing events, little is known about who experiences them and whether they are important to our understanding of unintended pregnancy. Objective: We describe the young women who experience pregnancy scares, and examine the link between pregnancy scares and subsequent unintended pregnancy. Methods: We us...

  1. Association of Periodontitis and Subsequent Depression

    OpenAIRE

    Hsu, Chih-Chao; Hsu, Yi-Chao; Chen, Hsuan-Ju; Lin, Che-Chen; Chang, Kuang-Hsi; Lee, Chang-Yin; Chong, Lee-Won; Kao, Chia-Hung

    2015-01-01

    Abstract Periodontitis is a systemic and chronic inflammatory disease associated with multiple physical conditions. Distress and depression are other problems affecting the progression of periodontitis. However, the causal relationship between depression and periodontitis has not been adequately investigated. This aim of this study was to determine the association between periodontitis and the subsequent development of depression. We identified 12,708 patients with newly diagnosed periodontit...

  2. Accumulation and subsequent utilization of waste heat

    Science.gov (United States)

    Koloničný, Jan; Richter, Aleš; Pavloková, Petra

    2016-06-01

    This article aims to introduce a special way of heat accumulation and primary operating characteristics. It is the unique way in which the waste heat from flue gas of biogas cogeneration station is stored in the system of storage tanks, into the heat transfer oil. Heat is subsequently transformed into water, from which is generated the low-pressure steam. Steam, at the time of peak electricity needs, spins the special designed turbine generator and produces electrical energy.

  3. Locomotion Characteristics and Match-Induced Impairments in Physical Performance in Male Elite Team Handball Players

    DEFF Research Database (Denmark)

    Michalsik, L B; Aagaard, Peter; Madsen, Klavs

    2013-01-01

    The purpose of this study was to determine the physical demands and match-induced impairments in physical performance in male elite Team Handball (TH) players in relation to playing position. Male elite TH field players were closely observed during 6 competitive seasons. Each player (wing players......: WP, pivots: PV, backcourt players: BP) was evaluated during match-play using video recording and subsequently performing locomotion match analysis. A total distance of 3 627±568 m (group means±SD) was covered per match with a total effective playing time (TPT) of 53:51±5:52 min:s, while full...

  4. Prenatal care and subsequent birth intervals.

    Science.gov (United States)

    Teitler, Julien O; Das, Dhiman; Kruse, Lakota; Reichman, Nancy E

    2012-03-01

    Prenatal care generally includes contraceptive and health education that may help women to control their subsequent fertility. However, research has not examined whether receipt of prenatal care is associated with subsequent birthspacing. Longitudinally linked birth records from 113,662 New Jersey women who had had a first birth in 1996-2000 were used to examine associations between the timing and adequacy of prenatal care prior to a woman's first birth and the timing of her second birth. Multinomial logistic regression analyses adjusted for social and demographic characteristics, hospital and year of birth. Most women (85%) had initiated prenatal care during the first trimester. Women who had not obtained prenatal care until the second or third trimester, or at all, were more likely than those who had had first-trimester care to have a second child within 18 months, rather than in 18-59 months (odds ratios, 1.2-1.6). Similarly, women whose care had been inadequate were more likely than those who had had adequate care to have a short subsequent birth interval (1.2). The associations were robust to alternative measures of prenatal care and birth intervals, and were strongest for mothers with less than 16 years of education. Providers should capitalize on their limited encounters with mothers who initiate prenatal care late or use it sporadically to ensure that these women receive information about family planning. Copyright © 2012 by the Guttmacher Institute.

  5. Induced abortion and subsequent pregnancy duration

    DEFF Research Database (Denmark)

    Zhou, Wei Jin; Sørensen, Henrik Toft; Olsen, Jørn

    1999-01-01

    OBJECTIVE: To examine whether induced abortion influences subsequent pregnancy duration. METHODS: Women who had their first pregnancies during 1980, 1981, and 1982 were identified in three Danish national registries. A total of 15,727 women whose pregnancies were terminated by first-trimester ind......OBJECTIVE: To examine whether induced abortion influences subsequent pregnancy duration. METHODS: Women who had their first pregnancies during 1980, 1981, and 1982 were identified in three Danish national registries. A total of 15,727 women whose pregnancies were terminated by first......-trimester induced abortions were compared with 46,026 whose pregnancies were not terminated by induced abortions. All subsequent pregnancies until 1994 were identified by register linkage. RESULTS: Preterm and post-term singleton live births were more frequent in women with one, two, or more previous induced...... abortions. After adjusting for potential confounders and stratifying by gravidity, the odds ratios of preterm singleton live births in women with one, two, or more previous induced abortions were 1.89 (95% confidence interval [CI] 1.70, 2.11), 2.66 (95% CI 2.09, 3.37), and 2.03 (95% CI 1.29, 3...

  6. Matching polytopes and Specht modules

    CERN Document Server

    Liu, Ricky Ini

    2009-01-01

    We prove that the dimension of the Specht module of a forest $G$ is the same as the normalized volume of the matching polytope of $G$. We also associate to $G$ a symmetric function $s_G$ (analogous to the Schur symmetric function $s_\\lambda$ for a partition $\\lambda$) and investigate its combinatorial and representation-theoretic properties in relation to the Specht module and Schur module of $G$. We then use this to define notions of standard and semistandard tableaux for forests.

  7. Workplace bullying and subsequent health problems.

    Science.gov (United States)

    Nielsen, Morten Birkeland; Magerøy, Nils; Gjerstad, Johannes; Einarsen, Ståle

    2014-07-01

    Cross-sectional studies demonstrate that exposure to bullying in the workplace is positively correlated with self-reported health problems. However, these studies do not provide a basis to draw conclusions on the extent to which bullying leads to increased health problems or whether health problems increase the risk of being bullied. To provide better indications of a causal relationship, knowledge from prospective studies on the association between bullying in the workplace and health outcomes is therefore summarised. We conducted a systematic literature review of original articles from central literature databases on longitudinal associations between bullying in the workplace and health. Average associations between bullying and health outcomes are calculated using meta-analysis. A consistent finding across the studies is that exposure to bullying is significantly positively related to mental health problems (OR =1.68; 95% KI 1.35-2.09) and somatic symptoms (OR = 1.77; 95% KI 1.41-2.22) over time. Mental health problems are also associated with subsequent exposure to bullying (OR = 1.74; 95% KI 1.44-2.12). Bullying is positively related to mental health problems and somatic symptoms. The association between mental health problems and subsequent bullying indicates a self-reinforcing process between mental health and bullying. The methodological quality of the studies that were conducted is relatively sound. However, based on the existing knowledge base there are no grounds for conclusions regarding an unambiguous causal relationship between bullying and health.

  8. Hybrid Schema Matching for Deep Web

    Science.gov (United States)

    Chen, Kerui; Zuo, Wanli; He, Fengling; Chen, Yongheng

    Schema matching is the process of identifying semantic mappings, or correspondences, between two or more schemas. Schema matching is a first step and critical part of data integration. For schema matching of deep web, most researches only interested in query interface, while rarely pay attention to abundant schema information contained in query result pages. This paper proposed a mixed schema matching technique, which combines attributes that appeared in query structures and query results of different data sources, and mines the matched schemas inside. Experimental results prove the effectiveness of this method for improving the accuracy of schema matching.

  9. Smart templates for peak pattern matching with comprehensive two-dimensional liquid chromatography.

    Science.gov (United States)

    Reichenbach, Stephen E; Carr, Peter W; Stoll, Dwight R; Tao, Qingping

    2009-04-17

    Comprehensive two-dimensional liquid chromatography (LCxLC) generates information-rich but complex peak patterns that require automated processing for rapid chemical identification and classification. This paper describes a powerful approach and specific methods for peak pattern matching to identify and classify constituent peaks in data from LCxLC and other multidimensional chemical separations. The approach records a prototypical pattern of peaks with retention times and associated metadata, such as chemical identities and classes, in a template. Then, the template pattern is matched to the detected peaks in subsequent data and the metadata are copied from the template to identify and classify the matched peaks. Smart Templates employ rule-based constraints (e.g., multispectral matching) to increase matching accuracy. Experimental results demonstrate Smart Templates, with the combination of retention-time pattern matching and multispectral constraints, are accurate and robust with respect to changes in peak patterns associated with variable chromatographic conditions.

  10. On Zero Sum Subsequences of Restricted Size

    Indian Academy of Sciences (India)

    B K Moriya

    2010-09-01

    Let be a finite abelian group with $\\exp(G)=e$. Let $s(G)$ be the minimal integer with the property that any sequence of elements in contains an -term subsequence with sum zero. Let , and be positive integers and ≥ 3. Furthermore, $(C^r_m)=a_r(m-1)+1$, for some constant $a_r$ depending on and is a fixed positive integer such that $$n≥\\frac{m^r(c(r)m-a_r(m-1)+m-3)(m-1)-(m+1)+(m+1)(a_r+1)}{m(m+1)(a_r+1)}$$ and $s(C^r_n)=(a_r+1)(n-1)+1$. In the above lower bound on $n,c(r)$ is the Alon-Dubiner constant. Then $s(C^r_{nm})=(a_r+1)(nm-1)+1$.

  11. Lenticular neovascularization subsequent to traumatic cataract formation.

    Science.gov (United States)

    Kabat, Alan G

    2011-09-01

    To report a series of cases involving neovascularization within the human crystalline lens-a normally avascular structure-after ocular trauma. This is a retrospective, consecutive observational case series with review of the prevailing literature. Four individuals with a history of ocular trauma and subsequent cataract development were examined between May 2004 and April 2007. All had hypermature cataracts and intraocular inflammation, presumably secondary to phacolysis; two of the four had concurrent hyphema and ocular hypertension in the involved eye. All subjects in this series were found to display a discrete network of blood vessels within the structure of the crystalline lens, just beneath the anterior lens capsule. Neovascularization of the crystalline lens has received little attention in the ophthalmic literature, having been described only rarely in individual case reports. This manuscript details the first known case series involving lenticular neovascularization, and offers insight into its possible developmental mechanism.

  12. Activity recognition from minimal distinguishing subsequence mining

    Science.gov (United States)

    Iqbal, Mohammad; Pao, Hsing-Kuo

    2017-08-01

    Human activity recognition is one of the most important research topics in the era of Internet of Things. To separate different activities given sensory data, we utilize a Minimal Distinguishing Subsequence (MDS) mining approach to efficiently find distinguishing patterns among different activities. We first transform the sensory data into a series of sensor triggering events and operate the MDS mining procedure afterwards. The gap constraints are also considered in the MDS mining. Given the multi-class nature of most activity recognition tasks, we modify the MDS mining approach from a binary case to a multi-class one to fit the need for multiple activity recognition. We also study how to select the best parameter set including the minimal and the maximal support thresholds in finding the MDSs for effective activity recognition. Overall, the prediction accuracy is 86.59% on the van Kasteren dataset which consists of four different activities for recognition.

  13. Weight at birth and subsequent fecundability

    DEFF Research Database (Denmark)

    Wildenschild, Cathrine; Riis, Anders H; Ehrenstein, Vera

    2014-01-01

    OBJECTIVE: To examine the association between a woman's birth weight and her subsequent fecundability. METHOD: In this prospective cohort study, we included 2,773 Danish pregnancy planners enrolled in the internet-based cohort study "Snart-Gravid", conducted during 2007-2012. Participants were 18......-40 years old at study entry, attempting to conceive, and were not receiving fertility treatment. Data on weight at birth were obtained from the Danish Medical Birth Registry and categorized as birth weight...... was categorized according to z-scores for each gestational week at birth. Time-to-pregnancy measured in cycles was used to compute fecundability ratios (FR) and 95% confidence intervals (CI), using a proportional probabilities regression model. RESULTS: Relative to women with a birth weight of 3,000-3,999 grams...

  14. Monetary Exchange with Multilateral Matching

    DEFF Research Database (Denmark)

    Julien, Benoît; Kennes, John; King, Ian

    . In particular, surplus maximization can be achieved in this setting, in equilibrium, with a positive money supply. Moreover, with flexible prices and directed search, the first best allocation can be attained through price posting or through auctions with lotteries, but not through auctions without lotteries......This paper analyzes monetary exchange in a search model allowing for multilateral matches to be formed, according to a standard urn-ballprocess. We consider three physical environments: indivisible goods and money, divisible goods and indivisible money, and divisible goods and money. We compare....... Finally, analysis of the case of divisible goods and money can be performed without the assumption of large families (as in Shi (1997)) or the day and night structure of Lagos and Wright (2005)....

  15. Matching conditions on capillary ripples

    Energy Technology Data Exchange (ETDEWEB)

    Rodriguez, Aresky H.; Marin Antuna, J.; Rodriguez Coppola, H. [Universidad de La Habana, La Habana (Cuba)

    2001-12-01

    The physics of the oscillatory motion in the interface between two immiscible viscous fluids is presented based on a detailed analysis of the matching conditions. These conditions are almost completely derived from the dynamical equations of the system. This unusual approach in graduated courses in hydrodynamics, is proposed as an alternative. The role of viscosity in the modes of oscillation of the interface is also clearly shown. [Spanish] Se explica la fisica de las oscilaciones de la interfase de dos fluidos viscosos no miscibles a partir del analisis detallado de las condiciones de empalme que se derivan casi completamente del sistema de ecuaciones dinamicas que lo rigen. Ese enfoque, no habitual en los cursos de doctorado de esta materia, se propone como alternativa para estos cursos. Se explica tambien de forma clara el posible papel de la viscosidad en los modos de oscilacion de la interfase.

  16. Making Palm Print Matching Mobile

    CERN Document Server

    Fang, Li; Chian, Cheng Shao

    2009-01-01

    With the growing importance of personal identification and authentication in todays highly advanced world where most business and personal tasks are being replaced by electronic means, the need for a technology that is able to uniquely identify an individual and has high fraud resistance see the rise of biometric technologies. Making biometric based solution mobile is a promising trend. A new RST invariant square based palm print ROI extraction method was successfully implemented and integrated into the current application suite. A new set of palm print image database captured using embedded cameras in mobile phone was created to test its robustness. Comparing to those extraction methods that are based on boundary tracking of the overall hand shape that has limitation of being unable to process palm print images that has one or more fingers closed, the system can now effectively handle the segmentation of palm print images with varying finger positioning. The high flexibility makes palm print matching mobile ...

  17. Genetic Programming Framework for Fingerprint Matching

    CERN Document Server

    Ismail, Ismail A; Abd-ElWahid, Mohammed A; ElKafrawy, Passent M; Nasef, Mohammed M

    2009-01-01

    A fingerprint matching is a very difficult problem. Minutiae based matching is the most popular and widely used technique for fingerprint matching. The minutiae points considered in automatic identification systems are based normally on termination and bifurcation points. In this paper we propose a new technique for fingerprint matching using minutiae points and genetic programming. The goal of this paper is extracting the mathematical formula that defines the minutiae points.

  18. Sample evaluation of ontology-matching systems

    NARCIS (Netherlands)

    Hage, W.R. van; Isaac, A.; Aleksovski, Z.

    2007-01-01

    Ontology matching exists to solve practical problems. Hence, methodologies to find and evaluate solutions for ontology matching should be centered on practical problems. In this paper we propose two statistically-founded evaluation techniques to assess ontology-matching performance that are based on

  19. Sample evaluation of ontology-matching systems

    NARCIS (Netherlands)

    Hage, W.R. van; Isaac, A.; Aleksovski, Z.

    2007-01-01

    Ontology matching exists to solve practical problems. Hence, methodologies to find and evaluate solutions for ontology matching should be centered on practical problems. In this paper we propose two statistically-founded evaluation techniques to assess ontology-matching performance that are based on

  20. DEFICIENT CUBIC SPLINES WITH AVERAGE SLOPE MATCHING

    Institute of Scientific and Technical Information of China (English)

    V. B. Das; A. Kumar

    2005-01-01

    We obtain a deficient cubic spline function which matches the functions with certain area matching over a greater mesh intervals, and also provides a greater flexibility in replacing area matching as interpolation. We also study their convergence properties to the interpolating functions.

  1. 24 CFR 92.221 - Match credit.

    Science.gov (United States)

    2010-04-01

    ... 24 Housing and Urban Development 1 2010-04-01 2010-04-01 false Match credit. 92.221 Section 92.221... INVESTMENT PARTNERSHIPS PROGRAM Program Requirements Matching Contribution Requirement § 92.221 Match credit. (a) When credit is given. Contributions are credited on a fiscal year basis at the time the...

  2. Connections between the matching and chromatic polynomials

    Directory of Open Access Journals (Sweden)

    E. J. Farrell

    1992-01-01

    Full Text Available The main results established are (i a connection between the matching and chromatic polynomials and (ii a formula for the matching polynomial of a general complement of a subgraph of a graph. Some deductions on matching and chromatic equivalence and uniqueness are made.

  3. Concerns on Monotonic Imbalance Bounding Matching Methods

    OpenAIRE

    Yatracos, Yannis G.

    2013-01-01

    Concerns are expressed for the Monotonic Imbalance Bounding (MIB) property (Iacus et al. 2011) and for MIB matching because i) the definition of the MIB property leads to inconsistencies and the nature of the imbalance measure is not clearly defined, ii) MIB property does not generalize Equal Percent Bias Reducing (EPBR) property, iii) MIB matching does not provide statistical information available with EPBR matching.

  4. 13 CFR 130.450 - Matching funds.

    Science.gov (United States)

    2010-01-01

    ... in the budget proposal. Cash sources shall be identified by name and account. All applicants must... received by the SBDC during the budget period, as long as the total Cash Match provided by the SBDC is 50... to the total amount of SBA funding. At least 50% of the Matching Funds must be Cash Match....

  5. 13 CFR 102.40 - Computer matching.

    Science.gov (United States)

    2010-01-01

    ... 13 Business Credit and Assistance 1 2010-01-01 2010-01-01 false Computer matching. 102.40 Section... Protection of Privacy and Access to Individual Records Under the Privacy Act of 1974 § 102.40 Computer matching. The OCIO will enforce the computer matching provisions of the Privacy Act. The FOI/PA Office...

  6. 39 CFR 266.10 - Computer matching.

    Science.gov (United States)

    2010-07-01

    ... 39 Postal Service 1 2010-07-01 2010-07-01 false Computer matching. 266.10 Section 266.10 Postal... Computer matching. (a) General. Any agency or Postal Service component that wishes to use records from a... records must submit its proposal to the Postal Service Manager Records Office. Computer matching...

  7. Towards structural Web Services matching based on Kernel methods

    Institute of Scientific and Technical Information of China (English)

    NAN Kai; YU Jianjun; SU Hao; GUO Shengmin; ZHANG Hui; XU Ke

    2007-01-01

    This paper describes a kernel methods based Web Services matching mechanism for Web Services discovery and integration.The matching mechanism tries to exploit the latent semantics by the structure of Web Services.In this paper,Web Services are schemed by WSDL(Web Services Description Language)as tree-structured XML documents,and their matching degree is calculated by our novel algorithm designed for loosely tree matching against the traditional methods.In order to achieve the task,we bring forward the concept of path subsequence to model WSDL documents in the vector space.Then,an advanced n-spectrum kernel function is defined,so that the similarity of two WSDL documents can be drawn by implementing the kernel function in the space.Using textual similarity and n-spectrum kernel values as features of low-level and mid-level,we build up a model to estimate the functional similarity between Web Services,whose parameters are learned by a ranking-SVM.Finally,a set of experiments were designed to verify the model,and the results showed that several metrics for the retrieval of Web Services have been improved by our approach.

  8. Improved Feature Matching for Mobile Devices with IMU.

    Science.gov (United States)

    Masiero, Andrea; Vettore, Antonio

    2016-08-05

    Thanks to the recent diffusion of low-cost high-resolution digital cameras and to the development of mostly automated procedures for image-based 3D reconstruction, the popularity of photogrammetry for environment surveys is constantly increasing in the last years. Automatic feature matching is an important step in order to successfully complete the photogrammetric 3D reconstruction: this step is the fundamental basis for the subsequent estimation of the geometry of the scene. This paper reconsiders the feature matching problem when dealing with smart mobile devices (e.g., when using the standard camera embedded in a smartphone as imaging sensor). More specifically, this paper aims at exploiting the information on camera movements provided by the inertial navigation system (INS) in order to make the feature matching step more robust and, possibly, computationally more efficient. First, a revised version of the affine scale-invariant feature transform (ASIFT) is considered: this version reduces the computational complexity of the original ASIFT, while still ensuring an increase of correct feature matches with respect to the SIFT. Furthermore, a new two-step procedure for the estimation of the essential matrix E (and the camera pose) is proposed in order to increase its estimation robustness and computational efficiency.

  9. Matched-filter acquisition for BOLD fMRI.

    Science.gov (United States)

    Kasper, Lars; Haeberlin, Maximilian; Dietrich, Benjamin E; Gross, Simon; Barmet, Christoph; Wilm, Bertram J; Vannesjo, S Johanna; Brunner, David O; Ruff, Christian C; Stephan, Klaas E; Pruessmann, Klaas P

    2014-10-15

    We introduce matched-filter fMRI, which improves BOLD (blood oxygen level dependent) sensitivity by variable-density image acquisition tailored to subsequent image smoothing. Image smoothing is an established post-processing technique used in the vast majority of fMRI studies. Here we show that the signal-to-noise ratio of the resulting smoothed data can be substantially increased by acquisition weighting with a weighting function that matches the k-space filter imposed by the smoothing operation. We derive the theoretical SNR advantage of this strategy and propose a practical implementation of 2D echo-planar acquisition matched to common Gaussian smoothing. To reliably perform the involved variable-speed trajectories, concurrent magnetic field monitoring with NMR probes is used. Using this technique, phantom and in vivo measurements confirm reliable SNR improvement in the order of 30% in a "resting-state" condition and prove robust in different regimes of physiological noise. Furthermore, a preliminary task-based visual fMRI experiment equally suggests a consistent BOLD sensitivity increase in terms of statistical sensitivity (average t-value increase of about 35%). In summary, our study suggests that matched-filter acquisition is an effective means of improving BOLD SNR in studies that rely on image smoothing at the post-processing level. Copyright © 2014 Elsevier Inc. All rights reserved.

  10. Underwater Acoustic Matched Field Imaging Based on Compressed Sensing

    Directory of Open Access Journals (Sweden)

    Huichen Yan

    2015-10-01

    Full Text Available Matched field processing (MFP is an effective method for underwater target imaging and localizing, but its performance is not guaranteed due to the nonuniqueness and instability problems caused by the underdetermined essence of MFP. By exploiting the sparsity of the targets in an imaging area, this paper proposes a compressive sensing MFP (CS-MFP model from wave propagation theory by using randomly deployed sensors. In addition, the model’s recovery performance is investigated by exploring the lower bounds of the coherence parameter of the CS dictionary. Furthermore, this paper analyzes the robustness of CS-MFP with respect to the displacement of the sensors. Subsequently, a coherence-excluding coherence optimized orthogonal matching pursuit (CCOOMP algorithm is proposed to overcome the high coherent dictionary problem in special cases. Finally, some numerical experiments are provided to demonstrate the effectiveness of the proposed CS-MFP method.

  11. Matching network for RF plasma source

    Science.gov (United States)

    Pickard, Daniel S.; Leung, Ka-Ngo

    2007-11-20

    A compact matching network couples an RF power supply to an RF antenna in a plasma generator. The simple and compact impedance matching network matches the plasma load to the impedance of a coaxial transmission line and the output impedance of an RF amplifier at radio frequencies. The matching network is formed of a resonantly tuned circuit formed of a variable capacitor and an inductor in a series resonance configuration, and a ferrite core transformer coupled to the resonantly tuned circuit. This matching network is compact enough to fit in existing compact focused ion beam systems.

  12. Image matching navigation based on fuzzy information

    Institute of Scientific and Technical Information of China (English)

    田玉龙; 吴伟仁; 田金文; 柳健

    2003-01-01

    In conventional image matching methods, the image matching process is mostly based on image statistic information. One aspect neglected by all these methods is that there is much fuzzy information contained in these images. A new fuzzy matching algorithm based on fuzzy similarity for navigation is presented in this paper. Because the fuzzy theory is of the ability of making good description of the fuzzy information contained in images, the image matching method based on fuzzy similarity would look forward to producing good performance results. Experimental results using matching algorithm based on fuzzy information also demonstrate its reliability and practicability.

  13. Sleep quality influences subsequent motor skill acquisition.

    Science.gov (United States)

    Appleman, Erica R; Albouy, Genevieve; Doyon, Julien; Cronin-Golomb, Alice; King, Bradley R

    2016-06-01

    While the influence of sleep on motor memory consolidation has been extensively investigated, its relation to initial skill acquisition is less well understood. The purpose of the present study was to investigate the influence of sleep quality and quantity on subsequent motor skill acquisition in young adults without sleep disorders. Fifty-five healthy adults (mean age = 23.8 years; 34 women) wore actigraph wristbands for 4 nights, which provided data on sleep patterns before the experiment, and then returned to the laboratory to engage in a motor sequence learning task (explicit 5-item finger sequence tapping task). Indicators of sleep quality and quantity were then regressed on a measure of motor skill acquisition (Gains Within Training, GWT). Wake After Sleep Onset (WASO; i.e., the total amount of time the participants spent awake after falling asleep) was significantly and negatively related to GWT. This effect was not because of general arousal level, which was measured immediately before the motor task. Conversely, there was no relationship between GWT and sleep duration or self-reported sleep quality. These results indicate that sleep quality, as assessed by WASO and objectively measured with actigraphy before the motor task, significantly impacts motor skill acquisition in young healthy adults without sleep disorders. (PsycINFO Database Record

  14. Mental imagery affects subsequent automatic defense responses

    Directory of Open Access Journals (Sweden)

    Muriel A Hagenaars

    2015-06-01

    Full Text Available Automatic defense responses promote survival and appropriate action under threat. They have also been associated with the development of threat-related psychiatric syndromes. Targeting such automatic responses during threat may be useful in populations with frequent threat exposure. Here, two experiments explored whether mental imagery as a pre-trauma manipulation could influence fear bradycardia (a core characteristic of freezing during subsequent analogue trauma (affective picture viewing. Image-based interventions have proven successful in the treatment of threat-related disorders, and are easily applicable. In Experiment 1 43 healthy participants were randomly assigned to an imagery script condition. Participants executed a passive viewing task with blocks of neutral, pleasant and unpleasant pictures after listening to an auditory script that was either related (with a positive or a negative outcome or unrelated to the unpleasant pictures from the passive viewing task. Heart rate was assessed during script listening and during passive viewing. Imagining negative related scripts resulted in greater bradycardia (neutral-unpleasant contrast than imagining positive scripts, especially unrelated. This effect was replicated in Experiment 2 (N = 51, again in the neutral-unpleasant contrast. An extra no-script condition showed that bradycardia was not induced by the negative related script, but rather that a positive script attenuated bradycardia. These preliminary results might indicate reduced vigilance after unrelated positive events. Future research should replicate these findings using a larger sample. Either way, the findings show that highly automatic defense behavior can be influenced by relatively simple mental imagery manipulations.

  15. Extremal Matching Energy of Complements of Trees

    Directory of Open Access Journals (Sweden)

    Wu Tingzeng

    2016-08-01

    Full Text Available Gutman and Wagner proposed the concept of the matching energy which is defined as the sum of the absolute values of the zeros of the matching polynomial of a graph. And they pointed out that the chemical applications of matching energy go back to the 1970s. Let T be a tree with n vertices. In this paper, we characterize the trees whose complements have the maximal, second-maximal and minimal matching energy. Furthermore, we determine the trees with edge-independence number p whose complements have the minimum matching energy for p = 1, 2, . . . , [n/2]. When we restrict our consideration to all trees with a perfect matching, we determine the trees whose complements have the second-maximal matching energy.

  16. Matching roots to their environment.

    Science.gov (United States)

    White, Philip J; George, Timothy S; Gregory, Peter J; Bengough, A Glyn; Hallett, Paul D; McKenzie, Blair M

    2013-07-01

    Plants form the base of the terrestrial food chain and provide medicines, fuel, fibre and industrial materials to humans. Vascular land plants rely on their roots to acquire the water and mineral elements necessary for their survival in nature or their yield and nutritional quality in agriculture. Major biogeochemical fluxes of all elements occur through plant roots, and the roots of agricultural crops have a significant role to play in soil sustainability, carbon sequestration, reducing emissions of greenhouse gasses, and in preventing the eutrophication of water bodies associated with the application of mineral fertilizers. This article provides the context for a Special Issue of Annals of Botany on 'Matching Roots to Their Environment'. It first examines how land plants and their roots evolved, describes how the ecology of roots and their rhizospheres contributes to the acquisition of soil resources, and discusses the influence of plant roots on biogeochemical cycles. It then describes the role of roots in overcoming the constraints to crop production imposed by hostile or infertile soils, illustrates root phenotypes that improve the acquisition of mineral elements and water, and discusses high-throughput methods to screen for these traits in the laboratory, glasshouse and field. Finally, it considers whether knowledge of adaptations improving the acquisition of resources in natural environments can be used to develop root systems for sustainable agriculture in the future.

  17. Towards Robust Image Matching Algorithms

    Science.gov (United States)

    Parsons, Timothy J.

    1984-12-01

    The rapid advance in digital electronics during recent years has enabled the real-time hardware implementation of many basic image processing techniques and these methods are finding increasing use in both commercial and military applications where a superiority to existing systems can be demonstrated. The potential superiority of an entirely passive, automatic image processing based navigation system over the less accurate and active navigation systems based on radar, for example "TERCOM", is evident. By placing a sensor on board an aircraft or missile together with the appropriate processing power and enough memory to store a reference image or a map of the planned route, large scale features extracted from the scene available to the sensor can be compared with the same feature stored in memory. The difference between the aircraft's actual position and its desired position can then be evaluated and the appropriate navigational correction undertaken. This paper summaries work carried out at British Aerospace Hatfield to investigate various classes of algorithms and solutions which would render a robust image matching system viable for such an automatic system flying at low level with a thermal I.R. sensor.

  18. Orthogonal Matching Pursuit with Replacement

    CERN Document Server

    Jain, Prateek; Dhillon, Inderjit S

    2011-01-01

    In this paper, we consider the problem of compressed sensing where the goal is to recover almost all the sparse vectors using a small number of fixed linear measurements. For this problem, we propose a novel partial hard-thresholding operator that leads to a general family of iterative algorithms. While one extreme of the family yields well known hard thresholding algorithms like ITI (Iterative Thresholding with Inversion) and HTP (Hard Thresholding Pursuit), the other end of the spectrum leads to a novel algorithm that we call Orthogonal Matching Pursuit with Replacement (OMPR). OMPR, like the classic greedy algorithm OMP, adds exactly one coordinate to the support at each iteration, based on the correlation with the current residual. However, unlike OMP, OMPR also removes one coordinate from the support. This simple change allows us to prove that OMPR has the best known guarantees for sparse recovery in terms of the Restricted Isometry Property (a condition on the measurement matrix). In contrast, OMP is kn...

  19. Maximum Matchings via Glauber Dynamics

    CERN Document Server

    Jindal, Anant; Pal, Manjish

    2011-01-01

    In this paper we study the classic problem of computing a maximum cardinality matching in general graphs $G = (V, E)$. The best known algorithm for this problem till date runs in $O(m \\sqrt{n})$ time due to Micali and Vazirani \\cite{MV80}. Even for general bipartite graphs this is the best known running time (the algorithm of Karp and Hopcroft \\cite{HK73} also achieves this bound). For regular bipartite graphs one can achieve an $O(m)$ time algorithm which, following a series of papers, has been recently improved to $O(n \\log n)$ by Goel, Kapralov and Khanna (STOC 2010) \\cite{GKK10}. In this paper we present a randomized algorithm based on the Markov Chain Monte Carlo paradigm which runs in $O(m \\log^2 n)$ time, thereby obtaining a significant improvement over \\cite{MV80}. We use a Markov chain similar to the \\emph{hard-core model} for Glauber Dynamics with \\emph{fugacity} parameter $\\lambda$, which is used to sample independent sets in a graph from the Gibbs Distribution \\cite{V99}, to design a faster algori...

  20. Holography and Conformal Anomaly Matching

    CERN Document Server

    Cabo-Bizet, Alejandro; Narain, K S

    2013-01-01

    We discuss various issues related to the understanding of the conformal anomaly matching in CFT from the dual holographic viewpoint. First, we act with a PBH diffeomorphism on a generic 5D RG flow geometry and show that the corresponding on-shell bulk action reproduces the Wess-Zumino term for the dilaton of broken conformal symmetry, with the expected coefficient aUV-aIR. Then we consider a specific 3D example of RG flow whose UV asymptotics is normalizable and admits a 6D lifting. We promote a modulus \\rho appearing in the geometry to a function of boundary coordinates. In a 6D description {\\rho} is the scale of an SU(2) instanton. We determine the smooth deformed background up to second order in the space-time derivatives of \\rho and find that the 3D on-shell action reproduces a boundary kinetic term for the massless field \\tau= log(\\rho) with the correct coefficient \\delta c=cUV-cIR. We further analyze the linearized fluctuations around the deformed background geometry and compute the one-point functions ...

  1. Voice Matching Using Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Abhishek Bal

    2014-03-01

    Full Text Available In this paper, the use of Genetic Algorithm (GA for voice recognition is described. The practical application of Genetic Algorithm (GA to the solution of engineering problem is a rapidly emerging approach in the field of control engineering and signal processing. Genetic algorithms are useful for searching a space in multi-directional way from large spaces and poorly defined space. Voice is a signal of infinite information. Digital processing of voice signal is very important for automatic voice recognition technology. Nowadays, voice processing is very much important in security mechanism due to mimicry characteristic. So studying the voice feature extraction in voice processing is very necessary in military, hospital, telephone system, investigation bureau and etc. In order to extract valuable information from the voice signal, make decisions on the process, and obtain results, the data needs to be manipulated and analyzed. In this paper, if the instant voice is not matched with same person’s reference voices in the database, then Genetic Algorithm (GA is applied between two randomly chosen reference voices. Again the instant voice is compared with the result of Genetic Algorithm (GA which is used, including its three main steps: selection, crossover and mutation. We illustrate our approach with different sample of voices from human in our institution.

  2. Impedance matching at arterial bifurcations.

    Science.gov (United States)

    Brown, N

    1993-01-01

    Reflections of pulse waves will occur in arterial bifurcations unless the impedance is matched continuously through changing geometric and elastic properties. A theoretical model is presented which minimizes pulse wave reflection through bifurcations. The model accounts for the observed linear changes in area within the bifurcation, generalizes the theory to asymmetrical bifurcations, characterizes changes in elastic properties from parent to daughter arteries, and assesses the effect of branch angle on the mechanical properties of daughter vessels. In contradistinction to previous models, reflections cannot be minimized without changes in elastic properties through bifurcations. The theoretical model predicts that in bifurcations with area ratios (beta) less than 1.0 Young's moduli of daughter vessels may be less than that in the parent vessel if the Womersley parameter alpha in the parent vessel is less than 5. Larger area ratios in bifurcations are accompanied by greater increases in Young's moduli of branches. For an idealized symmetric aortic bifurcation (alpha = 10) with branching angles theta = 30 degrees (opening angle 60 degrees) Young's modulus of common iliac arteries relative to that of the distal abdominal aorta has an increase of 1.05, 1.68 and 2.25 for area ratio of 0.8, 1.0 and 1.15, respectively. These predictions are consistent with the observed increases in Young's moduli of peripheral vessels.(ABSTRACT TRUNCATED AT 250 WORDS)

  3. Explicit pattern matching assignment algorithm

    Science.gov (United States)

    Levedahl, Mark

    2002-08-01

    Sharing data between two tracking systems frequently involves use of an object map: the transmitting system sends a frame of data with multiple observations, and the receiving system uses an assignment algorithm to correlate the information with its local observation data base. The usual prescription for this problem is an optimal assignment algorithm (such as JVC or auction) using a cost matrix based upon chi-squared distances between the local and remote observation data. The optimal assignment algorithm does not actually perform pattern matching, so this approach is not robust to large registration errors between the two systems when there exist differences in the number of observations held by both systems. Performance of a new assignment algorithm that uses a cost function including terms for both registration errors and track to track random errors is presented: the cost function explicitly includes a bias between the two observation sets and thus provides a maximum likelihood solution to the assignment problem. In practice, this assignment approach provides near perfect assignment accuracy in cases where the bias errors exceed the dimension of the transmitted object map and there exist mismatches in the numbers of observations made by the two systems. This performance extends to many cases where the optimal assignment algorithm methodology produces errors nearly 100% of the time. The paper includes the theoretical foundation of the assignment problem solved and comparison of achieved accuracy with existing optimal assignment approaches.

  4. Best Practices for NPT Transit Matching

    Energy Technology Data Exchange (ETDEWEB)

    Gilligan, Kimberly V. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Whitaker, J. Michael [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Oakberg, John A. [Tetra Tech, Inc., Oak Ridge, TN (United States); Snow, Catherine [Sno Consulting, LLC, Sandy, UT (United States)

    2016-09-01

    Transit matching is the process for relating or matching reports of shipments and receipts submitted to the International Atomic Energy Agency (IAEA). Transit matching is a component used by the IAEA in drawing safeguards conclusions and performing investigative analysis. Transit matching is part of IAEA safeguards activities and the State evaluation process, and it is included in the annual Safeguards Implementation Report (SIR). Annually, the IAEA currently receives reports of ~900,000 nuclear material transactions, of which ~500,000 are for domestic and foreign transfers. Of these the IAEA software can automatically match (i.e., machine match) about 95% of the domestic transfers and 25% of the foreign transfers. Given the increasing demands upon IAEA resources, it is highly desirable for the machine-matching process to match as many transfers as possible. Researchers at Oak Ridge National Laboratory (ORNL) have conducted an investigation funded by the National Nuclear Security Administration through the Next Generation Safeguards Initiative to identify opportunities to strengthen IAEA transit matching. Successful matching, and more specifically machine matching, is contingent on quality data from the reporting States. In February 2016, ORNL hosted representatives from three States, the IAEA, and Euratom to share results from past studies and to discuss the processes, policies, and procedures associated with State reporting for transit matching. Drawing on each entity s experience and knowledge, ORNL developed a best practices document to be shared with the international safeguards community to strengthen transit matching. This paper shares the recommendations that resulted from this strategic meeting and the next steps being taken to strengthen transit matching.

  5. Best Practices for NPT Transit Matching

    Energy Technology Data Exchange (ETDEWEB)

    Gilligan, Kimberly V. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Whitaker, J. Michael [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Oakberg, John A. [Tetra Tech, Inc., Oak Ridge, TN (United States); Snow, Catherine [Sno Consulting, LLC, Sandy, UT (United States)

    2016-09-01

    Transit matching is the process for relating or matching reports of shipments and receipts submitted to the International Atomic Energy Agency (IAEA). Transit matching is a component used by the IAEA in drawing safeguards conclusions and performing investigative analysis. Transit matching is part of IAEA safeguards activities and the State evaluation process, and it is included in the annual Safeguards Implementation Report (SIR). Annually, the IAEA currently receives reports of ~900,000 nuclear material transactions, of which ~500,000 are for domestic and foreign transfers. Of these the IAEA software can automatically match (i.e., machine match) about 95% of the domestic transfers and 25% of the foreign transfers. Given the increasing demands upon IAEA resources, it is highly desirable for the machine-matching process to match as many transfers as possible. Researchers at Oak Ridge National Laboratory (ORNL) have conducted an investigation funded by the National Nuclear Security Administration through the Next Generation Safeguards Initiative to identify opportunities to strengthen IAEA transit matching. Successful matching, and more specifically machine matching, is contingent on quality data from the reporting States. In February 2016, ORNL hosted representatives from three States, the IAEA, and Euratom to share results from past studies and to discuss the processes, policies, and procedures associated with State reporting for transit matching. Drawing on each entity's experience and knowledge, ORNL developed a best practices document to be shared with the international safeguards community to strengthen transit matching. This paper shares the recommendations that resulted from this strategic meeting and the next steps being taken to strengthen transit matching.

  6. Economic difficulties and subsequent disability retirement.

    Science.gov (United States)

    Lallukka, Tea; Mauramo, Elina; Lahelma, Eero; Rahkonen, Ossi

    2015-03-01

    This study examined whether economic difficulties are associated with subsequent disability retirement while controlling for covariates. Survey data among middle-aged employees of the City of Helsinki in 2000-2002 were linked with the Finnish Centre for Pensions register data on all-cause disability retirement among women (n=4816) and men (n=1354) until the end of 2010. Additionally, disability retirement due to musculoskeletal diseases and mental disorders (ICD-10) was examined among women. Frequency in difficulties paying pills and buying food and clothes, and covariates (occupational class, income, housing tenure, and work- and health-related covariates) were self-reported at baseline. Hazard ratios (HR) and their 95% confidence intervals (95% CI) were calculated from Cox regression analysis. Frequent economic difficulties were associated with all-cause disability retirement after adjusting for age among both women (HR=2.11; 95% CI 1.63-2.73) and men (HR=2.69; 95% CI 1.65-4.41). Adjustment for covariates somewhat attenuated the associations, but they remained. Economic difficulties were also associated with disability retirement due to both mental disorders (HR=3.29; 95% CI 1.98-5.46) and musculoskeletal diseases (HR=1.85; 95% CI 1.24-2.75) among women. Adjustments made a minor contribution to the risk of disability retirement due to mental disorders, whereas the risk of disability retirement due to musculoskeletal diseases reduced after considering socioeconomic circumstances. Conclusions: economic difficulties are independently associated with disability retirement. Thus, they should be considered in attempts to tackle early exit from the labour market due to disability. © 2015 the Nordic Societies of Public Health.

  7. Stability of the bipartite matching model

    CERN Document Server

    Bušić, Ana; Mairesse, Jean

    2010-01-01

    We consider the bipartite matching model of customers and servers introduced by Caldentey, Kaplan, and Weiss (Adv. Appl. Probab., 2009). Customers and servers play symmetrical roles. There is a finite set C resp. S, of customer, resp. server, classes. Time is discrete and at each time step, one customer and one server arrive in the system according to a joint probability measure on CxS, independently of the past. Also, at each time step, pairs of matched customer and server, if they exist, depart from the system. Authorized matchings are given by a fixed bipartite graph. A matching policy is chosen, which decides how to match when there are several possibilities. Customers/servers that cannot be matched are stored in a buffer. The evolution of the model can be described by a discrete time Markov chain. We study its stability under various admissible matching policies including: ML (Match the Longest), MS (Match the Shortest), FIFO (match the oldest), priorities. There exist natural necessary conditions for st...

  8. Song type matching, song type switching and eavesdropping in male great tits

    DEFF Research Database (Denmark)

    Peake, Thomas More; Matessi, Giuliano; McGregor, Peter Kenneth

    2005-01-01

    by changing the timing of songs. We examined the phenomenon of song type matching by presenting male great tits, Parus major, with simulated interactions in which one interactant switched song type such that it matched (or not) that sung by the opponent. Subjects responded to simulated intrusion by previously...... switched song types but not matched. Male great tits are therefore capable of extracting different kinds of information by eavesdropping on interactions between others and using that information when deciding how to respond to subsequent intrusion. These results confirm and expand our knowledge...

  9. Effects of carbohydrate, branched-chain amino acids, and arginine in recovery period on the subsequent performance in wrestlers

    Directory of Open Access Journals (Sweden)

    Jang Tsong-Rong

    2011-11-01

    Full Text Available Abstract Many athletes need to participate in multiple events in a single day. The efficient post-exercise glycogen recovery may be critical for the performance in subsequent exercise. This study examined whether post-exercise carbohydrate supplementation could restore the performance in the subsequent simulated wrestling match. The effect of branched-chain amino acids and arginine on glucose disposal and performance was also investigated. Nine well-trained male wrestlers participated in 3 trials in a random order. Each trial contained 3 matches with a 1-hr rest between match 1 and 2, and a 2-hr rest between match 2 and 3. Each match contained 3 exercise periods interspersed with 1-min rests. The subjects alternated 10-s all-out sprints and 20-s rests in each exercise period. At the end of match 2, 3 different supplementations were consumed: 1.2 g/kg glucose (CHO trial, 1 g/kg glucose + 0.1 g/kg Arg + 0.1 g/kg BCAA (CHO+AA trial, or water (placebo trial. The peak and average power in the 3 matches was similar in the 3 trials. After the supplementation, CHO and CHO+AA trial showed significantly higher glucose and insulin, and lower glycerol and non-esterified fatty acid concentrations than the placebo trial. There was no significant difference in these biochemical parameters between the CHO and CHO+AA trials. Supplementation of carbohydrate with or without BCAA and arginine during the post-match period had no effect on the performance in the following simulated match in wrestlers. In addition, BCAA and arginine did not provide additional insulinemic effect.

  10. Fractional Order Element Based Impedance Matching

    KAUST Repository

    Radwan, Ahmed Gomaa

    2014-06-24

    Disclosed are various embodiments of methods and systems related to fractional order element based impedance matching. In one embodiment, a method includes aligning a traditional Smith chart (|.alpha.|=1) with a fractional order Smith chart (|.alpha.|.noteq.1). A load impedance is located on the traditional Smith chart and projected onto the fractional order Smith chart. A fractional order matching element is determined by transitioning along a matching circle of the fractional order Smith chart based at least in part upon characteristic line impedance. In another embodiment, a system includes a fractional order impedance matching application executed in a computing device. The fractional order impedance matching application includes logic that obtains a first set of Smith chart coordinates at a first order, determines a second set of Smith chart coordinates at a second order, and determines a fractional order matching element from the second set of Smith chart coordinates.

  11. The match between horse and rider

    OpenAIRE

    Axel-Nilsson, Malin

    2015-01-01

    A successful relationship between horse and rider is a partnership based on compatibility and is often referred to as a good match. In the present thesis, ‘match’ includes the good interaction, interplay and cooperation between horse and rider as well as the related positive experience. A good horse-rider match is important for horse welfare, rider safety and good performance. The aim of this thesis was to investigate which parameters riders consider important for a good match, if horse tempe...

  12. Lazy AC-Pattern Matching for Rewriting

    OpenAIRE

    Walid Belkhir; Alain Giorgetti

    2012-01-01

    We define a lazy pattern-matching mechanism modulo associativity and commutativity. The solutions of a pattern-matching problem are stored in a lazy list composed of a first substitution at the head and a non-evaluated object that encodes the remaining computations. We integrate the lazy AC-matching in a strategy language: rewriting rule and strategy application produce a lazy list of terms.

  13. Improving the Nephrology Match: the Path Forward.

    Science.gov (United States)

    Hsu, Chi-yuan; Parker, Mark G; Ross, Michael J; Schmidt, Rebecca J; Harris, Raymond C

    2015-11-01

    The Fellowship Match process was designed to provide applicants and program directors with an opportunity to consider all their options before making decisions about post-residency training. In a Match, applicants can choose the programs that best suit their career goals, and program directors can consider all candidates before preparing a rank order list. The Match is a contract, requiring obligations of both programs and applicants to achieve success, ensure uniformity, and standardize participation.

  14. Lazy AC-Pattern Matching for Rewriting

    Directory of Open Access Journals (Sweden)

    Walid Belkhir

    2012-04-01

    Full Text Available We define a lazy pattern-matching mechanism modulo associativity and commutativity. The solutions of a pattern-matching problem are stored in a lazy list composed of a first substitution at the head and a non-evaluated object that encodes the remaining computations. We integrate the lazy AC-matching in a strategy language: rewriting rule and strategy application produce a lazy list of terms.

  15. Parikh Matching in the Streaming Model

    DEFF Research Database (Denmark)

    Lee, Lap-Kei; Lewenstein, Moshe; Zhang, Qin

    2012-01-01

    |-length count vector. In the streaming model one seeks space-efficient algorithms for problems in which there is one pass over the data. We consider Parikh matching in the streaming model. To make this viable we search for substrings whose Parikh-mappings approximately match the input vector. In this paper we...... present upper and lower bounds on the problem of approximate Parikh matching in the streaming model....

  16. Matching Two-dimensional Gel Electrophoresis' Spots

    DEFF Research Database (Denmark)

    Dos Anjos, António; AL-Tam, Faroq; Shahbazkia, Hamid Reza

    2012-01-01

    This paper describes an approach for matching Two-Dimensional Electrophoresis (2-DE) gels' spots, involving the use of image registration. The number of false positive matches produced by the proposed approach is small, when compared to academic and commercial state-of-the-art approaches. This ar......This paper describes an approach for matching Two-Dimensional Electrophoresis (2-DE) gels' spots, involving the use of image registration. The number of false positive matches produced by the proposed approach is small, when compared to academic and commercial state-of-the-art approaches...

  17. Accounting for Endogeneity in Matching Function Estimation

    DEFF Research Database (Denmark)

    Borowczyk-Martins, Daniel; Jolivet, Grégory; Postel-Vinay, Fabien

    2017-01-01

    We show that equilibrium matching models imply that standard estimates of the matching function elasticities are exposed to an endogeneity bias, which arises from the search behavior of agents on either side of the market. We offer an estimation method which, under certain structural assumptions...... about the process driving shocks to matching efficiency, is immune from that bias. Application of our method to the estimation of a basic version of the matching function using aggregate U.S. data from the Job Openings and Labor Turnover Survey (JOLTS) suggests that the bias can be quantitatively...

  18. PUMA: The Positional Update and Matching Algorithm

    Science.gov (United States)

    Line, J. L. B.; Webster, R. L.; Pindor, B.; Mitchell, D. A.; Trott, C. M.

    2017-01-01

    We present new software to cross-match low-frequency radio catalogues: the Positional Update and Matching Algorithm. The Positional Update and Matching Algorithm combines a positional Bayesian probabilistic approach with spectral matching criteria, allowing for confusing sources in the matching process. We go on to create a radio sky model using Positional Update and Matching Algorithm based on the Murchison Widefield Array Commissioning Survey, and are able to automatically cross-match 98.5% of sources. Using the characteristics of this sky model, we create simple simulated mock catalogues on which to test the Positional Update and Matching Algorithm, and find that Positional Update and Matching Algorithm can reliably find the correct spectral indices of sources, along with being able to recover ionospheric offsets. Finally, we use this sky model to calibrate and remove foreground sources from simulated interferometric data, generated using OSKAR (the Oxford University visibility generator). We demonstrate that there is a substantial improvement in foreground source removal when using higher frequency and higher resolution source positions, even when correcting positions by an average of 0.3 arcmin given a synthesised beam-width of 2.3 arcmin.

  19. Highly Scalable Matching Pursuit Signal Decomposition Algorithm

    Data.gov (United States)

    National Aeronautics and Space Administration — In this research, we propose a variant of the classical Matching Pursuit Decomposition (MPD) algorithm with significantly improved scalability and computational...

  20. 78 FR 73195 - Privacy Act of 1974: CMS Computer Matching Program Match No. 2013-01; HHS Computer Matching...

    Science.gov (United States)

    2013-12-05

    ... HUMAN SERVICES Centers for Medicare & Medicaid Services Privacy Act of 1974: CMS Computer Matching... & Medicaid Services (CMS), Department of Health and Human Services (HHS). ACTION: Notice of Computer Matching... amended, this notice announces the renewal of a CMP that CMS plans to conduct with the Purchased Care...

  1. The concept of the marginally matched subject in propensity-score matched analyses.

    Science.gov (United States)

    Austin, Peter C; Lee, Douglas S

    2009-06-01

    Propensity-score matching is increasingly being used to reduce the impact of treatment-selection bias when estimating causal treatment effects using observational data. Matching on the propensity score creates sets of treated and untreated subjects who have a similar distribution of baseline covariates. Propensity-score matching frequently relies upon calipers, such that matched treated and untreated subjects must have propensity scores that lie within a specified caliper distance of each other. We define the 'marginally matched' subject as a subject who would be matched using the specified caliper width, but who would not have been matched had calipers with a narrower width been employed. Using patients hospitalized with an acute myocardial infarction (or heart attack) and with exposure to a statin prescription at discharge, we demonstrate that the inclusion of marginally matched subjects can have both a quantitative and qualitative impact upon the estimated treatment effect. Furthermore, marginally matched treated subjects can differ from marginally matched untreated subjects to a substantially greater degree than the differences between non-marginally matched treated and untreated subjects in the propensity-score matched sample. The concept of the marginally matched subject can be used as a sensitivity analysis to examine the impact of the matching method on the estimates of treatment effectiveness.

  2. SEMI-GLOBAL MATCHING IN OBJECT SPACE

    Directory of Open Access Journals (Sweden)

    F. Bethmann

    2015-03-01

    Full Text Available Semi-Global Matching (SGM is a widespread algorithm for image matching which is used for very different applications, ranging from real-time applications (e.g. for generating 3D data for driver assistance systems to aerial image matching. Originally developed for stereo-image matching, several extensions have been proposed to use more than two images within the matching process (multi-baseline matching, multi-view stereo. These extensions still perform the image matching in (rectified stereo images and combine the pairwise results afterwards to create the final solution. This paper proposes an alternative approach which is suitable for the introduction of an arbitrary number of images into the matching process and utilizes image matching by using non-rectified images. The new method differs from the original SGM method mainly in two aspects: Firstly, the cost calculation is formulated in object space within a dense voxel raster by using the grey (or colour values of all images instead of pairwise cost calculation in image space. Secondly, the semi-global (path-wise minimization process is transferred into object space as well, so that the result of semi-global optimization leads to index maps (instead of disparity maps which directly indicate the 3D positions of the best matches. Altogether, this yields to an essential simplification of the matching process compared to multi-view stereo (MVS approaches. After a description of the new method, results achieved from two different datasets (close-range and aerial are presented and discussed.

  3. Infant Formula Feeding at Birth Is Common and Inversely Associated with Subsequent Breastfeeding Behavior in Vietnam.

    Science.gov (United States)

    Nguyen, Tuan T; Withers, Mellissa; Hajeebhoy, Nemat; Frongillo, Edward A

    2016-10-01

    The association between infant formula feeding at birth and subsequent feeding patterns in a low- or middle-income context is not clear. We examined the association of infant formula feeding during the first 3 d after birth with subsequent infant formula feeding and early breastfeeding cessation in Vietnam. In a cross-sectional survey, we interviewed 10,681 mothers with children aged 0-23 mo (mean age: 8.2 mo; 52% boys) about their feeding practices during the first 3 d after birth and on the previous day. We used stratified analysis, multiple logistic regression, propensity score-matching analysis, and structural equation modeling to minimize the limitation of the cross-sectional design and to ensure the consistency of the findings. Infant formula feeding during the first 3 d after birth (50%) was associated with a higher prevalence of subsequent infant formula feeding [stratified analysis: 7-28% higher (nonoverlapping 95% CIs for most comparisons); propensity score-matching analysis: 13% higher (P practice was also associated with a higher prevalence of early breastfeeding cessation (e.g., breastfeeding cessation (β: 0.285; P breastfeeding, which underscores the need to make early, exclusive breastfeeding normative and to create environments that support it.

  4. FLOWS AROUND TWO AIRFOILS PERFORMING FLING AND SUBSEQUENT TRANSLATION AND TRANSLATION AND SUBSEQUENT CLAP

    Institute of Scientific and Technical Information of China (English)

    孙茂; 于鑫

    2003-01-01

    The aerodynamic forces and flow structures of two airfoils performing "fling and subsequent translation" and "translation and subsequent clap" are studied by numerically solving the Navier-Stokes equations in moving overset grids. These motions are relevant to the flight of very small insects. The Reynolds number, based on the airfoil chord length c and the translation velocity U, is 17. It is shown that: (1) For two airfoils performing fling and subsequent translation, a large lift is generated both in the fling phase and in the early part of the translation phase. During the fling phase,a pair of leading edge vortices of large strength is generated; the generation of the vortex pair in a short period results in a large time rate of change of fluid impulse, which explains the large lift in this period. During the early part of the translation, the two leading edge vortices move with the airfoils;the relative movement of the vortices also results in a large time rate of change of fluid impulse, which explains the large lift in this part of motion. (In the later part of the translation, the vorticity in the vortices is diffused and convected into the wake.) The time averaged lift coeffcient is approximately 2.4 times as large as that of a single airfoil performing a similar motion. (2) For two airfoils performing translation and subsequent clap, a large lift is generated in the clap phase. During the clap, a pair of trailing edge vortices of large strength are generated; again, the generation of the vortex pair in a short period (which results in a large timerate of change of fluid impulse) is responsible for the large lift in this period. The time averaged lift coefficient is approximately 1.6 times as large as that of a single airfoil performing a similar motion. (3) When the initial distance between the airfoils (in the case of clap, the final distance between the airfoils) varies from 0.1 to 0.2c, the lift on an airfoil decreases only slightly but the torque

  5. Object-based connectedness facilitates matching

    NARCIS (Netherlands)

    Koning, A.R.; Lier, R.J. van

    2003-01-01

    In two matching tasks, participants had to match two images of object pairs. Image-based (113) connectedness refers to connectedness between the objects in an image. Object-based (OB) connectedness refers to connectedness between the interpreted objects. In Experiment 1, a monocular depth cue

  6. 13 CFR 108.2030 - Matching requirements.

    Science.gov (United States)

    2010-01-01

    ... 13 Business Credit and Assistance 1 2010-01-01 2010-01-01 false Matching requirements. 108.2030 Section 108.2030 Business Credit and Assistance SMALL BUSINESS ADMINISTRATION NEW MARKETS VENTURE CAPITAL... SSBICs § 108.2030 Matching requirements. (a) General. All Operational Assistance grant funds SBA awards...

  7. String matching with variable length gaps

    DEFF Research Database (Denmark)

    Bille, Philip; Gørtz, Inge Li; Vildhøj, Hjalte Wedel

    2012-01-01

    We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a specified range), the problem is to find all ending positions of substrings in T that match P. This problem is a basic...

  8. Partial fingerprint matching based on SIFT Features

    Directory of Open Access Journals (Sweden)

    Ms. S.Malathi,

    2010-07-01

    Full Text Available Fingerprints are being extensively used for person identification in a number of commercial, civil, and forensic applications. The current Fingerprint matching technology is quite mature for matching full prints, matching partial fingerprints still needs lots of improvement. Most of the current fingerprint identification systems utilize features that are based on minutiae points and ridge patterns. The major challenges faced in partial fingerprint matching are the absence of sufficient minutiae features and other structures such as core and delta. However, this technology suffers from the problem of handling incomplete prints and often discards any partial fingerprints obtained. Recent research has begun to delve into the problems of latent or partial fingerprints. In this paper we present a novel approach for partial fingerprint matching scheme based on SIFT(Scale Invariant Feature Transform features and matching is achieved using a modified point matching process. Using Neurotechnology database, we demonstrate that the proposed method exhibits an improved performance when matching full print against partial print.

  9. Second Order Mode Selective Phase-Matching

    DEFF Research Database (Denmark)

    Lassen, Mikael Østergaard; Delaubert, Vincent; Bachor, Hans. A-

    2006-01-01

    We exploit second order (χ(2)) nonlinear optical phase matching for the selection of individual high order transverse modes. The ratio between the generated components can be adjusted continuously via changes in the phase-matching condition. ©2007 Optical Society of America...

  10. 28 CFR 33.21 - Match.

    Science.gov (United States)

    2010-07-01

    ... 28 Judicial Administration 1 2010-07-01 2010-07-01 false Match. 33.21 Section 33.21 Judicial Administration DEPARTMENT OF JUSTICE BUREAU OF JUSTICE ASSISTANCE GRANT PROGRAMS Criminal Justice Block Grants Allocation of Funds § 33.21 Match. (a) Funds may be used to pay up to 50 percent of the cost of a program...

  11. Dynamic Matchings in Convex Bipartite Graphs

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Georgiadis, Loukas; Hansen, Kristoffer Arnsfelt

    2007-01-01

    We consider the problem of maintaining a maximum matching in a convex bipartite graph G = (V,E) under a set of update operations which includes insertions and deletions of vertices and edges. It is not hard to show that it is impossible to maintain an explicit representation of a maximum matching...

  12. Monkeys Match and Tally Quantities across Senses

    Science.gov (United States)

    Jordan, Kerry E.; MacLean, Evan L.; Brannon, Elizabeth M.

    2008-01-01

    We report here that monkeys can actively match the number of sounds they hear to the number of shapes they see and present the first evidence that monkeys sum over sounds and sights. In Experiment 1, two monkeys were trained to choose a simultaneous array of 1-9 squares that numerically matched a sample sequence of shapes or sounds. Monkeys…

  13. Why do Worker-Firm Matches Dissolve?

    NARCIS (Netherlands)

    Gielen, A. C.; van Ours, J.C.

    2006-01-01

    In a dynamic labor market worker-firm matches dissolve frequently causing workers to separate and firms to look for replacements.A separation may be initiated by the worker (a quit) or the firm (a layoff), or may result from a joint decision.A dissolution of a worker-firm match may be ineffcient if

  14. Pattern Matching, Searching, and Heuristics in Algebra.

    Science.gov (United States)

    Lopez, Antonio M.

    1996-01-01

    Presents a methodology designed to strengthen the cognitive effects of using graphing calculators to solve polynomial equations using pattern matching, searching, and heuristics. Discusses pattern matching as a problem-solving strategy useful in the physical, social, political, and economic worlds of today's students. (DDR)

  15. Active impedance matching of complex structural systems

    Science.gov (United States)

    Macmartin, Douglas G.; Miller, David W.; Hall, Steven R.

    1991-01-01

    Viewgraphs on active impedance matching of complex structural systems are presented. Topics covered include: traveling wave model; dereverberated mobility model; computation of dereverberated mobility; control problem: optimal impedance matching; H2 optimal solution; statistical energy analysis (SEA) solution; experimental transfer functions; interferometer actuator and sensor locations; active strut configurations; power dual variables; dereverberation of complex structure; dereverberated transfer function; compensators; and relative power flow.

  16. Equilibrium and matching under price controls

    NARCIS (Netherlands)

    Herings, P.J.J.

    2015-01-01

    The paper considers a one-to-one matching with contracts model in the presence of price controls. This set-up contains two important streams in the matching literature, those with and those without monetary transfers, as special cases and allows for intermediate cases with some restrictions on the m

  17. The effects of matching instructional strategy with selected student characteristics on ninth grade physical science students' attitudes and achievement

    Science.gov (United States)

    Trout, John S.; Crawley, Frank E.

    The study investigated the benefits of a matching model of instruction for students enrolled in ninth grade physical science classes in one high school in a small, urban school district. Based on social learning theory, three independent variables were identified for purposes of matching: need level, cognitive style, and locus of control; attitude and achievement outcomes served as the dependent variables. Results of separate analyses of covariance revealed that attitude toward science in general improved with matching, but achievement, attitude toward physical science, attitude toward instruction, and attitude toward the teacher did not improve. Recommendations for subsequent matching experiments are discussed in light of the findings in this investigation.

  18. The relative age effect has no influence on match outcome in youth soccer

    Directory of Open Access Journals (Sweden)

    Donald T. Kirkendall

    2014-12-01

    Conclusion: Selecting players based on physical maturity (and subsequently, on age does not appear to have any systematic influence on match outcome or season record in youth soccer suggesting that the selection process should be focused on player ability and not on physical maturation.

  19. Fast approximate quadratic programming for graph matching.

    Directory of Open Access Journals (Sweden)

    Joshua T Vogelstein

    Full Text Available Quadratic assignment problems arise in a wide variety of domains, spanning operations research, graph theory, computer vision, and neuroscience, to name a few. The graph matching problem is a special case of the quadratic assignment problem, and graph matching is increasingly important as graph-valued data is becoming more prominent. With the aim of efficiently and accurately matching the large graphs common in big data, we present our graph matching algorithm, the Fast Approximate Quadratic assignment algorithm. We empirically demonstrate that our algorithm is faster and achieves a lower objective value on over 80% of the QAPLIB benchmark library, compared with the previous state-of-the-art. Applying our algorithm to our motivating example, matching C. elegans connectomes (brain-graphs, we find that it efficiently achieves performance.

  20. Fast approximate quadratic programming for graph matching.

    Science.gov (United States)

    Vogelstein, Joshua T; Conroy, John M; Lyzinski, Vince; Podrazik, Louis J; Kratzer, Steven G; Harley, Eric T; Fishkind, Donniell E; Vogelstein, R Jacob; Priebe, Carey E

    2015-01-01

    Quadratic assignment problems arise in a wide variety of domains, spanning operations research, graph theory, computer vision, and neuroscience, to name a few. The graph matching problem is a special case of the quadratic assignment problem, and graph matching is increasingly important as graph-valued data is becoming more prominent. With the aim of efficiently and accurately matching the large graphs common in big data, we present our graph matching algorithm, the Fast Approximate Quadratic assignment algorithm. We empirically demonstrate that our algorithm is faster and achieves a lower objective value on over 80% of the QAPLIB benchmark library, compared with the previous state-of-the-art. Applying our algorithm to our motivating example, matching C. elegans connectomes (brain-graphs), we find that it efficiently achieves performance.

  1. Minutiae matching using local pattern features

    Science.gov (United States)

    Jędryka, Marcin; Wawrzyniak, Zbigniew

    2008-01-01

    This paper concerns algorithms related to analysis of fingerprint images in area of minutiae matching. Proposed solutions make use of information about minutiae detected from a fingerprint as well as information about main first order singularities. The use of first order singularities as a reference point makes algorithm of minutiae matching more efficient and faster in execution. Proposed algorithms concern efficient detection of main singularity in a fingerprint as well as optimization of minutiae matching in polar coordinates using main singularity as a reference point. Minutiae matching algorithm is based on string matching using Levenstein distance. Detection of first order singularities is optimized using Poincare's index and analysis of directional image of a fingerprint. Proposed solutions showed to be efficient and fast in practical use. Implemented algorithms were tested on previously prepared fingerprint datasets.

  2. PUMA: The Positional Update and Matching Algorithm

    CERN Document Server

    Line, J L B; Pindor, B; Mitchell, D A; Trott, C M

    2016-01-01

    We present new software to cross-match low-frequency radio catalogues: the Positional Update and Matching Algorithm (PUMA). PUMA combines a positional Bayesian probabilistic approach with spectral matching criteria, allowing for confusing sources in the matching process. We go on to create a radio sky model using PUMA based on the Murchison Widefield Array Commissioning Survey, and are able to automatically cross-match 98.5% of sources. Using the characteristics of this sky model, we create simple simulated mock catalogues on which to test PUMA, and find that PUMA can reliably find the correct spectral indices of sources, along with being able to recover ionospheric offsets. Finally, we use this sky model to calibrate and remove foreground sources from simulated interferometric data, generated using OSKAR (the Oxford University visibility generator). We demonstrate that there is a substantial improvement in foreground source removal when using higher frequency and higher resolution source positions, even when...

  3. Matching Parasitic Antenna for Single RF MIMO

    DEFF Research Database (Denmark)

    Han, Bo; Kalis, A; Nielsen, Rasmus Hjorth

    2012-01-01

    Single RF MIMO communication emerges a novel low cost communication method which does not consume as much power as the conventional MIMO. The implementation of such single RF MIMO system is done by mapping the weighting factors to the polarizations or the radiation patterns of the antennas....... In order to have such performance, an antenna with rich pattern modes is required by the system, thus the ESPAR antenna is investigated. The critical part on such antenna is parasitic element impedance matching. Unlike the conventional smith-chart matching method which assumes the minimal resistance...... is zero and with goal of 50 ohm or 75 ohm matching, matching on such parasitic antenna will adopt negative value as well. This paper presents a matching network with controllable impedance even to the range of negative values....

  4. 29 CFR 1919.30 - Examinations subsequent to unit tests.

    Science.gov (United States)

    2010-07-01

    ... Treatment; Competent Persons § 1919.30 Examinations subsequent to unit tests. (a) After satisfactory... deformation or failure. (c) For subsequent tests such parts of the gear shall be dismantled or...

  5. Fuzzy zoning for feature matching technique in 3D reconstruction of nasal endoscopic images.

    Science.gov (United States)

    Rattanalappaiboon, Surapong; Bhongmakapat, Thongchai; Ritthipravat, Panrasee

    2015-12-01

    3D reconstruction from nasal endoscopic images greatly supports an otolaryngologist in examining nasal passages, mucosa, polyps, sinuses, and nasopharyx. In general, structure from motion is a popular technique. It consists of four main steps; (1) camera calibration, (2) feature extraction, (3) feature matching, and (4) 3D reconstruction. Scale Invariant Feature Transform (SIFT) algorithm is normally used for both feature extraction and feature matching. However, SIFT algorithm relatively consumes computational time particularly in the feature matching process because each feature in an image of interest is compared with all features in the subsequent image in order to find the best matched pair. A fuzzy zoning approach is developed for confining feature matching area. Matching between two corresponding features from different images can be efficiently performed. With this approach, it can greatly reduce the matching time. The proposed technique is tested with endoscopic images created from phantoms and compared with the original SIFT technique in terms of the matching time and average errors of the reconstructed models. Finally, original SIFT and the proposed fuzzy-based technique are applied to 3D model reconstruction of real nasal cavity based on images taken from a rigid nasal endoscope. The results showed that the fuzzy-based approach was significantly faster than traditional SIFT technique and provided similar quality of the 3D models. It could be used for creating a nasal cavity taken by a rigid nasal endoscope.

  6. Brain activation during associative short-term memory maintenance is not predictive for subsequent retrieval.

    Science.gov (United States)

    Bergmann, Heiko C; Daselaar, Sander M; Beul, Sarah F; Rijpkema, Mark; Fernández, Guillén; Kessels, Roy P C

    2015-01-01

    Performance on working memory (WM) tasks may partially be supported by long-term memory (LTM) processing. Hence, brain activation recently being implicated in WM may actually have been driven by (incidental) LTM formation. We examined which brain regions actually support successful WM processing, rather than being confounded by LTM processes, during the maintenance and probe phase of a WM task. We administered a four-pair (faces and houses) associative delayed-match-to-sample (WM) task using event-related functional MRI (fMRI) and a subsequent associative recognition LTM task, using the same stimuli. This enabled us to analyze subsequent memory effects for both the WM and the LTM test by contrasting correctly recognized pairs with incorrect pairs for either task. Critically, with respect to the subsequent WM effect, we computed this analysis exclusively for trials that were forgotten in the subsequent LTM recognition task. Hence, brain activity associated with successful WM processing was less likely to be confounded by incidental LTM formation. The subsequent LTM effect, in contrast, was analyzed exclusively for pairs that previously had been correctly recognized in the WM task, disclosing brain regions involved in successful LTM formation after successful WM processing. Results for the subsequent WM effect showed no significantly activated brain areas for WM maintenance, possibly due to an insensitivity of fMRI to mechanisms underlying active WM maintenance. In contrast, a correct decision at WM probe was linked to activation in the "retrieval success network" (anterior and posterior midline brain structures). The subsequent LTM analyses revealed greater activation in left dorsolateral prefrontal cortex and posterior parietal cortex in the early phase of the maintenance stage. No supra-threshold activation was found during the WM probe. Together, we obtained clearer insights in which brain regions support successful WM and LTM without the potential confound of

  7. Brain Activation during Associative Short-Term Memory Maintenance is Not Predictive for Subsequent Retrieval

    Directory of Open Access Journals (Sweden)

    Heiko eBergmann

    2015-09-01

    Full Text Available Performance on working memory (WM tasks may partially be supported by long-term memory (LTM processing. Hence, brain activation recently being implicated in WM may actually have been driven by (incidental LTM formation. We examined which brain regions actually support successful WM processing, rather than being confounded by LTM processes, during the maintenance and probe phase of a WM task. We administered a four-pair (faces and houses associative delayed-match-to-sample (WM task using event-related fMRI and a subsequent associative recognition LTM task, using the same stimuli. This enabled us to analyze subsequent memory effects for both the WM and the LTM test by contrasting correctly recognized pairs with incorrect pairs for either task. Critically, with respect to the subsequent WM effect, we computed this analysis exclusively for trials that were forgotten in the subsequent LTM recognition task. Hence, brain activity associated with successful WM processing was less likely to be confounded by incidental LTM formation. The subsequent LTM effect, in contrast, was analyzed exclusively for pairs that previously had been correctly recognized in the WM task, disclosing brain regions involved in successful LTM formation after successful WM processing. Results for the subsequent WM effect showed no significantly activated brain areas for WM maintenance, possibly due to an insensitivity of fMRI to mechanisms underlying active WM maintenance. In contrast, a correct decision at WM probe was linked to activation in the retrieval success network (anterior and posterior midline brain structures. The subsequent LTM analyses revealed greater activation in left dorsolateral prefrontal cortex and posterior parietal cortex in the early phase of the maintenance stage. No supra-threshold activation was found during the WM probe. Together, we obtained clearer insights in which brain regions support successful WM and LTM without the potential confound of the

  8. RETIRED MATCHES AMONG MALE PROFESSIONAL TENNIS PLAYERS

    Directory of Open Access Journals (Sweden)

    Kristijan Breznik

    2012-06-01

    Full Text Available The aim of this study was to explore the effect of characteristics of various games and players on the proportion of retired tennis matches in the Open Era of tennis. The data included over 420,000 matches played among 17,553 tennis players in the period from 1968 to the end of 2010. The influence of the surface type was clearly confirmed, with the proportion of retired matches being higher on hard and clay courts compared to grass and carpet surfaces. Similarly, more retired matches were observed in outdoor venues than in indoor ones. The impact of other variables, tournament types, rounds at which the game was played and both players' ranks, is more ambiguous. Our interpretation of the obtained results is presented in the paper. Network analytic methods were applied to extract players with the most retired matches in their careers. Eventually, we defined a group of top tennis players and gave a more precise insight into retired matches in that group. Correspondence analysis was used to visually display the two-mode network of top players and the proportion of retired matches by surface type

  9. Robust Face Image Matching under Illumination Variations

    Directory of Open Access Journals (Sweden)

    Yang Chyuan-Huei Thomas

    2004-01-01

    Full Text Available Face image matching is an essential step for face recognition and face verification. It is difficult to achieve robust face matching under various image acquisition conditions. In this paper, a novel face image matching algorithm robust against illumination variations is proposed. The proposed image matching algorithm is motivated by the characteristics of high image gradient along the face contours. We define a new consistency measure as the inner product between two normalized gradient vectors at the corresponding locations in two images. The normalized gradient is obtained by dividing the computed gradient vector by the corresponding locally maximal gradient magnitude. Then we compute the average consistency measures for all pairs of the corresponding face contour pixels to be the robust matching measure between two face images. To alleviate the problem due to shadow and intensity saturation, we introduce an intensity weighting function for each individual consistency measure to form a weighted average of the consistency measure. This robust consistency measure is further extended to integrate multiple face images of the same person captured under different illumination conditions, thus making our robust face matching algorithm. Experimental results of applying the proposed face image matching algorithm on some well-known face datasets are given in comparison with some existing face recognition methods. The results show that the proposed algorithm consistently outperforms other methods and achieves higher than 93% recognition rate with three reference images for different datasets under different lighting conditions.

  10. Indexing Volumetric Shapes with Matching and Packing.

    Science.gov (United States)

    Koes, David Ryan; Camacho, Carlos J

    2015-04-01

    We describe a novel algorithm for bulk-loading an index with high-dimensional data and apply it to the problem of volumetric shape matching. Our matching and packing algorithm is a general approach for packing data according to a similarity metric. First an approximate k-nearest neighbor graph is constructed using vantage-point initialization, an improvement to previous work that decreases construction time while improving the quality of approximation. Then graph matching is iteratively performed to pack related items closely together. The end result is a dense index with good performance. We define a new query specification for shape matching that uses minimum and maximum shape constraints to explicitly specify the spatial requirements of the desired shape. This specification provides a natural language for performing volumetric shape matching and is readily supported by the geometry-based similarity search (GSS) tree, an indexing structure that maintains explicit representations of volumetric shape. We describe our implementation of a GSS tree for volumetric shape matching and provide a comprehensive evaluation of parameter sensitivity, performance, and scalability. Compared to previous bulk-loading algorithms, we find that matching and packing can construct a GSS-tree index in the same amount of time that is denser, flatter, and better performing, with an observed average performance improvement of 2X.

  11. Graphical models and point pattern matching.

    Science.gov (United States)

    Caetano, Tibério S; Caelli, Terry; Schuurmans, Dale; Barone, Dante A C

    2006-10-01

    This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We present a noniterative, polynomial time algorithm that is guaranteed to find an optimal solution for the noiseless case. First, we model point pattern matching as a weighted graph matching problem, where weights correspond to Euclidean distances between nodes. We then formulate graph matching as a problem of finding a maximum probability configuration in a graphical model. By using graph rigidity arguments, we prove that a sparse graphical model yields equivalent results to the fully connected model in the noiseless case. This allows us to obtain an algorithm that runs in polynomial time and is provably optimal for exact matching between noiseless point sets. For inexact matching, we can still apply the same algorithm to find approximately optimal solutions. Experimental results obtained by our approach show improvements in accuracy over current methods, particularly when matching patterns of different sizes.

  12. Multithreaded Implementation of Hybrid String Matching Algorithm

    Directory of Open Access Journals (Sweden)

    Akhtar Rasool

    2012-03-01

    Full Text Available Reading and taking reference from many books and articles, and then analyzing the Navies algorithm, Boyer Moore algorithm and Knuth Morris Pratt (KMP algorithm and a variety of improved algorithms, summarizes various advantages and disadvantages of the pattern matching algorithms. And on this basis, a new algorithm – Multithreaded Hybrid algorithm is introduced. The algorithm refers to Boyer Moore algorithm, KMP algorithm and the thinking of improved algorithms. Utilize the last character of the string, the next character and the method to compare from side to side, and then advance a new hybrid pattern matching algorithm. And it adjusted the comparison direction and the order of the comparison to make the maximum moving distance of each time to reduce the pattern matching time. The algorithm reduces the comparison number and greatlyreduces the moving number of the pattern and improves the matching efficiency. Multithreaded implementation of hybrid, pattern matching algorithm performs the parallel string searching on different text data by executing a number of threads simultaneously. This approach is advantageous from all other string-pattern matching algorithm in terms of time complexity. This again improves the overall string matching efficiency.

  13. State of otolaryngology match: has competition increased since the "early" match?

    Science.gov (United States)

    Cabrera-Muffly, Cristina; Sheeder, Jeanelle; Abaza, Mona

    2015-05-01

    To examine fluctuations in supply and demand of otolaryngology residency positions after the shift from an "early match" coordinated by the San Francisco match to a "conventional" matching process through the National Residency Matching Program (NRMP). To determine whether competition among otolaryngology residency positions have changed during this time frame. Database analysis. Matching statistics from 1998 to 2013 were obtained for all first-year residency positions through the NRMP. Matching statistics from 1998 to 2005 were obtained for otolaryngology residency positions through the San Francisco match. Univariate analysis was performed, with a P value less than .05 determined as significant. The number of otolaryngology positions and applicants remained proportional to the overall number of positions and applicants in the NRMP match. Otolaryngology applicants per position and the matching rate of all applicants did not change between the 2 time periods studied. The overall match rate of US seniors applying to otolaryngology did not change, while the match rate of non-US seniors decreased significantly following initiation of the conventional match. There was no significant change in United States Medical Licensing Exam step 1 scores or percentage of unfilled otolaryngology residency positions between the 2 time periods. When comparing the early versus conventional otolaryngology match time periods, the only major change was the decreased percentage of matching among non-US senior applicants. Despite a significant shift in match timing after 2006, the supply, demand, and competitiveness of otolaryngology residency positions have not changed significantly. © American Academy of Otolaryngology—Head and Neck Surgery Foundation 2015.

  14. Fingerprint Recognition Using Minutia Score Matching

    CERN Document Server

    J, Ravi; R, Venugopal K

    2010-01-01

    The popular Biometric used to authenticate a person is Fingerprint which is unique and permanent throughout a person's life. A minutia matching is widely used for fingerprint recognition and can be classified as ridge ending and ridge bifurcation. In this paper we projected Fingerprint Recognition using Minutia Score Matching method (FRMSM). For Fingerprint thinning, the Block Filter is used, which scans the image at the boundary to preserves the quality of the image and extract the minutiae from the thinned image. The false matching ratio is better compared to the existing algorithm.

  15. Impedance-matched cavity quantum memory

    CERN Document Server

    Afzelius, Mikael

    2010-01-01

    We consider an atomic frequency comb based quantum memory inside an asymmetric optical cavity. In this configuration it is possible to absorb the input light completely in a system with an effective optical depth of one, provided that the absorption per cavity round trip exactly matches the transmission of the coupling mirror ("impedance matching"). We show that the impedance matching results in a readout efficiency only limited by irreversible atomic dephasing, whose effect can be made very small in systems with large inhomogeneous broadening. Our proposal opens up an attractive route towards quantum memories with close to unit efficiency.

  16. Limiting distribution of maximal crossing and nesting of Poissonized random matchings

    CERN Document Server

    Baik, Jinho

    2011-01-01

    The notion of r-crossing and r-nesting of a complete match- ing was introduced and a symmetry property was proved by Chen, Deng, Du, Stanley and Yan in 2007. We consider random matchings of large size and study the maximal crossing and the maximal nesting. It is known that the marginal distribution of each of them converges to the GOE Tracy-Widom distribution. We show that the maximal crossing and the maximal nesting becomes independent asymptotically, and eval- uate the joint distribution for the Poissonized random matchings explic- itly to the first correction term. This leads to an evaluation of the asymptotic of the covariance. Furthermore, we compute the explicit second correction term of the distributions function of two ob jects: (a) the length of the longest increasing subsequence of Poissonized random permutation and (b) the maximal crossing, and hence also the maximal nesting, of Poissonized random matching.

  17. Mimicry Is Presidential: Linguistic Style Matching in Presidential Debates and Improved Polling Numbers.

    Science.gov (United States)

    Romero, Daniel M; Swaab, Roderick I; Uzzi, Brian; Galinsky, Adam D

    2015-10-01

    The current research used the contexts of U.S. presidential debates and negotiations to examine whether matching the linguistic style of an opponent in a two-party exchange affects the reactions of third-party observers. Building off communication accommodation theory (CAT), interaction alignment theory (IAT), and processing fluency, we propose that language style matching (LSM) will improve subsequent third-party evaluations because matching an opponent's linguistic style reflects greater perspective taking and will make one's arguments easier to process. In contrast, research on status inferences predicts that LSM will negatively impact third-party evaluations because LSM implies followership. We conduct two studies to test these competing hypotheses. Study 1 analyzed transcripts of U.S. presidential debates between 1976 and 2012 and found that candidates who matched their opponent's linguistic style increased their standing in the polls. Study 2 demonstrated a causal relationship between LSM and third-party observer evaluations using negotiation transcripts.

  18. On Stable Marriages and Greedy Matchings

    Energy Technology Data Exchange (ETDEWEB)

    Manne, Fredrik; Naim, Md; Lerring, Hakon; Halappanavar, Mahantesh

    2016-12-11

    Research on stable marriage problems has a long and mathematically rigorous history, while that of exploiting greedy matchings in combinatorial scientific computing is a younger and less developed research field. In this paper we consider the relationships between these two areas. In particular we show that several problems related to computing greedy matchings can be formulated as stable marriage problems and as a consequence several recently proposed algorithms for computing greedy matchings are in fact special cases of well known algorithms for the stable marriage problem. However, in terms of implementations and practical scalable solutions on modern hardware, the greedy matching community has made considerable progress. We show that due to the strong relationship between these two fields many of these results are also applicable for solving stable marriage problems.

  19. 34 CFR 361.60 - Matching requirements.

    Science.gov (United States)

    2010-07-01

    ... REHABILITATIVE SERVICES, DEPARTMENT OF EDUCATION STATE VOCATIONAL REHABILITATION SERVICES PROGRAM Financing of State Vocational Rehabilitation Programs § 361.60 Matching requirements. (a) Federal share—(1) General... share for expenditures made for the construction of a facility for community rehabilitation...

  20. Sequence Matching Analysis for Curriculum Development

    National Research Council Canada - National Science Library

    Liem Yenny Bendatu; Bernardo Nugroho Yahya

    2015-01-01

    .... This study attempts to develop a sequence matching analysis. Considering conformance checking as the basis of this approach, this proposed approach utilizes the current control flow technique in process mining domain...

  1. Design of New SAW DQPSK Matched Filter

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    A new surface acoustic wave differential quadraphase shift key(SAW DQPSK) spread spectrum(SS) signal matched filter based on the fusion of SS and differential modulation is reported. The design of multi-phase coded SAW matched filter is proposed rather than another design of SAW DQPSK filter, which can cut in a half of the delay time of SAW DQPSK matched filter and SAW fixed delay line(FDL) used for differential demodulation. This breakthrough is made the system largely reduce a size and process much easily. This method can also be feasible in other SAW MPSK matched filter design especially when the modulation phase number is larger than 4. The design example and its experimental results are given.

  2. Clothing Matching for Visually Impaired Persons.

    Science.gov (United States)

    Yuan, Shuai; Tian, Yingli; Arditi, Aries

    2011-01-01

    Matching clothes is a challenging task for many blind people. In this paper, we present a proof of concept system to solve this problem. The system consists of 1) a camera connected to a computer to perform pattern and color matching process; 2) speech commands for system control and configuration; and 3) audio feedback to provide matching results for both color and patterns of clothes. This system can handle clothes in deficient color without any pattern, as well as clothing with multiple colors and complex patterns to aid both blind and color deficient people. Furthermore, our method is robust to variations of illumination, clothing rotation and wrinkling. To evaluate the proposed prototype, we collect two challenging databases including clothes without any pattern, or with multiple colors and different patterns under different conditions of lighting and rotation. Results reported here demonstrate the robustness and effectiveness of the proposed clothing matching system.

  3. The Effectiveness of Advertising Matching Purchase Motivation

    NARCIS (Netherlands)

    J. Loef; G. Antonides (Gerrit); W.F. van Raaij (Fred)

    2001-01-01

    textabstractSeveral authors have proposed frameworks to help advertisers predict and plan advertising effectiveness. Rossiter and Percy's advertising grid (1997) recommends that the ad appeal should match the purchase motivation or attitude base. They suggest that for utilitarian brands

  4. Regular Expression Matching and Operational Semantics

    CERN Document Server

    Rathnayake, Asiri; 10.4204/EPTCS.62.3

    2011-01-01

    Many programming languages and tools, ranging from grep to the Java String library, contain regular expression matchers. Rather than first translating a regular expression into a deterministic finite automaton, such implementations typically match the regular expression on the fly. Thus they can be seen as virtual machines interpreting the regular expression much as if it were a program with some non-deterministic constructs such as the Kleene star. We formalize this implementation technique for regular expression matching using operational semantics. Specifically, we derive a series of abstract machines, moving from the abstract definition of matching to increasingly realistic machines. First a continuation is added to the operational semantics to describe what remains to be matched after the current expression. Next, we represent the expression as a data structure using pointers, which enables redundant searches to be eliminated via testing for pointer equality. From there, we arrive both at Thompson's lock...

  5. AN EVEN ODD MULTIPLE PATTERN MATCHING ALGORITHM

    Directory of Open Access Journals (Sweden)

    Raju Bhukya,

    2011-03-01

    Full Text Available Pattern matching plays an important role in various applications ranging from text searching in word processors to identification of functional and structural behavior in proteins and genes. Pattern matching is one of the fundamental areas in the field of computational biology. Currently research in life science area is producing large amount of genetic data. Due to this large and use full information can be gained by finding valuable information available from the genomic sequences. Many algorithms have been proposed but more efficient and robust methods are needed for the multiple pattern matching algorithms for better use. We introduce a new indexing technique called an Index based even odd multiple pattern matching, which gives very good performance when compared with some of the existing popular algorithms. The current technique avoids unnecessary DNA comparisons as a result the number of comparisons and CPC ratio gradually decreases and overall performance increases accordingly.

  6. Fast algorithm on string cross pattern matching

    Institute of Scientific and Technical Information of China (English)

    Liu Gongshen; Li Jianhua; Li Shenghong

    2005-01-01

    Given a set U which is consisted of strings defined on alphabet ∑ , string cross pattern matching is to find all the matches between every two strings in U. It is utilized in text processing like removing the duplication of strings.This paper presents a fast string cross pattern matching algorithm based on extracting high frequency strings. Compared with existing algorithms including single-pattern algorithms and multi-pattern matching algorithms, this algorithm is featured by both low time complexityand low space complexity. Because Chinese alphabet is large and the average length of Chinese words is much short, this algorithm is more suitable to process the text written by Chinese, especially when the size of ∑ is large and the number of strings is far more than the maximum length of strings of set U.

  7. AN EVEN ODD MULTIPLE PATTERN MATCHING ALGORITHM

    OpenAIRE

    Raju Bhukya; DVLN Somayajulu

    2011-01-01

    Pattern matching plays an important role in various applications ranging from text searching in word processors to identification of functional and structural behavior in proteins and genes. Pattern matching is one of the fundamental areas in the field of computational biology. Currently research in life science area is producing large amount of genetic data. Due to this large and use full information can be gained by finding valuable information available from the genomic sequences. Many alg...

  8. Secure Fingerprint Alignment and Matching Protocols

    OpenAIRE

    Bayatbabolghani, Fattaneh; Blanton, Marina; Aliasgari, Mehrdad; Goodrich, Michael

    2017-01-01

    We present three secure privacy-preserving protocols for fingerprint alignment and matching, based on what are considered to be the most precise and efficient fingerprint recognition algorithms-those based on the geometric matching of "landmarks" known as minutia points. Our protocols allow two or more honest-but-curious parties to compare their respective privately-held fingerprints in a secure way such that they each learn nothing more than a highly-accurate score of how well the fingerprin...

  9. Variability of soccer referees' match performances.

    Science.gov (United States)

    Weston, M; Drust, B; Atkinson, G; Gregson, W

    2011-03-01

    The aim of the present study was to determine the between-match variability in soccer referees' match performances. 1 269 individual match observations were undertaken on 59 referees (range 2-79 games per referee) officiating in the English Premier League and Championship from 2003/2004 to 2007/2008 using a computerised tracking system (Prozone (®), Leeds, England). Between-match coefficients of variation (CV) were calculated for all games and then compared between referee age and experience groups. High mean CVs were observed for high-speed running distance (25.9±10.1%), recovery time (32.7±13.8%), explosive sprints (34.3±16.6%), total number of sprints (54.0±20.7%) and number of match fouls (28±4.6%). Smaller CVs were observed for total distance covered (3.8±1.5%), top sprinting speed (5.6±10.9%), distance from the ball (4.2±1.9%) and the distance from fouls (9.9±4.3%). Variability in match activities was not influenced by referee age or experience. The present study's findings demonstrate that variability in soccer referees' match performances is high in some variables and not dependent on referee age or experience. Such variability means that research requires large sample sizes to detect real systematic changes in a number of performance characteristics when studied during matches. © Georg Thieme Verlag KG Stuttgart · New York.

  10. Hybrid-Based Dense Stereo Matching

    Science.gov (United States)

    Chuang, T. Y.; Ting, H. W.; Jaw, J. J.

    2016-06-01

    Stereo matching generating accurate and dense disparity maps is an indispensable technique for 3D exploitation of imagery in the fields of Computer vision and Photogrammetry. Although numerous solutions and advances have been proposed in the literature, occlusions, disparity discontinuities, sparse texture, image distortion, and illumination changes still lead to problematic issues and await better treatment. In this paper, a hybrid-based method based on semi-global matching is presented to tackle the challenges on dense stereo matching. To ease the sensitiveness of SGM cost aggregation towards penalty parameters, a formal way to provide proper penalty estimates is proposed. To this end, the study manipulates a shape-adaptive cross-based matching with an edge constraint to generate an initial disparity map for penalty estimation. Image edges, indicating the potential locations of occlusions as well as disparity discontinuities, are approved by the edge drawing algorithm to ensure the local support regions not to cover significant disparity changes. Besides, an additional penalty parameter 𝑃𝑒 is imposed onto the energy function of SGM cost aggregation to specifically handle edge pixels. Furthermore, the final disparities of edge pixels are found by weighting both values derived from the SGM cost aggregation and the U-SURF matching, providing more reliable estimates at disparity discontinuity areas. Evaluations on Middlebury stereo benchmarks demonstrate satisfactory performance and reveal the potency of the hybrid-based dense stereo matching method.

  11. Childhood Sexual Trauma and Subsequent Parenting Beliefs and Behaviors

    Science.gov (United States)

    Zvara, B.J.; Mills-Koonce, R.; Appleyard Carmody, K.; Cox, M

    2016-01-01

    Using propensity-matched controls, the present study examines the long-term adjustment of women reporting Childhood Sexual Trauma (CST) at or before the age of 14 in terms of parenting efficacy and parenting behavior. Data for these analyses were obtained from mother reports and from observational protocols from a longitudinal study of low-income, rural families. The novel use of propensity-matched controls to create a control group matched on family of origin variables provides evidence that, when women with CST are compared with the matched comparison women, females who experienced CST show poorer functioning across multiple domains of parenting (sensitivity, harsh intrusiveness, boundary dissolution), but not in parenting efficacy. Follow up moderation analyses suggest that the potential effects of trauma on parenting behaviors are not attenuated by protective factors such as higher income, higher education, or stable adult relationships. Implications for interventions with childhood sexual trauma histories and directions for future study are proposed. PMID:25680655

  12. Prevalence and Cost of Subsequent Fractures Among U.S. Patients with an Incident Fracture.

    Science.gov (United States)

    Weaver, Jessica; Sajjan, Shiva; Lewiecki, E Michael; Harris, Steven T; Marvos, Panagiotis

    2017-04-01

    The prevalence and cost of subsequent fractures among patients with an incident fracture are not well defined. To assess the prevalence of, and costs associated with, subsequent fractures in the year after an incident fracture. This was a retrospective claims database analysis using data from Humana Medicare Advantage claims (Medicare group) and Optum Insight Clinformatics Data Mart commercial claims (commercial group). Patients included in the study had a claim for a qualifying fracture occurring between January 2008 and December 2013 (index fracture), were continuously enrolled in the health plan for ≥ 1 year before and after the index fracture, and were aged ≥ 65 years in the Medicare group or ≥ 50 years in the commercial group at the time of the index fracture. Subsequent fractures were identified by ICD-9-CM codes and were defined as the second fracture occurring ≥ 3 to ≤ 12 months after the index fracture (≥ 6 to ≤ 12 months for fractures at the same site as the index fracture). Rates of subsequent fractures were calculated as the number of patients who had a subsequent fracture divided by the total sample size. After propensity matching of demographic and clinical variables, we determined the total medical and pharmacy costs accrued within 1 year of the index fracture by patients with and without a subsequent fracture. Health care costs were compared between patients with and without a subsequent fracture using McNemar's test. A total of 45,603 patients were included in the Medicare group, and 54,145 patients were included in the commercial group. In the Medicare group, 7,604 (16.7%) patients experienced a subsequent fracture. The proportion of patients with a subsequent fracture was highest among patients with multiple index fractures (26.2%, n = 905), followed by those with hip (25.5%, n = 1,280) and vertebral (20.2%, n = 1,908) index fractures. In the commercial group, 6,256 (11.6%) patients experienced a subsequent fracture. The proportion

  13. A point-by-point analysis of performance in a fencing match: psychological processes associated with winning and losing streaks.

    Science.gov (United States)

    Doron, Julie; Gaudreau, Patrick

    2014-02-01

    This study aimed to revisit the complex nature of serial dependency of performance during a match, examining the prospective associations between psychological processes and subsequent performance at the within-person level of analysis, and explore whether psychological processes are associated with the likelihood of winning series of points. A process-oriented sequential approach was used with 16 elite fencers during a simulated competition. Multilevel regression analyses revealed that serial dependency of performance fluctuates within a match. Results of a Bayesian multilevel structural equation model showed that prior performance subsequently influenced psychological processes. Although psychological processes did not predict performance in the subsequent point, successive winnings were associated with higher perceived control and task-oriented coping and lower negative affectivity compared with both losing streaks and nonstreaks. Overall, serial dependencies of performance are nonstationary during a match whereas psychological processes significantly differ in episodes of winning after winning versus losing after losing.

  14. Optimally matching support and perceived spousal sensitivity.

    Science.gov (United States)

    Cutrona, Carolyn E; Shaffer, Philip A; Wesner, Kristin A; Gardner, Kelli A

    2007-12-01

    Partner sensitivity is an important antecedent of both intimacy (H. T. Reis & P. Shaver, 1988) and attachment (M. D. S. Ainsworth, 1989). On the basis of the optimal matching model of social support (C. E. Cutrona & D. Russell, 1990), support behaviors that "matched" the support goals of the stressed individual were predicted to lead to the perception of partner sensitivity. Predictions were tested with 59 married couples, who engaged in a videotaped self-disclosure task. Matching support was defined as the disclosure of emotions followed by emotional support or a request for information followed by informational support. Partial evidence was found for the predictions. Matching support following the disclosure of emotions was predictive of perceived partner sensitivity. Mismatched support following the disclosure of emotions predicted lower marital satisfaction, through the mediation of partner sensitivity. Matching support following a request for information was not predictive of perceived partner sensitivity, but negative partner responses (e.g., criticism or sarcasm) following a request for information negatively predicted perceptions of partner sensitivity. The importance of considering the context of support transactions is discussed.

  15. A review on compressed pattern matching

    Directory of Open Access Journals (Sweden)

    Surya Prakash Mishra

    2016-09-01

    Full Text Available Compressed pattern matching (CPM refers to the task of locating all the occurrences of a pattern (or set of patterns inside the body of compressed text. In this type of matching, pattern may or may not be compressed. CPM is very useful in handling large volume of data especially over the network. It has many applications in computational biology, where it is useful in finding similar trends in DNA sequences; intrusion detection over the networks, big data analytics etc. Various solutions have been provided by researchers where pattern is matched directly over the uncompressed text. Such solution requires lot of space and consumes lot of time when handling the big data. Various researchers have proposed the efficient solutions for compression but very few exist for pattern matching over the compressed text. Considering the future trend where data size is increasing exponentially day-by-day, CPM has become a desirable task. This paper presents a critical review on the recent techniques on the compressed pattern matching. The covered techniques includes: Word based Huffman codes, Word Based Tagged Codes; Wavelet Tree Based Indexing. We have presented a comparative analysis of all the techniques mentioned above and highlighted their advantages and disadvantages.

  16. Matched filter based iterative adaptive approach

    Science.gov (United States)

    Nepal, Ramesh; Zhang, Yan Rockee; Li, Zhengzheng; Blake, William

    2016-05-01

    Matched Filter sidelobes from diversified LPI waveform design and sensor resolution are two important considerations in radars and active sensors in general. Matched Filter sidelobes can potentially mask weaker targets, and low sensor resolution not only causes a high margin of error but also limits sensing in target-rich environment/ sector. The improvement in those factors, in part, concern with the transmitted waveform and consequently pulse compression techniques. An adaptive pulse compression algorithm is hence desired that can mitigate the aforementioned limitations. A new Matched Filter based Iterative Adaptive Approach, MF-IAA, as an extension to traditional Iterative Adaptive Approach, IAA, has been developed. MF-IAA takes its input as the Matched Filter output. The motivation here is to facilitate implementation of Iterative Adaptive Approach without disrupting the processing chain of traditional Matched Filter. Similar to IAA, MF-IAA is a user parameter free, iterative, weighted least square based spectral identification algorithm. This work focuses on the implementation of MF-IAA. The feasibility of MF-IAA is studied using a realistic airborne radar simulator as well as actual measured airborne radar data. The performance of MF-IAA is measured with different test waveforms, and different Signal-to-Noise (SNR) levels. In addition, Range-Doppler super-resolution using MF-IAA is investigated. Sidelobe reduction as well as super-resolution enhancement is validated. The robustness of MF-IAA with respect to different LPI waveforms and SNR levels is also demonstrated.

  17. Match Analysis in Volleyball: a systematic review

    Directory of Open Access Journals (Sweden)

    Miguel Silva

    2016-03-01

    Full Text Available The present article aims to review the available literature on match analysis in adult male Volleyball. Specific key words "performance analysis", "match analysis", "game analysis", "notational analysis", "tactical analysis", "technical analysis", "outcome" and "skills" were used to search relevant databases (PubMed, Web of Science, SportDiscus, Academic Search Complete and the International Journal of Performance Analysis in Sport. The research was conducted according to PRISMA (Preferred Reporting Items for Systematic reviews and Meta analyses guidelines. Of 3407 studies initially identified, only 34 were fully reviewed, and their outcome measures extracted and analyzed. Studies that fit all inclusion criteria were organized into two levels of analysis, according to their research design (comparative or predictive and depending on the type of variables analyzed (skills and their relationship with success, play position and match phase. Results show that from a methodological point of view, comparative studies where currently complemented with some predictive studies. This predictive approach emerged with the aim to identify the relationship between variables, considering their possible interactions and consequently its effect on team performance, contributing to a better understanding of Volleyball game performance through match analysis. Taking into account the limitations of the reviewed studies, future research should provide comprehensive operational definitions for the studied variables, using more recent samples, and consider integrating the player positions and match phase contexts into the analysis of Volleyball.

  18. Sketch Matching on Topology Product Graph.

    Science.gov (United States)

    Liang, Shuang; Luo, Jun; Liu, Wenyin; Wei, Yichen

    2015-08-01

    Sketch matching is the fundamental problem in sketch based interfaces. After years of study, it remains challenging when there exists large irregularity and variations in the hand drawn sketch shapes. While most existing works exploit topology relations and graph representations for this problem, they are usually limited by the coarse topology exploration and heuristic (thus suboptimal) similarity metrics between graphs. We present a new sketch matching method with two novel contributions. We introduce a comprehensive definition of topology relations, which results in a rich and informative graph representation of sketches. For graph matching, we propose topology product graph that retains the full correspondence for matching two graphs. Based on it, we derive an intuitive sketch similarity metric whose exact solution is easy to compute. In addition, the graph representation and new metric naturally support partial matching, an important practical problem that received less attention in the literature. Extensive experimental results on a real challenging dataset and the superior performance of our method show that it outperforms the state-of-the-art.

  19. Antenna impedance matching with neural networks.

    Science.gov (United States)

    Hemminger, Thomas L

    2005-10-01

    Impedance matching between transmission lines and antennas is an important and fundamental concept in electromagnetic theory. One definition of antenna impedance is the resistance and reactance seen at the antenna terminals or the ratio of electric to magnetic fields at the input. The primary intent of this paper is real-time compensation for changes in the driving point impedance of an antenna due to frequency deviations. In general, the driving point impedance of an antenna or antenna array is computed by numerical methods such as the method of moments or similar techniques. Some configurations do lend themselves to analytical solutions, which will be the primary focus of this work. This paper employs a neural control system to match antenna feed lines to two common antennas during frequency sweeps. In practice, impedance matching is performed off-line with Smith charts or relatively complex formulas but they rarely perform optimally over a large bandwidth. There have been very few attempts to compensate for matching errors while the transmission system is in operation and most techniques have been targeted to a relatively small range of frequencies. The approach proposed here employs three small neural networks to perform real-time impedance matching over a broad range of frequencies during transmitter operation. Double stub tuners are being explored in this paper but the approach can certainly be applied to other methodologies. The ultimate purpose of this work is the development of an inexpensive microcontroller-based system.

  20. Seismic random noise attenuation via 3D block matching

    Science.gov (United States)

    Amani, Sajjad; Gholami, Ali; Javaheri Niestanak, Alireza

    2017-01-01

    The lack of signal to noise ratio increases the final errors of seismic interpretation. In the present study, we apply a new non-local transform domain method called "3 Dimensional Block Matching (3DBM)" for seismic random noise attenuation. Basically, 3DBM uses the similarities through the data for retrieving the amplitude of signal in a specific point in the f-x domain, and because of this, it is able to preserve discontinuities in the data such as fractures and faults. 3DBM considers each seismic profile as an image and thus it can be applied to both pre-stack and post-stack seismic data. It uses the block matching clustering method to gather similar blocks contained in 2D data into 3D groups in order to enhance the level of correlation in each 3D array. By applying a 2D transform and 1D transform (instead of a 3D transform) on each array, we can effectively attenuate the noise by shrinkage of the transform coefficients. The subsequent inverse 2D transform and inverse 1D transform yield estimates of all matched blocks. Finally, the random noise attenuated data is computed using the weighted average of all block estimates. We applied 3DBM on both synthetic and real pre-stack and post-stack seismic data and compared it with a Curvelet transform based denoising method which is one of the most powerful methods in this area. The results show that 3DBM method eventuates in higher signal to noise ratio, lower execution time and higher visual quality.

  1. PREDICTING THE MATCH OUTCOME IN ONE DAY INTERNATIONAL CRICKET MATCHES, WHILE THE GAME IS IN PROGRESS

    Directory of Open Access Journals (Sweden)

    Michael Bailey

    2006-12-01

    Full Text Available Millions of dollars are wagered on the outcome of one day international (ODI cricket matches, with a large percentage of bets occurring after the game has commenced. Using match information gathered from all 2200 ODI matches played prior to January 2005, a range of variables that could independently explain statistically significant proportions of variation associated with the predicted run totals and match outcomes were created. Such variables include home ground advantage, past performances, match experience, performance at the specific venue, performance against the specific opposition, experience at the specific venue and current form. Using a multiple linear regression model, prediction variables were numerically weighted according to statistical significance and used to predict the match outcome. With the use of the Duckworth-Lewis method to determine resources remaining, at the end of each completed over, the predicted run total of the batting team could be updated to provide a more accurate prediction of the match outcome. By applying this prediction approach to a holdout sample of matches, the efficiency of the "in the run" wagering market could be assessed. Preliminary results suggest that the market is prone to overreact to events occurring throughout the course of the match, thus creating brief inefficiencies in the wagering market

  2. Inertia Matching Manipulability and Load Matching Optimization for Humanoid Jumping Robot

    Directory of Open Access Journals (Sweden)

    Zhaohong Xu

    2008-11-01

    Full Text Available Human jumping motion includes stance phase, flight phase and landing impact phase. Jumping robot belongs to a variable constraints system because every phase has different constraint conditions. An unified dynamics equation during stance phase and flight phase is established based on floated-basis space. Inertia matching is used to analyze actuator/gear systems and select the optimum gear ratio based on the transmission performance between the torque produced at the actuator and the torque applied to the load. Load matching is an important index which affects jumping performance and reflects the capability of supporting a weight or mass. It also affects the distributing of the center of gravity (COG. Regarding jumping robot as a redundant manipulator with a load at end-effector, inertia matching can be applied to optimize load matching for jumping robot. Inertia matching manipulability and directional manipulability are easy to analyze and optimize the load matching parameters. A 5th order polynomial function is defined to plan COG trajectory of jumping motion, taking into account the constraint conditions of both velocity and acceleration. Finally, the numerical simulation of vertical jumping and experimental results show inertia matching is in direct proportion to jumping height, and inertia matching manipulability is a valid method to load matching optimization and conceptual design of robot.

  3. Fluctuating emg signals: investigating long-term effects of pattern matching algorithms.

    Science.gov (United States)

    Kaufmann, Paul; Englehart, Kevin; Platzner, Marco

    2010-01-01

    In this paper, we investigate the behavior of state-of-the-art pattern matching algorithms when applied to electromyographic data recorded during 21 days. To this end, we compare the five classification techniques k-nearest-neighbor, linear discriminant analysis, decision trees, artificial neural networks and support vector machines. We provide all classifiers with features extracted from electromyographic signals taken from forearm muscle contractions, and try to recognize ten different hand movements. The major result of our investigation is that the classification accuracy of initially trained pattern matching algorithms might degrade on subsequent data indicating variations in the electromyographic signals over time.

  4. Morbidity and risk of subsequent diagnosis of HIV

    DEFF Research Database (Denmark)

    Søgaard, Ole S; Lohse, Nicolai; Østergaard, Lars Jørgen;

    2012-01-01

    Early identification of persons with undiagnosed HIV infection is an important health care issue. We examined associations between diseases diagnosed in hospitals and risk of subsequent HIV diagnosis.......Early identification of persons with undiagnosed HIV infection is an important health care issue. We examined associations between diseases diagnosed in hospitals and risk of subsequent HIV diagnosis....

  5. Subsequence Generation for the Airline Crew Pairing Problem

    DEFF Research Database (Denmark)

    Rasmussen, Matias Sevel; Lusby, Richard Martin; Ryan, David

    , we try to identify or generate such subsequences that potentially can improve the solution value. We benchmark the subsequence generation approach against a classical column generation approach on real-life test instances. We consider the LP relaxation and compare the quality and the integrality...

  6. 38 CFR 36.4324 - Guaranty claims; subsequent accounting.

    Science.gov (United States)

    2010-07-01

    ... 38 Pensions, Bonuses, and Veterans' Relief 2 2010-07-01 2010-07-01 false Guaranty claims; subsequent accounting. 36.4324 Section 36.4324 Pensions, Bonuses, and Veterans' Relief DEPARTMENT OF VETERANS... § 36.4324 Guaranty claims; subsequent accounting. (a) Subject to the limitation that the total...

  7. Recurrent miscarriage and antiphospholipid antibodies: prognosis of subsequent pregnancy.

    NARCIS (Netherlands)

    Cohn, D.M.; Goddijn, M.; Middeldorp, S.; Korevaar, J.C.; Dawood, F.; Farquharson, R.G.

    2010-01-01

    Background: Although women with antiphospholipid antibodies (APLAs) are at increased risk of recurrent miscarriage, the outcome of a subsequent pregnancy is not clearly elucidated. Objectives: To assess the pregnancy outcome of a subsequent pregnancy in women with APLAs and compare this outcome with

  8. Covariant diagrams for one-loop matching

    CERN Document Server

    Zhang, Zhengkang

    2016-01-01

    We present a diagrammatic formulation of recently-revived covariant functional approaches to one-loop matching from an ultraviolet (UV) theory to a low-energy effective field theory. Various terms following from a covariant derivative expansion (CDE) are represented by diagrams which, unlike conventional Feynman diagrams, involve gauge-covariant quantities and are thus dubbed "covariant diagrams." The use of covariant diagrams helps organize and simplify one-loop matching calculations, which we illustrate with examples. Of particular interest is the derivation of UV model-independent universal results, which reduce matching calculations of specific UV models to applications of master formulas. We show how such derivation can be done in a more concise manner than the previous literature, and discuss how additional structures that are not directly captured by existing universal results, including mixed heavy-light loops, open covariant derivatives, and mixed statistics, can be easily accounted for.

  9. Sidescan Sonar Image Matching Using Cross Correlation

    DEFF Research Database (Denmark)

    Thisen, Erik; Sørensen, Helge Bjarup Dissing; Stage, Bjarne

    2003-01-01

    When surveying an area for sea mines with a sidescan sonar, the ability to find the same object in two different sonar images is helpful to determine the nature of the object. The main problem with matching two sidescan sonar images is that a scene changes appearance when viewed from different...... viewpoints. This paper presents a novel approach for matching two sidescan sonar images. The method first registers the two images to ground, then uses the cross correlation of the object positions on the seabed to find the correct displacement between the two images. In order to correct any minor...... displacements of the relative objects position as a result of the ground registration, the object position is given an area of influence. The method is compared to an existing method for matching sidescan sonar images based on hypothetical reasoning. The two methods are compared on a number of real sidescan...

  10. Matching a wavelet to ECG signal.

    Science.gov (United States)

    Takla, George F; Nair, Bala G; Loparo, Kenneth A

    2006-01-01

    In this paper we develop an approach to synthesize a wavelet that matches the ECG signal. Matching a wavelet to a signal of interest has potential advantages in extracting signal features with greater accuracy, particularly when the signal is contaminated with noise. The approach that we have taken is based on the theoretical work done by Chapa and Rao. We have applied their technique to a noise-free ECG signal representing one cardiac cycle. Results indicate that a matched wavelet, that was able to capture the broad ECG features, could be obtained. Such a wavelet could be used to extract ECG features such as QRS complexes and P&T waves with greater accuracy.

  11. Multi scale feature based matched filter processing

    Institute of Scientific and Technical Information of China (English)

    LI Jun; HOU Chaohuan

    2004-01-01

    Using the extreme difference of self-similarity and kurtosis at large level scale of wavelet transform approximation between the PTFM (Pulse Trains of Frequency Modulated)signals and its reverberation, a feature-based matched filter method using the classify-beforedetect paragriam is proposed to improve the detection performance in reverberation and multipath environments. Processing the data of lake-trails showed that the processing gain of the proposed method is bigger than that of matched filter about 10 dB. In multipath environments, detection performance of matched filter become badly poorer, while that of the proposed method is improved better. It shows that the method is much more robust with the effect of multipath.

  12. Covariant diagrams for one-loop matching

    Energy Technology Data Exchange (ETDEWEB)

    Zhang, Zhengkang [Michigan Univ., Ann Arbor, MI (United States). Michigan Center for Theoretical Physics; Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany)

    2016-10-15

    We present a diagrammatic formulation of recently-revived covariant functional approaches to one-loop matching from an ultraviolet (UV) theory to a low-energy effective field theory. Various terms following from a covariant derivative expansion (CDE) are represented by diagrams which, unlike conventional Feynman diagrams, involve gaugecovariant quantities and are thus dubbed ''covariant diagrams.'' The use of covariant diagrams helps organize and simplify one-loop matching calculations, which we illustrate with examples. Of particular interest is the derivation of UV model-independent universal results, which reduce matching calculations of specific UV models to applications of master formulas. We show how such derivation can be done in a more concise manner than the previous literature, and discuss how additional structures that are not directly captured by existing universal results, including mixed heavy-light loops, open covariant derivatives, and mixed statistics, can be easily accounted for.

  13. Efficient Catalog Matching with Dropout Detection

    CERN Document Server

    Fan, Dongwei; Szalay, Alexander S; Cui, Chenzhou; Zhao, Yongheng

    2014-01-01

    Not only source catalogs are extracted from astronomy observations. Their sky coverage is always carefully recorded and used in statistical analyses, such as correlation and luminosity function studies. Here we present a novel method for catalog matching, which inherently builds on the coverage information for better performance and completeness. A modified version of the Zones Algorithm is introduced for matching partially overlapping observations, where irrelevant parts of the data are excluded up front for efficiency. Our design enables searches to focus on specific areas on the sky to further speed up the process. Another important advantage of the new method over traditional techniques is its ability to quickly detect dropouts, i.e., the missing components that are in the observed regions of the celestial sphere but did not reach the detection limit in some observations. These often provide invaluable insight into the spectral energy distribution of the matched sources but rarely available in traditional...

  14. Unification and Matching on Compressed Terms

    CERN Document Server

    Gascón, Adrià; Schmidt-Schauß, Manfred

    2010-01-01

    Term unification plays an important role in many areas of computer science, especially in those related to logic. The universal mechanism of grammar-based compression for terms, in particular the so-called Singleton Tree Grammars (STG), have recently drawn considerable attention. Using STGs, terms of exponential size and height can be represented in linear space. Furthermore, the term representation by directed acyclic graphs (dags) can be efficiently simulated. The present paper is the result of an investigation on term unification and matching when the terms given as input are represented using different compression mechanisms for terms such as dags and Singleton Tree Grammars. We describe a polynomial time algorithm for context matching with dags, when the number of different context variables is fixed for the problem. For the same problem, NP-completeness is obtained when the terms are represented using the more general formalism of Singleton Tree Grammars. For first-order unification and matching polynom...

  15. INFORMATION SYSTEMS AUDIT CURRICULA CONTENT MATCHING

    Directory of Open Access Journals (Sweden)

    Vasile-Daniel CARDOȘ

    2014-11-01

    Full Text Available Financial and internal auditors must cope with the challenge of performing their mission in technology enhanced environment. In this article we match the information technology description found in the International Federation of Accountants (IFAC and the Institute of Internal Auditors (IIA curricula against the Model Curriculum issued by the Information Systems Audit and Control Association (ISACA. By reviewing these three curricula, we matched the content in the ISACA Model Curriculum with the IFAC International Education Practice Statement 2 and the IIAs’ Global Model Internal Audit Curriculum. In the IFAC and IIA Curriculum there are 16 content elements, out of 19 possible, which match, in their description, the ISACA Model Curriculum’s content. We noticed that a candidate who graduates an IFAC or IIA compliant program acquire IS auditing competences similar to the specific content of the ISACA model curriculum but less than the requirements for a professional information systems auditor.

  16. A medium resolution fingerprint matching system

    Directory of Open Access Journals (Sweden)

    Ayman Mohammad Bahaa-Eldin

    2013-09-01

    Full Text Available In this paper, a novel minutiae based fingerprint matching system is proposed. The system is suitable for medium resolution fingerprint images obtained by low cost commercial sensors. The paper presents a new thinning algorithm, a new features extraction and representation, and a novel feature distance matching algorithm. The proposed system is rotation and translation invariant and is suitable for complete or partial fingerprint matching. The proposed algorithms are optimized to be executed on low resource environments both in CPU power and memory space. The system was evaluated using a standard fingerprint dataset and good performance and accuracy were achieved under certain image quality requirements. In addition, the proposed system was compared favorably to that of the state of the art systems.

  17. Anatomy Ontology Matching Using Markov Logic Networks

    Directory of Open Access Journals (Sweden)

    Chunhua Li

    2016-01-01

    Full Text Available The anatomy of model species is described in ontologies, which are used to standardize the annotations of experimental data, such as gene expression patterns. To compare such data between species, we need to establish relationships between ontologies describing different species. Ontology matching is a kind of solutions to find semantic correspondences between entities of different ontologies. Markov logic networks which unify probabilistic graphical model and first-order logic provide an excellent framework for ontology matching. We combine several different matching strategies through first-order logic formulas according to the structure of anatomy ontologies. Experiments on the adult mouse anatomy and the human anatomy have demonstrated the effectiveness of proposed approach in terms of the quality of result alignment.

  18. Improved Stereo Matching With Boosting Method

    Directory of Open Access Journals (Sweden)

    Shiny B

    2015-06-01

    Full Text Available Abstract This paper presents an approach based on classification for improving the accuracy of stereo matching methods. We propose this method for occlusion handling. This work employs classification of pixels for finding the erroneous disparity values. Due to the wide applications of disparity map in 3D television medical imaging etc the accuracy of disparity map has high significance. An initial disparity map is obtained using local or global stereo matching methods from the input stereo image pair. The various features for classification are computed from the input stereo image pair and the obtained disparity map. Then the computed feature vector is used for classification of pixels by using GentleBoost as the classification method. The erroneous disparity values in the disparity map found by classification are corrected through a completion stage or filling stage. A performance evaluation of stereo matching using AdaBoostM1 RUSBoost Neural networks and GentleBoost is performed.

  19. Achromatic hues matching in graphic printing

    Directory of Open Access Journals (Sweden)

    Martinia Ira Glogar

    2015-05-01

    Full Text Available Some problems in process of dark achromatic hues reproduction and matching in graphic industry, where requests on colour matching are very high, are discussed. When achromatic hues is concerned, in terms of high requests on colour parameter matching, right on time production, quick response and high quality standards requests, the production and moreover the reproduction is subject to many variables and represent the manufacturing process of high complexity. The aim is to achieve a graphic reproduction with defined colour parameters and remission characteristics as close as possible to a standard. In this paper, black and grey hues characterized with average lightness value L*≤ 20, were analysed. Subjective as well as objective colour evaluation have been performed and results of colour differences obtained by two colour difference formulae, CIELAB and CMC(l:c have been compared.

  20. 78 FR 48169 - Privacy Act of 1974; CMS Computer Match No. 2013-02; HHS Computer Match No. 1306; DoD-DMDC Match...

    Science.gov (United States)

    2013-08-07

    ... Services Privacy Act of 1974; CMS Computer Match No. 2013-02; HHS Computer Match No. 1306; DoD-DMDC Match... Services (CMS). ACTION: Notice of Computer Matching Program (CMP). SUMMARY: In accordance with the requirements of the Privacy Act of 1974, as amended, this notice establishes a CMP that CMS plans to...

  1. Subsequent yield loci of 5754O aluminum alloy sheet

    Institute of Scientific and Technical Information of China (English)

    WANG Hai-bo; WAN Min; WU Xiang-dong; YAN Yu

    2009-01-01

    Complex loading paths were realized with cruciform specimens and biaxial loading testing machine. Experimental method for determining the subsequent yield locus of sheet metal was established. With this method, the subsequent yield loci of 5754O aluminum alloy sheet were obtained under complex loading paths. Theoretical subsequent yield loci based on Yld2000-2d yield criterion and three kinds of hardening modes were calculated and compared with the experimental results. The results show that the theoretical subsequent yield loci based on mixed hardening mode describe the experimental subsequent yield loci well, whereas isotropic hardening mode, which is widely used in sheet metal forming fields, predicts values larger than the experimental results. Kinematic hardening mode predicts values smaller than the experimental results and its errors are the largest.

  2. Using crosswell data to enhance history matching

    KAUST Repository

    Ravanelli, Fabio M.

    2014-01-01

    One of the most challenging tasks in the oil industry is the production of reliable reservoir forecast models. Due to different sources of uncertainties in the numerical models and inputs, reservoir simulations are often only crude approximations of the reality. This problem is mitigated by conditioning the model with data through data assimilation, a process known in the oil industry as history matching. Several recent advances are being used to improve history matching reliability, notably the use of time-lapse data and advanced data assimilation techniques. One of the most promising data assimilation techniques employed in the industry is the ensemble Kalman filter (EnKF) because of its ability to deal with non-linear models at reasonable computational cost. In this paper we study the use of crosswell seismic data as an alternative to 4D seismic surveys in areas where it is not possible to re-shoot seismic. A synthetic reservoir model is used in a history matching study designed better estimate porosity and permeability distributions and improve the quality of the model to predict future field performance. This study is divided in three parts: First the use of production data only is evaluated (baseline for benchmark). Second the benefits of using production and 4D seismic data are assessed. Finally, a new conceptual idea is proposed to obtain time-lapse information for history matching. The use of crosswell time-lapse seismic tomography to map velocities in the interwell region is demonstrated as a potential tool to ensure survey reproducibility and low acquisition cost when compared with full scale surface surveys. Our numerical simulations show that the proposed method provides promising history matching results leading to similar estimation error reductions when compared with conventional history matched surface seismic data.

  3. Risk factors for subsequent febrile seizures in the FEBSTAT study.

    Science.gov (United States)

    Hesdorffer, Dale C; Shinnar, Shlomo; Lax, Daniel N; Pellock, John M; Nordli, Douglas R; Seinfeld, Syndi; Gallentine, William; Frank, L Matthew; Lewis, Darrell V; Shinnar, Ruth C; Bello, Jacqueline A; Chan, Stephen; Epstein, Leon G; Moshé, Solomon L; Liu, Binyi; Sun, Shumei

    2016-07-01

    To identify risk and risk factors for developing a subsequent febrile seizure (FS) in children with a first febrile status epilepticus (FSE) compared to a first simple febrile seizure (SFS). To identify home use of rescue medications for subsequent FS. Cases included a first FS that was FSE drawn from FEBSTAT and Columbia cohorts. Controls were a first SFS. Cases and controls were classified according to established FEBSTAT protocols. Cumulative risk for subsequent FS over a 5-year period was compared in FSE versus SFS, and Cox proportional hazards regression was conducted. Separate analysis examined subsequent FS within FSE. The use of rescue medications at home was assessed for subsequent FS. Risk for a subsequent FSE was significantly increased in FSE versus SFS. Any magnetic resonance imaging (MRI) abnormality increased the risk 3.4-fold (p 10 min over the 5-year follow-up did not differ in FSE versus SFS. Rectal diazepam was administered at home to 5 (23.8%) of 21 children with subsequent FS lasting ≥10 min. Compared to controls, FSE was associated with an increased risk for subsequent FSE, suggesting the propensity of children with an initial prolonged seizure to experience a prolonged recurrence. Any baseline MRI abnormality increased the recurrence risk when FSE was compared to SFS and when FSE was studied alone. A minority of children with a subsequent FS lasting 10 min or longer were treated with rectal diazepam at home, despite receiving prescriptions after the first FSE. This indicates the need to further improve the education of clinicians and parents in order to prevent subsequent FSE. Wiley Periodicals, Inc. © 2016 International League Against Epilepsy.

  4. Impact of subsequent metastases on costs and medical resource use for prostate cancer patients initially diagnosed with localized disease.

    Science.gov (United States)

    Li, Tracy T; Shore, Neal D; Mehra, Maneesha; Todd, Mary B; Saadi, Ryan; Leblay, Gaetan; Aggarwal, Jyoti; Griffiths, Robert I

    2017-09-15

    The impact of subsequent metastases on costs and medical resource use (MRU) for prostate cancer (PC) patients initially diagnosed with localized disease was estimated. Surveillance, Epidemiology, and End Results data, linked to Medicare (1999-2012), were used to identify 7482 patients diagnosed with subsequent metastases 12 months or more after the initial diagnosis of localized PC (cases), and they were matched to 25,709 localized PC patients without subsequent metastases (controls). Patients were followed for costs and MRU from 12 months before their index date (subsequent metastases or a matched date for controls) up to 12 months after it. Costs and MRU were stratified by the setting/type of care/service. Multivariate mixed effects regression analyses were used to construct and compare longitudinal trajectories of marginal predicted costs and predicted probabilities of MRU between cases and controls. Among the controls, predicted monthly costs remained relatively stable throughout the entire observation period (weighted mean per patient per month, $2746; range during 24 months, $2603-2858). In contrast, among the cases, costs increased from $2622 (95% confidence interval [CI], $2525-2719) 12 months before the diagnosis of subsequent metastases to $4767 (95% CI, $4623-4910) 1 month before the diagnosis of subsequent metastases, peaked during the month of metastases at $13,291 (95% CI, $13,148-13,435), and remained significantly higher than costs for the controls thereafter (eg, $4677 at + 12 months; 95% CI, $4549-4805). Costs and MRU increased across a wide range of settings/types, including inpatient, outpatient, home health, and hospice settings. In PC patients initially diagnosed with localized disease, a diagnosis of subsequent metastases is associated with substantially increased costs and MRU. Cancer 2017;123:3591-601. © 2017 American Cancer Society. © 2017 American Cancer Society.

  5. Transverse Beam Matching Application for SNS

    CERN Document Server

    Chu, Chungming; Jeon Dong Oh; Plum, Michael

    2005-01-01

    An automated transverse beam matching application has been developed for the Spallation Neutron Source (SNS) beam transport lines. The application is written within the XAL Java framework and the matching algorithm is based on the simplex optimization method. Other functionalities, such as emittance calculated from profile monitor measurements (adopted from a LANL Fortran code), profile monitor display, and XAL on-line model calculation, are also provided by the application. Test results obtained during the SNS warm linac commissioning will be reported. A comparison between the emittances obtained from this application and an independent Trace-3D routine will also be shown.

  6. Similarity Based Semantic Web Service Match

    Science.gov (United States)

    Peng, Hui; Niu, Wenjia; Huang, Ronghuai

    Semantic web service discovery aims at returning the most matching advertised services to the service requester by comparing the semantic of the request service with an advertised service. The semantic of a web service are described in terms of inputs, outputs, preconditions and results in Ontology Web Language for Service (OWL-S) which formalized by W3C. In this paper we proposed an algorithm to calculate the semantic similarity of two services by weighted averaging their inputs and outputs similarities. Case study and applications show the effectiveness of our algorithm in service match.

  7. Towards the perfect prediction of soccer matches

    CERN Document Server

    Heuer, Andreas

    2012-01-01

    We present a systematic approach to the prediction of soccer matches. First, we show that the information about chances for goals is by far more informative than about the actual results. Second, we present a multivariate regression approach and show how the prediction quality increases with increasing information content. This prediction quality can be explicitly expressed in terms of just two parameters. Third, by disentangling the systematic and random components of soccer matches we can identify the optimum level of predictability. These concepts are exemplified for the German Bundesliga.

  8. Famous face recognition, face matching, and extraversion.

    Science.gov (United States)

    Lander, Karen; Poyarekar, Siddhi

    2015-01-01

    It has been previously established that extraverts who are skilled at interpersonal interaction perform significantly better than introverts on a face-specific recognition memory task. In our experiment we further investigate the relationship between extraversion and face recognition, focusing on famous face recognition and face matching. Results indicate that more extraverted individuals perform significantly better on an upright famous face recognition task and show significantly larger face inversion effects. However, our results did not find an effect of extraversion on face matching or inverted famous face recognition.

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

  10. General Phase Matching Condition for Quantum Searching

    CERN Document Server

    Long, G L; Sun, Y; Long, Gui-Lu; Xiao, Li; Sun, Yang

    2001-01-01

    We present a general phase matching condition for the quantum search algorithm with arbitrary unitary transformation and arbitrary phase rotations. We show by an explicit expression that the phase matching condition depends both on the unitary transformation U and the initial state. Assuming that the initial amplitude distribution is an arbitrary superposition sin\\theta_0 |1> + cos\\theta_0 e^{i\\delta} |2> with |1> = {1 / sin\\beta} \\sum_k |\\tau_k> and |2> = {1 / cos\\beta} \\sum_{i \

  11. Distortion analysis on binary representation of minutiae based fingerprint matching for match-on-card

    CSIR Research Space (South Africa)

    Mlambo, CS

    2016-12-01

    Full Text Available , time efficient implementations, security and efficient space of the match on card. In this paper presented is the survey on the methods used to improve the accuracy in matching and memory usage by representing minutiae points in binary. In addition...

  12. Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts

    DEFF Research Database (Denmark)

    Bille, Philip; Fagerberg, Rolf; Gørtz, Inge Li

    2009-01-01

    We study the approximate string matching and regular expression matching problem for the case when the text to be searched is compressed with the Ziv-Lempel adaptive dictionary compression schemes. We present a time-space trade-off that leads to algorithms improving the previously known...

  13. Matching based on biological categories in Orangutans (Pongo abelii) and a Gorilla (Gorilla gorilla gorilla).

    Science.gov (United States)

    Vonk, Jennifer

    2013-01-01

    Following a series of experiments in which six orangutans and one gorilla discriminated photographs of different animal species in a two-choice touch screen procedure, Vonk & MacDonald (2002) and Vonk & MacDonald (2004) concluded that orangutans, but not the gorilla, seemed to learn intermediate level category discriminations, such as primates versus non-primates, more rapidly than they learned concrete level discriminations, such as orangutans versus humans. In the current experiments, four of the same orangutans and the gorilla were presented with delayed matching-to-sample tasks in which they were rewarded for matching photos of different members of the same primate species; golden lion tamarins, Japanese macaques, and proboscis monkeys, or family; gibbons, lemurs (Experiment 1), and subsequently for matching photos of different species within the following classes: birds, reptiles, insects, mammals, and fish (Experiment 2). Members of both Great Ape species were rapidly able to match the photos at levels above chance. Orangutans matched images from both category levels spontaneously whereas the gorilla showed effects of learning to match intermediate level categories. The results show that biological knowledge is not necessary to form natural categories at both concrete and intermediate levels.

  14. A Novel Artificial Bee Colony Algorithm Based on Internal-Feedback Strategy for Image Template Matching

    Directory of Open Access Journals (Sweden)

    Bai Li

    2014-01-01

    Full Text Available Image template matching refers to the technique of locating a given reference image over a source image such that they are the most similar. It is a fundamental mission in the field of visual target recognition. In general, there are two critical aspects of a template matching scheme. One is similarity measurement and the other is best-match location search. In this work, we choose the well-known normalized cross correlation model as a similarity criterion. The searching procedure for the best-match location is carried out through an internal-feedback artificial bee colony (IF-ABC algorithm. IF-ABC algorithm is highlighted by its effort to fight against premature convergence. This purpose is achieved through discarding the conventional roulette selection procedure in the ABC algorithm so as to provide each employed bee an equal chance to be followed by the onlooker bees in the local search phase. Besides that, we also suggest efficiently utilizing the internal convergence states as feedback guidance for searching intensity in the subsequent cycles of iteration. We have investigated four ideal template matching cases as well as four actual cases using different searching algorithms. Our simulation results show that the IF-ABC algorithm is more effective and robust for this template matching mission than the conventional ABC and two state-of-the-art modified ABC algorithms do.

  15. Cesarean delivery in the second stage of labor and the risk of subsequent premature birth.

    Science.gov (United States)

    Wood, Stephen L; Tang, Selphee; Crawford, Susan

    2017-07-01

    Cesarean delivery is being increasingly used by obstetricians for indicated deliveries in the second stage of labor. Unplanned extension of the uterine incision involving the cervix often occurs with these surgeries. Therefore, we hypothesized that cesarean delivery in the second stage of labor may increase the rate of subsequent spontaneous premature birth. We sought to determine if cesarean delivery in the late first stage of labor or in the second stage of labor increases the risk of a subsequent spontaneous preterm birth. We conducted a retrospective cohort study of matched first and second births from a large Canadian perinatal database. The primary outcomes were spontaneous premature birth cesarean delivery. The protocol and analysis plan was registered prior to obtaining data at Open Science Foundation. In total, 189,021 paired first and second births were identified. The risk of spontaneous preterm delivery cesarean delivery in the second stage of labor (relative risk, 1.57; 95% confidence interval, 1.43-1.73 and relative risk, 2.12; 95% confidence interval, 1.67-2.68, respectively). The risk of perinatal death in the second birth, excluding congenital anomalies, was also correspondingly increased (relative risk, 1.44; 95% confidence interval, 1.05-1.96). Cesarean delivery in second stage of labor was associated with a 2-fold increase in the risk of spontaneous preterm birth <32 weeks of gestation in a subsequent birth. This information may inform management of operative delivery in the second stage. Copyright © 2017 Elsevier Inc. All rights reserved.

  16. Association of Periodontitis and Subsequent Depression: A Nationwide Population-Based Study.

    Science.gov (United States)

    Hsu, Chih-Chao; Hsu, Yi-Chao; Chen, Hsuan-Ju; Lin, Che-Chen; Chang, Kuang-Hsi; Lee, Chang-Yin; Chong, Lee-Won; Kao, Chia-Hung

    2015-12-01

    Periodontitis is a systemic and chronic inflammatory disease associated with multiple physical conditions. Distress and depression are other problems affecting the progression of periodontitis. However, the causal relationship between depression and periodontitis has not been adequately investigated. This aim of this study was to determine the association between periodontitis and the subsequent development of depression.We identified 12,708 patients with newly diagnosed periodontitis from 2000 to 2005 and 50,832 frequency-matched individuals without periodontitis. Both groups were followed until diagnosed with depression, withdrawal from the National Health Insurance program, or the end of 2011. The association between periodontitis and depressio was analyzed using Cox proportional hazard regression models.The incidence density rate of depression was higher in the periodontitis group than in the nonperiodontitis group, with an adjusted hazard ratio of 1.73 (95% confidence interval 1.58-1.89) when adjusting for sex, age, and comorbidity. Cox models revealed that periodontitis was an independent risk factor for depression in patients, except for comorbidities of diabetes mellitus (DM), alcohol abuse, and cancer.Periodontitis may increase the risk of subsequent depression and was suggested an independent risk factor regardless of sex, age, and most comorbidities. However, DM, alcohol abuse, and cancer may prevent the development of subsequent depression because of DM treatment, the paradoxical effect of alcohol, and emotional distress to cancer, respectively. Prospective studies on the relationship between periodontitis and depression are warranted.

  17. Organophosphate Poisoning and Subsequent Acute Kidney Injury Risk: A Nationwide Population-Based Cohort Study.

    Science.gov (United States)

    Lee, Feng-You; Chen, Wei-Kung; Lin, Cheng-Li; Lai, Ching-Yuan; Wu, Yung-Shun; Lin, I-Ching; Kao, Chia-Hung

    2015-11-01

    Small numbers of the papers have studied the association between organophosphate (OP) poisoning and the subsequent acute kidney injury (AKI). Therefore, we used the National Health Insurance Research Database (NHIRD) to study whether patients with OP poisoning are associated with a higher risk to have subsequent AKI.The retrospective cohort study comprised patients aged ≥20 years with OP poisoning and hospitalized diagnosis during 2000-2011 (N = 8924). Each OP poisoning patient was frequency-matched to 4 control patients based on age, sex, index year, and comorbidities of diabetes, hypertension, hyperlipidemia, chronic obstructive pulmonary disease, coronary artery disease, and stroke (N = 35,696). We conducted Cox proportional hazard regression analysis to estimate the effects of OP poisoning on AKI risk.The overall incidence of AKI was higher in the patients with OP poisoning than in the controls (4.85 vs 3.47/1000 person-years). After adjustment for age, sex, comorbidity, and interaction terms, patients with OP poisoning were associated with a 6.17-fold higher risk of AKI compared with the comparison cohort. Patients with highly severe OP poisoning were associated with a substantially increased risk of AKI.The study found OP poisoning is associated with increased risk of subsequent AKI. Future studies are encouraged to evaluate whether long-term effects exist and the best guideline to prevent the continuously impaired renal function.

  18. POINT PATTERN MATCHING ALGORITHM BASED ON POINT PAIR TOPOLOGICAL CHARACTERISTICS AND SPECTRAL MATCHING

    Institute of Scientific and Technical Information of China (English)

    Lu Chunyan; Zou Huanxin; Zhao Jian; Zhou Shilin

    2012-01-01

    Most of the Point Pattern Matching (PPM) algorithm performs poorly when the noise of the point's position and outliers exist.This paper presents a novel and robust PPM algorithm which combined Point Pair Topological Characteristics (PPTC) and Spectral Matching (SM) together to solve the afore mentioned issues.In which PPTC,a new shape descriptor,is firstly proposed.A new comparability measurement based on PPTC is defined as the matching probability.Finally,the correct matching results are achieved by the spectral matching method.The synthetic data experiments show its robustness by comparing with the other state-of-art algorithms and the real world data experiments show its effectiveness.

  19. Manifold Matching for High-Dimensional Pattern Recognition

    OpenAIRE

    HOTTA, Seiji

    2008-01-01

    In this chapter manifold matching for high-dimensional pattern classification was described. The topics described in this chapter were summarized as follows: The meaning and effectiveness of manifold matching The similarity between various classifiers from the point of view of manifold matching Accuracy improvement for manifold matching Learning rules for manifold matching Experimental results on handwritten digit datasets showed that manifold matching achieved lower error rates than other cl...

  20. History matching through dynamic decision-making.

    Science.gov (United States)

    Cavalcante, Cristina C B; Maschio, Célio; Santos, Antonio Alberto; Schiozer, Denis; Rocha, Anderson

    2017-01-01

    History matching is the process of modifying the uncertain attributes of a reservoir model to reproduce the real reservoir performance. It is a classical reservoir engineering problem and plays an important role in reservoir management since the resulting models are used to support decisions in other tasks such as economic analysis and production strategy. This work introduces a dynamic decision-making optimization framework for history matching problems in which new models are generated based on, and guided by, the dynamic analysis of the data of available solutions. The optimization framework follows a 'learning-from-data' approach, and includes two optimizer components that use machine learning techniques, such as unsupervised learning and statistical analysis, to uncover patterns of input attributes that lead to good output responses. These patterns are used to support the decision-making process while generating new, and better, history matched solutions. The proposed framework is applied to a benchmark model (UNISIM-I-H) based on the Namorado field in Brazil. Results show the potential the dynamic decision-making optimization framework has for improving the quality of history matching solutions using a substantial smaller number of simulations when compared with a previous work on the same benchmark.

  1. Matching Instruction to Children's Thinking about Division.

    Science.gov (United States)

    Weiland, Linnea

    1985-01-01

    Provides examples which suggest the importance of giving children opportunities to create their own arguments and of allowing them the opportunity to verbalize these arguments in clinical interviews. Also indicates that if time is spent interviewing children individually, instruction can be matched to the way they think. (JN)

  2. Decentralized trade with bargaining and voluntary matching

    DEFF Research Database (Denmark)

    Tranæs, Torben; Sloth, Birgitte; Hendon, Ebbe

    1994-01-01

    Rubinstein and Wolinsky (1990) study a market with one seller, two buyers, and voluntary matching. Both the competitive outcomepc and the bilateral bargaining outcomepb are possible in subgame perfect equilibrium. We consider two variations. First, if there is a cost larger thanpc−pc to the seller...

  3. Performance Evaluation of Tree Object Matching

    DEFF Research Database (Denmark)

    Somchaipeng, Kerawit; Sporring, Jon; Kreiborg, Sven;

    2005-01-01

    Multi-Scale Singularity Trees (MSSTs) represents the deep structure of images in scale-space and provide both the connections between image features at different scales and their strengths. In this report we present and evaluate an algorithm that exploits the MSSTs for image matching. Two version...

  4. Mix 'n' match

    Energy Technology Data Exchange (ETDEWEB)

    Ross, P.D.

    1985-04-01

    This paper discusses the service department as a marketing organization, using the concept of marketing mix as the main tool of analysis. Sections about other market related items such as competition, customer retention, database and market research are discussed. The paper shows how, in an increasingly aware way, the department is finding the right marketing mix to match the needs of the customer.

  5. Matching Expectations for Successful University Student Volunteering

    Science.gov (United States)

    Paull, Megan; Omari, Maryam; MacCallum, Judith; Young, Susan; Walker, Gabrielle; Holmes, Kirsten; Haski-Leventha, Debbie; Scott, Rowena

    2017-01-01

    Purpose: The purpose of this paper is to demonstrate the importance of expectation formation and matching for university student volunteers and their hosts. Design/methodology/approach: This research involved a multi-stage data collection process including interviews with student volunteers, and university and host representatives from six…

  6. Asynchronous event-based binocular stereo matching.

    Science.gov (United States)

    Rogister, Paul; Benosman, Ryad; Ieng, Sio-Hoi; Lichtsteiner, Patrick; Delbruck, Tobi

    2012-02-01

    We present a novel event-based stereo matching algorithm that exploits the asynchronous visual events from a pair of silicon retinas. Unlike conventional frame-based cameras, recent artificial retinas transmit their outputs as a continuous stream of asynchronous temporal events, in a manner similar to the output cells of the biological retina. Our algorithm uses the timing information carried by this representation in addressing the stereo-matching problem on moving objects. Using the high temporal resolution of the acquired data stream for the dynamic vision sensor, we show that matching on the timing of the visual events provides a new solution to the real-time computation of 3-D objects when combined with geometric constraints using the distance to the epipolar lines. The proposed algorithm is able to filter out incorrect matches and to accurately reconstruct the depth of moving objects despite the low spatial resolution of the sensor. This brief sets up the principles for further event-based vision processing and demonstrates the importance of dynamic information and spike timing in processing asynchronous streams of visual events.

  7. Minimal Mimicry: Mere Effector Matching Induces Preference

    Science.gov (United States)

    Sparenberg, Peggy; Topolinski, Sascha; Springer, Anne; Prinz, Wolfgang

    2012-01-01

    Both mimicking and being mimicked induces preference for a target. The present experiments investigate the minimal sufficient conditions for this mimicry-preference link to occur. We argue that mere effector matching between one's own and the other person's movement is sufficient to induce preference, independent of which movement is actually…

  8. History Matching: Towards Geologically Reasonable Models

    DEFF Research Database (Denmark)

    Melnikova, Yulia; Cordua, Knud Skou; Mosegaard, Klaus

    This work focuses on the development of a new method for history matching problem that through a deterministic search finds a geologically feasible solution. Complex geology is taken into account evaluating multiple point statistics from earth model prototypes - training images. Further a functio...

  9. The Effectiveness of Advertising Matching Purchase Motivation

    NARCIS (Netherlands)

    J. Loef; G. Antonides (Gerrit); W.F. van Raaij (Fred)

    2001-01-01

    textabstractSeveral authors have proposed frameworks to help advertisers predict and plan advertising effectiveness. Rossiter and Percy's advertising grid (1997) recommends that the ad appeal should match the purchase motivation or attitude base. They suggest that for utilitarian brands informationa

  10. Impedance-matched drilling telemetry system

    Science.gov (United States)

    Normann, Randy A.; Mansure, Arthur J.

    2008-04-22

    A downhole telemetry system that uses inductance or capacitance as a mode through which signal is communicated across joints between assembled lengths of pipe wherein efficiency of signal propagation through a drill string, for example, over multiple successive pipe segments is enhanced through matching impedances associated with the various telemetry system components.

  11. Making better partner matches in brand alliances

    NARCIS (Netherlands)

    B. van den Bergh (Bram)

    2014-01-01

    markdownabstract__Abstract__ With many brand alliances failing to add value, understanding the factors that make for a strong pairing becomes essential. Appropriately, harnessing techniques similar to those used by dating sites to determine whether people will make a good match has helped reveal th

  12. Oscillating Rim Hook Tableaux and Colored Matchings

    CERN Document Server

    Chen, William Y C

    2011-01-01

    Motivated by the question of finding a type B analogue of the bijection between oscillating tableaux and matchings, we find a correspondence between oscillating m-rim hook tableaux and m-colored matchings, where m is a positive integer. An oscillating m-rim hook tableau is defined as a sequence $(\\lambda^0,\\lambda^1,...,\\lambda^{2n})$ of Young diagrams starting with the empty shape and ending with the empty shape such that $\\lambda^{i}$ is obtained from $\\lambda^{i-1}$ by adding an m-rim hook or by deleting an m-rim hook. Our bijection relies on the generalized Schensted algorithm due to White. An oscillating 2-rim hook tableau is also called an oscillating domino tableau. When we restrict our attention to two column oscillating domino tableaux of length 2n, we are led to a bijection between such tableaux and noncrossing 2-colored matchings on $\\{1, 2,..., 2n\\}$, which are counted by the product $C_nC_{n+1}$ of two consecutive Catalan numbers. A 2-colored matching is noncrossing if there are no two arcs of th...

  13. Matching in an Undisturbed Natural Human Environment

    Science.gov (United States)

    McDowell, J. J.; Caron, Marcia L.

    2010-01-01

    Data from the Oregon Youth Study, consisting of the verbal behavior of 210 adolescent boys determined to be at risk for delinquency (targets) and 210 of their friends (peers), were analyzed for their conformance to the complete family of matching theory equations in light of recent findings from the basic science, and using recently developed…

  14. Regular Expression Matching and Operational Semantics

    Directory of Open Access Journals (Sweden)

    Asiri Rathnayake

    2011-08-01

    Full Text Available Many programming languages and tools, ranging from grep to the Java String library, contain regular expression matchers. Rather than first translating a regular expression into a deterministic finite automaton, such implementations typically match the regular expression on the fly. Thus they can be seen as virtual machines interpreting the regular expression much as if it were a program with some non-deterministic constructs such as the Kleene star. We formalize this implementation technique for regular expression matching using operational semantics. Specifically, we derive a series of abstract machines, moving from the abstract definition of matching to increasingly realistic machines. First a continuation is added to the operational semantics to describe what remains to be matched after the current expression. Next, we represent the expression as a data structure using pointers, which enables redundant searches to be eliminated via testing for pointer equality. From there, we arrive both at Thompson's lockstep construction and a machine that performs some operations in parallel, suitable for implementation on a large number of cores, such as a GPU. We formalize the parallel machine using process algebra and report some preliminary experiments with an implementation on a graphics processor using CUDA.

  15. 45 CFR 1301.20 - Matching requirements.

    Science.gov (United States)

    2010-10-01

    ... Public Welfare Regulations Relating to Public Welfare (Continued) OFFICE OF HUMAN DEVELOPMENT SERVICES, DEPARTMENT OF HEALTH AND HUMAN SERVICES THE ADMINISTRATION FOR CHILDREN, YOUTH AND FAMILIES, HEAD START PROGRAM HEAD START GRANTS ADMINISTRATION Federal Financial Assistance § 1301.20 Matching requirements. (a...

  16. Dual Butterfly Match Filter VLSI Design

    Institute of Scientific and Technical Information of China (English)

    LIU Zhenyu; HAN Yueqiu

    2001-01-01

    Match filter is widely used in realtime signal processing, especially in Radar Signal Processing. This paper provides a novel ASIC design,which not only saves resource, but also improves thethroughput of the system. This ASIC is specially designed for Radar Pulse Compression. Certainly it canalso be used in other circumstances, such as FIR filter.

  17. Predictive mean matching imputation of semicontinuous variables

    NARCIS (Netherlands)

    Vink, G.; Frank, L.E.; Pannekoek, J.; Buuren, S. van

    2014-01-01

    Multiple imputation methods properly account for the uncertainty of missing data. One of those methods for creating multiple imputations is predictive mean matching (PMM), a general purpose method. Little is known about the performance of PMM in imputing non-normal semicontinuous data (skewed data w

  18. Secure matching of Dutch car license plates

    NARCIS (Netherlands)

    Sunil, A.B.; Erkiny, Z.; Veugenyz, T.

    2016-01-01

    License plate matching plays an important role in applications like law enforcement, traffic management and road pricing, where the plate is first recognized and then compared to a database of authorized vehicle registration plates. Unfortunately, there are several privacy related issues that should

  19. Revisiting the Concept of "Style Match"

    Science.gov (United States)

    Zhang, Li-fang; Sternberg, Robert J.; Fan, Jieqiong

    2013-01-01

    Background: Intellectual style, an encompassing term for such constructs as learning style, teaching style, teaching approach, and thinking style, refers to one's preferred way of processing information. For the past several decades, whether or not there is a need for a match between teachers' teaching styles and students' learning styles has been…

  20. A question of matching rather than scheduling

    NARCIS (Netherlands)

    van de Velde, S.L.

    1995-01-01

    Proper scheduling maintenance for Air Force C-130 aircraft involves the prevention of mismatches concerning the availability of the aircraft and a new wing kit which would prolong its use. Scheduling maintenance problems include the designation of wing kits in the production sequence to match for a

  1. The Complexity of Approximately Counting Stable Matchings

    CERN Document Server

    Chebolu, Prasad; Martin, Russell

    2010-01-01

    We investigate the complexity of approximately counting stable matchings in the $k$-attribute model, where the preference lists are determined by dot products of "preference vectors" with "attribute vectors", or by Euclidean distances between "preference points" and "attribute points". Irving and Leather proved that counting the number of stable matchings in the general case is $#P$-complete. Counting the number of stable matchings is reducible to counting the number of downsets in a (related) partial order and is interreducible, in an approximation-preserving sense, to a class of problems that includes counting the number of independent sets in a bipartite graph ($#BIS$). It is conjectured that no FPRAS exists for this class of problems. We show this approximation-preserving interreducibilty remains even in the restricted $k$-attribute setting when $k \\geq 3$ (dot products) or $k \\geq 2$ (Euclidean distances). Finally, we show it is easy to count the number of stable matchings in the 1-attribute dot-product ...

  2. Making better partner matches in brand alliances

    NARCIS (Netherlands)

    B. van den Bergh (Bram)

    2014-01-01

    markdownabstract__Abstract__ With many brand alliances failing to add value, understanding the factors that make for a strong pairing becomes essential. Appropriately, harnessing techniques similar to those used by dating sites to determine whether people will make a good match has helped reveal th

  3. Language style matching and police interrogation outcomes

    NARCIS (Netherlands)

    Richardson, Beth H.; Taylor, Paul J.; Snook, Brent; Conchie, Stacey M.; Bennell, Craig

    2014-01-01

    This research examined the coordination of interrogator and suspects’ verbal behavior in interrogations. Sixty-four police interrogations were examined at the aggregate and utterance level using a measure of verbal mimicry known as Language Style Matching. Analyses revealed an interaction between co

  4. Nonlinear soliton matching between optical fibers

    DEFF Research Database (Denmark)

    Agger, Christian; Sørensen, Simon Toft; Thomsen, Carsten L.

    2011-01-01

    In this Letter, we propose a generic nonlinear coupling coefficient, η2 NL ¼ ηjγ=β2jfiber2=jγ=β2jfiber1, which gives a quantitative measure for the efficiency of nonlinear matching of optical fibers by describing how a fundamental soliton couples from one fiber into another. Specifically, we use η...

  5. Adaptive and compressive matched field processing.

    Science.gov (United States)

    Gemba, Kay L; Hodgkiss, William S; Gerstoft, Peter

    2017-01-01

    Matched field processing is a generalized beamforming method that matches received array data to a dictionary of replica vectors in order to locate one or more sources. Its solution set is sparse since there are considerably fewer sources than replicas. Using compressive sensing (CS) implemented using basis pursuit, the matched field problem is reformulated as an underdetermined, convex optimization problem. CS estimates the unknown source amplitudes using the replica dictionary to best explain the data, subject to a row-sparsity constraint. This constraint selects the best matching replicas within the dictionary when using multiple observations and/or frequencies. For a single source, theory and simulations show that the performance of CS and the Bartlett processor are equivalent for any number of snapshots. Contrary to most adaptive processors, CS also can accommodate coherent sources. For a single and multiple incoherent sources, simulations indicate that CS offers modest localization performance improvement over the adaptive white noise constraint processor. SWellEx-96 experiment data results show comparable performance for both processors when localizing a weaker source in the presence of a stronger source. Moreover, CS often displays less ambiguity, demonstrating it is robust to data-replica mismatch.

  6. A Fast Generic Sequence Matching Algorithm

    CERN Document Server

    Musser, David R

    2008-01-01

    A string matching -- and more generally, sequence matching -- algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of comparisons (2n), and sublinear average-case behavior that is better than that of the fastest versions of the Boyer-Moore algorithm. The algorithm retains its efficiency advantages in a wide variety of sequence matching problems of practical interest, including traditional string matching; large-alphabet problems (as in Unicode strings); and small-alphabet, long-pattern problems (as in DNA searches). Since it is expressed as a generic algorithm for searching in sequences over an arbitrary type T, it is well suited for use in generic software libraries such as the C++ Standard Template Library. The algorithm was obtained by adding to the Knuth-Morris-Pratt algorithm one of the pattern-shifting techniques from the Boyer-Moore algorithm, with provision for use of hashing in this technique. In situations in which a hash function or random a...

  7. Impedance matching between ventricle and load.

    Science.gov (United States)

    Piene, H

    1984-01-01

    Impedance matching in the cardiovascular system is discussed in light of two models of ventricle and load: a Thevenin equivalent consisting of a hydromotive pressure source and an internal, source resistance and compliance in parallel; and a time-varying compliance filled from a constant pressure source and ejecting into a load of three components, a central resistor, a compliance, and a peripheral resistance. According to the Thevenin analog, the energy source and the load are matched when the load resistance is T/t times the internal source resistance (T is total cycle length, t is systolic time interval). Both from this model and from the variable compliance model it appears that optimum matching between source and load depends on the compliance of the Windkessel, as low compliance shifts the matching load resistance to a low value. Animal experiments (isolated cat hearts) indicated that both left and right ventricles at normal loads work close to their maxima of output hydraulic power, and, according to experiments in the right ventricle, maximum power output is related to load resistance and compliance as predicted by the above models. From an experimentally determined relationship among instantaneous ventricular pressure and volume (right ventricle of isolated cat hearts), an optimum load impedance was calculated on the basis of the assumption that the ratio between stroke work and static, potential energy developed in the ventricular cavity is maximum. The optimum load impedance found by this procedure closely resembles the normal input impedance of the cat lung vessel bed.

  8. Occupational Curricula: The School/Job Match

    Science.gov (United States)

    Cohen, Lee; West, Leonard J.

    1978-01-01

    Substantial gaps often exist between occupational education and actual job duties, dominantly because of technological developments. The schools' response to needed change in curricula has been sluggish, piecemeal, and tardy. Authors suggest a strategy for accomplishing a closer match between school and work, and they illustrate its use in…

  9. Accuracy and robustness evaluation in stereo matching

    Science.gov (United States)

    Nguyen, Duc M.; Hanca, Jan; Lu, Shao-Ping; Schelkens, Peter; Munteanu, Adrian

    2016-09-01

    Stereo matching has received a lot of attention from the computer vision community, thanks to its wide range of applications. Despite of the large variety of algorithms that have been proposed so far, it is not trivial to select suitable algorithms for the construction of practical systems. One of the main problems is that many algorithms lack sufficient robustness when employed in various operational conditions. This problem is due to the fact that most of the proposed methods in the literature are usually tested and tuned to perform well on one specific dataset. To alleviate this problem, an extensive evaluation in terms of accuracy and robustness of state-of-the-art stereo matching algorithms is presented. Three datasets (Middlebury, KITTI, and MPEG FTV) representing different operational conditions are employed. Based on the analysis, improvements over existing algorithms have been proposed. The experimental results show that our improved versions of cross-based and cost volume filtering algorithms outperform the original versions with large margins on Middlebury and KITTI datasets. In addition, the latter of the two proposed algorithms ranks itself among the best local stereo matching approaches on the KITTI benchmark. Under evaluations using specific settings for depth-image-based-rendering applications, our improved belief propagation algorithm is less complex than MPEG's FTV depth estimation reference software (DERS), while yielding similar depth estimation performance. Finally, several conclusions on stereo matching algorithms are also presented.

  10. Revisiting the Concept of "Style Match"

    Science.gov (United States)

    Zhang, Li-fang; Sternberg, Robert J.; Fan, Jieqiong

    2013-01-01

    Background: Intellectual style, an encompassing term for such constructs as learning style, teaching style, teaching approach, and thinking style, refers to one's preferred way of processing information. For the past several decades, whether or not there is a need for a match between teachers' teaching styles and students' learning styles has been…

  11. History Matching in Parallel Computational Environments

    Energy Technology Data Exchange (ETDEWEB)

    Steven Bryant; Sanjay Srinivasan; Alvaro Barrera; Sharad Yadav

    2004-08-31

    In the probabilistic approach for history matching, the information from the dynamic data is merged with the prior geologic information in order to generate permeability models consistent with the observed dynamic data as well as the prior geology. The relationship between dynamic response data and reservoir attributes may vary in different regions of the reservoir due to spatial variations in reservoir attributes, fluid properties, well configuration, flow constrains on wells etc. This implies probabilistic approach should then update different regions of the reservoir in different ways. This necessitates delineation of multiple reservoir domains in order to increase the accuracy of the approach. The research focuses on a probabilistic approach to integrate dynamic data that ensures consistency between reservoir models developed from one stage to the next. The algorithm relies on efficient parameterization of the dynamic data integration problem and permits rapid assessment of the updated reservoir model at each stage. The report also outlines various domain decomposition schemes from the perspective of increasing the accuracy of probabilistic approach of history matching. Research progress in three important areas of the project are discussed: {lg_bullet}Validation and testing the probabilistic approach to incorporating production data in reservoir models. {lg_bullet}Development of a robust scheme for identifying reservoir regions that will result in a more robust parameterization of the history matching process. {lg_bullet}Testing commercial simulators for parallel capability and development of a parallel algorithm for history matching.

  12. Product Substitutability and the Matching Law

    Science.gov (United States)

    Foxall, Gordon R.; James, Victoria K.; Oliveira-Castro, Jorge M.; Ribier, Sarah

    2010-01-01

    The applicability of matching analysis, pioneered in the context of laboratory experiments, to the investigation and interpretation of consumer choice in natural environments is explored by the examination of sequential purchases of four product categories based on information from a panel of British consumers. Over a 52-week period, participants…

  13. Circular block matching based video stabilization

    Science.gov (United States)

    Xu, Lidong; Fu, Fangwen; Lin, Xinggang

    2005-07-01

    Video sequences captured by handheld digital camera need to be stabilized to eliminate the tiresome effects caused by camera"s undesirable shake or jiggle. The key issue of video stabilization is to estimate the global motion parameters between two successive frames. In this paper, a novel circular block matching algorithm is proposed to estimate the global motion parameters. This algorithm can deal with not only translational motion but even large rotational motion. For an appointed circular block in current frame, a four-dimensional rotation invariant feature vector is firstly extracted from it and used to judge if it is an effective block. Then the rotation invariant features based circular block matching process is performed to find the best matching blocks in reference frame for those effective blocks. With the matching results of any two effective blocks, a two-dimensional motion model is constructed to produce one group of frame motion parameters. A statistical method is proposed to calculate the estimated global motion parameters with all groups of global motion parameters. Finally, using the estimated motion parameters as the initial values, an iteration algorithm is introduced to obtain the refined global motion parameters. The experimental results show that the proposed algorithm is excellent in stabilizing frames with even burst global translational and rotational motions.

  14. Generating a Pattern Matching Compiler by Partial Evaluation

    DEFF Research Database (Denmark)

    Jørgensen, Knud Jesper

    1991-01-01

    Datalogi, partial Evaluation, Compiling, denotational Semantics, Pattern Matching, Semantic directed Compiler Generation......Datalogi, partial Evaluation, Compiling, denotational Semantics, Pattern Matching, Semantic directed Compiler Generation...

  15. Optimal affine-invariant matching: performance characterization

    Science.gov (United States)

    Costa, Mauro S.; Haralick, Robert M.; Shapiro, Linda G.

    1992-04-01

    The geometric hashing scheme proposed by Lamdan and Wolfson can be very efficient in a model-based matching system, not only in terms of the computational complexity involved, but also in terms of the simplicity of the method. In a recent paper, we discussed errors that can occur with this method due to quantization, stability, symmetry, and noise problems. These errors make the original geometric hashing technique unsuitable for use on the factory floor. Beginning with an explicit noise model, which the original Lamdan and Wolfson technique lacks, we derived an optimal approach that overcomes these problems. We showed that the results obtained with the new algorithm are clearly better than the results from the original method. This paper addresses the performance characterization of the geometric hashing technique, more specifically the affine-invariant point matching, applied to the problem of recognizing and determining the pose of sheet metal parts. The experiments indicate that with a model having 10 to 14 points, with 2 points of the model undetected and 10 extraneous points detected, and with the model points perturbed by Gaussian noise of standard deviation 3 (0.58 of range), the average amount of computation required to obtain an answer is equivalent to trying 11 of the possible three-point bases. The misdetection rate, measured by the percentage of correct bases matches that fail to verify, is 0.9. The percentage of incorrect bases that successfully produced a match that did verify (false alarm rate) is 13. And, finally, 2 of the experiments failed to find a correct match and verify it. Results for experiments with real images are also presented.

  16. Associations between mental disorders and subsequent onset of hypertension

    NARCIS (Netherlands)

    Stein, Dan J.; Aguilar-Gaxiola, Sergio; Alonso, Jordi; Bruffaerts, Ronny; de Jonge, Peter; Liu, Zharoui; Caldas-de-Almeida, Jose Miguel; O'Neill, Siobhan; Viana, Maria Carmen; Al-Hamzawi, Ali Obaid; Angermeyer, Mattias C.; Benjet, Corina; de Graaf, Ron; Ferry, Finola; Kovess-Masfety, Viviane; Levinson, Daphna; de Girolamo, Giovanni; Florescu, Silvia; Hu, Chiyi; Kawakami, Norito; Haro, Josep Maria; Piazza, Marina; Posada-Villa, Jose; Wojtyniak, Bogdan J.; Xavier, Miguel; Lim, Carmen C. W.; Kessler, Ronald C.; Scott, Kate M.

    2014-01-01

    Background: Previous work has suggested significant associations between various psychological symptoms (e. g., depression, anxiety, anger, alcohol abuse) and hypertension. However, the presence and extent of associations between common mental disorders and subsequent adult onset of hypertension rem

  17. Associations between mental disorders and subsequent onset of hypertension

    NARCIS (Netherlands)

    Stein, Dan J.; Aguilar-Gaxiola, Sergio; Alonso, Jordi; Bruffaerts, Ronny; de Jonge, Peter; Liu, Zharoui; Caldas-de-Almeida, Jose Miguel; O'Neill, Siobhan; Viana, Maria Carmen; Al-Hamzawi, Ali Obaid; Angermeyer, Mattias C.; Benjet, Corina; de Graaf, Ron; Ferry, Finola; Kovess-Masfety, Viviane; Levinson, Daphna; de Girolamo, Giovanni; Florescu, Silvia; Hu, Chiyi; Kawakami, Norito; Haro, Josep Maria; Piazza, Marina; Posada-Villa, Jose; Wojtyniak, Bogdan J.; Xavier, Miguel; Lim, Carmen C. W.; Kessler, Ronald C.; Scott, Kate M.

    2014-01-01

    Background: Previous work has suggested significant associations between various psychological symptoms (e. g., depression, anxiety, anger, alcohol abuse) and hypertension. However, the presence and extent of associations between common mental disorders and subsequent adult onset of hypertension

  18. 12 CFR 226.20 - Subsequent disclosure requirements.

    Science.gov (United States)

    2010-01-01

    ... RESERVE SYSTEM TRUTH IN LENDING (REGULATION Z) Closed-End Credit § 226.20 Subsequent disclosure... premiums for continuation of insurance of the types described in § 226.4(d). (5) The renewal of...

  19. Proprioceptive acuity assessment via joint position matching: from basic science to general practice.

    Science.gov (United States)

    Goble, Daniel J

    2010-08-01

    Over the past several decades, studies of use-dependent plasticity have demonstrated a critical role for proprioceptive feedback in the reorganization, and subsequent recovery, of neuromotor systems. As such, an increasing emphasis has been placed on tests of proprioceptive acuity in both the clinic and the laboratory. One test that has garnered particular interest is joint position matching, whereby individuals must replicate a reference joint angle in the absence of vision (ie, using proprioceptive information). On the surface, this test might seem straightforward in nature. However, the present perspective article informs therapists and researchers alike of multiple insights gained from a recent series of position matching studies by the author and colleagues. In particular, 5 factors are outlined that can assist clinicians in developing well-informed opinions regarding the outcomes of tests of position matching abilities. This information should allow for enhanced diagnosis of proprioceptive deficits within clinical settings in the future.

  20. Processing fluency hinders subsequent recollection: An electrophysiological study

    Directory of Open Access Journals (Sweden)

    Bingbing eLi

    2015-06-01

    Full Text Available Although many behavioural studies have investigated the effect of processing fluency on subsequent recognition memory, little research has examined the neural mechanism of this phenomenon. The present study aimed to explore the electrophysiological correlates of the effects of processing fluency on subsequent recognition memory by using an event-related potential (ERP approach. The masked repetition priming paradigm was used to manipulate processing fluency in the study phase, and the R/K paradigm was utilised to investigate which recognition memory process (familiarity or recollection was affected by processing fluency in the test phase. Converging behavioural and ERP results indicated that increased processing fluency impaired subsequent recollection. Results from the analysis of ERP priming effects in the study phase indicated that increased perceptual processing fluency of object features, reflected by the N/P 190 priming effect, can hinder encoding activities, reflected by the LPC priming effect, which leads to worse subsequent recollection based recognition memory. These results support the idea that processing fluency can influence subsequent recognition memory and provide a potential neural mechanism underlying this effect. However, further studies are needed to examine whether processing fluency can affect subsequent familiarity.

  1. Effect of drawbead on forming performance of subsequent sheet

    Institute of Scientific and Technical Information of China (English)

    李群; 郭宝峰; 金淼; 孙成丽

    2008-01-01

    In order to research the plastic performance of sheet going through the drawbead and the simple tensile test of sheet, the influence of drawbead structure parameters on sheet performance and the subsequent performance of the sheet were performed to investigate the residual deformation characteristics of the sheet through different drawbead structures, and also the influences of drawbead structures and geometry parameters on pre-deformation and subsequent forming characters of sheet were analyzed. The results show that the pre-deformation decreases with the increase of the round corner radius, the pre-deformation increase with the increase of the height of drawbead, and the subsequent forming characteristics of sheet going through drawbead are remarkably different from undeformed sheet and these differences heavily depend on the pre-deformation. With the increases of pre-deformation, the yield ratio increases, but the subsequent elongation exponential decreases. These means deformability of the sheet is significantly reduced. As the structure of drawbead changes, the mechanical characteristics of material in different cyclic loading conditions also change. For the BUFDE+Z deep drawing steel sheet, the subsequent performance of the sheet is hardened when the pre-deformation is greater than 0.044. For the DC52D+ZF hot-galvanize steel sheet, the subsequent performance of the sheet begins to harden when the pre-deformation is greater than 0.079, and it presents that the pre-deformation is not bigger than 0.052.

  2. The influence of children's pain memories on subsequent pain experience.

    Science.gov (United States)

    Noel, Melanie; Chambers, Christine T; McGrath, Patrick J; Klein, Raymond M; Stewart, Sherry H

    2012-08-01

    Healthy children are often required to repeatedly undergo painful medical procedures (eg, immunizations). Although memory is often implicated in children's reactions to future pain, there is a dearth of research directly examining the relationship between the 2. The current study investigated the influence of children's memories for a novel pain stimulus on their subsequent pain experience. One hundred ten healthy children (60 boys) between the ages of 8 and 12 years completed a laboratory pain task and provided pain ratings. Two weeks later, children provided pain ratings based on their memories as well as their expectancies about future pain. One month following the initial laboratory visit, children again completed the pain task and provided pain ratings. Results showed that children's memory of pain intensity was a better predictor of subsequent pain reporting than their actual initial reporting of pain intensity, and mediated the relationship between initial and subsequent pain reporting. Children who had negatively estimated pain memories developed expectations of greater pain prior to a subsequent pain experience and showed greater increases in pain ratings over time than children who had accurate or positively estimated pain memories. These findings highlight the influence of pain memories on healthy children's expectations of future pain and subsequent pain experiences and extend predictive models of subsequent pain reporting.

  3. Systems and methods for measuring component matching

    Science.gov (United States)

    Courter, Kelly J. (Inventor); Slenk, Joel E. (Inventor)

    2006-01-01

    Systems and methods for measuring a contour match between adjacent components are disclosed. In one embodiment, at least two pressure sensors are located between adjacent components. Each pressure sensor is adapted to obtain a pressure measurement at a location a predetermined distance away from the other pressure sensors, and to output a pressure measurement for each sensor location. An output device is adapted to receive the pressure measurements from at least two pressure sensors and display the pressure measurements. In one aspect, the pressure sensors include flexible thin film pressure sensors. In accordance with other aspects of the invention, a method is provided for measuring a contour match between two interfacing components including measuring at least one pressure applied to at least one sensor between the interfacing components.

  4. Improving Schema Matching with Linked Data

    CERN Document Server

    Assaf, Ahmad; Senart, Aline; Follenfant, Corentin; Troncy, Raphaël; Trastour, David

    2012-01-01

    With today's public data sets containing billions of data items, more and more companies are looking to integrate external data with their traditional enterprise data to improve business intelligence analysis. These distributed data sources however exhibit heterogeneous data formats and terminologies and may contain noisy data. In this paper, we present a novel framework that enables business users to semi-automatically perform data integration on potentially noisy tabular data. This framework offers an extension to Google Refine with novel schema matching algorithms leveraging Freebase rich types. First experiments show that using Linked Data to map cell values with instances and column headers with types improves significantly the quality of the matching results and therefore should lead to more informed decisions.

  5. Refraction and wave matching in hyperbolic thermoelasticity

    Directory of Open Access Journals (Sweden)

    Józef Rafa

    2015-03-01

    Full Text Available The subject of the publication concerns the propagation of thermoelastic waves with a particular emphasis on the refraction of waves at the boundary of a layer laying (resting on a halfspace. Analogously to the effect of wave matching, which appears in the case of acoustic and electromagnetic waves, the impedance of a thermoelastic wave has been introduced and its influence and the reflection andrefraction on the boundary at media has been investigated. The model of the medium describes a mutual coupling of mechanical and thermalinteractions with a wave type propagation of heat in media taken into account.[b]Keywords[/b]: hyperbolic thermoelasticity, wave impedance of a thermoelastic medium,refraction and wave matching

  6. Passport officers' errors in face matching.

    Directory of Open Access Journals (Sweden)

    David White

    Full Text Available Photo-ID is widely used in security settings, despite research showing that viewers find it very difficult to match unfamiliar faces. Here we test participants with specialist experience and training in the task: passport-issuing officers. First, we ask officers to compare photos to live ID-card bearers, and observe high error rates, including 14% false acceptance of 'fraudulent' photos. Second, we compare passport officers with a set of student participants, and find equally poor levels of accuracy in both groups. Finally, we observe that passport officers show no performance advantage over the general population on a standardised face-matching task. Across all tasks, we observe very large individual differences: while average performance of passport staff was poor, some officers performed very accurately--though this was not related to length of experience or training. We propose that improvements in security could be made by emphasising personnel selection.

  7. Rotation Invariant Matching of Partial Shoeprints

    Directory of Open Access Journals (Sweden)

    Khan Mahmood Ahmed

    2014-09-01

    Full Text Available In this paper, we propose a solution for the problem of rotated partial shoeprints retrieval based on the combined use of local points of interest and SIFT descriptor. Once the generated features are encoded using SIFT descriptor, matching is carried out using RANSAC to estimate a transformation model and establish the number of its inliers which is then multiplied by the sum of point-to-point Euclidean distances below a hard threshold. We demonstrate that such combination can overcome the issue of retrieval of partial prints in the presence of rotation and noise distortions. Conducted experiments have shown that the proposed solution achieves very good matching results and outperforms similar work in the literature both in terms of performances and complexity

  8. FINGERPRINT MATCHING BASED ON PORE CENTROIDS

    Directory of Open Access Journals (Sweden)

    S. Malathi

    2011-05-01

    Full Text Available In recent years there has been exponential growth in the use of bio- metrics for user authentication applications. Automated Fingerprint Identification systems have become popular tool in many security and law enforcement applications. Most of these systems rely on minutiae (ridge ending and bifurcation features. With the advancement in sensor technology, high resolution fingerprint images (1000 dpi pro- vide micro level of features (pores that have proven to be useful fea- tures for identification. In this paper, we propose a new strategy for fingerprint matching based on pores by reliably extracting the pore features The extraction of pores is done by Marker Controlled Wa- tershed segmentation method and the centroids of each pore are con- sidered as feature vectors for matching of two fingerprint images. Experimental results shows that the proposed method has better per- formance with lower false rates and higher accuracy.

  9. Nearest Neighbour Corner Points Matching Detection Algorithm

    Directory of Open Access Journals (Sweden)

    Zhang Changlong

    2015-01-01

    Full Text Available Accurate detection towards the corners plays an important part in camera calibration. To deal with the instability and inaccuracies of present corner detection algorithm, the nearest neighbour corners match-ing detection algorithms was brought forward. First, it dilates the binary image of the photographed pictures, searches and reserves quadrilateral outline of the image. Second, the blocks which accord with chess-board-corners are classified into a class. If too many blocks in class, it will be deleted; if not, it will be added, and then let the midpoint of the two vertex coordinates be the rough position of corner. At last, it precisely locates the position of the corners. The Experimental results have shown that the algorithm has obvious advantages on accuracy and validity in corner detection, and it can give security for camera calibration in traffic accident measurement.

  10. Flexible Hardware-Based Stereo Matching

    Directory of Open Access Journals (Sweden)

    2009-02-01

    Full Text Available To enable adaptive stereo vision for hardware-based embedded stereo vision systems, we propose a novel technique for implementing a flexible block size, disparity range, and frame rate. By reusing existing resources of a static architecture, rather than dynamic reconfiguration, our technique is compatible with application specific integrated circuit (ASIC as well as field programmable gate array (FPGA implementations. We present the corresponding block diagrams and their implementation in our hardware-based stereo matching architecture. Furthermore, we show the impact of flexible stereo matching on the generated disparity maps for the sum of absolute differences (SADs, rank, and census transform algorithms. Finally, we discuss the resource usage and achievable performance when synthesized for an Altera Stratix II FPGA.

  11. Flexible Hardware-Based Stereo Matching

    Directory of Open Access Journals (Sweden)

    Steininger Andreas

    2008-01-01

    Full Text Available Abstract To enable adaptive stereo vision for hardware-based embedded stereo vision systems, we propose a novel technique for implementing a flexible block size, disparity range, and frame rate. By reusing existing resources of a static architecture, rather than dynamic reconfiguration, our technique is compatible with application specific integrated circuit (ASIC as well as field programmable gate array (FPGA implementations. We present the corresponding block diagrams and their implementation in our hardware-based stereo matching architecture. Furthermore, we show the impact of flexible stereo matching on the generated disparity maps for the sum of absolute differences (SADs, rank, and census transform algorithms. Finally, we discuss the resource usage and achievable performance when synthesized for an Altera Stratix II FPGA.

  12. Design Pattern Mining Using Graph Matching

    Institute of Scientific and Technical Information of China (English)

    LI Qing-hua; ZHANG Zhi-xiang; BEN Ke-rong

    2004-01-01

    The identification of design pattern instances is important for program understanding and software maintenance. Aiming at the mining of design patterns in existing systems, this paper proposes a sub-graph isomorphism approach to discover several design patterns in a legacy system at a time. The attributed relational graph is used to describe design patterns and legacy systems. The sub-graph isomorphism approach consists of decomposition and composition process. During the decomposition process, graphs corresponding to the design patterns are decomposed into sub-graphs, some of which are graphs corresponding to the elemental design patterns. The composition process tries to get sub-graph isomorphism of the matched graph if sub-graph isomorphism of each sub-graph is obtained. Due to the common structures between design patterns, the proposed approach can reduce the matching times of entities and relations. Compared with the existing methods, the proposed algorithm is not linearly dependent on the number of design pattern graphs.

  13. Optimal Feedback Communication via Posterior Matching

    CERN Document Server

    Shayevitz, Ofer

    2009-01-01

    In this paper we introduce a fundamental principle for optimal communication over general memoryless channels in the presence of noiseless feedback, termed \\textit{posterior matching}. Using this principle, we devise a (simple, sequential) generic feedback transmission scheme suitable for a large class of memoryless channels and input distributions, achieving any rate below the corresponding mutual information. This provides a unified framework for optimal feedback communication in which the Horstein scheme (BSC) and the Schalkwijk-Kailath scheme (AWGN channel) are special cases. Thus, as a corollary, we prove that the Horstein scheme indeed attains the BSC capacity, settling a longstanding conjecture. We further provide closed form expressions for the error probability of the scheme over a range of rates, and derive the achievable rates in a mismatch setting where the scheme is designed according to the wrong channel model. Finally, several illustrative examples of the posterior matching scheme for specific ...

  14. Fast Legendre moment computation for template matching

    Science.gov (United States)

    Li, Bing C.

    2017-05-01

    Normalized cross correlation (NCC) based template matching is insensitive to intensity changes and it has many applications in image processing, object detection, video tracking and pattern recognition. However, normalized cross correlation implementation is computationally expensive since it involves both correlation computation and normalization implementation. In this paper, we propose Legendre moment approach for fast normalized cross correlation implementation and show that the computational cost of this proposed approach is independent of template mask sizes which is significantly faster than traditional mask size dependent approaches, especially for large mask templates. Legendre polynomials have been widely used in solving Laplace equation in electrodynamics in spherical coordinate systems, and solving Schrodinger equation in quantum mechanics. In this paper, we extend Legendre polynomials from physics to computer vision and pattern recognition fields, and demonstrate that Legendre polynomials can help to reduce the computational cost of NCC based template matching significantly.

  15. Image Matching by Using Fuzzy Transforms

    Directory of Open Access Journals (Sweden)

    Ferdinando Di Martino

    2013-01-01

    Full Text Available We apply the concept of Fuzzy Transform (for short, F-transform for improving the results of the image matching based on the Greatest Eigen Fuzzy Set (for short, GEFS with respect to max-min composition and the Smallest Eigen Fuzzy Set (for short, SEFS with respect to min-max composition already studied in the literature. The direct F-transform of an image can be compared with the direct F-transform of a sample image to be matched and we use suitable indexes to measure the grade of similarity between the two images. We make our experiments on the image dataset extracted from the well-known Prima Project View Sphere Database, comparing the results obtained with this method with that one based on the GEFS and SEFS. Other experiments are performed on frames of videos extracted from the Ohio State University dataset.

  16. On the tautology of the matching law.

    Science.gov (United States)

    Rachlin, H

    1971-03-01

    The generalized matching law, that organisms divide their time between alternatives in proportion to the value of the reinforcement consequent on the choice, is derivable from the assumption that an organism choosing between alternatives is under no constraints except those the contingencies of reinforcement impose. Hence, the law is not subject to empirical test. Its value lies in its simple codification of assumptions underlying choice experiments.

  17. Profile Terry Young: man of the match

    CERN Multimedia

    2003-01-01

    Terry Young, chair of health systems at Brunel University, has received a grant of 3.3 million pounds from EPSRC. The money will create the Multidisciplinary Assessment of Technology Centre for Health (MATCH). The aim of the centre is to aid the progress of medical devices from concept to patient care by developing criteria to single out promising technologies and helping them to market (1 page).

  18. National Medical School Matching Program: optimizing outcomes

    Science.gov (United States)

    Eltorai, Adam EM; Daniels, Alan H

    2016-01-01

    The medical school admissions process is inefficient and costly to both applicants and medical schools. For the many rejected applicants, this process represents a costly, unproductive use of time. For medical schools, numerous applications are reviewed that ultimately do not yield matriculants, representing a substantial inefficiency. In order to streamline the process and reduce costs, we propose the development of a national medical school matching program. PMID:27445512

  19. Message passing with relaxed moment matching

    OpenAIRE

    Qi, Yuan; Guo, Yandong

    2012-01-01

    Bayesian learning is often hampered by large computational expense. As a powerful generalization of popular belief propagation, expectation propagation (EP) efficiently approximates the exact Bayesian computation. Nevertheless, EP can be sensitive to outliers and suffer from divergence for difficult cases. To address this issue, we propose a new approximate inference approach, relaxed expectation propagation (REP). It relaxes the moment matching requirement of expectation propagation by addin...

  20. Vividness Effects: A Resource-Matching Perspective.

    OpenAIRE

    Keller, Punam Anand; Block, Lauren G

    1997-01-01

    The authors present a resource-matching perspective to explain the relationship between vividness and persuasion. Three experiments confirm the predicted inverted-U relationship between resource allocation and persuasion for vivid information, and a positive linear relationship between resource allocation and persuasion for nonvivid information when vivid information is less resource demanding than nonvivid information. This persuasion pattern is reversed in experiment 4, where nonvivid infor...

  1. Longitudinal matching between SFC and SSC

    Energy Technology Data Exchange (ETDEWEB)

    Yin, Q.M.; Tang, J.Y.; Wang, S.L. [Institute of Modern Physics, China Academy of Science, Lanzhou (China)

    1998-11-01

    In order to increase the beam current and to enhance the beam quality, an upgrading program of HIRFL is going on at HIRFL. As a part of this program, the longitudinal matching between injector SFC and main machine SSC will be improved. It consists of beam energy measurement, compensation of energy loss due to stripper and a new rebuncher system. In this paper, the study results are presented. (author)

  2. Intuitionistic Fuzzy Automaton for Approximate String Matching

    Directory of Open Access Journals (Sweden)

    K.M. Ravi

    2014-03-01

    Full Text Available This paper introduces an intuitionistic fuzzy automaton model for computing the similarity between pairs of strings. The model details the possible edit operations needed to transform any input (observed string into a target (pattern string by providing a membership and non-membership value between them. In the end, an algorithm is given for approximate string matching and the proposed model computes the similarity and dissimilarity between the pair of strings leading to better approximation.

  3. Performance Evaluation of Tree Object Matching

    DEFF Research Database (Denmark)

    Somchaipeng, Kerawit; Sporring, Jon; Kreiborg, Sven

    2005-01-01

    Multi-Scale Singularity Trees (MSSTs) represents the deep structure of images in scale-space and provide both the connections between image features at different scales and their strengths. In this report we present and evaluate an algorithm that exploits the MSSTs for image matching. Two version...... database. Finally the performance is compared with algorithms based on the Scale Invariant Feature Transform (SIFT), and the Position of Catastrophes (CAT)....

  4. New multi-pattern matching algorithm

    Institute of Scientific and Technical Information of China (English)

    Liu Gongshen; Li Jianhua; Li Shenghong

    2006-01-01

    The traditional multiple pattern matching algorithm, deterministic finite state automata, is implemented by tree structure. A new algorithm is proposed by substituting sequential binary tree for traditional tree. It is proved by experiment that the algorithm has three features: its construction process is quick, its cost of memory is small. At the same time, its searching process is as quick as the traditional algorithm. The algorithm is suitable for the application which requires preprocessing the patterns dynamically.

  5. Matched Field Tomographic Inversion for Geoacoustic Properties

    Science.gov (United States)

    2016-06-07

    covariance matrix of the sampled models, and adjusts the annealing temperature adaptively to account for parameters with different sensitivities. The method...geoacoustic properties of the ocean bottom, including sound speed profiles, densities , attenuations and sediment layer depths, have a significant effect on...sound propagation in shallow water . The long term goal of this work is to develop a new tomographic inversion method based on matched field processing of

  6. Matching point clouds: limits and possibilities.

    Science.gov (United States)

    Rudolph, H; Quaas, S; Luthardt, R G

    2002-01-01

    In computer-aided production of fixed dental restorations, the process chain always starts with digitizing, independent of the type of further (data) processing, the material used, and the kind of restoration to be produced. The quality of the digitized data, followed by the influences of further data processing and the production parameters, decisively influence the fitting accuracy of the dental restoration to be fabricated. The accuracy with which individually measured 3D data sets in the form of point clouds can be matched for further processing in one common system of coordinates was the object of the present study. Casts of the maxilla and mandible were digitized in several partial measurements comprising two to three teeth in each case, using an optical three-coordinate measuring system. The individual segments were sequentially aligned to surfaces that were created on the basis of partial point clouds. The mean deviation between surfaces and point clouds was between 1.90 microns and 18.24 microns. The accuracy of the alignment was determined by the RMS (root mean square) error, and was on average 14.2 microns (SD 7 microns) for the maxilla and 17.2 microns (SD 9.4 microns) for the mandible. Combining a larger number of smaller segments did not improve the result, since the errors of the individual registrations are summed in sequential matching. In this study, the errors arising in matching are not negligible and can possibly negatively influence the quality (fitting accuracy) of the restoration produced on the basis of the matched data records.

  7. Impedance Matched Absorptive Thermal Blocking Filters

    CERN Document Server

    Wollack, E J; Rostem, K; U-Yen, K

    2014-01-01

    We have designed, fabricated and characterized absorptive thermal blocking filters for cryogenic microwave applications. The transmission line filter's input characteristic impedance is designed to match $50\\,\\Omega$ and its response has been validated from 0-to-50\\,GHz. The observed return loss in the 0-to-20\\,GHz design band is greater than $20\\,$dB and shows graceful degradation with frequency. Design considerations and equations are provided that enable this approach to be scaled and modified for use in other applications.

  8. Design of an impedance matching acoustic bend

    OpenAIRE

    Yang, Yuzhen; Jia, Han; Lu, Wenjia; Sun, Zhaoyong; Yang, Jun

    2017-01-01

    We propose the design of an impedance matching acoustic bend in this article. The bending structure is composed of sub-wavelength unit cells with perforated plates and side pipes, whose mass density and bulk modulus can be tuned simultaneously. So the refraction index and the impedance of the acoustic bend can be modulated simultaneously to guarantee both the bending effect and the high transmission. The simulation results of sound pressure field distribution show that the bending effect of t...

  9. Labor search and matching in macroeconomics

    OpenAIRE

    2007-01-01

    The labor search and matching model plays a growing role in macroeconomic analysis. This paper provides a critical, selective survey of the literature. Four fundamental questions are explored: how are unemployment, job vacancies, and employment determined as equilibrium phenomena? What determines worker flows and transition rates from one labor market state to another? How are wages determined? What role do labor market dynamics play in explaining business cycles and growth? The survey descri...

  10. An Implementation of the Frequency Matching Method

    DEFF Research Database (Denmark)

    Lange, Katrine; Frydendall, Jan; Hansen, Thomas Mejer

    During the last decade multiple-point statistics has become in-creasingly popular as a tool for incorporating complex prior infor-mation when solving inverse problems in geosciences. A variety of methods have been proposed but often the implementation of these is not straightforward. One of these......During the last decade multiple-point statistics has become in-creasingly popular as a tool for incorporating complex prior infor-mation when solving inverse problems in geosciences. A variety of methods have been proposed but often the implementation of these is not straightforward. One...... of these methods is the recently proposed Frequency Matching method to compute the maximum a posteriori model of an inverse problem where multiple-point statistics, learned from a training image, is used to formulate a closed form expression for an a priori probability density function. This paper discusses...... aspects of the implementation of the Fre-quency Matching method and the techniques adopted to make it com-putationally feasible also for large-scale inverse problems. The source code is publicly available at GitHub and this paper also provides an example of how to apply the Frequency Matching method...

  11. One-loop effective lagrangians after matching

    Energy Technology Data Exchange (ETDEWEB)

    Aguila, F. del; Santiago, J. [Universidad de Granada, Departamento de Fisica Teorica y del Cosmos and CAFPE, Granada (Spain); Kunszt, Z. [ETH Zuerich, Institute for Theoretical Physics, Zuerich (Switzerland)

    2016-05-15

    We discuss the limitations of the covariant derivative expansion prescription advocated to compute the one-loop Standard Model (SM) effective lagrangian when the heavy fields couple linearly to the SM. In particular, one-loop contributions resulting from the exchange of both heavy and light fields must be explicitly taken into account through matching because the proposed functional approach alone does not account for them. We review a simple case with a heavy scalar singlet of charge -1 to illustrate the argument. As two other examples where this matching is needed and this functional method gives a vanishing result, up to renormalization of the heavy sector parameters, we re-evaluate the one-loop corrections to the T-parameter due to a heavy scalar triplet with vanishing hypercharge coupling to the Brout-Englert-Higgs boson and to a heavy vector-like quark singlet of charged 2/3 mixing with the top quark, respectively. In all cases we make use of a new code for matching fundamental and effective theories in models with arbitrary heavy field additions. (orig.)

  12. Effective anisotropy through traveltime and amplitude matching

    KAUST Repository

    Wang, Hui

    2014-08-05

    Introducing anisotropy to seismic wave propagation reveals more realistic physics of our Earth\\'s subsurface as compared to the isotropic assumption. However wavefield modeling, the engine of seismic inverse problems, in anisotropic media still suffers from computational burdens, in particular with complex anisotropy such as transversely isotropic (TI) and Orthorhombic anisotropy. We develop effective isotropic velocity and density models to package the effects of anisotropy such that the wave propagation behavior using these effective models approximate those of the original anisotropic model. We build these effective models through the high frequency asymptotic approximation based on the eikonal and transport equations. We match the geometrical behavior of the wave-fields, given by traveltimes, from the anisotropic and isotropic eikonal equations. This matching yields the effective isotropic velocity that approximates the kinematics of the anisotropic wavefield. Equivalently, we calculate the effective densities by equating the anisotropic and isotropic transport equations. The effective velocities and densities are then fed into the isotropic acoustic variable density wave equation to obtain cheaper anisotropic wavefields. We justify our approach by testing it on an elliptical anisotropic model. The numerical results demonstrate a good matching of both traveltime and amplitude between anisotropic and effective isotropic wavefields.

  13. Computing the Matched Filter in Linear Time

    CERN Document Server

    Fish, Alexander; Hadani, Ronny; Sayeed, Akbar; Schwartz, Oded

    2011-01-01

    A fundamental problem in wireless communication is the time-frequency shift (TFS) problem: Find the time-frequency shift of a signal in a noisy environment. The shift is the result of time asynchronization of a sender with a receiver, and of non-zero speed of a sender with respect to a receiver. A classical solution of a discrete analog of the TFS problem is called the matched filter algorithm. It uses a pseudo-random waveform S(t) of the length p, and its arithmetic complexity is O(p^{2} \\cdot log (p)), using fast Fourier transform. In these notes we introduce a novel approach of designing new waveforms that allow faster matched filter algorithm. We use techniques from group representation theory to design waveforms S(t), which enable us to introduce two fast matched filter (FMF) algorithms, called the flag algorithm, and the cross algorithm. These methods solve the TFS problem in O(p\\cdot log (p)) operations. We discuss applications of the algorithms to mobile communication, GPS, and radar.

  14. Fingerprint matching algorithm for poor quality images

    Directory of Open Access Journals (Sweden)

    Vedpal Singh

    2015-04-01

    Full Text Available The main aim of this study is to establish an efficient platform for fingerprint matching for low-quality images. Generally, fingerprint matching approaches use the minutiae points for authentication. However, it is not such a reliable authentication method for low-quality images. To overcome this problem, the current study proposes a fingerprint matching methodology based on normalised cross-correlation, which would improve the performance and reduce the miscalculations during authentication. It would decrease the computational complexities. The error rate of the proposed method is 5.4%, which is less than the two-dimensional (2D dynamic programming (DP error rate of 5.6%, while Lee's method produces 5.9% and the combined method has 6.1% error rate. Genuine accept rate at 1% false accept rate is 89.3% but at 0.1% value it is 96.7%, which is higher. The outcome of this study suggests that the proposed methodology has a low error rate with minimum computational effort as compared with existing methods such as Lee's method and 2D DP and the combined method.

  15. Space Lower Bounds for Online Pattern Matching

    CERN Document Server

    Clifford, Raphael; Porat, Ely; Sach, Benjamin

    2011-01-01

    We present space lower bounds for online pattern matching under a number of different distance measures. Given a pattern of length m and a text that arrives one character at a time, the online pattern matching problem is to report the distance between the pattern and a sliding window of the text as soon as the new character arrives. We require that the correct answer is given at each position with constant probability. We give Omega(m) bit space lower bounds for L_1, L_2, L_\\infty, Hamming, edit and swap distances as well as for any algorithm that computes the cross-correlation/convolution. We then show a dichotomy between distance functions that have wildcard-like properties and those that do not. In the former case which includes, as an example, pattern matching with character classes, we give Omega(m) bit space lower bounds. For other distance functions, we show that there exist space bounds of Omega(log m) and O(log^2 m) bits. Finally we discuss space lower bounds for non-binary inputs and show how in som...

  16. When LP is the Cure for Your Matching Woes: Approximating Stochastic Matchings

    CERN Document Server

    Bansal, Nikhil; Nagarajan, Viswanath; Rudra, Atri

    2010-01-01

    Consider a random graph model where each possible edge $e$ is present independently with some probability $p_e$. We are just given these numbers $p_e$, and want to build a large/heavy matching in the randomly generated graph. However, the only way we can find out whether an edge is present or not is to query it--and if the edge is indeed present in the graph, we are forced to add it to our matching. Further, each vertex $i$ is allowed to be queried at most $t_i$ times. How should we adaptively query the edges to maximize the expected weight of the matching? We consider several matching problems in this general framework (some of which arise in kidney exchanges and online dating, and others arise in modeling online advertisements); we give LP-rounding based constant-factor approximation algorithms for these problems.

  17. To Broad-Match or Not to Broad-Match : An Auctioneer's Dilemma ?

    CERN Document Server

    Singh, Sudhir Kumar

    2008-01-01

    We initiate the study of an interesting aspect of sponsored search advertising, namely the consequences of broad match-a feature where an ad of an advertiser can be mapped to a broader range of relevant queries, and not necessarily to the particular keyword(s) that ad is associated with. Starting with a very natural setting for strategies available to the advertisers, and via a careful look through algorithmic and complexity theoretic glasses, we first propose a solution concept called broad match equilibrium(BME) for the game originating from the strategic behavior of advertisers as they try to optimize their budget allocation across various keywords. Next, we consider two broad match scenarios based on factors such as information asymmetry between advertisers and the auctioneer, and the extent of auctioneer's control on the budget splitting. In the first scenario, the advertisers have the full information about broad match and relevant parameters, and can reapportion their own budgets to utilize the extra i...

  18. Improved electromagnetic induction processing with novel adaptive matched filter and matched subspace detection

    Science.gov (United States)

    Hayes, Charles E.; McClellan, James H.; Scott, Waymond R.; Kerr, Andrew J.

    2016-05-01

    This work introduces two advances in wide-band electromagnetic induction (EMI) processing: a novel adaptive matched filter (AMF) and matched subspace detection methods. Both advances make use of recent work with a subspace SVD approach to separating the signal, soil, and noise subspaces of the frequency measurements The proposed AMF provides a direct approach to removing the EMI self-response while improving the signal to noise ratio of the data. Unlike previous EMI adaptive downtrack filters, this new filter will not erroneously optimize the EMI soil response instead of the EMI target response because these two responses are projected into separate frequency subspaces. The EMI detection methods in this work elaborate on how the signal and noise subspaces in the frequency measurements are ideal for creating the matched subspace detection (MSD) and constant false alarm rate matched subspace detection (CFAR) metrics developed by Scharf The CFAR detection metric has been shown to be the uniformly most powerful invariant detector.

  19. Privacy‐Preserving Friend Matching Protocol approach for Pre‐match in Social Networks

    DEFF Research Database (Denmark)

    Ople, Shubhangi S.; Deshmukh, Aaradhana A.; Mihovska, Albena Dimitrova

    2016-01-01

    that a secure match can achieve at least one order of accuracy and better computational performance than the techniques that use homomorphic encryption.It can handle and tackle new characteristics and an environment for a particular application in a mobile social network....... for use in social networks due to its data sharing problems and information leakage. In this paper, we propose a novel framework for privacy–preserving profile matching. We implement both the client and server portion of the secure match and evaluate its performance network dataset. The results show......Social services make the most use of the user profile matching to help the users to discover friends with similar social attributes (e.g. interests, location, age). However, there are many privacy concerns that prevent to enable this functionality. Privacy preserving encryption is not suitable...

  20. A survey and categorization of ontology-matching cases

    NARCIS (Netherlands)

    Aleksovski, Z.; Hage, W.R. van; Isaac, A.

    2007-01-01

    Methodologies to find and evaluate solutions for ontology matching should be centered on the practical problems to be solved. In this paper we look at matching from the perspective of a practitioner in search of matching techniques or tools. We survey actual matching use cases, and derive general ca

  1. Pattern Matching, Validity, and Conceptualization in Program Evaluation,

    Science.gov (United States)

    Trochim, Wilham M. K.

    1985-01-01

    Two quasiexperimental designs--nonequivalent dependent variable and reversed treatment designs--illustrate pattern matching logic as a basis for evaluation, examining college health services. Three pattern matches are significant: (1) program pattern match indicates implementation; (2) measurement match assesses test validity; and (3) effect…

  2. Experience matters: The impact of doing versus watching on infants’ subsequent perception of tool use events

    Science.gov (United States)

    Sommerville, Jessica A.; Hildebrand, Elina A.; Crane, Catharyn C.

    2008-01-01

    Prior work suggests that active experience impacts infants’ understanding of simple actions. The present studies compared the impact of active and observational experience on infants’ ability to identify the goal of a novel tool use event. Infants received active practice and training using a cane to retrieve an out-of-reach toy, or matched observational experience, prior to taking part in a habituation paradigm that assessed infants’ ability to identify the goal of another person’s tool use acts. Active training alone facilitated 10-month-old infants’ ability to identify the goal of the tool use event. Active experience using tools may enable infants to build motor representations of tool use events that subsequently guide action perception and support action understanding. PMID:18793059

  3. Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts

    DEFF Research Database (Denmark)

    Bille, Philip; Fagerberg, Rolf; Gørtz, Inge Li

    2007-01-01

    We study the approximate string matching and regular expression matching problem for the case when the text to be searched is compressed with the Ziv-Lempel adaptive dictionary compression schemes. We present a time-space trade-off that leads to algorithms improving the previously known...... complexities for both problems. In particular, we significantly improve the space bounds. In practical applications the space is likely to be a bottleneck and therefore this is of crucial importance....

  4. Matching models of left ventricle and systemic artery

    Institute of Scientific and Technical Information of China (English)

    柳兆荣; 吴驰

    1997-01-01

    To reveal how the matching models of the left ventricle and its afterload affect the pressure and flow in the aortic root, the differences between the measured pressure and flow waveforms and those determined by three kinds of matching model were compared. The results showed that, compared with the results by both matching models 1 and 2, the pressure and flow waveforms determined by matching model 3 established in this work were in the closest agreement with the corresponding experimental waveforms, therefore indicating that matching model 3 was a matching model that closely and rationally characterized the match between the left ventricle and the systemic artery.

  5. Fast image matching algorithm based on projection characteristics

    Science.gov (United States)

    Zhou, Lijuan; Yue, Xiaobo; Zhou, Lijun

    2011-06-01

    Based on analyzing the traditional template matching algorithm, this paper identified the key factors restricting the speed of matching and put forward a brand new fast matching algorithm based on projection. Projecting the grayscale image, this algorithm converts the two-dimensional information of the image into one-dimensional one, and then matches and identifies through one-dimensional correlation, meanwhile, because of normalization has been done, when the image brightness or signal amplitude increasing in proportion, it could also perform correct matching. Experimental results show that the projection characteristics based image registration method proposed in this article could greatly improve the matching speed, which ensuring the matching accuracy as well.

  6. Local Search Approaches in Stable Matching Problems

    Directory of Open Access Journals (Sweden)

    Toby Walsh

    2013-10-01

    Full Text Available The stable marriage (SM problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools or, more generally, to any two-sided market. In the classical formulation, n men and n women express their preferences (via a strict total order over the members of the other sex. Solving an SM problem means finding a stable marriage where stability is an envy-free notion: no man and woman who are not married to each other would both prefer each other to their partners or to being single. We consider both the classical stable marriage problem and one of its useful variations (denoted SMTI (Stable Marriage with Ties and Incomplete lists where the men and women express their preferences in the form of an incomplete preference list with ties over a subset of the members of the other sex. Matchings are permitted only with people who appear in these preference lists, and we try to find a stable matching that marries as many people as possible. Whilst the SM problem is polynomial to solve, the SMTI problem is NP-hard. We propose to tackle both problems via a local search approach, which exploits properties of the problems to reduce the size of the neighborhood and to make local moves efficiently. We empirically evaluate our algorithm for SM problems by measuring its runtime behavior and its ability to sample the lattice of all possible stable marriages. We evaluate our algorithm for SMTI problems in terms of both its runtime behavior and its ability to find a maximum cardinality stable marriage. Experimental results suggest that for SM problems, the number of steps of our algorithm grows only as O(n log(n, and that it samples very well the set of all stable marriages. It is thus a fair and efficient approach to generate stable marriages. Furthermore, our approach for SMTI problems is able to solve large problems, quickly returning stable matchings of large and often optimal size, despite the

  7. History Matching in Parallel Computational Environments

    Energy Technology Data Exchange (ETDEWEB)

    Steven Bryant; Sanjay Srinivasan; Alvaro Barrera; Sharad Yadav

    2005-10-01

    A novel methodology for delineating multiple reservoir domains for the purpose of history matching in a distributed computing environment has been proposed. A fully probabilistic approach to perturb permeability within the delineated zones is implemented. The combination of robust schemes for identifying reservoir zones and distributed computing significantly increase the accuracy and efficiency of the probabilistic approach. The information pertaining to the permeability variations in the reservoir that is contained in dynamic data is calibrated in terms of a deformation parameter rD. This information is merged with the prior geologic information in order to generate permeability models consistent with the observed dynamic data as well as the prior geology. The relationship between dynamic response data and reservoir attributes may vary in different regions of the reservoir due to spatial variations in reservoir attributes, well configuration, flow constrains etc. The probabilistic approach then has to account for multiple r{sub D} values in different regions of the reservoir. In order to delineate reservoir domains that can be characterized with different rD parameters, principal component analysis (PCA) of the Hessian matrix has been done. The Hessian matrix summarizes the sensitivity of the objective function at a given step of the history matching to model parameters. It also measures the interaction of the parameters in affecting the objective function. The basic premise of PC analysis is to isolate the most sensitive and least correlated regions. The eigenvectors obtained during the PCA are suitably scaled and appropriate grid block volume cut-offs are defined such that the resultant domains are neither too large (which increases interactions between domains) nor too small (implying ineffective history matching). The delineation of domains requires calculation of Hessian, which could be computationally costly and as well as restricts the current approach to

  8. Spatial analysis of corresponding fingerprint features from match and close non-match populations.

    Science.gov (United States)

    Abraham, Joshua; Champod, Christophe; Lennard, Chris; Roux, Claude

    2013-07-10

    The development of statistical models for forensic fingerprint identification purposes has been the subject of increasing research attention in recent years. This can be partly seen as a response to a number of commentators who claim that the scientific basis for fingerprint identification has not been adequately demonstrated. In addition, key forensic identification bodies such as ENFSI [1] and IAI [2] have recently endorsed and acknowledged the potential benefits of using statistical models as an important tool in support of the fingerprint identification process within the ACE-V framework. In this paper, we introduce a new Likelihood Ratio (LR) model based on Support Vector Machines (SVMs) trained with features discovered via morphometric and spatial analyses of corresponding minutiae configurations for both match and close non-match populations often found in AFIS candidate lists. Computed LR values are derived from a probabilistic framework based on SVMs that discover the intrinsic spatial differences of match and close non-match populations. Lastly, experimentation performed on a set of over 120,000 publicly available fingerprint images (mostly sourced from the National Institute of Standards and Technology (NIST) datasets) and a distortion set of approximately 40,000 images, is presented, illustrating that the proposed LR model is reliably guiding towards the right proposition in the identification assessment of match and close non-match populations. Results further indicate that the proposed model is a promising tool for fingerprint practitioners to use for analysing the spatial consistency of corresponding minutiae configurations.

  9. Matching isotopic distributions from metabolically labeled samples.

    Science.gov (United States)

    McIlwain, Sean; Page, David; Huttlin, Edward L; Sussman, Michael R

    2008-07-01

    In recent years stable isotopic labeling has become a standard approach for quantitative proteomic analyses. Among the many available isotopic labeling strategies, metabolic labeling is attractive for the excellent internal control it provides. However, analysis of data from metabolic labeling experiments can be complicated because the spacing between labeled and unlabeled forms of each peptide depends on its sequence, and is thus variable from analyte to analyte. As a result, one generally needs to know the sequence of a peptide to identify its matching isotopic distributions in an automated fashion. In some experimental situations it would be necessary or desirable to match pairs of labeled and unlabeled peaks from peptides of unknown sequence. This article addresses this largely overlooked problem in the analysis of quantitative mass spectrometry data by presenting an algorithm that not only identifies isotopic distributions within a mass spectrum, but also annotates matches between natural abundance light isotopic distributions and their metabolically labeled counterparts. This algorithm is designed in two stages: first we annotate the isotopic peaks using a modified version of the IDM algorithm described last year; then we use a probabilistic classifier that is supplemented by dynamic programming to find the metabolically labeled matched isotopic pairs. Such a method is needed for high-throughput quantitative proteomic metabolomic experiments measured via mass spectrometry. The primary result of this article is that the dynamic programming approach performs well given perfect isotopic distribution annotations. Our algorithm achieves a true positive rate of 99% and a false positive rate of 1% using perfect isotopic distribution annotations. When the isotopic distributions are annotated given 'expert' selected peaks, the same algorithm gets a true positive rate of 77% and a false positive rate of 1%. Finally, when annotating using machine selected peaks, which

  10. An Index Based Skip Search Multiple Pattern Matching Algorithm

    OpenAIRE

    Raju Bhukya; Balram Parmer,; Anand Kulkarni

    2011-01-01

    DNA Pattern matching, the problem of finding sub sequences within a long DNA sequence has many applications in computational biology. As the sequences can be long, matching can be an expensive operation, especially as approximate matching is allowed. Searching DNA related data is a common activity for molecular biologists. In this paper we explore the applicability of a new pattern matching technique called Index based Skip Search Multiple Pattern matching algorithm (ISMPM), for DNA sequences...

  11. Emotion modulates eye movement patterns and subsequent memory for the gist and details of movie scenes.

    Science.gov (United States)

    Subramanian, Ramanathan; Shankar, Divya; Sebe, Nicu; Melcher, David

    2014-03-26

    A basic question in vision research regards where people look in complex scenes and how this influences their performance in various tasks. Previous studies with static images have demonstrated a close link between where people look and what they remember. Here, we examined the pattern of eye movements when participants watched neutral and emotional clips from Hollywood-style movies. Participants answered multiple-choice memory questions concerning visual and auditory scene details immediately upon viewing 1-min-long neutral or emotional movie clips. Fixations were more narrowly focused for emotional clips, and immediate memory for object details was worse compared to matched neutral scenes, implying preferential attention to emotional events. Although we found the expected correlation between where people looked and what they remembered for neutral clips, this relationship broke down for emotional clips. When participants were subsequently presented with key frames (static images) extracted from the movie clips such that presentation duration of the target objects (TOs) corresponding to the multiple-choice questions was matched and the earlier questions were repeated, more fixations were observed on the TOs, and memory performance also improved significantly, confirming that emotion modulates the relationship between gaze position and memory performance. Finally, in a long-term memory test, old/new recognition performance was significantly better for emotional scenes as compared to neutral scenes. Overall, these results are consistent with the hypothesis that emotional content draws eye fixations and strengthens memory for the scene gist while weakening encoding of peripheral scene details.

  12. 75 FR 63524 - Computer Matching and Privacy Protection Act of 1988; Report of Matching Program: RRB and State...

    Science.gov (United States)

    2010-10-15

    ... Computer Matching and Privacy Protection Act of 1988; Report of Matching Program: RRB and State Medicare... required by the Computer Matching and Privacy Protection Act of ] 1988, the RRB is issuing a public notice... Matching and Privacy Protection Act of 1988, Public Law 100-503, requires a Federal agency participating...

  13. Keyframes Global Map Establishing Method for Robot Localization through Content-Based Image Matching

    Directory of Open Access Journals (Sweden)

    Tianyang Cao

    2017-01-01

    Full Text Available Self-localization and mapping are important for indoor mobile robot. We report a robust algorithm for map building and subsequent localization especially suited for indoor floor-cleaning robots. Common methods, for example, SLAM, can easily be kidnapped by colliding or disturbed by similar objects. Therefore, keyframes global map establishing method for robot localization in multiple rooms and corridors is needed. Content-based image matching is the core of this method. It is designed for the situation, by establishing keyframes containing both floor and distorted wall images. Image distortion, caused by robot view angle and movement, is analyzed and deduced. And an image matching solution is presented, consisting of extraction of overlap regions of keyframes extraction and overlap region rebuild through subblocks matching. For improving accuracy, ceiling points detecting and mismatching subblocks checking methods are incorporated. This matching method can process environment video effectively. In experiments, less than 5% frames are extracted as keyframes to build global map, which have large space distance and overlap each other. Through this method, robot can localize itself by matching its real-time vision frames with our keyframes map. Even with many similar objects/background in the environment or kidnapping robot, robot localization is achieved with position RMSE <0.5 m.

  14. Simplified Block Matching Algorithm for Fast Motion Estimation in Video Compression

    Directory of Open Access Journals (Sweden)

    M. Ezhilarasan

    2008-01-01

    Full Text Available Block matching motion estimation was one of the most important modules in the design of any video encoder. It consumed more than 85% of video encoding time due to searching of a candidate block in the search window of the reference frame. To minimize the search time on block matching, a simplified and efficient Block Matching Algorithm for Fast Motion Estimation was proposed. It had two steps such as prediction and refinement. The temporal correlation among successive frames and the direction of the previously processed frame for predicting the motion vector of the candidate block was considered during prediction step. Different combination of search points was considered in the refinement step of the algorithm which subsequently minimize the search time. Experiments were conducted on various SIF and CIF video sequences. The performance of the algorithm was compared with existing fast block matching motion estimation algorithms which were used in recent video coding standards. The experimental results were shown that the algorithm provided a faster search with minimum distortion when compared to the optimal fast block matching motion estimation algorithms.

  15. A novel image encryption algorithm based on DNA subsequence operation.

    Science.gov (United States)

    Zhang, Qiang; Xue, Xianglian; Wei, Xiaopeng

    2012-01-01

    We present a novel image encryption algorithm based on DNA subsequence operation. Different from the traditional DNA encryption methods, our algorithm does not use complex biological operation but just uses the idea of DNA subsequence operations (such as elongation operation, truncation operation, deletion operation, etc.) combining with the logistic chaotic map to scramble the location and the value of pixel points from the image. The experimental results and security analysis show that the proposed algorithm is easy to be implemented, can get good encryption effect, has a wide secret key's space, strong sensitivity to secret key, and has the abilities of resisting exhaustive attack and statistic attack.

  16. A Novel Image Encryption Algorithm Based on DNA Subsequence Operation

    Science.gov (United States)

    Zhang, Qiang; Xue, Xianglian; Wei, Xiaopeng

    2012-01-01

    We present a novel image encryption algorithm based on DNA subsequence operation. Different from the traditional DNA encryption methods, our algorithm does not use complex biological operation but just uses the idea of DNA subsequence operations (such as elongation operation, truncation operation, deletion operation, etc.) combining with the logistic chaotic map to scramble the location and the value of pixel points from the image. The experimental results and security analysis show that the proposed algorithm is easy to be implemented, can get good encryption effect, has a wide secret key's space, strong sensitivity to secret key, and has the abilities of resisting exhaustive attack and statistic attack. PMID:23093912

  17. A Novel Image Encryption Algorithm Based on DNA Subsequence Operation

    Directory of Open Access Journals (Sweden)

    Qiang Zhang

    2012-01-01

    Full Text Available We present a novel image encryption algorithm based on DNA subsequence operation. Different from the traditional DNA encryption methods, our algorithm does not use complex biological operation but just uses the idea of DNA subsequence operations (such as elongation operation, truncation operation, deletion operation, etc. combining with the logistic chaotic map to scramble the location and the value of pixel points from the image. The experimental results and security analysis show that the proposed algorithm is easy to be implemented, can get good encryption effect, has a wide secret key's space, strong sensitivity to secret key, and has the abilities of resisting exhaustive attack and statistic attack.

  18. The distances covered by basketball referees in a match increase throughout the competition phases, with no change in physiological demand.

    Science.gov (United States)

    Borin, João Paulo; Daniel, José Francisco; Bonganha, Valéria; de Moraes, Anderson Marques; Cavaglieri, Cláudia Regina; Mercadante, Luciano Allegretti; da Silva, Marcos Tadeu Nolasco; Montagner, Paulo Cesar

    2013-01-01

    It is crucial to know the demands on basketball referees, in different match periods (MPs) and phases of competition, for planning referee training and subsequent successful refereeing. To measure and evaluate the distance covered by referees in a match by measuring the number of interruptions, percentage of heart rate (%HR), and blood lactate concentration ([lac]) in different phases of competition and in different MPs. We studied the qualifying (QP), semifinal (SP), and final (FP) phases of a total of 12 matches (four matches in each phase) of the 2009-2010 Brazilian Basketball League. Distance covered, number of match interruptions, and referees' %HR and [lac] were analyzed. We compared the results between competition phases and between MPs (1st MP, 2nd MP, 3rd MP, and 4th MP). Regarding the distances covered, we observed significant differences (P referees in a basketball match increase throughout competition phases. This information is essential for planning of training and for the subsequent success of a referee.

  19. The distances covered by basketball referees in a match increase throughout the competition phases, with no change in physiological demand

    Science.gov (United States)

    Borin, João Paulo; Daniel, José Francisco; Bonganha, Valéria; de Moraes, Anderson Marques; Cavaglieri, Cláudia Regina; Mercadante, Luciano Allegretti; da Silva, Marcos Tadeu Nolasco; Montagner, Paulo Cesar

    2013-01-01

    Background It is crucial to know the demands on basketball referees, in different match periods (MPs) and phases of competition, for planning referee training and subsequent successful refereeing. Objective To measure and evaluate the distance covered by referees in a match by measuring the number of interruptions, percentage of heart rate (%HR), and blood lactate concentration ([lac]) in different phases of competition and in different MPs. Method We studied the qualifying (QP), semifinal (SP), and final (FP) phases of a total of 12 matches (four matches in each phase) of the 2009–2010 Brazilian Basketball League. Distance covered, number of match interruptions, and referees’ %HR and [lac] were analyzed. We compared the results between competition phases and between MPs (1st MP, 2nd MP, 3rd MP, and 4th MP). Results Regarding the distances covered, we observed significant differences (P referees in a basketball match increase throughout competition phases. This information is essential for planning of training and for the subsequent success of a referee. PMID:24379725

  20. Match-to-match variation in physical activity and technical skill measures in professional Australian Football.

    Science.gov (United States)

    Kempton, Thomas; Sullivan, Courtney; Bilsborough, Johann C; Cordy, Justin; Coutts, Aaron J

    2015-01-01

    To determine the match-to-match variability in physical activity and technical performance measures in Australian Football, and examine the influence of playing position, time of season, and different seasons on these measures of variability. Longitudinal observational study. Global positioning system, accelerometer and technical performance measures (total kicks, handballs, possessions and Champion Data rank) were collected from 33 players competing in the Australian Football League over 31 matches during 2011-2012 (N=511 observations). The global positioning system data were categorised into total distance, mean speed (mmin(-1)), high-speed running (>14.4 kmh(-1)), very high-speed running (>19.9 kmh(-1)), and sprint (>23.0 kmh(-1)) distance while player load was collected from the accelerometer. The data were log transformed to provide coefficient of variation and the between subject standard deviation (expressed as percentages). Match-to-match variability was increased for higher speed activities (high-speed running, very high-speed running, sprint distance, coefficient of variation %: 13.3-28.6%) compared to global measures (speed, total distance, player load, coefficient of variation %: 5.3-9.2%). The between-match variability was relativity stable for all measures between and within AFL seasons, with only few differences between positions. Higher speed activities (high-speed running, very high-speed running, sprint distance), but excluding mean speed, total distance and player load, were all higher in the final third phase of the season compared to the start of the season. While global measures of physical performance are relatively stable, higher-speed activities and technical measures exhibit a large degree of between-match variability in Australian Football. However, these measures remain relatively stable between positions, and within and between Australian Football League seasons. Copyright © 2013 Sports Medicine Australia. Published by Elsevier Ltd

  1. A matched crossover design for clinical trials.

    Science.gov (United States)

    Simon, Laura J; Chinchilli, Vernon M

    2007-09-01

    Two design principles are used frequently in clinical trials: 1) A subject is "matched" or "paired" with a similar subject to reduce the chance that other variables obscure the primary comparison of interest. 2) A subject serves as his/her own control by "crossing over" from one treatment to another during the course of an experiment. There are situations in which it may be advantageous to use the two design principles - crossing over and matching - simultaneously. That is, it may be advantageous to conduct a "paired crossover design," in which each subject, while paired with a similar subject, crosses over and receives each experimental treatment. In this paper, we describe two clinical trials conducted by the National Heart, Lung and Blood Institute's Asthma Clinical Research Network that used a paired 2x2 crossover design. The Beta Adrenergic Response by GEnotype (BARGE) Study compared the effects of regular use of inhaled albuterol on mildly asthmatic patients with different genotypes at the 16th position of the beta-agonist receptor gene. The Smoking Modulates Outcomes of Glucocorticoid (SMOG) Therapy in Asthma Study evaluated the hypothesis that smoking reduces the response to inhaled corticosteroids. For such paired crossover designs, the primary parameter of interest is typically the treatment-by-pairing interaction term. In evaluating the relative efficiency of the paired 2x2 crossover design to two independent crossover designs with respect to this interaction term, we show that the paired 2x2 crossover design is more efficient if the correlations between the paired members on the same treatments are greater than their correlations on different treatments. This condition should hold in most circumstances, and therefore the paired crossover design deserves serious consideration for any clinical trial in which the crossing over and matching of subjects is deemed simultaneously beneficial.

  2. Matching Livestock Production Systems and Environment

    Science.gov (United States)

    Becchetti, T.; Stackhouse, J.; Snell, L.; Lile, D.; George, H.; Harper, J. M.; Larson, S.; Mashiri, F.; Doran, M.; Barry, S.

    2015-12-01

    Livestock production systems vary greatly over the world. Producers try to match the resources they have with the demands of production, this can vary by species, class of animal, number of animals, and production goals, etc. Using California's diversity in production systems as an example, we explored how livestock producers best utilize the forage and feed found in different ecosystems and available in different parts of the state. Livestock grazing, the predominant land use in California and in much of the world, makes efficient use of the natural vegetation produced without additional water (irrigation), minimal inputs such as fertilizer while often supporting a variety of conservation objectives including vegetation management, fire fuels management, and habitat and open space conservation. The numerous by-products produced by other sectors of California's agriculture as well as food industries, such as brewer's grain, cottonseeds, and almond hulls are utilized as a feed source for livestock. These by-products are not only an important feed source especially in drought years but are diverted from our waste stream when utilized by livestock. The concept of matching available resources to livestock needs throughout the world is often overlooked and production systems are often over simplified in projects conducting a life cycle analysis or developing carbon foot prints for livestock production systems. This paper provides details on the various production systems found in California, the ecosystem they have adapted to, and how the producers use science and ecological knowledge to match the biological requirements of the livestock and conservation objectives to feed and forage resources.

  3. Mode matching in second order susceptibility metamaterials

    CERN Document Server

    Héron, Sébastien; Haïdar, Riad

    2016-01-01

    We present an effective model for a subwavelength periodically patterned metallic layer, its cavities being filled with a nonlinear dielectric material, which accounts for both the linear and second order behavior. The effective non linear susceptibility for the homogenized layer is driven by the nonlinearity of the dielectric material and by the geometrical parameters, thus leading to much higher susceptibility than existing materials. This leads to a huge enhancement of non linear processes when used together with resonances. Furthermore, multiple resonances are taking place in the metallic cavities, and we investigate the mode matching situations for frequency conversion processes and show how it enhances further their efficiency.

  4. Arranged matches and mental illness: therapists' dilemmas.

    Science.gov (United States)

    Greenberg, David; Buchbinder, Jacob Tuvia; Witztum, Eliezer

    2012-01-01

    Traditional societies place especial value on marriage and having children, and marriages are often arranged. A series of situations and dilemmas associated with arranged matches and their consequences are described in the course of mental health work with ultra-orthodox Jewish people with severe mental illness. Issues of confidentiality may arise with parents and matchmakers; on the other hand, respectful cooperation with religious authorities, counselors in the community, and family members is important. Information on genetic counseling, contraception, medication during pregnancy, and breastfeeding are considered and interact with communal structures and practices. There is a need for close support and evaluation during the process of marriage, childbearing, and parenthood.

  5. Map Matching for Intelligent Speed Adaptation

    DEFF Research Database (Denmark)

    Tradisauskas, Nerius; Juhl, Jens; Lahrmann, Harry;

    2007-01-01

    The availability of Global Navigation Satellite Systems enables sophisticated vehicle guidance and advisory systems such as Intelligent Speed Adaptation (ISA) systems. In ISA systems, it is essential to be able to position vehicles within a road network. Because digital road networks as well as GPS...... positioning are often inaccurate, a technique known as map matching is needed that aims to use this inaccurate data for determining a vehicle's real road-network position. Then, knowing this position, an ISA system can compare the vehicle's speed with the speed limit in effect and react appropriately...

  6. Image Segmentation, Registration, Compression, and Matching

    Science.gov (United States)

    Yadegar, Jacob; Wei, Hai; Yadegar, Joseph; Ray, Nilanjan; Zabuawala, Sakina

    2011-01-01

    A novel computational framework was developed of a 2D affine invariant matching exploiting a parameter space. Named as affine invariant parameter space (AIPS), the technique can be applied to many image-processing and computer-vision problems, including image registration, template matching, and object tracking from image sequence. The AIPS is formed by the parameters in an affine combination of a set of feature points in the image plane. In cases where the entire image can be assumed to have undergone a single affine transformation, the new AIPS match metric and matching framework becomes very effective (compared with the state-of-the-art methods at the time of this reporting). No knowledge about scaling or any other transformation parameters need to be known a priori to apply the AIPS framework. An automated suite of software tools has been created to provide accurate image segmentation (for data cleaning) and high-quality 2D image and 3D surface registration (for fusing multi-resolution terrain, image, and map data). These tools are capable of supporting existing GIS toolkits already in the marketplace, and will also be usable in a stand-alone fashion. The toolkit applies novel algorithmic approaches for image segmentation, feature extraction, and registration of 2D imagery and 3D surface data, which supports first-pass, batched, fully automatic feature extraction (for segmentation), and registration. A hierarchical and adaptive approach is taken for achieving automatic feature extraction, segmentation, and registration. Surface registration is the process of aligning two (or more) data sets to a common coordinate system, during which the transformation between their different coordinate systems is determined. Also developed here are a novel, volumetric surface modeling and compression technique that provide both quality-guaranteed mesh surface approximations and compaction of the model sizes by efficiently coding the geometry and connectivity

  7. Large-Scale Collective Entity Matching

    CERN Document Server

    Rastogi, Vibhor; Garofalakis, Minos

    2011-01-01

    There have been several recent advancements in Machine Learning community on the Entity Matching (EM) problem. However, their lack of scalability has prevented them from being applied in practical settings on large real-life datasets. Towards this end, we propose a principled framework to scale any generic EM algorithm. Our technique consists of running multiple instances of the EM algorithm on small neighborhoods of the data and passing messages across neighborhoods to construct a global solution. We prove formal properties of our framework and experimentally demonstrate the effectiveness of our approach in scaling EM algorithms.

  8. Impedance matched thin metamaterials make metals absorbing.

    Science.gov (United States)

    Mattiucci, N; Bloemer, M J; Aközbek, N; D'Aguanno, G

    2013-11-13

    Metals are generally considered good reflectors over the entire electromagnetic spectrum up to their plasma frequency. Here we demonstrate an approach to tailor their absorbing characteristics based on the effective metamaterial properties of thin, periodic metallo-dielectric multilayers by exploiting a broadband, inherently non-resonant, surface impedance matching mechanism. Based on this mechanism, we design, fabricate and test omnidirectional, thin ( 99%) over a frequency range spanning from the UV to the IR. Our approach opens new venues to design cost effective materials for many applications such as thermo-photovoltaic energy conversion devices, light harvesting for solar cells, flat panel display, infrared detectors, stray light reduction, stealth and others.

  9. Some Recent Results on Graph Matching,

    Science.gov (United States)

    1987-06-01

    VJ and • work supported by ONR Contract # N00014-85-K-0488 I 1 1JI IIIII 2 the line-coloring problem [H]), there are others the polynomial -time sol...theorem of Tutte [T]. 2.1. THEOREM. A graph G has a perfect matching if and only if for every X 9_ V(G), the number of odd components of G - X is at most...here because our approach is different, being based upon the work of Edmonds, Lovasz and PuUeyblank [ELP], who gave a polynomial -time algorithm to com

  10. Edge-Matching Problems with Rotations

    DEFF Research Database (Denmark)

    Ebbesen, Martin; Fischer, Paul; Witt, Carsten

    2011-01-01

    Edge-matching problems, also called puzzles, are abstractions of placement problems with neighborhood conditions. Pieces with colored edges have to be placed on a board such that adjacent edges have the same color. The problem has gained interest recently with the (now terminated) Eternity II...... puzzle, and new complexity results. In this paper we consider a number of settings which differ in size of the puzzles and the manipulations allowed on the pieces. We investigate the effect of allowing rotations of the pieces on the complexity of the problem, an aspect that is only marginally treated so...

  11. Antennas with non-foster matching networks

    CERN Document Server

    Aberle, James T

    2007-01-01

    Most antenna engineers are likely to believe that antennas are one technology that is more or less impervious to the rapidly advancing semiconductor industry. However, as demonstrated in this lecture, there is a way to incorporate active components into an antenna and transform it into a new kind of radiating structure that can take advantage of the latest advances in analog circuit design. The approach for making this transformation is to make use of non-Foster circuit elements in the matching network of the antenna. By doing so, we are no longer constrained by the laws of physics that apply

  12. Resonance and aspect matched adaptive radar (RAMAR)

    CERN Document Server

    Barrett, Terence William

    2012-01-01

    The book describes a new form of radar for which the target response is frequency, i.e., resonance-dependent. The book provides both prototype designs and empirical results collected from a variety of targets. The new form of radar, called RAMAR (Resonance and Aspect Matched Adaptive Radar) advances radar - mere ranging and detection - to the level of RF spectroscopy, and permits an advance of spectroscopic methods from optical, through infra-red and into the RF spectral range. The book will describe how a target's response can be a function of frequency components in the transmitted signal's

  13. Physical Restraint Initiation in Nursing Homes and Subsequent Resident Health

    Science.gov (United States)

    Engberg, John; Castle, Nicholas G.; McCaffrey, Daniel

    2008-01-01

    Purpose: It is widely believed that physical restraint use causes mental and physical health decline in nursing home residents. Yet few studies exist showing an association between restraint initiation and health decline. In this research, we examined whether physical restraint initiation is associated with subsequent lower physical or mental…

  14. 22 CFR 226.72 - Subsequent adjustments and continuing responsibilities.

    Science.gov (United States)

    2010-04-01

    ... in §§ 226.31 through 226.37. (5) Records retention as required in § 226.53. (b) After closeout of an... 22 Foreign Relations 1 2010-04-01 2010-04-01 false Subsequent adjustments and continuing responsibilities. 226.72 Section 226.72 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT ADMINISTRATION...

  15. Incidence of pelvic organ prolapse repair subsequent to hysterectomy

    DEFF Research Database (Denmark)

    Lykke, Rune; Blaakær, Jan; Ottesen, Bent

    2017-01-01

    INTRODUCTION AND HYPOTHESIS: The aim of this study was to compare the incidence of subsequent pelvic organ prolapse (POP) repair in women following radical hysterectomy versus total abdominal hysterectomy. METHODS: From the Danish National Patient Registry, we collected data on all radical...

  16. Laser Induced Selective Activation For Subsequent Autocatalytic Electroless Plating

    DEFF Research Database (Denmark)

    Zhang, Yang

    The subject of this PhD thesis is “Laser induced selective activation for subsequent autocatalytic electroless plating.” The objective of the project is to investigate the process chains for micro structuring of polymer surfaces for selective micro metallization. Laser induced selective activation...

  17. 45 CFR 2543.72 - Subsequent adjustments and continuing responsibilities.

    Science.gov (United States)

    2010-10-01

    ... 45 Public Welfare 4 2010-10-01 2010-10-01 false Subsequent adjustments and continuing responsibilities. 2543.72 Section 2543.72 Public Welfare Regulations Relating to Public Welfare (Continued) CORPORATION FOR NATIONAL AND COMMUNITY SERVICE GRANTS AND AGREEMENTS WITH INSTITUTIONS OF HIGHER EDUCATION...

  18. The Influence of Computer Training Platform on Subsequent Computer Preferences.

    Science.gov (United States)

    Pardamean, Bens; Slovaceks, Simeon

    1995-01-01

    Reports a study that examined the impact of an introductory college computer course on users' subsequent preferences in their choice of computer (IBM versus Macintosh). Surveys found a strong positive relationship between the type of computer students used in the course and their later use and purchasing preferences. (SM)

  19. Beliefs about Child Support Modification Following Remarriage and Subsequent Childbirth

    Science.gov (United States)

    Hans, Jason D.

    2009-01-01

    Framed by equity theory, fairness beliefs regarding child support modification to account for the financial impact of remarriage and subsequent childbirth were assessed. Based on a random sample of 407 Kentucky residents using a multiple segment factorial vignette approach, modification was supported by 57% of respondents following remarriage, but…

  20. Do cognitive attributions for smoking predict subsequent smoking development?

    Science.gov (United States)

    Guo, Qian; Unger, Jennifer B; Azen, Stanley P; MacKinnon, David P; Johnson, C Anderson

    2012-03-01

    To develop more effective anti-smoking programs, it is important to understand the factors that influence people to smoke. Guided by attribution theory, a longitudinal study was conducted to investigate how individuals' cognitive attributions for smoking were associated with subsequent smoking development and through which pathways. Middle and high school students in seven large cities in China (N=12,382; 48.5% boys and 51.5% girls) completed two annual surveys. Associations between cognitive attributions for smoking and subsequent smoking initiation and progression were tested with multilevel analysis, taking into account plausible moderation effects of gender and baseline smoking status. Mediation effects of susceptibility to smoking were investigated using statistical mediation analysis (MacKinnon, 2008). Six out of eight tested themes of cognitive attributions were associated with subsequent smoking development. Curiosity (β=0.11, psocial image (β=0.10, p=Social image (β=0.05, p=0.043), engagement (β=0.07, p=0.003), and mental enhancement (β=0.15, pmediated most of the associations, with the proportion of mediated effects ranging from 4.3% to 30.8%. This study identifies the roles that cognitive attributions for smoking play in subsequent smoking development. These attributions could be addressed in smoking prevention programs.

  1. Faster Algorithms for Computing Longest Common Increasing Subsequences

    DEFF Research Database (Denmark)

    Kutz, Martin; Brodal, Gerth Stølting; Kaligosi, Kanela

    2011-01-01

    We present algorithms for finding a longest common increasing subsequence of two or more input sequences. For two sequences of lengths n and m, where m⩾n, we present an algorithm with an output-dependent expected running time of and O(m) space, where ℓ is the length of an LCIS, σ is the size of t...

  2. Fitness Change and Subsequent Academic Performance in Adolescents

    Science.gov (United States)

    Chen, Li-Jung; Fox, Kenneth R.; Ku, Po-Wen; Taun, Chih-Yang

    2013-01-01

    Background: This study examined the association between fitness change and subsequent academic performance in Taiwanese schoolchildren from 7th grade to 9th grade. Methods: The 7th graders from 1 junior high school district participated in this study (N=669). Academic performance was

  3. Palivizumab prophylaxis, respiratory syncytial virus, and subsequent recurrent wheezing

    NARCIS (Netherlands)

    Simoes, Eric A. F.; Groothuis, Jessil R.; Carbonell-Estrany, Xavier; Reger, Christian H. L.; Mitchell, Ian; Fredrick, Linda M.; Kimpen, Jan L. L.

    2007-01-01

    Objective Children who experience respiratory syncytial virus (RSV) lower respiratory tract infections (LRTIs) early in life have high rates of subsequent recurrent wheezing. Palivizumab, an anti-RSV monoclonal antibody, has 78% to 80% efficacy in preventing RSV hospitalization in premature infants

  4. 7 CFR 1822.276 - Subsequent RHS loans.

    Science.gov (United States)

    2010-01-01

    ... GRANTS PRIMARILY FOR REAL ESTATE PURPOSES RURAL HOUSING LOANS AND GRANTS Rural Housing Site Loan Policies... 7 Agriculture 12 2010-01-01 2010-01-01 false Subsequent RHS loans. 1822.276 Section 1822.276 Agriculture Regulations of the Department of Agriculture (Continued) RURAL HOUSING SERVICE, RURAL...

  5. A note on the length of the longest alternating subsequence

    CERN Document Server

    Houdré, Christian

    2010-01-01

    Let $LA_{n}(\\tau)$ be the length of the longest alternating subsequence of a random permutation $\\tau\\in\\left[ n\\right] $. Classical probabilistic arguments are provided to derive the asymptotic mean, variance and limiting law of $LA_{n}\\left( \\tau\\right) $. Our methodology is robust enough to tackle similar problems for finite alphabet random words or even Markovian sequences.

  6. Effects of Accountancy Internship on Subsequent Academic Performance.

    Science.gov (United States)

    Kwong, K. S.; Lui, Gladie

    1991-01-01

    Explores the effects of accounting internships upon subsequent academic achievement. Reports that grade point averages and degree examination results of 10 Chinese University of Hong Kong students who had been interns were compared to scores of 236 accounting majors who had not. Concludes that internships increased student knowledge and…

  7. Effects of Accountancy Internship on Subsequent Academic Performance.

    Science.gov (United States)

    Kwong, K. S.; Lui, Gladie

    1991-01-01

    Explores the effects of accounting internships upon subsequent academic achievement. Reports that grade point averages and degree examination results of 10 Chinese University of Hong Kong students who had been interns were compared to scores of 236 accounting majors who had not. Concludes that internships increased student knowledge and…

  8. FACC: A Novel Finite Automaton Based on Cloud Computing for the Multiple Longest Common Subsequences Search

    Directory of Open Access Journals (Sweden)

    Yanni Li

    2012-01-01

    Full Text Available Searching for the multiple longest common subsequences (MLCS has significant applications in the areas of bioinformatics, information processing, and data mining, and so forth, Although a few parallel MLCS algorithms have been proposed, the efficiency and effectiveness of the algorithms are not satisfactory with the increasing complexity and size of biologic data. To overcome the shortcomings of the existing MLCS algorithms, and considering that MapReduce parallel framework of cloud computing being a promising technology for cost-effective high performance parallel computing, a novel finite automaton (FA based on cloud computing called FACC is proposed under MapReduce parallel framework, so as to exploit a more efficient and effective general parallel MLCS algorithm. FACC adopts the ideas of matched pairs and finite automaton by preprocessing sequences, constructing successor tables, and common subsequences finite automaton to search for MLCS. Simulation experiments on a set of benchmarks from both real DNA and amino acid sequences have been conducted and the results show that the proposed FACC algorithm outperforms the current leading parallel MLCS algorithm FAST-MLCS.

  9. Association between periodontitis needing surgical treatment and subsequent diabetes risk: a population-based cohort study.

    Science.gov (United States)

    Lin, Shih-Yi; Lin, Cheng-Li; Liu, Jiung-Hsiun; Wang, I-Kuan; Hsu, Wu-Huei; Chen, Chao-Jung; Ting, I-Wen; Wu, I-Ting; Sung, Fung-Chang; Huang, Chiu-Ching; Chang, Yen-Jung

    2014-06-01

    It is well known that patients with diabetes have higher extent and severity of periodontitis, but the backward relationship is little investigated. The relationship between periodontitis needing dental surgery and subsequent type 2 diabetes mellitus (DMT2) in those individuals without diabetes was assessed. This is a retrospective cohort study using data from the national health insurance system of Taiwan. The periodontitis cohort involved 22,299 patients, excluding those with diabetes already or those diagnosed with diabetes within 1 year from baseline. Each study participant was randomly frequency matched by age, sex, and index year with one individual from the general population without periodontitis. Cox proportional hazards regression analysis was used to estimate the influence of periodontitis on the risk of diabetes. The mean follow-up period is 5.47 ± 3.54 years. Overall, the subsequent incidence of DMT2 was 1.24-fold higher in the periodontitis cohort than in the control cohort, with an adjusted hazard ratio of 1.19 (95% confidence interval = 1.10 to 1.29) after controlling for sex, age, and comorbidities. This is the largest nation-based study examining the risk of diabetes in Asian patients with periodontitis. Those patients with periodontitis needing dental surgery have increased risk of future diabetes within 2 years compared with those participants with periodontitis not requiring dental surgery.

  10. Subsequent Surgery after Revision Anterior Cruciate Ligament Reconstruction

    Science.gov (United States)

    Ding, David; Group, Mars

    2016-01-01

    Objectives: Failure or reinjury after anterior cruciate ligament (ACL) reconstruction can lead to recurrent instability and concomitant intra-articular injuries. While revision ACL reconstruction (rACLR) can be performed to restore knee stability and improve patient activity level, outcomes after these surgeries are reported to be inferior to primary ACL reconstruction. Further reoperation after rACLR can have an even more profound effect on patient satisfaction and outcome. Yet, there is a current lack of information regarding the rate and risk factors for subsequent surgery after rACLR. Methods: 1205 patients who underwent rACLR were enrolled between 2006 and 2011, comprising the prospective cohort. Two-year questionnaire follow-up was obtained on 989 (82%), while telephone follow-up was obtained on 1112 (92%). If a patient reported having a subsequent surgery, operative reports detailing the subsequent procedure(s) were obtained and categoriezed. A repeated meaures ANOVA was used to reveal significatnt differences in patient reported outcomes. Multivariate regression analysis was performed to determine independent risk factors for reoperation. Results: One hundred and twenty-two patients (10.1%) underwent a total of 172 subsequent procedures on the ipsilateral knee at 2-year follow-up. Of the reoperation procedures, 26.7% were meniscus procedures (69% meniscectomy, 26% repair), 18.6% were subsequent rACLR, 17.4% were cartilage procedures (61% chondroplasty, 17% microfracture, and 13% mosaicplasty), 10% hardware removal, and 9.3% were procedures for arthrofibrosis such has lysis of adhesions and synovectomy. Patients who had reoperations had significantly lower IKDC, KOOS symptoms and pain scores, and WOMAC stiffness scores at two-year follow up. Multivariate analysis revealed that patients under 20 years old were 2.1 times more likely than patients aged 20-29 to have a reoperation. Use of allograft at the time of rACLR and staged revision (bone grafting of

  11. Multi-image Matching of Airborne SAR Imagery by SANCC

    Directory of Open Access Journals (Sweden)

    DING Hao

    2015-03-01

    Full Text Available In order to improve accuracy of SAR matching, a multi-image matching method based on sum of adaptive normalized cross-correlation (SANCC is proposed. It utilizes geometrical and radiometric information of multi-baselinesynthetic aperture radar (SARimages effectively. Firstly, imaging parameters, platform parameters and approximate digital surface model (DSM are used to predict matching line. Secondly, similarity and proximity in Gestalt theory are introduced to SANCC, and SANCC measures of potential matching points along the matching line are calculated. Thirdly, multi-image matching results and object coordinates of matching points are obtained by winner-take-all (WTA optimization strategy. The approach has been demonstrated with airborne SAR images acquired by a Chinese airborne SAR system (CASMSAR system. The experimental results indicate that the proposed algorithm is effective for providing dense and accuracy matching points, reducing the number of mismatches caused by repeated textures, and offering a better solution to match in poor textured areas.

  12. When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings

    CERN Document Server

    Bansal, Nikhil; Li, Jian; Mestre, Julian; Nagarajan, Viswanath; Rudra, Atri

    2010-01-01

    Consider a random graph model where each possible edge $e$ is present independently with some probability $p_e$. Given these probabilities, we want to build a large/heavy matching in the randomly generated graph. However, the only way we can find out whether an edge is present or not is to query it, and if the edge is indeed present in the graph, we are forced to add it to our matching. Further, each vertex $i$ is allowed to be queried at most $t_i$ times. How should we adaptively query the edges to maximize the expected weight of the matching? We consider several matching problems in this general framework (some of which arise in kidney exchanges and online dating, and others arise in modeling online advertisements); we give LP-rounding based constant-factor approximation algorithms for these problems. Our main results are the following: We give a 4 approximation for weighted stochastic matching on general graphs, and a 3 approximation on bipartite graphs. This answers an open question from [Chen etal ICALP ...

  13. The actor-critic learning is behind the matching law: matching versus optimal behaviors.

    Science.gov (United States)

    Sakai, Yutaka; Fukai, Tomoki

    2008-01-01

    The ability to make a correct choice of behavior from various options is crucial for animals' survival. The neural basis for the choice of behavior has been attracting growing attention in research on biological and artificial neural systems. Alternative choice tasks with variable ratio (VR) and variable interval (VI) schedules of reinforcement have often been employed in studying decision making by animals and humans. In the VR schedule task, alternative choices are reinforced with different probabilities, and subjects learn to select the behavioral response rewarded more frequently. In the VI schedule task, alternative choices are reinforced at different average intervals independent of the choice frequencies, and the choice behavior follows the so-called matching law. The two policies appear robustly in subjects' choice of behavior, but the underlying neural mechanisms remain unknown. Here, we show that these seemingly different policies can appear from a common computational algorithm known as actor-critic learning. We present experimentally testable variations of the VI schedule in which the matching behavior gives only a suboptimal solution to decision making and show that the actor-critic system exhibits the matching behavior in the steady state of the learning even when the matching behavior is suboptimal. However, it is found that the matching behavior can earn approximately the same reward as the optimal one in many practical situations.

  14. Natural course of subsequent pregnancy after peripartum cardiomyopathy

    Directory of Open Access Journals (Sweden)

    Francisco Manes Albanesi Fº

    1999-07-01

    Full Text Available OBJECTIVE: To assess the effect of subsequent pregnancy after peripartum cardiomyopathy (PPCM on maternal and fetal outcome. METHODS: Prospective study of 34 patients with the diagnosis of PPCM (mean age= 26years. At the time of first diagnosis 5 were in NYHA functional class (FC II for heart failure, one in FC III and 28 in FC IV. After clinical treatment, patients were advised to avoid new pregnancies and a follow-up was obtained. RESULTS: There were 12 (35.3% subsequent pregnancies in patients (pt aged 19 to 44 years (mean 32, divided into two groups: GI: 6 pts who had normalized their heart size and GII: 6 pts with persistent cardiomegaly. GI had initially mild clinical manifestations ( 3 were in FC II, 1 in FC II and 2 in FC IV and complete recovery of cardiac function (FC I. A new pregnancy was well-tolerated in 5 (83.3%; 1 pt presented with preeclampsia, and progressed to FC II. Presently, 5 pt are in FC I and 1 in FC II. GII pts had more severe heart failure at the onset of PPCM (1 pt in FC II and 5 in FC IV; during follow-up, 4 pt were in FC I and 2 in FC II. A new pregnancy was well tolerated in all of them, but the eldest, who had had 2 pregnancies and had a progressive worsening of clinical status, dying 8 years after the last pregnancy and 13 years after the diagnosis of PPCM. The remaining 5 pt are still alive, 3 in FC I and 2 in FC II, with worsening of FC in 1. Subsequent pregnancies occurred 3-7 years after clinical treatment of PPCM and no fetal distress was observed. CONCLUSION: Subsequent pregnancies are well-tolerated after PPCM, but not devoid of risk. No fetal distress was observed. A minimum interval of 3 years after the recovery of function seems to be safe for subsequent pregnancies.

  15. Matching Alternative Addresses: a Semantic Web Approach

    Science.gov (United States)

    Ariannamazi, S.; Karimipour, F.; Hakimpour, F.

    2015-12-01

    Rapid development of crowd-sourcing or volunteered geographic information (VGI) provides opportunities for authoritatives that deal with geospatial information. Heterogeneity of multiple data sources and inconsistency of data types is a key characteristics of VGI datasets. The expansion of cities resulted in the growing number of POIs in the OpenStreetMap, a well-known VGI source, which causes the datasets to outdate in short periods of time. These changes made to spatial and aspatial attributes of features such as names and addresses might cause confusion or ambiguity in the processes that require feature's literal information like addressing and geocoding. VGI sources neither will conform specific vocabularies nor will remain in a specific schema for a long period of time. As a result, the integration of VGI sources is crucial and inevitable in order to avoid duplication and the waste of resources. Information integration can be used to match features and qualify different annotation alternatives for disambiguation. This study enhances the search capabilities of geospatial tools with applications able to understand user terminology to pursuit an efficient way for finding desired results. Semantic web is a capable tool for developing technologies that deal with lexical and numerical calculations and estimations. There are a vast amount of literal-spatial data representing the capability of linguistic information in knowledge modeling, but these resources need to be harmonized based on Semantic Web standards. The process of making addresses homogenous generates a helpful tool based on spatial data integration and lexical annotation matching and disambiguating.

  16. Feature Matching in Time Series Modelling

    CERN Document Server

    Xia, Yingcun

    2011-01-01

    Using a time series model to mimic an observed time series has a long history. However, with regard to this objective, conventional estimation methods for discrete-time dynamical models are frequently found to be wanting. In the absence of a true model, we prefer an alternative approach to conventional model fitting that typically involves one-step-ahead prediction errors. Our primary aim is to match the joint probability distribution of the observable time series, including long-term features of the dynamics that underpin the data, such as cycles, long memory and others, rather than short-term prediction. For want of a better name, we call this specific aim {\\it feature matching}. The challenges of model mis-specification, measurement errors and the scarcity of data are forever present in real time series modelling. In this paper, by synthesizing earlier attempts into an extended-likelihood, we develop a systematic approach to empirical time series analysis to address these challenges and to aim at achieving...

  17. Match Analysis an undervalued coaching tool

    CERN Document Server

    Sacripanti, Attilio

    2010-01-01

    From a Biomechanical point of view, Judo competition is an intriguing complex nonlinear system, with many chaotic and fractals aspects, It is also the test bed in which all coaching capabilities and athlete's performances are evaluated and put to the test. Competition is the moment of truth of all conditioning time, preparation and technical work, before developed, and it is also the climax of the teaching point of view. Furthermore, it is the most important source of technical assessment. Studying it is essential to the coaches because they can obtain useful information for their coaching. Match Analysis could be seen as the master key in all situation sports (dual or team) like Judo, to help in useful way the difficult task of coach or best for National or Olympic coaching equips. In this paper it is presented a short summary of the most important methodological achievement in judo match analysis. It is also presented, at light of the last technological improvement, the first systematization toward new fiel...

  18. Graph Matching: Relax at Your Own Risk.

    Science.gov (United States)

    Lyzinski, Vince; Fishkind, Donniell E; Fiori, Marcelo; Vogelstein, Joshua T; Priebe, Carey E; Sapiro, Guillermo

    2016-01-01

    Graph matching-aligning a pair of graphs to minimize their edge disagreements-has received wide-spread attention from both theoretical and applied communities over the past several decades, including combinatorics, computer vision, and connectomics. Its attention can be partially attributed to its computational difficulty. Although many heuristics have previously been proposed in the literature to approximately solve graph matching, very few have any theoretical support for their performance. A common technique is to relax the discrete problem to a continuous problem, therefore enabling practitioners to bring gradient-descent-type algorithms to bear. We prove that an indefinite relaxation (when solved exactly) almost always discovers the optimal permutation, while a common convex relaxation almost always fails to discover the optimal permutation. These theoretical results suggest that initializing the indefinite algorithm with the convex optimum might yield improved practical performance. Indeed, experimental results illuminate and corroborate these theoretical findings, demonstrating that excellent results are achieved in both benchmark and real data problems by amalgamating the two approaches.

  19. Partial match queries in random quadtrees

    CERN Document Server

    Broutin, Nicolas; Sulzbach, Henning

    2011-01-01

    We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the data consist of independent and uniform points in the unit square. For this model, in a structure on $n$ points, it is known that the number of nodes $C_n(\\xi)$ to visit in order to report the items matching an independent and uniformly on $[0,1]$ random query $\\xi$ satisfies $\\Ec{C_n(\\xi)}\\sim \\kappa n^{\\beta}$, where $\\kappa$ and $\\beta$ are explicit constants. We develop an approach based on the analysis of the cost $C_n(x)$ of any fixed query $x\\in [0,1]$, and give precise estimates for the variance and limit distribution of the cost $C_n(x)$. Our results permit to describe a limit process for the costs $C_n(x)$ as $x$ varies in $[0,1]$; one of the consequences is that $E{\\max_{x\\in [0,1]} C_n(x)} \\sim \\gamma n^\\beta$.

  20. High performance pattern matching on heterogeneous platform.

    Science.gov (United States)

    Soroushnia, Shima; Daneshtalab, Masoud; Plosila, Juha; Pahikkala, Tapio; Liljeberg, Pasi

    2014-10-23

    Pattern discovery is one of the fundamental tasks in bioinformatics and pattern recognition is a powerful technique for searching sequence patterns in the biological sequence databases. Fast and high performance algorithms are highly demanded in many applications in bioinformatics and computational molecular biology since the significant increase in the number of DNA and protein sequences expand the need for raising the performance of pattern matching algorithms. For this purpose, heterogeneous architectures can be a good choice due to their potential for high performance and energy efficiency. In this paper we present an efficient implementation of Aho-Corasick (AC) which is a well known exact pattern matching algorithm with linear complexity, and Parallel Failureless Aho-Corasick (PFAC) algorithm which is the massively parallelized version of AC algorithm without failure transitions, on a heterogeneous CPU/GPU architecture. We progressively redesigned the algorithms and data structures to fit on the GPU architecture. Our results on different protein sequence data sets show that the new implementation runs 15 times faster compared to the original implementation of the PFAC algorithm.

  1. Improved algorithms for approximate string matching (extended abstract

    Directory of Open Access Journals (Sweden)

    Papamichail Georgios

    2009-01-01

    Full Text Available Abstract Background The problem of approximate string matching is important in many different areas such as computational biology, text processing and pattern recognition. A great effort has been made to design efficient algorithms addressing several variants of the problem, including comparison of two strings, approximate pattern identification in a string or calculation of the longest common subsequence that two strings share. Results We designed an output sensitive algorithm solving the edit distance problem between two strings of lengths n and m respectively in time O((s - |n - m|·min(m, n, s + m + n and linear space, where s is the edit distance between the two strings. This worst-case time bound sets the quadratic factor of the algorithm independent of the longest string length and improves existing theoretical bounds for this problem. The implementation of our algorithm also excels in practice, especially in cases where the two strings compared differ significantly in length. Conclusion We have provided the design, analysis and implementation of a new algorithm for calculating the edit distance of two strings with both theoretical and practical implications. Source code of our algorithm is available online.

  2. ERP Subsequent Memory Effects Differ between Inter-Item and Unitization Encoding Tasks.

    Science.gov (United States)

    Kamp, Siri-Maria; Bader, Regine; Mecklinger, Axel

    2017-01-01

    The "subsequent memory paradigm" is an analysis tool to identify brain activity elicited during episodic encoding that is associated with successful subsequent retrieval. Two commonly observed event-related potential "subsequent memory effects" (SMEs) are the parietal SME in the P300 time window and the frontal slow wave SME, but to date a clear characterization of the circumstances under which each SME is observed is missing. To test the hypothesis that the parietal SME occurs when aspects of an experience are unitized into a single item representation, while inter-item associative encoding is reflected in the frontal slow wave effect, participants were assigned to one of two conditions that emphasized one of the encoding types under otherwise matched study phases of a recognition memory experiment. Word pairs were presented either in the context of a definition that allowed to combine the word pairs into a new concept (unitization or item encoding) or together with a sentence frame (inter-item encoding). Performance on the recognition test did not differ between the groups. The parietal SME was only found in the definition group, supporting the idea that this SME occurs when the components of an association are integrated in a unitized item representation. An early prefrontal negativity also exhibited an SME only in this group, suggesting that the formation of novel units occurs through interactions of multiple brain areas. The frontal slow wave SME was pronounced in both groups and may thus reflect processes generally involved in encoding of associations. Our results provide evidence for a partial dissociation of the eliciting conditions of the two types of SMEs and therefore provide a tool for future studies to characterize the different types of episodic encoding.

  3. ERP Subsequent Memory Effects Differ between Inter-Item and Unitization Encoding Tasks

    Science.gov (United States)

    Kamp, Siri-Maria; Bader, Regine; Mecklinger, Axel

    2017-01-01

    The “subsequent memory paradigm” is an analysis tool to identify brain activity elicited during episodic encoding that is associated with successful subsequent retrieval. Two commonly observed event-related potential “subsequent memory effects” (SMEs) are the parietal SME in the P300 time window and the frontal slow wave SME, but to date a clear characterization of the circumstances under which each SME is observed is missing. To test the hypothesis that the parietal SME occurs when aspects of an experience are unitized into a single item representation, while inter-item associative encoding is reflected in the frontal slow wave effect, participants were assigned to one of two conditions that emphasized one of the encoding types under otherwise matched study phases of a recognition memory experiment. Word pairs were presented either in the context of a definition that allowed to combine the word pairs into a new concept (unitization or item encoding) or together with a sentence frame (inter-item encoding). Performance on the recognition test did not differ between the groups. The parietal SME was only found in the definition group, supporting the idea that this SME occurs when the components of an association are integrated in a unitized item representation. An early prefrontal negativity also exhibited an SME only in this group, suggesting that the formation of novel units occurs through interactions of multiple brain areas. The frontal slow wave SME was pronounced in both groups and may thus reflect processes generally involved in encoding of associations. Our results provide evidence for a partial dissociation of the eliciting conditions of the two types of SMEs and therefore provide a tool for future studies to characterize the different types of episodic encoding. PMID:28194105

  4. Additivity of dichromatic color matches to short-wavelength lights.

    Science.gov (United States)

    Nagy, A L

    1984-11-01

    The additivity of color matches to short-wavelength lights was examined in observers who behaved as red-green dichromats under the stimulus conditions used. Color matches were obtained at several luminance levels and on several different adapting backgrounds. The range of mixtures acceptable as a match and the midpoint of this range varied considerably over different conditions. However, for each observer, a set of mixtures that remained a match under all conditions could always be found. Results suggest that the additivity laws hold for these observers in the sense that there is a color match that remains a match under all conditions.

  5. Theory of fractional order elements based impedance matching networks

    KAUST Repository

    Radwan, Ahmed G.

    2011-03-01

    Fractional order circuit elements (inductors and capacitors) based impedance matching networks are introduced for the first time. In comparison to the conventional integer based L-type matching networks, fractional matching networks are much simpler and versatile. Any complex load can be matched utilizing a single series fractional element, which generally requires two elements for matching in the conventional approach. It is shown that all the Smith chart circles (resistance and reactance) are actually pairs of completely identical circles. They appear to be single for the conventional integer order case, where the identical circles completely overlap each other. The concept is supported by design equations and impedance matching examples. © 2010 IEEE.

  6. The importance of education-occupation matching in migration decisions.

    Science.gov (United States)

    Quinn, Michael A; Rubb, Stephen

    2005-02-01

    In this article, we present and test a model that incorporates education-occupation matching into the migration decision. The literature on education-occupation matching shows that earnings are affected by how individuals' education matches that required by their occupation. Accordingly, individuals with more schooling than required by their occupation have an additional incentive to migrate: the increase in earnings that occurs with a more beneficial education-occupation match. Using data from Mexico, we found statistical support for the importance of education-occupation matching in migration decisions. Education-occupation matching provides a plausible explanation for the mixed findings in the literature on the relationship between educational attainment and migration.

  7. Broadband electrical impedance matching for piezoelectric ultrasound transducers.

    Science.gov (United States)

    Huang, Haiying; Paramo, Daniel

    2011-12-01

    This paper presents a systematic method for designing broadband electrical impedance matching networks for piezoelectric ultrasound transducers. The design process involves three steps: 1) determine the equivalent circuit of the unmatched piezoelectric transducer based on its measured admittance; 2) design a set of impedance matching networks using a computerized Smith chart; and 3) establish the simulation model of the matched transducer to evaluate the gain and bandwidth of the impedance matching networks. The effectiveness of the presented approach is demonstrated through the design, implementation, and characterization of impedance matching networks for a broadband acoustic emission sensor. The impedance matching network improved the power of the acquired signal by 9 times.

  8. Generic Energy Matching Model and Figure of Matching Algorithm for Combined Renewable Energy Systems

    Directory of Open Access Journals (Sweden)

    J.C. Brezet

    2009-08-01

    Full Text Available In this paper the Energy Matching Model and Figure of Matching Algorithm which originally was dedicated only to photovoltaic (PV systems [1] are extended towards a Model and Algorithm suitable for combined systems which are a result of integration of two or more renewable energy sources into one. The systems under investigation will range from mobile portable devices up to the large renewable energy system conceivably to be applied at the Afsluitdijk (Closure- dike in the north of the Netherlands. This Afsluitdijk is the major dam in the Netherlands, damming off the Zuiderzee, a salt water inlet of the North Sea and turning it into the fresh water lake of the IJsselmeer. The energy chain of power supplies based on a combination of renewable energy sources can be modeled by using one generic Energy Matching Model as starting point.

  9. Matching occupation and self: does matching theory adequately model children's thinking?

    Science.gov (United States)

    Watson, Mark; McMahon, Mary

    2004-10-01

    The present exploratory-descriptive cross-national study focused on the career development of 11- to 14-yr.-old children, in particular whether they can match their personal characteristics with their occupational aspirations. Further, the study explored whether their matching may be explained in terms of a fit between person and environment using Holland's theory as an example. Participants included 511 South African and 372 Australian children. Findings relate to two items of the Revised Career Awareness Survey that require children to relate personal-social knowledge to their favorite occupation. Data were analyzed in three stages using descriptive statistics, i.e., mean scores, frequencies, and percentage agreement. The study indicated that children perceived their personal characteristics to be related to their occupational aspirations. However, how this matching takes place is not adequately accounted for in terms of a career theory such as that of Holland.

  10. Generic Energy Matching Model and Figure of Matching Algorithm for Combined Renewable Energy Systems

    Directory of Open Access Journals (Sweden)

    S. Y. Kan

    2009-08-01

    Full Text Available In this paper the Energy Matching Model and Figure of Matching Algorithm which originally was dedicated only to photovoltaic (PV systems [1] are extended towards a Model and Algorithm suitable for combined systems which are a result of integration of two or more renewable energy sources into one. The systems under investigation will range from mobile portable devices up to the large renewable energy system conceivably to be applied at the Afsluitdijk (Closure- dike in the north of the Netherlands. This Afsluitdijk is the major dam in the Netherlands, damming off the Zuiderzee, a salt water inlet of the North Sea and turning it into the fresh water lake of the IJsselmeer. The energy chain of power supplies based on a combination of renewable energy sources can be modeled by using one generic Energy Matching Model as starting point.

  11. The interaction between schema matching and record matching in data integration (extended abstract)

    KAUST Repository

    Gu, Binbin

    2017-05-18

    Schema Matching (SM) and Record Matching (RM) are two necessary steps in integrating multiple relational tables of different schemas, where SM unifies the schemas and RM detects records referring to the same real-world entity. The two processes have been thoroughly studied separately, but few attention has been paid to the interaction of SM and RM. In this work we find that, even alternating them in a simple manner, SM and RM can benefit from each other to reach a better integration performance (i.e., in terms of precision and recall). Therefore, combining SM and RM is a promising solution for improving data integration.

  12. Analysis of matches and partial-matches in a Danish STR data set

    DEFF Research Database (Denmark)

    Tvedebrink, Torben; Eriksen, Poul Svante; Curan, James Michael

    2012-01-01

    . [3] to compare the observed and expected number of matches and near matches in the data set. We extended the methods by computing the covariance matrix of the summary statistic and used it for the estimation of the identical-by-descent parameter, θ. The analysis demonstrated a number of close...... relatives in the Danish data set and substructure. The main contribution to the substructure comes from close relatives. An overall θ-value of 1% compensated for the observed substructure, when close familial relationships were accounted for....

  13. Vuvuzelas at South African soccer matches: Risks for spectators′ hearing

    Directory of Open Access Journals (Sweden)

    Lebogang Ramma

    2011-01-01

    Full Text Available South African Premier Soccer League (PSL matches are known worldwide as some of the noisiest recreational events. Therefore, the objectives of this study were to i measure noise levels during different PSL matches; ii measure changes in auditory function after attending PSL matches; and iii determine the factors that increase the risk of overexposure to noise during PSL matches. The study used a descriptive quantitative analytical pre- and post-exposure design. Participants (n = 19, and n = 10 attended two PSL matches. Each participant′s auditory function was assessed using distortion product oto-acoustic emissions (DPOAEs before and after attending a PSL match. Peak and equivalent continuous noise levels as well as noise dose were measured during each match. Noise levels recorded during the poorly attended Match 1 were lesser than those of the well-attended Match 2. Participants attending Match 2 had statistically significant reduction in their DPOAE amplitudes after the match (P = 0.003 than those attending Match 1. Vuvuzela blowers and participants seated within 1 m from them were most at risk of harm to their hearing with significant reduction in DPOAE amplitudes post the match (P = 0.002 and P = 0.008, respectively. It was therefore concluded that noise levels at well-attended South African PSL matches pose a significant risk to spectators′ auditory function as shown by reduced DPOAE amplitude post match attendance. Three risk factors for overexposure to noise during the match were identified: blowing the vuvuzela, close proximity to the individual blowing the vuvuzela as well as spectator turnout at the match.

  14. The subsequence weight distribution of summed maximum length digital sequences

    Science.gov (United States)

    Weathers, G. D.; Graf, E. R.; Wallace, G. R.

    1974-01-01

    An attempt is made to develop mathematical formulas to provide the basis for the design of pseudorandom signals intended for applications requiring accurate knowledge of the statistics of the signals. The analysis approach involves calculating the first five central moments of the weight distribution of subsequences of hybrid-sum sequences. The hybrid-sum sequence is formed from the modulo-two sum of k maximum length sequences and is an extension of the sum sequences formed from two maximum length sequences that Gilson (1966) evaluated. The weight distribution of the subsequences serves as an approximation to the filtering process. The basic reason for the analysis of hybrid-sum sequences is to establish a large group of sequences with good statistical properties. It is shown that this can be accomplished much more efficiently using the hybrid-sum approach rather than forming the group strictly from maximum length sequences.

  15. Medical abortion and the risk of subsequent adverse pregnancy outcomes

    DEFF Research Database (Denmark)

    Virk, Jasveer; Zhang, Jun; Olsen, Jørn

    2007-01-01

    BACKGROUND: The long-term safety of surgical abortion in the first trimester is well established. Despite the increasing use of medical abortion (abortion by means of medication), limited information is available regarding the effects of this procedure on subsequent pregnancies. METHODS: We...... identified all women living in Denmark who had undergone an abortion for nonmedical reasons between 1999 and 2004 and obtained information regarding subsequent pregnancies from national registries. Risks of ectopic pregnancy, spontaneous abortion, preterm birth (at ... weight (abortion were compared with risks in women who had had a first-trimester surgical abortion. RESULTS: Among 11,814 pregnancies in women who had had a previous first-trimester medical abortion (2710 women...

  16. Non melanoma skin cancer and subsequent cancer risk.

    Directory of Open Access Journals (Sweden)

    Judy R Rees

    Full Text Available INTRODUCTION: Several studies have shown an increased risk of cancer after non melanoma skin cancers (NMSC but the individual risk factors underlying this risk have not been elucidated, especially in relation to sun exposure and skin sensitivity to sunlight. PURPOSE: The aim of this study was to examine the individual risk factors associated with the development of subsequent cancers after non melanoma skin cancer. METHODS: Participants in the population-based New Hampshire Skin Cancer Study provided detailed risk factor data, and subsequent cancers were identified via linkage with the state cancer registry. Deaths were identified via state and national death records. A Cox proportional hazard model was used to estimate risk of subsequent malignancies in NMSC patients versus controls and to assess the potential confounding effects of multiple risk factors on this risk. RESULTS: Among 3584 participants, risk of a subsequent cancer (other than NMSC was higher after basal cell carcinoma (BCC (adjusted HR 1.40 [95% CI 1.15, 1.71] than squamous cell carcinoma (SCC (adjusted HR 1.18 [95% CI 0.95, 1.46] compared to controls (adjusted for age, sex and current cigarette smoking. After SCC, risk was higher among those diagnosed before age 60 (HR 1.96 [95% CI 1.24, 3.12]. An over 3-fold risk of melanoma after SCC (HR 3.62; 95% CI 1.85, 7.11 and BCC (HR 3.28; 95% CI 1.66, 6.51 was observed, even after further adjustment for sun exposure-related factors and family history of skin cancer. In men, prostate cancer incidence was higher after BCC compared to controls (HR 1.64; 95% CI 1.10, 2.46. CONCLUSIONS: Our population-based study indicates an increased cancer risk after NMSC that cannot be fully explained by known cancer risk factors.

  17. Orca Behavior and Subsequent Aggression Associated with Oceanarium Confinement

    OpenAIRE

    Anderson, Robert; Waayers, Robyn; Knight, Andrew

    2016-01-01

    Simple Summary Orca behaviors interacting with humans within apparent friendship bonds are reviewed, and some impediments to the human evaluation of delphinid intelligence are discussed. The subsequent involvement of these orcas and their offspring in aggressive incidents with humans is also documented and examined. This is particularly relevant given that the highest recorded rates of aggressive incidents have occurred among orcas who had previously established unstructured human friendship ...

  18. Orientation During Initial Learning and Subsequent Discrimination of Faces

    Science.gov (United States)

    Cohen, Malcolm M.; Holton, Emily M. (Technical Monitor)

    1997-01-01

    Discrimination of facial features degrades with stimulus rotation (e.g., the "Margaret Thatcher" effect). Thirty-two observers learned to discriminate between two upright, or two inverted, faces. Images, erect and rotated by +/-45deg, +/-90deg, +/-135deg and 180deg about the line of sight, were presented on a computer screen. Initial discriminative reaction times increased with stimulus rotation only for observers who learned the upright faces. Orientation during learning is critical in identifying faces subsequently seen at different orientations.

  19. Long Common Subsequences and the Proximity of two Random Strings.

    Science.gov (United States)

    1980-11-06

    Subsequently, Sankoff and Cedergren (1973), and Sankoff, Cedergren , and Lapalme (1976) considered a number of empirical cases and conducted some Monte Carlo...Sci. U.S.A. 69, 4-6. Sankoff, D. and Cedergren , R.J. (1973). A test for nucleotide sequence homology, J. Mol. Biol., 77, 159-164. Sankoff, D... Cedergren , R.J., and Lapalme, G. (1976). Frequency of insertion-deletion, transversion, and transition in evolution of 5S ribosomal RNA, J. Molecular

  20. Non Melanoma Skin Cancer and Subsequent Cancer Risk

    Science.gov (United States)

    Rees, Judy R.; Zens, M. Scot; Gui, Jiang; Celaya, Maria O.; Riddle, Bruce L.; Karagas, Margaret R.

    2014-01-01

    Introduction Several studies have shown an increased risk of cancer after non melanoma skin cancers (NMSC) but the individual risk factors underlying this risk have not been elucidated, especially in relation to sun exposure and skin sensitivity to sunlight. Purpose The aim of this study was to examine the individual risk factors associated with the development of subsequent cancers after non melanoma skin cancer. Methods Participants in the population-based New Hampshire Skin Cancer Study provided detailed risk factor data, and subsequent cancers were identified via linkage with the state cancer registry. Deaths were identified via state and national death records. A Cox proportional hazard model was used to estimate risk of subsequent malignancies in NMSC patients versus controls and to assess the potential confounding effects of multiple risk factors on this risk. Results Among 3584 participants, risk of a subsequent cancer (other than NMSC) was higher after basal cell carcinoma (BCC) (adjusted HR 1.40 [95% CI 1.15, 1.71]) than squamous cell carcinoma (SCC) (adjusted HR 1.18 [95% CI 0.95, 1.46]) compared to controls (adjusted for age, sex and current cigarette smoking). After SCC, risk was higher among those diagnosed before age 60 (HR 1.96 [95% CI 1.24, 3.12]). An over 3-fold risk of melanoma after SCC (HR 3.62; 95% CI 1.85, 7.11) and BCC (HR 3.28; 95% CI 1.66, 6.51) was observed, even after further adjustment for sun exposure-related factors and family history of skin cancer. In men, prostate cancer incidence was higher after BCC compared to controls (HR 1.64; 95% CI 1.10, 2.46). Conclusions Our population-based study indicates an increased cancer risk after NMSC that cannot be fully explained by known cancer risk factors. PMID:24937304

  1. Influences of multisensory experience on subsequent unisensory processing

    Directory of Open Access Journals (Sweden)

    Ladan eShams

    2011-10-01

    Full Text Available Multisensory perception has been the focus of intense research in recent years. It is now well established that crossmodal interactions are ubiquitous in perceptual processing and endow the system with improved precision, accuracy, processing speed, etc. While these findings have shed much light on principles and mechanisms of perception, ultimately it is not very surprising that multiple sources of information provide benefits in performance compared to a single source of information.Here, we argue that the more surprising recent findings are those showing that multisensory experience also influences the subsequent unisensory processing. For example, exposure to auditory-visual stimuli, can change the way auditory or visual stimuli are processed subsequently even in isolation. We review three sets of findings that represent three different types of learning ranging from perceptual learning, to sensory recalibration, to associative learning. In all these cases exposure to multisensory stimuli profoundly influences the subsequent unisensory processing. This diversity of phenomena may suggest that continuous modification of unisensory representations by multisensory relationships may be a general learning strategy used by the brain.

  2. The late positive potential predicts subsequent interference with target processing.

    Science.gov (United States)

    Weinberg, Anna; Hajcak, Greg

    2011-10-01

    The current study investigated the association between neural engagement with task-irrelevant images and subsequent interference with target processing using the Emotional Interrupt paradigm [Mitchell, D., Richell, R., Leonard, A., & Blair, R. Emotion at the expense of cognition: Psychopathic individuals outperform controls on an operant response task. Journal of Abnormal Psychology, 115, 559, 2006]. Consistent with previous studies, PCA-derived factors corresponding to the early posterior negativity, P300, and late positive potential (LPP) were enhanced for emotional (i.e., both unpleasant and pleasant) compared with neutral distracters, and the P300 elicited by targets was smaller following emotional compared with neutral pictures. In addition, RTs were increased to targets that followed emotional pictures. Within-subject analyses demonstrated that slow trials were characterized by a smaller P300 and were preceded by pictures with a larger LPP. Additionally, between-subject analyses indicate that individuals with a larger LPP also demonstrated slower RTs to targets and reduced target-elicited P300s. All results were specific to the LPP and were not observed for either the early posterior negativity or the P300 elicited by task-irrelevant pictures. By relating the LPP to subsequent behavioral and ERP interference in both within- and between-subject analyses, the current study provides direct support for the notion that LPP indexes attentional engagement with visual stimuli that is uniquely associated with subsequent interference in terms of both RT slowing and P300 reduction to targets.

  3. Variation in masticatory muscle activity during subsequent, submaximal clenching efforts.

    Science.gov (United States)

    Lobbezoo, F; Huddleston Slater, J J R

    2002-06-01

    In previous studies to the relative contribution of the jaw closing muscles to the maintenance of submaximal clenching levels, a considerable variation in the electromyography (EMG) activities of these muscles during subsequent efforts was found. In this study, it was examined to what extent this variation could be explained by coincidental variations in mandibular positioning. From seven healthy individuals, a total of 90 EMG sweeps was recorded: three conditions (intercuspal position and two types of stabilization appliances) x three clenching levels (10, 30 and 50% of maximum voluntary contraction level) x 10 repetitions. Mandibular position was monitored with a six degrees of freedom opto-electronic jaw movement recording system. Variations in mandibular positioning during subsequent, submaximal clenching efforts explained up to 25% of the variance in the indices that quantify the relative contribution of the jaw closing muscles to the total clenching effort (P=0.000; ANOVA). Only a weak dependency of positioning upon clenching condition was found whereas during higher clenching levels, the positioning effect tended to be smaller than during lower levels. In conclusion small, coincidental variations in mandibular positioning during subsequent clenching efforts partly explain the variance in EMG activity of jaw closing muscles, especially at lower clenching levels.

  4. Effect of skipping breakfast on subsequent energy intake.

    Science.gov (United States)

    Levitsky, David A; Pacanowski, Carly R

    2013-07-02

    The objective was to examine the effect of consuming breakfast on subsequent energy intake. Participants who habitually ate breakfast and those who skipped breakfast were recruited for two studies. Using a randomized crossover design, the first study examined the effect of having participants consume either (a) no breakfast, (b) a high carbohydrate breakfast (335 kcals), or (c) a high fiber breakfast (360 kcals) on three occasions and measured ad libitum intake at lunch. The second study again used a randomized crossover design but with a larger, normal carbohydrate breakfast consumed ad libtum. Intake averaged 624 kcals and subsequent food intake was measured throughout the day. Participants ate only foods served from the Cornell Human Metabolic Research Unit where all foods were weighed before and after consumption. In the first study, neither eating breakfast nor the kind of breakfast consumed had an effect on the amount consumed at lunch despite a reduction in hunger ratings. In the second study, intake at lunch as well as hunger ratings were significantly increased after skipping breakfast (by 144 kcal), leaving a net caloric deficit of 408 kcal by the end of the day. These data are consistent with published literature demonstrating that skipping a meal does not result in accurate energy compensation at subsequent meals and suggests that skipping breakfast may be an effective means to reduce daily energy intake in some adults.

  5. Counting permutations with no long monotone subsequence via generating trees

    CERN Document Server

    Bousquet-Mélou, Mireille

    2010-01-01

    We recover Gessel's determinantal formula for the generating function of permutations with no ascending subsequence of length m+1. The starting point of our proof is the recursive construction of these permutations by insertion of the largest entry. This construction is of course extremely simple. The cost of this simplicity is that we need to take into account in the enumeration m-1 additional parameters --- namely, the positions of the leftmost increasing subsequences of length i, for i=2,...,m. This yields for the generating function a functional equation with m-1 "catalytic" variables, and the heart of the paper is the solution of this equation. We perform a similar task for involutions with no descending subsequence of length m+1, constructed recursively by adding a cycle containing the largest entry. We refine this result by keeping track of the number of fixed points. In passing, we prove that the ordinary generating functions of these families of permutations can be expressed as constant terms of rati...

  6. Alternative confidence measure for local matching stereo algorithms

    CSIR Research Space (South Africa)

    Ndhlovu, T

    2009-11-01

    Full Text Available The authors present a confidence measure applied to individual disparity estimates in local matching stereo correspondence algorithms. It aims at identifying textureless areas, where most local matching algorithms fail. The confidence measure works...

  7. 78 FR 37648 - Space Transportation Infrastructure Matching (STIM) Grants Program

    Science.gov (United States)

    2013-06-21

    ... Federal Aviation Administration Space Transportation Infrastructure Matching (STIM) Grants Program AGENCY: Federal Aviation Administration (FAA), DOT. ACTION: Notice of non-availability of Space Transportation Infrastructure Matching Grants in FY 2013. SUMMARY: The Office of Commercial Space Transportation (AST) will...

  8. 32 CFR 701.125 - Computer matching program.

    Science.gov (United States)

    2010-07-01

    ... counterintelligence matches done in the course of performing a background check for security clearances of Federal... number of computer matches expected, for their approval/disapproval. (g) Questions. CNO (DNS-36... CNO (DNS-36)....

  9. Turbine adapted maps for turbocharger engine matching

    Energy Technology Data Exchange (ETDEWEB)

    Tancrez, M. [PSA - Peugeot Citroen, 18 rue des fauvelles, La Garenne-Colombes (France); Galindo, J.; Guardiola, C.; Fajardo, P.; Varnier, O. [CMT - Motores Termicos, Universidad Politecnica de Valencia (Spain)

    2011-01-15

    This paper presents a new representation of the turbine performance maps oriented for turbocharger characterization. The aim of this plot is to provide a more compact and suited form to implement in engine simulation models and to interpolate data from turbocharger test bench. The new map is based on the use of conservative parameters as turbocharger power and turbine mass flow to describe the turbine performance in all VGT positions. The curves obtained are accurately fitted with quadratic polynomials and simple interpolation techniques give reliable results. Two turbochargers characterized in an steady flow rig were used for illustrating the representation. After being implemented in a turbocharger submodel, the results obtained with the model have been compared with success against turbine performance evaluated in engine tests cells. A practical application in turbocharger matching is also provided to show how this new map can be directly employed in engine design. (author)

  10. Sequence Matching Analysis for Curriculum Development

    Directory of Open Access Journals (Sweden)

    Liem Yenny Bendatu

    2015-06-01

    Full Text Available Many organizations apply information technologies to support their business processes. Using the information technologies, the actual events are recorded and utilized to conform with predefined model. Conformance checking is an approach to measure the fitness and appropriateness between process model and actual events. However, when there are multiple events with the same timestamp, the traditional approach unfit to result such measures. This study attempts to develop a sequence matching analysis. Considering conformance checking as the basis of this approach, this proposed approach utilizes the current control flow technique in process mining domain. A case study in the field of educational process has been conducted. This study also proposes a curriculum analysis framework to test the proposed approach. By considering the learning sequence of students, it results some measurements for curriculum development. Finally, the result of the proposed approach has been verified by relevant instructors for further development.

  11. Matching Medical Websites to Medical Guidelines

    Directory of Open Access Journals (Sweden)

    Dusan Rak

    2016-01-01

    Full Text Available The quality of medical texts provided to general public on the Internet is a serious issue nowadays. Unfortunately the only feasible way to approve the adequacy of the medical information content is human verification today. Best practices in medicine are systematically captured by medical guidelines (MGLs, which are provided by renowned medical societies. We propose a simple approach to exploiting MGL content as ’gold standard’ for the assessment of content quality in medical web sites (WS, based on the idea that the information content is reflected in the domain terminology used. Concept candidates discovered in a MGL and in the tested web pages are matched to the UMLS terminological system. In a small case study, MGLs and WSs have been analyzed for similarity at term and concept level. The research is a step towards automated evaluation of WS content on the basis of MGLs as the quality standard.

  12. Edge-Matching Problems with Rotations

    DEFF Research Database (Denmark)

    Ebbesen, Martin; Fischer, Paul; Witt, Carsten

    2011-01-01

    Edge-matching problems, also called puzzles, are abstractions of placement problems with neighborhood conditions. Pieces with colored edges have to be placed on a board such that adjacent edges have the same color. The problem has gained interest recently with the (now terminated) Eternity II...... puzzle, and new complexity results. In this paper we consider a number of settings which differ in size of the puzzles and the manipulations allowed on the pieces. We investigate the effect of allowing rotations of the pieces on the complexity of the problem, an aspect that is only marginally treated so...... far. We show that some problems have polynomial time algorithms while others are NP-complete. Especially we show that allowing rotations in one-row puzzles makes the problem NP-hard. We moreover show that many commonly considered puzzles can be emulated by simple puzzles with quadratic pieces, so...

  13. Nonparabolic solar concentrators matching the parabola.

    Science.gov (United States)

    Cooper, Thomas; Schmitz, Max; Good, Philipp; Ambrosetti, Gianluca; Pedretti, Andrea; Steinfeld, Aldo

    2014-08-01

    We consider the limit of geometric concentration for a focusing concave mirror, e.g., a parabolic trough or dish, designed to collect all radiation within a finite acceptance angle and direct it to a receiver with a flat or circular cross-section. While a concentrator with a parabolic cross-section indeed achieves this limit, it is not the only geometry capable of doing so. We demonstrate that there are infinitely many solutions. The significance of this finding is that geometries which can be more easily constructed than the parabola can be utilized without loss of concentration, thus presenting new avenues for reducing the cost of solar collectors. In particular, we investigate a low-cost trough mirror profile which can be constructed by inflating a stack of thin polymer membranes and show how it can always be designed to match the geometric concentration of a parabola of similar form.

  14. Strong solutions of semilinear matched microstructure models

    CERN Document Server

    Escher, Joachim

    2011-01-01

    The subject of this article is a matched microstructure model for Newtonian fluid flows in fractured porous media. This is a homogenized model which takes the form of two coupled parabolic differential equations with boundary conditions in a given (two-scale) domain in Euclidean space. The main objective is to establish the local well-posedness in the strong sense of the flow. Two main settings are investigated: semi-linear systems with linear boundary conditions and semi-linear systems with nonlinear boundary conditions. With the help of analytic semigoups we establish local well-posedness and investigate the long-time behaviour of the solutions in the first case: we establish global existence and show that solutions converge to zero at an exponential rate.

  15. Automated spectral classification using template matching

    Institute of Scientific and Technical Information of China (English)

    Fu-Qing Duan; Rong Liu; Ping Guo; Ming-Quan Zhou; Fu-Chao Wu

    2009-01-01

    An automated spectral classification technique for large sky surveys is pro-posed. We firstly perform spectral line matching to determine redshift candidates for an observed spectrum, and then estimate the spectral class by measuring the similarity be-tween the observed spectrum and the shifted templates for each redshift candidate. As a byproduct of this approach, the spectral redshift can also be obtained with high accuracy. Compared with some approaches based on computerized learning methods in the liter-ature, the proposed approach needs no training, which is time-consuming and sensitive to selection of the training set. Both simulated data and observed spectra are used to test the approach; the results show that the proposed method is efficient, and it can achieve a correct classification rate as high as 92.9%, 97.9% and 98.8% for stars, galaxies and quasars, respectively.

  16. Mode matching for optimal plasmonic nonlinear generation

    Science.gov (United States)

    O'Brien, Kevin; Suchowski, Haim; Rho, Jun Suk; Kante, Boubacar; Yin, Xiaobo; Zhang, Xiang

    2013-03-01

    Nanostructures and metamaterials have attracted interest in the nonlinear optics community due to the possibility of engineering their nonlinear responses; however, the underlying physics to describe nonlinear light generation in nanostructures and the design rules to maximize the emission are still under debate. We study the geometry dependence of the second harmonic and third harmonic emission from gold nanostructures, by designing arrays of nanostructures whose geometry varies from bars to split ring resonators. We fix the length (and volume) of the nanostructure on one axis, and change the morphology from a split ring resonator on the other axis. We observed that the optimal second harmonic generation does not occur at the morphology indicated by a nonlinear oscillator model with parameters derived from the far field transmission and is not maximized by a spectral overlap of the plasmonic modes; however, we find a near field overlap integral and mode matching considerations accurately predict the optimal geometry.

  17. Robust Face Recognition through Local Graph Matching

    Directory of Open Access Journals (Sweden)

    Ehsan Fazl-Ersi

    2007-09-01

    Full Text Available A novel face recognition method is proposed, in which face images are represented by a set of local labeled graphs, each containing information about the appearance and geometry of a 3-tuple of face feature points, extracted using Local Feature Analysis (LFA technique. Our method automatically learns a model set and builds a graph space for each individual. A two-stage method for optimal matching between the graphs extracted from a probe image and the trained model graphs is proposed. The recognition of each probe face image is performed by assigning it to the trained individual with the maximum number of references. Our approach achieves perfect result on the ORL face set and an accuracy rate of 98.4% on the FERET face set, which shows the superiority of our method over all considered state-of-the-art methods. I

  18. Non-perturbative match of ultraviolet renormalon

    CERN Document Server

    Zakharov, V I

    2003-01-01

    The paper is motivated by observation of a kind of branes in the vacuum state of the lattice SU(2) gluodynamics. The branes represent two-dimensional vortices whose total area scales in physical units while the non-Abelian action diverges in the ultraviolet. We consider the question whether effects of the branes can be accommodated into the continuum theory. We demonstrate that at least in case of the gluon condensate (plaquette action) and of the heavy quark potential the contribution of the branes corresponds to the ultraviolet renormalon. Thus, the vortices might represent a non-perturbative match of the ultraviolet renormalon. Such an identification constrains, in turn, properties of the branes.

  19. Symmetric Circular Matchings and RNA Folding

    DEFF Research Database (Denmark)

    Hofacker, Ivo L.; Reidys, Christian; Stadler, Peter F.

    2012-01-01

    RNA secondary structures can be computed as optimal solutions of certain circular matching problems. An accurate treatment of this energy minimization problem has to account for the small --- but non-negligible --- entropic destabilization of secondary structures with non-trivial automorphisms....... Such intrinsic symmetries are typically excluded from algorithmic approaches, however, because the effects are small, they play a role only for RNAs with symmetries at sequence level, and they appear only in particular settings that are less frequently used in practical application, such as circular folding...... or the co-folding of two or more identical RNAs. Here, we show that the RNA folding problem with symmetry terms can still be solved with polynomial-time algorithms. Empirically, the fraction of symmetric ground state structures decreases with chain length, so that the error introduced by neglecting...

  20. Matched filtering with interferometric 21 cm experiments

    Science.gov (United States)

    White, Martin; Padmanabhan, Nikhil

    2017-10-01

    A new generation of interferometric instruments is emerging, which aims to use intensity mapping of redshifted 21 cm radiation to measure the large-scale structure of the Universe at z ≃ 1-2 over wide areas of the sky. While these instruments typically have limited angular resolution, they cover huge volumes and thus can be used to provide large samples of rare objects. In this paper we study how well such instruments could find spatially extended large-scale structures, such as cosmic voids, using a matched filter formalism. Such a formalism allows us to work in Fourier space, the natural space for interferometers, and to study the impact of finite u - v coverage, noise and foregrounds on our ability to recover voids. We find that in the absence of foregrounds, such instruments would provide enormous catalogs of voids, with high completeness, but that control of foregrounds is key to realizing this goal.

  1. Matching the Market for Heart Transplantation.

    Science.gov (United States)

    Hsich, Eileen M

    2016-04-01

    Heart transplantation is the most effective therapy for patients with Stage D heart failure with a median life expectancy of ≈10 to 15 years. Unfortunately, many patients die on the waiting list hoping for a chance of survival. The life boat cannot rescue everyone. Over a decade, the donor pool has remained relatively stable, whereas the number of heart transplant candidates has risen. Potential recipients often have many comorbidities and are older because the criteria for heart transplantation has few absolute contraindications. Women, Hispanics, and patients with restrictive heart disease and congenital heart disease are more likely to die while awaiting heart transplantation than men, white patients, and those with either ischemic or dilated cardiomyopathy. To better match the market, we need to (1) increase the donor pool, (2) reduce the waitlist, and (3) improve the allocation system. This review article addresses all 3 options and compares strategies in the United States to those in other countries.

  2. Matching Hagedorn mass spectrum with Lattice QCD

    CERN Document Server

    Lo, Pok Man; Redlich, Krzysztof; Sasaki, Chihiro

    2015-01-01

    Based on recent Lattice QCD (LQCD) results obtained at finite temperature, we discuss modeling of the hadronic phase of QCD in the framework of Hadron Resonance Gas (HRG) with discrete and continuous mass spectra. We focus on fluctuations of conserved charges, and show how a common limiting temperature can be used to constrain the Hagedorn exponential mass spectrum in different sectors of quantum number, through a matching of HRG and LQCD. For strange baryons, the extracted spectra are found to be consistent with all known and expected states listed by the Particle Data Group (PDG). The strange-mesonic sector, however, requires additional states in the intermediate mass range beyond that embodied in the database.

  3. Ghost publications in the pediatric surgery match.

    Science.gov (United States)

    Gasior, Alessandra C; Knott, E Marty; Fike, Frankie B; Moratello, Vincent E; St Peter, Shawn D; Ostlie, Daniel J; Snyder, Charles L

    2013-09-01

    Pediatric surgery fellowship is considered one of the most competitive subspecialties in medicine. With fierce competition increasing the stakes, publications and first authorship are paramount to the success rate of matching. We analyzed Electronic Residency Application Service applications for verification of authorship to determine rate of misrepresentation. After institutional review board approval, the bibliographies of fellowship applications from 2007-2009 were reviewed to allow time for publication. Only peer-reviewed journal articles were evaluated. A Medline search was conducted for the article, by author or by title. If the article could not be found, other authors and journal were used as search parameters. If the article was still not found, the website for the journal was searched for abstract or manuscript. Finally, an experienced medical sciences librarian was consulted for remaining unidentified articles. Differences between misrepresented and accurate applications were analyzed, including: age, gender, medical and undergraduate school parameters, advanced degrees, other fellowships, number of publications, first author publications, American Board of Surgery In-Training Examination scores, and match success. There were 147 applications reviewed. Evidence of misrepresentation was found in 17.6% of the applicants (24/136), with 34 instances in 785 manuscripts (4.3%). Manuscripts classified as published were verified 96.7% of the time, were not found in 1.4%, and had incorrect authors or journal in less than 1% each. "In press" manuscripts were verified 88.3% of the time, 6.4% could not be found, and 4.3% had an incorrect journal listing. Number of publications (P = 0.026) and first author publications (P = 0.037) correlated with misrepresentation. None of the remaining variables was significant. The pediatric surgical pool has a very low incidence of suspicious citations; however, authorship claims should be verified. Copyright © 2013 Elsevier Inc

  4. MATCHING ALTERNATIVE ADDRESSES: A SEMANTIC WEB APPROACH

    Directory of Open Access Journals (Sweden)

    S. Ariannamazi

    2015-12-01

    Full Text Available Rapid development of crowd-sourcing or volunteered geographic information (VGI provides opportunities for authoritatives that deal with geospatial information. Heterogeneity of multiple data sources and inconsistency of data types is a key characteristics of VGI datasets. The expansion of cities resulted in the growing number of POIs in the OpenStreetMap, a well-known VGI source, which causes the datasets to outdate in short periods of time. These changes made to spatial and aspatial attributes of features such as names and addresses might cause confusion or ambiguity in the processes that require feature’s literal information like addressing and geocoding. VGI sources neither will conform specific vocabularies nor will remain in a specific schema for a long period of time. As a result, the integration of VGI sources is crucial and inevitable in order to avoid duplication and the waste of resources. Information integration can be used to match features and qualify different annotation alternatives for disambiguation. This study enhances the search capabilities of geospatial tools with applications able to understand user terminology to pursuit an efficient way for finding desired results. Semantic web is a capable tool for developing technologies that deal with lexical and numerical calculations and estimations. There are a vast amount of literal-spatial data representing the capability of linguistic information in knowledge modeling, but these resources need to be harmonized based on Semantic Web standards. The process of making addresses homogenous generates a helpful tool based on spatial data integration and lexical annotation matching and disambiguating.

  5. Personalized trajectory matching in spatial networks

    KAUST Repository

    Shang, Shuo

    2013-07-31

    With the increasing availability of moving-object tracking data, trajectory search and matching is increasingly important. We propose and investigate a novel problem called personalized trajectory matching (PTM). In contrast to conventional trajectory similarity search by spatial distance only, PTM takes into account the significance of each sample point in a query trajectory. A PTM query takes a trajectory with user-specified weights for each sample point in the trajectory as its argument. It returns the trajectory in an argument data set with the highest similarity to the query trajectory. We believe that this type of query may bring significant benefits to users in many popular applications such as route planning, carpooling, friend recommendation, traffic analysis, urban computing, and location-based services in general. PTM query processing faces two challenges: how to prune the search space during the query processing and how to schedule multiple so-called expansion centers effectively. To address these challenges, a novel two-phase search algorithm is proposed that carefully selects a set of expansion centers from the query trajectory and exploits upper and lower bounds to prune the search space in the spatial and temporal domains. An efficiency study reveals that the algorithm explores the minimum search space in both domains. Second, a heuristic search strategy based on priority ranking is developed to schedule the multiple expansion centers, which can further prune the search space and enhance the query efficiency. The performance of the PTM query is studied in extensive experiments based on real and synthetic trajectory data sets. © 2013 Springer-Verlag Berlin Heidelberg.

  6. The Interaction Between Schema Matching and Record Matching in Data Integration

    KAUST Repository

    Gu, Binbin

    2016-09-20

    Schema Matching (SM) and Record Matching (RM) are two necessary steps in integrating multiple relational tables of different schemas, where SM unifies the schemas and RM detects records referring to the same real-world entity. The two processes have been thoroughly studied separately, but few attention has been paid to the interaction of SM and RM. In this work, we find that, even alternating them in a simple manner, SM and RM can benefit from each other to reach a better integration performance (i.e., in terms of precision and recall). Therefore, combining SM and RM is a promising solution for improving data integration. To this end, we define novel matching rules for SM and RM, respectively, that is, every SM decision is made based on intermediate RM results, and vice versa, such that SM and RM can be performed alternately. The quality of integration is guaranteed by a Matching Likelihood Estimation model and the control of semantic drift, which prevent the effect of mismatch magnification. To reduce the computational cost, we design an index structure based on q-grams and a greedy search algorithm that can reduce around 90 percent overhead of the interaction. Extensive experiments on three data collections show that the combination and interaction between SM and RM significantly outperforms previous works that conduct SM and RM separately.

  7. Emergent Identity Matching after Successive Matching Training, I: Reflexivity or Generalized Identity?

    Science.gov (United States)

    Urcuioli, Peter J.

    2011-01-01

    This research investigated the source of an ostensible reflexivity effect in pigeons reported by Sweeney and Urcuioli (2010). In Experiment 1, pigeons learned two symmetrically reinforced symbolic successive matching tasks (hue-form and form-hue) using red-green and triangle-horizontal line stimuli. They differed in their third concurrently…

  8. Intact School Matching in Education: Exploring the Relative Importance of Focal and Local Matching

    Science.gov (United States)

    Wong, Vivian C.; Hallberg, Kelly; Cook, Thomas D.

    2013-01-01

    The nested data structure inherent in education (i.e. students nested in schools nested in districts) makes intact school matching an appealing approach in observational studies of educational interventions and policies for both theoretical and practical purposes. This paper provides guidance to applied education researchers who are employing…

  9. Multiple Pattern Matching Algorithm using Pair-count

    OpenAIRE

    Raju Bhukya; D. V. L. N. Somayajulu

    2011-01-01

    Pattern matching occurs in various applications, ranging from simple text searching in word processors to identification of common motifs in DNA sequences in computational biology. The problem of exact pattern matching has been well studied and a number of efficient algorithms already exist. However these exact pattern matching algorithms are of little help when they are applied to finding patterns in DNA sequences. Pattern matching in a DNA sequence or pattern searching from a large data bas...

  10. On the Eigenvalue Two and Matching Number of a Tree

    Institute of Scientific and Technical Information of China (English)

    Yi-zheng Fan

    2004-01-01

    In [6], Guo and Tan have shown that 2 is a Laplacian eigenvalue of any tree with perfect matchings.For trees without perfect matchings, we study whether 2 is one of its Laplacian eigenvalues. If the matchingnumber is 1 or 2, the answer is negative; otherwise, there exists a tree with that matching number which has (hasnot) the eigenvalue 2. In particular, we determine all trees with matching number 3 which has the eigenvalue2.

  11. Impedance matching through a single passive fractional element

    KAUST Repository

    Radwan, Ahmed Gomaa

    2012-07-01

    For the first time, a generalized admittance Smith chart theory is introduced to represent fractional order circuit elements. The principles of fractional order matching circuits are described. We show that for fractional order α < 1, a single parallel fractional element can match a wider range of load impedances as compared to its series counterpart. Several matching examples demonstrate the versatility of fractional order series and parallel element matching as compared to the conventional approach. © 2012 IEEE.

  12. Tailoring science outreach through E-matching using a community-based participatory approach.

    Directory of Open Access Journals (Sweden)

    Bernice B Rumala

    2011-03-01

    Full Text Available In an effort to increase science exposure for pre-college (K-12 students and as part of the science education reform agenda, many biomedical research institutions have established university-community partnerships. Typically, these science outreach programs consist of pre-structured, generic exposure for students, with little community engagement. However, the use of a medium that is accessible to both teachers and scientists, electronic web-based matchmaking (E-matching provides an opportunity for tailored outreach utilizing a community-based participatory approach (CBPA, which involves all stakeholders in the planning and implementation of the science outreach based on the interests of teachers/students and scientists. E-matching is a timely and urgent endeavor that provides a rapid connection for science engagement between teachers/students and experts in an effort to fill the science outreach gap. National Lab Network (formerly National Lab Day, an ongoing initiative to increase science equity and literacy, provides a model for engaging the public in science via an E-matching and hands-on learning approach. We argue that science outreach should be a dynamic endeavor that changes according to the needs of a target school. We will describe a case study of a tailored science outreach activity in which a public school that serves mostly under-represented minority students from disadvantaged backgrounds were E-matched with a university, and subsequently became equal partners in the development of the science outreach plan. In addition, we will show how global science outreach endeavors may utilize a CBPA, like E-matching, to support a pipeline to science among under-represented minority students and students from disadvantaged backgrounds. By merging the CBPA concept with a practical case example, we hope to inform science outreach practices via the lens of a tailored E-matching approach.

  13. 78 FR 15730 - Privacy Act of 1974; Computer Matching Program

    Science.gov (United States)

    2013-03-12

    ... SECURITY Office of the Secretary Privacy Act of 1974; Computer Matching Program AGENCY: U.S. Citizenship...: Privacy Act of 1974; Computer Matching Program between the Department of Homeland Security, U.S... notice of the existence of a computer matching program between the Department of Homeland Security,...

  14. 76 FR 11435 - Privacy Act of 1974; Computer Matching Program

    Science.gov (United States)

    2011-03-02

    ... the Social Security Administration (SSA) (source agency). This renewal of the computer matching... Privacy Act of 1974; Computer Matching Program AGENCY: Department of Education. ACTION: Notice--Computer Matching between the U.S. Department of Education and the Social Security Administration. SUMMARY:...

  15. a New Paradigm for Matching - and Aerial Images

    Science.gov (United States)

    Koch, T.; Zhuo, X.; Reinartz, P.; Fraundorfer, F.

    2016-06-01

    This paper investigates the performance of SIFT-based image matching regarding large differences in image scaling and rotation, as this is usually the case when trying to match images captured from UAVs and airplanes. This task represents an essential step for image registration and 3d-reconstruction applications. Various real world examples presented in this paper show that SIFT, as well as A-SIFT perform poorly or even fail in this matching scenario. Even if the scale difference in the images is known and eliminated beforehand, the matching performance suffers from too few feature point detections, ambiguous feature point orientations and rejection of many correct matches when applying the ratio-test afterwards. Therefore, a new feature matching method is provided that overcomes these problems and offers thousands of matches by a novel feature point detection strategy, applying a one-to-many matching scheme and substitute the ratio-test by adding geometric constraints to achieve geometric correct matches at repetitive image regions. This method is designed for matching almost nadir-directed images with low scene depth, as this is typical in UAV and aerial image matching scenarios. We tested the proposed method on different real world image pairs. While standard SIFT failed for most of the datasets, plenty of geometrical correct matches could be found using our approach. Comparing the estimated fundamental matrices and homographies with ground-truth solutions, mean errors of few pixels can be achieved.

  16. Matching Strategies for Observational Data with Multilevel Structure

    Science.gov (United States)

    Steiner, Peter M.

    2011-01-01

    Given the different possibilities of matching in the context of multilevel data and the lack of research on corresponding matching strategies, the author investigates two main research questions. The first research question investigates the advantages and disadvantages of different matching strategies that can be pursued with multilevel data…

  17. Research on Data Processing Technology in Table Tennis Match

    National Research Council Canada - National Science Library

    Li Peng

    2016-01-01

    ... of data processing in table tennis match, which is based on the study of the field knowledge and the technology of data processing. (Results) the statistical analysis system of the technical and tactical statistics of table tennis of match, and the analysis of the technique and tactics of table tennis match with computer. The problems caused by t...

  18. Exploiting Best-Match Equations for Efficient Reinforcement Learning

    NARCIS (Netherlands)

    Seijen, H.H. van; Whiteson, S.; Hasselt, H. van; Wiering, M.

    2011-01-01

    This article presents and evaluates best-match learning, a new approach to reinforcement learning that trades off the sample efficiency of model-based methods with the space efficiency of model-free methods. Best-match learning works by approximating the solution to a set of best-match equations,

  19. An Inductive Characterization of Matching in Binding Bigraphs

    DEFF Research Database (Denmark)

    Damgaard, Troels Christoffer; Glenstrup, Arne John; Birkedal, Lars

    2010-01-01

    We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching in bigraphs with binding. Our results yield a specification for a provably correct matching algorithm, as needed by our prototype tool implementing bigraphical react...... reactive systems....

  20. 32 CFR 310.53 - Computer matching agreements (CMAs).

    Science.gov (United States)

    2010-07-01

    ... 32 National Defense 2 2010-07-01 2010-07-01 false Computer matching agreements (CMAs). 310.53... (CONTINUED) PRIVACY PROGRAM DOD PRIVACY PROGRAM Computer Matching Program Procedures § 310.53 Computer.... (3) Justification and expected results. Explain why computer matching as opposed to some...

  1. 36 CFR 72.32 - Funding and matching share.

    Science.gov (United States)

    2010-07-01

    .... 72.32 Section 72.32 Parks, Forests, and Public Property NATIONAL PARK SERVICE, DEPARTMENT OF THE..., Rehabilitation and Innovation § 72.32 Funding and matching share. (a) Recovery Action Program Grant Matching. Up... development may be used as part of a local match for Innovation or Rehabilitation grants only when the...

  2. Consumer resource matching in urbanizing landscapes: are synanthropic species over-matching?

    Science.gov (United States)

    Rodewald, Amanda D; Shustack, Daniel P

    2008-02-01

    Population responses of synanthropic species to urbanization may be explained by the resource-matching rule, which postulates that individuals should distribute themselves according to resource availability. According to the resource-matching rule, urban habitats will contain greater densities if they provide better resources than rural habitats. However, because resource availability is density dependent, individuals in urban areas would ultimately achieve fitness levels comparable to, but no better than, individuals in less urban areas. Some ecologists suggest that synanthropic birds may not conform to the resource-matching rule and may instead overmatch (i.e., overexploit) in urban habitats, ultimately leading to lower fitness despite greater resource levels. Using the Northern Cardinal (Cardinalis cardinalis) as a focal species, we evaluated if Cardinal populations in urban and rural habitats were consistent with predictions of consumer resource matching. During 2003-2006 we documented population density, adult body condition, apparent survival, and annual reproductive productivity of Cardinals in riparian forest stands within urban (n = 8 stands) and rural (n = 6 stands) landscapes in Ohio, USA. Density of Cardinals in urban forests was four times that found in more rural forests. Mark-resight data from 147 males and 125 females over four years indicated that apparent survival rates were similar between urban and rural landscapes (phi = 0.64, SE = 0.039 for males and phi = 0.57, SE = 0.04 for females). Similarly, body condition indices of 168 males, 142 females, and 118 nestlings did not differ significantly between landscapes. Annual reproductive productivity (mean number of fledglings per pair over breeding season) of 294 pairs was comparable for urban (2.4 +/- 0.18 [mean +/- SE] and rural (2.1 +/- 0.18) young birds. Thus, contrary to recent suggestions, we find that high densities of certain synanthropic species in urban landscapes are consistent with

  3. Analysis of an Online Match Discussion Board: Improving the Otolaryngology—Head and Neck Surgery Match

    Science.gov (United States)

    Kozin, Elliott D.; Sethi, Rosh; Lehmann, Ashton; Remenschneider, Aaron K.; Golub, Justin S.; Reyes, Samuel A.; Emerick, Kevin; Lee, Daniel J.; Gray, Stacey T.

    2015-01-01

    Introduction “The Match” has become the accepted selection process for graduate medical education. Otomatch.com has provided an online forum for Otolaryngology-Head and Neck Surgery (OHNS) Match-related questions for over a decade. Herein, we aim to 1) delineate the types of posts on Otomatch to better understand the perspective of medical students applying for residency and 2) provide recommendations to potentially improve the Match process. Methods Discussion forum posts on Otomatch between December 2001 and April 2014 were reviewed. The title of each thread and total number of views were recorded for quantitative analysis. Each thread was organized into one of six major categories and one of eighteen subcategories, based on chronology within the application cycle and topic. National Resident Matching Program (NRMP) data were utilized for comparison. Results We identified 1,921 threads corresponding to over 2 million page views. Over 40% of threads related to questions about specific programs, and 27% were discussions about interviews. Views, a surrogate measure for popularity, reflected different trends. The majority of individuals viewed posts on interviews (42%), program specific questions (20%) and how to rank programs (11%). Increase in viewership tracked with a rise in applicant numbers based on NRMP data. Conclusions Our study provides an in depth analysis of a popular discussion forum for medical students interested in the OHNS Match. The most viewed posts are about interview dates and questions regarding specific programs. We provide suggestions to address unmet needs for medical students and potentially improve the Match process. PMID:25550223

  4. The influence of match location, quality of opposition, and match status on possession strategies in professional association football.

    Science.gov (United States)

    Lago, Carlos

    2009-11-01

    The aim of this study was to examine the effects of match location, quality of opposition, and match status on possession strategies in a professional Spanish football team. Twenty-seven matches from the 2005-2006 domestic league season were notated post-event using a computerized match analysis system. Matches were divided into episodes according to evolving match status. Linear regression analysis showed that possession of the ball was greater when losing than when winning (P location (P location, quality of opposition, and match status during assessments of technical and tactical components of football performance. In particular, the findings indicate that strategies in soccer are influenced by match variables and teams alter their playing style during the game accordingly.

  5. The effect of matching and mismatching cognitive style and science instruction

    Science.gov (United States)

    Conwell, Catherine R.; Helgeson, Stanley L.; Wachowiak, Dale G.

    This study examined the effect of matching learners' cognitive styles with science learning activities on science knowledge and attitudes. Fifty-six elementary education majors who were identified as Sensing Feeling types on the Myers-Briggs Type Indicator participated in this study. The Sensing Feeling type is predominant among elementary school educators. The subjects participated in either nine science activities matched to the learning preferences of Sensing Feelers or nine science activities mismatched to their learning preferences. These mismatched activities were geared toward the learning preferences of Intuitive Thinkers, the dominant type among scientists. Results revealed no significant differences between matched and mismatched groups in knowledge of the material presented or overall attitude toward science and toward science teaching. Comparisons made subsequent to the hypothesized analyses did suggest that cognitive style may affect reactions to certain specific learning activities. The immediate reactions of forty non-Sensing Feeling types who also experienced the treatments were compared to those of the 56 Sensing Feeling subjects. Certain activities which were rated by judges prior to the onset of treatment as being particularly well-matched to the Sensing Feeling style did receive significantly more favorable ratings by the Sensing Feeling subjects than by other types. Conversely, the Sensing Feelers gave significantly lower ratings than other types to certain activities which, according to independent judges, were strongly mismatched to the Sensing Feeling style.

  6. Effects of recovery type after a kickboxing match on blood lactate and performance in anaerobic tests.

    Science.gov (United States)

    Ouergui, Ibrahim; Hammouda, Omar; Chtourou, Hamdi; Gmada, Nabil; Franchini, Emerson

    2014-06-01

    To verify whether active recovery (AR) applied after a kickboxing match resulted in better performance in anaerobic tests when compared to passive recovery (PR). Eighteen kickboxers volunteered to participate on a Kickboxing match preceded and followed by anaerobic tests: squat jump (SJ), the counter movement jump (CMJ) and the upper-body Wingate test. Blood lactate (BL), heart rate (HR) and rate of perceived exertion (RPE) were analyzed before and after rounds. The recovery sessions consisted of 10min at 50% of maximal aerobic speed or PR. BL was measured at 3, 5 and 10 min after the match, while HR, RPE and anaerobic power were assessed after the recovery period. BL, HR and RPE increased significantly (P<0.001) during the match. BL was lower (P<0.001) after AR compared to PR at 5 min and 10 min (e.g. AR: 8.94 ± 0.31 mmol.l(-1), PR: 10.98 ± 0.33 mmol.l(-1)). However, PR resulted in higher (P<0.05) upper-body mean power (4.65 ± 0.5 W.kg(-1)) compared to AR (4.09 ± 0.5 W.kg(-1)), while SJ and CMJ were not affected by the recovery type. The lactate removal was improved with AR when compared with PR, but AR did not improve subsequent performance.

  7. An improved SIFT algorithm in the application of close-range Stereo image matching

    Science.gov (United States)

    Zhang, Xuehua; Wang, Xiaoqing; Yuan, Xiaoxiang; Wang, Shumin

    2016-11-01

    As unmanned aerial vehicle (UAV) remote sensing is applied in small area aerial photogrammetry surveying, disaster monitoring and emergency command, 3D urban construction and other fields, the image processing of UAV has become a hot topic in current research. The precise matching of UAV image is a key problem, which affects the subsequent processing precision directly, such as 3D reconstruction and automatic aerial triangulation, etc. At present, SIFT (Scale Invariant Feature Transform) algorithm proposed by DAVID G. LOWE as the main method is, is widely used in image matching, since its strong stability to image rotation, shift, scaling, and the change of illumination conditions. It has been successfully applied in target recognition, SFM (Structure from Motion), and many other fields. SIFT algorithm needs the colour images to be converted into grayscale images, detects extremum points under different scales and uses neighbourhood pixels to generate descriptor. As we all know that UAV images with rich colour information, the SIFT algorithm improved through combining with the image colour information in this paper, the experiments are conducted from matching efficiency and accuracy compared with the original SIFT algorithm. The results show that the method which proposed in this paper decreases on the efficiency, but is improved on the precision and provides a basis choice for matching method.

  8. Quality metric in matched Laplacian of Gaussian response domain for blind adaptive optics image deconvolution

    Science.gov (United States)

    Guo, Shiping; Zhang, Rongzhi; Yang, Yikang; Xu, Rong; Liu, Changhai; Li, Jisheng

    2016-04-01

    Adaptive optics (AO) in conjunction with subsequent postprocessing techniques have obviously improved the resolution of turbulence-degraded images in ground-based astronomical observations or artificial space objects detection and identification. However, important tasks involved in AO image postprocessing, such as frame selection, stopping iterative deconvolution, and algorithm comparison, commonly need manual intervention and cannot be performed automatically due to a lack of widely agreed on image quality metrics. In this work, based on the Laplacian of Gaussian (LoG) local contrast feature detection operator, we propose a LoG domain matching operation to perceive effective and universal image quality statistics. Further, we extract two no-reference quality assessment indices in the matched LoG domain that can be used for a variety of postprocessing tasks. Three typical space object images with distinct structural features are tested to verify the consistency of the proposed metric with perceptual image quality through subjective evaluation.

  9. Cross-matching algorithm for the Intermediate Data Updating system in Gaia

    Science.gov (United States)

    Clotet, M.; González-Vidal, J. J.; Castaneda, J.; Garralda, N.; Portell, J.; Fabricius, C.; Torra, J.

    2017-03-01

    Cross Matching (XM) is an inherently difficult problem in astronomy. The assignation of which detection belongs to a given source is a complex issue that has deep implications in further usages of the data. Gaia provides a massive amount of new observations every day which must be linked to sources so that further data reduction can take place. The XM in Gaia provides a consistent match between observations and sources in the working catalogue for subsequent data reduction processes. The system in charge of performing the XM in Gaia is designed in three stages. First the input observations are processed by time in order to compute the sky coordinates and obtain the preliminary source candidates for each individual detection. Then, a second task groups the results to determine isolated groups of detections, avoiding boundary issues. Finally, the relations between the observations and corresponding sources are provided.

  10. A layered modulation method for pixel matching in online phase measuring profilometry

    Science.gov (United States)

    Li, Hongru; Feng, Guoying; Bourgade, Thomas; Yang, Peng; Zhou, Shouhuan; Asundi, Anand

    2016-10-01

    An online phase measuring profilometry with new layered modulation method for pixel matching is presented. In this method and in contrast with previous modulation matching methods, the captured images are enhanced by Retinex theory for better modulation distribution, and all different layer modulation masks are fully used to determine the displacement of a rectilinear moving object. High, medium and low modulation masks are obtained by performing binary segmentation with iterative Otsu method. The final shifting pixels are calculated based on centroid concept, and after that the aligned fringe patterns can be extracted from each frame. After performing Stoilov algorithm and a series of subsequent operations, the object profile on a translation stage is reconstructed. All procedures are carried out automatically, without setting specific parameters in advance. Numerical simulations are detailed and experimental results verify the validity and feasibility of the proposed approach.

  11. Lack of association between postactivation potentiation and subsequent jump performance.

    Science.gov (United States)

    Pearson, Stephen John; Hussain, Syed Robiul

    2014-01-01

    Postactivation potentiation (PAP) is a strategy that has been used to acutely enhance the performance of explosive activities. Although, isometric maximal voluntary contractions (MVCs) have previously been shown to enhance subsequent explosive performance, no information currently exists regarding (1) the optimal variables (intensity/volume) of a MVC that best elicits a PAP response, and (2) the utilisation of evoked isometric twitch contractions in combination with performance measures to directly ascertain the presence of PAP following a MVC, and its relationship to performance. Thus, the purpose of this study was to (1) investigate the influence of isometric contraction duration on the PAP response, and (2) to determine the relationship between PAP, indicated as potentiation of muscle twitch force and subsequent jump performance following different-duration MVCs. Eight males (age: 21 ± 0.99) were assessed using performance measures [countermovement jumps] and evoked twitch contractions, before and 4 minutes after three different conditioning contractions (CCs), (1) a 3-second MVC (MVC3), (2) a 5-second MVC (MVC5) and (3) a 7-second MVC (MVC7). Following all CCs, peak twitch torque of the knee extensor muscles was found to increase (MVC3, + 3.9%; MVC5, + 9.6%; MVC7, + 5.2%), although not significantly (P > 0.05). No significant increases in jump height, jump power, rate of force development or takeoff velocity were observed following any of the CCs (P > 0.05). There was also a lack of association between the changes in PAP (twitch torque) and jump height following all CCs (MVC3, r = 0.25; MVC5, r = 0.28; MVC7, r = -0.47). These data indicate that PAP as assessed via twitch contractions is not associated with performance measures subsequent to single-set isometric CCs of varying durations.

  12. Physical Fitness in Adolescence and Subsequent Inflammatory Bowel Disease Risk

    Science.gov (United States)

    Melinder, Carren; Hiyoshi, Ayako; Hussein, Oula; Halfvarson, Jonas; Ekbom, Anders; Montgomery, Scott

    2015-01-01

    OBJECTIVES: Physical fitness may reduce systemic inflammation levels relevant to the risk of symptomatic Crohn's disease (CD) and ulcerative colitis (UC); we assessed if fitness in adolescence is associated with subsequent inflammatory bowel disease (IBD) risk, independent of markers of risk and prodromal disease activity. METHODS: Swedish registers provided information on a cohort of 240,984 men (after exclusions) who underwent military conscription assessments in late adolescence (1969–1976). Follow-up started at least 4 years after the conscription assessment until 31 December 2009 (up to age 57 years). Cox's regression assessed the association of physical fitness with CD (n=986) and UC (n=1,878) in separate models, with adjustment including: socioeconomic conditions in childhood; physical fitness, height, body mass index, and erythrocyte sedimentation rate (ESR) in adolescence; and subsequent diagnoses of IBD. RESULTS: Low fitness was associated with a raised risk of IBD, with unadjusted hazard ratios (and 95% confidence intervals) of 1.62 (1.31–2.00) for CD and 1.36 (1.17–1.59) for UC. The results were attenuated by adjustment, particularly for markers of prodromal disease activity to 1.32 (1.05–1.66) and 1.25 (1.06–1.48), respectively. Raised ESR in adolescence was associated with increased risks for subsequent CD (5.95 (4.47–7.92)) and UC (1.92 (1.46–2.52)). CONCLUSIONS: The inverse association of physical fitness with IBD risk is consistent with a protective role for exercise. However, evidence of disease activity before diagnosis was already present in adolescence, suggesting that some or all of the association between fitness and IBD may be due to prodromal disease activity reducing exercise capacity and therefore fitness. PMID:26540026

  13. Candida colonization and subsequent infections in critically ill surgical patients.

    Science.gov (United States)

    Pittet, D; Monod, M; Suter, P M; Frenk, E; Auckenthaler, R

    1994-01-01

    OBJECTIVE. The authors determined the role of Candida colonization in the development of subsequent infection in critically ill patients. DESIGN. A 6-month prospective cohort study was given to patients admitted to the surgical and neonatal intensive care units in a 1600-bed university medical center. METHODS. Patients having predetermined criteria for significant Candida colonization revealed by routine microbiologic surveillance cultures at different body sites were eligible for the study. Risk factors for Candida infection were recorded. A Candida colonization index was determined daily as the ratio of the number of distinct body sites (dbs) colonized with identical strains over the total number of dbs tested; a mean of 5.3 dbs per patient was obtained. All isolates (n = 322) sequentially recovered were characterized by genotyping using contour-clamped homogeneous electrical field gel electrophoresis that allowed strain delineation among Candida species. RESULTS. Twenty-nine patients met the criteria for inclusion; all were at high risk for Candida infection; 11 patients (38%) developed severe infections (8 candidemia); the remaining 18 patients were heavily colonized, but never required intravenous antifungal therapy. Among the potential risk factors for candida infection, three discriminated the colonized from the infected patients--i.e., length of previous antibiotic therapy (p < 0.02), severity of illness assessed by APACHE II score (p < 0.01), and the intensity of Candida spp colonization (p < 0.01). By logistic regression analysis, the latter two who were the independent factors that predicted subsequent candidal infection. Candida colonization always preceded infection with genotypically identical Candida spp strain. The proposed colonization indexes reached threshold values a mean of 6 days before Candida infection and demonstrated high positive predictive values (66 to 100%). CONCLUSIONS. The intensity of Candida colonization assessed by systematic

  14. Doppler Compensation by using of Segmented Match Filter

    OpenAIRE

    2008-01-01

    Match filter is one of the important parts of radar receiver. By using of Match Filter, the signal to noise ratio can be maximized so that the probability of detection is increased. Match Filter can be used as a pulse compression filter in radar receiver. Binary phase code is one of the pulse compression methods that, the compression can be down with a Match Filter in the receiver. Doppler effect is one of the problems that degrade the performance of Match Filter. In this paper, two methods “...

  15. 76 FR 14669 - Privacy Act of 1974; CMS Computer Match No. 2011-02; HHS Computer Match No. 1007

    Science.gov (United States)

    2011-03-17

    ... HUMAN SERVICES Centers for Medicare & Medicaid Services Privacy Act of 1974; CMS Computer Match No. 2011... Medicare & Medicaid Services (CMS). ACTION: Notice of computer matching program. SUMMARY: In accordance... matching agreement between CMS and the Department of Defense (DoD). We have provided background...

  16. 77 FR 39748 - Computer Matching and Privacy Protection Act of 1988; Report of Matching Program: RRB and State...

    Science.gov (United States)

    2012-07-05

    ...] [FR Doc No: 2012-16384] RAILROAD RETIREMENT BOARD Computer Matching and Privacy Protection Act of 1988...: Notice of a renewal of an existing computer matching program due to expire on August 12, 2012. SUMMARY..., information obtained from state agencies in ongoing computer matching programs regarding individuals...

  17. Limiting the immediate and subsequent hazards associated with wildfires

    Science.gov (United States)

    DeGraff, Jerome V.; Cannon, Susan H.; Parise, Mario

    2013-01-01

    Wildfire is a unique natural hazard because it poses immediate threats to life and property as well as creating conditions that can lead to subsequent debris flows. In recent years, the immediate destructive force of wildfires has been decreased through better understanding of fire behavior. Lightning detection networks now identify the number and locations of this common ignition source. Measurements of wind speed, temperature, slope, fuel types and fire boundaries are routinely incorporated into models for fire spread, permitting real-time adjustments to fire-fighting strategies, thus increasing fire-fighting effectiveness.

  18. Cephalosporin Induced Toxic Epidermal Necrolysis and Subsequent Penicillin Drug Exanthem

    OpenAIRE

    Amanda Lam; Inderpal Randhawa; William Klaustermeyer

    2008-01-01

    Background: Drug hypersensitivity is classically divided into IgE mediated and non-IgE mediated disease. We report a rare case of consequent IgE mediated and non-IgE mediated reactions within the beta lactam class of antibiotics. Case Summary: An 84-year-old man developed toxic epidermal necrolysis (TEN) due to ceftriaxone, a third generation cephalosporin, involving 72% of the body surface area. The patient recovered but within weeks subsequently developed an acute IgE mediated allergic r...

  19. Parental divorce and subsequent disadvantage: a cross-cohort comparison.

    Science.gov (United States)

    Sigle-Rushton, Wendy; Hobcraft, John; Kiernan, Kathleen

    2005-08-01

    Although many studies have examined the link between parental divorce and subsequent well-being, some theories of the effects of divorce suggest that the negative associations should have declined over time. However, few studies have examined the extent to which the associations have remained stable over time. Using data from two British cohorts, we analyzed both shorter- and longer-term outcomes of children who experienced parental divorce and the extent to which the associations have changed over time. Estimating similar models for both cohorts, we found little evidence of any change in the size of the relationship as divorce became more commonplace.

  20. How Saccade Intrusions Affect Subsequent Motor and Oculomotor Actions

    Science.gov (United States)

    Terao, Yasuo; Fukuda, Hideki; Tokushige, Shin-ichi; Inomata-Terada, Satomi; Ugawa, Yoshikazu

    2017-01-01

    In daily activities, there is a close spatial and temporal coupling between eye and hand movements that enables human beings to perform actions smoothly and accurately. If this coupling is disrupted by inadvertent saccade intrusions, subsequent motor actions suffer from delays, and lack of coordination. To examine how saccade intrusions affect subsequent voluntary actions, we used two tasks that require subjects to make motor/oculomotor actions in response to a visual cue. One was the memory guided saccade (MGS) task, and the other the hand reaction time (RT) task. The MGS task required subjects to initiate a voluntary saccade to a memorized target location, which is indicated shortly before by a briefly presented cue. The RT task required subjects to release a button on detection of a visual target, while foveating on a central fixation point. In normal subjects of various ages, inadvertent saccade intrusions delayed subsequent voluntary motor, and oculomotor actions. We also studied patients with Parkinson's disease (PD), who are impaired not only in initiating voluntary saccades but also in suppressing unwanted reflexive saccades. Saccade intrusions also delayed hand RT in PD patients. However, MGS was affected by the saccade intrusion differently. Saccade intrusion did not delay MGS latency in PD patients who could perform MGS with a relatively normal latency. In contrast, in PD patients who were unable to initiate MGS within the normal time range, we observed slightly decreased MGS latency after saccade intrusions. What explains this paradoxical phenomenon? It is known that motor actions slow down when switching between controlled and automatic behavior. We discuss how the effect of saccade intrusions on subsequent voluntary motor/oculomotor actions may reflect a similar switching cost between automatic and controlled behavior and a cost for switching between different motor effectors. In contrast, PD patients were unable to initiate internally guided MGS in