WorldWideScience

Sample records for bioagent sample matching

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

    Energy Technology Data Exchange (ETDEWEB)

    Velsko, S P

    2006-04-21

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

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

    Energy Technology Data Exchange (ETDEWEB)

    Hughes, Robert Clark

    2003-12-01

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

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

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

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

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

  7. Radar Signal Recovery using Compressive Sampling Matching Pursuit Algorithm

    Directory of Open Access Journals (Sweden)

    M Sreenivasa Rao

    2016-12-01

    Full Text Available In this study, we propose compressive sampling matching pursuit (CoSaMP algorithm for sub-Nyquist based electronic warfare (EW receiver system. In compressed sensing (CS theory time-frequency plane localisation and discretisation into a N×N grid in union of subspaces is established. The train of radar signals are sparse in time and frequency can be under sampled with almost no information loss. The CS theory may be applied to EW digital receivers to reduce sampling rate of analog to digital converter; to improve radar parameter resolution and increase input bandwidth. Simulated an efficient approach for radar signal recovery by CoSaMP algorithm by using a set of various sample and different sparsity level with various radar signals. This approach allows a scalable and flexible recovery process. The method has been satisfied with data in a wide frequency range up to 40 GHz. The simulation shows the feasibility of our method.

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

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

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

    Science.gov (United States)

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

    2016-01-01

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

  11. A Low-Sampling-Rate Trajectory Matching Algorithm in Combination of History Trajectory and Reinforcement Learning

    Directory of Open Access Journals (Sweden)

    SUN Wenbin

    2016-11-01

    Full Text Available In order to improve the accuracy of low frequency (sampling interval greater than 1 minute trajectory data matching algorithm, this paper proposed a novel matching algorithm termed HMDP-Q (History Markov Decision Processes Q-learning. The new algorithm is based on reinforced learning on historic trajectory. First, we extract historic trajectory data according to incremental matching algorithm as historical reference, and filter the trajectory dataset through the historic reference, the shortest trajectory and the reachability. Then we model the map matching process as the Markov decision process, and build up reward function using deflected distance between trajectory points and historic trajectories. The largest reward value of the Markov decision process was calculated by using the reinforced learning algorithm, which is the optimal matching result of trajectory and road. Finally we calibrate the algorithm by utilizing city's floating cars data to experiment. The results show that this algorithm can improve the accuracy between trajectory data and road. The matching accuracy is 89.2% within 1 minute low-frequency sampling interval, and the matching accuracy is 61.4% when the sampling frequency is 16 minutes. Compared with IVVM (Interactive Voting-based Map Matching, HMDP-Q has a higher matching accuracy and computing efficiency. Especially, when the sampling frequency is 16 minutes, HMDP-Q improves the matching accuracy by 26%.

  12. Assessing Generative Braille Responding Following Training in a Matching-to-Sample Format

    Science.gov (United States)

    Putnam, Brittany C.; Tiger, Jeffrey H.

    2016-01-01

    We evaluated the effects of teaching sighted college students to select printed text letters given a braille sample stimulus in a matching-to-sample (MTS) format on the emergence of untrained (a) construction of print characters given braille samples, (b) construction of braille characters given print samples, (c) transcription of print characters…

  13. Influence of identity versus oddity pretraining on symmetric matching to sample

    NARCIS (Netherlands)

    H. Boelens (Harrie); J.J. Schenk (Jacqueline)

    2009-01-01

    textabstractIdentity and oddity matching tasks were designed for different groups of 5-yr.-old children. The presentation of tasks continued until all children had shown evidence of appropriate generalization to new stimuli (i.e., generalized identity matching or generalized oddity from sample). All

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

    Science.gov (United States)

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

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

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

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

  17. Supporting Opportunities for Context-Aware Social Matching: An Experience Sampling Study

    DEFF Research Database (Denmark)

    Mayer, Julia; Barkhuus, Louise; Hiltz, Starr Roxanne

    2016-01-01

    opportunities to map out the design space of opportunistic social matching systems. We contribute insights gained from a study combining Experience Sampling Method (ESM) with 85 students of a U.S. university and interviews with 15 of these participants. A generalized linear mixed model analysis (n=1704) showed...

  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. Pattern Matching of Harmonic Vibrations in Nonlinearly Generated Acoustic Modes in Bovine Bone Samples

    Science.gov (United States)

    Alippi, A.; Biagioni, A.; Germano, M.; Passeri, D.

    2008-06-01

    Local probing of nonlinear generation of harmonic vibrations has been done on bone plate samples and the evaluation of the nonlinear term is derived from a limited number of cases of bovine thigh bones, that shows that a low level of nonlinearity is present in bone structures. This is consistent with the assumption that in low level nonlinear samples the distribution of harmonic vibrations matches the corresponding power distribution of the fundamental mode.

  20. Differential outcomes enhance accuracy of delayed matching to sample but not resistance to change.

    Science.gov (United States)

    Nevin, John A; Ward, Ryan D; Jimenez-Gomez, Corina; Odum, Amy L; Shahan, Timothy A

    2009-01-01

    Three experiments assessed the relation between the differential outcomes effect and resistance to change of delayed matching-to-sample performance. Pigeons produced delayed matching-to-sample trials by responding on variable interval schedules in two components of a multiple schedule. In the same-outcome component, the probability of reinforcement was the same for both samples (.9 in Experiments 1 and 2, .5 in Experiment 3); in the different-outcomes component, the probability of reinforcement was .9 for one sample and .1 for the other. In all three experiments, the forgetting functions in the different-outcomes component were higher and shallower than in the same-outcomes component. When total reinforcement was greater in the same-outcomes component (Experiments 1 and 2), resistance to disruption by prefeeding, intercomponent food, extinction, or flashing lights typically was greater in that component. In Experiment 3, when total reinforcement was equated, resistance to disruption was similar across components. Thus, the level and slope of forgetting functions depended on differential reinforcement correlated with the samples, but the resistance to change of forgetting functions depended on total reinforcement in a component. Both aspects of the results can be explained by a model of delayed matching to sample performance.

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

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

  2. Anionic Forensic Signatures for Sample Matching of Potassium Cyanide Using High Performance Ion Chromatography and Chemometrics

    Energy Technology Data Exchange (ETDEWEB)

    Fraga, Carlos G.; Farmer, Orville T.; Carman, April J.

    2011-01-30

    Potassium cyanide, a known poison, was used a model compound to determine the feasibility of using anionic impurities as a forensic signature for matching KCN samples back to their source. In this study, portions of eight KCN stocks originating from four countries were separately dissolved in water and analyzed by high performance ion chromatography (HPIC) using an anion exchange column and conductivity detection. Sixty KCN aqueous samples were produced from the eight stocks and analyzed for 11anionic impurities. Hierarchal cluster analysis and principal component analysis were used to demonstrate that KCN samples cluster according to source based on the concentrations of their anionic impurities. The F-ratio method and degree-of-class separation (DCS) were used for feature selection on a training set of KCN samples in order to optimize sample clustering. The optimal subset of anions needed for sample classification was determined to be sulfate, oxalate, phosphate, and an unknown anion named unk5. Using K-nearest neighbors (KNN) and the optimal subset of anions, KCN test samples from different KCN stocks were correctly determined to be manufactured in the United States. In addition, KCN samples from stocks manufactured in Belgium, Germany, and the Czech Republic were all correctly matched back to their original stocks because each stock had a unique anionic impurity profile. The application of the F-ratio method and DCS for feature selection improved the accuracy and confidence of sample classification by KNN.

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

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

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

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

    contains high levels of RNases. As microRNAs are 19-23 nucleotides long and lack a poly-A tail, they may be less prone to RNA degradation than mRNAs. We investigated whether microRNAs in psoriatic (FFPE) samples reliably reflect microRNA expression in samples less prone to RNA degradation such as fresh......-frozen (FS) and Tissue-Tek-embedding (OCT). We found a strong correlation of the microRNA expression levels between all preservation methods of matched psoriatic skin samples (r(s) ranging from 0.91 to 0.95 (P ... 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....

  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. CLARREO Approach for Reference Intercalibration of Reflected Solar Sensors: On-Orbit Data Matching and Sampling

    Science.gov (United States)

    Roithmayr, Carlos; Lukashin, Constantine; Speth, Paul W.; Kopp, Gregg; Thome, Kurt; Wielicki, Bruce A.; Young, David F.

    2014-01-01

    The implementation of the Climate Absolute Radiance and Refractivity Observatory (CLARREO) mission was recommended by the National Research Council in 2007 to provide an on-orbit intercalibration standard with accuracy of 0.3% (k = 2) for relevant Earth observing sensors. The goal of reference intercalibration, as established in the Decadal Survey, is to enable rigorous high-accuracy observations of critical climate change parameters, including reflected broadband radiation [Clouds and Earth's Radiant Energy System (CERES)], cloud properties [Visible Infrared Imaging Radiometer Suite (VIIRS)], and changes in surface albedo, including snow and ice albedo feedback. In this paper, we describe the CLARREO approach for performing intercalibration on orbit in the reflected solar (RS) wavelength domain. It is based on providing highly accurate spectral reflectance and reflected radiance measurements from the CLARREO Reflected Solar Spectrometer (RSS) to establish an on-orbit reference for existing sensors, namely, CERES and VIIRS on Joint Polar Satellite System satellites, Advanced Very High Resolution Radiometer and follow-on imagers on MetOp, Landsat imagers, and imagers on geostationary platforms. One of two fundamental CLARREO mission goals is to provide sufficient sampling of high-accuracy observations that are matched in time, space, and viewing angles with measurements made by existing instruments, to a degree that overcomes the random error sources from imperfect data matching and instrument noise. The data matching is achieved through CLARREO RSS pointing operations on orbit that align its line of sight with the intercalibrated sensor. These operations must be planned in advance; therefore, intercalibration events must be predicted by orbital modeling. If two competing opportunities are identified, one target sensor must be given priority over the other. The intercalibration method is to monitor changes in targeted sensor response function parameters: effective

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

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

    Directory of Open Access Journals (Sweden)

    CLAUDIO CARPIO

    2003-07-01

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

  12. Using ancestry matching to combine family-based and unrelated samples for genome-wide association studies‡

    Science.gov (United States)

    Crossett, Andrew; Kent, Brian P.; Klei, Lambertus; Ringquist, Steven; Trucco, Massimo; Roeder, Kathryn; Devlin, Bernie

    2015-01-01

    We propose a method to analyze family-based samples together with unrelated cases and controls. The method builds on the idea of matched case–control analysis using conditional logistic regression (CLR). For each trio within the family, a case (the proband) and matched pseudo-controls are constructed, based upon the transmitted and untransmitted alleles. Unrelated controls, matched by genetic ancestry, supplement the sample of pseudo-controls; likewise unrelated cases are also paired with genetically matched controls. Within each matched stratum, the case genotype is contrasted with control pseudo-control genotypes via CLR, using a method we call matched-CLR (mCLR). Eigenanalysis of numerous SNP genotypes provides a tool for mapping genetic ancestry. The result of such an analysis can be thought of as a multidimensional map, or eigenmap, in which the relative genetic similarities and differences amongst individuals is encoded in the map. Once constructed, new individuals can be projected onto the ancestry map based on their genotypes. Successful differentiation of individuals of distinct ancestry depends on having a diverse, yet representative sample from which to construct the ancestry map. Once samples are well-matched, mCLR yields comparable power to competing methods while ensuring excellent control over Type I error. PMID:20862653

  13. Using ancestry matching to combine family-based and unrelated samples for genome-wide association studies.

    Science.gov (United States)

    Crossett, Andrew; Kent, Brian P; Klei, Lambertus; Ringquist, Steven; Trucco, Massimo; Roeder, Kathryn; Devlin, Bernie

    2010-12-10

    We propose a method to analyze family-based samples together with unrelated cases and controls. The method builds on the idea of matched case-control analysis using conditional logistic regression (CLR). For each trio within the family, a case (the proband) and matched pseudo-controls are constructed, based upon the transmitted and untransmitted alleles. Unrelated controls, matched by genetic ancestry, supplement the sample of pseudo-controls; likewise unrelated cases are also paired with genetically matched controls. Within each matched stratum, the case genotype is contrasted with control/pseudo-control genotypes via CLR, using a method we call matched-CLR (mCLR). Eigenanalysis of numerous SNP genotypes provides a tool for mapping genetic ancestry. The result of such an analysis can be thought of as a multidimensional map, or eigenmap, in which the relative genetic similarities and differences amongst individuals is encoded in the map. Once constructed, new individuals can be projected onto the ancestry map based on their genotypes. Successful differentiation of individuals of distinct ancestry depends on having a diverse, yet representative sample from which to construct the ancestry map. Once samples are well-matched, mCLR yields comparable power to competing methods while ensuring excellent control over Type I error.

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

  15. Comparison of delayed matching-to-sample performance in monkeys and children.

    Science.gov (United States)

    Chelonis, John J; Cox, Andrew R; Karr, Michael J; Prunty, Patricia K; Baldwin, Ronald L; Paule, Merle G

    2014-03-01

    Although research has consistently demonstrated that accuracy on a variety of memory tasks decreases as delay increases, relatively little research has been conducted to quantify this relationship across development in humans or directly compare rates of forgetting between humans and monkeys. This study utilized a delayed matching-to-sample (DMTS) task to compare the relative contributions of proactive interference and attention on the rate of forgetting in monkeys and children. The performance of 1125 children from four to fourteen years of age and 10 adult rhesus monkeys was compared. For this DMTS task, a shape was displayed on the center one of three press-plates. After a delay, the subjects were required to match the original shape with one of three choice shapes to receive a banana-flavored food pellet for monkeys, or a nickel for children. A modified power function provided an excellent fit for the data for monkeys and children. The forgetting rates in children decreased with age, and the forgetting rates for monkeys were most comparable to those of younger children. The data also suggest that proactive interference did not significantly contribute to the forgetting rates for monkeys or younger children. Further, the monkeys appeared to attend to the task at a level similar to that of younger children as evidenced by the similarities in response latencies. The results from this study indicate that the rate of forgetting in monkeys, as well as the mechanisms underlying this rate, appears to share more similarities with that of younger children than of older children.

  16. Delayed matching to sample: reinforcement has opposite effects on resistance to change in two related procedures.

    Science.gov (United States)

    Nevin, John A; Shahan, Timothy A; Odum, Amy L; Ward, Ryan

    2012-12-01

    The effects of reinforcement on delayed matching to sample (DMTS) have been studied in two within-subjects procedures. In one, reinforcer magnitudes or probabilities vary from trial to trial and are signaled within trials (designated signaled DMTS trials). In the other, reinforcer probabilities are consistent for a series of trials produced by responding on variable-interval (VI) schedules within multiple-schedule components (designated multiple VI DMTS). In both procedures, forgetting functions in rich trials or components are higher than and roughly parallel to those in lean trials or components. However, during disruption, accuracy has been found to decrease more in rich than in lean signaled DMTS trials and, conversely, to decrease more in lean than in rich multiple VI DMTS components. In the present study, we compared these procedures in two groups of pigeons. In baseline, forgetting functions in rich trials or components were higher than and roughly parallel to those in lean trials or components, and were similar between the procedures. During disruption by prefeeding or extinction, accuracy decreased more in rich signaled DMTS trials, whereas accuracy decreased more in lean multiple VI DMTS components. These results replicate earlier studies and are predicted by a model of DMTS from Nevin, Davison, Odum, and Shahan (2007).

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

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

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

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

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

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

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

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

  5. Rational Design and Development of Reactive Multifunctional Micellar Composite Nano-particles for Destruction of Bio-agents

    Science.gov (United States)

    2015-02-01

    catalyst, which can be used to conduct photo degradation of bio-agents along with aero-oxidation. To homogenously embed gold nanoparticles within... nanoparticles . TiN is a gold color semiconductor, in which the Ti(III) is not a stable valence state of Ti. Si@TiN heterojunctions also can be... nanoparticles , , multifunction porous metal oxide-silica composites, porous silicon - Titania and PSi-silver heterojunctions ) have been successfully

  6. Modeling of inter-sample variation in flow cytometric data with the joint clustering and matching procedure.

    Science.gov (United States)

    Lee, Sharon X; McLachlan, Geoffrey J; Pyne, Saumyadipta

    2016-01-01

    We present an algorithm for modeling flow cytometry data in the presence of large inter-sample variation. Large-scale cytometry datasets often exhibit some within-class variation due to technical effects such as instrumental differences and variations in data acquisition, as well as subtle biological heterogeneity within the class of samples. Failure to account for such variations in the model may lead to inaccurate matching of populations across a batch of samples and poor performance in classification of unlabeled samples. In this paper, we describe the Joint Clustering and Matching (JCM) procedure for simultaneous segmentation and alignment of cell populations across multiple samples. Under the JCM framework, a multivariate mixture distribution is used to model the distribution of the expressions of a fixed set of markers for each cell in a sample such that the components in the mixture model may correspond to the various populations of cells, which have similar expressions of markers (that is, clusters), in the composition of the sample. For each class of samples, an overall class template is formed by the adoption of random-effects terms to model the inter-sample variation within a class. The construction of a parametric template for each class allows for direct quantification of the differences between the template and each sample, and also between each pair of samples, both within or between classes. The classification of a new unclassified sample is then undertaken by assigning the unclassified sample to the class that minimizes the distance between its fitted mixture density and each class density as provided by the class templates. For illustration, we use a symmetric form of the Kullback-Leibler divergence as a distance measure between two densities, but other distance measures can also be applied. We show and demonstrate on four real datasets how the JCM procedure can be used to carry out the tasks of automated clustering and alignment of cell

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

  8. Prevention of eating disorders among minority youth: a matched-sample repeated measures study.

    Science.gov (United States)

    Cook-Cottone, Catherine; Jones, Lakaii A; Haugli, Sara

    2010-01-01

    The purpose of this study was to examine ethnic differences in primary prevention programs for eating disorders in young girls. In order to address the dearth of research in this area, this study examined the comparative response to an eating disorder prevention program on fifth-grade minority and White females. Pre- and post-test data were collected from 10 groups participating in the prevention program for a total of 50 girls. Minority participants and White participants were then matched based on Body Mass Index (BMI) and socioeconomic status in order to examine ethnic differences in group effectiveness. Findings indicated that minority and White participants were equally responsive to the prevention program.

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

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

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

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

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

    Directory of Open Access Journals (Sweden)

    Matthews Natasha

    2012-05-01

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

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

  14. Using pattern analysis matching to differentiate TBI and PTSD in a military sample.

    Science.gov (United States)

    Meyers, John E; Miller, Ronald M; Tuita, Alexa R R

    2014-01-01

    Distinguishing between traumatic brain injury (TBI) residuals and the effects of posttraumatic stress disorder (PTSD) during neuropsychological evaluation can be difficult because of significant overlap of symptom presentation. Using a standardized battery of tests, an artificial neural network was used to create an algorithm to perform pattern analysis matching (PAM) functions that can be used to assist with diagnosis. PAM analyzes a patient's neuropsychological data and provides a best fit classification, according to one of four groups: TBI, PTSD, malingering/invalid data, or "other" (depressed/anxious/postconcussion syndrome/normal). The original PAM was modeled on civilian data; the current study was undertaken using a database of 100 active-duty army service personnel who were referred for neuropsychological assessment in a military TBI clinic. The PAM classifications showed 90% overall accuracy when compared with clinicians' diagnoses. The PAM function is able to classify detailed neuropsychological profiles from a military population with a high degree of accuracy and is able to distinguish between TBI, PTSD, malingering/invalid data, or "other." PAM is a useful tool to help with clinical decision-making.

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

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

  17. Accurate recapture identification for genetic mark-recapture studies with error-tolerant likelihood-based match calling and sample clustering.

    Science.gov (United States)

    Sethi, Suresh A; Linden, Daniel; Wenburg, John; Lewis, Cara; Lemons, Patrick; Fuller, Angela; Hare, Matthew P

    2016-12-01

    Error-tolerant likelihood-based match calling presents a promising technique to accurately identify recapture events in genetic mark-recapture studies by combining probabilities of latent genotypes and probabilities of observed genotypes, which may contain genotyping errors. Combined with clustering algorithms to group samples into sets of recaptures based upon pairwise match calls, these tools can be used to reconstruct accurate capture histories for mark-recapture modelling. Here, we assess the performance of a recently introduced error-tolerant likelihood-based match-calling model and sample clustering algorithm for genetic mark-recapture studies. We assessed both biallelic (i.e. single nucleotide polymorphisms; SNP) and multiallelic (i.e. microsatellite; MSAT) markers using a combination of simulation analyses and case study data on Pacific walrus (Odobenus rosmarus divergens) and fishers (Pekania pennanti). A novel two-stage clustering approach is demonstrated for genetic mark-recapture applications. First, repeat captures within a sampling occasion are identified. Subsequently, recaptures across sampling occasions are identified. The likelihood-based matching protocol performed well in simulation trials, demonstrating utility for use in a wide range of genetic mark-recapture studies. Moderately sized SNP (64+) and MSAT (10-15) panels produced accurate match calls for recaptures and accurate non-match calls for samples from closely related individuals in the face of low to moderate genotyping error. Furthermore, matching performance remained stable or increased as the number of genetic markers increased, genotyping error notwithstanding.

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

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

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

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

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

  3. Signature-Discovery Approach for Sample Matching of a Nerve-Agent Precursor using Liquid Chromatography–Mass Spectrometry, XCMS, and Chemometrics

    Energy Technology Data Exchange (ETDEWEB)

    Fraga, Carlos G.; Clowers, Brian H.; Moore, Ronald J.; Zink, Erika M.

    2010-05-15

    This report demonstrates the use of bioinformatic and chemometric tools on liquid chromatography mass spectrometry (LC-MS) data for the discovery of ultra-trace forensic signatures for sample matching of various stocks of the nerve-agent precursor known as methylphosphonic dichloride (dichlor). The use of the bioinformatic tool known as XCMS was used to comprehensively search and find candidate LC-MS peaks in a known set of dichlor samples. These candidate peaks were down selected to a group of 34 impurity peaks. Hierarchal cluster analysis and factor analysis demonstrated the potential of these 34 impurities peaks for matching samples based on their stock source. Only one pair of dichlor stocks was not differentiated from one another. An acceptable chemometric approach for sample matching was determined to be variance scaling and signal averaging of normalized duplicate impurity profiles prior to classification by k-nearest neighbors. Using this approach, a test set of dichlor samples were all correctly matched to their source stock. The sample preparation and LC-MS method permitted the detection of dichlor impurities presumably in the parts-per-trillion (w/w). The detection of a common impurity in all dichlor stocks that were synthesized over a 14-year period and by different manufacturers was an unexpected discovery. Our described signature-discovery approach should be useful in the development of a forensic capability to help in criminal investigations following chemical attacks.

  4. Matching-to-Sample and Stimulus-Pairing-Observation Procedures in Stimulus Equivalence: The Effects of Number of Trials and Stimulus Arrangement

    Science.gov (United States)

    Kinloch, Jennifer May; McEwan, James Stewart Anderson; Foster, T. Mary

    2013-01-01

    Studies comparing the effectiveness of the stimulus-pairing-observation and matching-to-sample procedures in facilitating equivalence relations have reported conflicting findings. This study compared the effectiveness of these procedures and examined the effect of stimulus arrangement and the number of training trials completed prior to each…

  5. Re-Emergence of Under-Selected Stimuli, after the Extinction of Over-Selected Stimuli in an Automated Match to Samples Procedure

    Science.gov (United States)

    Broomfield, Laura; McHugh, Louise; Reed, Phil

    2008-01-01

    Stimulus over-selectivity occurs when one of potentially many aspects of the environment comes to control behaviour. In two experiments, adults with no developmental disabilities, were trained and tested in an automated match to samples (MTS) paradigm. In Experiment 1, participants completed two conditions, in one of which the over-selected…

  6. Pattern matching

    NARCIS (Netherlands)

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

    2009-01-01

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

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

  8. Combined Effect of Some Bio-Agents on the Grasshopper, Hetiracris littoralis Under Semi-Field Condition

    Directory of Open Access Journals (Sweden)

    Aziza Sharaby

    2013-06-01

    Full Text Available LC50 of the alchoholic-80% extract of Euphorbia pulchrrima (0.714%, essential oil of Garlic plant Allium sativum (0.067% and nematodes of Steinernima sp. and Heterorhabditis sp. (500 IJs/ml, were tested for their solely and/or combined toxic effects and for their effects on some biological aspects against the grasshopper, Heteracris littoralis 1st instar nymphs under semi-field condition. The joint action of the mixture of the most effective extract (E. pulchrrima and oil (Garlic oil exhibit an antagonistic effect with co-toxicity index of (–24, despite the increase the proportion of death in the mixture for all the tested groups the type of interaction were antagonism, all the tested materials had variable mode of action which resulted in significantly antagonistic effects. Euphorbia 80% methanol extract and Garlic oil may use separately or in combination as alternatives safe tools against H. littoralis grasshopper. Semi-field experiments cleared that nematodes in combination with the oil or extract increased the mortality percentage. The combination mixture of extract, oil and nematode significantly affected development, reproduction and life cycle of H. littoralis. Lethal effect varied with regard to the nematode species. Semi-field experiment of the plant extract, plant oil and their mixture revealed some changes on the biological aspects, an increase in the nymphal period, pre-oviposition, oviposition and post-oviposition periods. There is vigorous decrease in the female fecundity and fertility. The control of the insect by nematode and sub-lethal dose of plant extract or plant volatile oil as biological control may enhance their lethal effect on insect pest when applied simultaneously. Combination mixture of the tested bio-agent could be considered as possible means for use in programs of integrated pest management of H. littoralis grasshopper.

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

  10. Pattern matching

    OpenAIRE

    Hak, Tony; Dul, Jan

    2009-01-01

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

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

  12. Concentrations of "legacy" and novel brominated flame retardants in matched samples of UK kitchen and living room/bedroom dust.

    Science.gov (United States)

    Kuang, Jiangmeng; Ma, Yuning; Harrad, Stuart

    2016-04-01

    Concentrations of polybrominated diphenyl ethers (PBDEs), hexabromocyclododecanes (HBCDDs) and 5 novel brominated flame retardants (NBFRs) were measured in paired samples of kitchen and living room/bedroom dust sampled in 2015 from 30 UK homes. BDE-209 was most abundant (22-170,000 ng/g), followed by γ-HBCDD (1.7-21,000 ng/g), α-HBCDD (5.2-4,900 ng/g), β-HBCDD (2.3-1,600 ng/g), BDE-99 (2.6-1,440 ng/g), BDE-47 (0.4-940 ng/g), decabromodiphenyl ethane (DBDPE) (nd-680 ng/g) and bis(2-ethylhexyl)-3,4,5,6-tetrabromo-phthalate (BEH-TEBP) (2.7-630 ng/g). The concentrations in kitchens and living rooms/bedrooms are moderate compared with previous studies. Concentrations of BDE-209 in living room/bedroom dust were significantly lower and those of DBDPE significantly higher (p kitchens. With the exception of BDE-28, pentabromoethylbenzene (PBEB) and DBDPE, these differences were significant (p < 0.05). No specific source was found that could account for the higher concentrations in living rooms/bedrooms.

  13. 基于抽样的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%。

  14. QR code sampling method based on adaptive match%基于自适应匹配的QR码取样方法

    Institute of Scientific and Technical Information of China (English)

    宋贤媛; 张多英

    2015-01-01

    The QR code acquired by camera always comes with some distortion, so it needs to be recognised to the standard QR code before decode. Aimming at the QR coderecognition, distortion and correction is analyzed and studied in this paper. Some inevitable distortion still existed based on the tilt correction and geometric correction;the traditional method can’t sample the QR code accurately. According to the problem, this paper proposes the adaptive match method, acquire the effective sampling region of QRcode by the matching rate of two adjacent pixel row(column). Experiment shows that the method is real-time with good stability, it can sampling the QR code fast and accurately.%通常由相机获取的QR码图像都带有一些失真,所以在译码前需要对获取的QR码图像进行识别以得到标准规格的QR码。针对QR码识别中的失真和校正进行了分析研究,解决了某些QR码经过倾斜校正和几何校正后仍存在一些无法避免的失真而无法被传统方法准确取样的问题,提出了一种自适应匹配取样法,根据相邻行(列)像素的匹配度准确获取QR码的模块有效取样区域。实验证明该方法稳定性好,能够快速准确地对QR码进行取样。

  15. Sample-whitened matched filters

    DEFF Research Database (Denmark)

    Andersen, Ib

    1973-01-01

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

  16. Within-subject decline in delayed-non-match-to-sample radial arm maze performance in aging Sprague-Dawley rats.

    Science.gov (United States)

    Chrobak, J J; Hanin, I; Lorens, S A; Napier, T C

    1995-04-01

    A within-subject design was used to examine delayed-non-match-to-sample radial arm maze performance in aging (6-18 months) male Sprague-Dawley rats. A decrease in correct choices and an increase in retroactive errors were observed at all retention intervals at 18 months of age compared with performance at 6 or 12 months. No age by retention interval interaction was observed. Neither age nor increasing retention interval influenced proactive errors during the retention test. The observation of an age- and delay-dependent increase in retroactive errors, but not proactive errors, suggests that the deficit relates to a memory dysfunction as opposed to a generalized performance deficit.

  17. Engineer Novel Anticancer Bioagents

    Science.gov (United States)

    2009-10-01

    agar supplemented with 200 mg/ml Ap and 25 mg/ml chloramphenicol (Cm) at 37C. Vector pBMTL3-FLP2 was subsequently cured from the mutants by steaking ...NADP+) used in assays was purged extensively with bubbling of nitrogen gas. For a complete assay, 5 ml reduced FK228 (100 mM) and 1 ml enzyme solution...replacement Target depH gene with an internal portion replacement by FRT cassette A 85-bp scar is left at the side of deletion FRT cassette excision

  18. Engineer Novel Anticancer Bioagents

    Science.gov (United States)

    2010-10-01

    selection (hence to create marker-free genetically modified organism – GMO as required by FDA regulations) have failed. The overall transformation...free genetically modified organism – GMO , as required by FDA regulations). Key Research Status 1. Reconstitution of a complete FK228 biosynthetic...5 Food and Drug Administration (FDA) as a new class of anticancer drug for the treatment of 1 cutaneous T-cell lymphoma (CTCL) (1). FK228

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

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

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

    Directory of Open Access Journals (Sweden)

    Abbas S. Lokman

    2010-01-01

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

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

  3. Matched-pair classification

    Energy Technology Data Exchange (ETDEWEB)

    Theiler, James P [Los Alamos National Laboratory

    2009-01-01

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

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

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

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

    Science.gov (United States)

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

    2005-01-01

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

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

  8. Matching with Commitments

    CERN Document Server

    Costello, Kevin; Tripathi, Pushkar

    2012-01-01

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

  9. Statistics of polarisation matching

    NARCIS (Netherlands)

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

    2014-01-01

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

  10. Matching Through Position Auctions

    OpenAIRE

    Terence Johnson

    2009-01-01

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

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

  12. Best matching theory & applications

    CERN Document Server

    Moghaddam, Mohsen

    2017-01-01

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

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

    Science.gov (United States)

    Austin, Peter C; Lee, Douglas S

    2009-06-01

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

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

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

  16. Matchings in hexagonal cacti

    Directory of Open Access Journals (Sweden)

    E. J. Farrell

    1987-01-01

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

  17. Monkeys Match and Tally Quantities across Senses

    Science.gov (United States)

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

    2008-01-01

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

  18. Understanding Y haplotype matching probability.

    Science.gov (United States)

    Brenner, Charles H

    2014-01-01

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

  19. Ontology Matching Across Domains

    Science.gov (United States)

    2010-05-01

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

  20. Equivalência de estímulos após treino de pareamento consistente de estímulos com atraso do modelo Stimulus equivalence after consistent delayed matching-to-sample

    Directory of Open Access Journals (Sweden)

    Grauben José Alves de Assis

    2003-04-01

    Full Text Available Estudos anteriores documentaram a formação de relações de equivalência a partir do treino com pareamento consistente de estímulos. Este estudo, com figuras usuais, objetivou verificar os efeitos de um procedimento similar, mas com atraso na apresentação do modelo, em oito universitários de ambos os sexos. Foi usado um microcomputador com tela sensível ao toque. No ensino das discriminações condicionais AB e AC, intercalado aos testes de simetria BA e CA, e de equivalência BC e CB, o modelo era apresentado na "janela" central da tela; após a resposta ao modelo, este ficava ausente, e três estímulos de comparação, um dos quais o consistente (Sc, eram apresentados, simultaneamente, nas "janelas" laterais, sem conseqüências diferenciais para as respostas corretas e incorretas. Sete participantes alcançaram o critério (100% de acerto, cinco demonstraram as relações de simetria e um demonstrou equivalência. Esses resultados replicaram parcialmente os estudos anteriores.Previous studies have shown the formation of equivalence relations following training by stimulus consistency matching. Using common figures as stimuli, the aim of this experiment was to verify the effects of a similar procedure involving, however, delayed smaple stimulus presentation among eight university students of both sexes. A microcomputer with a touch-sensitive screen was utilized. Between training of conditional discriminations, AB and AC, symmetry (BA, CA and equivalence tests (BC, CB were inserted; the sample stimulus appeared in the center of the screen. Following response, the sample was withdrawn, and three comparison stimuli - one of them consistent - were shown simultaneously in the side windows, without differential consequences for correct or incorrect responses. Seven respondents reached criterion, five demonstrated having attained symmetry, and one, equivalence relations. These results replicated, in part, the outcomes of previous experiments.

  1. Learning Graph Matching

    CERN Document Server

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

    2008-01-01

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

  2. Learning graph matching.

    Science.gov (United States)

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

    2009-06-01

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

  3. Latent fingerprint matching.

    Science.gov (United States)

    Jain, Anil K; Feng, Jianjiang

    2011-01-01

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

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

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

  6. Cognitive Levels Matching.

    Science.gov (United States)

    Brooks, Martin; And Others

    1983-01-01

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

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

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

  9. Bayesian grid matching

    DEFF Research Database (Denmark)

    Hartelius, Karsten; Carstensen, Jens Michael

    2003-01-01

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

  10. Middle matching mining algorithm

    Institute of Scientific and Technical Information of China (English)

    GUO Ping; CHEN Li

    2003-01-01

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

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

  12. Polytypic pattern matching

    NARCIS (Netherlands)

    Jeuring, J.T.

    2007-01-01

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

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

  14. 'Wiggle matching' radiocarbon dates

    NARCIS (Netherlands)

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

    2001-01-01

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

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

  16. Factorized Graph Matching.

    Science.gov (United States)

    Zhou, Feng; de la Torre, Fernando

    2015-11-19

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

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

  18. Matching Supernovae to Galaxies

    Science.gov (United States)

    Kohler, Susanna

    2016-12-01

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

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

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

  1. Resurgence matches quantization

    Science.gov (United States)

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

    2017-04-01

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

  2. Characteristic Evolution and Matching

    Directory of Open Access Journals (Sweden)

    Winicour Jeffrey

    2005-12-01

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

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

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

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

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

  7. Generalized Orthogonal Matching Pursuit

    CERN Document Server

    Wang, Jian; Shim, Byonghyo

    2011-01-01

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

  8. Optimizing Transmission Line Matching Circuits

    OpenAIRE

    Novak, S.

    1996-01-01

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

  9. The earliest matches.

    Directory of Open Access Journals (Sweden)

    Naama Goren-Inbar

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

  10. The earliest matches.

    Science.gov (United States)

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

    2012-01-01

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

  11. Characteristic Evolution and Matching

    Directory of Open Access Journals (Sweden)

    Winicour Jeffrey

    2009-04-01

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

  12. Characteristic Evolution and Matching

    Directory of Open Access Journals (Sweden)

    Jeffrey Winicour

    2012-01-01

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

  13. Quantum image matching

    Science.gov (United States)

    Jiang, Nan; Dang, Yijie; Wang, Jian

    2016-09-01

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

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

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

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

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

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

  19. Voice Matching Using Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Abhishek Bal

    2014-03-01

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

  20. Matched Field Tomographic Inversion for Geoacoustic Properties

    Science.gov (United States)

    2016-06-07

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

  1. Towards optimal packed string matching

    DEFF Research Database (Denmark)

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

    2014-01-01

    -size string-matching instruction wssm is available in contemporary commodity processors. The other word-size maximum-suffix instruction wslm is only required during the pattern pre-processing. Benchmarks show that our solution can be efficiently implemented, unlike some prior theoretical packed string......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...... matching work.(b) We also consider the complexity of the packed string matching problem in the classical word-RAM model in the absence of the specialized micro-level instructions wssm and wslm. We propose micro-level algorithms for the theoretically efficient emulation using parallel algorithms techniques...

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

  3. 49 CFR 173.186 - Matches.

    Science.gov (United States)

    2010-10-01

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

  4. Pattern Matching in Multiple Streams

    CERN Document Server

    Clifford, Raphael; Porat, Ely; Sach, Benjamin

    2012-01-01

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

  5. Statistical methods for history matching

    DEFF Research Database (Denmark)

    Johansen, Kent

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

  6. MATCHING IN INFORMAL FINANCIAL INSTITUTIONS.

    Science.gov (United States)

    Eeckhout, Jan; Munshi, Kaivan

    2010-09-01

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

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

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

  9. Review og pattern matching approaches

    DEFF Research Database (Denmark)

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

    1996-01-01

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

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

  11. Robust spatiotemporal matching of electronic slides to presentation videos.

    Science.gov (United States)

    Fan, Quanfu; Barnard, Kobus; Amir, Arnon; Efrat, Alon

    2011-08-01

    We describe a robust and efficient method for automatically matching and time-aligning electronic slides to videos of corresponding presentations. Matching electronic slides to videos provides new methods for indexing, searching, and browsing videos in distance-learning applications. However, robust automatic matching is challenging due to varied frame composition, slide distortion, camera movement, low-quality video capture, and arbitrary slides sequence. Our fully automatic approach combines image-based matching of slide to video frames with a temporal model for slide changes and camera events. To address these challenges, we begin by extracting scale-invariant feature-transformation (SIFT) keypoints from both slides and video frames, and matching them subject to a consistent projective transformation (homography) by using random sample consensus (RANSAC). We use the initial set of matches to construct a background model and a binary classifier for separating video frames showing slides from those without. We then introduce a new matching scheme for exploiting less distinctive SIFT keypoints that enables us to tackle more difficult images. Finally, we improve upon the matching based on visual information by using estimated matching probabilities as part of a hidden Markov model (HMM) that integrates temporal information and detected camera operations. Detailed quantitative experiments characterize each part of our approach and demonstrate an average accuracy of over 95% in 13 presentation videos.

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

  13. Matching illumination of solid objects.

    Science.gov (United States)

    Pont, Sylvia C; Koenderink, Jan J

    2007-04-01

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

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

  15. Error-tolerant Tree Matching

    CERN Document Server

    Oflazer, K

    1996-01-01

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

  16. Memristor-based pattern matching

    Science.gov (United States)

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

    2014-10-01

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

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

  18. Relaxation matching algorithm for moving photogrammetry

    Science.gov (United States)

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

    2015-02-01

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

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

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

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

  2. Matchings with Externalities and Attitudes

    DEFF Research Database (Denmark)

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

    2013-01-01

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

  3. Topics in combinatorial pattern matching

    DEFF Research Database (Denmark)

    Vildhøj, Hjalte Wedel

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

  4. An Implementation of Bigraph Matching

    DEFF Research Database (Denmark)

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

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

  5. Hippocampal lesions impair performance on a conditional delayed matching and non-matching to position task in the rat.

    Science.gov (United States)

    Sloan, Hazel L; Döbrössy, Màtè; Dunnett, Stephen B

    2006-08-10

    The hippocampus is thought to be involved in a range of cognitive processes, from the ability to acquire new memories, to the ability to learn about spatial relationships. Humans and monkeys with damage to the hippocampus are typically impaired on delayed matching to sample tasks, of which the operant delayed matching to position task (DMTP) is a rat analogue. The reported effects of hippocampal damage on DMTP vary, ranging from delay-dependent deficits to no deficit whatsoever. The present study investigates a novel memory task; the conditional delayed matching/non-matching to position task (CDM/NMTP) in the Skinner box. CDM/NMTP uses the presence of specific stimulus cues to signify whether a particular trial is matching or non-matching in nature. Thus, it incorporates both the task contingencies within one session, and supplements the requirement for remembering the side of the lever in the sample phase with attending to the stimulus and remembering the conditional discrimination for the rule. Rats were trained preoperatively and the effects of bilateral excitotoxic lesions of the hippocampus were examined on postoperative retention of the task. Rats with lesions of the hippocampus incurred a significant impairment on the task that was manifest at all delays intervals. Despite a bias towards matching during training, trials of either type were performed with equivalent accuracy and neither rule was affected differentially by the lesion. This task may prove useful in determining the cognitive roles of a range of brain areas.

  6. Matching of equivalent field regions

    DEFF Research Database (Denmark)

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

    2005-01-01

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

  7. Incremental pattern matching for regular expressions

    NARCIS (Netherlands)

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

    2012-01-01

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

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

    Science.gov (United States)

    2010-07-01

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

  9. Matching Games with Additive Externalities

    DEFF Research Database (Denmark)

    Branzei, Simina; Michalak, Tomasz; Rahwan, Talal

    2012-01-01

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

  10. Duplicate-based Schema Matching

    OpenAIRE

    Bilke, Alexander

    2007-01-01

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

  11. Template Matching on Parallel Architectures,

    Science.gov (United States)

    1985-07-01

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

  12. Spurring Innovation with Matching Grants

    OpenAIRE

    2015-01-01

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

  13. Monetary Exchange with Multilateral Matching

    DEFF Research Database (Denmark)

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

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

  14. On String Matching with Mismatches

    Directory of Open Access Journals (Sweden)

    Marius Nicolae

    2015-05-01

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

  15. The noise factor of receiver coil matching networks in MRI.

    Science.gov (United States)

    Cao, Xueming; Fischer, Elmar; Gruschke, Oliver; Korvink, Jan G; Hennig, Jürgen; Maunder, Adam M; De Zanche, Nicola; Zaitsev, Maxim

    2017-04-01

    In typical MRI applications the dominant noise sources in the received signal are the sample, the coil loop and the preamplifier. We hypothesize that in some cases (e.g. for very small receiver coils) the matching network noise has to be considered explicitly. Considering the difficulties of direct experimental determinations of the noise factor of matching networks with sufficient accuracy, it is helpful to estimate the noise factor by calculation. A useful formula of the coil matching network is obtained by separating commonly used coil matching network into different stages and calculating their noise factor analytically by a combination of the noise from these stages. A useful formula of the coil matching network is obtained. ADS simulations are performed to verify the theoretical predictions. Thereafter carefully-designed proof-of-concept phantom experiments are carried out to qualitatively confirm the predicted SNR behavior. The matching network noise behavior is further theoretically investigated for a variety of scenarios. It is found that in practice the coil matching network noise can be improved by adjusting the coil open port resonant frequency.

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

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

  19. Hybrid Schema Matching for Deep Web

    Science.gov (United States)

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

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

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

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

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

  3. Color matching in facial prosthetics: A systematic review.

    Science.gov (United States)

    Ranabhatt, Rani; Singh, Kamleshwar; Siddharth, Ramashanker; Tripathi, Shuchi; Arya, Deeksha

    2017-01-01

    Color matching to the surrounding skin is extremely important in patients wearing maxillofacial prostheses. It is of utmost importance to know the different techniques of color matching and coloring in maxillofacial prostheses. The purpose of this study is to review the literature data with regard to color matching in maxillofacial prosthetics. An electronic search of peer review restricted to English language dental literature was conducted to identify the relevant scientific article on color matching and coloring in maxillofacial prostheses. The publication year was up to December 2015 so that the search could include all the articles provided in that particular database. Two independent observers independently read the abstracts and later preselected full-text articles. A full-text review was carried out only for 15 articles. Out of the 15 articles, 7 were related to coloring using tinting, spraying, milling, and use of commercial cosmetics. Three studies were related to shade matching in maxillofacial prostheses. Two studies conducted the measurement of color in maxillofacial prostheses. Only one study had explained color and its relevance in maxillofacial prosthetics. Only one study was done for reproducing silicone shade guide matching Indian skin color. In addition, a single pilot study was done to measure facial skin and lip color in a human population sample stratified by race, gender, and age. Currently, there is no evidence discussing the best technique available for perfectly matching the color for the fabrication of maxillofacial prostheses. However, the latest instruments such as spectrophotometer and colorimeters are believed to have improved efficiency in matching the color.

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

  5. Making Palm Print Matching Mobile

    CERN Document Server

    Fang, Li; Chian, Cheng Shao

    2009-01-01

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

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

  7. Concerns on Monotonic Imbalance Bounding Matching Methods

    OpenAIRE

    Yatracos, Yannis G.

    2013-01-01

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

  8. 13 CFR 130.450 - Matching funds.

    Science.gov (United States)

    2010-01-01

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

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

  10. 13 CFR 102.40 - Computer matching.

    Science.gov (United States)

    2010-01-01

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

  11. 39 CFR 266.10 - Computer matching.

    Science.gov (United States)

    2010-07-01

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

  12. Connections between the matching and chromatic polynomials

    Directory of Open Access Journals (Sweden)

    E. J. Farrell

    1992-01-01

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

  13. DEFICIENT CUBIC SPLINES WITH AVERAGE SLOPE MATCHING

    Institute of Scientific and Technical Information of China (English)

    V. B. Das; A. Kumar

    2005-01-01

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

  14. Susceptibility-matched plugs for microcoil NMR probes.

    Science.gov (United States)

    Kc, Ravi; Gowda, Yashas N; Djukovic, Danijel; Henry, Ian D; Park, Gregory H J; Raftery, Daniel

    2010-07-01

    For mass-limited samples, the residual sample volume outside the detection coil is an important concern, as is good base line resolution. Here, we present the construction and evaluation of magnetic susceptibility-matched plugs for microcoil NMR sample cells which address these issues. Mixed-epoxy glue and ultem tube plugs that have susceptibility values close to those of perfluorocarbon FC-43 (fluorinert) and copper were used in small volume (0.5-2 microL) and larger volume (15-20 microL) thin glass capillary sample cells. Using these plugs, the sample volume efficiency (i.e. ratio of active volume to total sample volume in the microcoil NMR cell) was improved by 6-12-fold without sensitivity and resolution trade-offs. Comparison with laser etched or heat etched microcoil sample cells is provided. The approaches described are potentially useful in metabolomics for biomarkers detection in mass limited biological samples.

  15. Susceptibility-matched plugs for microcoil NMR probes

    Science.gov (United States)

    Kc, Ravi; Gowda, Yashas N.; Djukovic, Danijel; Henry, Ian D.; Park, Gregory H. J.; Raftery, Daniel

    2010-07-01

    For mass-limited samples, the residual sample volume outside the detection coil is an important concern, as is good base line resolution. Here, we present the construction and evaluation of magnetic susceptibility-matched plugs for microcoil NMR sample cells which address these issues. Mixed-epoxy glue and ultem tube plugs that have susceptibility values close to those of perfluorocarbon FC-43 (fluorinert) and copper were used in small volume (0.5-2 μL) and larger volume (15-20 μL) thin glass capillary sample cells. Using these plugs, the sample volume efficiency (i.e. ratio of active volume to total sample volume in the microcoil NMR cell) was improved by 6-12-fold without sensitivity and resolution trade-offs. Comparison with laser etched or heat etched microcoil sample cells is provided. The approaches described are potentially useful in metabolomics for biomarkers detection in mass limited biological samples.

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

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

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

  19. A match made by modafinil: probability matching in choice decisions and spatial attention.

    Science.gov (United States)

    Geng, Joy J; Soosman, Steffan; Sun, Yile; Diquattro, Nicholas E; Stankevitch, Beth; Minzenberg, Michael J

    2013-05-01

    When predicting where a target or reward will be, participants tend to choose each location commensurate with the true underlying probability (i.e., probability match). The strategy of probability matching involves independent sampling of high and low probability locations on separate trials. In contrast, models of probabilistic spatial attention hypothesize that on any given trial attention will either be weighted toward the high probability location or be distributed equally across all locations. Thus, the strategies of probabilistic sampling by choice decisions and spatial attention appear to differ with regard to low-probability events. This distinction is somewhat surprising because similar brain mechanisms (e.g., pFC-mediated cognitive control) are thought to be important in both functions. Thus, the goal of the current study was to examine the relationship between choice decisions and attentional selection within single trials to test for any strategic differences, then to determine whether that relationship is malleable to manipulations of catecholamine-modulated cognitive control with the drug modafinil. Our results demonstrate that spatial attention and choice decisions followed different strategies of probabilistic information selection on placebo, but that modafinil brought the pattern of spatial attention into alignment with that of predictive choices. Modafinil also produced earlier learning of the probability distribution. Together, these results suggest that enhancing cognitive control mechanisms (e.g., through prefrontal cortical function) leads spatial attention to follow choice decisions in selecting information according to rule-based expectations.

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

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

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

  3. Impedance matching at arterial bifurcations.

    Science.gov (United States)

    Brown, N

    1993-01-01

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

  4. Venous Sampling

    Science.gov (United States)

    ... Physician Resources Professions Site Index A-Z Venous sampling Venous sampling is a diagnostic procedure that uses ... the limitations of venous sampling? What is venous sampling? Venous sampling is a diagnostic procedure that involves ...

  5. LACTATE PROFILE DURING GRECO-ROMAN WRESTLING MATCH

    Directory of Open Access Journals (Sweden)

    Ognjen Uljevic

    2009-11-01

    Full Text Available The objective of this study was to determine and compare lactate profile of two groups of Greco-Roman wrestlers with different competences and training experience. Study was conducted on 10 wrestles that were members of Croatian national team and 10 wrestlers that were members of Wrestling club Split. Lactate samples were collected at four intervals during control fights that were held according to international wrestling rules of World wrestling federation FILA. Values of lactate increased as competition progressed, and they were highest at the end of the match for both groups of wrestlers. According to this study there were no significant differences in lactate between two groups at the end of the match, while significant differences were noted during the match. The information about lactate profile presented in this study can be used by coaches and wrestlers to develop condition programs

  6. Characterizing ultra-thin matching layers of high-frequency ultrasonic transducer based on impedance matching principle.

    Science.gov (United States)

    Wang, Haifeng; Cao, Wenwu

    2004-02-01

    The quarter-wavelength (lambda/4) acoustic matching layer is a vital component in medical ultrasonic transducers, which can compensate for the large acoustic impedance mismatch between the piezoelectric material and the human body. At high frequencies (approximately 100 MHz), the lambda/4 matching layers become extremely thin, and the characterization of their properties becomes very challenging. We report a method to measure the phase velocity and attenuation of ultra-thin layers using the lambda/4 matching principle, in which the acoustic impedance of the thin layer is between the substrate and water. The method has been successfully used to characterize epoxy films on glass substrate. The experimental results show good agreement in the phase-velocity measurement between our proposed method and the conventional ultrasonic spectroscopy method, but the attenuation measurement is sensitive to the properties of the substrate and water medium as well as the alignment of the sample.

  7. The research of spectrophotometric color matching based on multi-peaks Gaussian fit

    Science.gov (United States)

    Li, Xiaopeng; Lv, Xuliang; Wang, Jing; Yang, Gaofeng; Jiang, Xiaojun

    2013-08-01

    Spectrophotometric color matching is an important method for computer color matching, which is more accurate but difficult than tri-stimulus values color matching, because which will result in metamerism. The fundamental theory of computer color matching is the linear relationship between Kubelka-Munk function and concentration of dye. In fact, the spectral reflectivity of every pixel in hyperspectral image composed of subpixel mixing in instantaneous field of view. According to the Glassman laws of color mixing, the mixed pixel's spectral reflectivity equals to the algebra sum of each reflectivity of subpixel multiply its area percentage. In this case, spectrophotometric color matching match the spectral reflectivity curve by adjusting the combined form of subpixel which constitute the pixel. According to numerical methods for Multi-peaks Guassian fitting, the spectral reflectivity curve can be fit as the sum of several characteristic peak, which accord with Normal Distribution. Then the spectrophotometric color matching can simplify the solution with infinite wavelength into solving the linear equations with finite known peak intensity. By using Imaging Spectrometer measure the color samples in standard color cards from different distance, the spectral reflectivity curve of each single color sample and the mixed color samples can be gotten, and the experiments results show that the spectrophotometric color matching based on Multi-peaks Gaussian fitting is superior to the tri-stimulus values color matching, and which is easy to operate.

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

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

  10. Lazy AC-Pattern Matching for Rewriting

    OpenAIRE

    Walid Belkhir; Alain Giorgetti

    2012-01-01

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

  11. Improving the Nephrology Match: the Path Forward.

    Science.gov (United States)

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

    2015-11-01

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

  12. Lazy AC-Pattern Matching for Rewriting

    Directory of Open Access Journals (Sweden)

    Walid Belkhir

    2012-04-01

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

  13. The match between horse and rider

    OpenAIRE

    Axel-Nilsson, Malin

    2015-01-01

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

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

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

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

  17. PUMA: The Positional Update and Matching Algorithm

    Science.gov (United States)

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

    2017-01-01

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

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

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

    Science.gov (United States)

    2013-12-05

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

  20. SEMI-GLOBAL MATCHING IN OBJECT SPACE

    Directory of Open Access Journals (Sweden)

    F. Bethmann

    2015-03-01

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

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

  2. Why do Worker-Firm Matches Dissolve?

    NARCIS (Netherlands)

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

    2006-01-01

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

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

    Science.gov (United States)

    Lopez, Antonio M.

    1996-01-01

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

  4. An Implementation of the Frequency Matching Method

    DEFF Research Database (Denmark)

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

    aspects of the implementation of the Fre-quency Matching method and the techniques adopted to make it com-putationally feasible also for large-scale inverse problems. The source code is publicly available at GitHub and this paper also provides an example of how to apply the Frequency Matching method...

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

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

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

  8. 28 CFR 33.21 - Match.

    Science.gov (United States)

    2010-07-01

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

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

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

    Science.gov (United States)

    Kanchana, S; Balakrishnan, G

    2015-01-01

    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.

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

  12. PUMA: The Positional Update and Matching Algorithm

    CERN Document Server

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

    2016-01-01

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

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

  14. Fast approximate quadratic programming for graph matching.

    Directory of Open Access Journals (Sweden)

    Joshua T Vogelstein

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

  15. Fast approximate quadratic programming for graph matching.

    Science.gov (United States)

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

    2015-01-01

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

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

  17. Matching Parasitic Antenna for Single RF MIMO

    DEFF Research Database (Denmark)

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

    2012-01-01

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

  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. Graphical models and point pattern matching.

    Science.gov (United States)

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

    2006-10-01

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

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

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

  2. Human-eye versus computerized color matching.

    Science.gov (United States)

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

    1999-01-01

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

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

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

  5. Impedance-matched cavity quantum memory

    CERN Document Server

    Afzelius, Mikael

    2010-01-01

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

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

    DEFF Research Database (Denmark)

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

    2014-01-01

    clubs (17.6 ± 1.1 years (±s), 71.7 ± 6.9 kg, 13.9% ± 5.0% body fat). The players ingested either a capsule of 6 mg · kg−1 b.w. caffeine or placebo (dextrose) 65 min prior to the matches. Match activities were assessed using the ZXY match analysis system, and a Yo-Yo intermittent recovery test–level 2...... (Yo-Yo IR2) was conducted immediately post-game. Heart rate was monitored throughout the game, and blood samples were obtained at baseline, half-time and after the game. There were no differences between caffeine and placebo regarding total distance covered (10,062 ± 916 vs 9854 ± 901 m), high......-game Yo-Yo IR2 performance was not different between game trials (caffeine: 829 ± 322 m; placebo 819 ± 289 m). In conclusion, oral caffeine administration does not appear to have an ergogenic effect in young football players during match play....

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

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

  9. On Stable Marriages and Greedy Matchings

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-12-11

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

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

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

  12. Clothing Matching for Visually Impaired Persons.

    Science.gov (United States)

    Yuan, Shuai; Tian, Yingli; Arditi, Aries

    2011-01-01

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

  13. AN EVEN ODD MULTIPLE PATTERN MATCHING ALGORITHM

    Directory of Open Access Journals (Sweden)

    Raju Bhukya,

    2011-03-01

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

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

  15. Slice Sampling

    CERN Document Server

    Neal, R M

    2000-01-01

    Markov chain sampling methods that automatically adapt to characteristics of the distribution being sampled can be constructed by exploiting the principle that one can sample from a distribution by sampling uniformly from the region under the plot of its density function. A Markov chain that converges to this uniform distribution can be constructed by alternating uniform sampling in the vertical direction with uniform sampling from the horizontal `slice' defined by the current vertical position, or more generally, with some update that leaves the uniform distribution over this slice invariant. Variations on such `slice sampling' methods are easily implemented for univariate distributions, and can be used to sample from a multivariate distribution by updating each variable in turn. This approach is often easier to implement than Gibbs sampling, and more efficient than simple Metropolis updates, due to the ability of slice sampling to adaptively choose the magnitude of changes made. It is therefore attractive f...

  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. Secure Fingerprint Alignment and Matching Protocols

    OpenAIRE

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

    2017-01-01

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

  18. AN EVEN ODD MULTIPLE PATTERN MATCHING ALGORITHM

    OpenAIRE

    Raju Bhukya; DVLN Somayajulu

    2011-01-01

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

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

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

  1. Capillary sample

    Science.gov (United States)

    ... several times a day using capillary blood sampling. Disadvantages to capillary blood sampling include: Only a limited ... do not constitute endorsements of those other sites. Copyright 1997-2017, A.D.A.M., Inc. Duplication ...

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

  3. Antenna impedance matching with neural networks.

    Science.gov (United States)

    Hemminger, Thomas L

    2005-10-01

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

  4. Optimally matching support and perceived spousal sensitivity.

    Science.gov (United States)

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

    2007-12-01

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

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

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

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

  8. wisepair: a computer program for individual matching in genetic tracking studies.

    Science.gov (United States)

    Rothstein, Andrew P; McLaughlin, Ryan; Acevedo-Gutiérrez, Alejandro; Schwarz, Dietmar

    2017-03-01

    Individual-based data sets tracking organisms over space and time are fundamental to answering broad questions in ecology and evolution. A 'permanent' genetic tag circumvents a need to invasively mark or tag animals, especially if there are little phenotypic differences among individuals. However, genetic tracking of individuals does not come without its limits; correctly matching genotypes and error rates associated with laboratory work can make it difficult to parse out matched individuals. In addition, defining a sampling design that effectively matches individuals in the wild can be a challenge for researchers. Here, we combine the two objectives of defining sampling design and reducing genotyping error through an efficient Python-based computer-modelling program, wisepair. We describe the methods used to develop the computer program and assess its effectiveness through three empirical data sets, with and without reference genotypes. Our results show that wisepair outperformed similar genotype matching programs using previously published from reference genotype data of diurnal poison frogs (Allobates femoralis) and without-reference (faecal) genotype sample data sets of harbour seals (Phoca vitulina) and Eurasian otters (Lutra lutra). In addition, due to limited sampling effort in the harbour seal data, we present optimal sampling designs for future projects. wisepair allows for minimal sacrifice in the available methods as it incorporates sample rerun error data, allelic pairwise comparisons and probabilistic simulations to determine matching thresholds. Our program is the lone tool available to researchers to define parameters a priori for genetic tracking studies.

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

    Science.gov (United States)

    2013-08-07

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

  10. A medium resolution fingerprint matching system

    Directory of Open Access Journals (Sweden)

    Ayman Mohammad Bahaa-Eldin

    2013-09-01

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

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

  13. Matching a wavelet to ECG signal.

    Science.gov (United States)

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

    2006-01-01

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

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

  15. Sidescan Sonar Image Matching Using Cross Correlation

    DEFF Research Database (Denmark)

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

    2003-01-01

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

  16. Unification and Matching on Compressed Terms

    CERN Document Server

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

    2010-01-01

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

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

  18. Efficient Catalog Matching with Dropout Detection

    CERN Document Server

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

    2014-01-01

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

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

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

  1. School furniture match to students' anthropometry in the Gaza Strip.

    Science.gov (United States)

    Agha, Salah R

    2010-03-01

    This study aimed at comparing primary school students' anthropometry to the dimensions of school furniture and determining whether the furniture used matches the students' anthropometry. A sample of 600 male students, whose ages were between 6 and 11 years, from five primary schools in the Gaza Strip governorates participated in the study. Several students' body dimensions were measured. The dimensions measured included elbow-seat height, shoulder height, knee height, popliteal height and buttock-popliteal length. Measurements of the dimensions of the classroom furniture indicated that there was a considerable mismatch between the students' body dimensions and the classroom furniture. The mismatches in seat height, seat depth and desk height occurred for 99% of the students, while the mismatch for the back rest height was only 35%. Two design specifications were proposed in order to decrease the mismatch percentage based on the data obtained. The two proposed designs showed a considerable improvement in the match percentages as compared to the existing design. STATEMENT OF RELEVANCE: Having identified mismatches between the dimensions of the school furniture used in primary schools in the Gaza Strip, two new design specifications are proposed and shown to improve match with the students' anthropometric dimensions. The findings of the study are also an important addition to local knowledge on school children's anthropometry.

  2. Effect of a kickboxing match on salivary cortisol and immunoglobulin A.

    Science.gov (United States)

    Moreira, Alexandre; Arsati, Franco; Lima-Arsati, Ynara Bosco De Oliveira; Franchini, Emerson; De Araújo, Vera Cavalcanti

    2010-08-01

    The hypothesis that salivary cortisol would increase and salivary immunoglobulin A (IgA) decrease after a kickboxing match was tested among 20 male athletes. Saliva samples collected before and after the match were analyzed. Salivary cortisol and salivary IgA concentrations (absolute concentration, salivary IgAabs) and the secretion rate of IgA (salivary IgArate) were measured by enzyme-linked immunosorbent assay. A Wilcoxon test for paired samples showed significant increases in salivary cortisol from pre- to postmatch. No significant changes were observed in salivary IgAabs or secretory IgArate and saliva flow rate. This study indicates that a kickboxing match might increase salivary concentration and thereafter it could be considered a significant source of exercise-related stress. On the other hand, the effect of a kickboxing match on mucosal immunity seems not to be relevant.

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

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

    Science.gov (United States)

    Lander, Karen; Poyarekar, Siddhi

    2015-01-01

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

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

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

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

  8. General Phase Matching Condition for Quantum Searching

    CERN Document Server

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

    2001-01-01

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

  9. The statistical evaluation of duct tape end match as physical evidence

    Science.gov (United States)

    Chan, Ka Lok

    Duct tapes are often submitted to crime laboratories as evidence associated with abductions, homicides, or construction of explosive devices. As a result, trace evidence examiners are often asked to analyze and compare commercial duct tapes so that they can establish possible evidentiary links. Duct tape end matches are believed to be the strongest association between exemplar and question samples because they are considered as evidence with unique individual characteristics. While end match analysis and comparison have long been undertaken by trace evidence examiners, there is a significant lack of scientific research for associating two or more segments of duct tapes. This study is designed to obtain statistical inferences on the uniqueness of duct tape tears. Three experiments were devised to compile the basis for a statistical assessment of the probability of duct tape end matches along with a proposed error rate. In one experiment, we conducted the equivalent of 10,000 end match examinations with an error rate of 0%. In the second experiment, we performed 2,704 end match examinations having 0% error rate. In the third experiment, using duct tape by an Elmendorf Tear tester, we conducted 576 end match examinations with an error rate of 0% and having all samples correctly associated. The results of this study indicate that end matches are distinguishable among a single roll of duct tape and between two different rolls of duct tape having very similar surface features and weave pattern.

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

  11. Sequential tests for gene–environment interactions in matched case–control studies

    NARCIS (Netherlands)

    Tweel, I. van der; Schipper, M.E.I.

    2004-01-01

    The sample size necessary to detect a significant gene × environment interaction in an observational study can be large. For reasons of cost-effectiveness and efficient use of available biological samples we investigated the properties of sequential designs in matched case–control studies to test fo

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

    Science.gov (United States)

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

    2009-07-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 separate feedback loop for thermal drift compensation, and the differential signal can be used to cancel the shift in zero-force level of the AFM.

  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

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

  14. 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...... sampling method is used with different genetic classifications (Voegelin & Voegelin 1977, Ruhlen 1987, Grimes ed. 1997) and argue that —on the whole— our sampling technique compares favourably with other methods, especially in the case of exploratory research....

  15. Manifold Matching for High-Dimensional Pattern Recognition

    OpenAIRE

    HOTTA, Seiji

    2008-01-01

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

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

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

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

  19. Language style matching and police interrogation outcomes

    NARCIS (Netherlands)

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

    2014-01-01

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

  20. A Fast Generic Sequence Matching Algorithm

    CERN Document Server

    Musser, David R

    2008-01-01

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

  1. Dual Butterfly Match Filter VLSI Design

    Institute of Scientific and Technical Information of China (English)

    LIU Zhenyu; HAN Yueqiu

    2001-01-01

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

  2. Making better partner matches in brand alliances

    NARCIS (Netherlands)

    B. van den Bergh (Bram)

    2014-01-01

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

  3. Adaptive and compressive matched field processing.

    Science.gov (United States)

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

    2017-01-01

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

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

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

  6. Accuracy and robustness evaluation in stereo matching

    Science.gov (United States)

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

    2016-09-01

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

  7. Predictive mean matching imputation of semicontinuous variables

    NARCIS (Netherlands)

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

    2014-01-01

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

  8. Impedance matching between ventricle and load.

    Science.gov (United States)

    Piene, H

    1984-01-01

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

  9. Occupational Curricula: The School/Job Match

    Science.gov (United States)

    Cohen, Lee; West, Leonard J.

    1978-01-01

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

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

  11. History Matching: Towards Geologically Reasonable Models

    DEFF Research Database (Denmark)

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

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

  12. Mix 'n' match

    Energy Technology Data Exchange (ETDEWEB)

    Ross, P.D.

    1985-04-01

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

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

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

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

  16. Minimal Mimicry: Mere Effector Matching Induces Preference

    Science.gov (United States)

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

    2012-01-01

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

  17. Matching in an Undisturbed Natural Human Environment

    Science.gov (United States)

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

    2010-01-01

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

  18. Matching Expectations for Successful University Student Volunteering

    Science.gov (United States)

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

    2017-01-01

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

  19. Asynchronous event-based binocular stereo matching.

    Science.gov (United States)

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

    2012-02-01

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

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

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

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

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

  4. Automated aerosol Raman spectrometer for semi-continuous sampling of atmospheric aerosol

    Science.gov (United States)

    Doughty, David C.; Hill, Steven C.

    2017-02-01

    Raman spectroscopy (RS) is useful in characterizing atmospheric aerosol. It is not commonly used in studying ambient particles partly because automated instrumentation for aerosol RS has not been available. Battelle (Columbus, Ohio, USA) has developed the Resource Effective Bioidentification System (REBS) for automated detection of airborne bioagents based on RS. We use a version of the REBS that measures Raman spectra of one set of particles while the next set of particles is collected from air, then moves the newly collected particles to the analysis region and repeats. Here we investigate the use of the REBS as the core of a general-purpose automated Aerosol Raman Spectrometer (ARS) for atmospheric applications. This REBS-based ARS can be operated as a line-scanning Raman imaging spectrometer. Spectra measured by this ARS for single particles made of polystyrene, black carbon, and several other materials are clearly distinguishable. Raman spectra from a 15 min ambient sample (approximately 35-50 particles, 158 spectra) were analyzed using a hierarchical clustering method to find that the cluster spectra are consistent with soot, inorganic aerosol, and other organic compounds. The ARS ran unattended, collecting atmospheric aerosol and measuring spectra for a 7 hr period at 15-min intervals. A total of 32,718 spectra were measured; 5892 exceeded a threshold and were clustered during this time. The number of particles exhibiting the D-G bands of amorphous carbon plotted vs time (at 15-min intervals) increases during the morning commute, then decreases. This data illustrates the potential of the ARS to measure thousands of time resolved aerosol Raman spectra in the ambient atmosphere over the course of several hours. The capability of this ARS for automated measurements of Raman spectra should lead to more extensive RS-based studies of atmospheric aerosols.

  5. Sample Stimulus Control Shaping and Restricted Stimulus Control in Capuchin Monkeys: A Methodological Note

    Science.gov (United States)

    Brino, Ana Leda F., Barros, Romariz S., Galvao, Ol; Garotti, M.; Da Cruz, Ilara R. N.; Santos, Jose R.; Dube, William V.; McIlvane, William J.

    2011-01-01

    This paper reports use of sample stimulus control shaping procedures to teach arbitrary matching-to-sample to 2 capuchin monkeys ("Cebus apella"). The procedures started with identity matching-to-sample. During shaping, stimulus features of the sample were altered gradually, rendering samples and comparisons increasingly physically dissimilar. The…

  6. Monitoring Salivary Immunoglobulin A Responses to Official and Simulated Matches In Elite Young Soccer Players

    Directory of Open Access Journals (Sweden)

    Freitas Camila G.

    2016-12-01

    Full Text Available The purpose of the present study was to examine SIgA responses (concentration [SIgAabs] and a secretion rate [SIgArate] to official and simulated competitive matches in young soccer players. The sample was composed of 26 male soccer players (age 15.6 ± 1.1 yrs, stature 177.0 ± 6.1 cm, body mass 70.5 ± 5.7 kg. Four soccer matches (two simulated matches [SM] and two official matches [OM] were conducted. The matches consisted of two halves of 35 min with a 10 min rest interval. Each assessed player participated in only one SM and one OM. All matches were performed in the same week, during the competitive season, and at the same time of the day (9:00 am, separated by 48 h. Saliva samples were collected before and after every match. The session rating of perceived exertion was reported 30 min after each match in order to determine the internal training load (ITL. A significant decrease in SIgAabs and SIgArate after OM was observed when compared to the pre-match value. In addition, the SIgArate was higher at pre-OM when compared to pre-SM. A higher ITL for OM was observed compared to SM. The current findings indicate that OM may lead to a decrease in the main mucosal immunity function parameter of young soccer players that could increase the risk of URTI. Coaches should be aware of it in order to plan appropriate training loads and recovery procedures to avoid or minimize the likelihood of upper respiratory tract infection occurrences.

  7. Kinetic Post-match Fatigue in Professional and Youth Soccer Players During the Competitive Period

    Directory of Open Access Journals (Sweden)

    Djaoui

    2016-03-01

    Full Text Available Background No previous research has analysed kinetic fatigue of elite adult players and elite youth players during the competitive period. Objectives The aim of the present study was to analyse kinetic post-match fatigue in professional and youth soccer players during the competitive period. Materials and Methods resting heart rate (HRrest, post-effort recovery heart rate (HRrecovery, rate of perceived exertion fatigue (RPEf, muscle soreness and blood samples with creatine kinase (CK and resting lactate (La from nine professional soccer players were measured immediately before, 24 hour and 48 hour after two official French first league matches (Ligue 1 whereas RPEf, HRrest, and 20m speed performance (speed-20 m were measured in ten U-17 elite players immediately before, 24 hour and 48h after a friendly match. Results for professionals, a soccer match elevated all physiological markers during the next 24 hours (P < 0.05; only HRrecovery remained significantly different 48 hours after the match (P < 0.05 whereas there was no variation of HRrest, RPEf, and speed-20m, which were elevated until 24h and got back to reference values 48 hours after the match (P < 0.05 for the U17 players. Comparing the two groups, HRrest results remained lower all the time for professionals, and RPEf was lower for U-17, 24 hours after the match (P < 0.05. Conclusions Independent of their level, professional soccer players, need 48 hours to recover after an official match. Professionals gain more fatigue than young players after a match, but recover as fast. Thus, they recover more efficiently especially due to a better physical condition and fitness training. It is expected that the results showed in the study help elite soccer and fitness coaches to manage the training load of the team according to the match.

  8. Airborne streaker sampling for PIXE analysis

    Science.gov (United States)

    Annegarn, H. J.; Flanz, M.; Kenntner, T.; Kneen, M. A.; Helas, G.; Piketh, S. J.

    1996-04-01

    Ground based aerosol sampling has inherent limitations for understanding atmospheric transport and dynamics. Sampling from aircraft platforms has limitations on the sampling time and quantity of aerosol mass that can be collected, especially if multiple samples per flight are required to allow for vertical or horizontal resolution. A modification of Florida State University circular streaker sampler has been made to enable aerosol samples to be collected isokinetically from a Lear jet. The samples are matched for analysis by PIXE or scanning electron microprobe. Features of the sampler include: a two stage isokinetic inlet matched to aircraft speeds of 550 km/h; remote computer control of the wing tip mounted sampler; up to twenty samples per flight on a single circular disk. Preliminary tests with the sampler are described, involving sampling of a coal fired power plant plume, and calibration of PIXE elemental concentrations against particle number density measured simultaneously with a forward scattering probe.

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

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

  11. Design Pattern Mining Using Graph Matching

    Institute of Scientific and Technical Information of China (English)

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

    2004-01-01

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

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

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

  14. Rotation Invariant Matching of Partial Shoeprints

    Directory of Open Access Journals (Sweden)

    Khan Mahmood Ahmed

    2014-09-01

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

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

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

    Science.gov (United States)

    Trochim, Wilham M. K.

    1985-01-01

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

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

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

  19. Vividness Effects: A Resource-Matching Perspective.

    OpenAIRE

    Keller, Punam Anand; Block, Lauren G

    1997-01-01

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

  20. Longitudinal matching between SFC and SSC

    Energy Technology Data Exchange (ETDEWEB)

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

    1998-11-01

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

  1. Matching point clouds: limits and possibilities.

    Science.gov (United States)

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

    2002-01-01

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

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

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

  4. Design of an impedance matching acoustic bend

    OpenAIRE

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

    2017-01-01

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

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

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

  7. Intuitionistic Fuzzy Automaton for Approximate String Matching

    Directory of Open Access Journals (Sweden)

    K.M. Ravi

    2014-03-01

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

  8. Message passing with relaxed moment matching

    OpenAIRE

    Qi, Yuan; Guo, Yandong

    2012-01-01

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

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

  10. Labor search and matching in macroeconomics

    OpenAIRE

    2007-01-01

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

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

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

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

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

    Social services make the most use of the user profile matching to help the users to discover friends with similar social attributes (e.g. interests, location, age). However, there are many privacy concerns that prevent to enable this functionality. Privacy preserving encryption is not suitable...... 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....

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

    CERN Document Server

    Bansal, Nikhil; Nagarajan, Viswanath; Rudra, Atri

    2010-01-01

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

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

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

    Science.gov (United States)

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

    2016-05-01

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

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

  19. Space Lower Bounds for Online Pattern Matching

    CERN Document Server

    Clifford, Raphael; Porat, Ely; Sach, Benjamin

    2011-01-01

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

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

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

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

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

    DEFF Research Database (Denmark)

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

    2007-01-01

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

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

    DEFF Research Database (Denmark)

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

    2009-01-01

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

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

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

    Science.gov (United States)

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

    2013-07-10

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

  7. An Index Based Skip Search Multiple Pattern Matching Algorithm

    OpenAIRE

    Raju Bhukya; Balram Parmer,; Anand Kulkarni

    2011-01-01

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

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

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

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

    Science.gov (United States)

    2010-10-15

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

  11. Work sampling

    OpenAIRE

    Salas Bacalla, julio; FII-UNMSM

    2014-01-01

    Work sampling is a method of indirect measurement, which means instantaneous observations, to determine the amount of uptime or downtime in a production process El muestreo de trabajo es un método de medición indirecto, que mediante observaciones instantaneas, permite determinar la cantidad de tiempo en actividad o inactividad en un proceso productivo

  12. Molecular matching for Rh and K reduces red blood cell alloimmunisation in patients with myelodysplastic syndrome

    Science.gov (United States)

    Guelsin, Gláucia A.S.; Rodrigues, Camila; Visentainer, Jeane E.L.; de Melo Campos, Paula; Traina, Fabíola; Gilli, Simone C.O.; Saad, Sara T.O.; Castilho, Lilian

    2015-01-01

    Background Matching for Rh and K antigens has been used in an attempt to reduce antibody formation in patients receiving chronic transfusions but an extended phenotype matching including Fya and Jka antigens has also been recommended. The aim of this study was to identify an efficient transfusion protocol of genotype matching for patients with myelodysplastic syndrome (MDS) or chronic myelomonocytic leukaemia. We also examined a possible association of HLA class II alleles with red blood cell (RBC) alloimmunisation. Materials and methods We evaluated 43 patients with MDS undergoing transfusion therapy with and without antibody formation. We investigated antigen-matched RBC units for ABO, D, C, c, E, e, K, Fya, Fyb, Jka, Jkb, S, s, Doa, Dob and Dia on the patients’ samples and on the donor units serologically matched for them based on their ABO, Rh and K phenotypes and presence of antibodies. We also determined the frequencies of HLA-DRB1 alleles in the alloimmunised and non-alloimmunised patients. Results Seventeen of the 43 patients had discrepancies or mismatches for multiple antigens between their genotype-predicted profile and the antigen profile of the units of blood serologically matched for them. We verified that 36.8% of patients had more than one RBC alloantibody and 10.5% of patients had autoantibodies. Although we were able to find a better match for the patients in our extended genotyped/phenotyped units, we verified that matching for Rh and K would be sufficient for most of the patients. We also observed an over-representation of the HLA-DRB1*13 allele in the non-alloimmunised group of patients with MDS. Discussion In our population molecular matching for C, c, E, e, K was able to reduce RBC alloimmunisation in MDS patients. An association of HLA-DRB1*13 and protection from RBC alloimmunisation should be confirmed. PMID:24960644

  13. AN INTEGRATED RANSAC AND GRAPH BASED MISMATCH ELIMINATION APPROACH FOR WIDE-BASELINE IMAGE MATCHING

    Directory of Open Access Journals (Sweden)

    M. Hasheminasab

    2015-12-01

    Full Text Available In this paper we propose an integrated approach in order to increase the precision of feature point matching. Many different algorithms have been developed as to optimizing the short-baseline image matching while because of illumination differences and viewpoints changes, wide-baseline image matching is so difficult to handle. Fortunately, the recent developments in the automatic extraction of local invariant features make wide-baseline image matching possible. The matching algorithms which are based on local feature similarity principle, using feature descriptor as to establish correspondence between feature point sets. To date, the most remarkable descriptor is the scale-invariant feature transform (SIFT descriptor , which is invariant to image rotation and scale, and it remains robust across a substantial range of affine distortion, presence of noise, and changes in illumination. The epipolar constraint based on RANSAC (random sample consensus method is a conventional model for mismatch elimination, particularly in computer vision. Because only the distance from the epipolar line is considered, there are a few false matches in the selected matching results based on epipolar geometry and RANSAC. Aguilariu et al. proposed Graph Transformation Matching (GTM algorithm to remove outliers which has some difficulties when the mismatched points surrounded by the same local neighbor structure. In this study to overcome these limitations, which mentioned above, a new three step matching scheme is presented where the SIFT algorithm is used to obtain initial corresponding point sets. In the second step, in order to reduce the outliers, RANSAC algorithm is applied. Finally, to remove the remained mismatches, based on the adjacent K-NN graph, the GTM is implemented. Four different close range image datasets with changes in viewpoint are utilized to evaluate the performance of the proposed method and the experimental results indicate its robustness and

  14. A matched crossover design for clinical trials.

    Science.gov (United States)

    Simon, Laura J; Chinchilli, Vernon M

    2007-09-01

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

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

  16. Sampling Strategy

    Science.gov (United States)

    2008-01-01

    Three locations to the right of the test dig area are identified for the first samples to be delivered to the Thermal and Evolved Gas Analyzer (TEGA), the Wet Chemistry Lab (WCL), and the Optical Microscope (OM) on NASA's Phoenix Mars Lander. These sampling areas are informally labeled 'Baby Bear', 'Mama Bear', and 'Papa Bear' respectively. This image was taken on the seventh day of the Mars mission, or Sol 7 (June 1, 2008) by the Surface Stereo Imager aboard NASA's Phoenix Mars Lander. The Phoenix Mission is led by the University of Arizona, Tucson, on behalf of NASA. Project management of the mission is by NASA's Jet Propulsion Laboratory, Pasadena, Calif. Spacecraft development is by Lockheed Martin Space Systems, Denver.

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

  18. Compressed Subsequence Matching and Packed Tree Coloring

    DEFF Research Database (Denmark)

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

    2017-01-01

    We present a new algorithm for subsequence matching in grammar compressed strings. Given a grammar of size n compressing a string of size N and a pattern string of size m over an alphabet of size \\(\\sigma \\), our algorithm uses \\(O(n+\\frac{n\\sigma }{w})\\) space and \\(O(n+\\frac{n\\sigma }{w}+m\\log ...... a new data structure that allows us to efficiently find the next occurrence of a given character after a given position in a compressed string. This data structure in turn is based on a new data structure for the tree color problem, where the node colors are packed in bit strings....

  19. Large-Scale Collective Entity Matching

    CERN Document Server

    Rastogi, Vibhor; Garofalakis, Minos

    2011-01-01

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

  20. Antennas with non-foster matching networks

    CERN Document Server

    Aberle, James T

    2007-01-01

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

  1. Map Matching for Intelligent Speed Adaptation

    DEFF Research Database (Denmark)

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

    2007-01-01

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

  2. Image Segmentation, Registration, Compression, and Matching

    Science.gov (United States)

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

    2011-01-01

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

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

  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. Texture synthesis via the matching compatibility between patches

    Institute of Scientific and Technical Information of China (English)

    WANG WenCheng; LIU FeiTong; HUANG PeiJie; WU EnHua

    2009-01-01

    A new patch-based texture synthesis method is presented in this paper.By the method,a set of patches that can be matched with a sampled patch for growing textures effectively,called the matching compatibility between patches,is generated first for each patch,and the set is further optimized by culling the patches that may cause synthesis conflicts.In this way,similarity measurement calculation for selecting suitable patches in texture synthesis can be greatly saved,and synthesis conflicts between neighbouring patches are substantially reduced.Furthermore,retrace computation is Integrated in the synthesis process to improve the texture quality.As a result,the new method can produce high quality textures as texture optimization,the best method to date for producing good textures,and run in a time complexity linear to the size of the output texture.Experimental results show that the new method can interactively generate a large texture in 1024 × 1024 pixels,which is very difficult to achieve by existing methods.

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

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

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

  9. Broadband electrical impedance matching for piezoelectric ultrasound transducers.

    Science.gov (United States)

    Huang, Haiying; Paramo, Daniel

    2011-12-01

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

  10. Theory of fractional order elements based impedance matching networks

    KAUST Repository

    Radwan, Ahmed G.

    2011-03-01

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

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

    Science.gov (United States)

    Quinn, Michael A; Rubb, Stephen

    2005-02-01

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

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

    Science.gov (United States)

    Nagy, A L

    1984-11-01

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

  13. High performance pattern matching on heterogeneous platform.

    Science.gov (United States)

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

    2014-10-23

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

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

  15. Partial match queries in random quadtrees

    CERN Document Server

    Broutin, Nicolas; Sulzbach, Henning

    2011-01-01

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

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

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

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

  19. Perceived Social Environment and Adolescents' Well-Being and Adjustment: Comparing a Foster Care Sample with a Matched Sample

    Science.gov (United States)

    Farruggia, Susan P.; Greenberger, Ellen; Chen, Chuansheng; Heckhausen, Jutta

    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…

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

    Science.gov (United States)

    Watson, Mark; McMahon, Mary

    2004-10-01

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

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

    Directory of Open Access Journals (Sweden)

    S. Y. Kan

    2009-08-01

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

  2. Mixed pattern matching-based traffic abnormal behavior recognition.

    Science.gov (United States)

    Wu, Jian; Cui, Zhiming; Sheng, Victor S; Shi, Yujie; Zhao, Pengpeng

    2014-01-01

    A motion trajectory is an intuitive representation form in time-space domain for a micromotion behavior of moving target. Trajectory analysis is an important approach to recognize abnormal behaviors of moving targets. Against the complexity of vehicle trajectories, this paper first proposed a trajectory pattern learning method based on dynamic time warping (DTW) and spectral clustering. It introduced the DTW distance to measure the distances between vehicle trajectories and determined the number of clusters automatically by a spectral clustering algorithm based on the distance matrix. Then, it clusters sample data points into different clusters. After the spatial patterns and direction patterns learned from the clusters, a recognition method for detecting vehicle abnormal behaviors based on mixed pattern matching was proposed. The experimental results show that the proposed technical scheme can recognize main types of traffic abnormal behaviors effectively and has good robustness. The real-world application verified its feasibility and the validity.

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

    CERN Document Server

    He, Jian-Hue; Baugh, Carlton M

    2016-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Lebogang Ramma

    2011-01-01

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

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

  7. New Job Matches and their Stability before and during the Crisis

    NARCIS (Netherlands)

    Nagore Garcia, A.; van Soest, Arthur

    2016-01-01

    Using administrative data from the Spanish Social Security Administration, we analyse the nature and stability of job matches starting during the economic boom in 2005 and during the recession in 2009. We compare the individual, job and firm characteristics in the two samples and estimate a competin

  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.

  9. Orangutans (Pongo abelii) and a gorilla (Gorilla gorilla gorilla) match features in familiar and unfamiliar individuals.

    Science.gov (United States)

    Vonk, Jennifer; Hamilton, Jennifer

    2014-09-01

    Great apes can perceive images as representative of corresponding real-life objects. Coupled with the potential advantages of identifying specific members of one's species and mounting evidence for individual recognition in other non-humans, it seems likely that great apes would have the ability to identify conspecifics in photographs. The ability of four orangutans and a gorilla to match images of individuals of their own and a closely related but unfamiliar species was examined here for the first time. First, the subjects matched photographs of familiar conspecifics taken at various time points in a delayed matching-to-sample procedure (Experiment 1). Second, they matched different photographs of unfamiliar individuals of a different species (Experiment 2) at above chance levels. These results suggest that the subjects matched photographs by matching physical features, not necessarily by recognizing the identity of the individuals depicted. However, they also quickly learned to select photographs of familiar individuals when these photographs were paired with photographs of unfamiliar individuals of their own species (Experiment 3), and three subjects showed transfer to novel images of familiar and unfamiliar individuals. Thus, the findings support the idea that subjects attended to physical features to identify individuals that they could categorize on the basis of familiarity.

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

    Science.gov (United States)

    Vonk, Jennifer

    2013-01-01

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

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

  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.

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

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

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

  17. Multiple Pattern Matching Algorithm using Pair-count

    OpenAIRE

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

    2011-01-01

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

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

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

  20. Strong solutions of semilinear matched microstructure models

    CERN Document Server

    Escher, Joachim

    2011-01-01

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

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

  2. Non-perturbative match of ultraviolet renormalon

    CERN Document Server

    Zakharov, V I

    2003-01-01

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

  3. Mode matching for optimal plasmonic nonlinear generation

    Science.gov (United States)

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

    2013-03-01

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

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

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

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

  7. Sequence Matching Analysis for Curriculum Development

    Directory of Open Access Journals (Sweden)

    Liem Yenny Bendatu

    2015-06-01

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

  8. Matching Medical Websites to Medical Guidelines

    Directory of Open Access Journals (Sweden)

    Dusan Rak

    2016-01-01

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

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

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

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

  12. MATCHING ALTERNATIVE ADDRESSES: A SEMANTIC WEB APPROACH

    Directory of Open Access Journals (Sweden)

    S. Ariannamazi

    2015-12-01

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

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

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

    Science.gov (United States)

    Urcuioli, Peter J.

    2011-01-01

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

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

    KAUST Repository

    Gu, Binbin

    2016-09-20

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

  16. Matching Strategies for Observational Data with Multilevel Structure

    Science.gov (United States)

    Steiner, Peter M.

    2011-01-01

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

  17. Matching profiles of masked perpetrators: a pilot study

    DEFF Research Database (Denmark)

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

    2010-01-01

    Seventeen male volunteers were photographed laterally with and without a tight-fitting balaclava. We then matched these photographs in blind trials. The matches were performed in two separate trials: as side-by-side comparisons, and by using superimposition. In both trials we graded the matches a...

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

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

    Science.gov (United States)

    2010-07-01

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

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

    Science.gov (United States)

    Reid, Machar; Duffield, Rob

    2014-04-01

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

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

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

  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 react...... reactive systems....

  4. 45 CFR 74.23 - Cost sharing or matching.

    Science.gov (United States)

    2010-10-01

    ... recorded in the recipient's accounting records at the time of donation; or (2) The current fair market... 45 Public Welfare 1 2010-10-01 2010-10-01 false Cost sharing or matching. 74.23 Section 74.23... Cost sharing or matching. (a) To be accepted, all cost sharing or matching contributions,...

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

    Science.gov (United States)

    Rodewald, Amanda D; Shustack, Daniel P

    2008-02-01

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

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

  7. Above the glass ceiling? A comparison of matched samples of female and male executives.

    Science.gov (United States)

    Lyness, K S; Thompson, D E

    1997-06-01

    In this study the authors compare career and work experiences of executive women and men. Female (n = 51) and male (n = 56) financial services executives in comparable jobs were studied through archival information on organizational outcomes and career histories, and survey measures of work experiences. Similarities were found in several organizational outcomes, such as compensation, and many work attitudes. Important differences were found, however, with women having less authority, receiving fewer stock options, and having less international mobility than men. Women at the highest executive levels reported more obstacles than lower level women. The gender differences coupled with women's lower satisfaction with future career opportunities raise questions about whether women are truly above the glass ceiling or have come up against a 2nd, higher ceiling.

  8. Tyrosine Ameliorates a Cold-Induced Delayed Matching-to-Sample Performance Decrement in Rats

    Science.gov (United States)

    1993-01-01

    were controlled and creased firing rate of CNS neurons and the continued recorded by a computer system. release of catecholamines, tyrosine hydroxylase ... hydroxylase . In: Lipton MA, DiMascio ducing a working memory deficit under field conditions A, Killam KF (eds) Psychopharmacology: a generation of pro...of rats after acute oral doses of aspar- References tame, phenylalanine , and tyrosine. Fundam Appi Toxicol 16:495-505 Ahlers ST, Thomas JR, Berkey DL

  9. Doppler Compensation by using of Segmented Match Filter

    OpenAIRE

    2008-01-01

    Match filter is one of the important parts of radar receiver. By using of Match Filter, the signal to noise ratio can be maximized so that the probability of detection is increased. Match Filter can be used as a pulse compression filter in radar receiver. Binary phase code is one of the pulse compression methods that, the compression can be down with a Match Filter in the receiver. Doppler effect is one of the problems that degrade the performance of Match Filter. In this paper, two methods “...

  10. 77 FR 39748 - Computer Matching and Privacy Protection Act of 1988; Report of Matching Program: RRB and State...

    Science.gov (United States)

    2012-07-05

    ...] [FR Doc No: 2012-16384] RAILROAD RETIREMENT BOARD Computer Matching and Privacy Protection Act of 1988...: Notice of a renewal of an existing computer matching program due to expire on August 12, 2012. SUMMARY..., information obtained from state agencies in ongoing computer matching programs regarding individuals...

  11. 76 FR 14669 - Privacy Act of 1974; CMS Computer Match No. 2011-02; HHS Computer Match No. 1007

    Science.gov (United States)

    2011-03-17

    ... HUMAN SERVICES Centers for Medicare & Medicaid Services Privacy Act of 1974; CMS Computer Match No. 2011... Medicare & Medicaid Services (CMS). ACTION: Notice of computer matching program. SUMMARY: In accordance... matching agreement between CMS and the Department of Defense (DoD). We have provided background...

  12. Citation Matching in Sanskrit Corpora Using Local Alignment

    Science.gov (United States)

    Prasad, Abhinandan S.; Rao, Shrisha

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

  13. Line segment matching and reconstruction via exploiting coplanar cues

    Science.gov (United States)

    Li, Kai; Yao, Jian

    2017-03-01

    This paper introduces a new system for reconstructing 3D scenes from Line Segments (LS) on images. A new LS matching algorithm and a novel 3D LS reconstruction algorithm are incorporated into the system. Two coplanar cues that indicates image LSs are coplanar in physical (3D) space are extensively exploited in both algorithms: (1) adjacent image LSs are coplanar in space in a high possibility; (2) the projections of coplanar 3D LSs in two images are related by the same planar homography. Based on these two cues, we efficiently match LSs from two images firstly in pairs through matching the V-junctions formed by adjacent LSs, and secondly in individuals by exploiting local homographies. We extract for each V-junction a scale and affine invariant local region to match V-junctions from two images. The local homographies estimated from V-junction matches are used to match LSs in individuals. To get 3D LSs from the obtained LS matches, we propose to first estimate space planes from clustered LS matches and then back-project image LSs onto the space planes. Markov Random Field (MRF) is introduced to help more reliable LS match clustering. Experiments shows our LS matching algorithm significantly improves the efficiency of state-of-the-art methods while achieves comparable matching performance, and our 3D LS reconstruction algorithm generates more complete and detailed 3D scene models using much fewer images.

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

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

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

  17. 78 FR 42080 - Privacy Act of 1974; CMS Computer Match No. 2013-07; HHS Computer Match No. 1303; DoD-DMDC Match...

    Science.gov (United States)

    2013-07-15

    ... HUMAN SERVICES Centers for Medicare & Medicaid Services Privacy Act of 1974; CMS Computer Match No. 2013... Services (CMS), Department of Health and Human Services (HHS). ACTION: Notice of Computer Matching Program... announces the establishment of a CMP that CMS plans to conduct with the Department of Defense (DoD),...

  18. pepgrep: A tool for peptide MS/MS pattern matching.

    Science.gov (United States)

    Chernukhin, Igor

    2013-04-01

    Typically, detection of protein sequences in collision-induced dissociation (CID) tandem MS (MS2) dataset is performed by mapping identified peptide ions back to protein sequence by using the protein database search (PDS) engine. Finding a particular peptide sequence of interest in CID MS2 records very often requires manual evaluation of the spectrum, regardless of whether the peptide-associated MS2 scan is identified by PDS algorithm or not. We have developed a compact cross-platform database-free command-line utility, pepgrep, which helps to find an MS2 fingerprint for a selected peptide sequence by pattern-matching of modelled MS2 data using Peptide-to-MS2 scoring algorithm. pepgrep can incorporate dozens of mass offsets corresponding to a variety of post-translational modifications (PTMs) into the algorithm. Decoy peptide sequences are used with the tested peptide sequence to reduce false-positive results. The engine is capable of screening an MS2 data file at a high rate when using a cluster computing environment. The matched MS2 spectrum can be displayed by using built-in graphical application programming interface (API) or optionally recorded to file. Using this algorithm, we were able to find extra peptide sequences in studied CID spectra that were missed by PDS identification. Also we found pepgrep especially useful for examining a CID of small fractions of peptides resulting from, for example, affinity purification techniques. The peptide sequences in such samples are less likely to be positively identified by using routine protein-centric algorithm implemented in PDS. The software is freely available at http://bsproteomics.essex.ac.uk:8080/data/download/pepgrep-1.4.tgz.

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

  20. A comment on the PCAST report: Skip the "match"/"non-match" stage.

    Science.gov (United States)

    Morrison, Geoffrey Stewart; Kaye, David H; Balding, David J; Taylor, Duncan; Dawid, Philip; Aitken, Colin G G; Gittelson, Simone; Zadora, Grzegorz; Robertson, Bernard; Willis, Sheila; Pope, Susan; Neil, Martin; Martire, Kristy A; Hepler, Amanda; Gill, Richard D; Jamieson, Allan; de Zoete, Jacob; Ostrum, R Brent; Caliebe, Amke

    2017-03-01

    This letter comments on the report "Forensic science in criminal courts: Ensuring scientific validity of feature-comparison methods" recently released by the President's Council of Advisors on Science and Technology (PCAST). The report advocates a procedure for evaluation of forensic evidence that is a two-stage procedure in which the first stage is "match"/"non-match" and the second stage is empirical assessment of sensitivity (correct acceptance) and false alarm (false acceptance) rates. Almost always, quantitative data from feature-comparison methods are continuously-valued and have within-source variability. We explain why a two-stage procedure is not appropriate for this type of data, and recommend use of statistical procedures which are appropriate.

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

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

  3. Matching colonic polyps using correlation optimized warping

    Science.gov (United States)

    Wang, Shijun; Yao, Jianhua; Petrick, Nicholas; Summers, Ronald M.

    2010-03-01

    Computed tomographic colonography (CTC) combined with a computer aided detection system has the potential for improving colonic polyp detection and increasing the use of CTC for colon cancer screening. In the clinical use of CTC, a true colonic polyp will be confirmed with high confidence if a radiologist can find it on both the supine and prone scans. To assist radiologists in CTC reading, we propose a new method for matching polyp findings on the supine and prone scans. The method performs a colon registration using four automatically identified anatomical salient points and correlation optimized warping (COW) of colon centerline features. We first exclude false positive detections using prediction information from a support vector machine (SVM) classifier committee to reduce initial false positive pairs. Then each remaining CAD detection is mapped to the other scan using COW technique applied to the distance along the centerline in each colon. In the last step, a new SVM classifier is applied to the candidate pair dataset to find true polyp pairs between supine and prone scans. Experimental results show that our method can improve the sensitivity to 0.87 at 4 false positive pairs per patient compared with 0.72 for a competing method that uses the normalized distance along the colon centerline (p<0.01).

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

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

  6. Structured output tracking guided by keypoint matching

    Science.gov (United States)

    Fang, Zhiwen; Cao, Zhiguo; Xiao, Yang

    2016-10-01

    Current keypoint-based trackers are widely used in object tracking system because of their robust capability against scale, rotation and so on. However, when these methods are applied in tracking 3D target in a forward-looking image sequences, the tracked point usually shifts away from the correct position as time increases. In this paper, to overcome the tracked point drifting, structured output tracking is used to track the target point with its surrounding information based on Haar-like features. First, around the tracked point in the last frame, a local patch is cropped to extract Haar-like features. Second, using a structured output SVM framework, a prediction function is learned in a larger radius to directly estimate the patch transformation between frames. Finally, during tracking the prediction function is applied to search the best location in a new frame. In order to achieve the robust tracking in real time, keypoint matching is adopted to coarsely locate the searched field in the whole image before using the structured output tracking. Experimentally, we show that our algorithm is able to outperform state-of-the-art keypoint-based trackers.

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

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

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

    OpenAIRE

    Zhaohong Xu; Tiansheng Lu; Xuyang Wang

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

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

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

  12. The Possible Antecedents and Consequences of Matching of Food Intake: Examining the Role of Trait Self-Esteem and Interpersonal Closeness

    OpenAIRE

    Elizabeth eHirata; Gerine M. A. Lodder; Ulrich eKühnen; Sonia eLippke; Roel C. J. Hermans

    2015-01-01

    Although there is evidence that people tend to match their intake to that of others, less is known about the motives underlying this effect. The current study, therefore, examined the relationship between self-esteem, a specific factor that has been related to the likelihood of social matching. Further, we examined the effects of food matching on interpersonal closeness among eating companions. The sample included 89 female dyads. All dyads had free access to palatable snack food during a 15 ...

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

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

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

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

  17. Cephalopod dynamic camouflage: bridging the continuum between background matching and disruptive coloration.

    Science.gov (United States)

    Hanlon, R T; Chiao, C-C; Mäthger, L M; Barbosa, A; Buresch, K C; Chubb, C

    2009-02-27

    Individual cuttlefish, octopus and squid have the versatile capability to use body patterns for background matching and disruptive coloration. We define--qualitatively and quantitatively--the chief characteristics of the three major body pattern types used for camouflage by cephalopods: uniform and mottle patterns for background matching, and disruptive patterns that primarily enhance disruptiveness but aid background matching as well. There is great variation within each of the three body pattern types, but by defining their chief characteristics we lay the groundwork to test camouflage concepts by correlating background statistics with those of the body pattern. We describe at least three ways in which background matching can be achieved in cephalopods. Disruptive patterns in cuttlefish possess all four of the basic components of 'disruptiveness', supporting Cott's hypotheses, and we provide field examples of disruptive coloration in which the body pattern contrast exceeds that of the immediate surrounds. Based upon laboratory testing as well as thousands of images of camouflaged cephalopods in the field (a sample is provided on a web archive), we note that size, contrast and edges of background objects are key visual cues that guide cephalopod camouflage patterning. Mottle and disruptive patterns are frequently mixed, suggesting that background matching and disruptive mechanisms are often used in the same pattern.

  18. Practical significance of weld strength matching

    Energy Technology Data Exchange (ETDEWEB)

    Sloterdijk, W. [N.V. Nederlandse Gasunie, Groningen (Netherlands); Schipaanboord, W.N. [N.V. Nederlandse Gasunie, Groningen (Netherlands)

    1996-10-01

    Defect tolerance in welds in pipelines constructed in modern high strength material depends on the balance in strength between weld material and pipe material. The Guidelines on the assessment of girth weld defects published by the European Pipeline Research Group (EPRG) define in Tier 2 defect limits assuming that the (actual) weld metal yield strength is equal or greater than the yield strength of the parent material. The defect limits according to Tier 2 exceed the defect limits in `workmanship standards` (l>25 mm). Nevertheless, the draft European welding standard EN 288 does not yet require a test to measure and verify the weld metal yield strength. Gasunie has performed a test program with the aim to look at the practical significance of weld strength matching in a strain controlled situation and to verify the relevance of limits given in the European welding and line pipe codes, in combination with the EPRG Guidelines. It is concluded that the results of the tests confirm the defect acceptance limits according to Tier 2 of the EPRG Guidelines. (orig.) [Deutsch] Die Zulaessigkeit von Fehlern in Rundschweissnaehten in Rohrleitungen aus modernen hochfesten Baustaehlen haengt von dem Verhaeltnis der Werkstofffestigkeit des Schweissgutes zu der des Grundwerkstoffs ab. Die von der European Pipeline Research Group (EPRG) veroeffentlichte Richtlinie zur Bewertung von Schweissnahtfehlern gibt in der zweiten Bewertungsstufe (Tier 2) Werte fuer zulaessige Schweissnahtfehlergroessen unter der Bedingung an, dass die Dehngrenze des Schweissgutes groesser oder gleich der Dehngrenze des Grundwerkstoffs ist. Die nach Tier 2 zulaessigen Fehler sind groesser als die in `Good-workmanship`-Regelwerken angegebenen Fehlerlaenge (l>25 mm). Demgegenueber fehlt im Entwurf der europaeischen Schweissnorm EN 288 bislang ein solcher Dehngrenzennachweis. Gasunie hat ein Versuchsprogramm durchgefuehrt, um die Bedeutung der Schweissgutfestigkeit bei dehnungskontrollierter Belastung sowie

  19. Kolmogorov turbulence by matched asymptotic expansions

    Science.gov (United States)

    Lundgren, Thomas S.

    2003-04-01

    The Kolmogorov [Dokl. Akad. Nauk. SSSR 30, 299 (1941), hereafter K41] inertial range theory is derived from first principles by analysis of the Navier-Stokes equation using the method of matched asymptotic expansions without assuming isotropy or homogeneity and the Kolmogorov (K62) [J. Fluid Mech. 13, 82 (1962)] refined theory is analyzed. This paper is an extension of Lundgren [Phys. Fluids 14, 638 (2002)], in which the second- and third-order structure functions were determined from the isotropic Karman-Howarth [Proc. R. Soc. London, Ser. A 164, 192 (1938)] equation. The starting point for the present analysis is an equation for the difference in velocity between two points, one of which is a Lagrangian fluid point and the second, slaved to the first by a fixed separation r, is not Lagrangian. The velocity difference, so defined, satisfies the Navier-Stokes equation with spatial variable r. The analysis is carried out in two parts. In the first part the physical hypothesis is made that the mean dissipation is independent of viscosity as viscosity tends to zero, as assumed in K41. This means that the mean dissipation is finite as Reynolds number tends to infinity and leads to the K41 inertial range results. In the second part this dissipation assumption is relaxed in an attempt to duplicate the K62 theory. While the K62 structure is obtained, there are restrictions, resulting from the analysis which shows that there can be no inertial range intermittency as Reynolds number tends to infinity, and therefore the mean dissipation has to be finite as Reynolds number tends to infinity, as assumed in part one. Reynolds number-dependent corrections to the K41 results are obtained in the form of compensating functions of r/λ, which tend to zero slowly like Rλ-2/3 as Rλ→∞.

  20. Ontology Based Vocabulary Matching for Oceanographic Instruments

    Science.gov (United States)

    Chen, Yu; Shepherd, Adam; Chandler, Cyndy; Arko, Robert; Leadbetter, Adam

    2014-05-01

    Data integration act as the preliminary entry point as we enter the era of big data in many scientific domains. However the reusefulness of various dataset has met the hurdle due to different initial of interests of different parties, therefore different vocabularies in describing similar or semantically related concepts. In this scenario it is vital to devise an automatic or semi-supervised algorithm to facilitate the convergence of different vocabularies. The Ocean Data Interoperability Platform (ODIP) seeks to increase data sharing across scientific domains and international boundaries by providing a forum to harmonize diverse regional data systems. ODIP participants from the US include the Rolling Deck to Repository (R2R) program, whose mission is to capture, catalog, and describe the underway/environmental sensor data from US oceanographic research vessels and submit the data to public long-term archives. In an attempt to harmonize these regional data systems, especially vocabularies, R2R recognizes the value of the SeaDataNet vocabularies served by the NERC Vocabulary Server (NVS) hosted at the British Oceanographic Data Centre as a trusted, authoritative source for describing many oceanographic research concepts such as instrumentation. In this work, we make use of the semantic relations in the vocabularies served by NVS to build a Bayesian network and take advantage of the idea of entropy in evaluating the correlation between different concepts and keywords. The performance of the model is evaluated against matching instruments from R2R against the SeaDataNet instrument vocabularies based on calculated confidence scores in the instrument pairings. These pairings with their scores can then be analyzed for assertion growing the interoperability of the R2R vocabulary through its links to the SeaDataNet entities.

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

  2. Corneal topography matching by iterative registration.

    Science.gov (United States)

    Wang, Junjie; Elsheikh, Ahmed; Davey, Pinakin G; Wang, Weizhuo; Bao, Fangjun; Mottershead, John E

    2014-11-01

    Videokeratography is used for the measurement of corneal topography in overlapping portions (or maps) which must later be joined together to form the overall topography of the cornea. The separate portions are measured from different viewpoints and therefore must be brought together by registration of measurement points in the regions of overlap. The central map is generally the most accurate, but all maps are measured with uncertainty that increases towards the periphery. It becomes the reference (or static) map, and the peripheral (or dynamic) maps must then be transformed by rotation and translation so that the overlapping portions are matched. The process known as registration, of determining the necessary transformation, is a well-understood procedure in image analysis and has been applied in several areas of science and engineering. In this article, direct search optimisation using the Nelder-Mead algorithm and several variants of the iterative closest/corresponding point routine are explained and applied to simulated and real clinical data. The measurement points on the static and dynamic maps are generally different so that it becomes necessary to interpolate, which is done using a truncated series of Zernike polynomials. The point-to-plane iterative closest/corresponding point variant has the advantage of releasing certain optimisation constraints that lead to persistent registration and alignment errors when other approaches are used. The point-to-plane iterative closest/corresponding point routine is found to be robust to measurement noise, insensitive to starting values of the transformation parameters and produces high-quality results when using real clinical data.

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

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

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

  7. A New Robust Image Matching Method Based on Distance Reciprocal

    Institute of Scientific and Technical Information of China (English)

    赵春江; 施文康; 邓勇

    2004-01-01

    Object matching between two-dimensional images is an important problem in computer vision. The purpose of object matching is to decide the similarity between two objects. A new robust image matching method based on distance reciprocal was presented. The distance reciprocal is based on human visual perception. This method is simple and effective. Moreover, it is robust against noise. The experiments show that this method outperforms the Hausdorff distance, when the images with noise interfered need to be recognized.

  8. Nonparametric Bayesian Modeling for Automated Database Schema Matching

    Energy Technology Data Exchange (ETDEWEB)

    Ferragut, Erik M [ORNL; Laska, Jason A [ORNL

    2015-01-01

    The problem of merging databases arises in many government and commercial applications. Schema matching, a common first step, identifies equivalent fields between databases. We introduce a schema matching framework that builds nonparametric Bayesian models for each field and compares them by computing the probability that a single model could have generated both fields. Our experiments show that our method is more accurate and faster than the existing instance-based matching algorithms in part because of the use of nonparametric Bayesian models.

  9. An Asymmetric Fingerprint Matching Algorithm for Java Card

    OpenAIRE

    Bistarelli, Stefano; Santini, Francesco; Vaccarelli, Anna

    2004-01-01

    A novel fingerprint matching algorithm is proposed in this paper. The algorithm is based on the minutiae local structures, that are invariant with respect to global transformations like translation and rotation. Match algorithm has been implemented inside a smartcard over the Java Card? platform, meeting the individual's need for information privacy and the overall authentication procedure security, since the card owner biometric template never leaves the private support device and the match ...

  10. Best Wideband Impedance Matching Bounds for Lossless 2-Ports

    Science.gov (United States)

    2001-09-01

    scattering matrices, the reports in Wohlers [55, page 173] are false, as determined by Choi [11]. 26 4 Existence of Matching 2-Ports in U+(2, d) Proving...TECHNICAL REPORT 1859 September 2001 Best Wideband Impedance Matching Bounds for Lossless 2-Ports J. C. Allen D. F Schwartz Approved for public...release; distribution is unlimited. SSC San Diego 20044048 043 TECHNICAL REPORT 1859 September 2001 Best Wideband Impedance Matching Bounds for Lossless 2

  11. Performance Evaluation of Full Search Equivalent Pattern Matching Algorithms.

    Science.gov (United States)

    Wanli Ouyang; Tombari, F; Mattoccia, S; Di Stefano, L; Wai-Kuen Cham

    2012-01-01

    Pattern matching is widely used in signal processing, computer vision, and image and video processing. Full search equivalent algorithms accelerate the pattern matching process and, in the meantime, yield exactly the same result as the full search. This paper proposes an analysis and comparison of state-of-the-art algorithms for full search equivalent pattern matching. Our intention is that the data sets and tests used in our evaluation will be a benchmark for testing future pattern matching algorithms, and that the analysis concerning state-of-the-art algorithms could inspire new fast algorithms. We also propose extensions of the evaluated algorithms and show that they outperform the original formulations.

  12. Novel method for planar microstrip antenna matching impedance

    CERN Document Server

    Ali, Mahdi; Samet, Mounir

    2010-01-01

    Because all microstrip antennas have to be matched to the standard generator impedance or load, the input impedance matching method for antenna is particularly important. In this paper a new methodology in achieving matching impedance of a planar microstrip antenna for wireless application is described. The method is based on embedding an Interdigital capacitor. The fine results obtained by using a microstrip Interdigital capacitor for matching antenna impedance led to an efficient method to improve array antenna performance. In fact, a substantial saving on the whole surfaces as well as enhancement of the gain, the directivity and the power radiated was achieved.

  13. Tuning Schema Matching Systems using Parallel Genetic Algorithms on GPU

    Directory of Open Access Journals (Sweden)

    Yuting Feng

    2010-11-01

    Full Text Available Most recent schema matching systems combine multiple components, each of which employs a particular matching technique with several knobs. The multi-component nature has brought a tuning problem, that is to determine which components to execute and how to adjust the knobs (e.g., thresholds, weights, etc. of these components for domain users. In this paper, we present an approach to automatically tune schema matching systems using genetic algorithms. We match a given schema S against generated matching scenarios, for which the ground truth matches are known, and find a configuration that effectively improves the performance of matching S against real schemas. To search the huge space of configuration candidates efficiently, we adopt genetic algorithms (GAs during the tuning process. To promote the performance of our approach, we implement parallel genetic algorithms on graphic processing units (GPUs based on NVIDIA’s Compute Unified Device Architecture (CUDA. Experiments over four real-world domains with two main matching systems demonstrate that our approach provides more qualified matches over different domains.

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

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

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

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

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

  19. Rule-based semantic web services matching strategy

    Science.gov (United States)

    Fan, Hong; Wang, Zhihua

    2011-12-01

    With the development of Web services technology, the number of service increases rapidly, and it becomes a challenge task that how to efficiently discovery the services that exactly match the user's requirements from the large scale of services library. Many semantic Web services discovery technologies proposed by the recent literatures only focus on the keyword-based or primary semantic based service's matching. This paper studies the rules and rule reasoning based service matching algorithm in the background of large scale services library. Firstly, the formal descriptions of semantic web services and service matching is presented. The services' matching are divided into four levels: Exact, Plugin, Subsume and Fail and their formal descriptions are also presented. Then, the service matching is regarded as rule-based reasoning issues. A set of match rules are firstly given and the related services set is retrieved from services ontology base through rule-based reasoning, and their matching levels are determined by distinguishing the relationships between service's I/O and user's request I/O. Finally, the experiment based on two services sets show that the proposed services matching strategy can easily implement the smart service discovery and obtains the high service discovery efficiency in comparison with the traditional global traversal strategy.

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