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. System for autonomous monitoring of bioagents

    Science.gov (United States)

    Langlois, Richard G.; Milanovich, Fred P.; Colston, Jr, Billy W.; Brown, Steve B.; Masquelier, Don A.; Mariella, Jr., Raymond P.; Venkateswaran, Kodomudi

    2015-06-09

    An autonomous monitoring system for monitoring for bioagents. A collector gathers the air, water, soil, or substance being monitored. A sample preparation means for preparing a sample is operatively connected to the collector. A detector for detecting the bioagents in the sample is operatively connected to the sample preparation means. One embodiment of the present invention includes confirmation means for confirming the bioagents in the sample.

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

  5. EFFICACY OF BIOAGENTS AGAINST CHICKPEA WILT PATHOGEN

    Directory of Open Access Journals (Sweden)

    S.Ranjitha Rani

    2014-11-01

    Full Text Available Chickpea (Cicer arietinum L, wilt caused by Fusarium oxysporum f.sp. ciceri was first reported from India in 1918. ln the recent years, the biological control has received a worldwide attention and is being integrated effectively with other pesticides. The efficacy of two species of fungal bioagents such as Trichoderma viride, Trichodermo harzianum and two sps of bacterial bioagents such as Pseudomonas fluorescens and Bacillus subtilis were evaluated against Fusarium oxysporum f.sp. ciceri in vitro condition using Dual Culture Technique. The highest per cent growth of inhibition of observed Trichoderma harzianum (76.66% followed by Bacillus subtilis (63.14%. The lowest growth inhibition was observed in Pseudomonas fluorescens (53.52%.

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

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

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

  9. Training Intraverbal Naming to Establish Matching-to-Sample Performances.

    Science.gov (United States)

    Santos, Patricia M; Ma, Monica L; Miguel, Caio F

    2015-10-01

    The current study evaluated whether training intraverbal naming would be sufficient to establish visual-visual matching-to-sample (MTS) performances in college students. In the first experiment, we used a multiple-probe design across stimulus sets to assess whether six participants could match arbitrary visual stimuli (AB) after learning to tact their two experimentally defined classes (A' and B') and then intraverbally relate their names (i.e., "A' goes with B'"). All participants matched the stimuli accurately after training, as well as emitted the trained intraverbals. In the second experiment, we used a multiple baseline design across four participants to assess whether the same training would produce bi-directional intraverbals in the form of "B' goes with A'," and MTS performance consistent with symmetry (BA). All participants responded accurately during matching and intraverbal tests. Across both experiments, participants stated the trained intraverbals while performing the matching task. Results showed that MTS performance can be established solely by verbal behavior training. PMID:27606210

  10. Matching-to-sample abstract-concept learning by pigeons.

    Science.gov (United States)

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

    2008-01-01

    Abstract concepts--rules that transcend training stimuli--have been argued to be unique to some species. Pigeons, a focus of much concept-learning research, were tested for learning a matching-to-sample abstract concept. Five pigeons were trained with three cartoon stimuli. Pigeons pecked a sample 10 times and then chose which of two simultaneously presented comparison stimuli matched the sample. After acquisition, abstract-concept learning was tested by presenting novel cartoons on 12 out of 96 trials for 4 consecutive sessions. A cycle of doubling the training set followed by retraining and novel-testing was repeated eight times, increasing the set size from 3 to 768 items. Transfer performance improved from chance (i.e., no abstract-concept learning) to a level equivalent to baseline performance (>80%) and was similar to an equivalent function for same/different abstract-concept learning. Analyses assessed the possibility that item-specific choice strategies accounted for acquisition and transfer performance. These analyses converged to rule out item-specific strategies at all but the smallest set-sizes (3-24 items). Ruling out these possibilities adds to the evidence that pigeons learned the relational abstract concept of matching-to-sample.

  11. Perfect Matchings via Uniform Sampling in Regular Bipartite Graphs

    CERN Document Server

    Goel, Ashish; Khanna, Sanjeev

    2008-01-01

    In this paper we further investigate the well-studied problem of finding a perfect matching in a regular bipartite graph. The first non-trivial algorithm, with running time $O(mn)$, dates back to K\\"{o}nig's work in 1916 (here $m=nd$ is the number of edges in the graph, $2n$ is the number of vertices, and $d$ is the degree of each node). The currently most efficient algorithm takes time $O(m)$, and is due to Cole, Ost, and Schirra. We improve this running time to $O(\\min\\{m, \\frac{n^{2.5}\\ln n}{d}\\})$; this minimum can never be larger than $O(n^{1.75}\\sqrt{\\ln n})$. We obtain this improvement by proving a uniform sampling theorem: if we sample each edge in a $d$-regular bipartite graph independently with a probability $p = O(\\frac{n\\ln n}{d^2})$ then the resulting graph has a perfect matching with high probability. The proof involves a decomposition of the graph into pieces which are guaranteed to have many perfect matchings but do not have any small cuts. We then establish a correspondence between potential ...

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

  13. Matching- and nonmatching-to-sample concept learning in rats using olfactory stimuli.

    Science.gov (United States)

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

    2011-09-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 matching or nonmatching training with 10 exemplars, the contingencies were reversed with five new stimuli such that subjects trained on matching were shifted to nonmatching and vice versa. Following these reversed contingencies, the effects of the original training persisted for many trials with new exemplars. In Experiment 2, 9 rats were trained with matching procedures in an arena that provided for 18 different spatial locations for comparison stimuli. Five subjects were trained with differential reinforcement outcomes and 4 with only one type of reinforcer. Differential outcomes and multiple exemplars facilitated learning, and there was strong evidence for generalization to new stimuli for most rats that acquired several conditional discriminations. Performances with novel samples were generally above chance, but rarely reached the high levels obtained during baseline with well-trained stimulus relations. However, taken together, the data from the two experiments extend previous work, show that rats can learn both match and nonmatch relations with different experimental protocols, and demonstrate generalization to novel sample stimuli.

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

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

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

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

    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.

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

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

    Directory of Open Access Journals (Sweden)

    Sophie Marchal

    Full Text Available 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.

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

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

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

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

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

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

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

  7. Cognitive efficiency on a match to sample task decreases at the onset of puberty in children.

    Science.gov (United States)

    McGivern, Robert F; Andersen, Julie; Byrd, Desiree; Mutter, Kandis L; Reilly, Judy

    2002-10-01

    Electrocortical evidence indicates that a wave of synaptic proliferation occurs in the frontal lobes around the age of puberty onset. To study its potential influence on cognition, we examined 246 children (10-17 years) and 49 young adults (18-22 years) using a match-to-sample type of task to measure reaction times to assess emotionally related information. Based upon the instruction set, subjects made a yes/no decision about the emotion expressed in a face, a word, or a face/word combination presented tachistoscopically for 100 ms. The faces were images of a single individual with a happy, angry, sad or neutral expression. The words were 'happy,' 'angry,' 'sad,' or 'neutral,' In the combined stimulus condition, subjects were asked to decide if the face and word matched for the same emotion. Results showed that compared to the previous year, reaction times were significantly slower for making a correct decision at 11 and 12 years of age in girls and boys, the approximate ages of puberty onset. The peripubertal rise in reaction time declined slowly over the following 2-3 years and stabilized by 15 years of age. Analyses of the performance of 15-17 year olds revealed significantly longer reaction times in females to process both faces and words compared to males. However, this sex difference in late puberty appeared to be transient since it was not present in 18-22 year olds. Given the match-to-sample nature of the task employed, the puberty related increases in reaction time may reflect a relative inefficiency in frontal circuitry prior to the pruning of excess synaptic contacts.

  8. Animal memory: A review of delayed matching-to-sample data.

    Science.gov (United States)

    Lind, Johan; Enquist, Magnus; Ghirlanda, Stefano

    2015-08-01

    We performed a meta-analysis of over 90 data sets from delayed matching-to-sample (DMTS) studies with 25 species (birds, mammals, and bees). In DMTS, a sample stimulus is first presented and then removed. After a delay, two (or more) comparison stimuli are presented, and the subject is rewarded for choosing the one matching the sample. We used data on performance vs. delay length to estimate two parameters informative of working memory abilities: the maximum performance possible with no delay (comparison stimuli presented as soon as the sample is removed), and the rate of performance decay as the delay is lengthened (related to memory span). We conclude that there is little evidence that zero-delay performance varies between these species. There is evidence that pigeons do not perform as well as mammals at longer delay intervals. Pigeons, however, are the only extensively studied bird, and we cannot exclude that other birds may be able to bridge as long a delay as mammals. Extensive training may improve memory, although the data are open to other interpretations. Overall, DMTS studies suggest memory spans ranging from a few seconds to several minutes. We suggest that observations of animals exhibiting much longer memory spans (days to months) can be explained in terms of specialized memory systems that deal with specific, biologically significant information, such as food caches. Events that do not trigger these systems, on the other hand, appear to be remembered for only a short time. This article is part of a Special Issue entitled: In Honor of Jerry Hogan.

  9. Effects of differential reinforcement expectancies on successive matching-to-sample performance in pigeons.

    Science.gov (United States)

    DeLong, R E; Wasserman, E A

    1981-10-01

    A series of experiments employed a symbolic variant of Konorski's delayed successive matching-to-sample task in order to determine whether differential reinforcement expectancies affect discriminative responding. One of two sample stimuli (S1 or S2) was followed, after a delay (0, 5, or 10 sec), by one of two test stimuli (T1 or T2). Pigeons' key pecking during test periods could produce food only on S1-T1 and S2-T2 (positive) trials; nonreinforcement invariably occurred on S1-T2 and S2-T1 (negative) trials. Differential reinforcement was scheduled by following the two positive trial sequences with different probabilities of reinforcement (.2 and 1.0); nondifferential reinforcement was scheduled by following the two positive trial sequences with a single, intermediate probability of reinforcement. (.6). Subjects given differential reinforcement acquired the conditional discriminaton more rapidly and reached higher terminal levels of performance than nondifferential controls (Experiment 1). Moreover, the magnitude of these differences increased as the delay between sample and test stimuli was lengthened. Reversing the probabilities of reinforcement in the differential problem produced a substantial and durable disruption of conditional discrimination performance (Experiment 2). The same general pattern of results was obtained when differential sample key pecking was eliminated (Experiment 3). These results can be parsimoniously interpreted by postulating the existence of learned reinforcement expectancies, and they detract from the merits of trace theory as a complete account of animal memory.

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

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

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

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

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

  15. A novel spatial Delayed Non-Match to Sample (DNMS) task in the Göttingen minipig

    DEFF Research Database (Denmark)

    Nielsen, Thomas Rune; Kornum, Birgitte Rahbek; Moustgaard, Anette;

    2009-01-01

    . The present study is the first study to evaluate the pig's ability to learn the Delayed Non-Match to Sample (DNMS) task. The pigs were trained in a maze on a spatial version of the DNMS task. Initially, the pigs were trained with a 60s delay interval between sample and test phases, and we found that the pigs...

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

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

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

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

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

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

  2. Effect of fungicides and bioagents on number of microorganisms in soil and yield of soybean (Glycine max

    Directory of Open Access Journals (Sweden)

    GAURAV MISHRA

    2014-07-01

    Full Text Available Mishra G, Kumar N, Giri K, Pandey S, Kumar R. 2014. Effect of fungicides and bioagents on number of microorganisms in soil and yield of soybean (Glycine max. Nusantara Bioscience 6: 45-48. In field experiments, the effect of selected fungicides and bioagents on number of soil microorganisms and yield of soybean (Glycine max L. Merill was investigated. The results showed that some of the crop protections preparations applied in the experiment (as seed dressing increased the populations of the examined microorganisms after the harvest of crops. Maximum counts of bacteria were recorded with Thiomethaxam at 3 g kg-1 while Pseudomonas at 3 g kg-1 showed the highest population of fungi, Actinomycetes, B. japonicum, PSB and Pseudomonas. The highest straw and grain yields of 3241.6 and 1439.4 kg ha-1, respectively, were recorded with Pseudomonas at 3 g kg-1.

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

    2011-01-01

    new images that share the same multi-point statistics as a given training image. The FMM proceeds by iteratively updating voxel values of an image until the frequency of patterns in the image matches the frequency of patterns in the training image; making the resulting image statistically...

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

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

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

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

  8. Optical multiband surface photometry of a sample of Seyfert galaxies. I. Large-scale morphology and local environment analysis of matched Seyfert and inactive galaxy samples

    CERN Document Server

    Slavcheva-Mihova, L; 10.1051/0004-6361/200913243

    2010-01-01

    Parallel analysis of the large-scale morphology and local environment of matched active and control galaxy samples plays an important role in studies of the fueling of active galactic nuclei. We carry out a detailed morphological characterization of a sample of 35 Seyfert galaxies and a matched sample of inactive galaxies in order to compare the evidence of non-axisymmetric perturbation of the potential and, in the second part of this paper, to be able to perform a multicomponent photometric decomposition of the Seyfert galaxies. We constructed contour maps, BVRcIc profiles of the surface brightness, ellipticity, and position angle, as well as colour index profiles. We further used colour index images, residual images, and structure maps, which helped clarify the morphology of the galaxies. We studied the presence of close companions using literature data. By straightening out the morphological status of some of the objects, we derived an improved morphological classification and built a solid basis for a fur...

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

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

    DEFF Research Database (Denmark)

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

    2004-01-01

    quality. The most frequently isolated Fusarium spp. from all samples were F avenaceum, E poae, F culmorum and E tricinctum. Other important toxigenic Fusarium spp. isolated were F graminearum and E equiseti. The infection levels of F graminearum and F culmorunt were significantly higher in the samples......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 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...

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

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

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

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

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

  16. Private schooling and admission to medicine: a case study using matched samples and causal mediation analysis

    OpenAIRE

    Houston, Muir; Osborne, Michael; Rimmer, Russell

    2015-01-01

    Background Are applicants from private schools advantaged in gaining entry to degrees in medicine? This is of international significance and there is continuing research in a range of nations including the USA, the UK, other English-speaking nations and EU countries. Our purpose is to seek causal explanations using a quantitative approach. Methods We took as a case study admission to medicine in the UK and drew samples of those who attended private schools and those who did not, with sample m...

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

  18. Comparison of 2 modifications of the twin-block appliance in matched Class II samples.

    Science.gov (United States)

    Parkin, N A; McKeown, H F; Sandler, P J

    2001-06-01

    The purpose of this study was to compare the skeletal and dental changes contributing to Class II correction with 2 modifications of the Twin-block appliance: Twin-block appliances that use a labial bow (TB1) and Twin-block appliances that incorporate high-pull headgear and torquing spurs on the maxillary central incisors (TB2). After pretreatment equivalence was established, a total of 36 consecutively treated patients with the TB1 modification were compared with 27 patients treated with the TB2 modification. Both samples were treated in the same hospital department and the same technician made all the appliances. The cephalostat, digitizing package, and statistical methods were common to both groups. The results demonstrated that the addition of headgear to the appliance resulted in effective vertical and sagittal control of the maxillary complex and thus maximized the Class II skeletal correction in the TB2 sample. Use of the torquing springs resulted in less retroclination of the maxillary incisors in the TB2 sample when compared with the TB1 sample; however, this difference did not reach the level of statistical significance.

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

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

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

  2. A novel delayed non-match to sample object recognition task that allows simultaneous in vivo microdialysis.

    Science.gov (United States)

    Ihalainen, Jouni; Sarajärvi, Timo; Kemppainen, Susanna; Keski-Rahkonen, Pekka; Lehtonen, Marko; Tanila, Heikki

    2010-06-15

    We present a modification of the widely used delayed non-match to sample (DNMS) paradigm for assessment of object recognition memory that can be combined with simultaneous in vivo microdialysis. The present study provides evidence that hippocampal ACh release increases from baseline during active exploration of the test environment and an empty test board, but a specific further increase is seen during the recognition memory task performance. This novel experimental model offers a good tool to study the impact of selective lesions or pharmacological manipulation simultaneously on neurotransmitter levels and memory task performance.

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

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

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

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

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

  8. Matching-to-sample performance is better analyzed in terms of a four-term contingency than in terms of a three-term contingency.

    Science.gov (United States)

    Jones, Brent M; Elliffe, Douglas M

    2013-07-01

    Four pigeons performed a simultaneous matching-to-sample (MTS) task involving two samples and two comparisons that differed in their pixel density and luminance. After a long history of reinforcers for correct responses after both samples, 15 conditions arranged either continuous reinforcement of correct responses after Sample 1 and extinction for all responses after Sample 2, or vice versa. The sample after which correct responses were reinforced alternated across successive conditions. The disparity between the samples and the disparity between the comparisons were varied independently across conditions in a quasifactorial design. Contrary to predictions of extant quantitative models, which assume that MTS tasks involve two 3-term contingencies of reinforcement, matching accuracies were not at chance levels in these conditions, comparison-selection ratios differed after the two samples, and effects on matching accuracies of both sample disparity and comparison disparity were observed. These results were, however, consistent with ordinal and sometimes quantitative predictions of Jones' (2003) theory of stimulus and reinforcement effects in MTS tasks. This theory asserts that MTS tasks involve four-term contingencies of reinforcement and that any tendency to select one comparison more often than the other over a set of trials reflects meaningful differences between comparison-discrimination accuracies after the two samples. PMID:23728927

  9. Matching-to-sample performance is better analyzed in terms of a four-term contingency than in terms of a three-term contingency.

    Science.gov (United States)

    Jones, Brent M; Elliffe, Douglas M

    2013-07-01

    Four pigeons performed a simultaneous matching-to-sample (MTS) task involving two samples and two comparisons that differed in their pixel density and luminance. After a long history of reinforcers for correct responses after both samples, 15 conditions arranged either continuous reinforcement of correct responses after Sample 1 and extinction for all responses after Sample 2, or vice versa. The sample after which correct responses were reinforced alternated across successive conditions. The disparity between the samples and the disparity between the comparisons were varied independently across conditions in a quasifactorial design. Contrary to predictions of extant quantitative models, which assume that MTS tasks involve two 3-term contingencies of reinforcement, matching accuracies were not at chance levels in these conditions, comparison-selection ratios differed after the two samples, and effects on matching accuracies of both sample disparity and comparison disparity were observed. These results were, however, consistent with ordinal and sometimes quantitative predictions of Jones' (2003) theory of stimulus and reinforcement effects in MTS tasks. This theory asserts that MTS tasks involve four-term contingencies of reinforcement and that any tendency to select one comparison more often than the other over a set of trials reflects meaningful differences between comparison-discrimination accuracies after the two samples.

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

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

  12. Matching theory

    CERN Document Server

    Plummer, MD

    1986-01-01

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

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

  14. Information in small neuronal ensemble activity in the hippocampal CA1 during delayed non-matching to sample performance in rats

    Directory of Open Access Journals (Sweden)

    Takahashi Susumu

    2009-09-01

    Full Text Available Abstract Background The matrix-like organization of the hippocampus, with its several inputs and outputs, has given rise to several theories related to hippocampal information processing. Single-cell electrophysiological studies and studies of lesions or genetically altered animals using recognition memory tasks such as delayed non-matching-to-sample (DNMS tasks support the theories. However, a complete understanding of hippocampal function necessitates knowledge of the encoding of information by multiple neurons in a single trial. The role of neuronal ensembles in the hippocampal CA1 for a DNMS task was assessed quantitatively in this study using multi-neuronal recordings and an artificial neural network classifier as a decoder. Results The activity of small neuronal ensembles (6-18 cells over brief time intervals (2-50 ms contains accurate information specifically related to the matching/non-matching of continuously presented stimuli (stimulus comparison. The accuracy of the combination of neurons pooled over all the ensembles was markedly lower than those of the ensembles over all examined time intervals. Conclusion The results show that the spatiotemporal patterns of spiking activity among cells in the small neuronal ensemble contain much information that is specifically useful for the stimulus comparison. Small neuronal networks in the hippocampal CA1 might therefore act as a comparator during recognition memory tasks.

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

    Institute of Scientific and Technical Information of China (English)

    袁淼; 王鑫

    2015-01-01

    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.%针对DCM(Dual Correlation Mining)框架匹配特殊模式集时查准率低下的缺陷,借鉴机器学习领域中的bagging方法,提出一种基于抽样的Deep Web模式匹配框架。该框架随机在模式集中抽取多个子模式集,分别对子模式集进行复杂匹配,集成各个子模式集的匹配结果,在整体上提高匹配的查准率。分析与实验证明该框架在处理特殊模式集时,平均能提高查准率41.2%。

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

  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

    OpenAIRE

    KATHERINE J. HOOT; T. F. McLaughlin; 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...

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

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

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

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

    Science.gov (United States)

    Chen, Xi; Deane, Natasha G; Lewis, Keeli B; Li, Jiang; Zhu, Jing; Washington, M Kay; Beauchamp, R Daniel

    2016-01-01

    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. PMID:27176004

  2. Functional connectivity between Layer 2/3 and Layer 5 neurons in prefrontal cortex of nonhuman primates during a delayed match-to-sample task.

    Science.gov (United States)

    Song, Dong; Opris, Ioan; Chan, Rosa H M; Marmarelis, Vasilis Z; Hampson, Robert E; Deadwyler, Sam A; Berger, Theodore W

    2012-01-01

    The prefrontal cortex (PFC) has been postulated to play critical roles in cognitive control and the formation of long-term memories. To gain insights into the neurobiological mechanism of such high-order cognitive functions, it is important to understand the input-output transformational properties of the PFC micro-circuitry. In this study, we identify the functional connectivity between the Layer 2/3 (input) neurons and the Layer 5 (output) neurons using a previously developed generalized Volterra model (GVM). Input-output spike trains are recorded from the PFCs of nonhuman primates performing a memory-dependent delayed match-to-sample task with a customized conformal ceramic multi-electrode array. The GVM describes how the input spike trains are transformed into the output spike trains by the PFC micro-circuitry and represents the transformation in the form of Volterra kernels. Results show that Layer 2/3 neurons have strong and transient facilitatory effects on the firings of Layer 5 neurons. The magnitude and temporal range of the input-output nonlinear dynamics are strikingly different from those of the hippocampal CA3-CA1. This form of functional connectivity may have important implications to understanding the computational principle of the PFC.

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

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

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

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

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

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

  9. 疑难配血中混合抗体鉴定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.

  10. Bioagents and Commercial Algae Products as Integrated Biocide Treatments for Controlling Root Rot Diseases of Some Vegetables under Protected Cultivation System

    Directory of Open Access Journals (Sweden)

    Mokhtar M. Abdel-Kader

    2013-01-01

    Full Text Available Integrated commercial blue-green algae extracts and bioagents treatments against vegetables root rot incidence when used as soil drench under greenhouse and plastic house conditions were evaluated. All applied treatments reduced significantly root rot incidence at both pre- and postemergence growth stages of cucumber, cantaloupe, tomato, and pepper plants compared with untreated check control. In pot experiment, the obtained results showed that treatments of Trichoderma harzianum or Bacillus subtilis either alone or combined with commercial algae extracts were significantly superior for reducing root rot disease for two tested vegetable plants compared with the other tested treatments as well as control. It is also observed that rising concentrations of either algae products, Oligo-X or Weed-Max, were reflected in more disease reduction. Promising treatments for controlling root rot disease incidence were applied under plastic houses conditions. As for field trails carried out under plastic houses conditions at different locations, the obtained results revealed that the applied combined treatments significantly reduced root rot incidence compared with fungicide and check control treatments. At all locations it was observed that Weed-Max (2 g/L + Bacillus subtilis significantly reduced disease incidence of grown vegetables compared with Oligo-X (2 mL/L + Trichoderma harzianum treatments. An obvious yield increase in all treatments was significantly higher than in the control. Also, the harvested yield in applied combined treatments at all locations was significantly higher than that in the fungicide and control treatments.

  11. Sampling

    CERN Document Server

    Thompson, Steven K

    2012-01-01

    Praise for the Second Edition "This book has never had a competitor. It is the only book that takes a broad approach to sampling . . . any good personal statistics library should include a copy of this book." —Technometrics "Well-written . . . an excellent book on an important subject. Highly recommended." —Choice "An ideal reference for scientific researchers and other professionals who use sampling." —Zentralblatt Math Features new developments in the field combined with all aspects of obtaining, interpreting, and using sample data Sampling provides an up-to-date treat

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

  13. 基于随机采样一致性算法的平面匹配方法%Matching method of plane image based on random sample consensus algorithm

    Institute of Scientific and Technical Information of China (English)

    周波; 杨剑; 王东平

    2011-01-01

    Concerning the problems of large amount of calculation and poor accuracy of traditional matching method of plane image target point, a fast and highly precise matching method of plane image target point was proposed based on RANdom SAmple Consensus (RANSAC) random sampling algorithm.Firstly, based on the dual conic model, the ellipse's gradient vector was estimated by exploiting directly the raw gradient information in the neighborhood of an ellipse's boundary.Secondly, the ellipse's parameters and centers with the gradient vector field were matched.At last, the points in image with the target point in calibration board were matched with the help of RANSAC random sampling algorithm.The experimental results verify the method is simple and has a high degree of accuracy.%针对传统的平面图像标定点匹配算法计算量大、准确性不高等问题,提出一种基于随机采样一致性(RANSAC)算法的快速高精度的平面图像标定点匹配方法.该方法首先基于双圆锥曲线模型,借助于椭圆边缘点附近的梯度信息求取椭圆的切线,由切线集合拟合出椭圆参数,并利用这些参数计算出椭圆圆心,即图像上的标志点;然后用RANSAC随机采样算法对标定板上的点和图像上的点进行匹配.实验验证该方法实现起来简单并且有较高的准确率.

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

  15. Hierarchical model of matching

    Science.gov (United States)

    Pedrycz, Witold; Roventa, Eugene

    1992-01-01

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

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

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

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

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

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

  1. Optimal Packed String Matching

    DEFF Research Database (Denmark)

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

    2011-01-01

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

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

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

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

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

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

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

  9. 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, Paul Thomas [Univ. of California, Davis, CA (United States)

    2004-09-01

    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.

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

  11. MATCH PLAY, SOAP HOPE.

    Science.gov (United States)

    Rigby, Perry G; Gururaja, Ramnarayan Paragi; Hilton, Charles

    2015-01-01

    The Medical Education Commission (MEC) has published Graduate Medical Education (GME) data since 1997, including the National Residency Matching Program (NRMP) and the Supplemental Offer and Acceptance Program (SOAP), and totals all GME in Louisiana for annual publication. The NRMP provides the quotas and filled positions by institution. Following the NRMP, SOAP attempts to place unmatched candidates with slots that are unfilled. The NRMP Fellowship match also comes close to filling quotas and has a significant SOAP. Thus, an accurate number of total filled positions is best obtained in July of the same match year. All GME programs in Louisiana are represented for 2014, and the number trend 2005 to 2014 shows that the only dip was post-Katrina in 2005-2006. The March match after SOAP 2014 is at the peak for both senior medical students and post graduate year one (PGY-1) residents. A significant and similar number stay in Louisiana GME institutions after graduation. Also noteworthy is that a lower percentage are staying in state, due to increased enrollment in all Louisiana medical schools. PMID:27159458

  12. Derivatives of Matching.

    Science.gov (United States)

    Herrnstein, R. J.

    1979-01-01

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

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

  16. n! matchings, n! posets

    CERN Document Server

    Claesson, Anders

    2010-01-01

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

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

  18. Matchings on infinite graphs

    CERN Document Server

    Bordenave, Charles; Salez, Justin

    2011-01-01

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

  19. Resurgence Matches Quantization

    CERN Document Server

    Couso-Santamaría, Ricardo; Schiappa, Ricardo

    2016-01-01

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

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

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

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

  3. Apfel's excellent match

    Science.gov (United States)

    1997-01-01

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

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

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

  6. Spatial competition with intermediated matching

    NARCIS (Netherlands)

    van Raalte, C.L.J.P.; Webers, H.M.

    1995-01-01

    This paper analyzes the spatial competition in commission fees between two match makers. These match makers serve as middlemen between buyers and sellers who are located uniformly on a circle. The profits of the match makers are determined by their respective market sizes. A limited willingness to p

  7. Quantum image matching

    Science.gov (United States)

    Jiang, Nan; Dang, Yijie; Wang, Jian

    2016-09-01

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

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

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

  10. Expression profiling of 519 kinase genes in matched malignant peripheral nerve sheath tumor/plexiform neurofibroma samples is discriminatory and identifies mitotic regulators BUB1B, PBK and NEK2 as overexpressed with transformation.

    Science.gov (United States)

    Stricker, Thomas P; Henriksen, Kammi J; Tonsgard, James H; Montag, Anthony G; Krausz, Thomas N; Pytel, Peter

    2013-07-01

    About 50% of all malignant peripheral nerve sheath tumors (MPNSTs) arise as neurofibromatosis type 1 associated lesions. In those patients malignant peripheral nerve sheath tumors are thought to arise through malignant transformation of a preexisting plexiform neurofibroma. The molecular changes associated with this transformation are still poorly understood. We sought to test the hypothesis that dysregulation of expression of kinases contributes to this malignant transformation. We analyzed expression of all 519 kinase genes in the human genome using the nanostring nCounter system. Twelve cases of malignant peripheral nerve sheath tumor arising in a background of preexisting plexiform neurofibroma were included. Both components were separately sampled. Statistical analysis compared global changes in expression levels as well as changes observed in the pairwise comparison of samples taken from the same surgical specimen. Immunohistochemical studies were performed on tissue array slides to confirm expression of selected proteins. The expression pattern of kinase genes can separate malignant peripheral nerve sheath tumors and preexisting plexiform neurofibromas. The majority of kinase genes is downregulated rather than overexpressed with malignant transformation. The patterns of expression changes are complex without simple recurring alteration. Pathway analysis demonstrates that differentially expressed kinases are enriched for kinases involved in the direct regulation of mitosis, and several of these show increased expression in malignant peripheral nerve sheath tumors. Immunohistochemical studies for the mitotic regulators BUB1B, PBK and NEK2 confirm higher expression levels at the protein level. These results suggest that the malignant transformation of plexiform neurofibroma is associated with distinct changes in the expression of kinase genes. The patterns of these changes are complex and heterogeneous. There is no single unifying alteration. Kinases involved

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

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

  13. Statistical methods for history matching

    DEFF Research Database (Denmark)

    Johansen, Kent

    Denne afhandling beskriver statistiske metoder til history matching af olieproduktion. History matching er en vigtig del af driften af et oliefelt og er ofte forbundet med problemer relateret til kompleksiteten af reservoiret og selve størrelsen af reservoirsimuleringsmodellen. Begrebet history m...... history matching metode. Den foreslåede metode forsøger at forbedre konvergensen af traditionel probability perturbation ved at inkludere kvalitativ gradient information....

  14. Multisided matching games with complementarities

    OpenAIRE

    Katerina Sherstyuk

    1999-01-01

    The paper considers multisided matching games with transfereable utility using the approach of cooperative game theory. Stable matchings are shown to exist when characteristic functions are supermodular, i.e., agents' abilities to contribute to the value of a coalition are complementary across types. We analyze the structure of the core of supermodular matching games and suggest an algorithm for constructing its extreme payoff vectors.

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

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

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

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

  19. Matching Games with Additive Externalities

    DEFF Research Database (Denmark)

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

    2012-01-01

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

  20. Audiovisual Matching in Speech and Nonspeech Sounds: A Neurodynamical Model

    Science.gov (United States)

    Loh, Marco; Schmid, Gabriele; Deco, Gustavo; Ziegler, Wolfram

    2010-01-01

    Audiovisual speech perception provides an opportunity to investigate the mechanisms underlying multimodal processing. By using nonspeech stimuli, it is possible to investigate the degree to which audiovisual processing is specific to the speech domain. It has been shown in a match-to-sample design that matching across modalities is more difficult…

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

  2. Maximum Matchings via Glauber Dynamics

    CERN Document Server

    Jindal, Anant; Pal, Manjish

    2011-01-01

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

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

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

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

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

  8. Improved bounds for stochastic matching

    CERN Document Server

    Li, Jian

    2010-01-01

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

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

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

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

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

  13. An Efficient Pattern Matching Algorithm

    Science.gov (United States)

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

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

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

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

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

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

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

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

  20. Block Matching for Object Tracking

    Energy Technology Data Exchange (ETDEWEB)

    Gyaourova, A; Kamath, C; Cheung, S

    2003-10-13

    Models which describe road traffic patterns can be helpful in detection and/or prevention of uncommon and dangerous situations. Such models can be built by the use of motion detection algorithms applied to video data. Block matching is a standard technique for encoding motion in video compression algorithms. We explored the capabilities of the block matching algorithm when applied for object tracking. The goal of our experiments is two-fold: (1) to explore the abilities of the block matching algorithm on low resolution and low frame rate video and (2) to improve the motion detection performance by the use of different search techniques during the process of block matching. Our experiments showed that the block matching algorithm yields good object tracking results and can be used with high success on low resolution and low frame rate video data. We observed that different searching methods have small effect on the final results. In addition, we proposed a technique based on frame history, which successfully overcame false motion caused by small camera movements.

  1. Approximating Graphic TSP by Matchings

    CERN Document Server

    Mömke, Tobias

    2011-01-01

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

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

  3. Induced optical metric in the non-impedance-matched media

    Science.gov (United States)

    Mousavi, S. A.; Roknizadeh, R.; Sahebdivan, S.

    2016-11-01

    In non-magnetic anisotropic media, the behavior of electromagnetic waves depends on the polarization and direction of the incident light. Therefore, to tame the unwanted wave responses such as polarization dependent reflections, the artificial impedance-matched media are suggested to be used in optical devices like invisibility cloak or super lenses. Nevertheless, developing the impedance-matched media is far from trivial in practice. In this paper, we are comparing the samples of both impedance-matched and non-impedance-matched (non-magnetic) media regarding their electromagnetic response in constructing a well-defined optical metric. In the case of similar anisotropic patterns, we show that the optical metric in an impedance-matched medium for unpolarized light is the same as the optical metric of an electrical birefringent medium when the extraordinary mode is concerned. By comparing the eikonal equation in an empty curved space-time and its counterparts in the medium, we have shown that a non-impedance-matched medium can resemble an optical metric for a particular polarization. As an example of non-impedance-matched materials, we are studying a medium with varying optical axis profile. We show that such a medium can be an alternative to impedance-matched materials in various optical devices.

  4. Local Search Approaches in Stable Matching Problems

    Directory of Open Access Journals (Sweden)

    Toby Walsh

    2013-10-01

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

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

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

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

  8. Online matching on a line

    NARCIS (Netherlands)

    Fuchs, Bernard; Hochstättler, Winfried; Kern, Walter

    2005-01-01

    Given a set S c R of points on the line, we consider the task of matching a sequence (r1,r2,…) of requests in R to points in S. It has been conjectured [Online Algorithms: The State of the Art, Lecture Notes in Computer Science, Vol. 1442, Springer, Berlin, 1998, pp. 268–280] that there exists a 9-c

  9. Towards optimal packed string matching

    DEFF Research Database (Denmark)

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

    2014-01-01

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

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

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

  12. Role model and prototype matching

    DEFF Research Database (Denmark)

    Lykkegaard, Eva; Ulriksen, Lars

    2016-01-01

    Previous research has found that young people’s prototypes of science students and scientists affect their inclination to choose tertiary STEM programs (Science, Technology, Engineering and Mathematics). Consequently, many recruitment initiatives include role models to challenge these prototypes....... The present study followed 15 STEM-oriented upper-secondary school students from university-distant backgrounds during and after their participation in an 18-months long university-based recruitment and outreach project involving tertiary STEM students as role models. The analysis focusses on how the students......’ meetings with the role models affected their thoughts concerning STEM students and attending university. The regular self-to-prototype matching process was shown in real-life role-models meetings to be extended to a more complex three-way matching process between students’ self-perceptions, prototype...

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

  14. Monetary Exchange with Multilateral Matching

    DEFF Research Database (Denmark)

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

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

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

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

  17. Applications of the Dirichlet distribution to forensic match probabilities.

    Science.gov (United States)

    Lange, K

    1995-01-01

    The Dirichlet distribution provides a convenient conjugate prior for Bayesian analyses involving multinomial proportions. In particular, allele frequency estimation can be carried out with a Dirichlet prior. If data from several distinct populations are available, then the parameters characterizing the Dirichlet prior can be estimated by maximum likelihood and then used for allele frequency estimation in each of the separate populations. This empirical Bayes procedure tends to moderate extreme multinomial estimates based on sample proportions. The Dirichlet distribution can also be employed to model the contributions from different ancestral populations in computing forensic match probabilities. If the ancestral populations are in genetic equilibrium, then the product rule for computing match probabilities is valid conditional on the ancestral contributions to a typical person of the reference population. This fact facilitates computation of match probabilities and tight upper bounds to match probabilities.

  18. Coarse-to-fine region selection and matching

    KAUST Repository

    Yang, Yanchao

    2015-10-15

    We present a new approach to wide baseline matching. We propose to use a hierarchical decomposition of the image domain and coarse-to-fine selection of regions to match. In contrast to interest point matching methods, which sample salient regions to reduce the cost of comparing all regions in two images, our method eliminates regions systematically to achieve efficiency. One advantage of our approach is that it is not restricted to covariant salient regions, which is too restrictive under large viewpoint and leads to few corresponding regions. Affine invariant matching of regions in the hierarchy is achieved efficiently by a coarse-to-fine search of the affine space. Experiments on two benchmark datasets shows that our method finds more correct correspondence of the image (with fewer false alarms) than other wide baseline methods on large viewpoint change. © 2015 IEEE.

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

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

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

  2. Assessing Risk in Chemical Plant with Pattern Matching

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    This paper discusses potential application of fuzzy set theory, more specifically, pattern matching, in assessing risk in chemical plants. Risk factors have been evaluated using linguistic representations of the quantity of the hazardous substance involved, its frequency of interaction with the environment, severity of its impact and the uncertainty involved in its detection in advance. For each linguistic value there is a corresponding membership function ranging over a universe of discourse. The risk scenario created by a hazard/hazardous situation having highest degree of featural value is taken as the known pattern. Each sample pattern of hazard/hazardous situation with their known featural values is then matched with the known pattern. The concept of multifeature pattern matching based on fuzzy logic is used to derive the rank ordering of process hazards. In multifeature pattern recognition/matching, a sample pattern is compared to a number of known data patterns or a known pattern is compared to a number of sample data patterns. The process assesses which known pattern resembles most closely data sample using Wang's approaching degree method. A methodology has been developed and the same has been exemplified by presenting a case example with a limited number of hazards.

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

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

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

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

  7. Matching conditions on capillary ripples

    Energy Technology Data Exchange (ETDEWEB)

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

    2001-12-01

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

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

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

  10. Spot the match – wildlife photo-identification using information theory

    Directory of Open Access Journals (Sweden)

    Meekan Mark G

    2007-01-01

    Full Text Available Abstract Background Effective approaches for the management and conservation of wildlife populations require a sound knowledge of population demographics, and this is often only possible through mark-recapture studies. We applied an automated spot-recognition program (I3S for matching natural markings of wildlife that is based on a novel information-theoretic approach to incorporate matching uncertainty. Using a photo-identification database of whale sharks (Rhincodon typus as an example case, the information criterion (IC algorithm we developed resulted in a parsimonious ranking of potential matches of individuals in an image library. Automated matches were compared to manual-matching results to test the performance of the software and algorithm. Results Validation of matched and non-matched images provided a threshold IC weight (approximately 0.2 below which match certainty was not assured. Most images tested were assigned correctly; however, scores for the by-eye comparison were lower than expected, possibly due to the low sample size. The effect of increasing horizontal angle of sharks in images reduced matching likelihood considerably. There was a negative linear relationship between the number of matching spot pairs and matching score, but this relationship disappeared when using the IC algorithm. Conclusion The software and use of easily applied information-theoretic scores of match parsimony provide a reliable and freely available method for individual identification of wildlife, with wide applications and the potential to improve mark-recapture studies without resorting to invasive marking techniques.

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

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

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

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

  15. Best Practices for NPT Transit Matching

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-09-01

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

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

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

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

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

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

  1. Hip arthroplasty by matching cups.

    Science.gov (United States)

    Gerard, Y

    1978-01-01

    A total hip surface arthroplasty consisting of matching cups and uncemented prosthetic components is a noteworthy operation. The femoral cup obtains cylindrical support from the femoral head which is reamed in the shape of a cylinder. The acetabular cup is metallic with a polyethylene liner. It is mobile over the bone but its position is constrained by contact with the femoral cup and therefore "self-centering." On the femoral side, the cup must be placed strictly in the axis of the femoral neck. The main consideration in femoral head surface replacement is the vitality of the underlying bone. Necrosis was observed in the earliest clinical trials but there have been no cases of necrosis in the past 3 1/2 years. This is attributed to a more limited surgical approach in which only the anterior part of the gluteus medius is divided and all the posterior elements of the hip are preserved. The acetabulum is sufficiently reamed to receive the cup, which protrudes beyond the external margins of the acetabulum in all positions. Errors have been committed while perfecting the prosthetic material, but the results as determined by a 6 1/2 year follow-up on purely metallic cups are encouraging. Metal-polyethylene cups presently under investigation have almost a 2 year follow-up. The reaction of the acetabulum to an uncemented cup is not yet known. However, the existence of 2 sliding surfaces and the fact that the acetabular cup moves only during the extremes of hip movement, is reason to assume that if the acetabulum is not reamed to expose cancellous bone, the risks of protrusion are minimal or delayed. Total surface arthroplasty by concentric cups has been performed in 335 hips to date. The operation is especially recommended when osteotomy is no longer possible and disabling coxarthrosis is present in relatively young patients. PMID:729253

  2. 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; Flouris, Andreas D; 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 12 h, 36 h and 60 h 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 12 h, 36 h and 60 h after the match. Functional (KFecc/KEcon) and conventional (KFcon/KEcon) ratios were then calculated. Only eccentric peak torque of knee flexors declined at 60 h after the match in the control group. In the experimental group: a) isometric strength of knee extensors and knee flexors declined (Pfootball-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 conditioning level.

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

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

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

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

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

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

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

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

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

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

  13. Matching Two-dimensional Gel Electrophoresis' Spots

    DEFF Research Database (Denmark)

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

    2012-01-01

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

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

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

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

  17. 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 unlike targeted methods, no prior knowledge of genetic variation within a genus or species is necessary. (c) 2016 Elsevier Ltd. All rights reserved....

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

  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. Active impedance matching of complex structural systems

    Science.gov (United States)

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

    1991-01-01

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

  2. Partial fingerprint matching based on SIFT Features

    Directory of Open Access Journals (Sweden)

    Ms. S.Malathi,

    2010-07-01

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

  3. Dynamic Matchings in Convex Bipartite Graphs

    DEFF Research Database (Denmark)

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

    2007-01-01

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

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

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

  6. Palm-Print Pattern Matching Based on Features Using Rabin-Karp for Person Identification

    Directory of Open Access Journals (Sweden)

    S. Kanchana

    2015-01-01

    Full Text Available Palm-print based individual identification is regarded as an effectual method for identifying persons with high confidence. Palm-print with larger inner surface of hand contains many features such as principle lines, ridges, minutiae points, singular points, and textures. Feature based pattern matching has faced the challenge that the spatial positional variations occur between the training and test samples. To perform effective palm-print features matching, Rabin-Karp Palm-Print Pattern Matching (RPPM method is proposed in this paper. With the objective of improving the accuracy of pattern matching, double hashing is employed in RPPM method. Multiple patterns of features are matched using the Aho-Corasick Multiple Feature matching procedure by locating the position of the features with finite set of bit values as an input text, improving the cumulative accuracy on hashing. Finally, a time efficient bit parallel ordering presents an efficient variation on matching the palm-print features of test and training samples with minimal time. Experiment is conducted on the factors such as pattern matching efficiency rate, time taken on multiple palm-print feature matching efficiency, and cumulative accuracy on hashing.

  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. Minutiae matching using local pattern features

    Science.gov (United States)

    Jędryka, Marcin; Wawrzyniak, Zbigniew

    2008-01-01

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

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

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

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

  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. EFFICACY OF BIOAGENTS AGAINST SEED BORNE FUNGI OF RICE

    Directory of Open Access Journals (Sweden)

    N. Y. Halgekar

    2014-09-01

    Full Text Available The effect of different antagonist ’ viz. Trichoderma viride Pseudomonas fluorescens and Bacillus substilis were evaluated against different seed borne fungi of rice by dual culture technique. Among three bio agents Trichoderma viride (42.59 to 73.33% followed by Bacillus subtilis and Psuedomonas fluorescens over control. Significant suppression of radial mycelial growth of Drechslera oryzae by Trichoderma viride, and Trichoderma harzianum in dual culture and Inhibition of Curvularia lunata causing black kernel in rice with Bacillus subtilis (97.77% followed by Trichoderma viride (96.44% and Trichoderma harzianum (93.50% in dual culture method.

  14. Red blood cell phenotype matching for various ethnic groups.

    Science.gov (United States)

    Badjie, Karafa S W; Tauscher, Craig D; van Buskirk, Camille M; Wong, Clare; Jenkins, Sarah M; Smith, Carin Y; Stubbs, James R

    2011-01-01

    Patients requiring chronic transfusion support are at risk of alloimmunization after red blood cell (RBC) transfusion because of a disparity between donor and recipient antigen profiles. This research explored the probability of obtaining an exact extended phenotype match between blood donors randomly selected from our institution and patients randomly selected from particular ethnic groups. Blood samples from 1,000 blood donors tested by molecular method were evaluated for the predicted phenotype distribution of Rh, Kell, Kidd, Duffy, and MNS. A random subsample of 800 donor phenotypes was then evaluated for the probability of obtaining an exact match with respect to phenotype with a randomly selected patient from a particular ethnic group. Overall, there was a greater than 80 percent probability of finding an exact donor-recipient match for the K/k alleles in the Kell system. The probability ranged from 3 percent to 38 percent, depending on the ethnicity and disparities in phenotypic profiles, for the Rh, Kidd, Duffy, and MNS systems. A significant donor-recipient phenotype mismatch ratio exists with certain blood group antigens such that, with current routine ABO and D matching practices, recipients of certain ethnic groups are predisposed to alloimmunization. PMID:22356481

  15. Robust Face Image Matching under Illumination Variations

    Directory of Open Access Journals (Sweden)

    Yang Chyuan-Huei Thomas

    2004-01-01

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

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

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

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

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

  20. 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 efficiency η. Being...

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

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

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

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

  5. 34 CFR 361.60 - Matching requirements.

    Science.gov (United States)

    2010-07-01

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

  6. Regular Expression Matching and Operational Semantics

    CERN Document Server

    Rathnayake, Asiri; 10.4204/EPTCS.62.3

    2011-01-01

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

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

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

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

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

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

  12. Learning Hypergraph Labeling for Feature Matching

    CERN Document Server

    Parag, Toufiq; Elgammal, Ahmed

    2011-01-01

    This study poses the feature correspondence problem as a hypergraph node labeling problem. Candidate feature matches and their subsets (usually of size larger than two) are considered to be the nodes and hyperedges of a hypergraph. A hypergraph labeling algorithm, which models the subset-wise interaction by an undirected graphical model, is applied to label the nodes (feature correspondences) as correct or incorrect. We describe a method to learn the cost function of this labeling algorithm from labeled examples using a graphical model training algorithm. The proposed feature matching algorithm is different from the most of the existing learning point matching methods in terms of the form of the objective function, the cost function to be learned and the optimization method applied to minimize it. The results on standard datasets demonstrate how learning over a hypergraph improves the matching performance over existing algorithms, notably one that also uses higher order information without learning.

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

  14. Sample Design.

    Science.gov (United States)

    Ross, Kenneth N.

    1987-01-01

    This article considers various kinds of probability and non-probability samples in both experimental and survey studies. Throughout, how a sample is chosen is stressed. Size alone is not the determining consideration in sample selection. Good samples do not occur by accident; they are the result of a careful design. (Author/JAZ)

  15. Balanced sampling

    NARCIS (Netherlands)

    Brus, D.J.

    2015-01-01

    In balanced sampling a linear relation between the soil property of interest and one or more covariates with known means is exploited in selecting the sampling locations. Recent developments make this sampling design attractive for statistical soil surveys. This paper introduces balanced sampling

  16. Application of matching liquid on the refractive index measurement of biotissue: A theoretical and experimental study

    Science.gov (United States)

    Wang, Jin; Ye, Qing; Deng, Zhichao; Zhou, Wenyuan; Mei, Jianchun; Zhang, Chunping; Tian, Jianguo

    2014-05-01

    The application of matching liquid on the measurement of the refractive index (RI) of biotissue using total internal reflection (TIR) method is investigated in detail. A theoretical model describing samples with different absorbing and scattering ability is given based on Fresnel formula. The theoretical calculation is verified by experimental results of three simulation samples (transparent plexiglass, white plexiglass and ZB3 glass) and cedar wood oil as the matching liquid. Reflectance curves of porcine tissue samples were recorded and systematically studied using two kinds of matching liquid (cedar wood oil and adipose oil) at the incident of TE and TM wave, respectively. Method for proper selection of matching liquid under different conditions is discussed.

  17. Bayesian refinement of protein functional site matching

    Directory of Open Access Journals (Sweden)

    Gold Nicola D

    2007-07-01

    Full Text Available Abstract Background Matching functional sites is a key problem for the understanding of protein function and evolution. The commonly used graph theoretic approach, and other related approaches, require adjustment of a matching distance threshold a priori according to the noise in atomic positions. This is difficult to pre-determine when matching sites related by varying evolutionary distances and crystallographic precision. Furthermore, sometimes the graph method is unable to identify alternative but important solutions in the neighbourhood of the distance based solution because of strict distance constraints. We consider the Bayesian approach to improve graph based solutions. In principle this approach applies to other methods with strict distance matching constraints. The Bayesian method can flexibly incorporate all types of prior information on specific binding sites (e.g. amino acid types in contrast to combinatorial formulations. Results We present a new meta-algorithm for matching protein functional sites (active sites and ligand binding sites based on an initial graph matching followed by refinement using a Markov chain Monte Carlo (MCMC procedure. This procedure is an innovative extension to our recent work. The method accounts for the 3-dimensional structure of the site as well as the physico-chemical properties of the constituent amino acids. The MCMC procedure can lead to a significant increase in the number of significant matches compared to the graph method as measured independently by rigorously derived p-values. Conclusion MCMC refinement step is able to significantly improve graph based matches. We apply the method to matching NAD(P(H binding sites within single Rossmann fold families, between different families in the same superfamily, and in different folds. Within families sites are often well conserved, but there are examples where significant shape based matches do not retain similar amino acid chemistry, indicating that

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

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

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

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

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

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

  4. THE Economics of Match-Fixing

    OpenAIRE

    Caruso, Raul

    2007-01-01

    The phenomenon of match-fixing does constitute a constant element of sport contests. This paper presents a simple formal model in order to explain it. The intuition behind is that an asymmetry in the evaluation of the stake is the key factor leading to match-fixing. In sum, this paper considers a partial equilibrium model of contest where two asymmetric, rational and risk-neutral opponents evaluate differently a contested stake. Differently from common contest models, agents have the option ...

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

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

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

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

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

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

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

  12. Effects of successive judo matches on fatigue and muscle damage markers.

    Science.gov (United States)

    Detanico, Daniele; Dal Pupo, Juliano; Franchini, Emerson; Dos Santos, Saray G

    2015-04-01

    This study aimed to investigate the acute effects of simulated judo matches on fatigue and muscle damage markers. Twenty male judo athletes participated in this study. The athletes performed three 5-minute judo matches separated by 15 minutes of passive rest between each match. The following measurements were performed before and after each match: shoulder external/internal rotation isokinetic torque and countermovement jump (CMJ). Blood samples were taken before the first match and after the third match for serum creatine kinase (CK) and lactate dehydrogenase (LDH) analysis. T-tests for dependent samples and analysis of variance for repeated measures were used to compare the variables over the time; the level of significance was set at 0.05. An overall effect of the successive matches on shoulder internal (PTIN) and external (PTEX) rotation peak torque and CMJ performance was observed. PTIN and PTEX showed significant decreases in postmatch 2 and postmatch 3 when compared with the baseline (p judo matches induced a decline of peak torque and muscle power in the upper and lower limbs, respectively, and also provoked an increase of muscle damage markers. These findings may provide important knowledge for coaches and physical trainers to improve judo-specific strength training in both the upper and lower limbs. PMID:25426512

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

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

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

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

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

  18. A review on compressed pattern matching

    Directory of Open Access Journals (Sweden)

    Surya Prakash Mishra

    2016-09-01

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

  19. Matched filter based iterative adaptive approach

    Science.gov (United States)

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

    2016-05-01

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

  20. Sketch Matching on Topology Product Graph.

    Science.gov (United States)

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

    2015-08-01

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

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

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

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

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

  5. Multi scale feature based matched filter processing

    Institute of Scientific and Technical Information of China (English)

    LI Jun; HOU Chaohuan

    2004-01-01

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

  6. Anatomy Ontology Matching Using Markov Logic Networks

    Directory of Open Access Journals (Sweden)

    Chunhua Li

    2016-01-01

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

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

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

  9. Match probabilities in racially admixed populations.

    Science.gov (United States)

    Lange, K

    1993-02-01

    The calculation of match probabilities is the most contentious issue dividing prosecution and defense experts in the forensic applications of DNA fingerprinting. In particular, defense experts question the applicability of the population genetic laws of Hardy-Weinberg and linkage equilibrium to racially admixed American populations. Linkage equilibrium justifies the product rule for computing match probabilities across loci. The present paper suggests a method of bounding match probabilities that depends on modeling gene descent from ancestral populations to contemporary populations under the assumptions of Hardy-Weinberg and linkage equilibrium only in the ancestral populations. Although these bounds are conservative from the defendant's perspective, they should be small enough in practice to satisfy prosecutors.

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

  11. Covariant diagrams for one-loop matching

    CERN Document Server

    Zhang, Zhengkang

    2016-01-01

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

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

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

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

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

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

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

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

  20. History Matching: Towards Geologically Reasonable Models

    DEFF Research Database (Denmark)

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

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

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

  2. Line matching for automatic change detection algorithm

    Science.gov (United States)

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

    2012-06-01

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

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

  4. Effect of match importance on salivary cortisol and immunoglobulin A responses in elite young volleyball players.

    Science.gov (United States)

    Moreira, Alexandre; Freitas, Camila G; Nakamura, Fábio Yuzo; Drago, Gustavo; Drago, Murilo; Aoki, Marcelo S

    2013-01-01

    The purpose of this study was to compare the session ratings of perceived exertion (Session-RPE) responses and the salivary cortisol (sC) and immunoglobulin A (SIgA) levels between a regular season match (RM) and the final championship match (FM) in elite male volleyball players against the same opponent team. Higher importance was assumed for FM because this match would define the championship team. Session-RPE was obtained after 30 minutes of each match using the CR-10 scale. Saliva samples were collected before and after each match and during a rest day (baseline) at the same period of the matches. The SIgA and sC concentrations were measured by enzyme-linked immunosorbent assay. Greater Session-RPE was observed for FM as compared with RM (p cortisol concentration, and SIgA prelevel were affected by the match importance. These results indicate that monitoring session-RPE, sC, and SIgA responses, in conjunction, during training and competition, would provide valuable informations regarding how athletes cope with sports induced stress. This study provided knowledge about the effect of match importance on salivary markers related to stress that may help coaches to avoid excessive training loads reducing the likelihood to decrements on mucosal immunity and its consequent risk to upper respiratory tract infections, which in turn might affect the performance.

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

  6. A stereo matching algorithm using multi-peak candidate matches and geometric constraints

    Institute of Scientific and Technical Information of China (English)

    Yepeng Guan

    2008-01-01

    Gray cross correlation matching technique is adopted to extract candidate matches with gray cross correla- tion coefficients less than some certain range of maximal correlation coefficient called multi-peak candidate matches. Multi-peak candidates are extracted corresponding to three closest feature points at first. The corresponding multi-peak candidate matches are used to construct the model polygon. Correspondence is determined based on the local geometric relations between the three feature points and the multi-peak candidates. The disparity test and the global consistency checkout are applied to eliminate the remaining ambiguous matches that are not removed by the local geometric relational test. Experimental results show that the proposed algorithm is feasible and accurate.

  7. Generating a Pattern Matching Compiler by Partial Evaluation

    DEFF Research Database (Denmark)

    Jørgensen, Knud Jesper

    1991-01-01

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

  8. 28 CFR 90.17 - Matching requirements.

    Science.gov (United States)

    2010-07-01

    ..., work space, or the monetary value of time contributed by professional and technical personnel and other... placed on donated services must be consistent with the rate of compensation paid for similar work in the... provide a 25% match. (d) Indian tribes, who are subgrantees of a State under this Program, may meet the...

  9. On "the matching polynomial of a polygraph"

    NARCIS (Netherlands)

    Broersma, H.J.; Li, Xueliang

    1993-01-01

    In this note we give an explanation for two phenomena mentioned in the concluding remarks of “The matching polynomial of a polygraph” by Babić et al. The following results are obtained: 1. Although three matrices for given polygraphs defined in the above article in general have different orders, th

  10. Oscillating Rim Hook Tableaux and Colored Matchings

    CERN Document Server

    Chen, William Y C

    2011-01-01

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

  11. Making better partner matches in brand alliances

    NARCIS (Netherlands)

    B. van den Bergh (Bram)

    2014-01-01

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

  12. A Novel Algorithm for Macromolecular Epitope Matching

    Directory of Open Access Journals (Sweden)

    Stanislav Jakuschev

    2009-03-01

    Full Text Available Many macromolecules, namely proteins, show functional substructures or epitopes defined by characteristic spatial arrangements of groups of specific atoms or residues. The identification of such substructures in a set of macromolecular 3D-structures solves an important problem in molecular biology as it allows the assignment of functions to molecular moieties and thus opens the possibility of a mechanistic understanding of molecular function. We have devised an algorithm that models a functional epitope formed by a group of atoms or residues as set of points in cartesian space with associated functional properties. The algorithm searches for similar epitopes in a database of structures by an efficient multistage comparison of distance sets in the epitope and in the structures from the database. The search results in a list of optimal matches and corresponding optimal superpositions of query epitope and matching epitopes from the database. The algorithm is discussed against the background of related approaches, and it is successfully tested in three application scenarios: global match of two homologous proteins, search for an epitope on a homologous protein, and finding matching epitopes in a protein database.

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

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

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

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

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

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

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

  20. Compressed Subsequence Matching and Packed Tree Coloring

    DEFF Research Database (Denmark)

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

    2015-01-01

    We present a new algorithm for subsequence matching in grammar compressed strings. Given a grammar of size n compressing a string of size N and a pattern string of size m over an alphabet of size \\(\\sigma \\), our algorithm uses \\(O(n+\\frac{n\\sigma }{w})\\) space and \\(O(n+\\frac{n\\sigma }{w}+m\\log N...

  1. The Match Quality Gains from Unemployment Insurance

    Science.gov (United States)

    Centeno, Mario

    2004-01-01

    The benefits of unemployment insurance (UI) by measuring its effect in match quality are assessed. The relationship between post-unemployment job tenure and measures of the state level UI generosity and the unemployment rate at the time of the job is analyzed, using NLSY data.

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

  3. The Effectiveness of Advertising Matching Purchase Motivation

    NARCIS (Netherlands)

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

    2001-01-01

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

  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. Circular block matching based video stabilization

    Science.gov (United States)

    Xu, Lidong; Fu, Fangwen; Lin, Xinggang

    2005-07-01

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

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

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

  8. Optimal affine-invariant matching: performance characterization

    Science.gov (United States)

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

    1992-04-01

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

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

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

  11. Map Matching Based on Conditional Random Fields and Route Preference Mining for Uncertain Trajectories

    Directory of Open Access Journals (Sweden)

    Ming Xu

    2015-01-01

    Full Text Available In order to improve offline map matching accuracy of uncertain GPS trajectories, a map matching algorithm based on conditional random fields (CRF and route preference mining is proposed. In this algorithm, road offset distance and the temporal-spatial relationship between the sampling points are used as features of GPS trajectory in a CRF model, which integrates the temporal-spatial context information flexibly. The driver route preference is also used to bolster the temporal-spatial context when a low GPS sampling rate impairs the resolving power of temporal-spatial context in CRF, allowing the map matching accuracy of uncertain GPS trajectories to get improved significantly. The experimental results show that our proposed algorithm is more accurate than existing methods, especially in the case of a low-sampling-rate.

  12. A study on reproducing silicone shade guide for maxillofacial prostheses matching Indian skin color

    Directory of Open Access Journals (Sweden)

    Guttal Satyabodh

    2008-01-01

    Full Text Available Aim: The value and success of a well-fitting and anatomically correct prosthesis are compromised if the color does not match the adjoining tissues. The use of powder colors to help develop a simplified silicone shade guide to aid in the fabrication of silicone facial prostheses for Indian patients has been described here. Materials and Methods: Ten powder pigments were used to fabricate the silicone samples for three different subjects having light, medium and dark complexions who were separated into three groups depending on the value of their shades. Four-step wedge silicone samples with thickness variations of 1, 2, 4 and 6mm were fabricated. Visual assessment of the samples was done by four evaluators to check the agreement of color match. Data was statistically analyzed using kappa coefficients. Results: The kappa values were found to be 0.09-0.44 for a light skin tone, -0.11 to 0.77 for medium skin and 0.44 to 0.85 for dark skin tones. This study showed that the samples of dark skin tone matched the skin tone well and showed a statistically good agreement. To further test the validity of these shade guides, facial silicone veneers were fabricated for three patients having light, medium and dark complexion. The color matching showed satisfactory results. Conclusion: The silicone veneers matched the skin color of all three patients. Hence, this shade guide will help clinicians to obtain a good intrinsic shade and minimize extrinsic coloration.

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

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

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

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

  17. Background field method and nonrelativistic QED matching

    CERN Document Server

    Lee, Jong-Wan

    2014-01-01

    We discuss the resolution of inconsistency between lattice background field methods and nonrelativistic QED matching conditions. In particular, we show that lack of on-shell conditions in lattice QCD with time-dependent background fields generally requires that certain operators related by equations of motion should be retained in an effective field theory to correctly describe the behavior of Green's functions. The coefficients of such operators in a nonrelativistic hadronic theory are determined by performing a robust nonrelativistic expansion of QED for relativistic scalar and spin-half hadrons including nonminimal electromagnetic couplings. Provided that nonrelativistic QED is augmented with equation-of-motion operators, we find that the background field method can be reconciled with the nonrelativistic QED matching conditions without any inconsistency. We further investigate whether nonrelativistic QED can be employed in the analysis of lattice QCD correlation function in background fields, but we are co...

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

  19. Optimal Feedback Communication via Posterior Matching

    CERN Document Server

    Shayevitz, Ofer

    2009-01-01

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

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

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

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

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

  4. National Medical School Matching Program: optimizing outcomes

    Science.gov (United States)

    Eltorai, Adam EM; Daniels, Alan H

    2016-01-01

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

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

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

  7. Performance Evaluation of Tree Object Matching

    DEFF Research Database (Denmark)

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

    2005-01-01

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

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

  9. New multi-pattern matching algorithm

    Institute of Scientific and Technical Information of China (English)

    Liu Gongshen; Li Jianhua; Li Shenghong

    2006-01-01

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

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

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

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

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

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

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

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

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

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

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

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

  1. On the tautology of the matching law.

    Science.gov (United States)

    Rachlin, H

    1971-03-01

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

  2. Matching models of left ventricle and systemic artery

    Institute of Scientific and Technical Information of China (English)

    柳兆荣; 吴驰

    1997-01-01

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

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

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

    CERN Document Server

    Singh, Sudhir Kumar

    2008-01-01

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

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

  6. An Implementation of the Frequency Matching Method

    DEFF Research Database (Denmark)

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

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

  7. One-loop effective lagrangians after matching

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-05-15

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

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

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

  10. Computing the Matched Filter in Linear Time

    CERN Document Server

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

    2011-01-01

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

  11. Salivary cortisol and immunoglobulin A responses to simulated and official Jiu-Jitsu matches.

    Science.gov (United States)

    Moreira, Alexandre; Franchini, Emerson; de Freitas, Camila Gobo; Schultz de Arruda, Ademir F; de Moura, Nivaldo Ribeiro; Costa, Eduardo Caldas; Aoki, Marcelo Saldanha

    2012-08-01

    The aim of this study was to compare the salivary cortisol (sC) and the salivary immunoglobulin A (sIgA) responses to simulated and official Brazilian Jiu-Jitsu (BJJ) matches. Saliva samples were collected from 9 male BJJ athletes before (pre) and after (post) 2 simulated matches (SMs) and 2 official matches (OMs) performed during 2 different competitions. Salivary cortisol and sIgA concentrations (absolute concentration of sIgA [sIgAabs] and the secretion rate of sIgA [sIgArate]) were measured by an enzyme-linked immunosorbent assay. For sC, there was an effect of condition (SM vs. OM) (p BJJ matches can increase sC levels. Moreover, the higher sC resting levels, observed before OMs, suggest that psychological factors associated with high physical-physiological demands from official BJJ competitions maximize stress hormone responses. In addition, the present findings suggest that the acute effect of BJJ matches on mucosal immunity is minimal, and it seems unlikely that changes in cortisol play a major role in the alterations in sIgA levels in response to BJJ matches. The findings of this study suggest that the use of sC can provide valuable information for coaches regarding athletes' responses to competition. In addition, psychological strategies should be implemented before events, to improve the manner in which BJJ athletes cope with the stress inherent to official matches.

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

    DEFF Research Database (Denmark)

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

    2009-01-01

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

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

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

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

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

  17. History Matching in Parallel Computational Environments

    Energy Technology Data Exchange (ETDEWEB)

    Steven Bryant; Sanjay Srinivasan; Alvaro Barrera; Sharad Yadav

    2005-10-01

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

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

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

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

  1. Cartridge case image matching using effective correlation area based method.

    Science.gov (United States)

    Yammen, S; Muneesawang, P

    2013-06-10

    A firearm leaves a unique impression on fired cartridge cases. The cross-correlation function plays an important role in matching the characteristic features on the cartridge case found at the crime scene with a specific firearm, for accurate firearm identification. This paper proposes that the computational forensic techniques of alignment and effective correlation area-based approaches to image matching are essential to firearm identification. Specifically, the reference and the corresponding cartridge cases are aligned according to the phase-correlation criterion on the transform domain. The informative segments of the breech face marks are identified by a cross-covariance coefficient using the coefficient value in a window located locally in the image space. The segments are then passed to the measurement of edge density for computing effective correlation areas. Experimental results on a new dataset show that the correlation system can make use of the best properties of alignment and effective correlation area-based approaches, and can attain significant improvement of image-correlation results, compared with the traditional image-matching methods for firearm identification, which employ cartridge-case samples. An analysis of image-alignment score matrices suggests that all translation and scaling parameters are estimated correctly, and contribute to the successful extraction of effective correlation areas. It was found that the proposed method has a high discriminant power, compared with the conventional correlator. This paper advocates that this method will enable forensic science to compile a large-scale image database to perform correlation of cartridge case bases, in order to identify firearms that involve pairwise alignments and comparisons.

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

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

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

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

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

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

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

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

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

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

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

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

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

  15. 3D Ear Shape Matching Using Joint α-Entropy

    Institute of Scientific and Technical Information of China (English)

    Xiao-Peng Sun; Si-Hui Li; Feng Han; Xiao-Peng Wei

    2015-01-01

    In this article, we investigate the use of joint α-entropy for 3D ear matching by incorporating the local shape feature of 3D ears into the jointα-entropy. First, we extract a sufficient number of key points from the 3D ear point cloud, and fit the neighborhood of each key point to a single-value quadric surface on product parameter regions. Second, we define the local shape feature vector of each key point as the sampling depth set on the parametric node of the quadric surface. Third, for every pair of gallery ear and probe ear, we construct the minimum spanning tree (MST) on their matched key points. Finally, we minimize the total edge weight of MST to estimate its joint α-entropy — the smaller the entropy is, the more similar the ear pair is. We present several examples to demonstrate the advantages of our algorithm, including low time complexity, high recognition rate, and high robustness. To the best of our knowledge, it is the first time that, in computer graphics, the classical information theory of joint α-entropy is used to deal with 3D ear shape recognition.

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

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

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

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

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

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

  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.

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

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

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

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

    DEFF Research Database (Denmark)

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

    2009-01-01

    .01) and without ball possession (229 m, s=85 vs. 278 m, s=97, P ... 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...

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

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

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

    Directory of Open Access Journals (Sweden)

    Jennifer Vonk

    2013-09-01

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

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

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

  12. Novel scheme for fast and efficent video sequence matching using compact signatures

    Science.gov (United States)

    Naphade, Milind R.; Yeung, Minerva M.; Yeo, Boon-Lock

    1999-12-01

    Efficient ways to manage digital video data have assumed enormous importance lately. An integral aspect is the ability to browse, index nd search huge volumes of video data automatically and efficiently. This paper presents a novel scheme for matching video sequences base on low-level features. The scheme supports fast and efficient matching and can search 450,000 frames of video data within 72 seconds on a 400 MHz. Pentium II, for a 50 frame query. Video sequences are processed in the compressed domain to extract the histograms of the images in the DCT sequence is implemented for matching video clips. The binds of the histograms of successive for comparison. This leads to efficient storage and transmission. The histogram representation can be compacted to 4.26 real numbers per frame, while achieving high matching accuracy. Multiple temporal resolution sampling of the videos to be matched is also supported and any key-frame-based matching scheme thus becomes a particular implementation of this scheme.

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

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

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

  16. Automatic Matching of High Resolution Satellite Images Based on RFM

    Directory of Open Access Journals (Sweden)

    JI Shunping

    2016-02-01

    Full Text Available A matching method for high resolution satellite images based on RFM is presented.Firstly,the RFM parameters are used to predict the initial parallax of corresponding points and the prediction accuracy is analyzed.Secondly,the approximate epipolar equation is constructed based on projection tracking and its accuracy is analyzed.Thirdly,approximate 1D image matching is executed on pyramid images and least square matching on base images.At last RANSAC is imbedded to eliminate mis-matching points and matching results are obtained.Test results verified the method more robust and with higher matching rate,compared to 2D gray correlation method and the popular SIFT matching method,and the method preferably solved the question of high resolution satellite image matching with different stereo model,different time and large rotation images.

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

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

    Science.gov (United States)

    2013-06-21

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

  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. PMID:26363581

  20. Language style matching in writing: synchrony in essays, correspondence, and poetry.

    Science.gov (United States)

    Ireland, Molly E; Pennebaker, James W

    2010-09-01

    Each relationship has its own personality. Almost immediately after a social interaction begins, verbal and nonverbal behaviors become synchronized. Even in asocial contexts, individuals tend to produce utterances that match the grammatical structure of sentences they have recently heard or read. Three projects explore language style matching (LSM) in everyday writing tasks and professional writing. LSM is the relative use of 9 function word categories (e.g., articles, personal pronouns) between any 2 texts. In the first project, 2 samples totaling 1,744 college students answered 4 essay questions written in very different styles. Students automatically matched the language style of the target questions. Overall, the LSM metric was internally consistent and reliable across writing tasks. Women, participants of higher socioeconomic status, and students who earned higher test grades matched with targets more than others did. In the second project, 74 participants completed cliffhanger excerpts from popular fiction. Judges' ratings of excerpt-response similarity were related to content matching but not function word matching, as indexed by LSM. Further, participants were not able to intentionally increase style or content matching. In the final project, an archival study tracked the professional writing and personal correspondence of 3 pairs of famous writers across their relationships. Language matching in poetry and letters reflected fluctuations in the relationships of 3 couples: Sigmund Freud and Carl Jung, Elizabeth Barrett and Robert Browning, and Sylvia Plath and Ted Hughes. Implications for using LSM as an implicit marker of social engagement and influence are discussed. (PsycINFO Database Record (c) 2010 APA, all rights reserved).

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

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

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

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

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

  7. Edge-Matching Problems with Rotations

    DEFF Research Database (Denmark)

    Ebbesen, Martin; Fischer, Paul; Witt, Carsten

    2011-01-01

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

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

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

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

  11. Anisotropic matching principle for the hydrodynamics expansion

    CERN Document Server

    Tinti, Leonardo

    2015-01-01

    Following the recent success of anisotropic hydrodynamics we propose a new, general prescription for the hydrodynamics expansion around an anisotropic background. The anisotropic distribution is fixing exactly the complete energy-momentum tensor, just like the effective temperature is fixing the proper energy density in the ordinary expansion around local equilibrium. This means that momen- tum anisotropies are already included at the leading order, allowing for large pressure anisotropies without the need of a next to leading order treatment. The first moment of the Boltzmann equation (local four-momentum conservation) provides the time evolution of the proper energy density and the four velocity. Differently from previous prescriptions, the dynamic equations for the pressure corrections are not derived from the zeroth or second moment of the Boltzmann equation, but they are taken directly from the exact evolution given by the Boltzmann equation. We check the effec- tiveness of this new approach by matching ...

  12. Vortex shedding by matched asymptotic vortex method

    Science.gov (United States)

    Guo, Xinjun; Mandre, Shreyas

    2014-11-01

    An extension of the Kutta condition, using matched asymptotic expansion applied to the Navier-Stokes equations, is presented for flow past a smooth body at high Reynolds number. The goal is to study the influence of unsteady fluid dynamical effects like leading edge vortex, unsteady boundary layer separation, etc. In order to capture accurately the location and strength of vortex shedding, the simplified Navier-Stokes equations in the form of boundary layer approximation are solved in the thin inner region close to the solid body. In the outer region far from the structure, the vortex methods are applied, which significantly reduces the computational cost compared to CFD in the whole domain. With this method, the flow past an airfoil with two degrees of freedom, pitching and heaving, is investigated.

  13. Symmetric Circular Matchings and RNA Folding

    DEFF Research Database (Denmark)

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

    2012-01-01

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

  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. On Resolution Complexity of Matching Principles

    DEFF Research Database (Denmark)

    Dantchev, Stefan S.

    proof system. The results in the thesis fall in this category. We study the Resolution complexity of some Matching Principles. The three major contributions of the thesis are as follows. Firstly, we develop a general technique of proving resolution lower bounds for the perfect matchingprinciples based...... on regular planar graphs. No lower bounds for these were known prior to our work. As a matter of fact, one such problem, the Mutilated Chessboard, was suggested as hard to automated theorem provers in 1964, and remained open since then. Our technique proves a tight resolution lower bound for the Mutilated...... Chessboard as well as for Tseitin tautologies based on rectangular grid graph. We reduce these problems to Tiling games, a concept introduced by us, which may be of interest on its own. Secondly, we find the exact Tree-Resolution complexity of the Weak Pigeon-Hole Principle. It is the most studied...

  16. Matching Hagedorn mass spectrum with Lattice QCD

    CERN Document Server

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

    2015-01-01

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

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

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

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

  20. Matching the Market for Heart Transplantation.

    Science.gov (United States)

    Hsich, Eileen M

    2016-04-01

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

  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. Intact School Matching in Education: Exploring the Relative Importance of Focal and Local Matching

    Science.gov (United States)

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

    2013-01-01

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

  3. An Inductive Characterization of Matching in Binding Bigraphs

    DEFF Research Database (Denmark)

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

    2010-01-01

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

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

    Science.gov (United States)

    2013-03-12

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

  5. 78 FR 35647 - Privacy Act of 1974; Computer Matching Program

    Science.gov (United States)

    2013-06-13

    ... MANAGEMENT Privacy Act of 1974; Computer Matching Program AGENCY: Office of Personnel Management. ACTION: Notice of computer matching between the Office of Personnel Management and the Social Security... Computer Matching and Privacy Protection Act of 1988 (Pub. L. 100-503), Office of Management and...

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

    Science.gov (United States)

    2011-03-02

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

  7. Matching Strategies for Observational Data with Multilevel Structure

    Science.gov (United States)

    Steiner, Peter M.

    2011-01-01

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

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

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

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

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

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

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

  14. 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...... that microRNA detection in human skin is robust irrespective of preservation method; thus, microRNAs offer an appropriate and flexible approach in clinical practices and for diagnostic purposes in skin disorders....

  15. A comparison of feature detectors and descriptors for object class matching

    DEFF Research Database (Denmark)

    Hietanen, Antti; Lankinen, Jukka; Kämäräinen, Joni-Kristian;

    2016-01-01

    appearance variation can be large. We extend the benchmarks to the class matching setting and evaluate state-of-the-art detectors and descriptors with Caltech and ImageNet classes. Our experiments provide important findings with regard to object class matching: (1) the original SIFT is still the best...... degrades dense sampling performance while the best detector (Hessian-affine) is unaffected. The performance of the best detector-descriptor pair is verified in the application of unsupervised visual class alignment where state-of-the-art results are achieved. The findings help to improve the existing...... detectors and descriptors for which the framework provides an automatic validation tool....

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

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

  18. Posterior Matching Scheme for Gaussian Multiple Access Channel with Feedback

    CERN Document Server

    Truong, Lan V

    2012-01-01

    Posterior matching is a method proposed by Ofer Shayevitz and Meir Feder to design optimal coding schemes for general point-to-point memoryless channels with feedback. In this paper, we present a way to extend posterior matching based encoding and variable rate decoding ideas for Gaussian MAC channel with feedback, referred to as time-varying posterior matching scheme, analyze the achievable rate region and error probabilities of the extended encoding-decoding scheme. The time-varying posterior matching scheme is a generalization of the Shayevitz and Feder's posterior matching scheme when the posterior distributions of the input messages given output are not fixed over transmission time slots. It turns out that the well-known Ozarow's encoding scheme, which obtains the capacity of two-user Gaussian channel, is a special case of our extended posterior matching framework like Schalkwijk- Kailath's scheme is a special case of the point-to-point posterior matching mentioned above. Furthermore, our designed poste-...

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

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

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

    DEFF Research Database (Denmark)

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

    2012-01-01

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

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

  3. Matching residency numbers to the workforce needs.

    Science.gov (United States)

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

    2014-06-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 both of these factors set to grow and also with an overall decline in productivity. Orthopedic surgeons must brace themselves for an explosion in demand. At the same time, a paradigm shift has occurred in the delivery of services with the creation of specialist centers. We are amidst a generational shift in the demographics and psychology of the orthopedic workforce. The orthopedic community must be aware of the effects of these far-reaching changes when tailoring the supply of surgeons for the future needs. PMID:24706153

  4. Mechanisms for similarity matching in disparity measurement

    Directory of Open Access Journals (Sweden)

    Ross eGoutcher

    2014-01-01

    Full Text Available Early neural mechanisms for the measurement of binocular disparity appear to operate in a manner consistent with cross-correlation-like processes. Consequently, cross-correlation, or cross-correlation-like procedures have been used in a range of models of disparity measurement. Using such procedures as the basis for disparity measurement creates a preference for correspondence solutions that maximise the similarity between local left and right eye image regions. Here, we examine how observers’ perception of depth in an ambiguous stereogram is affected by manipulations of luminance and orientation-based image similarity. Results show a strong effect of coarse-scale luminance similarity manipulations, but a relatively weak effect of finer-scale manipulations of orientation similarity. This is in contrast to the measurements of depth obtained from a standard cross-correlation model. This model shows strong effects of orientation similarity manipulations and weaker effects of luminance similarity. In order to account for these discrepancies, the standard cross-correlation approach may be modified to include an initial spatial frequency filtering stage. The performance of this adjusted model most closely matches human psychophysical data when spatial frequency filtering favours coarser scales. This is consistent with the operation of disparity measurement processes where spatial frequency and disparity tuning are correlated, or where disparity measurement operates in a coarse-to-fine manner.

  5. Impedance matching for broadband piezoelectric energy harvesting

    Science.gov (United States)

    Hagedorn, F.; Leicht, J.; Sanchez, D.; Hehn, T.; Manoli, Y.

    2013-12-01

    This paper presents a system design for broadband piezoelectric energy harvesting by means of impedance matching. An inductive load impedance is emulated by controlling the output current of the piezoelectric harvester with a bipolar boost converter. The reference current is derived from the low pass filtered voltage measured at the harvester terminals. In order to maximize the harvested power especially for nonresonant frequencies the filter parameters are adjusted by a simple optimization algorithm. However the amount of harvested power is limited by the efficiency of the bipolar boost converter. Therefore an additional switch in the bipolar boost converter is proposed to reduce the capacitive switching losses. The proposed system is simulated using numerical parameters of available discrete components. Using the additional switch, the harvested power is increased by 20%. The proposed system constantly harvests 80% of the theoretically available power over frequency. The usable frequency range of ±4Hz around the resonance frequency of the piezoelectric harvester is mainly limited due to the boost converter topology. This comparison does not include the power dissipation of the control circuit.

  6. MATCHING LSI FOR SCALABLE INFORMATION RETRIEVAL

    Directory of Open Access Journals (Sweden)

    Rajagopal Palsonkennedy

    2012-01-01

    Full Text Available Latent Semantic Indexing (LSI is one of the well-liked techniques in the information retrieval fields. Different from the traditional information retrieval techniques, LSI is not based on the keyword matching simply. It uses statistics and algebraic computations. Based on Singular Value Decomposition (SVD, the higher dimensional matrix is converted to a lower dimensional approximate matrix, of which the noises could be filtered. And also the issues of synonymy and polysemy in the traditional techniques can be prevail over based on the investigations of the terms related with the documents. However, it is notable that LSI suffers a scalability issue due to the computing complexity of SVD. This study presents a distributed LSI algorithm MR-LSI which can solve the scalability issue using Hadoop framework based on the distributed computing model Map Reduce. It also solves the overhead issue caused by the involved clustering algorithm by k-means algorithm. The evaluations indicate that MR-LSI can gain noteworthy improvement compared to the other scheme on processing large scale of documents. One significant advantage of Hadoop is that it supports various computing environments so that the issue of unbalanced load among nodes is highlighted.Hence, a load balancing algorithm based on genetic algorithm for balancing load in static environment is proposed. The results show that it can advance the performance of a cluster according to different levels.

  7. Recyclable Waste Paper Sorting Using Template Matching

    Science.gov (United States)

    Osiur Rahman, Mohammad; Hussain, Aini; Scavino, Edgar; Hannan, M. A.; Basri, Hassan

    This paper explores the application of image processing techniques in recyclable waste paper sorting. In recycling, waste papers are segregated into various grades as they are subjected to different recycling processes. Highly sorted paper streams will facilitate high quality end products, and save processing chemicals and energy. Since 1932 to 2009, different mechanical and optical paper sorting methods have been developed to fill the demand of paper sorting. Still, in many countries including Malaysia, waste papers are sorted into different grades using manual sorting system. Due to inadequate throughput and some major drawbacks of mechanical paper sorting systems, the popularity of optical paper sorting systems is increased. Automated paper sorting systems offer significant advantages over human inspection in terms of fatigue, throughput, speed, and accuracy. This research attempts to develop a smart vision sensing system that able to separate the different grades of paper using Template Matching. For constructing template database, the RGB components of the pixel values are used to construct RGBString for template images. Finally, paper object grade is identified based on the maximum occurrence of a specific template image in the search image. The outcomes from the experiment in classification for White Paper, Old Newsprint Paper and Old Corrugated Cardboard are 96%, 92% and 96%, respectively. The remarkable achievement obtained with the method is the accurate identification and dynamic sorting of all grades of papers using simple image processing techniques.

  8. Parsing and Matching Dates in VIAF

    Directory of Open Access Journals (Sweden)

    Jenny A. Toves

    2014-10-01

    Full Text Available The Virtual International Authority File (OCLC Online Computer Library Center 2013 http://viaf.org is built from dozens of authority files with tens of millions of names in more than 150 million authority and bibliographic records expressed in multiple languages, scripts and formats. One of the main tasks in VIAF is to bring together personal names which may have various dates associated with them, such as birth, death or when they were active. These dates can be quite complicated with ranges, approximations, BCE dates, different scripts, and even different calendars. Analysis of the nearly 400,000 unique date strings in VIAF led us to a parsing technique that relies on only a few basic patterns for them. Our goal is to correctly interpret at least 99% of all the dates we find in each of VIAF’s authority files and to use the dates to facilitate matches between authority records. Python source code for the process described here is available at https://github.com/OCLC-Developer-Network/viaf-dates.

  9. Crown color match of implant-supported zirconia and Porcelain-Fused-to-Metal restorations:

    DEFF Research Database (Denmark)

    Peng, Min; Fei, Wei; Hosseini, Mandana;

    2014-01-01

    Objectives: The aim of the present study was to compare the crown color match of implant supported zirconia restorations and Porcelain-Fused-to-Metal (PFM) restorations in anterior maxillary region by spectrophotometric evaluation. Materials and Methods: Eighteen patients with 29 implant......-supported single crowns in anterior maxillary area were recruited, 11 of the implant crowns were zirconia restorations and 18 were PFM restorations. Color match of the implant crown with contra-lateral/neighboring tooth at the position of body 1/3 of the crown were assessed using spectrophotometer (Spectro......ShadeTM, Micro Dental) in CIEL¿a¿b¿ coordinates. Subjective crown color match scores were evaluated. Independent sample t test of SPSS17.0 was used to compare the difference between zirconia restoration and PFM restoration. Spearman correlation was used to analyze the relationship between the spectrophotometric...

  10. A Novel Fast and Robust Binary Affine Invariant Descriptor for Image Matching

    Directory of Open Access Journals (Sweden)

    Xiujie Qu

    2014-01-01

    Full Text Available As the current binary descriptors have disadvantages of high computational complexity, no affine invariance, and the high false matching rate with viewpoint changes, a new binary affine invariant descriptor, called BAND, is proposed. Different from other descriptors, BAND has an irregular pattern, which is based on local affine invariant region surrounding a feature point, and it has five orientations, which are obtained by LBP effectively. Ultimately, a 256 bits binary string is computed by simple random sampling pattern. Experimental results demonstrate that BAND has a good matching result in the conditions of rotating, image zooming, noising, lighting, and small-scale perspective transformation. It has better matching performance compared with current mainstream descriptors, while it costs less time.

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

    OpenAIRE

    Zhaohong Xu; Tiansheng Lu; Xuyang Wang

    2012-01-01

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

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

    Science.gov (United States)

    Tvedebrink, Torben; Eriksen, Poul Svante; Curran, James Michael; Mogensen, Helle Smidt; Morling, Niels

    2012-05-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 monozygotic twins (0.09%), 6 redundant STR profiles of unknown cause and 1283 STR profiles from repeated testing of individuals were removed leaving 51,517 complete 10 locus STR profiles for analysis. The number corresponds to approximately 1% of the Danish population. We compared all STR profiles to each other, i.e. 1.3×10(9) 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,12] and Curran et al. [3] to compare the observed and expected number of matches and near matches in the data set. We extended the methods by computing the covariance matrix of the summary statistic and used it for the estimation of the identical-by-descent parameter, θ. The analysis demonstrated a number of close relatives in the Danish data set and substructure. The main contribution to the substructure comes from close relatives. An overall θ-value of 1% compensated for the observed substructure, when close familial relationships were accounted for.

  13. Keefektifan Model Kooperatif Tipe Make A Match dan Model CPS Terhadap Kemampuan Pemecahan Masalah dan Motivasi Belajar

    Directory of Open Access Journals (Sweden)

    Nur Fitri Amalia

    2013-12-01

    Full Text Available AbstrakTujuan penelitian ini adalah untuk mengetahui keefektifan model kooperatif tipe Make a Match dan model CPS terhadap kemampuan pemecahan masalah dan motivasi belajar sis-wa kelas X pada materi persamaan dan fungsi kuadrat. Populasi dalam penelitian ini adalah siswa kelas X SMA N 1 Subah tahun ajaran 2013/2014. Sampel dalam penelitian ini diam-bil dengan teknik random sampling, yaitu teknik pengambilan sampel dengan acak. Kelas X8 terpilih sebagai kelas eksperimen I dengan penerapan model kooperatif tipe Make a Match dan kelas X7 terpilih sebagai kelas eksperimen II dengan penerapan model CPS. Da-ta hasil penelitian diperoleh dengan tes dan pemberian angket untuk kemudian dianalisis menggunakan uji proporsi dan uji t. Hasil penelitian adalah (1 implementasi model koope-ratif tipe Make a Match efektif terhadap kemampuan pemecahan masalah; (2 implementasi model CPS efektif terhadap kemampuan pemecahan masalah; (3 implementasi model koo-peratif tipe Make a Match lebih baik daripada model CPS terhadap kemampuan pecahan masalah; (4 implementasi model CPS lebih baik daripada model kooperatif tipe Make a Match terhadap motivasi belajar.Kata Kunci:       Make A Match; CPS; Pemecahan Masalah; Motivasi  AbstractThe purpose of this study was to determine the effectiveness of cooperative models Make a Match and CPS to problem-solving ability and motivation of students of class X in the equation of matter and quadratic function. The population of this study was the tenth grade students of state senior high school 1 Subah academic year 2013/2014. The samples in this study were taken by random sampling technique, that is sampling techniques with random. Class X8 was selected as the experimental class I with the application of cooperative model make a Match and class X7 was selected as the experimental class II with the application of the CPS. The data were obtained with the administration of a questionnaire to test and then analyzed using the

  14. Affect-matching music improves cognitive performance in adults and young children for both positive and negative emotions

    OpenAIRE

    Franco, Fabia; Swaine, Joel S.; Israni, Shweta; Zaborowska, Katarzyna A.; Kaloko, Fatmata; Kesavarajan, Indu; Majek, Joseph A.

    2014-01-01

    Three experiments assessed the hypothesis that cognitive benefits associated with exposure to music only occur when the perceived emotion expression of the music and the participant’s affective state match. Experiment 1 revealed an affect-matching pattern modulated by gender when assessing high-arousal states of opposite valence (happy/angry) in an adult sample (n=94) in which mood classification was based on self-report, and affective valence in music was differentiated by mode and other exp...

  15. Point pattern matching based on kernel partial least squares

    Institute of Scientific and Technical Information of China (English)

    Weidong Yan; Zheng Tian; Lulu Pan; Jinhuan Wen

    2011-01-01

    @@ Point pattern matching is an essential step in many image processing applications. This letter investigates the spectral approaches of point pattern matching, and presents a spectral feature matching algorithm based on kernel partial least squares (KPLS). Given the feature points of two images, we define position similarity matrices for the reference and sensed images, and extract the pattern vectors from the matrices using KPLS, which indicate the geometric distribution and the inner relationships of the feature points.Feature points matching are done using the bipartite graph matching method. Experiments conducted on both synthetic and real-world data demonstrate the robustness and invariance of the algorithm.%Point pattern matching is an essential step in many image processing applications. This letter investigates the spectral approaches of point pattern matching, and presents a spectral feature matching algorithm based on kernel partial least squares (KPLS). Given the feature points of two images, we define position similarity matrices for the reference and sensed images, and extract the pattern vectors from the matrices using KPLS, which indicate the geometric distribution and the inner relationships of the feature points.Feature points matching are done using the bipartite graph matching method. Experiments conducted on both synthetic and real-world data demonstrate the robustness and invariance of the algorithm.

  16. The development of fatigue during match-play tennis

    Science.gov (United States)

    Reid, Machar; Duffield, Rob

    2014-01-01

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

  17. Multi-data reservoir history matching for enhanced reservoir forecasting and uncertainty quantification

    KAUST Repository

    Katterbauer, Klemens

    2015-04-01

    Reservoir simulations and history matching are critical for fine-tuning reservoir production strategies, improving understanding of the subsurface formation, and forecasting remaining reserves. Production data have long been incorporated for adjusting reservoir parameters. However, the sparse spatial sampling of this data set has posed a significant challenge for efficiently reducing uncertainty of reservoir parameters. Seismic, electromagnetic, gravity and InSAR techniques have found widespread applications in enhancing exploration for oil and gas and monitoring reservoirs. These data have however been interpreted and analyzed mostly separately, rarely exploiting the synergy effects that could result from combining them. We present a multi-data ensemble Kalman filter-based history matching framework for the simultaneous incorporation of various reservoir data such as seismic, electromagnetics, gravimetry and InSAR for best possible characterization of the reservoir formation. We apply an ensemble-based sensitivity method to evaluate the impact of each observation on the estimated reservoir parameters. Numerical experiments for different test cases demonstrate considerable matching enhancements when integrating all data sets in the history matching process. Results from the sensitivity analysis further suggest that electromagnetic data exhibit the strongest impact on the matching enhancements due to their strong differentiation between water fronts and hydrocarbons in the test cases.

  18. Perfect Matchings in \\~O(n^{1.5}) Time in Regular Bipartite Graphs

    CERN Document Server

    Goel, Ashish

    2009-01-01

    We consider the well-studied problem of finding a perfect matching in d-regular bipartite graphs with 2n vertices and m = nd edges. While the best-known algorithm for general bipartite graphs (due to Hopcroft and Karp) takes O(m\\sqrt{n}) time, in regular bipartite graphs, a perfect matching is known to be computable in O(m) time. Very recently, the O(m) bound was improved to O(min{m, n^{2.5} log n/d}) expected time, an expression that is bounded by \\~O(n^{1.75}). In this paper, we present an \\~O(n^{1.5}) expected time algorithm for finding a perfect matching in regular bipartite graphs. To obtain this result, we prove a correspondence theorem between cuts and Hall's theorem "witnesses" for a perfect matching in a bipartite graph. We then design and analyze a two-stage sampling scheme that reduces the problem of finding a perfect matching in regular bipartite graphs to the same problem on arbitrary bipartite graphs with O(n log n) edges.

  19. CPU and GPU (Cuda Template Matching Comparison

    Directory of Open Access Journals (Sweden)

    Evaldas Borcovas

    2014-05-01

    Full Text Available Image processing, computer vision or other complicated opticalinformation processing algorithms require large resources. It isoften desired to execute algorithms in real time. It is hard tofulfill such requirements with single CPU processor. NVidiaproposed CUDA technology enables programmer to use theGPU resources in the computer. Current research was madewith Intel Pentium Dual-Core T4500 2.3 GHz processor with4 GB RAM DDR3 (CPU I, NVidia GeForce GT320M CUDAcompliable graphics card (GPU I and Intel Core I5-2500K3.3 GHz processor with 4 GB RAM DDR3 (CPU II, NVidiaGeForce GTX 560 CUDA compatible graphic card (GPU II.Additional libraries as OpenCV 2.1 and OpenCV 2.4.0 CUDAcompliable were used for the testing. Main test were made withstandard function MatchTemplate from the OpenCV libraries.The algorithm uses a main image and a template. An influenceof these factors was tested. Main image and template have beenresized and the algorithm computing time and performancein Gtpix/s have been measured. According to the informationobtained from the research GPU computing using the hardwarementioned earlier is till 24 times faster when it is processing abig amount of information. When the images are small the performanceof CPU and GPU are not significantly different. Thechoice of the template size makes influence on calculating withCPU. Difference in the computing time between the GPUs canbe explained by the number of cores which they have.

  20. Image Relaxation Matching Based on Feature Points for DSM Generation

    Institute of Scientific and Technical Information of China (English)

    ZHENG Shunyi; ZHANG Zuxun; ZHANG Jianqing

    2004-01-01

    In photogrammetry and remote sensing, image matching is a basic and crucial process for automatic DEM generation. In this paper we presented a image relaxation matching method based on feature points. This method can be considered as an extention of regular grid point based matching. It avoids the shortcome of grid point based matching. For example, with this method, we can avoid low or even no texture area where errors frequently appear in cross correlaton matching. In the mean while, it makes full use of some mature techniques such as probability relaxation, image pyramid and the like which have already been successfully used in grid point matching process. Application of the technique to DEM generaton in different regions proved that it is more reasonable and reliable.

  1. Application of Inertia Ellipse in Code Marker Matching

    Institute of Scientific and Technical Information of China (English)

    XU Fang; JIANG Weiwei; HE Qing; HU Xiaobin

    2010-01-01

    In close-range photogrammetry, 3D information acquisition is based on image matching. The application of code marker helps to improve the level of automatic matching and the matching accuracy. This paper inyestigates the application of inertia ellipse algorithm to code marker matching. We can calculate the inertia ellipse of a target with a certain boundary. First, the method is applied to a single code marker; the angle and scaling are valid. Then, the paper introduces the multi code markers matching method by the inertia ellipse. Rotation and scaling changes of homonymy images can be calculated by inertia ellipse algorithm. These parameters can be used for code marker matching in arbitrary attitude close-range photogrammetry.

  2. Geometry constraints and matching algorithm for lunar rover stereo vision

    Institute of Scientific and Technical Information of China (English)

    HOU Jian; QI Nai-ming

    2005-01-01

    A feature-constrained stereo matching algorithm for lunar rover navigation is presented based on the analysis of the stereo vision system and working environments of lunar rover. In feature-matching phase, edge points are extracted with wavelet transform and are used as the primitives for matching. Then three criterions are utilized in turn to select the correct matching points with the pyramidal searching strategy. As a result,the algorithm finds corresponding points successfully for large numbers of edge points. Area-matching is accomplished under the constraint of edge-matching results,and the correlation is selected as the criterion.Experimental results with real images of natural terrain indicate that the algorithm provides dense disparity maps with fairly high accuracy.

  3. Doppler Compensation by using of Segmented Match Filter

    Directory of Open Access Journals (Sweden)

    Nader Ghadimi

    2008-09-01

    Full Text Available Match filter is one of the important parts of radar receiver. By using of Match Filter, the signal to noise ratio can be maximized so that the probability of detection is increased. Match Filter can be used as a pulse compression filter in radar receiver. Binary phase code is one of the pulse compression methods that, the compression can be down with a Match Filter in the receiver. Doppler effect is one of the problems that degrade the performance of Match Filter. In this paper, two methods “Mixer Array” and “Segmented Match Filter” are proposed for Doppler compensation. The operation of these two methods as Doppler compensation techniques are considered theoretically. The simulation is used to demonstrate the Doppler compensation performance of new techniques compared to conventional methods.

  4. Compensating Wage Differentials in Stable Job Matching Equilibrium

    OpenAIRE

    Seungjin Han; Shintaro Yamaguchi

    2012-01-01

    This paper studies implicit pricing of non-wage job characteristics in the labour market using a two-sided matching model. It departs from the previous literature by allowing worker heterogeneity in productivity, which gives rise to a double transaction problem in a hedonic model. Deriving sufficient conditions under which assortative matching is the unique stable job-worker matching, we show that observed wage differentials between jobs reflect not only compensating wage differentials, but a...

  5. Cauchy Based Matched Filter for Retinal Vessels Detection

    OpenAIRE

    Zolfagharnasab, Hooshiar; Naghsh-Nilchi, Ahmad Reza

    2014-01-01

    In this paper, a novel matched filter based on a new kernel function with Cauchy distribution is introduced to improve the accuracy of the automatic retinal vessel detection compared with other available matched filter-based methods, most notably, the methods built on Gaussian distribution function. Several experiments are conducted to pick the best values of the parameters for the new designed filter, including both Cauchy function parameters as well as the matched filter parameters such as ...

  6. Monotonicity and Nash implementation in matching markets with contracts

    OpenAIRE

    Haake, C.J.; Klaus, B.E.

    2011-01-01

    We consider general two-sided matching markets, so-called matching with contracts markets as introduced by Hatfield and Milgrom (2005), and analyze (Maskin) monotonic and Nash implementable solutions. We show that for matching with contracts markets the stable correspondence is monotonic and implementable (Theorems 1 and 3). Furthermore, any solution that is Pareto efficient, individually rational, and monotonic is a supersolution of the stable correspondence (Theore m 2). In other words, the...

  7. Stable many-to-many matchings with contracts

    OpenAIRE

    Klaus, B.E.; Walzl, M.

    2006-01-01

    We consider several notions of setwise stability for many-to-many matching markets with contracts and provide an analysis of the relations between the resulting stable sets and pairwise stable sets for general, substitutable, and strongly substitutable preferences. Apart from obtaining “set inclusion results'''' on all three domains, we prove that for substitutable preferences the set of pairwise stable matchings is nonempty and coincides with the set of weakly setwise stable matchings. For s...

  8. Online Dating Recommendations: Matching Markets and Learning Preferences

    OpenAIRE

    Tu, Kun; Ribeiro, Bruno; Jiang, Hua; Wang, Xiaodong; Jensen, David; Liu, Benyuan; Towsley, Don

    2014-01-01

    Recommendation systems for online dating have recently attracted much attention from the research community. In this paper we proposed a two-side matching framework for online dating recommendations and design an LDA model to learn the user preferences from the observed user messaging behavior and user profile features. Experimental results using data from a large online dating website shows that two-sided matching improves significantly the rate of successful matches by as much as 45%. Final...

  9. Game, shot and match: Event-based indexing of tennis

    OpenAIRE

    Connaghan, Damien; Kelly, Philip; O''Connor, Noel E.

    2011-01-01

    Identifying events in sports video offers great potential for advancing visual sports coaching applications. In this paper, we present our results for detecting key events in a tennis match. Our overall goal is to automatically index a complete tennis match into all the main tennis events, so that a match can be recorded using affordable visual sens- ing equipment and then be automatically indexed into key events for retrieval and editing. The tennis events detected in...

  10. Multiagent Reinforcement Learning with Regret Matching for Robot Soccer

    OpenAIRE

    Qiang Liu; Jiachen Ma; Wei Xie

    2013-01-01

    This paper proposes a novel multiagent reinforcement learning (MARL) algorithm Nash- learning with regret matching, in which regret matching is used to speed up the well-known MARL algorithm Nash- learning. It is critical that choosing a suitable strategy for action selection to harmonize the relation between exploration and exploitation to enhance the ability of online learning for Nash- learning. In Markov Game the joint action of agents adopting regret matching algorithm can converge to a ...

  11. Directional Quasi-Phase Matching in Curved Waveguides

    OpenAIRE

    Horn, Rolf T.; Weihs, Gregor

    2010-01-01

    In materials that do not allow birefringent phase-matching or periodic poling we propose to use waveguides to exploit the tensor structure of the second order nonlinearity for quasi-phase matching of nonlinear interactions. In particular, we concentrate on curved waveguides in which the interplay between the propagation direction, electric field polarizations and the nonlinearity can change the strength and sign of the nonlinear interaction periodically to achieve quasi-phase matching.

  12. Multi-Configuration Matched Spectral Filter Core Project

    Data.gov (United States)

    National Aeronautics and Space Administration — OPTRA proposes the development of a modular, reconfigurable matched spectral filter (RMSF) spectrometer for the monitoring of greenhouse and volcanic gases. The...

  13. Using Microsoft Office Excel 2007 to conduct generalized matching analyses.

    Science.gov (United States)

    Reed, Derek D

    2009-01-01

    The generalized matching equation is a robust and empirically supported means of analyzing relations between reinforcement and behavior. Unfortunately, no simple task analysis is available to behavior analysts interested in using the matching equation to evaluate data in clinical or applied settings. This technical article presents a task analysis for the use of Microsoft Excel to analyze and plot the generalized matching equation. Using a data-based case example and a step-by-step guide for completing the analysis, these instructions are intended to promote the use of quantitative analyses by researchers with little to no experience in quantitative analyses or the matching law.

  14. A multicast dynamic wavelength assignment algorithm based on matching degree

    Institute of Scientific and Technical Information of China (English)

    WU Qi-wu; ZHOU Xian-wei; WANG Jian-ping; YIN Zhi-hong; ZHANG Long

    2009-01-01

    The wavelength assignment with multiple multicast requests in fixed routing WDM network is studied. A new multicast dynamic wavelength assignment algorithm is presented based on matching degree. First, the wavelength matching degree between available wavelengths and multicast routing trees is introduced into the algorithm. Then, the wavelength assign-ment is translated into the maximum weight matching in bipartite graph, and this matching problem is solved by using an extended Kuhn-Munkres algorithm. The simulation results prove that the overall optimal wavelength assignment scheme is obtained in polynomial time. At the same time, the proposed algorithm can reduce the connecting blocking probability and improve the system resource utilization.

  15. Vocal matching of frequency modulation in synthesized vowels.

    Science.gov (United States)

    King, J B; Horii, Y

    1993-06-01

    Nine male singers attempted to match rates and extents of synthesized vocal vibrato at low, middle, and high pitch levels. The results showed that on average, the singers were able to match rates of 3, 5, and 7 Hz within 13%. It was difficult for the singers, however, to match extents of 0.5, 1.0, and 1.5 semitones. Thus, the results indicated singers' reasonably good ability to match rates but, contrary to prevalent opinions, not extents of vocal vibrato. PMID:8353629

  16. Quantum Efficiency of Fluorescent Dyes and Color Matching

    Institute of Scientific and Technical Information of China (English)

    LI Rong; CHEN Dong-hui

    2002-01-01

    Because of the special optical characters, the color matching of fluorescent dyes is quite complicated. In order to find the algorithm of the color matching of fluorescent dyes, some experiments and measurements of one kind of fluorescent dye were carried out. An elementary probe into the method of color matching of fluorescent dyes has been made through the expression deduced by James S. Bonham and standard KubelkaMunk theory. The results prove that the method has a great applicability for the color matching of fabric dyed with only one kind of fluorescent dye.

  17. A quantitative method for measuring the quality of history matches

    Energy Technology Data Exchange (ETDEWEB)

    Shaw, T.S. [Kerr-McGee Corp., Oklahoma City, OK (United States); Knapp, R.M. [Univ. of Oklahoma, Norman, OK (United States)

    1997-08-01

    History matching can be an efficient tool for reservoir characterization. A {open_quotes}good{close_quotes} history matching job can generate reliable reservoir parameters. However, reservoir engineers are often frustrated when they try to select a {open_quotes}better{close_quotes} match from a series of history matching runs. Without a quantitative measurement, it is always difficult to tell the difference between a {open_quotes}good{close_quotes} and a {open_quotes}better{close_quotes} matches. For this reason, we need a quantitative method for testing the quality of matches. This paper presents a method for such a purpose. The method uses three statistical indices to (1) test shape conformity, (2) examine bias errors, and (3) measure magnitude of deviation. The shape conformity test insures that the shape of a simulated curve matches that of a historical curve. Examining bias errors assures that model reservoir parameters have been calibrated to that of a real reservoir. Measuring the magnitude of deviation assures that the difference between the model and the real reservoir parameters is minimized. The method was first tested on a hypothetical model and then applied to published field studies. The results showed that the method can efficiently measure the quality of matches. It also showed that the method can serve as a diagnostic tool for calibrating reservoir parameters during history matching.

  18. Influence of the Difficulty of the Matching Familiar Figures Test-20 on the Assessment of Reflection-Impulsivity: An Item Analysis

    Science.gov (United States)

    Carretero-Dios, Hugo; Macarena, De los Santos-Roig; Buela-Casal, Gualberto

    2008-01-01

    This study is an item analysis of the Matching Familiar Figures Test-20. We examined error scores in the Matching Familiar Figures Test-20 to determine the influence of the difficulty of the test on the assessment of reflection-impulsivity. The sample included 700 participants aged between 6 and 12 years. The results obtained from the corrected…

  19. Automated sampling and control of gaseous simulations

    KAUST Repository

    Huang, Ruoguan

    2013-05-04

    In this work, we describe a method that automates the sampling and control of gaseous fluid simulations. Several recent approaches have provided techniques for artists to generate high-resolution simulations based on a low-resolution simulation. However, often in applications the overall flow in the low-resolution simulation that an animator observes and intends to preserve is composed of even lower frequencies than the low resolution itself. In such cases, attempting to match the low-resolution simulation precisely is unnecessarily restrictive. We propose a new sampling technique to efficiently capture the overall flow of a fluid simulation, at the scale of user\\'s choice, in such a way that the sampled information is sufficient to represent what is virtually perceived and no more. Thus, by applying control based on the sampled data, we ensure that in the resulting high-resolution simulation, the overall flow is matched to the low-resolution simulation and the fine details on the high resolution are preserved. The samples we obtain have both spatial and temporal continuity that allows smooth keyframe matching and direct manipulation of visible elements such as smoke density through temporal blending of samples. We demonstrate that a user can easily configure a simulation with our system to achieve desired results. © 2013 Springer-Verlag Berlin Heidelberg.

  20. View-based matching can be more than image matching:The importance of considering an animal's perspective

    OpenAIRE

    Wystrach, Antoine; Graham, Paul

    2012-01-01

    Using vision for navigation is important for many animals and a common debate is the extent to which spatial performance can be explained by "simple" view-based matching strategies. We discuss, in the context of recent work, how confusion between image-matching algorithms and the broader class of view-based navigation strategies, is hindering the debate around the use of vision in spatial cognition. A proper consideration of view-based matching strategies requires an understanding of the visu...