WorldWideScience

Sample records for bioagent sample matching

  1. Bioagent Sample Matching using Elemental Composition Data: an Approach to Validation

    Energy Technology Data Exchange (ETDEWEB)

    Velsko, S P

    2006-04-21

    Sample matching is a fundamental capability that can have high probative value in a forensic context if proper validation studies are performed. In this report we discuss the potential utility of using the elemental composition of two bioagent samples to decide if they were produced in the same batch, or by the same process. Using guidance from the recent NRC study of bullet lead analysis and other sources, we develop a basic likelihood ratio framework for evaluating the evidentiary weight of elemental analysis data for sample matching. We define an objective metric for comparing two samples, and propose a method for constructing an unbiased population of test samples. We illustrate the basic methodology with some existing data on dry Bacillus thuringiensis preparations, and outline a comprehensive plan for experimental validation of this approach.

  2. Biomimetic air sampling for detection of low concentrations of molecules and bioagents : LDRD 52744 final report.

    Energy Technology Data Exchange (ETDEWEB)

    Hughes, Robert Clark

    2003-12-01

    Present methods of air sampling for low concentrations of chemicals like explosives and bioagents involve noisy and power hungry collectors with mechanical parts for moving large volumes of air. However there are biological systems that are capable of detecting very low concentrations of molecules with no mechanical moving parts. An example is the silkworm moth antenna which is a highly branched structure where each of 100 branches contains about 200 sensory 'hairs' which have dimensions of 2 microns wide by 100 microns long. The hairs contain about 3000 pores which is where the gas phase molecules enter the aqueous (lymph) phase for detection. Simulations of diffusion of molecules indicate that this 'forest' of hairs is 'designed' to maximize the extraction of the vapor phase molecules. Since typical molecules lose about 4 decades in diffusion constant upon entering the liquid phase, it is important to allow air diffusion to bring the molecule as close to the 'sensor' as possible. The moth acts on concentrations as low as 1000 molecules per cubic cm. (one part in 1e16). A 3-D collection system of these dimensions could be fabricated by micromachining techniques available at Sandia. This LDRD addresses the issues involved with extracting molecules from air onto micromachined structures and then delivering those molecules to microsensors for detection.

  3. Sample-whitened matched filters

    DEFF Research Database (Denmark)

    Andersen, Ib

    1973-01-01

    A sample-whitened matched filter (SWMF) for a channel with intersymbol interference and additive white Gaussian noise is defined as a linear filter with the properties that its output samples are a sufficient statistic for the MAP estimation of the transmitted sequence and have uncorrelated noise...... components. These filters are shown to exist for ali realistic channels and the complete set of SWMF's for any channel is determined. It is shown that for nonpathological channels there is a unique SWMF which minimizes the amount of intersymbol interference defined as the discrete-time analog to the rms...

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

  5. Study on Bioagents or Bioaerosols standoff detection by lidar

    Directory of Open Access Journals (Sweden)

    Yang Hui

    2016-01-01

    Full Text Available Scattering, fluorescence and polarization are the important data source for bioagent or bioaerosol time-space observation and identification. This paper stated and discussed the theory and data inversion principles for Mie scattering, laser induced fluorescence and polarization sensing Lidar. The sensing and data inversion results for bioagent/bioaerosol extinction coefficient, horizontal linear depolarization ratio were also demonstrated. The signal and SNR simulation of fluorescence lidar were also demonstrated. The sensing results revealed that the three kinds of detecting technology approaches are reasonable and potential for bioagent/bioaerosol characterization and recognition.

  6. Short-range lidar for bioagent detection and classification

    Science.gov (United States)

    Hô, Nicolas; Émond, Frédéric; Babin, François; Healy, Dave; Simard, Jean-Robert; Buteau, Sylvie; McFee, John E.

    2010-04-01

    We have developed a small, relatively lightweight and efficient short range (Bacillus Globigii, an anthrax simulant, at a distance of 100 m (assumed worst case where 1 ppl = 1 ACPLA) considering particle sizes between 0.5 and 10 μm, with a geometric mean at 1 um. The apparatus has been tested in the field during three test and evaluation campaigns with multiple bioagents and public security products. Preliminary results show that the system is able to distinguish between harmful bioagents and naturally occurring ones. A classification algorithm was successfully tested with a single type of bioagent; experiments for daytime measurements are discussed.

  7. Study on Bioagents or Bioaerosols standoff detection by lidar

    OpenAIRE

    Yang Hui; Sun Yan Fei; Wang Tie Dong; Zhao Xue Song; Dong Yan; Qing Feng

    2016-01-01

    Scattering, fluorescence and polarization are the important data source for bioagent or bioaerosol time-space observation and identification. This paper stated and discussed the theory and data inversion principles for Mie scattering, laser induced fluorescence and polarization sensing Lidar. The sensing and data inversion results for bioagent/bioaerosol extinction coefficient, horizontal linear depolarization ratio were also demonstrated. The signal and SNR simulation of fluorescence lidar w...

  8. Recombinative generalization of subword units using matching to sample.

    LENUS (Irish Health Repository)

    Mahon, Catherine

    2010-01-01

    The purpose of the current study was to develop and test a computerized matching-to-sample (MTS) protocol to facilitate recombinative generalization of subword units (onsets and rimes) and recognition of novel onset-rime and onset-rime-rime words. In addition, we sought to isolate the key training components necessary for recombinative generalization. Twenty-five literate adults participated. Conditional discrimination training emerged as a crucial training component. These findings support the effectiveness of MTS in facilitating recombinative generalization, particularly when conditional discrimination training with subword units is used.

  9. Human symbolic matching-to-sample performance: Effects of reinforcer and sample-stimulus probabilities

    OpenAIRE

    Alsop, Brent; Rowley, Rachael; Fon, Cristina

    1995-01-01

    Four experiments, each with 6 human subjects, varied the distribution of reinforcers for correct responses and the probability of sample-stimulus presentation in symbolic matching-to-sample procedures. Experiment 1 held the sample-stimulus probability constant and varied the ratio of reinforcers obtained for correct responses on the two alternatives across conditions. There was a positive relation between measures of response bias and the ratio of reinforcers. Experiment 2 held the ratio of r...

  10. Matching-To-Sample by Pigeons: The Dissociation of Samples from Reinforcement Contingencies

    OpenAIRE

    Zentall, Thomas R; Singer, Rebecca A.; Miller, Holly C.

    2008-01-01

    It has been proposed that comparison choice in matching-to-sample should depend on two factors, the relative probability of reinforcement associated with each of the comparison stimuli and the conditional probability of each comparison stimulus being correct given presentation of one of the samples. DiGian and Zentall (in press) have shown that sample frequency together with the probability of choosing each of the comparison stimuli in training can influence comparison choice when delays are ...

  11. Feasibility Study of Passive Aerosol Sampler for Bio-Agent Detection

    Energy Technology Data Exchange (ETDEWEB)

    Keating, G

    2003-03-05

    We propose to establish the feasibility of a passive aerosol sampler for bio-agent collection through laboratory experiments and theoretical analysis. The passive sampler, unlike the typical active sampler, does not require pumps and complex fixtures, and thereby allows for large-scale field monitoring not possible with current active samplers. We plan to conduct experiments using model (both biological and non-biological) aerosols generated in an instrumented test chamber and compare the particles collected on various passive samplers to conventional filter samplers, commercial aerosol measuring instruments and to conventional surface swipes. Theoretical analysis will be used to design prototype passive samplers and to compare experimental results with theory. A successful feasibility study will be used to seek outside funding for applications that will greatly enhance current LLNL programs such as NARAC's atmospheric dispersal modeling, NAI's programs in bioagent monitoring in public locations and fixed sampling stations, and EPD's environmental monitoring and decontamination research. In addition, the feasibility study will position us favorably for responding to new calls for proposals by NIH and EPA for large scale environmental studies.

  12. Multi-field Pattern Matching based on Sparse Feature Sampling.

    Science.gov (United States)

    Wang, Zhongjie; Seidel, Hans-Peter; Weinkauf, Tino

    2016-01-01

    We present an approach to pattern matching in 3D multi-field scalar data. Existing pattern matching algorithms work on single scalar or vector fields only, yet many numerical simulations output multi-field data where only a joint analysis of multiple fields describes the underlying phenomenon fully. Our method takes this into account by bundling information from multiple fields into the description of a pattern. First, we extract a sparse set of features for each 3D scalar field using the 3D SIFT algorithm (Scale-Invariant Feature Transform). This allows for a memory-saving description of prominent features in the data with invariance to translation, rotation, and scaling. Second, the user defines a pattern as a set of SIFT features in multiple fields by e.g. brushing a region of interest. Third, we locate and rank matching patterns in the entire data set. Experiments show that our algorithm is efficient in terms of required memory and computational efforts. PMID:26390479

  13. Effects of Acute and Chronic Cocaine Administration on Titrating-Delay Matching-to-Sample Performance

    Science.gov (United States)

    Kangas, Brian D.; Branch, Marc N.

    2012-01-01

    The effects of cocaine were examined under a titrating-delay matching-to-sample procedure. In this procedure, the delay between sample stimulus offset and comparison stimuli onset adjusts as a function of the subject's performance. Specifically, matches increase the delay and mismatches decrease the delay. Titrated delay values served as the…

  14. Matching- and Nonmatching-to-Sample Concept Learning in Rats Using Olfactory Stimuli

    Science.gov (United States)

    April, L. Brooke; Bruce, Katherine; Galizio, Mark

    2011-01-01

    Previous research has shown that rats can learn matching-to-sample relations with olfactory stimuli; however, the specific characteristics of this relational control are unclear. In Experiment 1, 6 rats were trained to either match or nonmatch to sample in a modified operant chamber using common household spices as olfactory stimuli. After…

  15. Asymmetrical Sample Training Produces Asymmetrical Retention Functions in Feature-Present/Feature-Absent Matching in Pigeons

    Science.gov (United States)

    Grant, Douglas S.; Blatz, Craig W.

    2004-01-01

    Pigeons were trained in a matching task in which samples involved presentation of a white line on a green background (feature-present) or on an otherwise dark key (feature-absent). After asymmetrical training in which one group was initially trained with the feature-present sample and another was initially trained with the feature-absent sample,…

  16. Varieties of Stimulus Control in Matching-to-Sample: A Kernel Analysis

    Science.gov (United States)

    Fields, Lanny; Garruto, Michelle; Watanabe, Mari

    2010-01-01

    Conditional discrimination or matching-to-sample procedures have been used to study a wide range of complex psychological phenomena with infrahuman and human subjects. In most studies, the percentage of trials in which a subject selects the comparison stimulus that is related to the sample stimulus is used to index the control exerted by the…

  17. Delayed matching-to-sample: A tool to assess memory and other cognitive processes in pigeons.

    Science.gov (United States)

    Zentall, Thomas R; Smith, Aaron P

    2016-02-01

    Delayed matching-to-sample is a versatile task that has been used to assess the nature of animal memory. Although once thought to be a relatively passive process, matching research has demonstrated considerable flexibility in how animals actively represent events in memory. But delayed matching can also demonstrate how animals fail to maintain representations in memory when they are cued that they will not be tested (directed forgetting) and how the outcome expected can serve as a choice cue. When pigeons have shown divergent retention functions following training without a delay, it has been taken as evidence of the use of a single-code/default coding strategy but in many cases an alternative account may be involved. Delayed matching has also been used to investigate equivalence learning (how animals represent stimuli when they learn that the same comparison response is correct following the presentation of two different samples) and to test for metamemory (the ability of pigeons to indicate that they understand what they know) by allowing animals to decline to be tested when they are uncertain that they remember a stimulus. How animals assess the passage of time has also been studied using the matching task. And there is evidence that when memory for the sample is impaired by a delay, rather than use the probability of being correct for choice of each of the comparison stimuli, pigeons tend to choose based on the overall sample frequency (base-rate neglect). Finally, matching has been used to identify natural color categories as well as dimensional categories in pigeons. Overall, matching to sample has provided an excellent methodology for assessing an assortment of cognitive processes in animals. PMID:26165174

  18. Effect of delay-interval stimuli on delayed symbolic matching to sample in the pigeon

    OpenAIRE

    Wilkie, Donald M.; Summers, Russel J.; Marcia L Spetch

    1981-01-01

    In Experiment 1, food-deprived pigeons received delayed symbolic matching to sample training in a darkened Skinner box. Trials began with the illumination of the grain feeder lamp (no food sample), or illumination of this lamp, accompanied by the raising of the feeder tray (food sample). After a delay of a few seconds, the two side response keys were illuminated, one with red and one with green light, with positions counterbalanced over trials. Pecking the red (green) comparison produced grai...

  19. A Surrogate-based Adaptive Sampling Approach for History Matching and Uncertainty Quantification

    Energy Technology Data Exchange (ETDEWEB)

    Li, Weixuan; Zhang, Dongxiao; Lin, Guang

    2015-02-25

    A critical procedure in reservoir simulations is history matching (or data assimilation in a broader sense), which calibrates model parameters such that the simulation results are consistent with field measurements, and hence improves the credibility of the predictions given by the simulations. Often there exist non-unique combinations of parameter values that all yield the simulation results matching the measurements. For such ill-posed history matching problems, Bayesian theorem provides a theoretical foundation to represent different solutions and to quantify the uncertainty with the posterior PDF. Lacking an analytical solution in most situations, the posterior PDF may be characterized with a sample of realizations, each representing a possible scenario. A novel sampling algorithm is presented here for the Bayesian solutions to history matching problems. We aim to deal with two commonly encountered issues: 1) as a result of the nonlinear input-output relationship in a reservoir model, the posterior distribution could be in a complex form, such as multimodal, which violates the Gaussian assumption required by most of the commonly used data assimilation approaches; 2) a typical sampling method requires intensive model evaluations and hence may cause unaffordable computational cost. In the developed algorithm, we use a Gaussian mixture model as the proposal distribution in the sampling process, which is simple but also flexible to approximate non-Gaussian distributions and is particularly efficient when the posterior is multimodal. Also, a Gaussian process is utilized as a surrogate model to speed up the sampling process. Furthermore, an iterative scheme of adaptive surrogate refinement and re-sampling ensures sampling accuracy while keeping the computational cost at a minimum level. The developed approach is demonstrated with an illustrative example and shows its capability in handling the above-mentioned issues. Multimodal posterior of the history matching

  20. EEG and autonomic responses during performance of matching and non-matching to sample working memory tasks with emotional content.

    Directory of Open Access Journals (Sweden)

    Ana Garcia

    2011-12-01

    Full Text Available Working memory (WM is a neural system responsible for the temporary storage of information and its utilization in problem solving. The central executive is theorized as the controller of storage functions that support WM. Neurophysiological data suggest that EEG theta and alpha oscillations in frontal and midline regions are involved in neural communication between the central executive and storage functions during WM performance. Emotion is known to modulate several memory systems, including WM, through central and peripheral pathways. However, the physiological correlations (electroencephalographic – EEG; autonomic nervous activity of the effect of emotion over WM are not well described. In this study we aimed to identify physiological responses related to emotional WM performance. EEG (21 channels, heart rate (HR and galvanic skin response (GSR recordings were obtained from 54 volunteers while performing delayed matching and non-matching to sample tasks (DMTS/DNMTS. Emotional and neutral pictures from the International Affective Picture System and geometric figures were used as stimuli. As expected, WM performance was accompanied by presence of theta (frontal and midline electrodes and Alpha power (parietal electrodes. Beta and gamma oscillations were concentrated in frontopolar and left temporal regions. DNMTS task was accompanied by increases in Beta power, HR and GSR compared to DMTS task. Correlation analysis showed a positive tendency for gamma in Fp2 site, ratio of LF/HF (HR low and high frequency and skin conductance in both tasks. The HR results indicate an inverse reaction related to parasympathetic and sympathetic nervous system during the performance of the tasks. Taken together, our results contribute to elucidate the complex interactions between central and autonomic nervous systems in the modulation of emotional WM tasks.

  1. Perceived social environment and adolescents' well-being and adjustment: Comparing a foster care sample with a matched sample

    OpenAIRE

    Farruggia, SP; Greenberger, E; Chen, C.; Heckhausen, J

    2006-01-01

    Previous research has demonstrated that former foster care youth are at risk for poor outcomes (e.g., more problem behaviors, more depression, lower self-esteem, and poor social relationships). It is not clear, however, whether these findings reflect preemancipation developmental deficits. This study used 163 preemancipation foster care youth and a matched sample of 163 comparison youth. Results showed that foster-care youth did not differ from the comparison sample on measures of well-being,...

  2. Stroop Interference in a Delayed Match-to-Sample Task: Evidence for Semantic Competition

    Directory of Open Access Journals (Sweden)

    BradleyR.Sturz

    2013-11-01

    Full Text Available Discussions of the source of the Stroop interference effect continue to pervade the literature. Semantic competition posits that interference results from competing semantic activation of word and color dimensions of the stimulus prior to response selection. Response competition posits that interference results from competing responses for articulating the word dimension versus the color dimension at the time of response selection. We embedded Stroop stimuli into a delayed match-to-sample task in an attempt to test semantic and response competition accounts of the interference effect. Participants viewed a sample color word in black or colored fonts that were congruent or incongruent with respect to the color word itself. After a 5s delay, participants were presented with two targets (i.e., a match and a foil and were instructed to select the correct match. We probed each dimension independently during target presentations via color targets (i.e., two colors or word targets (i.e., two words and manipulated whether the semantic content of the foil was related to the semantic content of the irrelevant sample dimension (e.g., word sample “red” in blue font with the word “red” as the match and the word “blue” as the foil. We provide evidence for Stroop interference such that response times increased for incongruent trials even in the presence of a response option with semantic content unrelated to the semantic content of the irrelevant sample dimension. Accuracy also deteriorated during the related foil trials. A follow-up experiment with a 10s delay between sample and targets replicated the results. Results appear to provide converging evidence for Stroop interference in a delayed match-to-sample task in a manner that is consistent with an explanation based upon semantic competition and inconsistent with an explanation based upon response competition.

  3. Themes, Taxons, and Trial Types in Children's Matching to Sample: Methodological Considerations.

    Science.gov (United States)

    Osborne, J. Grayson; Calhoun, David O.

    1998-01-01

    Five experiments examined matching to sample procedures among preschoolers. Results indicated that children selected taxonomic comparisons more often than thematic comparisons, independent of age, gender, instructions, order of trial type, specificity of feedback, presence of unrelated third comparisons, and level of taxonomy. Instructions to…

  4. A Theory of Attending, Remembering, and Reinforcement in Delayed Matching to Sample

    Science.gov (United States)

    Nevin, John A.; Davison, Michael; Odum, Amy L.; Shahan, Timothy A.

    2007-01-01

    A theory of attending and reinforcement in conditional discriminations (Nevin, Davison, & Shahan, 2005) is extended to working memory in delayed matching to sample by adding terms for disruption of attending during the retention interval. Like its predecessor, the theory assumes that reinforcers and disruptors affect the independent probabilities…

  5. A Frequency Matching Method for Generation of a Priori Sample Models from Training Images

    DEFF Research Database (Denmark)

    Lange, Katrine; Cordua, Knud Skou; Frydendall, Jan; Hansen, Thomas Mejer; Mosegaard, Klaus

    2011-01-01

    This paper presents a Frequency Matching Method (FMM) for generation of a priori sample models based on training images and illustrates its use by an example. In geostatistics, training images are used to represent a priori knowledge or expectations of models, and the FMM can be used to generate...

  6. A Theory of Attending, Remembering, and Reinforcement in Delayed Matching to Sample

    OpenAIRE

    Nevin, John A; Davison, Michael; Odum, Amy Laurie; Shahan, Timothy A

    2007-01-01

    A theory of attending and reinforcement in conditional discriminations (Nevin, Davison, & Shahan, 2005) is extended to working memory in delayed matching to sample by adding terms for disruption of attending during the retention interval. Like its predecessor, the theory assumes that reinforcers and disruptors affect the independent probabilities of attending to sample and comparison stimuli in the same way as the rate of overt free-operant responding as suggested by Nevin and Grace (2000), a...

  7. Rigorous Training of Dogs Leads to High Accuracy in Human Scent Matching-To-Sample Performance.

    Science.gov (United States)

    Marchal, Sophie; Bregeras, Olivier; Puaux, Didier; Gervais, Rémi; Ferry, Barbara

    2016-01-01

    Human scent identification is based on a matching-to-sample task in which trained dogs are required to compare a scent sample collected from an object found at a crime scene to that of a suspect. Based on dogs' greater olfactory ability to detect and process odours, this method has been used in forensic investigations to identify the odour of a suspect at a crime scene. The excellent reliability and reproducibility of the method largely depend on rigor in dog training. The present study describes the various steps of training that lead to high sensitivity scores, with dogs matching samples with 90% efficiency when the complexity of the scents presented during the task in the sample is similar to that presented in the in lineups, and specificity reaching a ceiling, with no false alarms in human scent matching-to-sample tasks. This high level of accuracy ensures reliable results in judicial human scent identification tests. Also, our data should convince law enforcement authorities to use these results as official forensic evidence when dogs are trained appropriately. PMID:26863620

  8. Stroop interference in a delayed match-to-sample task: evidence for semantic competition.

    Science.gov (United States)

    Sturz, Bradley R; Green, Marshall L; Locker, Lawrence; Boyer, Ty W

    2013-01-01

    Discussions of the source of the Stroop interference effect continue to pervade the literature. Semantic competition posits that interference results from competing semantic activation of word and color dimensions of the stimulus prior to response selection. Response competition posits that interference results from competing responses for articulating the word dimension vs. the color dimension at the time of response selection. We embedded Stroop stimuli into a delayed match-to-sample (DMTS) task in an attempt to test semantic and response competition accounts of the interference effect. Participants viewed a sample color word in black or colored fonts that were congruent or incongruent with respect to the color word itself. After a 5 s delay, participants were presented with two targets (i.e., a match and a foil) and were instructed to select the correct match. We probed each dimension independently during target presentations via color targets (i.e., two colors) or word targets (i.e., two words) and manipulated whether the semantic content of the foil was related to the semantic content of the irrelevant sample dimension (e.g., word sample "red" in blue font with the word "red" as the match and the word "blue" as the foil). We provide evidence for Stroop interference such that response times (RTs) increased for incongruent trials even in the presence of a response option with semantic content unrelated to the semantic content of the irrelevant sample dimension. Accuracy also deteriorated during the related foil trials. A follow-up experiment with a 10 s delay between sample and targets replicated the results. Results appear to provide converging evidence for Stroop interference in a DMTS task in a manner that is consistent with an explanation based upon semantic competition and inconsistent with an explanation based upon response competition. PMID:24298264

  9. Same/different concept learning by capuchin monkeys in matching-to-sample tasks.

    Directory of Open Access Journals (Sweden)

    Valentina Truppa

    Full Text Available The ability to understand similarities and analogies is a fundamental aspect of human advanced cognition. Although subject of considerable research in comparative cognition, the extent to which nonhuman species are capable of analogical reasoning is still debated. This study examined the conditions under which tufted capuchin monkeys (Cebus apella acquire a same/different concept in a matching-to-sample task on the basis of relational similarity among multi-item stimuli. We evaluated (i the ability of five capuchin monkeys to learn the same/different concept on the basis of the number of items composing the stimuli and (ii the ability to match novel stimuli after training with both several small stimulus sets and a large stimulus set. We found the first evidence of same/different relational matching-to-sample abilities in a New World monkey and demonstrated that the ability to match novel stimuli is within the capacity of this species. Therefore, analogical reasoning can emerge in monkeys under specific training conditions.

  10. Enhancement of low sampling frequency recordings for ECG biometric matching using interpolation.

    Science.gov (United States)

    Sidek, Khairul Azami; Khalil, Ibrahim

    2013-01-01

    Electrocardiogram (ECG) based biometric matching suffers from high misclassification error with lower sampling frequency data. This situation may lead to an unreliable and vulnerable identity authentication process in high security applications. In this paper, quality enhancement techniques for ECG data with low sampling frequency has been proposed for person identification based on piecewise cubic Hermite interpolation (PCHIP) and piecewise cubic spline interpolation (SPLINE). A total of 70 ECG recordings from 4 different public ECG databases with 2 different sampling frequencies were applied for development and performance comparison purposes. An analytical method was used for feature extraction. The ECG recordings were segmented into two parts: the enrolment and recognition datasets. Three biometric matching methods, namely, Cross Correlation (CC), Percent Root-Mean-Square Deviation (PRD) and Wavelet Distance Measurement (WDM) were used for performance evaluation before and after applying interpolation techniques. Results of the experiments suggest that biometric matching with interpolated ECG data on average achieved higher matching percentage value of up to 4% for CC, 3% for PRD and 94% for WDM. These results are compared with the existing method when using ECG recordings with lower sampling frequency. Moreover, increasing the sample size from 56 to 70 subjects improves the results of the experiment by 4% for CC, 14.6% for PRD and 0.3% for WDM. Furthermore, higher classification accuracy of up to 99.1% for PCHIP and 99.2% for SPLINE with interpolated ECG data as compared of up to 97.2% without interpolation ECG data verifies the study claim that applying interpolation techniques enhances the quality of the ECG data. PMID:23062461

  11. Learning Strategies in Matching to Sample: If-then and Configural Learning by Pigeons

    OpenAIRE

    Katz, Jeffrey S.; Bodily, Kent D.; Wright, Anthony A.

    2007-01-01

    Pigeons learned a matching-to-sample task with a split training-set design in which half of the stimulus displays were untrained and tested following acquisition. Transfer to the untrained displays along with no novel-stimulus transfer indicated that these pigeons learned the task (partially) via if-then rules. Comparisons to other performance measures indicated that they also partially learned the task via configural learning (learning the gestalt of the whole stimulus display). Differences ...

  12. Signal-detection analyses of conditional discrimination and delayed matching-to-sample performance.

    OpenAIRE

    Alsop, Brent

    2004-01-01

    Quantitative analyses of stimulus control and reinforcer control in conditional discriminations and delayed matching-to-sample procedures often encounter a problem; it is not clear how to analyze data when subjects have not made errors. The present article examines two common methods for overcoming this problem. Monte Carlo simulations of performance demonstrated that both methods introduced systematic deviations into the results, and that there were genuine risks of drawing misleading conclu...

  13. Rigorous Training of Dogs Leads to High Accuracy in Human Scent Matching-To-Sample Performance

    OpenAIRE

    Marchal, Sophie; Bregeras, Olivier; Puaux, Didier; Gervais, Rémi; Ferry, Barbara

    2016-01-01

    Human scent identification is based on a matching-to-sample task in which trained dogs are required to compare a scent sample collected from an object found at a crime scene to that of a suspect. Based on dogs’ greater olfactory ability to detect and process odours, this method has been used in forensic investigations to identify the odour of a suspect at a crime scene. The excellent reliability and reproducibility of the method largely depend on rigor in dog training. The present study descr...

  14. Modeling behavior in different delay match to sample tasks in one simple network

    Science.gov (United States)

    Amit, Yali; Yakovlev, Volodya; Hochstein, Shaul

    2013-01-01

    Delay match to sample (DMS) experiments provide an important link between the theory of recurrent network models and behavior and neural recordings. We define a simple recurrent network of binary neurons with stochastic neural dynamics and Hebbian synaptic learning. Most DMS experiments involve heavily learned images, and in this setting we propose a readout mechanism for match occurrence based on a smaller increment in overall network activity when the matched pattern is already in working memory, and a reset mechanism to clear memory from stimuli of previous trials using random network activity. Simulations show that this model accounts for a wide range of variations on the original DMS tasks, including ABBA tasks with distractors, and more general repetition detection tasks with both learned and novel images. The differences in network settings required for different tasks derive from easily defined changes in the levels of noise and inhibition. The same models can also explain experiments involving repetition detection with novel images, although in this case the readout mechanism for match is based on higher overall network activity. The models give rise to interesting predictions that may be tested in neural recordings. PMID:23908619

  15. Memory and assimilation to context in delayed matching-to-sample

    Directory of Open Access Journals (Sweden)

    ACHIM ELFERING

    2006-03-01

    Full Text Available This paper reports effects of short-term memory and context stimuli on recognition of visual stimuli. After presentation of a square as the target stimulus, participants had to store the target during a variable delay, until they had to identify the target within a sample of seven squares that differed systematically in size (context variation. Marked context effects (“shifts” that occurred as responses to the test series were obtained when sets of comparison stimuli were arranged asymmetrically with respect to targets. Participants overestimated the size of the target in a set of larger comparison stimuli by choosing a larger stimulus to match the target, and vice versa (Experiment 1. This assimilation effect increased with longer delays between target offset and the onset of comparison stimuli (Experiment 2. Briefer target exposure also induced stronger assimilation (Experiment 3. The results indicated that visual short-term memory modulates (contextual stimulus integration in delayed matching to sample. A working model of memory and contextual effects in matching is discussed.

  16. Evaluation of Bioagents and Biopesticides against Colletotrichum lindemuthianum and its Integrated Management in Common Bean

    Directory of Open Access Journals (Sweden)

    Bilal Ahmad PADDER

    2010-09-01

    Full Text Available Three bioagents (Trichoderma viride, T. harzianum and Gliocladium virens and five biopesticides (Achook, Neemgold, Wannis, Spictaf and Neemazal were evaluated under in vitro and in vivo conditions against Colletotrichum lindemuthianum. All the three antagonistic fungi caused significant inhibition of mycelial growth, maximum being with T. viride (69.21% followed by T. harzianum (64.20%. Among the biopesticides tested at four concentrations, Wanis applied @ 1000 ?l/ml caused maximum inhibition of 82.12 per cent followed by Spictaf (52.85%. T. viride and Wanis @ 1000 ?l/ml were most effective in reducing the seed borne infection. Integration of bioagents with Bavistin showed that disease can be effectively managed with seed dressing either with Bavistin or biopesticide followed by foliar treatment with fungicide or biopesticide.

  17. Sample matching by inferred agonal stress in gene expression analyses of the brain

    Directory of Open Access Journals (Sweden)

    Bunney William E

    2007-09-01

    Full Text Available Abstract Background Gene expression patterns in the brain are strongly influenced by the severity and duration of physiological stress at the time of death. This agonal effect, if not well controlled, can lead to spurious findings and diminished statistical power in case-control comparisons. While some recent studies match samples by tissue pH and clinically recorded agonal conditions, we found that these indicators were sometimes at odds with observed stress-related gene expression patterns, and that matching by these criteria still sometimes results in identifying case-control differences that are primarily driven by residual agonal effects. This problem is analogous to the one encountered in genetic association studies, where self-reported race and ethnicity are often imprecise proxies for an individual's actual genetic ancestry. Results We developed an Agonal Stress Rating (ASR system that evaluates each sample's degree of stress based on gene expression data, and used ASRs in post hoc sample matching or covariate analysis. While gene expression patterns are generally correlated across different brain regions, we found strong region-region differences in empirical ASRs in many subjects that likely reflect inter-individual variabilities in local structure or function, resulting in region-specific vulnerability to agonal stress. Conclusion Variation of agonal stress across different brain regions differs between individuals, revealing a new level of complexity for gene expression studies of brain tissues. The Agonal Stress Ratings quantitatively assess each sample's extent of regulatory response to agonal stress, and allow a strong control of this important confounder.

  18. Scopolamine impairs auditory delayed matching-to-sample performance in monkeys.

    Science.gov (United States)

    Plakke, Bethany; Ng, Chi-Wing; Poremba, Amy

    2008-06-13

    Information concerning the major neurotransmitters critical for auditory memory is sparse. One possibility is the cholinergic system, important for performance in some tasks requiring visual short-term memory and attention [T.G. Aigner, M. Mishkin, The effects of physostigmine and scopolamine on recognition memory in monkeys, Behav. Neural. Biol. 45 (1986) 81-87; N. Hironaka, K. Ando, Effects of cholinergic drugs on scopolamine-induced memory impairment in rhesus monkeys, Jpn. J. Psychopharmacol. 16 (1996) 103-108; T.M. Myers, G. Galbicka, M.L. Sipos, S. Varadi, J.L. Oubre, M.G. Clark, Effects of anticholinergics on serial-probe recognition accuracy of rhesus macaques (Macaca mulatta), Pharmacol. Biochem. Behav. 73 (2002) 829-834; H. Ogura, T.G. Aigner, MK-801 Impairs recognition memory in rhesus monkeys: comparison with cholinergic drugs, J. Pharmacol. Exp. Ther. 266 (1993) 60-64; D.M. Penetar, J.H. McDonough Jr., Effects of cholinergic drugs on delayed match-to-sample performance of rhesus monkeys, Pharmacol. Biochem. Behav. 19 (1983) 963-967; M.A. Taffe, M.R. Weed, L.H. Gold, Scopolamine alters rhesus monkey performance on a novel neuropsychological test battery, Cogn. Brain Res. 8 (1999) 203-212]. Five rhesus monkeys were trained to perform an auditory go/no-go delayed matching-to-sample (DMTS) task wherein two acoustic stimuli (500ms), separated by variable memory delays (500ms, 2500ms, or 5000ms), were either identical sound presentations, i.e., match trials, or two different sound presentations, i.e., nonmatch trials. Sound stimuli were chosen semi-randomly from a large set sound set ( approximately 900). After reaching a criterion of 80% correct on the behavioral task, monkeys were injected with saline or doses of scopolamine hydrochloride mixed in saline (3 microg, 5 microg, and 10 microg per 1kg of weight), 30 min before training. Scopolamine impaired performance accuracy on match trials in a dose-dependent manner. Blocking muscarinic receptors with

  19. EFFECTS OF VARYING THE PROBABILITY OF REINFORCEMENT ON MATCHING-TO-SAMPLE TASKS IN PIGEONS

    OpenAIRE

    CLAUDIO CARPIO; CARLOS FLORES; VIRGINIA PACHECO; CÉSAR CANALES

    2003-01-01

    The effects of varying the probability of reinforcement of responses to the identical (PSRi) and different(PSRd) comparison stimuli in matching to sample tasks were evaluated. PSRi was varied in descendentascendentway at the same time that PSRd was varied in an ascendent-descendent way. The values ofPSRi were 1.0, 0.75, 0.50, 0.25, 0.0, 0.25, 0.50, 0.75, 1.0; while the values of PERd were 0.0, 0.25, 0.50,0.75,1.0, 0.75, 0.50, 0.25, 0.0.The results show that the distribution of responses to th...

  20. Overcoming the matched-sample bottleneck: an orthogonal approach to integrate omic data.

    Science.gov (United States)

    Nguyen, Tin; Diaz, Diana; Tagett, Rebecca; Draghici, Sorin

    2016-01-01

    MicroRNAs (miRNAs) are small non-coding RNA molecules whose primary function is to regulate the expression of gene products via hybridization to mRNA transcripts, resulting in suppression of translation or mRNA degradation. Although miRNAs have been implicated in complex diseases, including cancer, their impact on distinct biological pathways and phenotypes is largely unknown. Current integration approaches require sample-matched miRNA/mRNA datasets, resulting in limited applicability in practice. Since these approaches cannot integrate heterogeneous information available across independent experiments, they neither account for bias inherent in individual studies, nor do they benefit from increased sample size. Here we present a novel framework able to integrate miRNA and mRNA data (vertical data integration) available in independent studies (horizontal meta-analysis) allowing for a comprehensive analysis of the given phenotypes. To demonstrate the utility of our method, we conducted a meta-analysis of pancreatic and colorectal cancer, using 1,471 samples from 15 mRNA and 14 miRNA expression datasets. Our two-dimensional data integration approach greatly increases the power of statistical analysis and correctly identifies pathways known to be implicated in the phenotypes. The proposed framework is sufficiently general to integrate other types of data obtained from high-throughput assays. PMID:27403564

  1. Comparison of microRNA expression using different preservation methods of matched psoriatic skin samples

    DEFF Research Database (Denmark)

    Løvendorf, Marianne B; Zibert, John R; Hagedorn, Peter H;

    2012-01-01

    MicroRNAs are non-coding RNA molecules modulating gene expression post-transcriptionally. Formalin-fixed, paraffin-embedding (FFPE) is a standard preservation method often used in clinical practices, but induces RNA degradation. Extracting high-quality RNA from human skin can be challenging as skin......-frozen (FS) and Tissue-Tek-embedding (OCT). We found a strong correlation of the microRNA expression levels between all preservation methods of matched psoriatic skin samples (r(s) ranging from 0.91 to 0.95 (P <0.001)). These observations were further confirmed with qRT-PCR. Our results demonstrate that...... contains high levels of RNases. As microRNAs are 19-23 nucleotides long and lack a poly-A tail, they may be less prone to RNA degradation than mRNAs. We investigated whether microRNAs in psoriatic (FFPE) samples reliably reflect microRNA expression in samples less prone to RNA degradation such as fresh...

  2. Applying Matched Sampling to Evaluate a University Tutoring Program for First-Year Students

    Science.gov (United States)

    Walvoord, Mark E.; Pleitz, Jacob D.

    2016-01-01

    Our study used a case-control matching design to assess the influence of a voluntary tutoring program in improving first-year students' Grade Point Averages (GPA). To evaluate program effectiveness, we applied case-control matching to obtain 215 pairs of students with or without participation in tutoring, but matched on high school GPA and…

  3. Discriminating somatic and germline mutations in tumor DNA samples without matching normals.

    Science.gov (United States)

    Hiltemann, Saskia; Jenster, Guido; Trapman, Jan; van der Spek, Peter; Stubbs, Andrew

    2015-09-01

    Tumor analyses commonly employ a correction with a matched normal (MN), a sample from healthy tissue of the same individual, in order to distinguish germline mutations from somatic mutations. Since the majority of variants found in an individual are thought to be common within the population, we constructed a set of 931 samples from healthy, unrelated individuals, originating from two different sequencing platforms, to serve as a virtual normal (VN) in the absence of such an associated normal sample. Our approach removed (1) >96% of the germline variants also removed by the MN sample and (2) a large number (2%-8%) of additional variants not corrected for by the associated normal. The combination of the VN with the MN improved the correction for polymorphisms significantly, with up to ∼30% compared with MN and ∼15% compared with VN only. We determined the number of unrelated genomes needed in order to correct at least as efficiently as the MN is about 200 for structural variations (SVs) and about 400 for single-nucleotide variants (SNVs) and indels. In addition, we propose that the removal of common variants with purely position-based methods is inaccurate and incurs additional false-positive somatic variants, and more sophisticated algorithms, which are capable of leveraging information about the area surrounding variants, are needed for optimal accuracy. Our VN correction method can be used to analyze any list of variants, regardless of sequencing platform of origin. This VN methodology is available for use on our public Galaxy server. PMID:26209359

  4. Bias due to sample selection in propensity score matching for a supportive housing program evaluation in New York City.

    Directory of Open Access Journals (Sweden)

    Sungwoo Lim

    Full Text Available OBJECTIVES: Little is known about influences of sample selection on estimation in propensity score matching. The purpose of the study was to assess potential selection bias using one-to-one greedy matching versus optimal full matching as part of an evaluation of supportive housing in New York City (NYC. STUDY DESIGN AND SETTINGS: Data came from administrative data for 2 groups of applicants who were eligible for an NYC supportive housing program in 2007-09, including chronically homeless adults with a substance use disorder and young adults aging out of foster care. We evaluated the 2 matching methods in their ability to balance covariates and represent the original population, and in how those methods affected outcomes related to Medicaid expenditures. RESULTS: In the population with a substance use disorder, only optimal full matching performed well in balancing covariates, whereas both methods created representative populations. In the young adult population, both methods balanced covariates effectively, but only optimal full matching created representative populations. In the young adult population, the impact of the program on Medicaid expenditures was attenuated when one-to-one greedy matching was used, compared with optimal full matching. CONCLUSION: Given covariate balancing with both methods, attenuated program impacts in the young adult population indicated that one-to-one greedy matching introduced selection bias.

  5. Nutrition and health - the association between eating behavior and various health parameters: a matched sample study.

    Directory of Open Access Journals (Sweden)

    Nathalie T Burkert

    Full Text Available Population-based studies have consistently shown that our diet has an influence on health. Therefore, the aim of our study was to analyze differences between different dietary habit groups in terms of health-related variables. The sample used for this cross-sectional study was taken from the Austrian Health Interview Survey AT-HIS 2006/07. In a first step, subjects were matched according to their age, sex, and socioeconomic status (SES. After matching, the total number of subjects included in the analysis was 1320 (N = 330 for each form of diet - vegetarian, carnivorous diet rich in fruits and vegetables, carnivorous diet less rich in meat, and carnivorous diet rich in meat. Analyses of variance were conducted controlling for lifestyle factors in the following domains: health (self-assessed health, impairment, number of chronic conditions, vascular risk, health care (medical treatment, vaccinations, preventive check-ups, and quality of life. In addition, differences concerning the presence of 18 chronic conditions were analyzed by means of Chi-square tests. Overall, 76.4% of all subjects were female. 40.0% of the individuals were younger than 30 years, 35.4% between 30 and 49 years, and 24.0% older than 50 years. 30.3% of the subjects had a low SES, 48.8% a middle one, and 20.9% had a high SES. Our results revealed that a vegetarian diet is related to a lower BMI and less frequent alcohol consumption. Moreover, our results showed that a vegetarian diet is associated with poorer health (higher incidences of cancer, allergies, and mental health disorders, a higher need for health care, and poorer quality of life. Therefore, public health programs are needed in order to reduce the health risk due to nutritional factors.

  6. Nutrition and health - the association between eating behavior and various health parameters: a matched sample study.

    Science.gov (United States)

    Burkert, Nathalie T; Muckenhuber, Johanna; Großschädl, Franziska; Rásky, Eva; Freidl, Wolfgang

    2014-01-01

    Population-based studies have consistently shown that our diet has an influence on health. Therefore, the aim of our study was to analyze differences between different dietary habit groups in terms of health-related variables. The sample used for this cross-sectional study was taken from the Austrian Health Interview Survey AT-HIS 2006/07. In a first step, subjects were matched according to their age, sex, and socioeconomic status (SES). After matching, the total number of subjects included in the analysis was 1320 (N = 330 for each form of diet - vegetarian, carnivorous diet rich in fruits and vegetables, carnivorous diet less rich in meat, and carnivorous diet rich in meat). Analyses of variance were conducted controlling for lifestyle factors in the following domains: health (self-assessed health, impairment, number of chronic conditions, vascular risk), health care (medical treatment, vaccinations, preventive check-ups), and quality of life. In addition, differences concerning the presence of 18 chronic conditions were analyzed by means of Chi-square tests. Overall, 76.4% of all subjects were female. 40.0% of the individuals were younger than 30 years, 35.4% between 30 and 49 years, and 24.0% older than 50 years. 30.3% of the subjects had a low SES, 48.8% a middle one, and 20.9% had a high SES. Our results revealed that a vegetarian diet is related to a lower BMI and less frequent alcohol consumption. Moreover, our results showed that a vegetarian diet is associated with poorer health (higher incidences of cancer, allergies, and mental health disorders), a higher need for health care, and poorer quality of life. Therefore, public health programs are needed in order to reduce the health risk due to nutritional factors. PMID:24516625

  7. Effect of Intermittent Reinforcement on Acquisition and Retention in Delayed Matching-to-Sample in Pigeons

    Science.gov (United States)

    Grant, Douglas S.

    2011-01-01

    Experiments 1 and 2 involved independent groups that received primary reinforcement after a correct match with a probability of 1.0, 0.50 or 0.25. Correct matches that did not produce primary reinforcement produced a conditioned reinforcer. Both experiments revealed little evidence that acquisition or retention was adversely affected by use of…

  8. Reinforcer Control by Comparison-Stimulus Color and Location in a Delayed Matching-to-Sample Task

    Science.gov (United States)

    Alsop, Brent; Jones, B. Max

    2008-01-01

    Six pigeons were trained in a delayed matching-to-sample task involving bright- and dim-yellow samples on a central key, a five-peck response requirement to either sample, a constant 1.5-s delay, and the presentation of comparison stimuli composed of red on the left key and green on the right key or vice versa. Green-key responses were…

  9. Comparing Psychosocial Adjustment across the College Transition in a Matched Heterosexual and Lesbian, Gay, and Bisexual Sample

    Science.gov (United States)

    Kirsch, Alexandra C.; Conley, Colleen S.; Riley, Tracey J.

    2015-01-01

    We compared a matched sample of heterosexual and lesbian, gay, and bisexual (LGB) students on 5 psychosocial adjustment composites, longitudinally across the transitional first year of college. Both LGB and heterosexual students experienced a significant increase in psychological distress over the first semester, along with significant decreases…

  10. Bioagent detection using miniaturized NMR and nanoparticle amplification : final LDRD report.

    Energy Technology Data Exchange (ETDEWEB)

    Clewett, C. F. M.; Adams, David Price; Fan, Hongyou; Williams, John D.; Sillerud, Laurel O.; Alam, Todd Michael; Aldophi, Natalie L. (New Mexico Resonance, Albuquerque, NM); McDowell, Andrew F. (New Mexico Resonance, Albuquerque, NM)

    2006-11-01

    This LDRD program was directed towards the development of a portable micro-nuclear magnetic resonance ({micro}-NMR) spectrometer for the detection of bioagents via induced amplification of solvent relaxation based on superparamagnetic nanoparticles. The first component of this research was the fabrication and testing of two different micro-coil ({micro}-coil) platforms: namely a planar spiral NMR {micro}-coil and a cylindrical solenoid NMR {micro}-coil. These fabrication techniques are described along with the testing of the NMR performance for the individual coils. The NMR relaxivity for a series of water soluble FeMn oxide nanoparticles was also determined to explore the influence of the nanoparticle size on the observed NMR relaxation properties. In addition, The use of commercially produced superparamagnetic iron oxide nanoparticles (SPIONs) for amplification via NMR based relaxation mechanisms was also demonstrated, with the lower detection limit in number of SPIONs per nanoliter (nL) being determined.

  11. Detection of bioagents using a shear horizontal surface acoustic wave biosensor

    Science.gov (United States)

    Larson, Richard S; Hjelle, Brian; Hall, Pam R; Brown, David C; Bisoffi, Marco; Brozik, Susan M; Branch, Darren W; Edwards, Thayne L; Wheeler, David

    2014-04-29

    A biosensor combining the sensitivity of surface acoustic waves (SAW) generated at a frequency of 325 MHz with the specificity provided by antibodies and other ligands for the detection of viral agents. In a preferred embodiment, a lithium tantalate based SAW transducer with silicon dioxide waveguide sensor platform featuring three test and one reference delay lines was used to adsorb antibodies directed against Coxsackie virus B4 or the negative-stranded category A bioagent Sin Nombre virus (SNV). Rapid detection of increasing concentrations of viral particles was linear over a range of order of magnitude for both viruses, and the sensor's selectivity for its target was not compromised by the presence of confounding Herpes Simplex virus type 1 The biosensor was able to delect SNV at doses lower than the load of virus typically found in a human patient suffering from hantavirus cardiopulmonary syndrome (HCPS).

  12. Detection of bioagents using a shear horizontal surface acoustic wave biosensor

    Energy Technology Data Exchange (ETDEWEB)

    Larson, Richard S; Hjelle, Brian; Hall, Pam R; Brown, David C; Bisoffi, Marco; Brozik, Susan M; Branch, Darren W; Edwards, Thayne L; Wheeler, David

    2014-04-29

    A biosensor combining the sensitivity of surface acoustic waves (SAW) generated at a frequency of 325 MHz with the specificity provided by antibodies and other ligands for the detection of viral agents. In a preferred embodiment, a lithium tantalate based SAW transducer with silicon dioxide waveguide sensor platform featuring three test and one reference delay lines was used to adsorb antibodies directed against Coxsackie virus B4 or the negative-stranded category A bioagent Sin Nombre virus (SNV). Rapid detection of increasing concentrations of viral particles was linear over a range of order of magnitude for both viruses, and the sensor's selectivity for its target was not compromised by the presence of confounding Herpes Simplex virus type 1 The biosensor was able to delect SNV at doses lower than the load of virus typically found in a human patient suffering from hantavirus cardiopulmonary syndrome (HCPS).

  13. LARGE SAMPLE PROPERTIES OF THE SIR IN CDMA WITH MATCHED FILTER RECEIVERS

    Institute of Scientific and Technical Information of China (English)

    PAN GUANGMING; MIAO BAIQI; ZHU CHUNHUA

    2005-01-01

    The output signal-to-interference (SIR) of conventional matched filter receiver in random environment is considered. When the number of users and the spreading factors tend to infinity with their ratio fixed, the convergence of SIR is showed to be with probability one under finite fourth.moment of the spreading sequences. The asymptotic distribution of the SIR is also obtained.

  14. Delayed matching-to-sample performance: Effects of relative reinforcer frequency and of signaled versus unsignaled reinforcer magnitudes

    OpenAIRE

    McCarthy, Dianne; Voss, Philip

    1995-01-01

    Six pigeons were trained on a delayed red-green matching-to-sample task that arranged four delays within sessions. Matching responses intermittently produced either 1.5-s access to food or 4.5-s access to food, and nonmatching responses produced either 1.5-s or 4.5-s blackout. Two phases were conducted: a signaled phase in which the reinforcer magnitudes (small and large) were signaled by houselights (positioned either on the left or right of the chamber), and an unsignaled phase in which the...

  15. Nutrition and Health – The Association between Eating Behavior and Various Health Parameters: A Matched Sample Study

    OpenAIRE

    Burkert, Nathalie T.; Johanna Muckenhuber; Franziska Großschädl; Eva Rásky; Wolfgang Freidl

    2014-01-01

    Population-based studies have consistently shown that our diet has an influence on health. Therefore, the aim of our study was to analyze differences between different dietary habit groups in terms of health-related variables. The sample used for this cross-sectional study was taken from the Austrian Health Interview Survey AT-HIS 2006/07. In a first step, subjects were matched according to their age, sex, and socioeconomic status (SES). After matching, the total number of subjects included i...

  16. Piezoelectric composite oscillator for measuring mechanical spectroscopy in small samples that non-match in half wavelength

    Science.gov (United States)

    Bonifacich, F. G.; Lambri, O. A.; Pérez Landazábal, J. I.; Recarte, V.; Zelada, G. I.; Mocellini, R. R.; Sánchez Alarcos, V.; Marenzana, A.; Plazaola, F.

    2016-03-01

    A novel piezoelectric device for measuring mechanical spectroscopy as a function of temperature and strain has been developed. The new equipment involves five oscillating elements, a crystal driver, two spacer bars, the sample and the crystal gauge. The spacer bars and the sample do not match in frequency. The device developed here results in an important solution for measuring mechanical spectroscopy in small samples, where the condition of match in frequency cannot be satisfied. Mechanical spectroscopy measurements were performed in free decay with the equipment working in an out of tune condition. The associated mathematical equations required for the measurement process have also been developed. In addition, the new equipment was successfully used for the measurement of different types of materials: metals, polymers and ferromagnetic shape memory alloys.

  17. Achievement of public and non-Catholic private high school students within a matched sample

    OpenAIRE

    Mead, Susan Virginia

    1987-01-01

    Over the past six years, analyses of the National Center for Education Statistics' High School and Beyond data have primarily focused on the differences in achievement between public and Catholic high school students. Valuable data on non-Catholic private school students have been virtually ignored. Based on a strategy proposed by Althauser and Rubin (1970), in this study non-Catholic private schools are matched with public schools similar in school average base year student ...

  18. EVALUATION OF BIOAGENTS FOR MANAGEMENT OF THE ONION PURPLE BLOTCH AND BULB YIELD LOSS ASSESSMENT UNDER FIELD CONDITIONS

    Directory of Open Access Journals (Sweden)

    P. M. YADAV

    2014-03-01

    Full Text Available Among the several diseases, purple blotch diseases of onion (Allium cepa L. caused by Alternaria porri (Ellis Cif. is one of the most destructive disease causing accountable losses of about 80 to 90 per cent. The results obtained on the field efficacy of different bioagents tested, Pseudomonas fluorescens--I (0.5% was found most antifungal against A. porri and recorded significantly least mean disease intensity (37.19% and gave maximum bulb yield (27183 kg/ha. Both the fungal and bacterial antagonists tested were also found effective against A. porri and recorded significantly reduced mean disease intensity thereby increased the bulb yield over unsprayed control. Based on incremental cost:benefit ratio (ICBR of the bioagents spray treatments, P. fluorescens--I (ICBR, 1:13.87 was found economical and effective for the management of purple blotch of onion followed by Bacillus subtilis (ICBR, 1:12.93.

  19. Nutritional Status of Flemish Vegetarians Compared with Non-Vegetarians: A Matched Samples Study

    OpenAIRE

    Peter Clarys; Renaat Philippaerts; Johan Lefevre; Marcel Hebbelinck; Peter Deriemaeker; Katrien Alewaeters

    2010-01-01

    The present study compares the nutritional status of vegetarian (V) with non-vegetarian (NV) subjects. A three-day food record and a health questionnaire were completed by 106 V and 106 NV matched for following characteristics: sex, age, BMI, physical activity, tobacco use and alcohol consumption. Total energy intake was not significantly different (men: V: 2,346 +/- 685 kcal/d; NV: 2,628 +/- 632 kcal/d; p = 0.078; women: V: 1,991 +/- 539 kcal/d; NV: 1,973 +/- 592 kcal/d; p = 0.849). Macronut...

  20. Sampling designs matching species biology produce accurate and affordable abundance indices

    Directory of Open Access Journals (Sweden)

    Grant Harris

    2013-12-01

    Full Text Available Wildlife biologists often use grid-based designs to sample animals and generate abundance estimates. Although sampling in grids is theoretically sound, in application, the method can be logistically difficult and expensive when sampling elusive species inhabiting extensive areas. These factors make it challenging to sample animals and meet the statistical assumption of all individuals having an equal probability of capture. Violating this assumption biases results. Does an alternative exist? Perhaps by sampling only where resources attract animals (i.e., targeted sampling, it would provide accurate abundance estimates more efficiently and affordably. However, biases from this approach would also arise if individuals have an unequal probability of capture, especially if some failed to visit the sampling area. Since most biological programs are resource limited, and acquiring abundance data drives many conservation and management applications, it becomes imperative to identify economical and informative sampling designs. Therefore, we evaluated abundance estimates generated from grid and targeted sampling designs using simulations based on geographic positioning system (GPS data from 42 Alaskan brown bears (Ursus arctos. Migratory salmon drew brown bears from the wider landscape, concentrating them at anadromous streams. This provided a scenario for testing the targeted approach. Grid and targeted sampling varied by trap amount, location (traps placed randomly, systematically or by expert opinion, and traps stationary or moved between capture sessions. We began by identifying when to sample, and if bears had equal probability of capture. We compared abundance estimates against seven criteria: bias, precision, accuracy, effort, plus encounter rates, and probabilities of capture and recapture. One grid (49 km2 cells and one targeted configuration provided the most accurate results. Both placed traps by expert opinion and moved traps between capture

  1. Sampling designs matching species biology produce accurate and affordable abundance indices

    Science.gov (United States)

    Farley, Sean; Russell, Gareth J.; Butler, Matthew J.; Selinger, Jeff

    2013-01-01

    Wildlife biologists often use grid-based designs to sample animals and generate abundance estimates. Although sampling in grids is theoretically sound, in application, the method can be logistically difficult and expensive when sampling elusive species inhabiting extensive areas. These factors make it challenging to sample animals and meet the statistical assumption of all individuals having an equal probability of capture. Violating this assumption biases results. Does an alternative exist? Perhaps by sampling only where resources attract animals (i.e., targeted sampling), it would provide accurate abundance estimates more efficiently and affordably. However, biases from this approach would also arise if individuals have an unequal probability of capture, especially if some failed to visit the sampling area. Since most biological programs are resource limited, and acquiring abundance data drives many conservation and management applications, it becomes imperative to identify economical and informative sampling designs. Therefore, we evaluated abundance estimates generated from grid and targeted sampling designs using simulations based on geographic positioning system (GPS) data from 42 Alaskan brown bears (Ursus arctos). Migratory salmon drew brown bears from the wider landscape, concentrating them at anadromous streams. This provided a scenario for testing the targeted approach. Grid and targeted sampling varied by trap amount, location (traps placed randomly, systematically or by expert opinion), and traps stationary or moved between capture sessions. We began by identifying when to sample, and if bears had equal probability of capture. We compared abundance estimates against seven criteria: bias, precision, accuracy, effort, plus encounter rates, and probabilities of capture and recapture. One grid (49 km2 cells) and one targeted configuration provided the most accurate results. Both placed traps by expert opinion and moved traps between capture sessions, which

  2. Targeted estimation and inference for the sample average treatment effect in trials with and without pair-matching.

    Science.gov (United States)

    Balzer, Laura B; Petersen, Maya L; van der Laan, Mark J

    2016-09-20

    In cluster randomized trials, the study units usually are not a simple random sample from some clearly defined target population. Instead, the target population tends to be hypothetical or ill-defined, and the selection of study units tends to be systematic, driven by logistical and practical considerations. As a result, the population average treatment effect (PATE) may be neither well defined nor easily interpretable. In contrast, the sample average treatment effect (SATE) is the mean difference in the counterfactual outcomes for the study units. The sample parameter is easily interpretable and arguably the most relevant when the study units are not sampled from some specific super-population of interest. Furthermore, in most settings, the sample parameter will be estimated more efficiently than the population parameter. To the best of our knowledge, this is the first paper to propose using targeted maximum likelihood estimation (TMLE) for estimation and inference of the sample effect in trials with and without pair-matching. We study the asymptotic and finite sample properties of the TMLE for the sample effect and provide a conservative variance estimator. Finite sample simulations illustrate the potential gains in precision and power from selecting the sample effect as the target of inference. This work is motivated by the Sustainable East Africa Research in Community Health (SEARCH) study, a pair-matched, community randomized trial to estimate the effect of population-based HIV testing and streamlined ART on the 5-year cumulative HIV incidence (NCT01864603). The proposed methodology will be used in the primary analysis for the SEARCH trial. Copyright © 2016 John Wiley & Sons, Ltd. PMID:27087478

  3. Matched Quantization and Band Separation in a Direct Sampling Dual Band GNSS Receiver for Civil Aviation

    OpenAIRE

    Blais, Antoine; Macabiau, Christophe; Julien, Olivier

    2013-01-01

    This paper studies the application of the Direct Sampling technique to GNSS receivers dedicated to Civil Aviation usage. After a description of the specific spectral environment to be withstood by such receivers, two previously proposed architectures are reviewed. In the first one the E5a/L5 band and the E1/L1 band are sampled by a unique ADC, providing full coherency between bands. In the second architecture each band is sampled separately. The minimum sampling frequencies are also recalled ...

  4. Alternaria and Fusarium in Norwegian grains of reduced quality - a matched pair sample study

    DEFF Research Database (Denmark)

    Kosiak, B.; Torp, M.; Skjerve, E.; Andersen, Birgitte

    2004-01-01

    Fusarium spp. varied significantly in samples of reduced quality compared with acceptable samples. Alternaria spp. dominated in the acceptable samples with A. infectoria group as the most frequently isolated and most abundant species group of this genus while Fusarium spp. dominated in samples of reduced...... reduced quality. The results indicated a negative interaction between E graminearum and Alternaria spp. as well as between F graminearum and other Fusarium spp.......The occurrence and geographic distribution of species belonging to the genera Alternaria and Fusarium in grains of reduced and of acceptable quality were studied post-harvest in 1997 and 1998. A total of 260 grain samples of wheat, barley and oats was analysed. The distribution of Alternaria and...

  5. The COMT Val158 allele is associated with impaired delayed-match-to-sample performance in ADHD

    Directory of Open Access Journals (Sweden)

    Matthews Natasha

    2012-05-01

    Full Text Available Abstract Background This study explored the association between three measures of working memory ability and genetic variation in a range of catecholamine genes in a sample of children with ADHD. Methods One hundred and eighteen children with ADHD performed three working memory measures taken from the CANTAB battery (Spatial Span, Delayed-match-to-sample, and Spatial Working Memory. Associations between performance on working memory measures and allelic variation in catecholamine genes (including those for the noradrenaline transporter [NET1], the dopamine D4 and D2 receptor genes [DRD4; DRD2], the gene encoding dopamine beta hydroxylase [DBH] and catechol-O-methyl transferase [COMT] were investigated using regression models that controlled for age, IQ, gender and medication status on the day of test. Results Significant associations were found between performance on the delayed-match-to-sample task and COMT genotype. More specifically, val/val homozygotes produced significantly more errors than did children who carried a least one met allele. There were no further associations between allelic variants and performance across the other working memory tasks. Conclusions The working memory measures employed in the present study differed in the degree to which accurate task performance depended upon either the dynamic updating and/or manipulation of items in working memory, as in the spatial span and spatial working memory tasks, or upon the stable maintenance of representations, as in the delay-match–to-sample task. The results are interpreted as evidence of a relationship between tonic dopamine levels associated with the met COMT allele and the maintenance of stable working memory representations required to perform the delayed-match-to-sample-task.

  6. Implicit Density Estimation by Local Moment Matching to Sample from Auto-Encoders

    OpenAIRE

    Bengio, Yoshua; Alain, Guillaume; Rifai, Salah

    2012-01-01

    Recent work suggests that some auto-encoder variants do a good job of capturing the local manifold structure of the unknown data generating density. This paper contributes to the mathematical understanding of this phenomenon and helps define better justified sampling algorithms for deep learning based on auto-encoder variants. We consider an MCMC where each step samples from a Gaussian whose mean and covariance matrix depend on the previous state, defines through its asymptotic distribution a...

  7. Nutritional Status of Flemish Vegetarians Compared with Non-Vegetarians: A Matched Samples Study

    Directory of Open Access Journals (Sweden)

    Peter Clarys

    2010-07-01

    Full Text Available The present study compares the nutritional status of vegetarian (V with non-vegetarian (NV subjects. A three-day food record and a health questionnaire were completed by 106 V and 106 NV matched for following characteristics: sex, age, BMI, physical activity, tobacco use and alcohol consumption. Total energy intake was not significantly different (men: V: 2,346 ± 685 kcal/d; NV: 2,628 ± 632 kcal/d; p = 0.078; women: V: 1,991 ± 539 kcal/d; NV: 1,973 ± 592 kcal/d; p = 0.849. Macronutrients intake differed significantly between the V and NV subjects for protein (men: V:12.7 ± 2.3 E%; NV:15.3 ± 4.5 E%; p = 0.003; women: V: 13.2 ± 2.3 E%; NV:16.0 ± 4.0 E%; p < 0.001, fat (men: V: 29.3 ± 8.4 E%; NV: 33.8 ± 5.3 E%; p = 0.010; women: V: 29.7 ± 6.9 E%; NV: 34.7 ± 9.0 E%; p < 0.001, and carbohydrate (men: V: 55.3 ± 10.1 E%; NV: 47.4 ± 6.9 E%; p < 0.001; women: V: 55.1 ± 7.6 E%; NV: 47.2 ± 8.2 E%; p < 0.001. The intake of most minerals was significantly different between the V and the NV subjects. V had a lower sodium intake, higher calcium, zinc, and iron intake compared to the NV subjects. Our results clearly indicate that a vegetarian diet can be adequate to sustain the nutritional demands to at least the same degree as that of omnivores. The intakes of the V subjects were closer to the recommendations for a healthy diet when compared to a group of well matched NV subjects.

  8. Alternaria and Fusarium in Norwegian grains of reduced quality - a matched pair sample study

    DEFF Research Database (Denmark)

    Kosiak, B.; Torp, M.; Skjerve, E.; Andersen, Birgitte

    2004-01-01

    The occurrence and geographic distribution of species belonging to the genera Alternaria and Fusarium in grains of reduced and of acceptable quality were studied post-harvest in 1997 and 1998. A total of 260 grain samples of wheat, barley and oats was analysed. The distribution of Alternaria and...

  9. Radio observations of luminosity and flux-matched samples of quasi stellar objects

    International Nuclear Information System (INIS)

    The VLA and the US VLBI network were used to carry out an extensive study of sixty radio-loud quasars. The quasars were divided by redshift into three groups in such a way that comparisons were possible between two luminosity-independent samples and two flux-independent samples. The low redshift, low luminosity sample was found to differ more from the medium and high redshift groups than the latter two were found to differ from one another. Source properties that correlate with redshift include both angular and linear size, core dominance, and magnetic field density. Corrections for non-uniform optical depths and for Malmquist bias yield a plausible Hubble diagram that is consistent with q/sub o/ of 0.2 (although values as large as 1.0 cannot be excluded) and that indicates steep evolution in quasar brightness. A large fraction of the low luminosity, low redshift (z<1.0) quasars were found to contain jets that are similar to those seen in nearby bright radio galaxies. There is poor agreement between the VLA structure and the VLBI structure when the latter is observed. Implications for various radio source models are discussed. It is important to pursue the idea of a radio Hubble diagram using a larger source sample; it may be possible to select good radio standard candles by source size and spectral index. Better observations are planned of the extended jets for comparison with radio galaxies. The relationship between the parsec (VLBI) and kiloparsec (VLA) structures are also very important and will be pursued with better VLBI data

  10. Behavioural development in a matching-to-sample task and token use by an infant chimpanzee reared by his mother

    OpenAIRE

    Sousa, Cláudia; Okamoto, Sanae; Matsuzawa, Tetsuro

    2003-01-01

    We investigated the behavioural and cognitive development of a captive male infant chimpanzee, Ayumu, raised by his mother, Ai. Here we report Ayumu’s achievements up to the age of 2 years and 3 months, in the context of complex computer-controlled tasks. From soon after birth, Ayumu had been present during an experiment performed by his mother. The task consisted of two phases, a matching-to-sample task in which she received token rewards, and the insertion of these t...

  11. Health aspects, nutrition and physical characteristics in matched samples of institutionalized vegetarian and non-vegetarian elderly (> 65yrs)

    OpenAIRE

    Hebbelinck Marcel; De Ridder Dolf; Aerenhouts Dirk; Deriemaeker Peter; Clarys Peter

    2011-01-01

    Abstract Background Epidemiological studies indicate that a well balanced vegetarian diet offers several health benefits including a lower prevalence of prosperity diseases in vegetarians compared to omnivores. It was the purpose of the present study to compare nutritional and physical characteristics in matched samples of institutionalized vegetarian (V) and non-vegetarian (NV) elderly. Methods Twenty-two female and 7 male V (females: 84.1 ± 5.1yrs, males: 80.5 ± 7.5yrs) and 23 female and 7 ...

  12. Effect of stimulus and response separation in a matching-to-sample task in the brushtail possum (Trichosurus vulpecula).

    Science.gov (United States)

    Cameron, Kristie E; McEwan, James S A; Temple, Bill

    2015-09-01

    This study seeks to investigate the impact of changing the proximity of stimulus and response manipulanda on matching-to-sample performance in possums. Possums were presented with five rows of blue and yellow stimuli arranged vertically 25mm apart above response levers. Generally, peak performance occurred at the distance from the lever currently being trained. Performance generalized to distances close to the currently trained distance and decreased in accuracy at distances further from the trained level. The findings from this experiment provide evidence for placing stimuli and response manipulanda close together to improve acquisition of a task, and increase the responding accuracy in MTS experiments. This suggests that spatial contiguity in the relative location of stimuli and response manipulanda is critical to animals performing complex operant tasks. PMID:25979605

  13. Efficient sampling techniques for uncertainty quantification in history matching using nonlinear error models and ensemble level upscaling techniques

    KAUST Repository

    Efendiev, Y.

    2009-11-01

    The Markov chain Monte Carlo (MCMC) is a rigorous sampling method to quantify uncertainty in subsurface characterization. However, the MCMC usually requires many flow and transport simulations in evaluating the posterior distribution and can be computationally expensive for fine-scale geological models. We propose a methodology that combines coarse- and fine-scale information to improve the efficiency of MCMC methods. The proposed method employs off-line computations for modeling the relation between coarse- and fine-scale error responses. This relation is modeled using nonlinear functions with prescribed error precisions which are used in efficient sampling within the MCMC framework. We propose a two-stage MCMC where inexpensive coarse-scale simulations are performed to determine whether or not to run the fine-scale (resolved) simulations. The latter is determined on the basis of a statistical model developed off line. The proposed method is an extension of the approaches considered earlier where linear relations are used for modeling the response between coarse-scale and fine-scale models. The approach considered here does not rely on the proximity of approximate and resolved models and can employ much coarser and more inexpensive models to guide the fine-scale simulations. Numerical results for three-phase flow and transport demonstrate the advantages, efficiency, and utility of the method for uncertainty assessment in the history matching. Copyright 2009 by the American Geophysical Union.

  14. Target problem (mis) matching: predictors and consequences of parent-youth agreement in a sample of anxious youth.

    Science.gov (United States)

    Hoffman, Lauren J; Chu, Brian C

    2015-04-01

    Parents and youth often report discrepant target problems upon seeking treatment for youth psychopathology, which can have important impact on therapy processes (e.g., dropout) and treatment outcomes, as entry-level attitudes have been found to be influential in ultimate use and benefit of treatment. The current study examined parent-youth agreement within an anxiety disordered sample by assessing demographic and diagnostic factors that may predict matching, as well as the impact of matching on attrition, treatment outcome, and parental satisfaction. Ninety-five youth with principal anxiety disorders received cognitive-behavioral treatment for anxiety at a university outpatient clinic. Youth and parents independently identified target problems during the pretreatment assessment. Target problems were coded into 25 qualitative categories representing diagnostic, symptom, and functional impairment domains, including diffuse anxiety, social anxiety, academic achievement, oppositional/behavior problems, sleep problems, suicidal ideation, and family functioning. The majority of parent-youth dyads (67.4%) agreed on at least one target problem. Although problems related to diffuse anxiety and social anxiety were reported most frequently, relatively low rates of agreement were found in these domains. Kappa values demonstrated higher levels of agreement for problems with specific fears, school attendance, and panic and lower levels of agreement for difficulties with worry, shame, and self-esteem. Further, youth diagnosed with comorbid externalizing disorders were less likely to agree with their parents on at least one target problem. No effects were found for gender, age, or number of diagnoses in predicting agreement. Target problem agreement did not significantly impact rates of attrition or diagnostic remission, but did predict some measures of parental satisfaction. Results suggest that disagreement on treatment goals exists even within a narrow treatment population and

  15. A Fast and Robust Feature-Based Scan-Matching Method in 3D SLAM and the Effect of Sampling Strategies

    Directory of Open Access Journals (Sweden)

    Cihan Ulas

    2013-11-01

    like a university campus, we obtained satisfactory performance results. Moreover, the feature extraction part of the algorithm is considered as a special sampling strategy for scan-matching and compared to other sampling strategies, such as random sampling and grid-based sampling, the latter of which is first used in the NDT. Thus, this study also shows the effect of the subsampling on the performance of the NDT.

  16. Task-specific modulation of human auditory evoked responses in a delayed-match-to-sample task

    Directory of Open Access Journals (Sweden)

    Feng eRong

    2011-05-01

    Full Text Available In this study, we focus our investigation on task-specific cognitive modulation of early cortical auditory processing in human cerebral cortex. During the experiments, we acquired whole-head magnetoencephalography (MEG data while participants were performing an auditory delayed-match-to-sample (DMS task and associated control tasks. Using a spatial filtering beamformer technique to simultaneously estimate multiple source activities inside the human brain, we observed a significant DMS-specific suppression of the auditory evoked response to the second stimulus in a sound pair, with the center of the effect being located in the vicinity of the left auditory cortex. For the right auditory cortex, a non-invariant suppression effect was observed in both DMS and control tasks. Furthermore, analysis of coherence revealed a beta band (12 ~ 20 Hz DMS-specific enhanced functional interaction between the sources in left auditory cortex and those in left inferior frontal gyrus, which has been shown to involve in short-term memory processing during the delay period of DMS task. Our findings support the view that early evoked cortical responses to incoming acoustic stimuli can be modulated by task-specific cognitive functions by means of frontal-temporal functional interactions.

  17. In-vitro evaluation of fungicides, bioagents and aqueous leaf extracts against Alternaria leaf blight of cotton

    Directory of Open Access Journals (Sweden)

    U. Dey

    2012-07-01

    Full Text Available All the six fungicides viz.,Mancozeb (75% WP; Carbendazim (50WP, Copper oxychloride (50WP, Captan (50 WP, Thiram (75 % WP, Chlorothalonil (75 WP evaluated in vitro (@500, 1000 and 1500 ppm were found effective against A. macrospora and caused significant inhibition of test pathogen over untreated control. However, Thiram was found most effective and recorded significantly highest mean mycelial inhibition (90.42%. This was followed by the fungicides, Captan (82.04%, Mancozeb (79.88%, Carbendazim(77.5%, Chlorothalonil (74.52% and copper oxychloride (71.75%. All the five fungal and one bacterial bioagents/ antagonists evaluated in vitro against A. macrospora were found antifungal/ antagonistic against the test pathogen. However, T. viride was found most effective and recorded least linear mycelial growth (32.72 mm with corresponding significantly highest mycelial inhibition (63.64% of the test pathogen. The second and third best bioagents found were T. koningii and P. fluorescens, which recorded linear mycelial growth, respectively of 33.90 mm and 33.95 mm with corresponding mycelial inhibition, respectively of 62.33 and 62.27 per cent. All the six botanicals/plant extracts evaluated in vitro (@5, 10 and 15 % each were found fungistatic/ fungicidal against. A.macrospora. However, significantly least mean radial mycelial growth (56.18mm and significantly highest mean mycelial inhibition (37.47% was recorded with Garlic. The second and third best botanicals found were onion and Tulsi which recorded second and third least mean radial mycelial growth, respectively of 58.52 mm and 62.51 mm with corresponding mean mycelial inhibition of 34.97 and 32.86 per cent, respectively.

  18. Multi-domain computerized cognitive training program improves performance of bookkeeping tasks: a matched-sampling active-controlled trial.

    Science.gov (United States)

    Lampit, Amit; Ebster, Claus; Valenzuela, Michael

    2014-01-01

    Cognitive skills are important predictors of job performance, but the extent to which computerized cognitive training (CCT) can improve job performance in healthy adults is unclear. We report, for the first time, that a CCT program aimed at attention, memory, reasoning and visuo-spatial abilities can enhance productivity in healthy younger adults on bookkeeping tasks with high relevance to real-world job performance. 44 business students (77.3% female, mean age 21.4 ± 2.6 years) were assigned to either (a) 20 h of CCT, or (b) 20 h of computerized arithmetic training (active control) by a matched sampling procedure. Both interventions were conducted over a period of 6 weeks, 3-4 1-h sessions per week. Transfer of skills to performance on a 60-min paper-based bookkeeping task was measured at three time points-baseline, after 10 h and after 20 h of training. Repeated measures ANOVA found a significant Group X Time effect on productivity (F = 7.033, df = 1.745; 73.273, p = 0.003) with a significant interaction at both the 10-h (Relative Cohen's effect size = 0.38, p = 0.014) and 20-h time points (Relative Cohen's effect size = 0.40, p = 0.003). No significant effects were found on accuracy or on Conners' Continuous Performance Test, a measure of sustained attention. The results are discussed in reference to previous findings on the relationship between brain plasticity and job performance. Generalization of results requires further study. PMID:25120510

  19. Multi-domain computerized cognitive training program improves performance of bookkeeping tasks: a matched-sampling active-controlled trial

    Directory of Open Access Journals (Sweden)

    AmitLampit

    2014-07-01

    Full Text Available Cognitive skills are important predictors of job performance, but the extent to which Computerized Cognitive Training (CCT can improve job performance in healthy adults is unclear. We report, for the first time, that a CCT program aimed at attention, memory, reasoning and visuo-spatial abilities can enhance productivity in healthy younger adults on bookkeeping tasks with high relevance to real-world job performance. 44 business students (77.3% female, mean age 21.4 ± 2.6 years were assigned to either (a 20 hours of CCT, or (b 20 hours of computerized arithmetic training (active control by a matched sampling procedure. Both interventions were conducted over a period of six weeks, 3-4 one-hour sessions per week. Transfer of skills to performance on a 60-minute paper-based bookkeeping task was measured at three time points – baseline, after 10 hours and after 20 hours of training. Repeated measures ANOVA found a significant Group X Time effect on productivity (F=7.033, df=1.745; 73.273, p=0.003 with a significant interaction at both the 10-hour (Relative Cohen’s effect size = 0.38, p=0.014 and 20-hour time points (Relative Cohen’s effect size = 0.40, p=0.003. No significant effects were found on accuracy or on Conners’ Continuous Performance Test, a measure of sustained attention. The results are discussed in reference to previous findings on the relationship between brain plasticity and job performance. Generalization of results requires further study.

  20. GAS CHROMATOGRAPHIC PREDICTION OF POLYAROMATICS RETENTION INDICES IN PETROLEUM CRUDE OIL SAMPLE BASED ON RETENTION INDICES MATCHING

    OpenAIRE

    N.E. Moustafa

    2008-01-01

    Gas chromatographic prediction of poly-aromatics retention indices in a petroleum crude oil based on matchingwith reported retention indices on the same stationary phases under a similar temperature program was studied.The bases of the matching with reported retention indices for peaks identifications were mentioned. Deconvulatedsoftware was used to separate the overlapped poly-aromatic peaks.

  1. Use of Samples Differing Markedly in Salience May Encourage Use of a Single-Code/Default Strategy in Matching-to-Sample in Pigeons

    Science.gov (United States)

    Grant, Douglas S.

    2009-01-01

    To test the hypothesis that pigeons will only code the more salient sample when samples differ markedly in salience, pigeons were trained with samples consisting of a 2-s presentation of food (highly salient sample) and an 8-s presentation of keylight (less salient sample). During retention testing, pigeons tended to respond at longer delays as if…

  2. Health aspects, nutrition and physical characteristics in matched samples of institutionalized vegetarian and non-vegetarian elderly (> 65yrs

    Directory of Open Access Journals (Sweden)

    Hebbelinck Marcel

    2011-06-01

    Full Text Available Abstract Background Epidemiological studies indicate that a well balanced vegetarian diet offers several health benefits including a lower prevalence of prosperity diseases in vegetarians compared to omnivores. It was the purpose of the present study to compare nutritional and physical characteristics in matched samples of institutionalized vegetarian (V and non-vegetarian (NV elderly. Methods Twenty-two female and 7 male V (females: 84.1 ± 5.1yrs, males: 80.5 ± 7.5yrs and 23 female and 7 male NV (females: 84.3 ± 5.0yrs, males: 80.6 ± 7.3yrs participated. All subjects were over 65 years of age, and free of major disease or physical handicap. Dietary intake, blood profile, anthropometrics, and handgrip strength were determined. Results Mean daily energy intake was 6.8 ± 2.0MJ in V females, and 8.0 ± 1.4MJ in the NV females, only the V did not reach the recommended value of 7.8 MJ. Male V and NV had a mean daily energy intake of 8.7 ± 1.6MJ and 8.7 ± 1.2MJ respectively (RDI: 8.8 MJ. Mean carbohydrate intake was significantly below the RDI in NV only (female V: 47.8 ± 7.5E%, female NV: 43.3 ± 4.6E%, male V: 48.1 ± 6.4E%, male NV: 42.3 ± 3.6E%, while protein (female V: 17.3 ± 3.4E%, female NV: 19.5 ± 3.5E%, male V: 17.8 ± 3.4E%, male NV: 21.0 ± 2.0E%, and saturated fat intake (female V: 25.4 ± 8.2 g/day, female NV: 32.2 ± 6.9 g/day, male V: 31.4 ± 12.9 g/day, male NV: 33.4 ± 4.7 g/day were too high in both V and NV. Mean micronutrient intakes met the RDI's in all 4 groups. Mean blood concentrations for vitamin B12, folic acid, iron, and calcium were normal in all 4 groups. Mean zinc blood serum was below the reference value in all groups, whereas estimated zinc intake was in agreement with the RDI. The mean blood cholesterol concentration was above the 200 mg/dl upper limit in the V group (213 ± 40 mg/dl and below that limit in the NV (188 ± 33 mg/dl group. Mean BMI was 26.1 ± 4.7 kg/m2 in the female V, 26.8 ± 3.7 kg/m2 in

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

  4. Harmonically matched grating-based full-field quantitative high-resolution phase microscope for observing dynamics of transparent biological samples

    OpenAIRE

    Wu, Jigang; Yaqoob, Zahid; Heng, Xin; Yang, Changhuei

    2007-01-01

    We have developed a full-field high resolution quantitative phase imaging technique for observing dynamics of transparent biological samples. By using a harmonically matched diffraction grating pair (600 and 1200 lines/mm), we were able to obtain non-trivial phase difference (other than 0° or 180°) between the output ports of the gratings. Improving upon our previous design, our current system mitigates astigmatism artifacts and is capable of high resolution imaging. This system also em...

  5. Errorless Establishment of a Match-to-Sample Form Discrimination in Preschool Children. I. A Modification of Animal Laboratory Procedures for Children, II. A Comparison of Errorless and Trial-and-Error Discrimination. Progress Report.

    Science.gov (United States)

    LeBlanc, Judith M.

    A sequence of studies compared two types of discrimination formation: errorless learning and trial-and-error procedures. The subjects were three boys and five girls from a university preschool. The children performed the experimental tasks at a typical match-to-sample apparatus with one sample window above and four match (response) windows below.…

  6. A novel map-matching procedure for low-sampling GPS data with applications to traffic flow analysis

    OpenAIRE

    Giovannini, Luca

    2011-01-01

    An extensive sample (2%) of private vehicles in Italy are equipped with a GPS device that periodically measures their position and dynamical state for insurance purposes. Having access to this type of data allows to develop theoretical and practical applications of great interest: the real-time reconstruction of traffic state in a certain region, the development of accurate models of vehicle dynamics, the study of the cognitive dynamics of drivers. In order for these applications to be pos...

  7. An exfoliation and enrichment strategy results in improved transcriptional profiles when compared to matched formalin fixed samples

    Directory of Open Access Journals (Sweden)

    Hawthorn Lesleyann

    2007-08-01

    Full Text Available Abstract Background Identifying the influence formalin fixation has on RNA integrity and recovery from clinical tissue specimens is integral to determining the utility of using archival tissue blocks in future molecular studies. For clinical material, the current gold standard is unfixed tissue that has been snap frozen. Fixed and frozen tissue however, both require laser capture microdissection to select for a specific cell population to study. The recent development of a sampling method capable of obtaining a viable, enriched cell population represents an alternative option in procuring cells from clinical material for molecular research purposes. The expression profiles of cells obtained by using this procurement approach, in conjunction with the profiles from cells laser capture microdissected from frozen tissue sections, were compared to the expression profiles from formalin fixed cells to determine the influence fixation has on expression profiles in clinical material. Methods Triplicate samples of non-neoplastic colonic epithelial cells were recovered from a hemicolectomy specimen using three different procurement methods from the same originating site: 1 an exfoliation and enrichment strategy 2 laser capture microdissection from formalin fixed tissue and 3 laser capture microdissection from frozen tissue. Parameters currently in use to assess RNA integrity were utilized to assess the quality of recovered RNA. Additionally, an expression microarray was performed on each sample to assess the influence each procurement technique had on RNA recovery and degradation. Results The exfoliation/enrichment strategy was quantitatively and qualitatively superior to tissue that was formalin fixed. Fixation negatively influenced the expression profile of the formalin fixed group compared to both the frozen and exfoliated/enrichment groups. Conclusion The exfoliation/enrichment technique represents a superior alternative in tissue procurement and RNA

  8. 基于抽样的Deep Web模式匹配框架%Deep Web schema matching frame based on sampling

    Institute of Scientific and Technical Information of China (English)

    袁淼; 王鑫

    2015-01-01

    针对DCM(Dual Correlation Mining)框架匹配特殊模式集时查准率低下的缺陷,借鉴机器学习领域中的bagging方法,提出一种基于抽样的Deep Web模式匹配框架。该框架随机在模式集中抽取多个子模式集,分别对子模式集进行复杂匹配,集成各个子模式集的匹配结果,在整体上提高匹配的查准率。分析与实验证明该框架在处理特殊模式集时,平均能提高查准率41.2%。%The dual correlation mining frame has a low precision when some special schemas are in the set. Inspired by bagging algorithm in machine learning, a schema matching frame based on sampling is proposed. The frame randomly sample several subsets form input schemas, then execute the DCM matcher on each subset. The frame will achieve a robust matching accuracy by synthesizing the results of each subset. Experimental results show that the precision is increased by 41.2%in average.

  9. Informational matching

    OpenAIRE

    Rend??n, Silvio

    2002-01-01

    This paper analyzes the problem of matching heterogeneous agents in a Bayesian learning model. One agent gives a noisy signal to another agent, who is responsible for learning. If production has a strong informational component, a phase of cross-matching occurs, so that agents of low knowledge catch up with those of higher one. It is shown that: (i) a greater informational component in production makes cross-matching more likely; (ii) as the new technology is mastered, pr...

  10. Chronic treatment with sulbutiamine improves memory in an object recognition task and reduces some amnesic effects of dizocilpine in a spatial delayed-non-match-to-sample task.

    Science.gov (United States)

    Bizot, Jean-Charles; Herpin, Alexandre; Pothion, Stéphanie; Pirot, Sylvain; Trovero, Fabrice; Ollat, Hélène

    2005-07-01

    The effect of a sulbutiamine chronic treatment on memory was studied in rats with a spatial delayed-non-match-to-sample (DNMTS) task in a radial maze and a two trial object recognition task. After completion of training in the DNMTS task, animals were subjected for 9 weeks to daily injections of either saline or sulbutiamine (12.5 or 25 mg/kg). Sulbutiamine did not modify memory in the DNMTS task but improved it in the object recognition task. Dizocilpine, impaired both acquisition and retention of the DNMTS task in the saline-treated group, but not in the two sulbutiamine-treated groups, suggesting that sulbutiamine may counteract the amnesia induced by a blockade of the N-methyl-D-aspartate glutamate receptors. Taken together, these results are in favor of a beneficial effect of sulbutiamine on working and episodic memory. PMID:15951087

  11. Using Model, Cover, Copy, Compare, a Token Economy Program, and Discrete Trail Match to Sample Training for Teaching Functional Life Skills for a 13-Year-Old Middle School Student with Moderate Disabilities

    OpenAIRE

    KATHERINE J. HOOT; McLaughlin, T F; K. MARK DERBY; MARY “POLLY” DOLLIVER; REBECCA JOHNSON

    2014-01-01

    The purpose of this study was to evaluate the effectiveness of model, cover, copy, compare (MCCC), token system, and match to sample for teaching basic functional life skills with a middle age single student with disabilities. MCCC is a student-managed strategy that teaches discrete skills through errorless correction. Match to sample is another strategy that teaches how to identify and discriminate based on a visual representation of the identical information. The effectiveness o...

  12. Marketplaces and Matching

    OpenAIRE

    Coles, Melvyn G; Smith, Eric

    1994-01-01

    This paper models equilibrium trading patterns when marketplaces exist and goods are differentiated. When first visiting the market, a buyer samples a stock of goods. If fortunate, the buyer matches with and purchases one of these goods and then exits the market. If an initial match does not exist, the buyer can now only match with the flow of new goods for sale. The previous stock has been sampled and rejected. In a steady state, the current stock of unmatched traders on one side of the mark...

  13. Simultaneous quantitation of trace level hydrazine and acetohydrazide in pharmaceuticals by benzaldehyde derivatization with sample 'matrix matching' followed by liquid chromatography-mass spectrometry.

    Science.gov (United States)

    Cui, Li; Jiang, Kaina; Liu, David Q; Facchine, Kevin L

    2016-09-01

    Hydrazine and acetohydrazide are potential genotoxins and therefore need to be controlled in APIs and drug products to ppm levels for patient safety in cases where there is a reasonable probability of either of them being present. They are structurally related and could both be formed in the same chemical process under certain circumstances. However, no previous studies have reported simultaneous trace level quantification of these two compounds. Herein, a chemical derivatization scheme using benzaldehyde followed by LC-MS analysis is presented to address that need. During method development, unexpectedly high recoveries were encountered and presented a major challenge. A systematic investigation was undertaken to understand the benzaldehyde derivatization reaction and determine the underlying causes of the unacceptable recovery. It was found that this was due to the presence of the counter ion of the API in the sample matrix. Employing a 'matrix matching' sample preparation strategy, which involved acidifying the derivatization reaction medium with benzoic acid, gave similar reaction rates for the chemical derivatization in the presence and absence of the API salt and accordingly more consistent recoveries. Resultantly, a robust method for simultaneous quantification of hydrazine and acetohydrazide (1-100ppm) was successfully developed and validated. PMID:27495371

  14. Comparison of Nanostring nCounter® Data on FFPE Colon Cancer Samples and Affymetrix Microarray Data on Matched Frozen Tissues.

    Directory of Open Access Journals (Sweden)

    Xi Chen

    Full Text Available The prognosis of colorectal cancer (CRC stage II and III patients remains a challenge due to the difficulties of finding robust biomarkers suitable for testing clinical samples. The majority of published gene signatures of CRC have been generated on fresh frozen colorectal tissues. Because collection of frozen tissue is not practical for routine surgical pathology practice, a clinical test that improves prognostic capabilities beyond standard pathological staging of colon cancer will need to be designed for formalin-fixed paraffin-embedded (FFPE tissues. The NanoString nCounter® platform is a gene expression analysis tool developed for use with FFPE-derived samples. We designed a custom nCounter® codeset based on elements from multiple published fresh frozen tissue microarray-based prognostic gene signatures for colon cancer, and we used this platform to systematically compare gene expression data from FFPE with matched microarray array data from frozen tissues. Our results show moderate correlation of gene expression between two platforms and discovery of a small subset of genes as candidate biomarkers for colon cancer prognosis that are detectable and quantifiable in FFPE tissue sections.

  15. EFFECTS ON THE PERFORMANCE DURING A MATCHING-TO-SAMPLE TASK DUE TO THE TYPE AND ORDER OF EXPOSITION TO THE TRANSFERENCE TESTS

    Directory of Open Access Journals (Sweden)

    CAMILO HURTADO-PARRADO

    2007-08-01

    Full Text Available This study evaluated the effects of manipulating the type and order of presentation of transference tests. Twenty eightundergraduate students divided in 4 groups were exposed to a second order matching to sample procedure. Theconditions of exposition were: ascending difficulty/complexity order of the tests, descending order and two randomlyassigned orders. Results are discussed in terms of percentages of effectiveness; additionally, the latency is proposed asan alternative measure sensitive to the level of difficulty of this kind of tasks. Findings showed heterogeneity in thevelocity of acquisition of the conditional discriminations during the training phase, even though the conditions of thetask were equal for all the subjects. The exposition to the ascending and descending order seemed to affect negativelythe effective behavioral adjustment, whereas one of the randomly assigned sequences seemed to be the best condition.The order of exposition to transference tests, in interaction with a history of early acquisition in the training phase,served to understand the findings of this study and to discuss the necessity of a systematical evaluation of the factors implied in the transference tests. It is suggested to assess the validity of different kind of transference tests and theconvenience of some of them to be use in the investigation of the phenomena related to the effective and variablebehavior.

  16. Evaluating color deficiency simulation and daltonization methods through visual search and sample-to-match: SaMSEM and ViSDEM

    Science.gov (United States)

    Simon-Liedtke, Joschua T.; Farup, Ivar; Laeng, Bruno

    2015-01-01

    Color deficient people might be confronted with minor difficulties when navigating through daily life, for example when reading websites or media, navigating with maps, retrieving information from public transport schedules and others. Color deficiency simulation and daltonization methods have been proposed to better understand problems of color deficient individuals and to improve color displays for their use. However, it remains unclear whether these color prosthetic" methods really work and how well they improve the performance of color deficient individuals. We introduce here two methods to evaluate color deficiency simulation and daltonization methods based on behavioral experiments that are widely used in the field of psychology. Firstly, we propose a Sample-to-Match Simulation Evaluation Method (SaMSEM); secondly, we propose a Visual Search Daltonization Evaluation Method (ViSDEM). Both methods can be used to validate and allow the generalization of the simulation and daltonization methods related to color deficiency. We showed that both the response times (RT) and the accuracy of SaMSEM can be used as an indicator of the success of color deficiency simulation methods and that performance in the ViSDEM can be used as an indicator for the efficacy of color deficiency daltonization methods. In future work, we will include comparison and analysis of different color deficiency simulation and daltonization methods with the help of SaMSEM and ViSDEM.

  17. Using Model, Cover, Copy, Compare, a Token Economy Program, and Discrete Trail Match to Sample Training for Teaching Functional Life Skills for a 13-Year-Old Middle School Student with Moderate Disabilities

    Directory of Open Access Journals (Sweden)

    KATHERINE J. HOOT

    2014-08-01

    Full Text Available The purpose of this study was to evaluate the effectiveness of model, cover, copy, compare (MCCC, token system, and match to sample for teaching basic functional life skills with a middle age single student with disabilities. MCCC is a student-managed strategy that teaches discrete skills through errorless correction. Match to sample is another strategy that teaches how to identify and discriminate based on a visual representation of the identical information. The effectiveness of MCCC and match to sample was evaluated using a multiple baseline design. The results indicated that MCCC and match to sample was effective in teaching a single middle age school student with disabilities his name, phone number, home address, and emergency contact name and phone number. Maintenance of the basic functional life skills was also found; except for the emergency contact name. However, even if maintenance was not conducted on the final set, emergency phone number was maintained; this is attributed to the length of teaching sessions on the final set. The MCCC and match to sample interventions were both easy to implement and employ in the special education middle school classroom.

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

  19. Risky sexual behaviors and sexually transmitted diseases: a comparison study of cocaine-dependent individuals in treatment versus a community-matched sample.

    Science.gov (United States)

    Cavazos-Rehg, Patricia A; Spitznagel, Edward L; Schootman, Mario; Strickland, Jaime R; Afful, Stephanie E; Cottler, Linda B; Bierut, Laura Jean

    2009-09-01

    Cocaine users routinely engage in high-risk sexual behaviors that place them at an elevated risk of contracting HIV and other blood-borne infections. The purpose of the present study was to compare trading sex for drugs and/or money, having 10 or more sexual partners in 1 year, and sexually transmitted diseases (STDs) of cocaine-dependent individuals in treatment for their dependence across race and gender and against participants who live in their community. Cocaine-dependent individuals (n = 459) were identified through nine publicly and privately funded inpatient and outpatient chemical dependency treatment centers in the St. Louis area during 2001-2006. Community-based participants (n = 459) were matched to cocaine-dependent participants on age, ethnicity, gender, and zip code of residence. Mean age of the sample was 36 years old, 50% were Caucasians, 50% were African American, and 47% were male. Nearly half of cocaine-dependent participants in treatment had traded sex for drugs and/or money and over one-third had more than 10 sexual partners in 1 year with a risk concentrated among African Americans even after controlling for income and educational attainment. Participants recruited from the community with some exposure to cocaine reported similar rates of high risk sexual behaviors as the cocaine dependent subjects from treatment settings. It is important for clinicians to recognize that once released from treatment, cocaine-dependent individuals may be returning to high-risk environments where sexual risk behaviors are occurring in the context of cocaine use. PMID:19645618

  20. 疑难配血中混合抗体鉴定1例%Identification of Mixed Antibodies in a Sample with Doubtful Cross-matching Result

    Institute of Scientific and Technical Information of China (English)

    魏玲; 罗广平; 赵阳; 骆宏; 姬艳丽; 莫春妍; 张润青

    2012-01-01

    目的 探讨疑难配血过程中混合抗体的鉴定方法.方法 首先鉴定红细胞血型,并对血清进行抗体筛查及鉴定,再利用特定细胞对患者血清进行吸收放散实验分离抗体,最后分别对分离后的抗体进行鉴定.结果 患者血型为O型,Jka+b-,CCDee;用O型CCDee,Jkb+的细胞与患者血清进行吸收放散,分离抗体后鉴定结果为抗-cE、抗-Jkb的混合抗体.结论 选择合适的细胞进行吸收放散实验分离抗体,可以实现对混合抗体的鉴定,为患者选择相应抗原阴性的血液,保证临床输血安全.%Objective To identificate the mixed antibodies in a difficult-cross-matching sample. Methods RBC blood groups were identified, serum antibodies were screened and identified, special RBC was used in absorption and elu-tion test.the absorbed serum and the elution liquid were identified separately. Results The patient's blood groups were O. Jka+b- , CCDee. The RBC with O, CCDee, Jkb+was used in the absorption and elution test, the mixed antibodies were identified as anti-cE and anti-Jkb. 'Conclusion Suitable cells used in absorption and elution test can help to identify mixed antibodies. To ensure the safety of blood transfusion, irregular antibody related antigen negative blood can be used for the patient.

  1. Sub-millisecond firing synchrony of closely neighboring pyramidal neurons in hippocampal CA1 of rats during delayed non-matching to sample task

    Directory of Open Access Journals (Sweden)

    Susumu Takahashi

    2009-09-01

    Full Text Available Firing synchrony among neurons is thought to play functional roles in several brain regions. In theoretical analyses, firing synchrony among neurons within sub-millisecond precision is feasible to convey information. However, little is known about the occurrence and the functional significance of the sub-millisecond synchrony among closely neighboring neurons in the brain of behaving animals because of a technical issue: spikes simultaneously generated from closely neighboring neurons are overlapped in the extracellular space and are not easily separated. As described herein, using a unique spike sorting technique based on independent component analysis together with extracellular 12-channel multi-electrodes (dodecatrodes, we separated such overlapping spikes and investigated the firing synchrony among closely neighboring pyramidal neurons in the hippocampal CA1 of rats during a delayed non-matching to sample task. Results showed that closely neighboring pyramidal neurons in the hippocampal CA1 can co-fire with sub-millisecond precision. The synchrony generally co-occurred with the firing rate modulation in relation to both internal (retention and comparison and external (stimulus input and motor output events during the task. However, the synchrony occasionally occurred in relation to stimulus inputs even when rate modulation was clearly absent, suggesting that the synchrony is not simply accompanied with firing rate modulation and that the synchrony and the rate modulation might code similar information independently. We therefore conclude that the sub-millisecond firing synchrony in the hippocampus is an effective carrier for propagating information—as represented by the firing rate modulations—to downstream neurons.

  2. Generalised Matching

    Science.gov (United States)

    Clifford, Raphael; Harrow, Aram W.; Popa, Alexandru; Sach, Benjamin

    Given a pattern p over an alphabet Σ p and a text t over an alphabet Σ t , we consider the problem of determining a mapping f from Σ p to {Σ}t+ such that t = f(p 1)f(p 2)...f(p m ). This class of problems, which was first introduced by Amir and Nor in 2004, is defined by different constraints on the mapping f. We give NP-Completeness results for a wide range of conditions. These include when f is either many-to-one or one-to-one, when Σ t is binary and when the range of f is limited to strings of constant length. We then introduce a related problem we term pattern matching with string classes which we show to be solvable efficiently. Finally, we discuss an optimisation variant of generalised matching and give a polynomial-time min (1,sqrt{k/OPT})-approximation algorithm for fixed k.

  3. Utilizing the Zero-One Linear Programming Constraints to Draw Multiple Sets of Matched Samples from a Non-Treatment Population as Control Groups for the Quasi-Experimental Design

    Science.gov (United States)

    Li, Yuan H.; Yang, Yu N.; Tompkins, Leroy J.; Modarresi, Shahpar

    2005-01-01

    The statistical technique, "Zero-One Linear Programming," that has successfully been used to create multiple tests with similar characteristics (e.g., item difficulties, test information and test specifications) in the area of educational measurement, was deemed to be a suitable method for creating multiple sets of matched samples to be used as…

  4. CONTROL BIOLOGICO DE Ulex europaeus L.: INTERNACION A CHILE DE DOS POBLACIONES DEL BIOAGENTE Agonopterix ulicetella (Stainton (Lepidoptera: Oecophoridae Biological control of Ulex europaeus L.: Introduction to Chile of two populations of the moth Agonopterix ulicetella (Stainton (Lepidoptera: Oecophoridae

    Directory of Open Access Journals (Sweden)

    Hernán Norambuena M.

    2001-01-01

    Full Text Available Durante 1996 y 1997, se colectaron en Hilo, Hawaii, EEUU, y en Plymouth, Inglaterra, dos poblaciones del insecto Agonopterix ulicetella, un herbívoro específico de la maleza agrícola y forestal Ulex europaeus (espinillo. La selección de los bioagentes se realizó teniendo en cuenta los criterios señalados por varios investigadores de control biológico de malezas. Posterior a la introducción de dichas poblaciones a Chile, se les sometió a las etapas de cuarentena, confirmación de especificidad y crianza en laboratorio, protocolos esenciales para desarrollar el método de control biológico clásico. Ambas poblaciones sobrevivieron el transporte, el cambio de hemisferio y la cuarentena. Asimismo, se obtuvieron nuevas generaciones de laboratorio de las poblaciones de Hilo y Plymouth, lo cual permitió que se autorizara la liberación de A. ulicetella en Chile, en 1997 y 1998Two strains of the moth Agonopterix ulicetella, a host-specific bioagent of the weed Ulex europaeus (gorse, collected in Hilo, Hawaii, and Plymouth, United Kingdom, were introduced to Chile in 1996 and 1997. Bioagent selection considered the criteria suggested by several biocontrol investigators. Once introduced to Chile, both strains were subjected to quarantine, confirmation of specificity and breeding, three essential protocols to develop a classical weed biocontrol program. Both strains survived shipping, hemisphere change and produced new generations in quarantine. A. ulicetella populations were authorized to be released under field conditions in Chile in 1997 and 1998

  5. CONTROL BIOLOGICO DE Ulex europaeus L.: INTERNACION A CHILE DE DOS POBLACIONES DEL BIOAGENTE Agonopterix ulicetella (Stainton) (Lepidoptera: Oecophoridae) Biological control of Ulex europaeus L.: Introduction to Chile of two populations of the moth Agonopterix ulicetella (Stainton) (Lepidoptera: Oecophoridae)

    OpenAIRE

    Hernán Norambuena M; Sergio Escobar S.; Fernando Rodríguez A.

    2001-01-01

    Durante 1996 y 1997, se colectaron en Hilo, Hawaii, EEUU, y en Plymouth, Inglaterra, dos poblaciones del insecto Agonopterix ulicetella, un herbívoro específico de la maleza agrícola y forestal Ulex europaeus (espinillo). La selección de los bioagentes se realizó teniendo en cuenta los criterios señalados por varios investigadores de control biológico de malezas. Posterior a la introducción de dichas poblaciones a Chile, se les sometió a las etapas de cuarentena, confirmación de especificidad...

  6. Asymmetric colour matching: memory matching versus simultaneous matching

    OpenAIRE

    De Fez Saiz, Dolores; Capilla Perea, Pascual; Luque Cobija, María José; Pérez Carpinell, Jaime; Pozo, Juan Carlos del

    2001-01-01

    We have compared corresponding pairs obtained by simultaneous matching (haploscopic matching) and by memory matching (after 10 min) using 34 reference tests selected from the Munsell Atlas (glossy), belonging to the four main hues 5Y, 5G, 5PB, and 5RP. These colours lie very close to the F1 and F2 axes in the SVF space, where we have analyzed our results. Illuminants D65 and A were used as reference and matching illuminants, respectively. Our results show for both kinds of matching a tendency...

  7. "If he had 40 cents he'd buy matches instead of lollies": motivational factors in a sample of New Zealand adolescent firesetters.

    Science.gov (United States)

    Walsh, Daniel P; Lambie, Ian

    2013-01-01

    Motivation has been proposed as an important factor in both the causality and subsequent treatment of juveniles who deliberately light fires. Thus, a wide range of research has previously been completed, investigating such motives. This research has resulted in the creation of classifications of firesetting motives and behaviours, all of which fit upon a continuum of motivational categories-ranging from curiosity or match play, through to deliberate delinquent acts. This current study aimed to gain insight into how both firesetters and their caregivers perceived firesetting motivation. A total of 18 male youths, who had engaged in deliberate firesetting, and 13 parents were interviewed. Qualitative analysis gathered from interviews with adolescent participants reported personality and individual characteristic themes, the most frequent of these being anger, experimenting, peer pressure, and boredom. Parents on the other hand initially cited family historical factors as being a cause for their son's firesetting. This study showed the difficulties in attempting to classify firesetters. It became clear that there were often multiple motivations involved in adolescent firesetting, meanwhile a variation of motivations were reported by parents and firesetters. The differences between and ambiguities inherent in existing motivational typologies also became evident. The study produced strong evidence for the effectiveness of utilising multiple sources to gain a comprehensive understanding as to why children deliberately light fires. PMID:21948248

  8. Stinging Insect Matching Game

    Science.gov (United States)

    ... for Kids ▸ Stinging Insect Matching Game Share | Stinging Insect Matching Game Stinging insects can ruin summer fun for those who are ... the difference between the different kinds of stinging insects in order to keep your summer safe and ...

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

  10. Random multi-index matching problems

    OpenAIRE

    Martin, O C; Mezard, M.; Rivoire, O.

    2005-01-01

    The multi-index matching problem (MIMP) generalizes the well known matching problem by going from pairs to d-uplets. We use the cavity method from statistical physics to analyze its properties when the costs of the d-uplets are random. At low temperatures we find for d>2 a frozen glassy phase with vanishing entropy. We also investigate some properties of small samples by enumerating the lowest cost matchings to compare with our theoretical predictions.

  11. Spectators’ Participation Decisions in the Basketball Matches

    OpenAIRE

    YILDIZ, Alper; KOÇAK, Settar; Altunsöz, Irmak Hürmeriç; Devrilmez, Erhan

    2015-01-01

    Understanding the motives of spectators to participate in a basketball match is important for increasing the number of spectators. Main purpose of this study was to analyze the selected variables that affect on spectators’ participation in basketball matches. Supporters of two Turkish professional basketball teams formed the sample of the study (n = 259). Spectators’ Participation Decision Scale was used to assess the factors that make participants decide to attend a match. Descriptive and Fa...

  12. Popular b-matchings

    CERN Document Server

    Paluch, Katarzyna

    2011-01-01

    Suppose that each member of a set of agents has a preference list of a subset of houses, possibly involving ties and each agent and house has their capacity denoting the maximum number of correspondingly agents/houses that can be matched to him/her/it. We want to find a matching $M$, for which there is no other matching $M'$ such that more agents prefer $M'$ to $M$ than $M$ to $M'$. (What it means that an agent prefers one matching to the other is explained in the paper.) Popular matchings have been studied quite extensively, especially in the one-to-one setting. We provide a characterization of popular b-matchings for two defintions of popularity, show some $NP$-hardness results and for certain versions describe polynomial algorithms.

  13. Element Level Semantic Matching

    OpenAIRE

    Giunchiglia, Fausto; Yatskevich, Mikalai

    2004-01-01

    We think of Match as an operator which takes two graph-like structures and produces a mapping between semantically related nodes. The matching process is essentially divided into two steps: element level and structure level. Element level matchers consider only labels of nodes, while structure level matchers start from this information to consider the full graph. In this paper we present various element level semantic matchers, and discuss their implementation within the S-Match system. The m...

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

  15. Matchings in hexagonal cacti

    Directory of Open Access Journals (Sweden)

    E. J. Farrell

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

  16. Desempenho de pessoas com autismo em tarefas de emparelhamento com o modelo por identidade: efeitos da organização dos estímulos Effects of stimuli organization on identity matching-to-sample performances of persons with autism

    Directory of Open Access Journals (Sweden)

    Camila Graciella Santos Gomes

    2008-01-01

    Full Text Available O estudo avaliou o desempenho de 20 pessoas com autismo em uma tarefa de emparelhamento por identidade sob dois procedimentos que diferiram quanto à forma de apresentação dos estímulos e à resposta de escolha. No procedimento de matching típico cada tentativa apresentava um estímulo modelo e três de comparação; no matching adaptado três modelos e três estímulos de comparação eram apresentados simultaneamente. O procedimento foi conduzido em três blocos: 10 tentativas de matching adaptado, 10 de matching típico e 20 tentativas com os dois arranjos misturados. A média de acertos foi significativamente maior no matching adaptado, mas ocorreu acentuada variabilidade inter-individual e esse arranjo favoreceu principalmente o desempenho de participantes com escores menores. A história prévia de aprendizagem dos participantes, entre outros fatores, pode ter influenciado nesses resultados, o que requer melhor avaliação, com outros controles experimentais.This study assessed the performance of 20 persons with autism in an identity matching-to-sample task, using two procedures with different stimuli arrangements and different response requirements. The typical matching procedure presented one sample stimulus and three comparison stimuli; the adapted matching displayed three sample stimuli and three comparison stimuli simultaneously. Three consecutive sets of trials were conducted: a 10-trial set of adapted matching, a 10-trial set of typical matching, and a 20-trial set intermixing both trial types in an unsystematic order. The average score of correct performance was significantly higher under the adapted matching than under the typical matching, but the inter-individual variability was large and the adapted arrangement favored mainly the performance of participants with lower scores. The participants' previous history in learning may have played a role in the way they solved the present task, but further investigation, with

  17. Matching Firms, Managers, and Incentives

    OpenAIRE

    Bandiera, Oriana; Guiso, Luigi; Prat, Andrea; Sadun, Raffaella

    2009-01-01

    We provide evidence on the match between firms, managers and incentives using a new survey designed for this purpose. The survey contains information on a sample of executives’ risk preferences and human capital, on the explicit and implicit incentives they face and on the firms they work for. We model a market for managerial talent where both firms and managers are heterogeneous. Following the sources of heterogeneity observed in the data, we assume that firms differ by ownership structure a...

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

  19. Generic image matching system

    Science.gov (United States)

    Liang, Zhongjie T.

    1992-05-01

    The generic imaging matching system (GIMS) provides an optimal systematic solution to any problem of color image processing in printing and publishing that can be classified as or modeled to the generic image matching problem defined. Typical GIMS systems/processes include color matching from different output devices, color conversion, color correction, device calibration, colorimetric scanner, colorimetric printer, colorimetric color reproduction, and image interpolation from scattered data. GIMS makes color matching easy for the user and maximizes operational flexibility allowing the user to obtain the degree of match wanted while providing the capability to achieve the best balance with respect to the human perception of color, color fidelity, and preservation of image information and color contrast. Instead of controlling coefficients in a transformation formula, GIMS controls the mapping directly in a standard device-independent color space, so that color can be matched, conceptually, to the highest possible accuracy. An optimization algorithm called modified vector shading was developed to minimize the matching error and to perform a 'near-neighborhood' gamut compression. An automatic error correction algorithm with a multidirection searching procedure using correlated re-initialization was developed to avoid local minimum failures. Once the mapping for color matching is generated, it can be utilized by a multidimensional linear interpolator with a small look-up-table (LUT) implemented by either software, a hardware interpolator or a digital-signal-processor.

  20. Matching in Gabriel Graphs

    OpenAIRE

    Biniaz, Ahmad; Maheshwari, Anil; Smid, Michiel

    2014-01-01

    Given a set $P$ of $n$ points in the plane, the order-$k$ Gabriel graph on $P$, denoted by $k$-$GG$, has an edge between two points $p$ and $q$ if and only if the closed disk with diameter $pq$ contains at most $k$ points of $P$, excluding $p$ and $q$. We study matching problems in $k$-$GG$ graphs. We show that a Euclidean bottleneck perfect matching of $P$ is contained in $10$-$GG$, but $8$-$GG$ may not have any Euclidean bottleneck perfect matching. In addition we show that $0$-$GG$ has a m...

  1. Parameterized Pattern Matching -- Succinctly

    OpenAIRE

    Ganguly, Arnab; Shah, Rahul; Thankachan, Sharma V.

    2016-01-01

    We consider the $Parameterized$ $Pattern$ $Matching$ problem, where a pattern $P$ matches some location in a text $\\mathsf{T}$ iff there is a one-to-one correspondence between the alphabet symbols of the pattern to those of the text. More specifically, assume that the text $\\mathsf{T}$ contains $n$ characters from a static alphabet $\\Sigma_s$ and a parameterized alphabet $\\Sigma_p$, where $\\Sigma_s \\cap \\Sigma_p = \\varnothing$ and $|\\Sigma_s \\cup \\Sigma_p|=\\sigma$. A pattern $P$ matches a sub...

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

  3. Matching with Contracts

    OpenAIRE

    John William Hatfield; Milgrom, Paul R.

    2005-01-01

    We develop a model of matching with contracts which incorporates, as special cases, the college admissions problem, the Kelso-Crawford labor market matching model, and ascending package auctions. We introduce a new "law of aggregate demand" for the case of discrete heterogeneous workers and show that, when workers are substitutes, this law is satisfied by profit-maximizing firms. When workers are substitutes and the law is satisfied, truthful reporting is a dominant strategy for workers in a ...

  4. Learning Graphs to Match

    OpenAIRE

    Cho, Minsu; Alahari, Karteek; Ponce, Jean

    2013-01-01

    International audience Many tasks in computer vision are formulated as graph matching problems. Despite the NP-hard nature of the problem, fast and accurate approximations have led to significant progress in a wide range of applications. Learning graph models from observed data, however, still remains a challenging issue. This paper presents an effective scheme to parameterize a graph model, and learn its structural attributes for visual object matching. For this, we propose a graph repres...

  5. Meaningful Matches in Stereovision

    CERN Document Server

    Sabater, Neus; Morel, Jean-Michel

    2011-01-01

    This paper introduces a statistical method to decide whether two blocks in a pair of of images match reliably. The method ensures that the selected block matches are unlikely to have occurred "just by chance." The new approach is based on the definition of a simple but faithful statistical "background model" for image blocks learned from the image itself. A theorem guarantees that under this model not more than a fixed number of wrong matches occurs (on average) for the whole image. This fixed number (the number of false alarms) is the only method parameter. Furthermore, the number of false alarms associated with each match measures its reliability. This "a contrario" block-matching method, however, cannot rule out false matches due to the presence of periodic objects in the images. But it is successfully complemented by a parameterless "self-similarity threshold." Experimental evidence shows that the proposed method also detects occlusions and incoherent motions due to vehicles and pedestrians in non simulta...

  6. On perfect k-matchings

    OpenAIRE

    Lu, Hongliang

    2010-01-01

    In this paper, we generalize the notions of perfect matchings, perfect 2-matchings to perfect k-matchings and give a necessary and sufficient condition for existence of perfect k-matchings. For bipartite graphs, we show that this k-matching problem is equivalent to that matching question. Moreover, for regular graphs, we provide a sufficient condition of perfect k-matching in terms of edge connectivity.

  7. Classified Stable Matching

    CERN Document Server

    Huang, Chien-Chung

    2009-01-01

    We introduce the {\\sc classified stable matching} problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applicants. Both institutes and applicants have preferences over the other side. An institute classifies the applicants based on their research areas (or any other criterion), and, for each class, it sets a lower bound and an upper bound on the number of applicants it would hire in that class. The objective is to find a stable matching from which no group of participants has reason to deviate. Moreover, the matching should respect the upper/lower bounds of the classes. In the first part of the paper, we study classified stable matching problems whose classifications belong to a fixed set of ``order types.'' We show that if the set consists entirely of downward forests, there is a polynomial-time algorithm; otherwise, it is NP-complete to decide the existence of a stable matching. In the second part, we investigate the problem using a p...

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

  9. Outsourced pattern matching

    DEFF Research Database (Denmark)

    Faust, Sebastian; Hazay, Carmit; Venturi, Daniele

    2013-01-01

    In secure delegatable computation, computationally weak devices (or clients) wish to outsource their computation and data to an untrusted server in the cloud. While most earlier work considers the general question of how to securely outsource any computation to the cloud server, we focus...... 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...... and the client C T in order to learn the positions at which a pattern of length m matches the text (and nothing beyond that). This is called the outsourced pattern matching problem and is highly motivated in the context of delegatable computing since it offers storage alternatives for massive databases...

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

  11. Monkeys match and tally quantities across senses

    OpenAIRE

    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 numerically matched across (audio-visual) and within (visual-visual) modalities with equal accuracy and transferred to novel numerical values. In Experime...

  12. Multisensory Information Boosts Numerical Matching Abilities in Young Children

    Science.gov (United States)

    Jordan, Kerry E.; Baker, Joseph

    2011-01-01

    This study presents the first evidence that preschool children perform more accurately in a numerical matching task when given multisensory rather than unisensory information about number. Three- to 5-year-old children learned to play a numerical matching game on a touchscreen computer, which asked them to match a sample numerosity with a…

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

  14. Scanner matching optimization

    Science.gov (United States)

    Kupers, Michiel; Klingbeil, Patrick; Tschischgale, Joerg; Buhl, Stefan; Hempel, Fritjof

    2009-03-01

    Cost of ownership of scanners for the manufacturing of front end layers is becoming increasingly expensive. The ability to quickly switch the production of a layer to another scanner in case it is down is important. This paper presents a method to match the scanner grids in the most optimal manner so that use of front end scanners in effect becomes interchangeable. A breakdown of the various components of overlay is given and we discuss methods to optimize the matching strategy in the fab. A concern here is how to separate the scanner and process induced effects. We look at the relative contributions of intrafield and interfield errors caused by the scanner and the process. Experimental results of a method to control the scanner grid are presented and discussed. We compare the overlay results before and after optimizing the scanner grids and show that the matching penalty is reduced by 20%. We conclude with some thoughts on the need to correct the remaining matching errors.

  15. Characteristic Evolution and Matching

    Directory of Open Access Journals (Sweden)

    Winicour Jeffrey

    2001-01-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 current 3D codes that simulate binary black holes. A prime application of characteristic evolution is Cauchy-characteristic matching, which is also reviewed.

  16. Robust matching for voice recognition

    Science.gov (United States)

    Higgins, Alan; Bahler, L.; Porter, J.; Blais, P.

    1994-10-01

    This paper describes an automated method of comparing a voice sample of an unknown individual with samples from known speakers in order to establish or verify the individual's identity. The method is based on a statistical pattern matching approach that employs a simple training procedure, requires no human intervention (transcription, work or phonetic marketing, etc.), and makes no assumptions regarding the expected form of the statistical distributions of the observations. The content of the speech material (vocabulary, grammar, etc.) is not assumed to be constrained in any way. An algorithm is described which incorporates frame pruning and channel equalization processes designed to achieve robust performance with reasonable computational resources. An experimental implementation demonstrating the feasibility of the concept is described.

  17. 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...... represents the spatial coordinates of the grid nodes. Knowledge of how grid nodes are depicted in the observed image is described through the observation model. The prior consists of a node prior and an arc (edge) prior, both modeled as Gaussian MRFs. The node prior models variations in the positions of grid...... 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...

  18. Superlens as matching device

    OpenAIRE

    Veselago, V. G.

    2005-01-01

    The question is considered about possibility of overcoming diffraction limit at device, named superlens. This device is a flat slab, executed from material with index of refraction n,equal n=-1. It is shown, what this device really can focus the radiation to the spot, smaller than wavelength, but herewith superlens works not as optical instrument, based on the laws of geometric optics, but as certain matching device, for which does not exist diffraction limit. This is possible if thickness of...

  19. Designing Talent Matching Services

    OpenAIRE

    Kupari, Tiina

    2016-01-01

    There is a disruption going on in recruiting due to digitalization and the competition for the best tal¬ents. Due to these changes, recruiters are forced to re-evaluate their value proposals. Therefore, the case company, a consulting company in recruitment, found the need to update their talent matching services to bring added value to their customers. The aim was to reach the customers and talent understanding, and based on that, design service concepts. The literature review recapitula...

  20. Outsourced Pattern Matching

    OpenAIRE

    Faust, Sebastian; Hazay, Carmit; Venturi, Daniele

    2013-01-01

    In secure delegatable computation, computationally weak devices (or clients) wish to outsource their computation and data to an untrusted server in the cloud. While most earlier work considers the general question of how to securely outsource any computation to the cloud server, we focus 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 cl...

  1. Estimating Matching Games with Transfers

    OpenAIRE

    Jeremy T. Fox

    2008-01-01

    Economists wish to use data on matches to learn about the structural primitives that govern sorting. I show how to use equilibrium data on who matches with whom for semiparametric estimation of match production functions in many-to-many, two-sided matching games with transferable utility. Inequalities derived from equilibrium necessary conditions underlie a maximum score estimator of match production functions. The inequalities do not require data on transfers, quotas, production levels, or u...

  2. A memetic fingerprint matching algorithm

    OpenAIRE

    Sheng, Weiguo; Howells, Gareth; Fairhurst, Michael; Deravi, Farzin

    2007-01-01

    Minutiae point pattern matching is the most common approach for fingerprint verification. Although many minutiae point pattern matching algorithms have been proposed, reliable automatic fingerprint verification remains as a challenging problem, both with respect to recovering the optimal alignment and the construction of an adequate matching function. In this paper, we develop a memetic fingerprint matching algorithm (MFMA) which aims to identify the optimal or near optimal global matching, b...

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

  4. Bayesian grid matching

    DEFF Research Database (Denmark)

    Hartelius, Karsten; Carstensen, Jens Michael

    2003-01-01

    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...... grid nodes and grid-node artifacts and the method accommodates a wide range of grid distortions including: large-scale warping, varying row/column spacing, as well as nonrigid random fluctuations of the grid nodes. The methodology is demonstrated in two case studies concerning (1) localization of DNA...

  5. Multinomial pattern matching revisited

    Science.gov (United States)

    Horvath, Matthew S.; Rigling, Brian D.

    2015-05-01

    Multinomial pattern matching (MPM) is an automatic target recognition algorithm developed for specifically radar data at Sandia National Laboratories. The algorithm is in a family of algorithms that first quantizes pixel value into Nq bins based on pixel amplitude before training and classification. This quantization step reduces the sensitivity of algorithm performance to absolute intensity variation in the data, typical of radar data where signatures exhibit high variation for even small changes in aspect angle. Our previous work has focused on performance analysis of peaky template matching, a special case of MPM where binary quantization is used (Nq = 2). Unfortunately references on these algorithms are generally difficult to locate and here we revisit the MPM algorithm and illustrate the underlying statistical model and decision rules for two algorithm interpretations: the 1-of-K vector form and the scalar. MPM can also be used as a detector and specific attention is given to algorithm tuning where "peak pixels" are chosen based on their underlying empirical probabilities according to a reward minimization strategy aimed at reducing false alarms in the detection scenario and false positives in a classification capacity. The algorithms are demonstrated using Monte Carlo simulations on the AFRL civilian vehicle dataset for variety of choices of Nq.

  6. Matching pursuit of images

    Science.gov (United States)

    Bergeaud, Francois; Mallat, Stephane G.

    1995-04-01

    A crucial problem in image analysis is to construct efficient low-level representations of an image, providing precise characterization of features which compose it, such as edges and texture components. An image usually contains very different types of features, which have been successfully modeled by the very redundant family of 2D Gabor oriented wavelets, describing the local properties of the image: localization, scale, preferred orientation, amplitude and phase of the discontinuity. However, this model generates representations of very large size. Instead of decomposing a given image over this whole set of Gabor functions, we use an adaptive algorithm (called matching pursuit) to select the Gabor elements which approximate at best the image, corresponding to the main features of the image. This produces compact representation in terms of few features that reveal the local image properties. Results prove that the elements are precisely localized on the edges of the images, and give a local decomposition as linear combinations of `textons' in the textured regions. We introduce a fast algorithm to compute the matching pursuit decomposition for images with a complexity of (Omicron) (N log2 N) per iteration for an image of N2 pixels.

  7. BioAerosol Mass Spectrometry: Reagentless Detection of Individual Airborne Spores and Other Bioagent Particles Based on Laser Desorption/Ionization Mass Spectrometry

    Energy Technology Data Exchange (ETDEWEB)

    Steele, P T

    2004-07-20

    Better devices are needed for the detection of aerosolized biological warfare agents. Advances in the ongoing development of one such device, the BioAerosol Mass Spectrometry (BAMS) system, are described here in detail. The system samples individual, micrometer-sized particles directly from the air and analyzes them in real-time without sample preparation or use of reagents. At the core of the BAMS system is a dual-polarity, single-particle mass spectrometer with a laser based desorption and ionization (DI) system. The mass spectra produced by early proof-of-concept instruments were highly variable and contained limited information to differentiate certain types of similar biological particles. The investigation of this variability and subsequent changes to the DI laser system are described. The modifications have reduced the observed variability and thereby increased the usable information content in the spectra. These improvements would have little value without software to analyze and identify the mass spectra. Important improvements have been made to the algorithms that initially processed and analyzed the data. Single particles can be identified with an impressive level of accuracy, but to obtain significant reductions in the overall false alarm rate of the BAMS instrument, alarm decisions must be made dynamically on the basis of multiple analyzed particles. A statistical model has been developed to make these decisions and the resulting performance of a hypothetical BAMS system is quantitatively predicted. The predictions indicate that a BAMS system, with reasonably attainable characteristics, can operate with a very low false alarm rate (orders of magnitude lower than some currently fielded biodetectors) while still being sensitive to small concentrations of biological particles in a large range of environments. Proof-of-concept instruments, incorporating some of the modifications described here, have already performed well in independent testing.

  8. Quantity precommitment and price matching

    DEFF Research Database (Denmark)

    Tumennasan, Norovsambuu

    We revisit the question of whether price matching is anti-competitive in a capacity constrained duopoly setting. We show that the effect of price matching depends on capacity. Specifically, price matching has no effect when capacity is relatively low, but it benefits the firms when capacity is...... relatively high. Interestingly, when capacity is in an intermediate range, price matching benefits only the small firm but does not affect the large firm in any way. Therefore, one has to consider capacity seriously when evaluating if price matching is anti-competitive. If the firms choose their capacities...... simultaneously before pricing decisions, then the effect of price matching is either pro-competitive or ambiguous. We show that if the cost of capacity is high, then price matching can only (weakly) decrease the market price. On the other hand, if the cost of capacity is low, then the effect of price matching on...

  9. Active Learning for Matching Problems

    OpenAIRE

    Charlin, Laurent; Zemel, Rich; Boutilier, Craig

    2012-01-01

    Effective learning of user preferences is critical to easing user burden in various types of matching problems. Equally important is active query selection to further reduce the amount of preference information users must provide. We address the problem of active learning of user preferences for matching problems, introducing a novel method for determining probabilistic matchings, and developing several new active learning strategies that are sensitive to the specific matching objective. Expe...

  10. Background knowledge in ontology matching

    OpenAIRE

    Giunchiglia, Fausto; Shvaiko, Pavel; Yatskevich, Mikalai

    2007-01-01

    Ontology matching is a critical operation in many well-known metadata intensive applications, such as data integration and peer-to-peer information sharing. Typically, heterogeneity in these applications is reduced in two steps: (i) matching ontologies to determine correspondences and (ii) executing correspondences according to an application needs (e.g., data translation). In this position statement paper we focus only on the first, i.e., matching step. In particular, we think of matching as...

  11. Matching Games with Additive Externalities

    DEFF Research Database (Denmark)

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

    2012-01-01

    fully expressive representations of externalities in matchings require exponential space, in this paper we propose a compact model of externalities, in which the influence of a match on each agent is computed additively. In this framework, we analyze many-to-many and one-to-one matchings under neutral...

  12. Quantum image matching

    Science.gov (United States)

    Jiang, Nan; Dang, Yijie; Wang, Jian

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

  13. Organizations must match assets

    International Nuclear Information System (INIS)

    The unprofitable state of the Canadian oil industry, the adverse economic environment, the difficulty of finding capital, and the diminishing resources of conventional lighter crude oil make it necessary for Canadian oil companies to match their organizations and their financing to their assets. This is illustrated according to the experience of Saskoil, a Saskatchewan oil and gas company. An increasing production of oil and natural gas, and an increasing amount of new oil production as heavy oil, led to organizational changes such as the purchase of an asphalt plant to provide the company with downstream experience, establishing a working group to explore and develop heavy oil resources, and forming a company to manage non-core assets. The latter company, Pasqua Resources, manages assets such as small properties and ownership interests in order to increase the operating efficiency of Saskoil. Pasqua provides Saskoil with a corporate and organizational vehicle to accommodate partnerships and joint venture capital invested in property purchase opportunities, and to manage any of Saskoil's divestiture activities

  14. Surface Area Distribution Descriptor for object matching

    Directory of Open Access Journals (Sweden)

    Mohamed F. Gafar

    2010-07-01

    Full Text Available Matching 3D objects by their similarity is a fundamental problem in computer vision, computer graphics and many other fields. The main challenge in object matching is to find a suitable shape representation that can be used to accurately and quickly discriminate between similar and dissimilar shapes. In this paper we present a new volumetric descriptor to represent 3D objects. The proposed descriptor is used to match objects under rigid transformations including uniform scaling. The descriptor represents the object by dividing it into shells, acquiring the area distribution of the object through those shells. The computed areas are normalised to make the descriptor scale-invariant in addition to rotation and translation invariant. The effectiveness and stability of the proposed descriptor to noise and variant sampling density as well as the effectiveness of the similarity measures are analysed and demonstrated through experimental results.

  15. Molecular matching of red blood cells is superior to serological matching in sickle cell disease patients

    Directory of Open Access Journals (Sweden)

    Daiane Cobianchi da Costa

    2013-01-01

    Full Text Available OBJECTIVE: To evaluate the usefulness of DNA methods to provide a means to precisely genotypically match donor blood units for the antigen-negative type of 35 sickle cell disease patients<. METHODS: Red blood cell units were investigated for ABO, D, C, c, E, e, K, Fyª, Fy b, Jkª, Jk b, S, s, Diª and RH variants by performing a molecular array (Human Erythrocyte Antigen BeadChipTM, BioArray Solutions, polymerase chain reaction followed by restriction fragment length polymorphism analysis and sequencing of patient samples and donor units that had been serologically matched based on the ABO, Rh and K phenotypes and the presence of antibodies. RESULTS: Matches for 21 of 35 sickle cell disease patients presented discrepancies or mismatches for multiple antigens between the genotype profile and the antigen profile of their serologically-matched blood units. The main discrepancies or mismatches occurred in the RH, FY, JK and MNS systems. Eight Rh alloimmunized patients presented RHD and RHCE variants that had not been serologically identified. According to these results better matches were found for the patients with genotyped units and the patients benefited as shown by better in vivo red blood cell survival. CONCLUSION: Molecular matching is superior to serological matching in sickle cell disease patients, decreasing the risk of transfusion reactions, especially delayed transfusion reactions to existing alloantibodies and preventing alloimmunization.

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

  17. A hybrid features based image matching algorithm

    Science.gov (United States)

    Tu, Zhenbiao; Lin, Tao; Sun, Xiao; Dou, Hao; Ming, Delie

    2015-12-01

    In this paper, we present a novel image matching method to find the correspondences between two sets of image interest points. The proposed method is based on a revised third-order tensor graph matching method, and introduces an energy function that takes four kinds of energy term into account. The third-order tensor method can hardly deal with the situation that the number of interest points is huge. To deal with this problem, we use a potential matching set and a vote mechanism to decompose the matching task into several sub-tasks. Moreover, the third-order tensor method sometimes could only find a local optimum solution. Thus we use a cluster method to divide the feature points into some groups and only sample feature triangles between different groups, which could make the algorithm to find the global optimum solution much easier. Experiments on different image databases could prove that our new method would obtain correct matching results with relatively high efficiency.

  18. DOE Matching Grant Program

    International Nuclear Information System (INIS)

    Funding used to support a portion of the Nuclear Engineering Educational Activities. Upgrade of teaching labs, student support to attend professional conferences, salary support for graduate students. The US Department of Energy (DOE) has funded Purdue University School of Nuclear Engineering during the period of five academic years covered in this report starting in the academic year 1996-97 and ending in the academic year 2000-2001. The total amount of funding for the grant received from DOE is $416K. In the 1990's, Nuclear Engineering Education in the US experienced a significant slow down. Student enrollment, research support, number of degrees at all levels (BS, MS, and PhD), number of accredited programs, University Research and Training Reactors, all went through a decline to alarmingly low levels. Several departments closed down, while some were amalgamated with other academic units (Mechanical Engineering, Chemical Engineering, etc). The School of Nuclear Engineering at Purdue University faced a major challenge when in the mid 90's our total undergraduate enrollment for the Sophomore, Junior and Senior Years dropped in the low 30's. The DOE Matching Grant program greatly strengthened Purdue's commitment to the Nuclear Engineering discipline and has helped to dramatically improve our undergraduate and graduate enrollment, attract new faculty and raise the School of Nuclear Engineering status within the University and in the National scene (our undergraduate enrollment has actually tripled and stands at an all time high of over 90 students; total enrollment currently exceeds 110 students). In this final technical report we outline and summarize how the grant was expended at Purdue University

  19. DOE Matching Grant Program

    Energy Technology Data Exchange (ETDEWEB)

    Tsoukalas, L.

    2002-12-31

    Funding used to support a portion of the Nuclear Engineering Educational Activities. Upgrade of teaching labs, student support to attend professional conferences, salary support for graduate students. The US Department of Energy (DOE) has funded Purdue University School of Nuclear Engineering during the period of five academic years covered in this report starting in the academic year 1996-97 and ending in the academic year 2000-2001. The total amount of funding for the grant received from DOE is $416K. In the 1990's, Nuclear Engineering Education in the US experienced a significant slow down. Student enrollment, research support, number of degrees at all levels (BS, MS, and PhD), number of accredited programs, University Research and Training Reactors, all went through a decline to alarmingly low levels. Several departments closed down, while some were amalgamated with other academic units (Mechanical Engineering, Chemical Engineering, etc). The School of Nuclear Engineering at Purdue University faced a major challenge when in the mid 90's our total undergraduate enrollment for the Sophomore, Junior and Senior Years dropped in the low 30's. The DOE Matching Grant program greatly strengthened Purdue's commitment to the Nuclear Engineering discipline and has helped to dramatically improve our undergraduate and graduate enrollment, attract new faculty and raise the School of Nuclear Engineering status within the University and in the National scene (our undergraduate enrollment has actually tripled and stands at an all time high of over 90 students; total enrollment currently exceeds 110 students). In this final technical report we outline and summarize how the grant was expended at Purdue University.

  20. Improved Bidirectional Exact Pattern Matching

    OpenAIRE

    Hussain, Iftikhar; Hassan Kazmi, Syed Zaki; Ali Khan, Israr; Mehmood, Rashid

    2013-01-01

    In this research, we present an improved version of Bidirectional (BD) exact pattern matching (EPM) algorithm to solve the problem of exact pattern matching. Improved-Bidirectional (IBD) exact pattern matching algorithm introduced a new idea of scanning partial text window (PTW) as well with the pattern to take decision of moving pattern to the right of partial text window. IBD algorithm compares the characters of pattern to selected text window (STW) from both sides simultaneously as BD....

  1. Maximum matching on random graphs

    OpenAIRE

    Zhou, Haijun; Ou-Yang, Zhong-Can

    2003-01-01

    The maximum matching problem on random graphs is studied analytically by the cavity method of statistical physics. When the average vertex degree \\mth{c} is larger than \\mth{2.7183}, groups of max-matching patterns which differ greatly from each other {\\em gradually} emerge. An analytical expression for the max-matching size is also obtained, which agrees well with computer simulations. Discussion is made on this {\\em continuous} glassy phase transition and the absence of such a glassy phase ...

  2. An Incentive Theory of Matching

    OpenAIRE

    Brown, Alessio J. G.; Merkl, Christian; Snower, Dennis J.

    2010-01-01

    This paper examines the labour market matching process by distinguishing its two component stages: the contact stage, in which job searchers make contact with employers and the selection stage, in which they decide whether to match. We construct a theoretical model explaining two-sided selection through microeconomic incentives. Firms face adjustment costs in responding to heterogeneous variations in the characteristics of workers and jobs. Matches and separations are described through firms'...

  3. An Incentive Theory of Matching.

    OpenAIRE

    Brown, Alessio J. G.; Merkl, Christian; Snower, Dennis J.

    2010-01-01

    This paper examines the labour market matching process by distinguishing its two component stages: the contact stage, in which job searchers make contact with employers and the selection stage, in which they decide whether to match. We construct a theoretical model explaining two-sided selection through microeconomic incentives. Firms face adjustment costs in responding to heterogeneous variations in the characteristics of workers and jobs. Matches and separations are described through firms'...

  4. Ridge-based fingerprint matching

    OpenAIRE

    Pohar, Jaka

    2013-01-01

    The diploma thesis presents an upgrade of the FingerIdent fingerprint verification system. The current version of the system uses a minutia matching procedure for comparison of two fingerprints. In order to improve the security of the system we have implemented an additional matching procedure which is based on the use of fingerprint ridges. Algorithm inputs are lists of ridge points of two fingerprints. At the beginning the algorithm searches the initial base ridge pair and matches it. Th...

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

  6. Stimulus control of delayed matching in pigeons: Directed forgetting

    OpenAIRE

    Kendrick, Donald F.; Rilling, Mark; Stonebraker, Thomas B.

    1981-01-01

    Pigeons were trained in delayed matching-to-sample with two postsample stimuli. A postsample R-cue signaled that a matching choice phase would follow. A postsample F-cue signaled that a matching choice phase would not follow. Previous research found reduced matching accuracy on F-cued probe trials when comparison stimuli were presented in the choice phase. The present four experiments systematically varied the events following an F-cue to determine the conditions under which the F-cue reduces...

  7. Biobriefcase aerosol collector heater

    Science.gov (United States)

    Bell, Perry M.; Christian, Allen T.; Bailey, Christopher G.; Willis, Ladona; Masquelier, Donald A.; Nasarabadi, Shanavaz L.

    2009-03-17

    A system for sampling air and collecting particles potentially including bioagents entrained in the air for detection. The system comprises collecting a sample of the air with the particles entrained in the air, directing the sample to a receiving surface, directing a liquid to the receiving surface thereby producing a liquid surface, wherein the particles potentially including bioagents become captured in the liquid, and heating the liquid wherein the particles potentially including bioagents become heated to lysis the bioagents.

  8. 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...... 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...... gældende for de to stokastiske metoder omhandlet i denne afhandling. Derfor er en solid viden om geostatistik en forudsætning for at forstå disse metoder. En anden vigtig del af history matching er reservoir simulering. Den matematiske baggrund for strømning af fluider i porøse medier præsenteres sammen...

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

  10. Ensino de leitura e escrita através do pareamento com o modelo e seus efeitos sobre medidas de inteligência Teaching and writing through matching to sample and its effects on intelligence measures

    Directory of Open Access Journals (Sweden)

    José Gonçalves Medeiros

    2000-06-01

    Full Text Available Dois grupos (G1 e G2 de três crianças, entre oito e doze anos, repetentes, participaram do estudo. Ambos foram submetidos à aplicação do WISC e do IAR no início e final do estudo. O G1 foi submetido a um treino de discriminações condicionais, com palavras faladas como modelos e palavras impressas como comparação. Todas as crianças do G1 aprenderam a ler, com aumento maior de QI do que as crianças do G2. Nos testes apresentaram porcentagem elevada de leitura das palavras ensinadas e de generalização. No IAR, tanto os sujeitos do G1 quanto do G2 apresentaram mudanças nas habilidades medidas pelo teste, em especial, lateralidade, análise-síntese e coordenação motora, com maior porcentagem de itens alterados para os sujeitos do G1. Os resultados indicam a existência de uma relação entre a emergência de leitura generalizada e aumento de QI.Two groups (G1 and G2 consisting of three flunked children each, ranging from eight to twelve years old, participated in the study. Both groups were given the WISC and IAR tests at the beginning and at the end of the study. G1 underwent a training of conditional discriminations, with words spoken as sample and words printed as comparison. All the children of G1 learned how to read, with greater increase of IQ than the children of G2. In the tests they presented high percentage of reading of the taught and of the generalized words. In IAR, both the subjects of G1 and of the G2 showed changes in the measured abilities for the test, especially, laterality, analysis-synthesis and motor coordination, with larger percentage of items altered for the G1 subjects. The results indicate the existence of a relationship between the emergence of generalized reading and increase of IQ.

  11. Analysis of fatigue development during elite male handball matches

    DEFF Research Database (Denmark)

    Póvoas, Susana C A; Ascensão, António A M R; Magalhães, José;

    2014-01-01

    This study aimed at describing the physiological demands and fatigue development during elite male handball matches. Our hypothesis was that players perform multiple high-intensity activities during periods of the game and develop temporary and end-match neuromuscular fatigue. Time-motion analyses...... and heart rate (HR) recordings were performed in 40 players during 12 competitive matches. Blood samples were collected and sprint, jump and intermittent exercise performance (YYIE2) was assessed for 18 players at baseline conditions and after two competitive matches, and additional blood sampling and...... testing were performed for 12 of these players during a friendly match. The time spent with high-intensity running (4.4±2.0 to 3.1±1.7%), the frequency of demanding actions (61±5 to 54±6) and the time with HR above 80% HRmax (62±21 to 41±17%), were lowered from the first to the second half. Average blood...

  12. Curvature Integration Constrained Map Matching Method for GPS Floating Car Data

    OpenAIRE

    Zeng, Zhe; Li, Qingquan; ZOU Haixiang; WAN Jianhua

    2015-01-01

    The paper presents a map-matching method which mainly considers the curvature integral value of the curve as a map-matching characteristic for constraining the associated matching between two adjacent GPS track points. Through the implementation of map matching experiments for floating car data on the different conditions of both route categories and sampling intervals, the proposed curvature integration constrained map-matching method could be superior to the classic floating car map matchin...

  13. Evaluation of matching cost on the ISPRS stereo matching benchmark

    Science.gov (United States)

    Yue, Qingxing; Tang, Xinming; Gao, Xiaoming

    2015-12-01

    In this paper we evaluated several typical matching costs including CENSUS, mutual information (MI) and the normalized cross correlation using the ISPRS Stereo Matching Benchmark datasets for DSM generation by stereo matching. Two kinds of global optimization algorithms including semi-global matching (SGM) and graph cuts (GC) were used as optimization method. We used a sub-pixel method to obtain more accurate MI lookup table and a sub-pixel method was also used when computing cost by MI lookup table. MI itself is sensitive to partial radiation differences. So we used a kind of cost combined MI and CENSUS. After DSM generation, the deviation data between the generated DSM and Lidar was statistics out to compute the mean deviation (Mean), the median deviation (Med), the standard deviation (Stdev), the normalized median absolute deviation (NMAD), the percentage of deviation in tolerance etc., which were used to evaluate the accuracy of DSM generated from different cost.

  14. Improved Approach for Exact Pattern Matching (Bidirectional Exact Pattern Matching)

    OpenAIRE

    Hussain, Iftikhar; Kausar, Samina; Hussain, Liaqat; Asif Khan, Muhammad

    2013-01-01

    In this research we present Bidirectional exact pattern matching algorithm [20] in detail. Bidirectional (BD) exact pattern matching (EPM) introduced a new idea to compare pattern with Selected Text Window (STW) of text string by using two pointers (right and left) simultaneously in searching phase. In preprocessing phase Bidirectional EPM algorithm improved the shift decision by comparing rightmost and mismatched character of Partial Text Window (PTW) to the left of pattern at sa...

  15. Algorithmics of matching under preferences

    CERN Document Server

    Manlove, David

    2013-01-01

    Matching problems with preferences are all around us - they arise when agents seek to be allocated to one another on the basis of ranked preferences over potential outcomes. Efficient algorithms are needed for producing matchings that optimise the satisfaction of the agents according to their preference lists.In recent years there has been a sharp increase in the study of algorithmic aspects of matching problems with preferences, partly reflecting the growing number of applications of these problems worldwide. This book describes the most important results in this area, providing a timely upda

  16. Curvature Integration Constrained Map Matching Method for GPS Floating Car Data

    Directory of Open Access Journals (Sweden)

    ZENG Zhe

    2015-10-01

    Full Text Available The paper presents a map-matching method which mainly considers the curvature integral value of the curve as a map-matching characteristic for constraining the associated matching between two adjacent GPS track points. Through the implementation of map matching experiments for floating car data on the different conditions of both route categories and sampling intervals, the proposed curvature integration constrained map-matching method could be superior to the classic floating car map matching method when evaluating them by the matching accuracy and stability.

  17. Approximate Matching of Hierarchial Data

    DEFF Research Database (Denmark)

    Augsten, Nikolaus

    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-grams for the......-gram based distance between streets, introduces a global greedy matching that guarantees stable pairs, and links addresses that are stored with different granularity. The connector has been successfully tested with public administration databases. Our extensive experiments on both synthetic and real world......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...

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

  19. Designing self-matching linacs

    International Nuclear Information System (INIS)

    The present trend in ion-linac design is to begin with a radio-frequency quadrupole (RFQ) linac followed by one or more drift-tube linac (DTL) tanks in which permanent-magnet quadrupoles are used for transverse focusing. The lack of adjustable elements (knobs) strongly suggests that one should seek linac designs with intertank matching solutions that are insensitive to beam currents and emittances, which can be accomplished if there are no sharp discontinuities in the focusing properties along the entire linac. Guidelines are presented for linac design and describe techniques for longitudinal as well as transverse matching between tanks. For a wide range of beam currents and emittances, a beam matched at the entrance to the RFQ should remain well matched throughout the entire linac

  20. New Effective Multithreaded Matching Algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Manne, Fredrik; Halappanavar, Mahantesh

    2014-05-19

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

  1. Text analysis with sequence matching

    OpenAIRE

    Ferme, Marko; Ojsteršek, Milan

    2012-01-01

    This article describes some common problems faced in natural language processing. The main problem consist of a user given sentence, which has to be matched against an existing knowledge base, consisting of semantically described words or phrases. Some main problems in this process are outlined and the most common solutions used in natural language processing are overviewed. A sequence matching algorithm is introduced as an alternative solution and its advantages over the existing approaches ...

  2. An Incentive Theory of Matching

    OpenAIRE

    Dennis Snower; Christian Merkl; Alessio J. G. Brown

    2010-01-01

    We construct a theoretical model explaining two-sided selection through microeconomic incentives. Firms face adjustment costs in responding to heterogeneous variations in the characteristics of workers and jobs. Matches and separations are described through firms' job offer and firing decisions and workers' job acceptance and quit decisions. Our calibrated model for the U.S. can account for important empirical regularities that the conventional matching model cannot.

  3. Matching games with partial information

    OpenAIRE

    Paolo Laureti Yi-Cheng Zhang

    2003-01-01

    We analyze different ways of pairing agents in a bipartite matching problem, with regard to its scaling properties and to the distribution of individual ``satisfactions''. Then we explore the role of partial information and bounded rationality in a generalized {\\it Marriage Problem}, comparing the benefits obtained by self-searching and by a matchmaker. Finally we propose a modified matching game intended to mimic the way consumers' information makes firms to enhance the quality of their prod...

  4. Minimalist surface-colour matching

    OpenAIRE

    Amano, Kinjiro; Foster, David H.; Nascimento, Sérgio M. C.

    2005-01-01

    Some theories of surface-colour perception assume that observers estimate the illuminant on a scene so that its effects can be discounted. A critical test of this interpretation of colour constancy is whether surface-colour matching is worse when the number of surfaces in a scene is so small that any illuminant estimate is unreliable. In the experiment reported here, observers made asymmetric colour matches between pairs of simultaneously presented Mondrian-like patterns under different dayli...

  5. Procedurally fair and stable matching

    OpenAIRE

    Klaus, Bettina; Klijn, Flip

    2006-01-01

    We motivate procedural fairness for matching mechanisms and study two procedurally fair and stable mechanisms: employment by lotto (Aldershof et al., 1999) and the random order mechanism (Roth and Vande Vate, 1990, Ma, 1996). For both mechanisms we give various examples of probability distributions on the set of stable matchings and discuss properties that differentiate employment by lotto and the random order mechanism. Finally, we consider an adjustment of the random order mechanism, the eq...

  6. Estimating index of population trend by re-sampling techniques (jackknife and bootstrap) and its application to the life table study of rice leaf roller, Cnaphalocrocis medinalis(Lepidoptera: Pyralidae)

    Institute of Scientific and Technical Information of China (English)

    Fang-Ling Tao; Shi-Fan Min; Wei-Jian Wu; Guang-Wen Liang; Ling Zeng

    2008-01-01

    Taking a published natural population life table office leaf roller, Cnaphalocrocis medinalis (Lepidoptera: Pyralidae), as an example, we estimated the population trend index,I, via re-sampling methods (jackknife and bootstrap), determined its statistical properties and illustrated the application of these methods in determining the control effectiveness of bio-agents and chemical insecticides. Depending on the simulation outputs, the smoothed distribution pattern of the estimates of I by delete-1 jackknife is visually distinguishable from the normal density, but the smoothed pattern produced by delete-d jackknife, and logarithm-transformed smoothed patterns produced by both empirical and parametric bootstraps,matched well the corresponding normal density. Thus, the estimates of I produced by delete-1 jackknife were not used to determine the suppressive effect of wasps and insecticides. The 95% percent confidence intervals or the narrowest 95 percentiles and Z-test criterion were employed to compare the effectiveness of Trichogrammajaponicum Ashmead and insecti-cides (powder, 1.5% mevinphos + 3% alpha-hexachloro cyclohexane) against the rice leaf roller based on the estimates of I produced by delete-d jackknife and bootstrap techniques.At α= 0.05 level, there were statistical differences between wasp treatment and control, and between wasp and insecticide treatments, if the normality is ensured, or by the narrowest 95 percentiles. However, there is still no difference between insecticide treatment and control.By Z-test criterion, wasp treatment is better than control and insecticide treatment with P-value<0.01. Insecticide treatment is similar to control with P-value > 0.2 indicating that 95% confidence intervals procedure is more conservative. Although similar conclusions may be drawn by re-sampling techniques, such as the delta method, about the suppressive effect of trichogramma and insecticides, the normality of the estimates can be checked and guaranteed

  7. Reducing the Ising model to matchings

    CERN Document Server

    Huber, Mark

    2009-01-01

    Canonical paths is one of the most powerful tools available to show that a Markov chain is rapidly mixing, thereby enabling approximate sampling from complex high dimensional distributions. Two success stories for the canonical paths method are chains for drawing matchings in a graph, and a chain for a version of the Ising model called the subgraphs world. In this paper, it is shown that a subgraphs world draw can be obtained by taking a draw from matchings on a graph that is linear in the size of the original graph. This provides a partial answer to why canonical paths works so well for both problems, as well as providing a new source of algorithms for the Ising model. For instance, this new reduction immediately yields a fully polynomial time approximation scheme for the Ising model on a bounded degree graph when the magnitization is bounded away from 0.

  8. SEMI-GLOBAL MATCHING IN OBJECT SPACE

    OpenAIRE

    Bethmann, F.; T. Luhmann

    2015-01-01

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

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

  10. Structural Weights in Ontology Matching

    Directory of Open Access Journals (Sweden)

    Mohammad Mehdi Keikha

    2013-10-01

    Full Text Available Ontology matching finds correspondences between similar entities of different ontologies. Two ontologies may be similar in some aspects such as structure, semantic etc. Most ontology matching systems integrate multiple matchers to extract all the similarities that two ontologies may have. Thus, we face a major problem to aggregate different similarities.Some matching systems use experimental weights for aggregation of similarities among different matchers while others use machine learning approaches and optimization algorithms to find optimal weights to assign to different matchers. However, both approaches have their own deficiencies.In this paper, we will point out the problems and shortcomings of current similarity aggregation strategies. Then, we propose a new strategy, which enables us to utilize the structural information of ontologies to get weights of matchers, for the similarity aggregation task. For achieving this goal, we create a new Ontology Matching system which it uses three available matchers, namely GMO, ISub and VDoc.We have tested our similarity aggregation strategy on the OAEI 2012 data set. Experimental results show significant improvements in accuracies of several cases, especially in matching the classes of ontologies. We will compare the performance of our similarity aggregation strategy with other well-known strategies.

  11. State of the Art : Automatic Ontology Matching

    OpenAIRE

    Feiyu, Lin

    2007-01-01

    This report describes the theoretical foundations and relevant background in the domain of automatic ontology matching. It aims to show the range of ontology matching, matching strategies, and an overview of ontology matching systems. The measures for evaluating ontology matching are discussed. This report also summarizes interesting research questions in the field.

  12. Towards optimal packed string matching

    DEFF Research Database (Denmark)

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

    2014-01-01

    -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-size...... string-matching instruction wssm is available in contemporary commodity processors. The other word-size maximum-suffix instruction wslm is only required during the pattern pre-processing. Benchmarks show that our solution can be efficiently implemented, unlike some prior theoretical packed string...... 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...

  13. Betting on Illusory Patterns: Probability Matching in Habitual Gamblers.

    Science.gov (United States)

    Gaissmaier, Wolfgang; Wilke, Andreas; Scheibehenne, Benjamin; McCanney, Paige; Barrett, H Clark

    2016-03-01

    Why do people gamble? A large body of research suggests that cognitive distortions play an important role in pathological gambling. Many of these distortions are specific cases of a more general misperception of randomness, specifically of an illusory perception of patterns in random sequences. In this article, we provide further evidence for the assumption that gamblers are particularly prone to perceiving illusory patterns. In particular, we compared habitual gamblers to a matched sample of community members with regard to how much they exhibit the choice anomaly 'probability matching'. Probability matching describes the tendency to match response proportions to outcome probabilities when predicting binary outcomes. It leads to a lower expected accuracy than the maximizing strategy of predicting the most likely event on each trial. Previous research has shown that an illusory perception of patterns in random sequences fuels probability matching. So does impulsivity, which is also reported to be higher in gamblers. We therefore hypothesized that gamblers will exhibit more probability matching than non-gamblers, which was confirmed in a controlled laboratory experiment. Additionally, gamblers scored much lower than community members on the cognitive reflection task, which indicates higher impulsivity. This difference could account for the difference in probability matching between the samples. These results suggest that gamblers are more willing to bet impulsively on perceived illusory patterns. PMID:25921650

  14. Color memory matching: time effect and other factors

    OpenAIRE

    Pérez Carpinell, Jaime; Baldoví, Rosa; Fez Saiz, Dolores de; Castro, José

    1998-01-01

    The methods of simultaneous and successive, or memory, color matching have been compared for 10 color reference samples distributed in two groups each performed by 50 observers (25 men and 25 women). Our results, obtained with a total of 200 Munsell color chips arrayed on 10 gray cardboard panels, indicated that: a)while by simultaneous matching the mean color differences obtained are, in most cases, lower than 1 Cielab unit, those obtained by memory are generally higer; b) the worst remember...

  15. REVIEW OF PHASE BASED IMAGE MATCHING

    OpenAIRE

    Jaydeep Kale*

    2016-01-01

    This paper review the phase based image matching method. A major approach for image matching is to extract feature vectors corresponding to given images and perform image matching based on some distance metrics. One of the difficult problem with this feature based image matching is that matching performance depends upon many parameters in feature extraction process. So this paper reviews the phase based image matching methods in which 2D DFTs of given images are used to determine resemblance ...

  16. Monetary Exchange with Multilateral Matching

    DEFF Research Database (Denmark)

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

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

  17. Acceptable Ungrammaticality in Sentence Matching

    Science.gov (United States)

    Duffield, Nigel; Matsuo, Ayumi; Roberts, Leah

    2007-01-01

    This article presents a new set of experiments using the "sentence-matching paradigm" (Forster, 1979; Freedman and Forster, 1985; see also Bley-Vroman and Masterson, 1989), investigating native speakers' and second language (L2) learners' knowledge of constraints on clitic placement in French. Our purpose is three-fold: (1) to shed more light on…

  18. Hirschberg's Algorithm for Approximate Matching

    Directory of Open Access Journals (Sweden)

    Adam Drozdek

    2002-01-01

    Full Text Available The Hirschberg algorithm was devised to solve the longest common subsequence problem. The paper discusses the way of adopting the algorithm to solve the string matching problem in linear space to determine edit distance for two strings and their alignment.

  19. Topics in combinatorial pattern matching

    DEFF Research Database (Denmark)

    Vildhøj, Hjalte Wedel

    This dissertation studies problems in the general theme of combinatorial pattern matching. More specifically, we study the following topics: Longest Common Extensions. We revisit the longest common extension (LCE) problem, that is, preprocess a string T into a compact data structure that supports...

  20. Matching of equivalent field regions

    DEFF Research Database (Denmark)

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

    2005-01-01

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

  1. Data Partitioning for Parallel Entity Matching

    CERN Document Server

    Kirsten, Toralf; Hartung, Michael; Groß, Anika; Köpcke, Hanna; Rahm, Erhard

    2010-01-01

    Entity matching is an important and difficult step for integrating web data. To reduce the typically high execution time for matching we investigate how we can perform entity matching in parallel on a distributed infrastructure. We propose different strategies to partition the input data and generate multiple match tasks that can be independently executed. One of our strategies supports both, blocking to reduce the search space for matching and parallel matching to improve efficiency. Special attention is given to the number and size of data partitions as they impact the overall communication overhead and memory requirements of individual match tasks. We have developed a service-based distributed infrastructure for the parallel execution of match workflows. We evaluate our approach in detail for different match strategies for matching real-world product data of different web shops. We also consider caching of in-put entities and affinity-based scheduling of match tasks.

  2. Atomic matching across internal interfaces

    International Nuclear Information System (INIS)

    The atomic structure of internal interfaces in dense-packed systems has been investigated by high-resolution electron microscopy (HREM). Similarities between the atomic relaxations in heterophase interfaces and certain large-angle grain boundaries have been observed. In both types of interfaces localization of misfit leads to regions of good atomic matching within the interface separated by misfit dislocation-like defects. It appears that, whenever possible, the GB structures assume configurations in which the atomic coordination is not too much different from the ideal lattice. It is suggested that these kinds of relaxations primarily occur whenever the translational periods along the GB are large or when the interatomic distances are incommensurate. Incorporation of low index planes into the GB appears to lead to preferred, i.e. low energy structures, that can be quite dense with good atomic matching across a large fraction of the interface

  3. Observational Studies: Matching or Regression?

    Science.gov (United States)

    Brazauskas, Ruta; Logan, Brent R

    2016-03-01

    In observational studies with an aim of assessing treatment effect or comparing groups of patients, several approaches could be used. Often, baseline characteristics of patients may be imbalanced between groups, and adjustments are needed to account for this. It can be accomplished either via appropriate regression modeling or, alternatively, by conducting a matched pairs study. The latter is often chosen because it makes groups appear to be comparable. In this article we considered these 2 options in terms of their ability to detect a treatment effect in time-to-event studies. Our investigation shows that a Cox regression model applied to the entire cohort is often a more powerful tool in detecting treatment effect as compared with a matched study. Real data from a hematopoietic cell transplantation study is used as an example. PMID:26712591

  4. Acceptable ungrammaticality in sentence matching

    OpenAIRE

    Duffield, Nigel; Matsuo, Ayumi; Roberts, Leah

    2007-01-01

    Abstract This article presents a new set of experiments using the sentence-matching paradigm (Forster, 1979; Freedman and Forster, 1985; see also Bley-Vroman and Masterson, 1989), investigating native speakers' and second language (L2) learners' knowledge of constraints on clitic placement in French. Our purpose is three-fold: ? to shed more light on the contrasts between native speakers and L2 learners observed in previous experiments, especially Duffield and White (199...

  5. Phase matching in quantum searching

    OpenAIRE

    Long, Gui Lu; Li, Yan Song; Zhang, Wei Lin; Niu, Li

    1999-01-01

    Each iteration in Grover's original quantum search algorithm contains 4 steps: two Hadamard-Walsh transformations and two amplitudes inversions. When the inversion of the marked state is replaced by arbitrary phase rotation \\theta and the inversion for the prepared state |\\gamma> is replaced by rotation through \\phi, we found that these phase rotations must satisfy a matching condition \\theta=\\phi. Approximate formula for the amplitude of the marked state after an arbitrary number of iteratio...

  6. Identification of meat products by shotgun spectral matching

    DEFF Research Database (Denmark)

    Ohana, D.; Dalebout, H.; Marissen, R. J.;

    2016-01-01

    A new method, based on shotgun spectral matching of peptide tandem mass spectra, was successfully applied to the identification of different food species. The method was demonstrated to work on raw as well as processed samples from 16 mammalian and 10 bird species by counting spectral matches to...... spectral libraries in a reference database with one spectral library per species. A phylogenetic tree could also be constructed directly from the spectra. Nearly all samples could be correctly identified at the species level, and 100% at the genus level. The method does not use any genomic information and...

  7. Transition I efficiency and victory in volleyball matches

    Directory of Open Access Journals (Sweden)

    Herbert Ugrinowitsch

    2014-03-01

    Full Text Available The present study investigated the correlation between Transition Iwith victory in volleyball matches. The 2002 South-American Youth Men's Championship was recorded and the Transition I was analyzed and classified as negative, null or positive. Results of the efficiency in Transition I was calculated using t test for independent samples and compared to the efficiency between teams during each set and matches. Spearman correlation assessed the relationship between efficiency in each set and results of the matches with the final ranking in the championship. The results showed that the winning teams exhibited higher efficiency in Transition I, as well as a positive relationship of higher efficiency in Transition I with all of their results. The higher efficiency in Transition I is related to victory in volleyball matches.

  8. Matched Formulas and Backdoor Sets

    Directory of Open Access Journals (Sweden)

    Stefan Szeider

    2008-09-01

    Full Text Available We demonstrate hardness results for the detection of small backdoor sets with respect to base classes Mr of CNF formulas with maximum deficiency ≤ r (M0 is the class of matched formulas. One of the results applies also to a wide range of base classes with added ‘empty clause detection’ as recently considered by Dilkina, Gomes, and Sabharwal. We obtain the hardness results in the framework of parameterized complexity, considering the upper bound on the size of smallest backdoor sets as the parameter. Furthermore we compare the generality of the parameters maximum deficiency and the size of a smallest Mr-backdoor set.

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

  10. 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 ...... where agents take different attitudes when reasoning about the actions of others. In particular, we study optimistic, neutral and pessimistic attitudes and provide both computational hardness results and polynomial-time algorithms for computing stable outcomes....

  11. Probe Vehicle Track-Matching Algorithm Based on Spatial Semantic Features

    Science.gov (United States)

    Luo, Y.; Song, X.; Zheng, L.; Yang, C.; Yu, M.; Sun, M.

    2015-07-01

    The matching of GPS received locations to roads is challenging. Traditional matching method is based on the position of the GPS receiver, the vehicle position and vehicle behavior near the receiving time. However, for probe vehicle trajectories, the sampling interval is too sparse and there is a poor correlation between adjacent sampling points, so it cannot partition the GPS noise through the historical positions. For the data mining of probe vehicle tracks based on spatial semantics, the matching is learned from the traditional electronic navigation map matching, and it is proposed that the probe vehicle track matching algorithm is based on spatial semantic features. Experimental results show that the proposed global-path matching method gets a good matching results, and restores the true path through the probe vehicle track.

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

  13. Pattern Matching under Polynomial Transformation

    CERN Document Server

    Butman, Ayelet; Clifford, Raphael; Jalsenius, Markus; Lewenstein, Noa; Porat, Benny; Porat, Ely; Sach, Benjamin

    2011-01-01

    We consider a class of pattern matching problems where a polynomial transformation can be applied to the pattern at every alignment. Given a pattern of length m and a longer text of length n where both are assumed to contain integer values only, we show O(n log m) algorithms for pattern matching under linear transformations even when wildcard symbols can occur in the input. We then show how to extend the technique to polynomial transformations of arbitrary degree. Next we consider the problem of finding the minimum Hamming distance under polynomial transformation. We show that, for any epsilon > 0, there cannot exist an O(nm^(1-epsilon)) algorithm for additive and linear transformations conditional on the hardness of the classic 3SUM problem. Finally, we consider a version of the Hamming distance problem under additive transformations with a bound k on the maximum distance that need be reported. We give a deterministic O(nk log k) time solution which we then improve by careful use of randomisation to O(n sqrt...

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

  15. Multi Data Reservoir History Matching using the Ensemble Kalman Filter

    KAUST Repository

    Katterbauer, Klemens

    2015-05-01

    Reservoir history matching is becoming increasingly important with the growing demand for higher quality formation characterization and forecasting and the increased complexity and expenses for modern hydrocarbon exploration projects. History matching has long been dominated by adjusting reservoir parameters based solely on well data whose spatial sparse sampling has been a challenge for characterizing the flow properties in areas away from the wells. Geophysical data are widely collected nowadays for reservoir monitoring purposes, but has not yet been fully integrated into history matching and forecasting fluid flow. In this thesis, I present a pioneering approach towards incorporating different time-lapse geophysical data together for enhancing reservoir history matching and uncertainty quantification. The thesis provides several approaches to efficiently integrate multiple geophysical data, analyze the sensitivity of the history matches to observation noise, and examine the framework’s performance in several settings, such as the Norne field in Norway. The results demonstrate the significant improvements in reservoir forecasting and characterization and the synergy effects encountered between the different geophysical data. In particular, the joint use of electromagnetic and seismic data improves the accuracy of forecasting fluid properties, and the usage of electromagnetic data has led to considerably better estimates of hydrocarbon fluid components. For volatile oil and gas reservoirs the joint integration of gravimetric and InSAR data has shown to be beneficial in detecting the influx of water and thereby improving the recovery rate. Summarizing, this thesis makes an important contribution towards integrated reservoir management and multiphysics integration for reservoir history matching.

  16. Rule-based Construction of Matching Processes

    CERN Document Server

    Peukert, Eric; Rahm, Erhard

    2011-01-01

    Mapping complex metadata structures is crucial in a number of domains such as data integration, ontology alignment or model management. To speed up that process automatic matching systems were developed to compute mapping suggestions that can be corrected by a user. However, constructing and tuning match strategies still requires a high manual effort by matching experts as well as correct mappings to evaluate generated mappings. We therefore propose a self-configuring schema matching system that is able to automatically adapt to the given mapping problem at hand. Our approach is based on analyzing the input schemas as well as intermediate matching results. A variety of matching rules use the analysis results to automatically construct and adapt an underlying matching process for a given match task. We comprehensively evaluate our approach on different mapping problems from the schema, ontology and model management domains. The evaluation shows that our system is able to robustly return good quality mappings a...

  17. Genetic Programming Framework for Fingerprint Matching

    OpenAIRE

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

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

  19. Decomposition Techniques for Subgraph Matching

    CERN Document Server

    Zampelli, Stephane; Deville, Yves; Backofen, Rolf

    2008-01-01

    In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For such problems, we propose a hybrid approach of these techniques in the presence of global constraints. In particular, we solve the subgraph isomorphism problem. Further we design specific heuristics for this hard problem, exploiting its special structure to achieve decomposition. The underlying idea is to precompute a static heuristic on a subset of its constraint network, to follow this static ordering until a first problem decomposition is available, and to switch afterwards to a fully propagated, dynamically decomposing search. Experimental results show that, for sparse graphs, our decomposition method solves more instances than dedicated, state-of-the-art matching algorithms or standard constraint programming approaches.

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

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

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

  3. A pseudo-matched filter for chaos

    OpenAIRE

    Cohen, Seth D.; Gauthier, Daniel J

    2012-01-01

    A matched filter maximizes the signal-to-noise ratio of a signal. In the recent work of Corron et al. [Chaos 20, 023123 (2010)], a matched filter is derived for the chaotic waveforms produced by a piecewise-linear system. Motivated by these results, we describe a pseudo-matched filter, which removes noise from the same chaotic signal. It consists of a notch filter followed by a first-order, low-pass filter. We compare quantitatively the matched filter's performance to that of our pseudo-match...

  4. Matching Parasitic Antenna for Single RF MIMO

    DEFF Research Database (Denmark)

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

    2012-01-01

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

  5. Semi-Global Matching in Object Space

    Science.gov (United States)

    Bethmann, F.; Luhmann, T.

    2015-03-01

    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.

  6. On the dynamic control of matching queues

    Directory of Open Access Journals (Sweden)

    Itai Gurvich

    2015-03-01

    Full Text Available We consider the optimal control of matching queues with random arrivals. In this model, items arrive to dedicated queues, and wait to be matched with items from other (possibly multiple queues. A match type corresponds to the set of item classes required for a match. Once a decision has been made to perform a match, the matching itself is instantaneous and the matched items depart from the system. We consider the problem of minimizing finite-horizon cumulative holding costs. The controller must decide which matchings to execute given multiple options. In principle, the controller may choose to wait until some “inventory” of items builds up to facilitate more profitable matches in the future. We introduce a multi-dimensional imbalance process, that at each time t, is given by a linear function of the cumulative arrivals to each of the item classes. A non-zero value of the imbalance at time t means that no control could have matched all the items that arrived by time t. A lower bound based on the imbalance process can be specified, at each time point, by a solution to an optimization problem with linear constraints.While not achievable in general, this lower bound can be asymptotically approached under a dedicated item condition (an analogue of the local traffic condition in bandwidth sharing networks. We devise a myopic discrete-review matching control that asymptotically–as the arrival rates become large–achieves the imbalance-based lower bound.

  7. A Survey of String Matching Algorithms

    Directory of Open Access Journals (Sweden)

    Koloud Al-Khamaiseh

    2014-07-01

    Full Text Available The concept of string matching algorithms are playing an important role of string algorithms in finding a place where one or several strings (patterns are found in a large body of text (e.g., data streaming, a sentence, a paragraph, a book, etc.. Its application covers a wide range, including intrusion detection Systems (IDS in computer networks, applications in bioinformatics, detecting plagiarism, information security, pattern recognition, document matching and text mining. In this paper we present a short survey for well-known and recent updated and hybrid string matching algorithms. These algorithms can be divided into two major categories, known as exact string matching and approximate string matching. The string matching classification criteria was selected to highlight important features of matching strategies, in order to identify challenges and vulnerabilities.

  8. A central-limit theorem for a single-false match rate

    Science.gov (United States)

    Dietz, Zachariah; Schuckers, Michael E.

    2010-04-01

    In this paper, we present a central limit theorem (CLT) for the estimation of a false match rate for a single matching system. The false match rate is often a significant factor in an evaluation of such a matching system. To achieve the main result here we utilize the covariance/correlation structure for matching proposed by Schuckers. Along with the main result we present an illustration of the methodology here on biometric authentication data from Ross and Jain. This illustration is from resampling match decisions on three different biometric modalities: hand geometry, fingerprint and facial recognition and shows that as the number of matching pairs grows the sampling distribution for an FMR approaches a Gaussian distribution. These results suggest that statistical inference for a FMR based upon a Gaussian distribution is appropriate.

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

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

  11. Athermalization in atomic force microscope based force spectroscopy using matched microstructure coupling

    OpenAIRE

    Torun, H.; Finkler, O.; Degertekin, F. L.

    2009-01-01

    The authors describe a method for athermalization in atomic force microscope (AFM) based force spectroscopy applications using microstructures that thermomechanically match the AFM probes. The method uses a setup where the AFM probe is coupled with the matched structure and the displacements of both structures are read out simultaneously. The matched structure displaces with the AFM probe as temperature changes, thus the force applied to the sample can be kept constant without the need for a ...

  12. Earnings Functions, Specific Human Capital, and Job Matching: Tenure Bias Is Negative

    OpenAIRE

    Margaret Stevens

    2003-01-01

    This article investigates the hypothesis that when measures of specific human capital (such as job tenure) are included in earnings functions, there may be a sample selection bias because of job-matching effectsbecause workers with high unobserved match quality receive and accept high wage offers. We develop a model for wage offers in a labor market characterized by both specific human capital and job matching. The model provides a theoretical basis for empirical earnings functions containing...

  13. Matching Methods for Causal Inference: A Review and a Look Forward

    OpenAIRE

    Stuart, Elizabeth A.

    2010-01-01

    When estimating causal effects using observational data, it is desirable to replicate a randomized experiment as closely as possible by obtaining treated and control groups with similar covariate distributions. This goal can often be achieved by choosing well-matched samples of the original treated and control groups, thereby reducing bias due to the covariates. Since the 1970s, work on matching methods has examined how to best choose treated and control subjects for comparison. Matching meth...

  14. Identifying suspects by matching hand photographs with video evidence.

    Science.gov (United States)

    Busch, Johannes; Lynnerup, Niels

    2015-12-01

    Reports by minors of sexual relations against their will are not rare, and in some cases pornographic photography is a part of the abuse. Such material can be used to help identify the perpetrator. In this study we examined the efficacy of visual comparison between two databases. One consisted of blinded still images of the back of the right hand of 51 males from video recordings, the other of blinded high quality camera images of the back of the right hand from the same 51 individuals. The images were compared in pairs (2601 combinations) and a judgment was made about whether they were a highly likely, possible or unlikely match, using several anatomical features as markers for comparison. Using this method all 51 high quality images were correctly matched with the video image from the same person, though in some cases there was up to 5 other samples that could not be excluded as possible matches. In total there were no false positive "highly possible" matches, but there were 50 false positive "possible" matches. Visual comparison of the back of the hand is a valuable addition to the burden of evidence in a judicial setting, but should not be used as a standalone method to establish proof of identity. The applicability of the method is dependent on the existence of a database of images; the degree of certainty of the identification is directly correlated to the size of the database. PMID:26499953

  15. Visualizing underwater acoustic matched-field processing

    Science.gov (United States)

    Rosenblum, Lawrence; Kamgar-Parsi, Behzad; Karahalios, Margarida; Heitmeyer, Richard

    1991-06-01

    Matched-field processing is a new technique for processing ocean acoustic data measured by an array of hydrophones. It produces estimates of the location of sources of acoustic energy. This method differs from source localization techniques in other disciplines in that it uses the complex underwater acoustic environment to improve the accuracy of the source localization. An unexplored problem in matched-field processing has been to separate multiple sources within a matched-field ambiguity function. Underwater acoustic processing is one of many disciplines where a synthesis of computer graphics and image processing is producing new insight. The benefits of different volume visualization algorithms for matched-field display are discussed. The authors show how this led to a template matching scheme for identifying a source within the matched-field ambiguity function that can help move toward an automated source localization process.

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

  17. Graph matching and clustering using kernel attributes

    OpenAIRE

    Lozano Ortega, Miguel Ángel; Escolano Ruiz, Francisco

    2013-01-01

    In this paper, we exploit graph kernels for graph matching and clustering. Firstly, we analyze different kinds of graph kernels in order to extract from them attributes to be used as a similarity measure between nodes of non-attributed graphs. Next, such attributes are embedded in a graph-matching cost function, through a probabilistic framework, and we evaluate their performance within a graph-matching algorithm. Secondly, we propose a method for obtaining a representative prototype from a s...

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

  19. Minimizing Human Effort in Reconciling Match Networks

    OpenAIRE

    Nguyen, Quoc Viet Hung; Wijaya, Tri Kurniawan; Miklos, Zoltan; Aberer, Karl; Levy, Eliezer; Shafran, Victor; Gal, Avigdor; Weidlich, Matthias

    2013-01-01

    Schema and ontology matching is a process of establishing correspondences between schema attributes and ontology concepts, for the purpose of data integration. Various commercial and academic tools have been developed to support this task. These tools provide impressive results on some datasets. However, as the matching is inherently uncertain, the developed heuristic techniques give rise to results that are not completely correct. In practice, post-matching human expert effort is needed to o...

  20. Fingerprint matching algorithm for poor quality images

    OpenAIRE

    Vedpal Singh; Irraivan Elamvazuthi

    2015-01-01

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

  1. TWO STAGE FRAMEWORK FOR ALTERED FINGERPRINT MATCHING

    OpenAIRE

    T. R. Anoop; M.G. Mini

    2015-01-01

    Fingerprint alteration is the process of masking one’s identity from personal identification systems especially in boarder control security systems. Failure of matching the altered fingerprint of the criminals against the watch list of fingerprints can help them to break the security system. This fact leads to the need of a method for altered fingerprint matching. This paper presents a two stage method for altered fingerprint matching. In first stage, approximated global ridge orientation fie...

  2. 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 to ...... improve the space and/or remove a dependency on the alphabet size for each problem using either an improved tabulation technique of an existing algorithm or by combining known algorithms in a new way....

  3. Lazy AC-Pattern Matching for Rewriting

    CERN Document Server

    Belkhir, Walid; 10.4204/EPTCS.82.3

    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.

  4. Fingerprint matching system using Level 3 features

    OpenAIRE

    Prince; Manvjeet Kaur,; Ajay Mittal

    2010-01-01

    Fingerprint biometric security system identifies the unique property in human being and matching with template stored in database. Fingerprint details are generally defined in three levels i.e. Level 1 (Pattern), Level 2(Minutiae points) and Level 3 (pores and contour ridges). Level 3 features are barely used by automated fingerprintverification system. This research paper presents a Level 3 ingerprint matching system. In this paper, we deal with pores for matching with template. With the lo...

  5. Automated concept matching between laboratory databases.

    OpenAIRE

    Sun, Yao

    2002-01-01

    To address the problem of semantic inconsistencies between medical databases, semantic network representations can be utilized to automate the matching of medical concepts between the databases. The performance of automated concept matching was tested by creating semantic network representations for two laboratory databases, one from a pediatric hospital and the other from an oncology institute. The matching algorithms identified all equivalent concepts that were present in both databases, an...

  6. Caffeine supplementation does not affect match activities and fatigue resistance during match play in young football players

    DEFF Research Database (Denmark)

    Pettersen, Svein Arne; Krustrup, Peter; Bendiksen, Mads;

    2014-01-01

    The study examined the effect of caffeine supplementation on match activities and development of fatigue during a football match. In a randomised, double-blind cross-over design, two experimental football games separated by 7 days were organised between the junior teams of two professional football...... clubs (17.6 ± 1.1 years (±s), 71.7 ± 6.9 kg, 13.9% ± 5.0% body fat). The players ingested either a capsule of 6 mg · kg−1 b.w. caffeine or placebo (dextrose) 65 min prior to the matches. Match activities were assessed using the ZXY match analysis system, and a Yo-Yo intermittent recovery test–level 2...... (Yo-Yo IR2) was conducted immediately post-game. Heart rate was monitored throughout the game, and blood samples were obtained at baseline, half-time and after the game. There were no differences between caffeine and placebo regarding total distance covered (10,062 ± 916 vs 9854 ± 901 m), high...

  7. Patient Matched Instruments and Total Knee System

    Medline Plus

    Full Text Available Smith & Nephew Technologies: VISIONAIRE™ Patient Matched Instruments and LEGION™ Total Knee System You must have Javascript enabled in your web browser. View Program Transcript Click ...

  8. The Match between CEO and Firm

    OpenAIRE

    Sam Allgood

    2003-01-01

    We investigate the role of job-match heterogeneity in the CEO labor market. We document a high percentage of CEO turnovers in the early years of tenure as illustrated by the hazard that increases until the fifth year of CEO tenure and then decreases. Evidence suggests that a good match is more likely if the new CEO performs better than the previous CEO. The best matches tend to occur when inside (outside) CEOs follow previous CEOs who quit (are dismissed). Evidence consistent with match theor...

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

  10. Anomalous dispersion enhanced Cerenkov phase-matching

    Energy Technology Data Exchange (ETDEWEB)

    Kowalczyk, T.C.; Singer, K.D. [Case Western Reserve Univ., Cleveland, OH (United States). Dept. of Physics; Cahill, P.A. [Sandia National Labs., Albuquerque, NM (United States)

    1993-11-01

    The authors report on a scheme for phase-matching second harmonic generation in polymer waveguides based on the use of anomalous dispersion to optimize Cerenkov phase matching. They have used the theoretical results of Hashizume et al. and Onda and Ito to design an optimum structure for phase-matched conversion. They have found that the use of anomalous dispersion in the design results in a 100-fold enhancement in the calculated conversion efficiency. This technique also overcomes the limitation of anomalous dispersion phase-matching which results from absorption at the second harmonic. Experiments are in progress to demonstrate these results.

  11. A Novel Image Correlation Matching Approach

    Directory of Open Access Journals (Sweden)

    Baoming Shan

    2010-06-01

    Full Text Available In this paper we present a novel approach which is combined local invariant feature descriptor named ARPIH (Angular Radial Partitioning Intensity Histogram with histogram-based similar distance (HSD. The approach succeeds the ARPIH descriptor’s distinctive advantage and provides higher robustness in deformation image matching, such as rotation image, illumination changing image and perspective image, etc. Based on the MCD algorithm, we present the HSD algorithm. This algorithm transforms the image matching into the histogram matching by calculating the number of the similar points between template histogram and target histogram in order to decrease the calculation complicacy and improve the matching efficiency. A large amount groups of images are used in testing the approach presented in this paper. The matching results presented here indicate that the presented algorithm is efficient to figure out both the geometric deformation image matching and the illumination changing image matching. Contrast with the traditional matching algorithm, the approach presented in this paper has the obvious advantage of high matching precision, robustness and performance efficiency.

  12. RETIRED MATCHES AMONG MALE PROFESSIONAL TENNIS PLAYERS

    OpenAIRE

    Kristijan Breznik; Vladimir Batagelj

    2012-01-01

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

  13. Generality of the Matching Law as a Descriptor of Shot Selection in Basketball

    Science.gov (United States)

    Alferink, Larry A.; Critchfield, Thomas S.; Hitt, Jennifer L.; Higgins, William J.

    2009-01-01

    Based on a small sample of highly successful teams, past studies suggested that shot selection (two- vs. three-point field goals) in basketball corresponds to predictions of the generalized matching law. We examined the generality of this finding by evaluating shot selection of college (Study 1) and professional (Study 3) players. The matching law…

  14. A fast image matching algorithm based on key points

    Science.gov (United States)

    Wang, Huilin; Wang, Ying; An, Ru; Yan, Peng

    2014-05-01

    Image matching is a very important technique in image processing. It has been widely used for object recognition and tracking, image retrieval, three-dimensional vision, change detection, aircraft position estimation, and multi-image registration. Based on the requirements of matching algorithm for craft navigation, such as speed, accuracy and adaptability, a fast key point image matching method is investigated and developed. The main research tasks includes: (1) Developing an improved celerity key point detection approach using self-adapting threshold of Features from Accelerated Segment Test (FAST). A method of calculating self-adapting threshold was introduced for images with different contrast. Hessian matrix was adopted to eliminate insecure edge points in order to obtain key points with higher stability. This approach in detecting key points has characteristics of small amount of computation, high positioning accuracy and strong anti-noise ability; (2) PCA-SIFT is utilized to describe key point. 128 dimensional vector are formed based on the SIFT method for the key points extracted. A low dimensional feature space was established by eigenvectors of all the key points, and each eigenvector was projected onto the feature space to form a low dimensional eigenvector. These key points were re-described by dimension-reduced eigenvectors. After reducing the dimension by the PCA, the descriptor was reduced to 20 dimensions from the original 128. This method can reduce dimensions of searching approximately near neighbors thereby increasing overall speed; (3) Distance ratio between the nearest neighbour and second nearest neighbour searching is regarded as the measurement criterion for initial matching points from which the original point pairs matched are obtained. Based on the analysis of the common methods (e.g. RANSAC (random sample consensus) and Hough transform cluster) used for elimination false matching point pairs, a heuristic local geometric restriction

  15. Robust structural identification via polyhedral template matching

    Science.gov (United States)

    Mahler Larsen, Peter; Schmidt, Søren; Schiøtz, Jakob

    2016-06-01

    Successful scientific applications of large-scale molecular dynamics often rely on automated methods for identifying the local crystalline structure of condensed phases. Many existing methods for structural identification, such as common neighbour analysis, rely on interatomic distances (or thresholds thereof) to classify atomic structure. As a consequence they are sensitive to strain and thermal displacements, and preprocessing such as quenching or temporal averaging of the atomic positions is necessary to provide reliable identifications. We propose a new method, polyhedral template matching (PTM), which classifies structures according to the topology of the local atomic environment, without any ambiguity in the classification, and with greater reliability than e.g. common neighbour analysis in the presence of thermal fluctuations. We demonstrate that the method can reliably be used to identify structures even in simulations near the melting point, and that it can identify the most common ordered alloy structures as well. In addition, the method makes it easy to identify the local lattice orientation in polycrystalline samples, and to calculate the local strain tensor. An implementation is made available under a Free and Open Source Software license.

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

  17. Identification of meat products by shotgun spectral matching.

    Science.gov (United States)

    Ohana, D; Dalebout, H; Marissen, R J; Wulff, T; Bergquist, J; Deelder, A M; Palmblad, M

    2016-07-15

    A new method, based on shotgun spectral matching of peptide tandem mass spectra, was successfully applied to the identification of different food species. The method was demonstrated to work on raw as well as processed samples from 16 mammalian and 10 bird species by counting spectral matches to spectral libraries in a reference database with one spectral library per species. A phylogenetic tree could also be constructed directly from the spectra. Nearly all samples could be correctly identified at the species level, and 100% at the genus level. The method does not use any genomic information and unlike targeted methods, no prior knowledge of genetic variation within a genus or species is necessary. PMID:26948585

  18. Quantum rejection sampling

    CERN Document Server

    Ozols, Maris; Roland, Jérémie

    2011-01-01

    Rejection sampling is a well-known technique to sample from a target distribution, given the ability to sample from another distribution. The method has been first formalized by von Neumann (1951) and has many applications in classical computing. We define a quantum analogue of rejection sampling: given a black box producing a coherent superposition of quantum states with some amplitudes, the problem is to prepare a coherent superposition of the same states with different target amplitudes. The main result of this paper is a tight characterization of the query complexity of this quantum state generation problem. We exhibit an algorithm, which we call quantum rejection sampling, and analyze its cost using semidefinite programming. We prove a matching lower bound based on symmetrizing over the automorphism group of the problem and using a hybrid argument. Perhaps interestingly, the automorphism group turns out to be continuous in this case. Furthermore, we illustrate how quantum rejection sampling may be used a...

  19. Salivary Biomarker Responses to Two Final Matches in Women’s Professional Football

    OpenAIRE

    Javiera Maya, Pablo Marquez, Luis Peñailillo, Ariel Contreras-Ferrat, Louise Deldicque, Hermann Zbinden-Foncea

    2016-01-01

    The aim of this study was to examine the link between salivary concentrations of cortisol, testosterone, immunoglobulin A (IgA) and the rate of perceived exertion (RPE) as a measure of internal load after two final matches played 3 days apart by professional women football players. Saliva samples were taken before and after the two matches (M1, M2). RPE was used to monitor the exercise intensity after each match. Testosterone concentrations increased after each match (M1: +42%, p = 0.002; M2:...

  20. Online Activity Matching Using Wireless Sensor Nodes

    NARCIS (Netherlands)

    Horst, Arie; Meratnia, Nirvana

    2011-01-01

    In this paper, we explore the capability of wireless sensor networks to perform online activity matching for sport coaching applications. The goal is to design an algorithm to match movements of a trainee and a trainer online and to find their spatial and temporal differences. Such an algorithm can

  1. Quadratic phase matching in slot waveguides

    OpenAIRE

    Di Falco, Andrea; Conti, Claudio; Assanto, Gaetano

    2006-01-01

    We analyze phase matching with reference to frequency doubling in nanosized quadratic waveguides encompassing form birefringence and supporting cross-polarized fundamental and second-harmonic modes. In an AlGaAs rod with an air void, we show that phase-matched second-harmonic generation could be achieved in a wide spectral range employing state-of-the-art nanotechnology.

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

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

  4. 13 CFR 102.40 - Computer matching.

    Science.gov (United States)

    2010-01-01

    ... 102.40 Business Credit and Assistance SMALL BUSINESS ADMINISTRATION RECORD DISCLOSURE AND PRIVACY 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...

  5. An Implementation of the Frequency Matching Method

    DEFF Research Database (Denmark)

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

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

  6. Semantic Data Matching: Principles and Performance

    Science.gov (United States)

    Deaton, Russell; Doan, Thao; Schweiger, Tom

    Automated and real-time management of customer relationships requires robust and intelligent data matching across widespread and diverse data sources. Simple string matching algorithms, such as dynamic programming, can handle typographical errors in the data, but are less able to match records that require contextual and experiential knowledge. Latent Semantic Indexing (LSI) (Berry et al. ; Deerwester et al. is a machine intelligence technique that can match data based upon higher order structure, and is able to handle difficult problems, such as words that have different meanings but the same spelling, are synonymous, or have multiple meanings. Essentially, the technique matches records based upon context, or mathematically quantifying when terms occur in the same record.

  7. A New Approach for Semantic Web Matching

    Science.gov (United States)

    Zamanifar, Kamran; Heidary, Golsa; Nematbakhsh, Naser; Mardukhi, Farhad

    In this work we propose a new approach for semantic web matching to improve the performance of Web Service replacement. Because in automatic systems we should ensure the self-healing, self-configuration, self-optimization and self-management, all services should be always available and if one of them crashes, it should be replaced with the most similar one. Candidate services are advertised in Universal Description, Discovery and Integration (UDDI) all in Web Ontology Language (OWL). By the help of bipartite graph, we did the matching between the crashed service and a Candidate one. Then we chose the best service, which had the maximum rate of matching. In fact we compare two services' functionalities and capabilities to see how much they match. We found that the best way for matching two web services, is comparing the functionalities of them.

  8. Fingerprint matching system using Level 3 features

    Directory of Open Access Journals (Sweden)

    Prince

    2010-06-01

    Full Text Available Fingerprint biometric security system identifies the unique property in human being and matching with template stored in database. Fingerprint details are generally defined in three levels i.e. Level 1 (Pattern, Level 2(Minutiae points and Level 3 (pores and contour ridges. Level 3 features are barely used by automated fingerprintverification system. This research paper presents a Level 3 ingerprint matching system. In this paper, we deal with pores for matching with template. With the local pore model, a SIFT algorithm is used to match the pores with template. Experiments on a good quality fingerprint dataset are performed and the results demonstrate that the proposed Level 3 features matching model performed more accurately and robustly.

  9. A LEXICAL DECISION TREE SCHEME FOR SUPPORTING SCHEMA MATCHING

    OpenAIRE

    BEEN-CHIAN CHIEN; SHIANG-YI HE

    2011-01-01

    To manipulate semantic web and integrate different data sources efficiently, automatic schema matching plays a key role. A generic schema matching method generally includes two phases: the linguistic similarity matching phase and the structural similarity matching phase. Since linguistic matching is an essential step for effective schema matching, developing a high accurate linguistic similarity matching scheme is required. In this paper, a schema matching approach called Similarity Yield Mat...

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

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

  12. Digital Computer Matching of Tooth Color

    Directory of Open Access Journals (Sweden)

    Won-suk Oh

    2010-06-01

    Full Text Available This study aimed to determine the validity of the digital photocolorimetric (PCM method in matching the color of human teeth. First, two Vitapan Classical shade guides, each containing 16 shade guide teeth, were visually shade matched, and digital photographs of each three pair of shade guide teeth were taken in a color matching booth. Secondly, visual shade matching of the upper central incisors of 48 subjects was performed by two prosthodontists independently in a chair, using the Vitapan Classical shade guide. The three closest shade guide teeth were visually selected and ranked in order of preference, for which digital photographs were taken under ceiling daylight-corrected fluorescent lighting. All digital images were analyzed on a computer screen using software to calculate the color difference between the reference tooth and other teeth in the same digital image. The percent color matching for the shade guide teeth and human teeth was 88% and 75%, respectively. There was no statistically significant difference in matching the tooth color between the shade guide teeth and human teeth. The digital PCM method is valid for the range of human teeth based on the Vitapan Classical shade guide. This method enhances communication with the laboratory personnel in matching the tooth color.

  13. Wavelet-based multicomponent matching pursuit trace interpolation

    Science.gov (United States)

    Choi, Jihun; Byun, Joongmoo; Seol, Soon Jee; Kim, Young

    2016-09-01

    Typically, seismic data are sparsely and irregularly sampled due to limitations in the survey environment and these cause problems for key seismic processing steps such as surface-related multiple elimination or wave-equation-based migration. Various interpolation techniques have been developed to alleviate the problems caused by sparse and irregular sampling. Among many interpolation techniques, matching pursuit interpolation is a robust tool to interpolate the regularly sampled data with large receiver separation such as crossline data in marine seismic acquisition when both pressure and particle velocity data are used. Multicomponent matching pursuit methods generally used the sinusoidal basis function, which have shown to be effective for interpolating multicomponent marine seismic data in the crossline direction. In this paper, we report the use of wavelet basis functions which further enhances the performance of matching pursuit methods for de-aliasing than sinusoidal basis functions. We also found that the range of the peak wavenumber of the wavelet is critical to the stability of the interpolation results and the de-aliasing performance and that the range should be determined based on Nyquist criteria. In addition, we reduced the computational cost by adopting the inner product of the wavelet and the input data to find the parameters of the wavelet basis function instead of using L-2 norm minimization. Using synthetic data, we illustrate that for aliased data, wavelet-based matching pursuit interpolation yields more stable results than sinusoidal function-based one when we use not only pressure data only but also both pressure and particle velocity together.

  14. 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 η......NL to demonstrate a significant soliton selffrequency shift of a fundamental soliton, and we show that nonlinear matching can take precedence over linear mode matching. The nonlinear coupling coefficient depends on both the dispersion (β2) and nonlinearity (γ), as well as on the power coupling...

  15. One-Dimensional Vector Based Pattern Matching

    Directory of Open Access Journals (Sweden)

    Y.M.Fouda

    2014-08-01

    Full Text Available Template matching is a basic method in image analysis to extract useful information from images. In this paper, we suggest a new method for pattern matching. Our method transform the template image from two dimensional image into one dimensional vector. Also all sub - windows (same size of template in the reference image will transform into one dimensional vectors. The three similarity measures SAD, SSD, and Euclidean are used to c ompute the likeness between template and all sub - windows in the reference image to find the best match. The experimental results show the superior performance of the proposed metho d over the conventional methods on various template of different sizes

  16. Maximum-expectation matching under recourse

    OpenAIRE

    Pedroso, João Pedro; Ikeda, Shiro

    2016-01-01

    This paper addresses the problem of maximizing the expected size of a matching in the case of unreliable vertices and/or edges. The assumption is that upon failure, remaining vertices that have not been matched may be subject to a new assignment. This process may be repeated a given number of times, and the objective is to end with the overall maximum number of matched vertices. The origin of this problem is in kidney exchange programs, going on in several countries, where a vertex is an inco...

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

  18. Modelling relationships between match events and match outcome in elite football.

    Science.gov (United States)

    Liu, Hongyou; Hopkins, Will G; Gómez, Miguel-Angel

    2016-08-01

    Identifying match events that are related to match outcome is an important task in football match analysis. Here we have used generalised mixed linear modelling to determine relationships of 16 football match events and 1 contextual variable (game location: home/away) with the match outcome. Statistics of 320 close matches (goal difference ≤ 2) of season 2012-2013 in the Spanish First Division Professional Football League were analysed. Relationships were evaluated with magnitude-based inferences and were expressed as extra matches won or lost per 10 close matches for an increase of two within-team or between-team standard deviations (SD) of the match event (representing effects of changes in team values from match to match and of differences between average team values, respectively). There was a moderate positive within-team effect from shots on target (3.4 extra wins per 10 matches; 99% confidence limits ±1.0), and a small positive within-team effect from total shots (1.7 extra wins; ±1.0). Effects of most other match events were related to ball possession, which had a small negative within-team effect (1.2 extra losses; ±1.0) but a small positive between-team effect (1.7 extra wins; ±1.4). Game location showed a small positive within-team effect (1.9 extra wins; ±0.9). In analyses of nine combinations of team and opposition end-of-season rank (classified as high, medium, low), almost all between-team effects were unclear, while within-team effects varied depending on the strength of team and opposition. Some of these findings will be useful to coaches and performance analysts when planning training sessions and match tactics. PMID:26190577

  19. Patient Matched Instruments and Total Knee System

    Medline Plus

    Full Text Available Smith & Nephew Technologies: VISIONAIRE™ Patient Matched Instruments and LEGION™ Total Knee System You must have Javascript enabled in your web browser. View Program Transcript Click Here to view the OR-Live, Inc. Privacy Policy and Legal ...

  20. Total Knee System with Patient Matched Instrumentation

    Medline Plus

    Full Text Available LEGION™ Total Knee System with VISIONAIRE™ Patient Matched Instrumentation You must have Javascript enabled in your web browser. View Program Transcript Click Here to view the OR-Live, Inc. ...

  1. Breast Cancer: Match of Her Life

    Science.gov (United States)

    ... of this page please turn Javascript on. Feature: Breast Cancer The Match of Her Life Past Issues / Spring - ... Martina Navratilova stays strong in her battle against breast cancer and her work to help Americans live healthier, ...

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

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

  4. Efficient Fingerprint Matching Based Upon Minutiae Extraction

    Directory of Open Access Journals (Sweden)

    Chiranjeeb Roy Chowdhury

    2015-12-01

    Full Text Available Fingerprints are one of the oldest and most widely used biometric security measures. Rapid advances in Computer Science and digital Image Processing have made it possible to design various Automatic Fingerprint Identification Systems (AFIS which can compare certain features of an input fingerprint image with a series of template images stored in a database and find a match. This paper deals with the extraction of certain specific features from a fingerprint, called minutiae. Since low quality images tend to generate multiple false minutiae, a method has been included to detect and remove such false minutiae. Fingerprint matching is performed by matching the number and type of the minutiae. The false minutiae removal process helps to reduce the computational complexity and improve the accuracy of the match.

  5. Matching Conditions on Capillary Ripples Polarization

    CERN Document Server

    Rodríguez, A H; Rodríguez-Coppola, H; Rodriguez, Arezky H.

    2000-01-01

    The matching conditions at the interface between two non-mixed fluids at rest are obtained directly using the equation of movement of the whole media. This is a non-usual point of view in hydrodynamics courses and our aim is to fix ideas about the intrinsic information contained in the matching conditions, on fluids in this case. Afterward, it is analyzed the polarization of the normal modes at the interface and it is shown that this information can be achieved through a physical analysis and reinforced later by the matching conditions. A detailed analysis of the matching conditions is given to understand the role that plays the continuity of the stress tensor through the interface on the physics of the surface particle movement. The main importance of the viscosity of each medium is deduced.

  6. Study of matching between HIRFL and CSR

    International Nuclear Information System (INIS)

    'HIRFL-CSR Cooler Storage Ring' makes use of existing HIRFL as its pre-accelerator. In order to take the full capability of HIRFL, the authors have studied in detailed the matching modes between HIRFL and CSR. It is proposed to use two matching modes; direct matching between SFC (HIRFL injector cyclotron) and CSRm (CSR main ring); three-cascade matching of SFC, SSC (HIRFL main cyclotron) and CSRm. With these combinations, better beam transmission efficiency, better beam utilization efficiency of HIRFL-CSR accelerator complex and better operation efficiency of HIRFL can be obtained. In the first case, SSC can be used simultaneously in other purposes, either to accelerate medium energy heavy ions or to accelerate protons combined with another small cyclotron

  7. Parallel String Matching Algorithm Using Grid

    Directory of Open Access Journals (Sweden)

    K.M.M Rajashekharaiah

    2012-06-01

    Full Text Available Grid computing provides solutions for various complex problems. Implementing computing intensive applications such as string matching problem on grid is inevitable. In this paper we present a new method for exact string matching based on grid computing. The function of the grid is to parallelize the string matching problem using grid MPI parallel programming method or loosely coupled parallel services on Grid. There can be dedicated grid, other way it can be resource sharing among the existingnetwork of computing resources, we propose dedicated grid. Parallel applications fall under three categories namely Perfect parallelism, Data parallelism and Functional parallelism, we use data parallelism, and it is also called Single Program Multiple Data (SPMD method, where given data is divided into several parts and working on the part simultaneously. This improves the executing time ofthe string matching algorithms on grid. The simulation results show significant improvement in executing time and speed up.

  8. Personalized Medicine: Matching Treatments to Your Genes

    Science.gov (United States)

    ... disclaimer . Subscribe Personalized Medicine Matching Treatments to Your Genes You’re one of a kind. It’s not ... personalized medicine begins with the unique set of genes you inherited from your parents. Genes are stretches ...

  9. A Survey of String Matching Algorithms

    OpenAIRE

    Koloud Al-Khamaiseh; Shadi ALShagarin

    2014-01-01

    The concept of string matching algorithms are playing an important role of string algorithms in finding a place where one or several strings (patterns) are found in a large body of text (e.g., data streaming, a sentence, a paragraph, a book, etc.). Its application covers a wide range, including intrusion detection Systems (IDS) in computer networks, applications in bioinformatics, detecting plagiarism, information security, pattern recognition, document matching and text minin...

  10. Towards the perfect prediction of soccer matches

    OpenAIRE

    Heuer, Andreas; Rubner, Oliver

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

  11. Nearest Neighbour Corner Points Matching Detection Algorithm

    OpenAIRE

    Zhang Changlong; Wang Miaomiao; Li Yong; Yang Xuesong

    2015-01-01

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

  12. Stratified SIFT Matching for Human Iris Recognition

    OpenAIRE

    Bakshi, Sambit; Mehrotra, Hunny; Majhi, Banshidhar

    2013-01-01

    This paper proposes an efficient three fold stratified SIFT matching for iris recognition. The objective is to filter wrongly paired conventional SIFT matches. In Strata I, the keypoints from gallery and probe iris images are paired using traditional SIFT approach. Due to high image similarity at different regions of iris there may be some impairments. These are detected and filtered by finding gradient of paired keypoints in Strata II. Further, the scaling factor of paired keypoints is used ...

  13. Fast multi-modality image matching

    OpenAIRE

    Apicella, Anthony; Kippenhan, Jonathan Shane; Nagel, Joachim H.

    1989-01-01

    Automated image matching has important applications, not only in the fields of machine vision and general pattern recognition, but also in modern diagnostic and therapeutic medical imaging. Image matching, including the recognition of objects within images as well as the combination of images that represent the same object or process using different descriptive parameters, is particularly important when complementary physiological and anatomical images, obtained with different imaging modalit...

  14. Attosecond pulse shaping using partial phase matching

    OpenAIRE

    Austin, Dane R.; Biegert, Jens

    2014-01-01

    We propose a method for programmable shaping of the amplitude and phase of the XUV and x-ray attosecond pulses produced by high-order harmonic generation. It overcomes the bandwidth limitations of existing spectral filters and enables removal of the intrinsic attosecond chirp as well as the synthesis of pulse sequences. It is based on partial phase matching, such as quasi-phase matching, using a longitudinally addressable modulation.

  15. Intersubband-transition-induced phase matching

    OpenAIRE

    Almogy, Gilad; Segev, Mordechai; Yariv, Amnon

    1994-01-01

    We suggest the use of the refractive-index changes associated with the intersubband transitions in quantum wells for phase matching in nonlinear materials. An improvement in the conversion efficiency of mid-IR second-harmonic generation by almost 2 orders of magnitude over non-phase-matched bulk GaAs is predicted. We also show that the linear phase contributions of intersubband transitions used for resonant enhancement of second-harmonic generation must be considered, as they could limit the ...

  16. Slack Matching Quasi Delay-Insensitive Circuits

    OpenAIRE

    Prakash, Piyush; Martin, Alain J.

    2006-01-01

    Slack matching is an optimization that determines the amount of buffering that must be added to each channel of a slack elastic asynchronous system in order to reduce its cycle time to a specified target. We present two methods of expressing the slack matching problem as a mixed integer linear programming problem. The first method is applicable to systems composed of either full-buffers or half-buffers but not both. The second method is applicable to systems composed of a...

  17. Improved Stereo Matching With Boosting Method

    OpenAIRE

    Shiny B; Dr. Deepa J.

    2015-01-01

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

  18. Fingerprint Recognition Using Minutia Score Matching

    OpenAIRE

    Ravi. J; K B Raja; Venugopal K R2

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

  19. Rebate subsidies, matching subsidies and isolation effects

    Directory of Open Access Journals (Sweden)

    Douglas D. Davis

    2006-07-01

    Full Text Available In a series of recent experiments (Davis, Millner and Reilly, 2005, Eckel and Grossman, 2003, 2005a-c, 2006, matching subsidies generate significantly higher charity receipts than do theoretically equivalent rebate subsidies. This paper reports a laboratory experiment conducted to examine whether the higher receipts are attributable to a relative preference for matching subsidies or to an ``isolation effect'' (McCaffery and Baron, 2003, 2006. Some potential policy implications of isolation effects on charitable contributions are also

  20. Searching, Matching and Education: a Note

    OpenAIRE

    Silva, João C. Cerejeira da

    2005-01-01

    In this paper the individual optimal level of education is set in a frictional labor market, where matching is not perfect. Also search frictions are a function of the average education of the labor force. Therefore, an increase in the average education can improve economic efficiency, not only through improvements in workers productivity, but also making the matching process more e¢ cient, and thus reducing the unemployment level.

  1. Matching in an Undisturbed Natural Human Environment

    OpenAIRE

    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 analytic techniques. Equations of the classic and modern theories of matching were fitted as ensembles to rates and time allocations of the boys' rule-b...

  2. Semantic Matching of Web Services Capabilities

    OpenAIRE

    Paolucci, Massimo; Kawamura, Takahiro; Payne, Terry R.; Sycara, Katia

    2002-01-01

    The Web is moving from being a collection of pages toward a collection of services that interoperate through the Internet. The first step towards this interoperation is the location of other services that can help towards the solution of a problem. In this paper we claim that location of web services should be based on the semantic match between a declaritive description of the service being sought, and a description of the service being offered. Furthermore, we claim that this match is outsi...

  3. A Mars Sample Return Sample Handling System

    Science.gov (United States)

    Wilson, David; Stroker, Carol

    2013-01-01

    We present a sample handling system, a subsystem of the proposed Dragon landed Mars Sample Return (MSR) mission [1], that can return to Earth orbit a significant mass of frozen Mars samples potentially consisting of: rock cores, subsurface drilled rock and ice cuttings, pebble sized rocks, and soil scoops. The sample collection, storage, retrieval and packaging assumptions and concepts in this study are applicable for the NASA's MPPG MSR mission architecture options [2]. Our study assumes a predecessor rover mission collects samples for return to Earth to address questions on: past life, climate change, water history, age dating, understanding Mars interior evolution [3], and, human safety and in-situ resource utilization. Hence the rover will have "integrated priorities for rock sampling" [3] that cover collection of subaqueous or hydrothermal sediments, low-temperature fluidaltered rocks, unaltered igneous rocks, regolith and atmosphere samples. Samples could include: drilled rock cores, alluvial and fluvial deposits, subsurface ice and soils, clays, sulfates, salts including perchlorates, aeolian deposits, and concretions. Thus samples will have a broad range of bulk densities, and require for Earth based analysis where practical: in-situ characterization, management of degradation such as perchlorate deliquescence and volatile release, and contamination management. We propose to adopt a sample container with a set of cups each with a sample from a specific location. We considered two sample cups sizes: (1) a small cup sized for samples matching those submitted to in-situ characterization instruments, and, (2) a larger cup for 100 mm rock cores [4] and pebble sized rocks, thus providing diverse samples and optimizing the MSR sample mass payload fraction for a given payload volume. We minimize sample degradation by keeping them frozen in the MSR payload sample canister using Peltier chip cooling. The cups are sealed by interference fitted heat activated memory

  4. Sampling methods

    OpenAIRE

    Kılıç, Selim

    2013-01-01

    Most of the studies related to health are conducted with samples. Selection of sampling may be performed with random or nonrandom sampling methods. Sampling methods may vary with respect to some characteristics of study population, researchers’ aims and facilities. It is necessary to select samples by random sampling methods in order to provide the representativeness of the study population. The advantages and disadvantages of different sampling methods are presented in this manuscript which ...

  5. Movement Profiles, Match Events, and Performance in Australian Football.

    Science.gov (United States)

    Johnston, Richard J; Watsford, Mark L; Austin, Damien J; Pine, Matthew J; Spurrs, Robert W

    2016-08-01

    Johnston, RJ, Watsford, ML, Austin, D, Pine, MJ, and Spurrs, RW. Movement profiles, match events, and performance in Australian football. J Strength Cond Res 30(8): 2129-2137, 2016-This study examined the relationship between movement demands, match events, and match performance in professional Australian football. Data were collected from 19 players using global positioning system units during 2 Australian Football League seasons. A range of movement demands and instantaneous power measures were collected. The players were divided into high-caliber (HC, ≥17/20) and low-caliber (LC, ≤8/20) groups based on the rating score by their coaches. A Mann-Whitney U-test, independent samples t-test, and effect sizes were used to determine whether any differences existed between the 2 groups. The HC group had a significantly higher match duration (7.2%), higher total distance (9.6%), and covered more distance and spent more time high-speed running per minute (12.7 and 11.9%). Although not significant, the effect sizes revealed that the HC group tended to have a higher mean metabolic power output (2.6%) and spent more time at the high power zone (7.9%). For the match event data, the HC group had significantly more involvements with the football. The results demonstrated the higher physical demands placed on the HC group. The findings suggest that analyzing instantaneous power measures can provide valuable information about the physical demands placed on team sport athletes to coaches and conditioning staff. PMID:26808858

  6. Quantum learning and universal quantum matching machine

    International Nuclear Information System (INIS)

    Suppose that three kinds of quantum systems are given in some unknown states vertical bar f>xN, vertical bar g1>xK, and vertical bar g2>xK, and we want to decide which template state vertical bar g1> or vertical bar g2>, each representing the feature of the pattern class C1 or C2, respectively, is closest to the input feature state vertical bar f>. This is an extension of the pattern matching problem into the quantum domain. Assuming that these states are known a priori to belong to a certain parametric family of pure qubit systems, we derive two kinds of matching strategies. The first one is a semiclassical strategy that is obtained by the natural extension of conventional matching strategies and consists of a two-stage procedure: identification (estimation) of the unknown template states to design the classifier (learning process to train the classifier) and classification of the input system into the appropriate pattern class based on the estimated results. The other is a fully quantum strategy without any intermediate measurement, which we might call as the universal quantum matching machine. We present the Bayes optimal solutions for both strategies in the case of K=1, showing that there certainly exists a fully quantum matching procedure that is strictly superior to the straightforward semiclassical extension of the conventional matching strategy based on the learning process

  7. Pretest probability assessment derived from attribute matching

    Directory of Open Access Journals (Sweden)

    Hollander Judd E

    2005-08-01

    Full Text Available Abstract Background Pretest probability (PTP assessment plays a central role in diagnosis. This report compares a novel attribute-matching method to generate a PTP for acute coronary syndrome (ACS. We compare the new method with a validated logistic regression equation (LRE. Methods Eight clinical variables (attributes were chosen by classification and regression tree analysis of a prospectively collected reference database of 14,796 emergency department (ED patients evaluated for possible ACS. For attribute matching, a computer program identifies patients within the database who have the exact profile defined by clinician input of the eight attributes. The novel method was compared with the LRE for ability to produce PTP estimation Results In the validation set, attribute matching produced 267 unique PTP estimates [median PTP value 6%, 1st–3rd quartile 1–10%] compared with the LRE, which produced 96 unique PTP estimates [median 24%, 1st–3rd quartile 10–30%]. The areas under the receiver operating characteristic curves were 0.74 (95% CI 0.65 to 0.82 for the attribute matching curve and 0.68 (95% CI 0.62 to 0.77 for LRE. The attribute matching system categorized 1,670 (24%, 95% CI = 23–25% patients as having a PTP Conclusion Attribute matching estimated a very low PTP for ACS in a significantly larger proportion of ED patients compared with a validated LRE.

  8. Do audition electives impact match success?

    Directory of Open Access Journals (Sweden)

    Elizabeth Higgins

    2016-06-01

    Full Text Available Purpose: The authors sought to determine the value of the audition elective to the overall success of medical students in the match. Method: The authors surveyed 1,335 fourth-year medical students at 10 medical schools in 2013. The study took place over a 2-month period immediately following the match. Medical students were emailed a 14-question survey and asked about audition electives, rank order, and cost of ‘away’ rotations. Results: One hundred percent of students wishing to match in otolaryngology, neurosurgery, plastic surgery, radiation oncology, and urology took the audition electives. The difference by specialty in the proportion of students who took an audition was statistically significant (p<0.001. Of the students who auditioned, 71% matched at one of their top three choices compared with 84% of non-auditioners who matched to one of their top three choices (p<0.01. Conclusions: Students performed a large number of ‘away’ rotations as ‘auditions’ in order to improve their chances in the match. For certain competitive specialties, virtually all students auditioned. Overall, students who did not audition were just as successful as or more successful than students who did audition.

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

  10. A connection between score matching and denoising autoencoders.

    Science.gov (United States)

    Vincent, Pascal

    2011-07-01

    Denoising autoencoders have been previously shown to be competitive alternatives to restricted Boltzmann machines for unsupervised pretraining of each layer of a deep architecture. We show that a simple denoising autoencoder training criterion is equivalent to matching the score (with respect to the data) of a specific energy-based model to that of a nonparametric Parzen density estimator of the data. This yields several useful insights. It defines a proper probabilistic model for the denoising autoencoder technique, which makes it in principle possible to sample from them or rank examples by their energy. It suggests a different way to apply score matching that is related to learning to denoise and does not require computing second derivatives. It justifies the use of tied weights between the encoder and decoder and suggests ways to extend the success of denoising autoencoders to a larger family of energy-based models. PMID:21492012

  11. The Effect of Asymmetrical Sample Training on Retention Functions for Hedonic Samples in Rats

    Science.gov (United States)

    Simmons, Sabrina; Santi, Angelo

    2012-01-01

    Rats were trained in a symbolic delayed matching-to-sample task to discriminate sample stimuli that consisted of the presence of food or the absence of food. Asymmetrical sample training was provided in which one group was initially trained with only the food sample and the other group was initially trained with only the no-food sample. In…

  12. Boat sampling

    International Nuclear Information System (INIS)

    This presentation describes essential boat sampling activities: on site boat sampling process optimization and qualification; boat sampling of base material (beltline region); boat sampling of weld material (weld No. 4); problems accompanied with weld crown varieties, RPV shell inner radius tolerance, local corrosion pitting and water clarity. The equipment used for boat sampling is described too. 7 pictures

  13. A graph theoretic approach to scene matching

    Science.gov (United States)

    Ranganath, Heggere S.; Chipman, Laure J.

    1991-08-01

    The ability to match two scenes is a fundamental requirement in a variety of computer vision tasks. A graph theoretic approach to inexact scene matching is presented which is useful in dealing with problems due to imperfect image segmentation. A scene is described by a set of graphs, with nodes representing objects and arcs representing relationships between objects. Each node has a set of values representing the relations between pairs of objects, such as angle, adjacency, or distance. With this method of scene representation, the task in scene matching is to match two sets of graphs. Because of segmentation errors, variations in camera angle, illumination, and other conditions, an exact match between the sets of observed and stored graphs is usually not possible. In the developed approach, the problem is represented as an association graph, in which each node represents a possible mapping of an observed region to a stored object, and each arc represents the compatibility of two mappings. Nodes and arcs have weights indicating the merit or a region-object mapping and the degree of compatibility between two mappings. A match between the two graphs corresponds to a clique, or fully connected subgraph, in the association graph. The task is to find the clique that represents the best match. Fuzzy relaxation is used to update the node weights using the contextual information contained in the arcs and neighboring nodes. This simplifies the evaluation of cliques. A method of handling oversegmentation and undersegmentation problems is also presented. The approach is tested with a set of realistic images which exhibit many types of sementation errors.

  14. Privacy-preserving matching of similar patients.

    Science.gov (United States)

    Vatsalan, Dinusha; Christen, Peter

    2016-02-01

    The identification of similar entities represented by records in different databases has drawn considerable attention in many application areas, including in the health domain. One important type of entity matching application that is vital for quality healthcare analytics is the identification of similar patients, known as similar patient matching. A key component of identifying similar records is the calculation of similarity of the values in attributes (fields) between these records. Due to increasing privacy and confidentiality concerns, using the actual attribute values of patient records to identify similar records across different organizations is becoming non-trivial because the attributes in such records often contain highly sensitive information such as personal and medical details of patients. Therefore, the matching needs to be based on masked (encoded) values while being effective and efficient to allow matching of large databases. Bloom filter encoding has widely been used as an efficient masking technique for privacy-preserving matching of string and categorical values. However, no work on Bloom filter-based masking of numerical data, such as integer (e.g. age), floating point (e.g. body mass index), and modulus (numbers wrap around upon reaching a certain value, e.g. date and time), which are commonly required in the health domain, has been presented in the literature. We propose a framework with novel methods for masking numerical data using Bloom filters, thereby facilitating the calculation of similarities between records. We conduct an empirical study on publicly available real-world datasets which shows that our framework provides efficient masking and achieves similar matching accuracy compared to the matching of actual unencoded patient records. PMID:26707453

  15. A graph theoretic approach to scene matching

    Science.gov (United States)

    Ranganath, Heggere S.; Chipman, Laure J.

    1991-01-01

    The ability to match two scenes is a fundamental requirement in a variety of computer vision tasks. A graph theoretic approach to inexact scene matching is presented which is useful in dealing with problems due to imperfect image segmentation. A scene is described by a set of graphs, with nodes representing objects and arcs representing relationships between objects. Each node has a set of values representing the relations between pairs of objects, such as angle, adjacency, or distance. With this method of scene representation, the task in scene matching is to match two sets of graphs. Because of segmentation errors, variations in camera angle, illumination, and other conditions, an exact match between the sets of observed and stored graphs is usually not possible. In the developed approach, the problem is represented as an association graph, in which each node represents a possible mapping of an observed region to a stored object, and each arc represents the compatibility of two mappings. Nodes and arcs have weights indicating the merit or a region-object mapping and the degree of compatibility between two mappings. A match between the two graphs corresponds to a clique, or fully connected subgraph, in the association graph. The task is to find the clique that represents the best match. Fuzzy relaxation is used to update the node weights using the contextual information contained in the arcs and neighboring nodes. This simplifies the evaluation of cliques. A method of handling oversegmentation and undersegmentation problems is also presented. The approach is tested with a set of realistic images which exhibit many types of sementation errors.

  16. Slice Sampling

    OpenAIRE

    Neal, Radford M.

    2000-01-01

    Markov chain sampling methods that automatically adapt to characteristics of the distribution being sampled can be constructed by exploiting the principle that one can sample from a distribution by sampling uniformly from the region under the plot of its density function. A Markov chain that converges to this uniform distribution can be constructed by alternating uniform sampling in the vertical direction with uniform sampling from the horizontal `slice' defined by the current vertical positi...

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

  18. semMatch: Road Semantics-based Accurate Map Matching for Challenging Positioning Data

    OpenAIRE

    Aly, Heba; Youssef, Moustafa

    2015-01-01

    Map matching has been used to reduce the noisiness of the location estimates by aligning them to the road network on a digital map. A growing number of applications, e.g. energy-efficient localization and cellular provider side localization, depend on the availability of only sparse and coarse-grained positioning data; leading to a challenging map matching process. In this paper, we present semMatch: a system that can provide accurate HMM-based map matching for challenging positioning traces....

  19. On the random sampling of pairs, with pedestrian examples

    OpenAIRE

    Arratia, Richard; DeSalvo, Stephen

    2015-01-01

    Suppose one desires to randomly sample a pair of objects such as socks, hoping to get a matching pair. Even in the simplest situation for sampling, which is sampling with replacement, the innocent phrase "the distribution of the color of a matching pair" is ambiguous. One interpretation is that we condition on the event of getting a match between two random socks; this corresponds to sampling two at a time, over and over without memory, until a matching pair is found. A second interpretation ...

  20. Transverse Matching Techniques for the SNS Linac

    CERN Document Server

    Jeon Dong Oh; Danilov, Viatcheslav V

    2005-01-01

    It is crucial to minimize beam loss and machine activation by obtaining optimal transverse matching for a high-intensity linear accelerator such as the Spallation Neutron Source linac. For matching the Drift Tube Linac (DTL) to Coupled Cavity Linac (CCL), there are four wire-scanners installed in series in CCL module 1 as proposed by the author.* A series of measurements was conducted to minimize envelope breathing and the results are presented here. As an independent approach, Chu et al is developing an application based on another technique by estimating rms emittance using the wire scanner profile data.** For matching the Medium Energy Beam Transport Line to the DTL, a technique of minimizing rms emittance was used and emittance data show that tail is minimized as well.

  1. Tabu optimization for matched field inversion

    Science.gov (United States)

    Michalopoulou, Zoi-Heleni; Ghosh-Dastidar, Urmi

    2002-11-01

    Matched field processing is a powerful tool for source localization and geoacoustic inversion. Because of significant environmental and geometry uncertainties, however, matched field processing usually involves multiparameter searches. To facilitate these searches, global optimization techniques such as genetic algorithms and simulated annealing have been successfully employed. In this work, a different approach, tabu, is implemented for optimization in matched field inversion. Tabu is a technique relying on the use of memory; it searches for the global maximum of the objective function through a navigation process that avoids already revisited models, also making use of aspiration criteria and diversification for faster convergence. The tabu performance in localization and geoacoustic inversion is demonstrated through experimentation with both synthetic and real (SWellEX 96) data. The approach is shown to provide reliable estimates in an efficient manner. [Work supported by ONR.

  2. Attosecond pulse shaping using partial phase matching

    International Nuclear Information System (INIS)

    We propose a method for programmable shaping of the amplitude and phase of the extreme ultraviolet and x-ray attosecond pulses produced by high-order harmonic generation. It overcomes the bandwidth limitations of existing spectral filters and enables removal of the intrinsic attosecond chirp as well as the synthesis of pulse sequences. It is based on partial phase matching using a longitudinally addressable modulation. Although the method is in principle applicable to any form of partial phase matching, we focus on quasi-phase matching using a counterpropagating pulse train. We present simulations of the production of isolated attosecond pulses at 250 eV, including a 31 as transform-limited pulse, tunably chirped pulses and double pulses. (paper)

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

  4. Sidescan Sonar Image Matching Using Cross Correlation

    DEFF Research Database (Denmark)

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

    2003-01-01

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

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

  6. RFQ radial matching sections and fringe fields

    International Nuclear Information System (INIS)

    The entrance radial matching section is an extremely important part of any radio-frequency quadrupole (RFQ) linac. It allows a beam having time-independent characteristics to become adapted to the time-dependent focusing in the RFQ. The matching sections proposed in this paper are defined by a four-term potential function and are very effective over lengths of 3 β lambda or longer. The fringe field at the RFQ exit is mainly of interest because of the time-varying on-axis potential. The beam can either lose or gain energy, depending on the shape of the fringe field. The same four-term potential function can be used for shaping the vanes at the exit so that the fringe fields can be controlled. This formulation also applies to exit radial matching sections, which would be useful if the beam is to enter another RFQ operated at a higher frequency. 4 references, 4 figures

  7. Computer-Generated Holographic Matched Filters

    Science.gov (United States)

    Butler, Steven Frank

    This dissertation presents techniques for the use of computer-generated holograms (CGH) for matched filtering. An overview of the supporting technology is provided. Included are techniques for modifying existing CGH algorithms to serve as matched filters in an optical correlator. It shows that matched filters produced in this fashion can be modified to improve the signal-to-noise and efficiency over that possible with conventional holography. The effect and performance of these modifications are demonstrated. In addition, a correction of film non-linearity in continuous -tone filter production is developed. Computer simulations provide quantitative and qualitative demonstration of theoretical principles, with specific examples validated in optical hardware. Conventional and synthetic holograms, both bleached and unbleached, are compared.

  8. Modelling galaxy clustering: halo occupation distribution versus subhalo matching

    Science.gov (United States)

    Guo, Hong; Zheng, Zheng; Behroozi, Peter S.; Zehavi, Idit; Chuang, Chia-Hsun; Comparat, Johan; Favole, Ginevra; Gottloeber, Stefan; Klypin, Anatoly; Prada, Francisco; Rodríguez-Torres, Sergio A.; Weinberg, David H.; Yepes, Gustavo

    2016-07-01

    We model the luminosity-dependent projected and redshift-space two-point correlation functions (2PCFs) of the Sloan Digital Sky Survey (SDSS) Data Release 7 Main galaxy sample, using the halo occupation distribution (HOD) model and the subhalo abundance matching (SHAM) model and its extension. All the models are built on the same high-resolution N-body simulations. We find that the HOD model generally provides the best performance in reproducing the clustering measurements in both projected and redshift spaces. The SHAM model with the same halo-galaxy relation for central and satellite galaxies (or distinct haloes and subhaloes), when including scatters, has a best-fitting χ2/dof around 2-3. We therefore extend the SHAM model to the subhalo clustering and abundance matching (SCAM) by allowing the central and satellite galaxies to have different galaxy-halo relations. We infer the corresponding halo/subhalo parameters by jointly fitting the galaxy 2PCFs and abundances and consider subhaloes selected based on three properties, the mass Macc at the time of accretion, the maximum circular velocity Vacc at the time of accretion, and the peak maximum circular velocity Vpeak over the history of the subhaloes. The three subhalo models work well for luminous galaxy samples (with luminosity above L*). For low-luminosity samples, the Vacc model stands out in reproducing the data, with the Vpeak model slightly worse, while the Macc model fails to fit the data. We discuss the implications of the modelling results.

  9. Donor-recipient matching: myths and realities.

    Science.gov (United States)

    Briceño, Javier; Ciria, Ruben; de la Mata, Manuel

    2013-04-01

    Liver transplant outcomes keep improving, with refinements of surgical technique, immunosuppression and post-transplant care. However, these excellent results and the limited number of organs available have led to an increasing number of potential recipients with end-stage liver disease worldwide. Deaths on waiting lists have led liver transplant teams maximize every organ offered and used in terms of pre and post-transplant benefit. Donor-recipient (D-R) matching could be defined as the technique to check D-R pairs adequately associated by the presence of the constituents of some patterns from donor and patient variables. D-R matching has been strongly analysed and policies in donor allocation have tried to maximize organ utilization whilst still protecting individual interests. However, D-R matching has been written through trial and error and the development of each new score has been followed by strong discrepancies and controversies. Current allocation systems are based on isolated or combined donor or recipient characteristics. This review intends to analyze current knowledge about D-R matching methods, focusing on three main categories: patient-based policies, donor-based policies and combined donor-recipient systems. All of them lay on three mainstays that support three different concepts of D-R matching: prioritarianism (favouring the worst-off), utilitarianism (maximising total benefit) and social benefit (cost-effectiveness). All of them, with their pros and cons, offer an exciting controversial topic to be discussed. All of them together define D-R matching today, turning into myth what we considered a reality in the past. PMID:23104164

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

  11. Log-Spiral Keypoint: A Robust Approach toward Image Patch Matching

    Science.gov (United States)

    Paek, Kangho; Liu, Zhongwei; Kim, Hun

    2015-01-01

    Matching of keypoints across image patches forms the basis of computer vision applications, such as object detection, recognition, and tracking in real-world images. Most of keypoint methods are mainly used to match the high-resolution images, which always utilize an image pyramid for multiscale keypoint detection. In this paper, we propose a novel keypoint method to improve the matching performance of image patches with the low-resolution and small size. The location, scale, and orientation of keypoints are directly estimated from an original image patch using a Log-Spiral sampling pattern for keypoint detection without consideration of image pyramid. A Log-Spiral sampling pattern for keypoint description and two bit-generated functions are designed for generating a binary descriptor. Extensive experiments show that the proposed method is more effective and robust than existing binary-based methods for image patch matching. PMID:26074952

  12. Log-Spiral Keypoint: A Robust Approach toward Image Patch Matching

    Directory of Open Access Journals (Sweden)

    Kangho Paek

    2015-01-01

    Full Text Available Matching of keypoints across image patches forms the basis of computer vision applications, such as object detection, recognition, and tracking in real-world images. Most of keypoint methods are mainly used to match the high-resolution images, which always utilize an image pyramid for multiscale keypoint detection. In this paper, we propose a novel keypoint method to improve the matching performance of image patches with the low-resolution and small size. The location, scale, and orientation of keypoints are directly estimated from an original image patch using a Log-Spiral sampling pattern for keypoint detection without consideration of image pyramid. A Log-Spiral sampling pattern for keypoint description and two bit-generated functions are designed for generating a binary descriptor. Extensive experiments show that the proposed method is more effective and robust than existing binary-based methods for image patch matching.

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

  14. Matching Feature Points in 3D World

    OpenAIRE

    Avdiu, Blerta

    2012-01-01

    This thesis work deals with the most actual topic in Computer Vision field which is scene understanding and this using matching of 3D feature point images. The objective is to make use of Saab’s latest breakthrough in extraction of 3D feature points, to identify the best alignment of at least two 3D feature point images. The thesis gives a theoretical overview of the latest algorithms used for feature detection, description and matching. The work continues with a brief description of the simu...

  15. 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 function...... that measures similarity between statistics of a training image and statistics of any smooth model is introduced and its analytical gradient is computed. This allows us to apply any gradientbased method to history matching problem and guide a solution until it satisfies both production data and...

  16. General Phase Matching Condition for Quantum Searching

    OpenAIRE

    Long, Gui-Lu; Xiao, Li; Sun, Yang(Department of Physics, Shanghai Jiao Tong University, Shanghai 200240, China)

    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 \

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

  18. Subhalo abundance matching in $f(R)$ gravity

    OpenAIRE

    He, Jian-Hue; Li, Baojiu; Baugh, Carlton M.

    2016-01-01

    Using the liminality N-body simulations, we present the first predictions for galaxy clustering in $f(R)$ gravity using subhalo abundance matching. We find that, for a given galaxy density, even for an $f(R)$ model with $f_{R0}=-10^{-6}$, for which the cold dark matter clustering is essentially indistinguishable from $\\Lambda$CDM, the predicted clustering of galaxies in the $f(R)$ model is much weaker than in $\\Lambda$CDM. The deviation can be as large as $40\\%$ for samples with mean densitie...

  19. Salivary Biomarker Responses to Two Final Matches in Women’s Professional Football

    Science.gov (United States)

    Maya, Javiera; Marquez, Pablo; Peñailillo, Luis; Contreras-Ferrat, Ariel; Deldicque, Louise; Zbinden-Foncea, Hermann

    2016-01-01

    The aim of this study was to examine the link between salivary concentrations of cortisol, testosterone, immunoglobulin A (IgA) and the rate of perceived exertion (RPE) as a measure of internal load after two final matches played 3 days apart by professional women football players. Saliva samples were taken before and after the two matches (M1, M2). RPE was used to monitor the exercise intensity after each match. Testosterone concentrations increased after each match (M1: +42%, p = 0.002; M2: +50%, p football matches may play a protecting role against immune suppression usually observed after intense exercise. Key points In our sample space, IgA concentrations did not change for teams even, before and after separated match. Suggesting that salivary IgA determinations after physical activities remain under debate. Testosterone concentrations were the only one hormone showing a consequent increase in both matches after physical activity carrying. The T/C ratio decrease only after M1 according with a higher cortisol level reach after M1 get-together, suggesting a differential impact over anxiety-associated team performance. So M2 play gives a more stable psychological state. PMID:27274677

  20. Salivary Biomarker Responses to Two Final Matches in Women's Professional Football.

    Science.gov (United States)

    Maya, Javiera; Marquez, Pablo; Peñailillo, Luis; Contreras-Ferrat, Ariel; Deldicque, Louise; Zbinden-Foncea, Hermann

    2016-06-01

    The aim of this study was to examine the link between salivary concentrations of cortisol, testosterone, immunoglobulin A (IgA) and the rate of perceived exertion (RPE) as a measure of internal load after two final matches played 3 days apart by professional women football players. Saliva samples were taken before and after the two matches (M1, M2). RPE was used to monitor the exercise intensity after each match. Testosterone concentrations increased after each match (M1: +42%, p = 0.002; M2: +50%, p women after football matches may play a protecting role against immune suppression usually observed after intense exercise. Key pointsIn our sample space, IgA concentrations did not change for teams even, before and after separated match. Suggesting that salivary IgA determinations after physical activities remain under debate.Testosterone concentrations were the only one hormone showing a consequent increase in both matches after physical activity carrying.The T/C ratio decrease only after M1 according with a higher cortisol level reach after M1 get-together, suggesting a differential impact over anxiety-associated team performance. So M2 play gives a more stable psychological state. PMID:27274677

  1. 77 FR 14462 - Space Transportation Infrastructure Matching Grants Program

    Science.gov (United States)

    2012-03-09

    ..._offices/ast/environmental/review . Who May Apply for a Space Transportation Infrastructure Matching Grant... Federal Aviation Administration Space Transportation Infrastructure Matching Grants Program AGENCY... Transportation Infrastructure Matching Grants Program. SUMMARY: This notice solicits Fiscal Year (FY) 2012...

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

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

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

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

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

  7. Lifecycle marriage matching: Theory and Evidence

    OpenAIRE

    Aloysius Siow; Eugene Choo

    2007-01-01

    estimated model shows that a concern for accumulating marriage specific capital is quantitatively significant in generating positive assortative matching in spousal ages at marriage, gender differences in spousal ages at marriage, and a preference for early marriage. Gender variations in population supplies due to gender specific mortality rates and entry cohort sizes have offsetting quantitative effects.

  8. Stochastic Dynamics for the Matching Pennies Game

    OpenAIRE

    Ziv Gorodeisky

    2006-01-01

    We consider stochastic dynamics for the Matching Pennies game, that behave, in expectation, like best-response dynamics (the continuous fictitious play). We prove convergence to the unique equilibrium by extending the result of Benaim and Weibull [2003] on deterministic approximations for stochastic dynamics to the case of discontinuous dynamics - such as the best-reply dynamics.

  9. Behavior Matching in Multimodal Communication Is Synchronized

    Science.gov (United States)

    Louwerse, Max M.; Dale, Rick; Bard, Ellen G.; Jeuniaux, Patrick

    2012-01-01

    A variety of theoretical frameworks predict the resemblance of behaviors between two people engaged in communication, in the form of coordination, mimicry, or alignment. However, little is known about the time course of the behavior matching, even though there is evidence that dyads synchronize oscillatory motions (e.g., postural sway). This study…

  10. Dispersion and betatron matching into the linac

    International Nuclear Information System (INIS)

    In high energy linear colliders, the low emittance beam from a damping ring has to be preserved all the way to the linac, in the linac and to the interaction point. In particular, the Ring-To-Linac (RTL) section of the SLAC Linear Collider (SLC) should provide an exact betatron and dispersion match from the damping ring to the linac. A beam with a non-zero dispersion shows up immediately as an increased emittance, while with a betatron mismatch the beam filaments in the linac. Experimental tests and tuning procedures have shown that the linearized beta matching algorithms are insufficient if the actual transport line has some unknown errors not included in the model. Also, adjusting quadrupole strengths steers the beam if it is offset in the quadrupole magnets. These and other effects have lead to a lengthy tuning process, which in the end improves the matching, but is not optimal. Different ideas will be discussed which should improve this matching procedure and make it a more reliable, faster and simpler process. 5 refs., 2 figs

  11. 39 CFR 266.10 - Computer matching.

    Science.gov (United States)

    2010-07-01

    ... information and provided the individual with due process; (vi) Procedures for ensuring the administrative... Service UNITED STATES POSTAL SERVICE ORGANIZATION AND ADMINISTRATION PRIVACY OF INFORMATION § 266.10... matching proposals, whether from postal organizations or other government agencies, must be mailed...

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

  13. The Effectiveness of Advertising Matching Purchase Motivation

    OpenAIRE

    Van Loef, J.; Antonides, Gerrit; 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 informational advertising is more effective than transformational advertising. Likewise, for hedonic brands transformational advertising is more effective than informational advertising. These recommendations ...

  14. FAST SCAN MATCHING FOR MOBILE ROBOT LOCALIZATION

    Czech Academy of Sciences Publication Activity Database

    Krejsa, Jiří; Věchet, Stanislav

    Prague: Institute of Thermomechanics AS CR, v. v. i., 2008 - (Fuis, V.; Pásek, M.), s. 130-131 ISBN 978-80-87012-11-6. [Engineering Mechanics 2008. Svratka (CZ), 12.05.2008-15.05.2008] Institutional research plan: CEZ:AV0Z20760514 Keywords : scan matching * localization Subject RIV: JB - Sensors, Measurment, Regulation

  15. RESEARCH SAMPLING

    OpenAIRE

    NISHA MD

    2012-01-01

    No aspect of the research plan is more critical for assuring the usefulness of a study than the sampling strategy. It will determine if the results of the study can be applied as evidence and contributes to the trustworthiness of the results. The sampling strategy is a critical part of research design. An appropriate sampling plan is vital for drawing the right conclusions from a study. Good sampling is critical for the confident application of the study findings to other people, settings, or...

  16. Higgs Pair Production: Improved Description by Matrix Element Matching

    CERN Document Server

    Li, Qiang; Zhao, Xiaoran

    2013-01-01

    Higgs pair production is crucial for measuring the Higgs boson self-coupling. The dominant channel at hadron colliders is gluon fusion via heavy-quark loops. We present the results of a fully exclusive simulation of gluon fusion Higgs pair production based on the matrix elements for hh + 0, 1 partons including full heavy-quark loop dependence, matched to a parton shower. We examine and validate this new description by comparing it with (a) Higgs Effective Theory predictions, (b) exact hh + 0-parton sample showered by pythia, and (c) exact hh+1-parton distributions, by looking at the most relevant kinematic distributions, such as PTh, PThh, Mhh spectra, and jet rate as well. We find that matched samples provide an state-of-the-art accurate exclusive description of the final state. The relevant LHE files for Higgs pair productions at the LHC can be accessed via http://hepfarm02.phy.pku.edu.cn/foswiki/CMS/HH, which can be used for relevant experimental analysis.

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

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

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

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

  1. 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...... primitive in computational biology applications. Let m and n be the lengths of P and T, respectively, and let k be the number of strings in P. We present a new algorithm achieving time O(nlogk+m+α) and space O(m+A), where A is the sum of the lower bounds of the lengths of the gaps in P and α is the total...

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

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

  4. A beam-matching concept for medical linear accelerators

    DEFF Research Database (Denmark)

    Sjöström, David; Bjelkengren, Ulf; Ottosson, Wiviann;

    2009-01-01

    not revealed by the vendor-defined acceptance criteria, whereas the other six accelerators were satisfactorily matched. The beam-matching acceptance criteria defined by the vendor are not strict enough to guarantee optimal beam-match. Deviations related to dose calculations and to beam-matched accelerators may...

  5. The Unbalanced Matching in a Director Market

    OpenAIRE

    Changmin Lee

    2007-01-01

    I construct an intertemporal searching model ("take it or leave it offer") in a frictional directorship market to explain the unbalanced matching between the director and the firm. In this model, potential candidates for outside directors and firms have heterogeneous (also, well ordered) quality levels. Also, both parties have strictly ordered preferences over the quality of counterpart from high levels to low levels. A candidate considers his quality ranking to compare the value of accepting...

  6. Final report, DOE/industry matching grant

    International Nuclear Information System (INIS)

    The Department of Energy/Industry Matching Grant was used to help improve nuclear engineering and science education at the University of Missouri-Rolla. The funds helped in the areas of recruitment and retention. Funds allowed the department to give scholarships to over 100 students (names included). Funds were also used for equipment upgrade and research, including two computers with peripherals, two NaI detectors, and a thermoluminescent dosimeter

  7. Netzbasierte Dienste - Angebot, Nachfrage und Matching

    OpenAIRE

    Tamm, Gerrit

    2003-01-01

    Die vorliegende Dissertation präsentiert eine umfassende Analyse und Strukturierung des Marktes für netzbasierte Dienste. Basierend auf einer detaillierten Untersuchung des ASP-Angebotes und der ASP-Nachfrage in Europa werden geeignete Institutionen und Informationssubstitute für die Anpassung (Matching) des ASP-Angebotes und der ASP-Nachfrage identifiziert und getestet. Die Strukturierung der Angebotsseite umfasst neben der Bewertung der Marktlage die Entwicklung der ASP-Wertschöpfungskette...

  8. Anatomy Ontology Matching Using Markov Logic Networks

    OpenAIRE

    Li, Chunhua; Zhao, Pengpeng; Wu, Jian; Cui, Zhiming

    2016-01-01

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

  9. Pretest probability assessment derived from attribute matching

    OpenAIRE

    Hollander Judd E; Diercks Deborah B; Pollack Charles V; Johnson Charles L; Kline Jeffrey A; Newgard Craig D; Garvey J Lee

    2005-01-01

    Abstract Background Pretest probability (PTP) assessment plays a central role in diagnosis. This report compares a novel attribute-matching method to generate a PTP for acute coronary syndrome (ACS). We compare the new method with a validated logistic regression equation (LRE). Methods Eight clinical variables (attributes) were chosen by classification and regression tree analysis of a prospectively collected reference database of 14,796 emergency department (ED) patients evaluated for possib...

  10. Intermediation and matching in insurance markets

    OpenAIRE

    Focht, Uwe; Richter, Andreas; Schiller, Jörg

    2009-01-01

    This paper addresses the role of independent insurance intermediaries in markets where matching is important. A controversial matter in the discussion concerning insurance intermediation is the issue of compensation customs and how the latter affect prices, rents and advice quality in insurance markets. This work compares a fee-based with a commission-based system. We show that in a situation with a non-strategic intermediary both remuneration systems are payoff-equivalent. In a second step, ...

  11. Intuitionistic Fuzzy Automaton for Approximate String Matching

    OpenAIRE

    K.M. Ravi; Choubey, A.; K.K. Tripati

    2014-01-01

    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.

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

  13. Matching residency numbers to the workforce needs

    OpenAIRE

    Khan, S; Johnston, L; Faimali, M.; Gikas, P; Briggs, T. W.

    2014-01-01

    Matching the number of surgeons to the demands for orthopedic services has been notoriously difficult. Not only does one need to evaluate current trends in the supply and provision of services but anticipate the impact of future reforms on these variables. The British Orthopaedic Association has aspired to provide consultant to population ratio of 1:15,000 by 2020. Currently, the orthopedic community is tasked with providing care for an aging population with soaring levels of obesity; with bo...

  14. Comparison of Orthogonal Matching Pursuit Implementations

    DEFF Research Database (Denmark)

    Sturm, Bob L.; Christensen, Mads Græsbøll

    2012-01-01

    We study the numerical and computational performance of three implementations of orthogonal matching pursuit: one using the QR matrix decomposition, one using the Cholesky matrix decomposition, and one using the matrix inversion lemma. We find that none of these implementations suffer from...... numerical error accumulation in the inner products or the solution. Furthermore, we empirically compare the computational times of each algorithm over the phase plane....

  15. Comparison of Orthogonal Matching Pursuit Implementations

    OpenAIRE

    Sturm, Bob L.; Christensen, Mads Græsbøll

    2012-01-01

    We study the numerical and computational performance of three implementations of orthogonal matching pursuit: one using the QR matrix decomposition, one using the Cholesky matrix decomposition, and one using the matrix inversion lemma. We find that none of these implementations suffer from numerical error accumulation in the inner products or the solution. Furthermore, we empirically compare the computational times of each algorithm over the phase plane.

  16. Spectral phase conjugation via extended phase matching

    OpenAIRE

    Tsang, Mankei

    2005-01-01

    It is shown that the copropagating three-wave-mixing parametric process, with appropriate type-II extended phase matching and pumped with a short second-harmonic pulse, can perform spectral phase conjugation and parametric amplification, which shows a threshold behavior analogous to backward wave oscillation. The process is also analyzed in the Heisenberg picture, which predicts a spontaneous parametric down conversion rate in agreement with the experimental result reported by Kuzucu et al. [...

  17. Norne Field manual history matching & analysis

    OpenAIRE

    HUSSAIN, Imdad

    2010-01-01

    A reservoir engineer’s most important job function is to predict the production future of a reservoir from given production rates. To be able to do this job the first requirement is updating a petroleum reservoir model using production data. This process is called history matching. It is an essential requirement before a reservoir model becomes acceptable for production forecasting.To accomplish this task engineers have developed several methods over a period of many years. These range from s...

  18. 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......, and the COIL database. Finally the performance is compared with algorithms based on the Scale Invariant Feature Transform (SIFT), and the Position of Catastrophes (CAT)....

  19. Matching ERP System Functionality to Customer Requirements

    OpenAIRE

    Rolland, Colette; Prakash, Naveen

    2001-01-01

    International audience Although procuring Enterprise Resource Planning systems from commercial suppliers is becoming increasingly popular in our industry, fitting those systems to customer requirements remains problematic. In this paper, we propose an approach for matching ERP system functionality to customer requirements. The assumption made is that the ERP system postulates a set of requirements that are worth eliciting from the ERP documentation as abstractions of the ERP system functio...

  20. Efficient Fingerprint Matching Based Upon Minutiae Extraction

    OpenAIRE

    Chiranjeeb Roy Chowdhury; Banani Saha

    2015-01-01

    Fingerprints are one of the oldest and most widely used biometric security measures. Rapid advances in Computer Science and digital Image Processing have made it possible to design various Automatic Fingerprint Identification Systems (AFIS) which can compare certain features of an input fingerprint image with a series of template images stored in a database and find a match. This paper deals with the extraction of certain specific features from a fingerprint, called minutiae. Since low qualit...

  1. Fingerprint Matching Using Hierarchical Level Features

    Directory of Open Access Journals (Sweden)

    D. Bennet

    2011-01-01

    Full Text Available This paper proposes a fingerprint features extraction using different levels. The hierarchical order at four different levels, namely, Level 1 (pattern, Level 2 (minutia points, Level 3 (pores and ridge contours, and Level 4 (oscillated pattern. The fingerprint feature extraction frequently take advantage of Level 4 features to assist in identification, Automated Fingerprint Identification Systems (AFIS currently rely only on Level 1 and Level 2 features. In fact, the Federal Bureau of Investigation's (FBI standard of fingerprint resolution for AFIS is 500 pixels per inch (ppi, which is inadequate for capturing Level 3 features, such as pores. With the advances in fingerprint sensing technology, many sensors are now equipped with dual resolution (1,000 ppi scanning capability. However, increasing the scan resolution alone does not necessarily provide any performance improvement in fingerprint matching, unless an extended feature set is utilized. As a result, a systematic analysis to determine how much performance gain one can achieve by introducing Level 4 features in AFIS is highly desired. We propose a hierarchical matching system that utilizes features at all the four levels extracted from 1,000-ppi fingerprints scans. Level 3 features, pores and ridge contours are automatically extracted using Gabor filters and wavelet transform and are locally matched using the Iterative Closest Point (ICP algorithm and Level 4 features, oscillated pattern including curve scanned DCT to measure the recognition rate using k-nn classifier, Our analytical study conclude Level 4 features carry significant discriminatory information. The matching system when Level 4 features are employed in combination with Level 1 Level 2 and Level 3 features. This proposed method outperforms the others, particularly in recognition rate.

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

  3. Dynamic Approximate Vertex Cover and Maximum Matching

    OpenAIRE

    Onak, Krzysztof; Rubinfeld, Ronitt

    2010-01-01

    We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge insertion. We give the first randomized data structure that simultaneously achieves a constant approximation factor and handles a sequence of k updates in k. polylog(n) time. Previous data structures require a polynomial amount of computation per update. The starting point of our construction is a distributed algorit...

  4. Generating catalogs of transverse matching solutions

    International Nuclear Information System (INIS)

    Programs such as TRANSPORT or TRACE can find transverse beam matching solutions one at a time when given appropriate starting conditions. In the present work, an algorithm is described which rapidly finds a catalog of approximate transverse beam matching solutions. For a given initial beam, the algorithm finds the gradients of four quadrupole magnets such as to get four Twiss parameters (alpha and beta for horizontal and vertical planes) which are close to a set of desired values at the exit of a constant-energy beam line with no horizontal-vertical cross coupling and no space charge. The beam line may contain bending elements with edge corrections and other elements for which the r matrixes are known. The algorithm transforms the entrance and exit beam specifications to waist specifications, and uses the properties of waist-to-waist transport to reduce the problem from a four dimensional search to a two dimensional search. At the Los Alamos Meson Physics Facility (LAMPF) accelerator, transverse matching is important in the low-energy transport lines (0.75 MeV), where beams from the H+, H/sup /minus//, and polarized H/sup /minus// sources must be tailored for injection into the drift-tube linac; and in the transition region (100 MeV), where the beam from the drift-tube linac is injected into the side-coupled linac. Space charge has significant effects in the low-energy transport, but it is still valuable to get no-space-charge matching solutions as a starting point for solutions with space charge. 2 refs

  5. Automatic inference of specifications using matching logic

    OpenAIRE

    Alpuente Frasnedo, María; Feliú Gabaldón, Marco Antonio; Villanueva García, Alicia

    2013-01-01

    Formal specifications can be used for various software engineering activities ranging from finding errors to documenting software and automatic test-case generation. Automatically discovering specifications for heap-manipulating programs is a challenging task. In this paper, we propose a technique for automatically inferring formal specifications from C code which is based on the symbolic execution and automated reasoning tandem "MATCHING LOGIC /K framework". We implemented our technique for ...

  6. Contractual Structure and Endogenous Matching in Partnershipso

    OpenAIRE

    Ghatak, Maitreesh; Karaivanov, Alexander

    2011-01-01

    We analyze optimal contracts and optimal matching patterns in a simple model of partnership where there is a double-sided moral hazard problem and potential partners differ in their productivity in two tasks. It is possible for one individual to accomplish both tasks (sole production) and there are no agency costs associated with this option but partnerships are a better option if comparative advantages are significant. We show that the presence of moral hazard can reverse the optimal matchin...

  7. Matching theory in natural human environments

    OpenAIRE

    McDowell, J. J

    1988-01-01

    Matching theory is a mathematical account of behavior, many aspects of which have been confirmed in laboratory experiments with nonhuman and human subjects. The theory asserts that behavior is distributed across concurrently available response alternatives in the same proportion that reinforcement is distributed across those alternatives. The theory also asserts that behavior on a single response alternative is a function not only of reinforcement contingent on that behavior, but also of rein...

  8. Approximate word matches between two random sequences

    OpenAIRE

    Burden, Conrad J.; Kantorovitz, Miriam R; Wilson, Susan R

    2008-01-01

    Given two sequences over a finite alphabet $\\mathcal{L}$ , the D2 statistic is the number of m-letter word matches between the two sequences. This statistic is used in bioinformatics for expressed sequence tag database searches. Here we study a generalization of the D2 statistic in the context of DNA sequences, under the assumption of strand symmetric Bernoulli text. For k

  9. Probabilistic sonar scan matching for an AUV

    OpenAIRE

    Hernàndez Bes, Emili; Ridao Rodríguez, Pere; Ribas Romagós, David; Mallios, Angelos

    2009-01-01

    This paper proposes MSISpIC, a probabilistic sonar scan matching algorithm for the localization of an autonomous underwater vehicle (AUV). The technique uses range scans gathered with a Mechanical Scanning Imaging Sonar (MSIS), the robot displacement estimated through dead-reckoning using a Doppler velocity log (DVL) and a motion reference unit (MRU). The proposed method is an extension of the pIC algorithm. An extended Kalman filter (EKF) is used to estimate the robot-path during the scan in...

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

  11. Marriage and Assortative Matching in Rural Ethiopia

    OpenAIRE

    Marcel Fafchamps; Agnes Quisumbing

    2002-01-01

    This paper examines the determinants of human and physical capital at marriage. Using detailed data from rural Ethiopia, we find ample evidence of assortative matching at marriage. Assets brought to marriage are distributed in a highly unequal manner. Sorting operates at a variety of levels – wealth, schooling, and work experience – that cannot be summarized into a single additive index. For first unions, assets brought to marriage are positively associated with parents’ wealth, indicating th...

  12. Human Capital, Matching and Job Satisfaction

    OpenAIRE

    Tim Barmby; Alex Bryson; Barbara Eberth

    2012-01-01

    Using a model of wage determination developed by Stevens (2003) we offer an explanation of why tenure has a negative effect when entered in job satisfaction equations. If job satisfaction measures match quality, then the explanation follows from a model of the labour market in which workers accumulate specific human capital at the firm they work and the way in which this accumulation affects the way workers react to outside job opportunities.

  13. Scalable Similarity Matching in Streaming Time Series

    OpenAIRE

    Marascu, Alice; Ali Khan, Suleiman; Palpanas, Themis

    2011-01-01

    Nowadays online monitoring of data streams is essential in many real life applications, like sensor network monitoring, manufacturing process control, and video surveillance. One major problem in this area is the online identification of streaming sequences similar to a predefined set of pattern-sequences. In this paper, we present a novel solution that extends the state of the art both in terms of effectiveness and efficiency. We propose the first online similarity matching algorithm based o...

  14. Sampling Development

    OpenAIRE

    Adolph, Karen E.; Robinson, Scott R.

    2011-01-01

    Research in developmental psychology requires sampling at different time points. Accurate depictions of developmental change provide a foundation for further empirical studies and theories about developmental mechanisms. However, overreliance on widely spaced sampling intervals in cross-sectional and longitudinal designs threatens the validity of the enterprise. This article discusses how to sample development in order to accurately discern the shape of developmental change. The ideal solutio...

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

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

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

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

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

  19. One-loop effective lagrangians after matching

    Science.gov (United States)

    del Aguila, F.; Kunszt, Z.; Santiago, J.

    2016-05-01

    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.

  20. One-loop effective lagrangians after matching

    CERN Document Server

    del Aguila, Francisco; Santiago, Jose

    2016-01-01

    We discuss the shortcomings of the recently proposed functional method 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 the 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 of hypercharge $-1$ 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 arbitra...

  1. Electromagnetically induced transparency with matched pulses

    International Nuclear Information System (INIS)

    In the last several years there have been studies and experiments showing how, by applying an additional laser beam, optically-thick transitions may be rendered nearly transparent to probing radiation. This transparency results from a quantum interference, very much like a Fano interference, which is established by the additional laser. This talk describes the difference between the quantum interference as exhibited by an independent atom and by an optically-thick ensemble of atoms. We find that an ensemble of atoms establishes transparency through a strong nonlinear interaction which, for a lambda system, tends to generate a matching temporal envelope on the complementary transition. For a ladder system, phase conjugate pulses are generated and, after a characteristic distance, establish transparency. The transparency of an optically-thick medium is therefore not a Beer's law superposition of the independent atom response. To transmit a pulse through an otherwise opaque media, the front edge of the complementary pulse should lead, in the manner of open-quotes counter-intuitiveclose quotes adiabatic transfer, the front edge of the pulse which is to be rendered transparent. Thereafter the pulses should be matched or, for a ladder system, phase-conjugately matched

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

  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

    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...... complexities for both problems. In particular, we significantly improve the space bounds, which in practical applications are likely to be a bottleneck....

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

  5. High-intensity running in English FA Premier League soccer matches

    DEFF Research Database (Denmark)

    Bradley, Paul S.; Sheldon, William; Wooster, Blake;

    2009-01-01

    The aims of this study were to (1) determine the activity profiles of a large sample of English FA Premier League soccer players and (2) examine high-intensity running during elite-standard soccer matches for players in various playing positions. Twenty-eight English FA Premier League games were...... with and without ball possession is reduced during various phases of elite-standard soccer matches and the activity profiles and fatigue patterns vary among playing positions. The current findings provide valuable information about the high-intensity running patterns of a large sample of elite-standard soccer...

  6. 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. PMID:23153799

  7. Mentoring During Medical School and Match Outcome Among Emergency Medicine Residents

    Directory of Open Access Journals (Sweden)

    Erin Dehon

    2015-11-01

    Full Text Available Introduction: Few studies have documented the value of mentoring for medical students, and research has been limited to more subjective (e.g., job satisfaction, perceived career preparation rather than objective outcomes. This study examined whether having a mentor is associated with match outcome (where a student matched based on their rank order list [ROL]. Methods: We sent a survey link to all emergency medicine (EM program coordinators to distribute to their residents. EM residents were surveyed about whether they had a mentor during medical school. Match outcome was assessed by asking residents where they matched on their ROL (e.g., first choice, fifth choice. They were also asked about rank in medical school, type of degree (MD vs. DO, and performance on standardized tests. Residents who indicated having a mentor completed the Mentorship Effectiveness Scale (MES, which evaluates behavioral characteristics of the mentor and yields a total score. We assessed correlations among these variables using Pearson’s correlation coefficient. Post-hoc analysis using independent sample t-test was conducted to compare differences in the MES score between those who matched to their first or second choice vs. third or higher choice. Results: Participants were a convenience sample of 297 EM residents. Of those, 199 (67% reported having a mentor during medical school. Contrary to our hypothesis, there was no significant correlation between having a mentor and match outcome (r=0.06, p=0.29. Match outcome was associated with class rank (r=0.13, p=0.03, satisfaction with match outcome (r= -0.37, p<0.001, and type of degree (r=0.12, p=0.04. Among those with mentors, a t-test revealed that the MES score was significantly higher among those who matched to their first or second choice (M=51.31, SD=10.13 compared to those who matched to their third or higher choice (M=43.59, SD=17.12, t(194=3.65, p<0.001, d=0.55. Conclusion: Simply having a mentor during medical

  8. History Matching in Parallel Computational Environments

    Energy Technology Data Exchange (ETDEWEB)

    Steven Bryant; Sanjay Srinivasan; Alvaro Barrera; Yonghwee Kim; Sharad Yadav

    2006-08-31

    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 r{sub D} 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

  9. Computer assisted history matching : A comprehensive study of methodology

    OpenAIRE

    Arief, Ibnu Hafidz

    2013-01-01

    History matching is an important step in reservoir simulation study. The objective is to validate a reservoir model before it is used for prediction. In conventional way, people do history matching by manually adjusting uncertain parameters until an acceptable match is achieved. As a consequence, history matching becomes a delicate problem and consumes a lot of time. Furthermore, in several cases it is hard to obtain a match by manual process. In order to have a more efficient history matc...

  10. Sampling Development

    Science.gov (United States)

    Adolph, Karen E.; Robinson, Scott R.

    2011-01-01

    Research in developmental psychology requires sampling at different time points. Accurate depictions of developmental change provide a foundation for further empirical studies and theories about developmental mechanisms. However, overreliance on widely spaced sampling intervals in cross-sectional and longitudinal designs threatens the validity of…

  11. Language sampling

    DEFF Research Database (Denmark)

    Rijkhoff, Jan; Bakker, Dik

    1998-01-01

    This article has two aims: [1] to present a revised version of the sampling method that was originally proposed in 1993 by Rijkhoff, Bakker, Hengeveld and Kahrel, and [2] to discuss a number of other approaches to language sampling in the light of our own method. We will also demonstrate how our...

  12. REVERSE DESIGN APPROACH FOR MECHANISM TRAJECTORY BASED ON CODE-CHAINS MATCHING

    Institute of Scientific and Technical Information of China (English)

    ZHANG Shuyou; YI Guodong; XU Xiaofeng

    2007-01-01

    Aiming at the problem of reverse-design of mechanism, a method based on the matching of trajectory code-chains is presented. The motion trajectory of mechanism is described with code-chain,which is normalized to simplify the operation of geometric transformation. The geometric transformation formulas of scale, mirror and rotation for trajectory code-chain are defined, and the reverse design for mechanism trajectory is realized through the analysis and solution of similarity matching between the desired trajectory and the predefined trajectory. The algorithm program and prototype system of reverse design for mechanism trajectory are developed. Application samples show that the method can break the restriction of trajectory patterns in matching, meet the demand of partial matching, and overcome the influence of geometric transformation of trajectory on the reverse design for mechanism.

  13. Playing match venue does not affect resting salivary steroids in elite Futsal players.

    Science.gov (United States)

    Arruda, Ademir F S; Aoki, Marcelo S; Miloski, Bernardo; Freitas, Camila G; Moura, Nivaldo R; Moreira, Alexandre

    2016-03-01

    This study examined the influence of competition playing venue on the hormonal responses in elite Futsal players. Twenty-one males (age, 19.3 ± 0.7 years; height, 174.2 ± 4.1cm; body mass, 71.8 ± 7.9 kg) from two Futsal teams were monitored during two competitive matches that were played against each other on a home and away basis. Saliva sampling was conducted before (pre) and after (post) each match. The concentration of salivary steroids (testosterone [T] and cortisol [C]) was assessed by ELISA. Resting concentration of salivary steroid (T and C) hormones was not affected by playing venue (home and away). Both Futsal matches promoted a significant increase in T and C from pre--to post-matches (pfriends may impose a higher level of stress on the players at their own facility. PMID:26683533

  14. Antenna matching for a Helicon plasma source

    International Nuclear Information System (INIS)

    Full text: Helicon plasma sources are known to exhibit a number of stable modes of operation separated by discontinuous jumps in the plasma density. These jumps are often associated with transitions between different standing wave modes with consequent changes in the antenna impedance. These changes in turn entail changes to the tuning of the antenna matching network. This poster examines the changes in plasma impedance as a function of the conditions in the plasma and develops strategies for tuning the matching network that facilitate the transitions across the jumps. The matching network consists of a variable capacitor in series with the antenna driven by the secondary of a high power RF step-down transformer. A second capacitor is placed in shunt with the primary of the transformer producing effectively an LC matching network using the residual inductance of the transformer. The partial match achieved by the transformer means that generally only the series capacitor needs to be adjusted as a result of changes in the reactance of the antenna occasioned by changes in the plasma. The antenna impedance is measured using a current transformer to monitor the antenna current and a pair of antenna voltage probes coupled via an isolation transformer to an instrument designed to deliver three DC output signals proportional to: the magnitude of the current, the antenna voltage and the phase between these two signals. Further information is derived from the settings of the capacitors employed in the matching network and measurements of the forward and reflected RF power. Results are presented that show that in the absence of a plasma the antenna has a resistance ∼ 0.3 Ω rising to ∼ 2 Ω at low plasma densities and ∼ 4 Ω for higher order, high-density modes. Reactance measurements indicate that the effective inductive reactance seen at the antenna terminals decreases with increasing plasma density and mode number. Comparisons are made with a simple transmission line

  15. Environmental sampling

    International Nuclear Information System (INIS)

    Environmental Sampling (ES) is a technology option that can have application in transparency in nuclear nonproliferation. The basic process is to take a sample from the environment, e.g., soil, water, vegetation, or dust and debris from a surface, and through very careful sample preparation and analysis, determine the types, elemental concentration, and isotopic composition of actinides in the sample. The sample is prepared and the analysis performed in a clean chemistry laboratory (CCL). This ES capability is part of the IAEA Strengthened Safeguards System. Such a Laboratory is planned to be built by JAERI at Tokai and will give Japan an intrinsic ES capability. This paper presents options for the use of ES as a transparency measure for nuclear nonproliferation

  16. Recovery Kinetics of Knee Flexor and Extensor Strength after a Football Match

    Science.gov (United States)

    Draganidis, Dimitrios; Chatzinikolaou, Athanasios; Avloniti, Alexandra; Barbero-Álvarez, José C.; Mohr, Magni; Malliou, Paraskevi; Gourgoulis, Vassilios; Deli, Chariklia K.; Douroudos, Ioannis I.; Margonis, Konstantinos; Gioftsidou, Asimenia; Fouris, Andreas D.; Jamurtas, Athanasios Z.; Koutedakis, Yiannis; Fatouros, Ioannis G.

    2015-01-01

    We examined the temporal changes of isokinetic strength performance of knee flexor (KF) and extensor (KE) strength after a football match. Players were randomly assigned to a control (N = 14, participated only in measurements and practices) or an experimental group (N = 20, participated also in a football match). Participants trained daily during the two days after the match. Match and training overload was monitored with GPS devices. Venous blood was sampled and muscle damage was assessed pre-match, post-match and at 12h, 36h and 60h post-match. Isometric strength as well as eccentric and concentric peak torque of knee flexors and extensors in both limbs (dominant and non-dominant) were measured on an isokinetic dynamometer at baseline and at 12h, 36h and 60h after the match. Functional (KFecc/KEcon) and conventional (KFcon/KEcon) ratios were then calculated. Only eccentric peak torque of knee flexors declined at 60h after the match in the control group. In the experimental group: a) isometric strength of knee extensors and knee flexors declined (P<0.05) at 12h (both limbs) and 36h (dominant limb only), b) eccentric and concentric peak torque of knee extensors and flexors declined (P<0.05) in both limbs for 36h at 60°/s and for 60h at 180°/s with eccentric peak torque of knee flexors demonstrating a greater (P<0.05) reduction than concentric peak torque, c) strength deterioration was greater (P<0.05) at 180°/s and in dominant limb, d) the functional ratio was more sensitive to match-induced fatigue demonstrating a more prolonged decline. Discriminant and regression analysis revealed that strength deterioration and recovery may be related to the amount of eccentric actions performed during the match and athletes' football-specific conditioning. Our data suggest that recovery kinetics of knee flexor and extensor strength after a football match demonstrate strength, limb and velocity specificity and may depend on match physical overload and players' physical

  17. Rule-based Cross-matching of Very Large Catalogs

    Science.gov (United States)

    Ogle, P. M.; Mazzarella, J.; Ebert, R.; Fadda, D.; Lo, T.; Terek, S.; Schmitz, M.; NED Team

    2015-09-01

    The NASA Extragalactic Database (NED) has deployed a new rule-based cross-matching algorithm called Match Expert (MatchEx), capable of cross-matching very large catalogs (VLCs) with >10 million objects. MatchEx goes beyond traditional position-based cross-matching algorithms by using other available data together with expert logic to determine which candidate match is the best. Furthermore, the local background density of sources is used to determine and minimize the false-positive match rate and to estimate match completeness. The logical outcome and statistical probability of each match decision is stored in the database and may be used to tune the algorithm and adjust match parameter thresholds. For our first production run, we cross-matched the GALEX All Sky Survey Catalog (GASC), containing nearly 40 million NUV-detected sources, against a directory of 180 million objects in NED. Candidate matches were identified for each GASC source within a 7''.5 radius. These candidates were filtered on position-based matching probability and on other criteria including object type and object name. We estimate a match completeness of 97.6% and a match accuracy of 99.75%. Over the next year, we will be cross-matching over 2 billion catalog sources to NED, including the Spitzer Source List, the 2MASS point-source catalog, AllWISE, and SDSS DR 10. We expect to add new capabilities to filter candidate matches based on photometry, redshifts, and refined object classifications. We will also extend MatchEx to handle more heterogenous datasets federated from smaller catalogs through NED's literature pipeline.

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

  19. Design of matching layers for high-frequency ultrasonic transducers

    Science.gov (United States)

    Fei, Chunlong; Ma, Jianguo; Chiu, Chi Tat; Williams, Jay A.; Fong, Wayne; Chen, Zeyu; Zhu, BenPeng; Xiong, Rui; Shi, Jing; Hsiai, Tzung K.; Shung, K. Kirk; Zhou, Qifa

    2015-09-01

    Matching the acoustic impedance of high-frequency (≥100 MHz) ultrasound transducers to an aqueous loading medium remains a challenge for fabricating high-frequency transducers. The traditional matching layer design has been problematic to establish high matching performance given requirements on both specific acoustic impedance and precise thickness. Based on both mass-spring scheme and microwave matching network analysis, we interfaced metal-polymer layers for the matching effects. Both methods hold promises for guiding the metal-polymer matching layer design. A 100 MHz LiNbO3 transducer was fabricated to validate the performance of the both matching layer designs. In the pulse-echo experiment, the transducer echo amplitude increased by 84.4% and its -6dB bandwidth increased from 30.2% to 58.3% comparing to the non-matched condition, demonstrating that the matching layer design method is effective for developing high-frequency ultrasonic transducers.

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

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

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

  3. PIV uncertainty quantification by image matching

    International Nuclear Information System (INIS)

    A novel method is presented to quantify the uncertainty of PIV data. The approach is a posteriori, i.e. the unknown actual error of the measured velocity field is estimated using the velocity field itself as input along with the original images. The principle of the method relies on the concept of super-resolution: the image pair is matched according to the cross-correlation analysis and the residual distance between matched particle image pairs (particle disparity vector) due to incomplete match between the two exposures is measured. The ensemble of disparity vectors within the interrogation window is analyzed statistically. The dispersion of the disparity vector returns the estimate of the random error, whereas the mean value of the disparity indicates the occurrence of a systematic error. The validity of the working principle is first demonstrated via Monte Carlo simulations. Two different interrogation algorithms are considered, namely the cross-correlation with discrete window offset and the multi-pass with window deformation. In the simulated recordings, the effects of particle image displacement, its gradient, out-of-plane motion, seeding density and particle image diameter are considered. In all cases good agreement is retrieved, indicating that the error estimator is able to follow the trend of the actual error with satisfactory precision. Experiments where time-resolved PIV data are available are used to prove the concept under realistic measurement conditions. In this case the ‘exact’ velocity field is unknown; however a high accuracy estimate is obtained with an advanced interrogation algorithm that exploits the redundant information of highly temporally oversampled data (pyramid correlation, Sciacchitano et al (2012 Exp. Fluids 53 1087–105)). The image-matching estimator returns the instantaneous distribution of the estimated velocity measurement error. The spatial distribution compares very well with that of the actual error with maxima in the

  4. Quantum learning and universal quantum matching machine

    OpenAIRE

    Sasaki, Masahide; Carlini, Alberto

    2002-01-01

    Suppose that three kinds of quantum systems are given in some unknown states $\\ket f^{\\otimes N}$, $\\ket{g_1}^{\\otimes K}$, and $\\ket{g_2}^{\\otimes K}$, and we want to decide which \\textit{template} state $\\ket{g_1}$ or $\\ket{g_2}$, each representing the feature of the pattern class ${\\cal C}_1$ or ${\\cal C}_2$, respectively, is closest to the input \\textit{feature} state $\\ket f$. This is an extension of the pattern matching problem into the quantum domain. Assuming that these states are kno...

  5. 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. PMID:23244012

  6. COMP: Comparing Ontology Matching Plug-in

    Czech Academy of Sciences Publication Activity Database

    Tyl, Pavel; Loufek, J.

    Los Alamitos : IEEE Computer Society, 2009 - (Abraham, A.; Húsek, D.; Snášel, V.), s. 44-49 ISBN 978-0-7695-3821-1. [NWeSP 2009. International Conference on Next Generation Web Services Practices /5./. Prague (CZ), 09.11.2009-11.09.2009] R&D Projects: GA MŠk 1M0554 Institutional research plan: CEZ:AV0Z10300504 Keywords : matching * ontologie * plug-in * Protégé Subject RIV: IN - Informatics, Computer Science

  7. Phase matching in second harmonic generation

    International Nuclear Information System (INIS)

    Phase-matching of coupled modes is investigated for the intracavity second harmonic generation in the instability region. In the positive P-representation using numerical solution of Langevin stochastic equations for this system the joint phase distribution function of fundamental and second harmonic modes is calculated. It is shown that for large time and initial vacuum states of both modes the distribution function in the right from bifurcation point has a dip. A removing of the system to the right from the bifurcation point leads to dip's size enhancement.10 refs

  8. Ontology Matching for Web Services Composition

    Czech Academy of Sciences Publication Activity Database

    Tyl, Pavel

    Berlin : Springer, 2011 - (Yonazi, J.; Sedoyeka, E.; Ariwa, E.; El-Qawasmeh, E.), s. 94-103 ISBN 978-3-642-22728-8. ISSN 1865-0929. - (Communications in Computer and Information Science. 171). [ICeND 2011. International Conference on e-Technologies and Networks for Development /1./. Dar Es Salaam (TZ), 03.08.2011-05.08.2011] R&D Projects: GA ČR GAP202/10/0761 Grant ostatní: ČVUT(CZ) SGS 2010/7821 Institutional research plan: CEZ:AV0Z10300504 Keywords : ontology matching * web services composition Subject RIV: IN - Informatics, Computer Science

  9. Matching to gantries for medical synchrotrons

    CERN Document Server

    Benedikt, Michael

    1997-01-01

    Treatment of tumours by hadron-therapy is greatly improved if the patient can be irradiated from different directions. This task is performed by a gantry, i.e. a section of beam line that can be rotated around the patient. The gantry optics have to be designed in such a way that the beam at the patient is independent of the rotation angle. The various matching techniques are briefly reviewed in the light of the current development in medical synchrotrons towards active scanning, which requires a small, high-precision beam spot at the patient. In particular, beam delivery systems with rotators are discussed.

  10. The Evaluation of Ontology Matching versus Text

    OpenAIRE

    Andreea-Diana MIHIS

    2010-01-01

    Lately, the ontologies have become more and more complex, and they are used in different domains. Some of the ontologies are domain independent; some are specific to a domain. In the case of text processing and information retrieval, it is important to identify the corresponding ontology to a specific text. If the ontology is of a great scale, only a part of it may be reflected in the natural language text. This article presents metrics which evaluate the degree in which an ontology matches a...

  11. Matched molecular pair analysis in drug discovery.

    Science.gov (United States)

    Dossetter, Alexander G; Griffen, Edward J; Leach, Andrew G

    2013-08-01

    Multiple parameter optimisation in drug discovery is difficult, but Matched Molecular Pair Analysis (MMPA) can help. Computer algorithms can process data in an unbiased way to yield design rules and suggest better molecules, cutting the number of design cycles. The approach often makes more suggestions than can be processed manually and methods to deal with this are proposed. However, there is a paucity of contextually specific design rules, which would truly make the technique powerful. By combining extracted information from multiple sources there is an opportunity to solve this problem and advance medicinal chemistry in a matter of months rather than years. PMID:23557664

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

  13. Schema Matching in the Semantic Web Environment

    Czech Academy of Sciences Publication Activity Database

    Linková, Zdeňka

    Praha : Ústav informatiky AV ČR, v. v. i. & MATFYZPRESS, 2007 - (Hakl, F.), s. 36-42 ISBN 978-80-7378-019-7. [Doktorandské dny '07 Ústavu informatiky AV ČR, v. v. i.. Malá Úpa (CZ), 17.09.2007-19.09.2007] R&D Projects: GA AV ČR 1ET100300419 Institutional research plan: CEZ:AV0Z10300504 Keywords : schema matching * ontology-based * semantic web

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

  15. Approximate Semantic Matching Over Linked Data Streams

    OpenAIRE

    Qin, Yongrui; Yao, Lina; Sheng, Quan Z.

    2016-01-01

    In the Internet of Things (IoT),data can be generated by all kinds of smart things. In such context, enabling machines to process and understand such data is critical. Semantic Web technologies, such as Linked Data, provide an effective and machine-understandable way to represent IoT data for further processing. It is a challenging issue to match Linked Data streams semantically based on text similarity as text similarity computation is time consuming. In this paper, we present a hashing-base...

  16. 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...... asymptotic results for both the circular and the co-folding version are derived....

  17. Integrated chemical/biochemical sample collection, pre-concentration, and analysis on a digital microfluidic lab-on-a-chip platform

    Science.gov (United States)

    Fair, Richard B.; Khlystov, A.; Srinivasan, Vijay; Pamula, Vamsee K.; Weaver, Kathryn N.

    2004-12-01

    An ideal on-site chemical/biochemical analysis system must be inexpensive, sensitive, fully automated and integrated, reliable, and compatible with a broad range of samples. The advent of digital microfluidic lab-on-a-chip (LoC) technology offers such a detection system due to the advantages in portability, reduction of the volumes of the sample and reagents, faster analysis times, increased automation, low power consumption, compatibility with mass manufacturing, and high throughput. We describe progress towards integrating sample collection onto a digital microfluidic LoC that is a component of a cascade impactor device. The sample collection is performed by impacting airborne particles directly onto the surface of the chip. After the collection phase, the surface of the chip is washed with a micro-droplet of solvent. The droplet will be digitally directed across the impaction surface, dissolving sample constituents. Because of the very small droplet volume used for extraction of the sample from a wide colection area, the resulting solution is realatively concentrated and the analytes can be detected after a very short sampling time (1 min) due to such pre-concentration. After the washing phase, the droplet is mixed with specific reagents that produce colored reaction products. The concentration of the analyte is quantitatively determined by measuring absorption at target wavelengths using a simple light emitting diode and photodiode setup. Specific applications include automatic measurements of major inorganic ions in aerosols, such as sulfate, nitrate and ammonium, with a time resolution of 1 min and a detection limit of 30 nm/m3. We have already demonstrated the detection and quantification of nitroaromatic explosives without integrating the sample collection. Other applications being developed include airborne bioagent detection.

  18. Modelling Galaxy Clustering: Halo Occupation Distribution versus Subhalo Matching

    CERN Document Server

    Guo, Hong; Behroozi, Peter S; Zehavi, Idit; Chuang, Chia-Hsun; Comparat, Johan; Favole, Ginevra; Gottloeber, Stefan; Klypin, Anatoly; Prada, Francisco; Rodriguez-Torres, Sergio A; Weinberg, David H; Yepes, Gustavo

    2015-01-01

    We model the luminosity-dependent projected and redshift-space two-point correlation functions (2PCFs) of the Sloan Digital Sky Survey (SDSS) DR7 Main galaxy sample, using the halo occupation distribution (HOD) model and the subhalo abundance matching (SHAM) model and its extension. All the models are built on the same high-resolution $N$-body simulations. We find that the HOD model generally provides the best performance in reproducing the clustering measurements in both projected and redshift spaces. The SHAM model with the same halo-galaxy relation for central and satellite galaxies (or distinct haloes and subhaloes), when including scatters, has a best-fitting $\\chi^2/\\rm{dof}$ around $2$--$3$. We therefore extend the SHAM model to the subhalo clustering and abundance matching (SCAM) by allowing the central and satellite galaxies to have different galaxy--halo relations. We infer the corresponding halo/subhalo parameters by jointly fitting the galaxy 2PCFs and abundances and consider subhaloes selected ba...

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

  20. 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. PMID:18045007

  1. Theory of fractional order elements based impedance matching networks

    KAUST Repository

    Radwan, Ahmed

    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.

  2. 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. PMID:26656578

  3. The Southampton Cauchy-characteristic matching project

    International Nuclear Information System (INIS)

    The Southampton Numerical Relativity Group have set up a long term project concerned with investigating Cauchy-characteristic matching (CCM) codes in numerical relativity. The CCM approach has two distinct features. Firstly, it dispenses with an outer boundary condition and replaces this with matching conditions at an interface residing in the vacuum between the Cauchy and characteristic regions. A successful CCM code leads to a transparent interface and so avoids the spurious reflections which plague most codes employing outer boundary conditions. Secondly, by employing a compactified coordinate, it proves possible to generate global solutions. This means that gravitational waves can be identified unambiguously at future null infinity. To date, cylindrical codes have been developed which have been checked against the exact solutions of Weber-Wheeler, Safier-Stark-Piran and Xanthopoulos. In addition, a cylindrical code has been constructed for investigating dynamic cosmic strings. Recently a master vacuum axi-symmetric CCM code has been completed which consists of four independent modules comprising an interior Cauchy code, an exterior characteristic code together with injection and extraction codes. The main goal of this work is to construct a 3 dimensional code possessing the characteristic, injection and extraction modules which can be attached to an interior code based on a finite grid. Such a code should lead to the construction of more accurate templates which are needed in the search for gravitational waves. (author)

  4. Lattice Matching with a Quadrupole Missing

    CERN Document Server

    Wanzenberg, R

    2000-01-01

    The lattice for the present design of the TESLA Linear Collider with integrated X-Ray Laser Facility is basically a FODO structure with constant beta-function. There are more than 800 individually powered superconducting quadrupoles to focus the beam in the two main linear accelerators (each with a length of 15 km). For the availability of the beams it is important that a power supply failure or even a magnet failure does not cause a significant down time of the linac. It is demonstrated that the beta-function can be matched with a quadrupole "missing". One part of the main linac (up-to 50 GeV) will be used to accelerate the High Energy Physics beam and the Free Electron Laser drive beam with different accelerating gradients. Therefore the betatron phase advance will be 60 deg. or 90 deg. depending on the beam energy. It is shown that even in that case it is possible to match the lattice simultaneously for both beams with a quadrupole missing.

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

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

  7. Faster fully compressed pattern matching by recompression

    CERN Document Server

    Jeż, Artur

    2011-01-01

    In this paper, a fully compressed pattern matching problem is studied. The compression is represented by straight-line programs (SLPs), i.e. a context-free grammars generating exactly one string; the term fully means that both the pattern and the text are given in the compressed form. A novel technique of dealing with SLPs is introduced and applied: the SLPs are recompressed, so that substrings of the pattern and text are encoded in both SLPs in the same way. To this end, the SLPs are locally decompressed and then recompressed in a uniform way. This technique yields an O((n+m) log M log(n+m) log log(n+m)) algorithm for compressed pattern matching, where n is the size of the compressed representation of the text, similarly m is size of the compressed representation of pattern, while M is the size of the decompressed pattern. Since M <= 2^m, this greatly improves the previously best O(m^2 n) algorithm. Since LZ compression standard reduces to SLP with log(N / n) overhead and in O(n log(N/n)) time, the presen...

  8. Relation based Ontology Matching using Alignment Strategies

    Directory of Open Access Journals (Sweden)

    Mr. S.Vivekanandan,

    2011-04-01

    Full Text Available The set of relation within a knowledge domain will be expressed with a help of Ontology, but data within the knowledge domain get scattered all over its space. To get a most precise result there must be necessary to relate the concepts or keywords within a domain. One of the efficient ways of matching or relating data must be done by implementing ontology within a domain. It aims to make data sharable.Unfortunately, the ontology is widely distributed as well as heterogeneous. The main aim of Ontology matching is to determine the relationship between the concepts and to find the Semantical mappingsbetween two given ontologies. This problem lies at the heart of numerous information processing applications. In order to dilute the problem evolution of Upper ontology have taken place. The upperontology will act as a base for representing concepts in all the domains, the primary objective is to extract or representing the general concepts throughout the domains based on the ontological structure.

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

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

  11. Subhalo abundance matching in $f(R)$ gravity

    CERN Document Server

    He, Jian-Hue; Baugh, Carlton M

    2016-01-01

    Using the liminality N-body simulations, we present the first predictions for galaxy clustering in $f(R)$ gravity using subhalo abundance matching. We find that, for a given galaxy density, even for an $f(R)$ model with $f_{R0}=-10^{-6}$, for which the cold dark matter clustering is essentially indistinguishable from $\\Lambda$CDM, the predicted clustering of galaxies in the $f(R)$ model is much weaker than in $\\Lambda$CDM. The deviation can be as large as $40\\%$ for samples with mean densities $\\sim0.01[{\\rm Mpc}/h]^{-3}$ and $\\sim0.02[{\\rm Mpc}/h]^{-3}$ . This large deviation is testable given the accuracy that future large-scale galaxy surveys aim to achieve. Our result demonstrates that galaxy surveys can yield a stringent test of the theory of General Relativity on cosmological scales, which is comparable to the tests from local astrophysical observations.

  12. 5. Sampling

    International Nuclear Information System (INIS)

    The sampling is described for radionuclide X-ray fluorescence analysis. Aerosols are captured with various filter materials whose properties are summed up in the table. Fine dispersed solid and liquid particles and gaseous admixtures may be captured by bubbling air through a suitable absorption solution. The concentration of small amounts of impurities from large volumes of air is done by adsorbing impurities on surfactants, e.g., activated charcoal, silica gel, etc. Aerosols may be captured using an electrostatic precipitator and aerosol fractions may be separated with a cascade impactor. Water sampling differs by the water source, i.e., ground water, surface water, rain or waste water. Soil samples are taken by probes. (ES)

  13. Recipes Prediction by Matching to K/S Values Based on New Two constant Theory

    Institute of Scientific and Technical Information of China (English)

    HE Guo-xing; XING Huai-zhong; ZHOU Ming-xun

    2006-01-01

    A concept of new two-constant of colorant, both (k/St) and (s/St), is introduced based on the Kubelka-Munk theory.A new two-constant theory for color matching is presented.Basic equations used in matching to K/S values are given in matrix form based on the new two-constant theory.Algorithm for a least-squares match to K/S values of a sample is developed by use of the new two-constant theory.The algorithm is suitable for single-constant theory as well as two-constant theory. The experimental data show that calculating K/S values of disperse dyes based on new two-constant theory are accordant with the measuring ones. The reoipes predicted by new two-constant theory are closer to the actual recipes of the standard sample than the recipes predicted by single-constant theory. The sample according to the recipe predicted by new two-constant theory has smaller color difference against for the standard than the sample according to the recipe predicted by single-constant theory.The results show that the scattering of disperse dyes cannot be negligible, and that the recipes match to textiles colored by disperse dyes should be predicted by using of new two-constant theory.

  14. MULTI-PEAK MATCH INTENSITY RATIO METHOD OF QUANTITATIVE X-RAY DIFFRACTION PHASE ANALYSIS

    Institute of Scientific and Technical Information of China (English)

    G. Chu; Y.F. Cong; H.J. You

    2003-01-01

    A new method for quantitative phase analysis is proposed by using X-ray diffraction multi-peak match intensity ratio. This method can obtain the multi-peak match intensity ratio among each phase in the mixture sample by using all diffraction peak data in the mixture sample X-ray diffraction spectrum and combining the relative intensity distribution data of each phase standard peak in JCPDS card to carry on the least square method regression analysis. It is benefit to improve the precision of quantitative phase analysis that the given single line ratio which is usually adopted is taken the place of the multi-peak match intensity ratio and is used in X-ray diffraction quantitative phase analysis of the mixture sample. By analyzing four-group mixture sample, adopting multi-peak match intensity ratio and X-ray diffraction quantitative phase analysis principle of combining the adiabatic and matrix flushing method, it is tested that the experimental results are identical with theory.

  15. Multi-data reservoir history matching of crosswell seismic, electromagnetics and gravimetry data

    KAUST Repository

    Katterbauer, Klemens

    2014-01-01

    Reservoir engineering has become of prime importance for oil and gas field development projects. With rising complexity, reservoir simulations and history matching have become critical for fine-tuning reservoir production strategies, improved subsurface formation knowledge and forecasting remaining reserves. The sparse spatial sampling of production data has posed a significant challenge for reducing uncertainty of subsurface parameters. Seismic, electromagnetic and gravimetry techniques have found widespread application in enhancing exploration for oil and gas and monitor reservoirs, however these data have been interpreted and analyzed mostly separately rarely utilizing the synergy effects that may be attainable. With the incorporation of multiple data into the reservoir history matching process there has been the request knowing the impact each incorporated observation has on the estimation. We present multi-data ensemble-based history matching framework for the incorporation of multiple data such as seismic, electromagnetics, and gravimetry for improved reservoir history matching and provide an adjointfree ensemble sensitivity method to compute the impact of each observation on the estimated reservoir parameters. The incorporation of all data sets displays the advantages multiple data may provide for enhancing reservoir understanding and matching, with the impact of each data set on the matching improvement being determined by the ensemble sensitivity method.

  16. Muscle damage produced during a simulated badminton match in competitive male players.

    Science.gov (United States)

    Abián, Pablo; Del Coso, Juan; Salinero, Juan José; Gallo-Salazar, César; Areces, Francisco; Ruiz-Vicente, Diana; Lara, Beatriz; Soriano, Lidón; Muñoz, Victor; Lorenzo-Capella, Irma; Abián-Vicén, Javier

    2016-01-01

    The purpose of the study was to assess the occurrence of muscle damage after a simulated badminton match and its influence on physical and haematological parameters. Sixteen competitive male badminton players participated in the study. Before and just after a 45-min simulated badminton match, maximal isometric force and badminton-specific running/movement velocity were measured to assess muscle fatigue. Blood samples were also obtained before and after the match. The badminton match did not affect maximal isometric force or badminton-specific velocity. Blood volume and plasma volume were significantly reduced during the match and consequently haematite, leucocyte, and platelet counts significantly increased. Blood myoglobin and creatine kinase concentrations increased from 26.5 ± 11.6 to 197.3 ± 70.2 µg·L(-1) and from 258.6 ± 192.2 to 466.0 ± 296.5 U·L(-1), respectively. In conclusion, a simulated badminton match modified haematological parameters of whole blood and serum blood that indicate the occurrence of muscle fibre damage. However, the level of muscle damage did not produce decreased muscle performance. PMID:26252887

  17. A surface-matching technique for robot-assisted registration.

    Science.gov (United States)

    Glozman, D; Shoham, M; Fischer, A

    2001-01-01

    Successful implementation of robot-assisted surgery (RAS) requires coherent integration of spatial image data with sensing and actuating devices, each having its own coordinate system. Hence, accurate estimation of the geometric relationships between relevant reference frames, known as registration, is a crucial procedure in all RAS applications. The purpose of this paper is to present a new registration scheme, along with the results of an experimental evaluation of a robot-assisted registration method for RAS applications in orthopedics. The accuracy of the proposed registration is appropriate for specified orthopedic surgical applications such as Total Knee Replacement. The registration method is based on a surface-matching algorithm that does not require marker implants, thereby reducing surgical invasiveness. Points on the bone surface are sampled by the robot, which in turn directs the surgical tool. This technique eliminates additional coordinate transformations to an external device (such as a digitizer), resulting in increased surgical accuracy. The registration technique was tested on an RSPR six-degrees-of-freedom parallel robot specifically designed for medical applications. A six-axis force sensor attached to the robot's moving platform enables fast and accurate acquisition of positions and surface normal directions at sampled points. Sampling with a robot probe was shown to be accurate, fast, and easy to perform. The whole procedure takes about 2 min, with the robot performing most of the registration procedures, leaving the surgeon's hands free. Robotic registration was shown to provide a flawless link between preoperative planning and robotic assistance during surgery. PMID:11892002

  18. The development of fatigue during match-play tennis

    OpenAIRE

    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

  19. An alternative solution for computer controlled tuning and matching of existing NMR probes

    Science.gov (United States)

    Koczor, Bálint; Sedyó, Inez; Rohonczy, János

    2015-10-01

    Tuning and matching of NMR probes is necessary for many fields of NMR application including temperature dependent NMR, thermoporometry and cryoporometry, or when significantly different types of samples are measured in automation using sample changers. Mismatch of the probe is an especially critical issue in the case of high magnetic fields, polar or ionic solvents, or extreme thermal conditions. Careful tuning is particularly important for quantitative NMR measurements. Manual tuning and matching of the NMR probe is not possible in the case of automated or remotely controlled measurements. Spectrometer manufacturers offer modern probes equipped with automatic tuning/matching mechanics, like Bruker ATM™, suitable for these experiments. The disadvantages of probes with built-in ATM™ are the significantly higher price, and the non-detachable and non-portable construction. Computer controlled tuning and matching is highly desirrable in solid state NMR since no industrial solution has been developed yet for MAS NMR probes. We present an alternative solution for computer controlled tuning and matching of existing Bruker probes. Building costs are significantly lower, since only commercially available components and ICs are used.

  20. Matching of Objects Nodal Points Improvement using Optimization

    OpenAIRE

    Maria Luísa Ferreira dos Santos Bastos; João Manuel Ribeiro Silva Tavares

    2006-01-01

    The main objective of this work was to improve a previously developed object matching methodology. This overall methodology includes: a modeling phase; followed by a modal analysis; construction of a matrix that relates both sets of objects points; and a matching phase.The previously implemented matching phase is based on a local search; with this solution the relation between objects nodes (points) are not considered. To overcome this, we implemented a new matching solution, using optimizati...

  1. Growing a Graph Matching from a Handful of Seeds

    OpenAIRE

    Kazemi, Ehsan; Hassani, S. Hamed; Grossglauser, Matthias

    2015-01-01

    In many graph–mining problems, two networks from different domains have to be matched. In the absence of reliable node attributes, graph matching has to rely on only the link structures of the two networks, which amounts to a generalization of the classic graph isomorphism problem. Graph matching has applications in social–network reconciliation and de-anonymization, protein–network alignment in biology, and computer vision. The most scalable graph–matching approaches use ideas from percolat...

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

  3. Pattern-based Ontology Matching and Ontology Alignment Evaluation

    OpenAIRE

    Zamazal, Ondřej

    2006-01-01

    Ontology Matching is one of the hottest topic within the Semantic Web of recent years. There is still ample of space for improvement in terms of performance. Furthermore, current ontology matchers mostly concentrate on simple entity to entity matching. However, matching of whole structures could bring some additional complex relationships. These structures of ontologies can be captured as ontology patterns. The main theme of this thesis is an examination of pattern-based ontology matching enh...

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

  5. Influence of light source and clinical experience on shade matching

    OpenAIRE

    GÁSPÁRIK, CRISTINA; TOFAN, ALINA; CULIC, BOGDAN; BADEA, MÎNDRA; DUDEA, DIANA

    2014-01-01

    Introduction Shade is one of the most important attributes when evaluating the success of a restoration. Several factors can influence the visual shade matching process, and therefore the outcome of the final restoration. Objectives 1. to assess the importance of clinical experience on shade matching accuracy; 2. to assess the influence of two standard light sources on the ability to match shade tabs; 3. to identify the area in a VITA Classical shade guide where matching errors are most likel...

  6. A Bayesian Network Framework for Relational Shape Matching

    OpenAIRE

    Rangarajan, Anand; Coughlan, James; Yuille, Alan

    2003-01-01

    A Bayesian network formulation for relational shape matching is presented. The main advantage of the re- lational shape matching approach is the obviation of the non-rigid spatial mappings used by recent non-rigid matching approaches. The basic variables that need to be estimated in the relational shape matching objective function are the global rotation and scale and the lo- cal displacements and correspondences. The new Bethe free energy approach is used to estimate the pairwise co...

  7. The price elasticity of demand for heroin: matched longitudinal and experimental evidence#

    OpenAIRE

    Olmstead, Todd A.; Alessi, Sheila M.; Kline, Brendan; Pacula, Rosalie Liccardo; Petry, Nancy M.

    2015-01-01

    This paper reports estimates of the price elasticity of demand for heroin based on a newly constructed dataset. The dataset has two matched components concerning the same sample of regular heroin users: longitudinal information about real-world heroin demand (actual price and actual quantity at daily intervals for each heroin user in the sample) and experimental information about laboratory heroin demand (elicited by presenting the same heroin users with scenarios in a laboratory setting). Tw...

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

  9. Phase scan signature matching for linac tuning

    International Nuclear Information System (INIS)

    A relatively simple method for linac tuning has been devised, tested and used on the Alvarez and side coupled linacs. Tank or Module phase is varied over 360 degrees while the phase of signals from strip-line beam monitor is measured. Reference phase is taken from the master oscillator for the linac. Theoretical curves of beam phase versus tank/module phase are matched to the measured curves to determine the tank/module field amplitude and phase, and the input and output betas of the tanks/modules. Early experiments on tanks 4--7 of the Alvarez linac have demonstrated the feasibility of the technique. Recently this method was used for commissioning of the Fermilab upgraded linac

  10. Time Series Analysis Using Geometric Template Matching.

    Science.gov (United States)

    Frank, Jordan; Mannor, Shie; Pineau, Joelle; Precup, Doina

    2013-03-01

    We present a novel framework for analyzing univariate time series data. At the heart of the approach is a versatile algorithm for measuring the similarity of two segments of time series called geometric template matching (GeTeM). First, we use GeTeM to compute a similarity measure for clustering and nearest-neighbor classification. Next, we present a semi-supervised learning algorithm that uses the similarity measure with hierarchical clustering in order to improve classification performance when unlabeled training data are available. Finally, we present a boosting framework called TDEBOOST, which uses an ensemble of GeTeM classifiers. TDEBOOST augments the traditional boosting approach with an additional step in which the features used as inputs to the classifier are adapted at each step to improve the training error. We empirically evaluate the proposed approaches on several datasets, such as accelerometer data collected from wearable sensors and ECG data. PMID:22641699

  11. Dynamic subpattern matching with holographic associative memory

    Science.gov (United States)

    Khan, Javed I.

    1999-01-01

    This paper presents the result of our research on a new associative memory, which unlike any existing neural network based artificial associative memories, can dynamically localize (or focus) its search on any subset of the pattern space. This new ability now makes the power of associative computing available to a new class of pattern matching applications. Application areas which will particularly benefit from this model include (1) detection of small irregular patterns (medical diagnostics), (2) detection of tiny targets, (3) background varying target recognition, (4) visual example based content-based image retrieval, (5) robust adaptive control systems which needs to continue operating with small number of surviving sensors, in the face of post learning loss of sensors.

  12. Perfectly matched layer based multilayer absorbers

    Science.gov (United States)

    Stefaniuk, Tomasz; Stolarek, Marcin; Pastuszczak, Anna; Wróbel, Piotr; Wieciech, Bartosz; Antosiewicz, Tomasz J.; Kotyński, Rafał

    2015-05-01

    Broadband layered absorbers are analysed theoretically and experimentally. A genetic algorithm is used to opti- mize broadband and wide-angle of incidence metal-dielectric layered absorbers. An approximate representation of the perfectly matched layer with a spatially varied absorption strength is discussed. The PML is realised as a stack of uniform and isotropic metamaterial layers with permittivieties and permeabilities given from the effective medium theory. This approximate representation of PML is based on the effective medium theory and we call it an effective medium PML (EM-PML).1 We compare the re ection properties of the layered absorbers to that of a PML material and demonstrate that after neglecting gain and magnetic properties, the absorber remains functional.

  13. On Tree Pattern Matching by Pushdown Automata

    Directory of Open Access Journals (Sweden)

    T. Flouri

    2009-01-01

    Full Text Available Tree pattern matching is an important operation in Computer Science on which a number of tasks such as mechanical theorem proving, term-rewriting, symbolic computation and non-procedural programming languages are based on. Work has begun on a systematic approach to the construction of tree pattern matchers by deterministic pushdown automata which read subject trees in prefix notation. The method is analogous to the construction of string pattern matchers: for given patterns, a non-deterministic pushdown automaton is created and then it is determinised. In this first paper, we present the proposed non-deterministic pushdown automaton which will serve as a basis for the determinisation process, and prove its correctness. 

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

  15. Automatic differentiation and lattice function matching

    International Nuclear Information System (INIS)

    Although popularized in accelerator physics for the calculation of the Taylor coefficients of phase space maps, automatic differentiation is a generic and powerful technique applicable to any problem where fast and accurate evaluation of (usually first order) derivatives is needed. Problems requiring the evaluation of sensitivities with respect to parameters of a model or the minimization of an error function permeate applications in accelerator physics. The advent of languages with built-in support for operator overloading-such as C++-results in greatly simplified syntax and highly maintainable software. To illustrate this point in practice, we apply automatic differentiation techniques to linear lattice function matching, an important problem encountered in the context of designing insertions or transfer lines between accelerators

  16. Matching Pursuits with Random Sequential Subdictionaries

    CERN Document Server

    Moussallam, Manuel; Richard, Gaël

    2011-01-01

    Matching pursuits are a family of greedy algorithms widely used in signal processing to solve sparse approximation and recovery problems. They rely on an atom selection step that requires the calculation of numerous projections, which can be computationally costly for big dictionaries and burdens their competitivity in coding applications. Existing bypassing strategies are based on dictionary subsampling and local optimization. We propose to use a non adaptive random sequence of subdictionaries in the decomposition process, thus browsing a larger dictionary space in a probabilistic fashion with no additional projection cost nor parameter estimation. We present some theoretical justifications based on order statistics and experimental evaluation of behavior for sparse approximation and sparse recovery problems. An application to audio signal compression with multiscale time-frequency dictionaries is presented, along with a discussion of the algorithm's complexity and practical implementations.

  17. Sequence Matching Analysis for Curriculum Development

    Directory of Open Access Journals (Sweden)

    Liem Yenny Bendatu

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

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

  19. Cohomology of quasiperiodic patterns and matching rules

    International Nuclear Information System (INIS)

    Quasiperiodic patterns described by polyhedral 'atomic surfaces' are considered. It is shown that under certain rationality conditions (which coincide with the necessary conditions for the existence of matching rules), the cohomology ring of the continuous hull of such patterns is isomorphic to that of the complement of a torus TN to an arrangement A of thickened affine tori of codimension 2. Explicit computation of Betti numbers for several two-dimensional tilings and for the icosahedral Ammann-Kramer tiling confirms in most cases the results obtained previously by different methods. The cohomology groups of TN/A have a natural structure of a right module over the group ring of the space symmetry group of the pattern and can be decomposed in a direct sum of its irreducible representations. An example of such decomposition is shown for the Ammann-Kramer tiling

  20. Cohomology of quasiperiodic patterns and matching rules

    Energy Technology Data Exchange (ETDEWEB)

    Kalugin, P [Laboratoire de Physique des Solides, Bat 510, 91405 Orsay (France)

    2005-04-08

    Quasiperiodic patterns described by polyhedral 'atomic surfaces' are considered. It is shown that under certain rationality conditions (which coincide with the necessary conditions for the existence of matching rules), the cohomology ring of the continuous hull of such patterns is isomorphic to that of the complement of a torus T{sup N} to an arrangement A of thickened affine tori of codimension 2. Explicit computation of Betti numbers for several two-dimensional tilings and for the icosahedral Ammann-Kramer tiling confirms in most cases the results obtained previously by different methods. The cohomology groups of T{sup N}/A have a natural structure of a right module over the group ring of the space symmetry group of the pattern and can be decomposed in a direct sum of its irreducible representations. An example of such decomposition is shown for the Ammann-Kramer tiling.

  1. Robust point matching via vector field consensus.

    Science.gov (United States)

    Jiayi Ma; Ji Zhao; Jinwen Tian; Yuille, Alan L; Zhuowen Tu

    2014-04-01

    In this paper, we propose an efficient algorithm, called vector field consensus, for establishing robust point correspondences between two sets of points. Our algorithm starts by creating a set of putative correspondences which can contain a very large number of false correspondences, or outliers, in addition to a limited number of true correspondences (inliers). Next, we solve for correspondence by interpolating a vector field between the two point sets, which involves estimating a consensus of inlier points whose matching follows a nonparametric geometrical constraint. We formulate this a maximum a posteriori (MAP) estimation of a Bayesian model with hidden/latent variables indicating whether matches in the putative set are outliers or inliers. We impose nonparametric geometrical constraints on the correspondence, as a prior distribution, using Tikhonov regularizers in a reproducing kernel Hilbert space. MAP estimation is performed by the EM algorithm which by also estimating the variance of the prior model (initialized to a large value) is able to obtain good estimates very quickly (e.g., avoiding many of the local minima inherent in this formulation). We illustrate this method on data sets in 2D and 3D and demonstrate that it is robust to a very large number of outliers (even up to 90%). We also show that in the special case where there is an underlying parametric geometrical model (e.g., the epipolar line constraint) that we obtain better results than standard alternatives like RANSAC if a large number of outliers are present. This suggests a two-stage strategy, where we use our nonparametric model to reduce the size of the putative set and then apply a parametric variant of our approach to estimate the geometric parameters. Our algorithm is computationally efficient and we provide code for others to use it. In addition, our approach is general and can be applied to other problems, such as learning with a badly corrupted training data set. PMID:24808341

  2. Mixed metal vapor phase matching for third-harmonic generation

    Science.gov (United States)

    Bloom, D. M.; Young, J. F.; Harris, S. E.

    1975-01-01

    Phase matching for frequency tripling of 1.06 microns is demonstrated in a homogeneous mixture of sodium and magnesium vapor. The ratio of Mg to Na vapor pressures required for phase matching is 2:1. This ratio is about 1/75 of that required to phase match Na with Xe.

  3. Matching profiles of masked perpetrators: a pilot study

    DEFF Research Database (Denmark)

    Lynnerup, Niels; Bojesen, Sophie; Kuhlman, Michael Bilde

    2010-01-01

    good, possible and no fit. We found a very high true identification rate of 94% using superimposition, i.e. whether a match judged as good was in fact the correct match. The correct exclusion rate was also high, 94%, when using superimposition, i.e. when no match was found this was in fact correct...

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

  5. 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 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. PMID:24668384

  6. A Method for Matching Leadership Mentors and Proteges.

    Science.gov (United States)

    Daresh, John C.; Playko, Marsha A.

    A method for matching leadership mentors with beginning teachers is described in this paper, with emphasis on personality types and psychosocial characteristics. A review of literature on guide matching concludes that research is inconclusive and that matching is often based on availability. Five fundamental assumptions of the personnel matching…

  7. 78 FR 40541 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA)-Match Number 1014

    Science.gov (United States)

    2013-07-05

    ... From the Federal Register Online via the Government Publishing Office SOCIAL SECURITY ADMINISTRATION Privacy Act of 1974, as Amended; Computer Matching Program (SSA)--Match Number 1014 AGENCY: Social... Management and Budget (OMB). The matching program will be effective as indicated below. ADDRESSES:...

  8. Comet coma sample return instrument

    Science.gov (United States)

    Albee, A. L.; Brownlee, Don E.; Burnett, Donald S.; Tsou, Peter; Uesugi, K. T.

    1994-01-01

    The sample collection technology and instrument concept for the Sample of Comet Coma Earth Return Mission (SOCCER) are described. The scientific goals of this Flyby Sample Return are to return to coma dust and volatile samples from a known comet source, which will permit accurate elemental and isotopic measurements for thousands of individual solid particles and volatiles, detailed analysis of the dust structure, morphology, and mineralogy of the intact samples, and identification of the biogenic elements or compounds in the solid and volatile samples. Having these intact samples, morphologic, petrographic, and phase structural features can be determined. Information on dust particle size, shape, and density can be ascertained by analyzing penetration holes and tracks in the capture medium. Time and spatial data of dust capture will provide understanding of the flux dynamics of the coma and the jets. Additional information will include the identification of cosmic ray tracks in the cometary grains, which can provide a particle's process history and perhaps even the age of the comet. The measurements will be made with the same equipment used for studying micrometeorites for decades past; hence, the results can be directly compared without extrapolation or modification. The data will provide a powerful and direct technique for comparing the cometary samples with all known types of meteorites and interplanetary dust. This sample collection system will provide the first sample return from a specifically identified primitive body and will allow, for the first time, a direct method of matching meteoritic materials captured on Earth with known parent bodies.

  9. A Quick and Affine Invariance Matching Method for Oblique Images

    Directory of Open Access Journals (Sweden)

    XIAO Xiongwu

    2015-04-01

    Full Text Available This paper proposed a quick, affine invariance matching method for oblique images. It calculated the initial affine matrix by making full use of the two estimated camera axis orientation parameters of an oblique image, then recovered the oblique image to a rectified image by doing the inverse affine transform, and left over by the SIFT method. We used the nearest neighbor distance ratio(NNDR, normalized cross correlation(NCC measure constraints and consistency check to get the coarse matches, then used RANSAC method to calculate the fundamental matrix and the homography matrix. And we got the matches that they were interior points when calculating the homography matrix, then calculated the average value of the matches' principal direction differences. During the matching process, we got the initial matching features by the nearest neighbor(NN matching strategy, then used the epipolar constrains, homography constrains, NCC measure constrains and consistency check of the initial matches' principal direction differences with the calculated average value of the interior matches' principal direction differences to eliminate false matches. Experiments conducted on three pairs of typical oblique images demonstrate that our method takes about the same time as SIFT to match a pair of oblique images with a plenty of corresponding points distributed evenly and an extremely low mismatching rate.

  10. Citation Matching in Sanskrit Corpora Using Local Alignment

    Science.gov (United States)

    Prasad, Abhinandan S.; Rao, Shrisha

    Citation matching is the problem of finding which citation occurs in a given textual corpus. Most existing citation matching work is done on scientific literature. The goal of this paper is to present methods for performing citation matching on Sanskrit texts. Exact matching and approximate matching are the two methods for performing citation matching. The exact matching method checks for exact occurrence of the citation with respect to the textual corpus. Approximate matching is a fuzzy string-matching method which computes a similarity score between an individual line of the textual corpus and the citation. The Smith-Waterman-Gotoh algorithm for local alignment, which is generally used in bioinformatics, is used here for calculating the similarity score. This similarity score is a measure of the closeness between the text and the citation. The exact- and approximate-matching methods are evaluated and compared. The methods presented can be easily applied to corpora in other Indic languages like Kannada, Tamil, etc. The approximate-matching method can in particular be used in the compilation of critical editions and plagiarism detection in a literary work.

  11. Statistical analysis of the precision of the Match method

    Directory of Open Access Journals (Sweden)

    R. Lehmann

    2005-05-01

    Full Text Available The Match method quantifies chemical ozone loss in the polar stratosphere. The basic idea consists in calculating the forward trajectory of an air parcel that has been probed by an ozone measurement (e.g., by an ozone sonde or satellite and finding a second ozone measurement close to this trajectory. Such an event is called a ''match''. A rate of chemical ozone destruction can be obtained by a statistical analysis of several tens of such match events. Information on the uncertainty of the calculated rate can be inferred from the scatter of the ozone mixing ratio difference (second measurement minus first measurement associated with individual matches. A standard analysis would assume that the errors of these differences are statistically independent. However, this assumption may be violated because different matches can share a common ozone measurement, so that the errors associated with these match events become statistically dependent. Taking this effect into account, we present an analysis of the uncertainty of the final Match result. It has been applied to Match data from the Arctic winters 1995, 1996, 2000, and 2003. For these ozone-sonde Match studies the effect of the error correlation on the uncertainty estimates is rather small: compared to a standard error analysis, the uncertainty estimates increase by 15% on average. However, the effect is more pronounced for typical satellite Match analyses: for an Antarctic satellite Match study (2003, the uncertainty estimates increase by 60% on average.

  12. Multi-image semi-global matching in object space

    Science.gov (United States)

    Bethmann, F.; Luhmann, T.

    2015-05-01

    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.

  13. Emergence of Reading and Writing in Illiterate Adults After Matching-to-Sample Tasks

    Directory of Open Access Journals (Sweden)

    Carmen Silvia Motta Bandini

    2014-04-01

    Full Text Available Reading and writing are behaviors that provide an individual with the opportunity for inclusion in many social environments. Despite the importance of these behaviors, statistical indices show that, in Brazil, 8.6% of the people aged 15-24 are illiterate. The purpose of this manuscript, which is divided into two studies, was to assess the effects of a Portuguese language reading curriculum for simple (Study 1 and complex words (Study 2 in illiterate adults. Four participants took part in each study. In both studies, reading was taught mainly by training dictated words to printed words relations. Overall, there was an increase in the percentage of correct responses in reading and writing tasks when pre-tests and post-tests were compared; results were more consistent in reading tasks. Future studies should continue to investigate procedures with these goals for this population.

  14. Associative Symmetry in the Pigeon after Successive Matching-to-Sample Training

    Science.gov (United States)

    Frank, Andrea J.; Wasserman, Edward A.

    2005-01-01

    If an organism is explicitly taught an A[arrow right]B association, then might it also spontaneously learn the symmetrical B[arrow right]A association? Little evidence attests to such "associative symmetry" in nonhuman animals. We report for the first time a clear case of associative symmetry in the pigeon. Experiment 1 used a successive go/no go…

  15. Acquisition of Matching-to-Sample Performances in Severe Retardation: Learning by Exclusion.

    Science.gov (United States)

    McIlvane, W. J.; Stoddard, T.

    1981-01-01

    Immediate discriminative control by spoken words was examined in a profoundly retarded, mute young man. Procedures suggested a potentially errorless, efficient teaching method for individuals without fundamental language. (Author/SB)

  16. The Set-Up of a Foundation Colorant File for the Purpose of Color-Matching Foundations, With a View to Improving the Current Foundation Color-Matching Process in the Future

    OpenAIRE

    Hedenström, Hanna

    2011-01-01

    The process of color-matching any color product is a process that can be quite complicated and requires great skill from a color analyst. As the name suggests color-matching is the process in which the color of a standard is obtained from a sample through careful inspection and precision in order for the colors to match up. It is a process that can vary in length dependent of the amount of pigments used.  Foundations are a type of liquid emulsion cosmetic and consist of five main pigments; wh...

  17. Stereo Matching of Planar Curves Composed of Time Stamped Points

    Institute of Scientific and Technical Information of China (English)

    Wang Shuwen; Zhang Tianxu

    2006-01-01

    Matching features such as curve segments in stereo images play a very important role in scene reconstruction. In this paper, a stereo matching algorithm for the trajectories composed of time stamped points is proposed. Based on time stamped points, planar curve match measurements are given first, such as time constraint, cross-ratio invariant constraint and epipolar geometry constraint;then, a trajectory matching method is proposed based on epipolar geometry constraint and cross-ratio invariant constraint. In order to match the planar curve segments projected by perspective projection system, the curve start time and end time are selected first to prepare match candidates. Then, the epipolar equation is used to discard the unmatched curve segment candidates. At last, a cross ratio invariant constraint is used to find the most matched curve segments. If their match measurement is higher than the specialized threshold, a candidate with the least cross ratio difference is then selected as the match result; otherwise, no match is found. Unlike the conventional planar curve segments matching algorithm, this paper presents a weakly calibrated binocular stereo vision system which is based on wide baseline. The stamped points are obtained by targets detecting method of flying objects from image sequences.Due to wide baseline, there must exist the projection not in epipolar monotonic order or the curve segments located in very short distance and keeping the epipolar monotonic order. By using the method mentioned above, experiments are made to match planar curve segments not only in epipolar monotonic order but also not in epipolar monotonic order. The results show that the performance of our curve matching algorithm is effective for matching the arc-like planar trajectories composed of time stamped points.

  18. Quality of match for statistical matches used in the 1992 and 2007 LIMEW estimates for the United States

    OpenAIRE

    Masterson, Thomas

    2010-01-01

    The quality of match of four statistical matches used in the LIMEW estimates for the United States for 1992 and 2007 is described. The first match combines the 1992 Survey of Consumer Finances (SCF) with the 1993 March Supplement to the Current Population Survey, or Annual Demographic Supplement (ADS). The second match combines the 1985 American Use of Time Project survey (AUTP) with the 1993 ADS. The third match combines the 2007 SCF with the 2008 March Supplement to the CPS, now called the ...

  19. Line Matching Across Views Based on Multiple Line Matching Across Views Based on Multiple View Stereo

    Institute of Scientific and Technical Information of China (English)

    FU Kang-Ping; SHEN Shu-Han; HU Zhan-Yi

    2014-01-01

    A graph-based multiple view line matching method is proposed based on results of multiple view stereo (MVS) al-gorithms. With the 3D points and their visibility information provided by MVS, point-line correspondences are firstly established through 3D-to-2D re-projection. Each image line detected in different views is described using a 3D point set as well as a unit vector representing its coarse 3D direction. From such a description, pairwise similarity and consistency are evaluated. Then, a graph is constructed to contain all image lines as nodes. To get a unified node distance measure, a spectral graph analysis method is employed. Finally, a modified DBSCAN algorithm is introduced to obtain reliable line matches from the graph. Experiments show that our method is more robust and exhibits better accuracy than the existing methods.

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

    DEFF Research Database (Denmark)

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

    2012-01-01

    Over the recent years, the national databases of STR profiles have grown in size due to the success of forensic DNA analysis in solving crimes. The accumulation of DNA profiles implies that the probability of a random match or near match of two randomly selected DNA profiles in the database...... increases. We analysed 53,295 STR profiles from individuals investigated in relation to crime case investigations at the Department of Forensic Medicine, Faculty of Health Sciences, University of Copenhagen, Denmark. Incomplete STR profiles (437 circa 0.8% of the total), 48 redundant STR profiles from...... other, i.e. 1.3 × 109 comparisons. With these large number of comparisons, it is likely to observe DNA profiles that coincide on many loci, which has concerned some commentators and raised questions about “overstating” the power of DNA evidence. We used the method of Weir [11] and [12] and Curran et al...